Wyszukiwarka
Filtry
wszystkich: 2933
wybranych: 2202
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SCATTERING NUMBER, MATCHING NUMBER
-
Resonant and nonresonant excitation of waves in a planar magnetosonic flow
PublikacjaForced propagation of perturbations in a magnetosonic wave are considered. The driving force may be caused by stimulated Mandelstam–Brillouin scattering of optic waves or by intense magnetosonic exciter. Some heating-cooling function which takes into account radiative cooling and unspecified heating is taken into consideration, as well as nonlinearity of a medium. Both these factors make the excitation particular. The analytical...
-
Electron collisions with cyanoacetylene HC3N : Vibrational excitation and dissociative electron attachment
PublikacjaWe experimentally probe electron collisions with HC3N in the energy range from 0 to 10 eV with the focus on vibrational excitation and dissociative electron attachment. The vibrational excitation cross sections show a number of resonances which are mode specific: the two dominant π∗ resonances are visible in the excitation of all the vibrational modes; however, broad σ ∗ resonances are visible only in certain bond-stretching vibrational...
-
Towards a classification of networks with asymmetric inputs
PublikacjaCoupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart et al (2003 SIAM J. Appl. Dyn. Syst. 2, 609–646), Golubitsky et al (2005 SIAM J. Appl. Dyn. Syst. 4, 78–100) and Field (2004 Dyn. Syst. 19, 217–243). It is known that two non-isomorphic n-cell coupled networks can determine the same sets of...
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
The methodology of design of satellite working mechanism of positive displacement machine
PublikacjaIn this paper is described a methodology of design of satellite mechanism consisting of two noncircular gears (externally toothed rotor and internally toothed curvature) and circular gears (satellites). In the presented methodology is assumed that the rotor pitch line is known, and the curvature pitch line is necessary to designate. The presented methodology applies to mechanisms for which the number of the curvature humps is at...
-
Theoretical analysis of a new approach to order determination for a modified Prony method in swath mapping application
PublikacjaThis article presents a new approach to determine the model order (number of principal components) in the modified Prony method applied to swath acoustic mapping. Determination of the number of principal components is a crucial step in the modified Prony method. In the proposed approach the model order is chosen based on the underlying physical model of the underwater acoustic environment, and utilised signal processing operations....
-
Development of a tropical disease diagnosis system using artificial neural network and GIS
PublikacjaExpert systems for diagnosis of tropical diseases have been developed and implemented for over a decade with varying degrees of success. While the recent introduction of artificial neural networks has helped to improve the diagnosis accuracy of such systems, this aspect is still negatively affected by the number of supported diseases. A large number of supported diseases usually corresponds to a high number of overlapping symptoms,...
-
CIVILIZING THE PUBLIC PARTICIPATION PRACTICE IN POST-TRANSITION COUNTRIES
PublikacjaThe phenomenon of public participation is not so new to both planning theory and practice. In fact, involving local community in the decision-making process regarding local urban development directions is widely discussed and a number of various forms of these are being introduced. This paper deals with a number of
-
DATA JOURNALS AND DATA PAPERS IN VARIOUS RESEARCH AREAS AND SCIENTIFIC DISCIPLINES – BIBLIOMETRIC ANALYSIS BASED ON INCITES
PublikacjaThe main aim of this work is to provide insight into a bibliometric analysis of Data Journals and Data Papers in terms of research areas, disciplines, publication year and country. In particular, we calculated many bibliometric indicators, especially: the number of publications and citations. Furthermore, this work also investigated the top 20 journals in which scientists published the largest number of Data Papers. It was found...
-
Impact of Temperature and Nanoparticle Concentration on Turbulent Forced Convective Heat Transfer of Nanofluids
PublikacjaTheoretical analysis of the influence of nanoparticles and temperature on the average Nusselt (Nu) number and the average heat transfer coefficient (HTC) during the turbulent flow of nanofluid in a horizontal, round tube was carried out. The Nu number is a function of the Reynolds (Re) number and the Prandtl (Pr) number, which in turn are functions of the thermophysical properties of the liquid and the flow conditions. On the other...
-
Emission of 1.3–10 nm airborne particles from brake materials
PublikacjaOperation of transport vehicle brakes makes a significant contribution to airborne particulate matter in urban areas, which is subject of numerous studies due to the environmental concerns. We investigated the presence and number fractions of 1.3–10 nm airborne particles emitted from a low-metallic car brake material (LM), a non-asbestos organic car brake material (NAO) and a train brake cast iron against a cast iron. Particles...
-
Equitable colorings of some variation of corona products of cubic graphs
PublikacjaThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Micellar aggregation of Triton X-100 surfactant in imidazolium ionic liquids
PublikacjaIn this work we investigated aggregation behavior of a nonionic surfactant Triton X-100 in eighteen imidazolium ionic liquids (ILs) with two to eight carbon atoms in cations alkyl chain, namely 1-ethyl-3-methylimidazolium, [EMIM], 1-butyl-3-methylimidazolium, [PrMIM], 3-methyl-1-propylimidazolium, [BMIM], 1-hexyl-3-methylimidazolium, [PMIM], 3-methyl-1-pentyl-imidazolium, [HMIM], and 1-octyl-3-methylimidazolium, [OMIM], and with...
-
Study of Non-Newtonian biomagnetic blood flow in a stenosed bifurcated artery having elastic walls
PublikacjaFluid structure interaction (FSI) gained attention of researchers and scientist due to its applications in science felds like biomedical engineering, mechanical engineering etc. One of the major application in FSI is to study elastic wall behavior of stenotic arteries. In this paper we discussed an incompressible Non-Newtonian blood fow analysis in an elastic bifurcated artery. A magnetic feld is applied along x direction. For...
-
Preliminary Identification of Quantitative Factors Determining the Duration of Court Proceedings in Commercial Cases
PublikacjaPurpose: The aim of the article was to identify factors that are linear combinations of the variables under scrutiny that affect the duration of court proceedings. Design/Methodology/Approach: This research was conducted on commercial cases, based on the Principal Components Analysis (PCA). The original variables were grouped into factors that are correlated with each other. The Kaiser Criterion (own value >1) was chosen as the...
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublikacjaThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Preserving Trees in Automata
PublikacjaWe present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Local-Global Space Mapping for Rapid EM-Driven Design of Compact RF Structures
PublikacjaIn this work, we introduce a robust and efficient technique for rapid design of compact RF circuits. Our approach exploits two-level space mapping (SM) correction of an equivalent circuit model of the structure under design. The first SM layer (local correction) is utilized to ensure good matching between the equivalent circuit and the electromagnetic model at the component level. On the other hand, the global correction allows...
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
2-bondage in graphs
PublikacjaA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublikacjaIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Free Convection Heat Transfer from Horizontal Cylinders
PublikacjaThe results of experimental investigation of free convection heat transfer in a rectangular container are presented. The ability of the commonly accepted correlation equations to reproduce present experimental data was tested as well. It was assumed that the examined geometry fulfils the requirement of no-interaction between heated cylinder and bounded surfaces. In order to check this assumption recently published correlation equations...
-
THREE-DIMENSIONAL numerical investigation of MHD nanofluid convective heat transfer inside a CUBIC porous container with corrugated bottom wall
PublikacjaSimultaneous use of porous media and nanofluid as a heat transfer improvement method has recently captivated a great deal of attention. The heat transfer and entropy production of the Cu-water nanofluid inside a cubic container with a heated bottom wavy wall and an elliptic inner cylinder were numerically analyzed in this study. The container is partitioned into two sections: the left side is filled with permeable media and...
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Implementation of discrete convolution using polynomial residue representation
PublikacjaConvolution is one of the main algorithms performed in the digital signal processing. The algorithm is similar to polynomial multiplication and very intensive computationally. This paper presents a new convolution algorithm based on the Polynomial Residue Number System (PRNS). The use of the PRNS allows to decompose the computation problem and thereby reduce the number of multiplications. The algorithm has been implemented in Xilinx...
-
STARZEJĄCY SIĘ PRZEDSIĘBIORCA W POLSCE I NA ŚWIECIE
PublikacjaPoniższy artykuł wskazuje na rosnącą liczbę przedsiębiorców w wieku okołoemerytalnym, tak w krajach europejskich, w tym w Polsce, jak i w USA. Wzrost ten wynika zarówno z rosnącej liczby osób w tej grupie wiekowej, które zakładają swoje firmy, jak i z rosnącej liczby osób, które prowadząc od wielu lat swoje firmy, nie zamierzają przejść na emeryturę. Z nielicznych badań wśród osób starszych prowadzących własne firmy wynika, że...
-
Micelle formation of Tween 20 nonionic surfactant in imidazolium ionic liquids
PublikacjaAggregation behavior of polyoxyethylene (POE)-type nonionic surfactant Tween 20 in imidazolium ionic liquids with varying chain length and different anions, such as tetrafluoroborate, hexafluorophosphate, bis(trifluoromethanesulfonyl)imide, and trifluoromethanesulfonate, was investigated by means of surface tension, conductivity and dynamic light scattering measurements. The role of the chain length, anion size as well as interactions...
-
Thermal visualization of Ostwald-de Waele liquid in wavy trapezoidal cavity: Effect of undulation and amplitude
PublikacjaThe present study is concerned with the numerical simulations of Ostwald-de Waele fluid flow in a wavy trapezoidal cavity in the presence of a heated cylinder situated at the center of the cavity. The work consists in characterizing the mixed convection as a function of the intensity of heat flow. The flow behaviour and temperature distribution in a cavity are the main focus of this study. The lower wall of the cavity is fixed...
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
VIBRATION PARAMETERS FOR DAMAGE DETECTION IN STRUCTURES
PublikacjaThe aim of this paper is to examine how damage indicators are sensitive to changing number of frequencies and mode shapes and also to number and location of measurement points. The influence of measurement errors was also analyzed for all cases. For the analysis, those damage indicators are chosen which use changes in such modal parameters as natural frequencies and mode shapes and also differences between the curvatures of the damaged...
-
Promocja zasobów Pomorskiej Biblioteki Cyfrowej na przykładzie XVIII-wiecznego rękopisu
PublikacjaCelem artykułu jest przedstawienie sposobu udostępniania i promocji zbiorów rękopiśmiennych na przykładzie XVIII-wiecznego rękopisu Christiana Gabriela Fishera dostępnego w Pomorskiej Bibliotece Cyfrowej (dalej: PBC). Rękopis ten stał się inspiracją do podjęcia współpracy Biblioteki Politechniki Gdańskiej oraz Instytutu Kultury Miejskiej w Gdańsku. Dzięki wspólnej inicjatywie rozpoczęto prace nad transkrypcją niemieckiego tekstu...
-
Conditions for Multiple Acquisition of Echoes from Stationary Targets in Successive Transmissions of Active Sonars
PublikacjaIn echolocation, the highest possible number of contacts with a detected target is clearly decisive on the possibilities of echo processing to optimise the estimation of distinctive characteristics of the observed target. In hydrolocation, the slow propagation of acoustic waves in water reduces the number of contacts of echosounders and sonars with detected targets. The article considers model conditions for acquiring multiple...
-
Damage detection in plates based on Lamb wavefront shape reconstruction
PublikacjaMany of the current studies in the area of damage detection using elastic wave propagation are based on deploying sensor networks with a large number of piezoelectric transducers to detect small-size cracks. A major limitation of these studies is that cracks are usually larger and have different shapes in real cases. Moreover, using a large number of sensing nodes for damage detection is both costly and computationally intensive....
-
Three-dimensional numerical investigation of hybrid nanofluids in chain microchannel under electrohydrodynamic actuator
PublikacjaEnergy efficiency enhancement methods have received considerable attentionwithin the industry and scientific community, owing to the rising concern ofglobal energy sustainability. The present article attempts to scrutinize the effectsof electrohydrodynamics and nanofluids on the rate of heat transfer and fluidflow in the 3-D chain microchannels. Improved heat exchangers (e.g., chainmicrochannel) would have a key role in increasing...
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublikacjaIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
Rozwój polskiego winiarstwa w latach 2000–2017
PublikacjaW artykule przedstawiono historie polskiego winiarstwa. Na podstawie danych zawartych w raportach Agencji Rynku Rolnego przedstawiono kształtowanie się liczby winnic oraz powierzchni upraw winorośli i zbioru winogron w latach 2009–2018. Dane z portalu winogrodnicy.pl posłużyły do scharakteryzowania liczby winnic wraz z ich lokalizacją oraz powierzchnią. Z przeprowadzonej analizy wynika, że polskie winiarstwo od ponad 20 lat przeżywa...
-
Improving depth maps of plants by using a set of five cameras
PublikacjaObtaining high-quality depth maps and disparity maps with the use of a stereo camera is a challenging task for some kinds of objects. The quality of these maps can be improved by taking advantage of a larger number of cameras. The research on the usage of a set of five cameras to obtain disparity maps is presented. The set consists of a central camera and four side cameras. An algorithm for making disparity maps called multiple...
-
An automatic system for identification of random telegraph signal (RTS) noise in noise signals
PublikacjaIn the paper the automatic and universal system for identification of Random Telegraph Signal (RTS) noise as a non-Gaussian component of the inherent noise signal of semiconductor devices is presented. The system for data acquisition and processing is described. Histograms of the instantaneous values of the noise signals are calculated as the basis for analysis of the noise signal to determine the number of local maxima of histograms...
-
Independence in uniform linear triangle-free hypergraphs
PublikacjaThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Market Structure and Market Power in Selected Sectors of The Polish Economy Based on COICOP Classification
PublikacjaThis paper present new and simple measures of market structure and market power. Based on the classical models of market structures, where a given structure is determined by the number of enterprises, indexes of degree of monopoly have been estimated, representing an average number of entities per branch. Additionally, market power indexes have been determined as an average revenue per an enterprise in a given branch. This approach...
-
The Impact of Homogeneity of High Modulus Asphalt Concrete Layer on Low-Temperature Cracking
PublikacjaDuring winter season of 2012 numerous transverse cracks developed in high-modulus asphalt concrete (HMAC) base of newly constructed motorway. Pavement cracked both in transverse joint locations and in the area between them. Research which was conducted during investigation of the causes and mechanisms of cracking consisted of: field examination, laboratory testing of specimens cored out of the existing pavement, computational analyses...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Integration of brood units in game universe
PublikacjaAn access to a great number of various services allows for decomposition of complex problems Developing a game universe usually involves creation of various units which can be encountered by a player. Those can be lonely or organized in broods animals and monsters wandering around the game world. In order to provide natural gaming experience those units should behave variously depending on the world situation. Those behaviours...