Filtry
wszystkich: 1153
-
Katalog
- Publikacje 884 wyników po odfiltrowaniu
- Czasopisma 16 wyników po odfiltrowaniu
- Konferencje 16 wyników po odfiltrowaniu
- Osoby 10 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 6 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 219 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: graph distance metric
-
Examination of the factors influencing binaural rendering on headphones with the use of directivity patterns
PublikacjaThis paper presents a study on the influence of the directional sound sources with the use of the directivity patterns. This contribution also includes a comparison to the work done by Wendt et al., where several directivity pattern designs used to gradually control the auditory source distance in a room were showed. While the tests of Wendt et al. were done by auralizing source and room using a loudspeaker ring in an anechoic...
-
A Wideband Channel Model for Body Area Networks in Circular Metallic Indoor Environments
PublikacjaIn this paper, the wideband characterization of the propagation channel in circular metallic indoor environments is addressed, regarding Body Area Networks and 5G small cells, an analytical model for the dependence of the mean delay and the average delay spread on the circle radius, the working frequency and the distance between the transmitter and the receiver being proposed. The derivation of the model is initially done analytically,...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublikacjaIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Earthquake–induced pounding on response of adjacent structures in series: experimental and numerical study
PublikacjaPounding between structures in series during earthquakes may cause serious damage in the structur-al elements. The aim of this paper is to show the results of an experimental and numerical study that is focused on pounding between more than two structures which may be called "structures in series". In this study, the shaking table experiments, as well as the numerical analyses, were performed using three tower models including...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Towards increasing F-measure of approximate string matching in O(1) complexity
PublikacjaThe paper analyzes existing approaches for approximate string matching based on linear search with Levenshtein distance, AllScan and CPMerge algorithms using cosine, Jaccard and Dice distance measures. The methods are presented and compared to our approach that improves indexing time using Locally Sensitive Hashing. Advantages and drawbacks of the methods are identified based on theoretical considerations as well as empirical evaluations...
-
Conley-Morse graphs for a two-patch vaccination model
Dane BadawczeThis dataset contains selected results of rigorous numerical computations described in Section 5 of the paper "Rich bifurcation structure in a two-patch vaccination model" by D.H. Knipl, P. Pilarczyk, G. Röst, published in SIAM Journal on Applied Dynamical Systems (SIADS), Vol. 14, No. 2 (2015), pp. 980–1017, doi: 10.1137/140993934.
-
Multi-level Virtualization and Its Impact on System Performance in Cloud Computing
PublikacjaThe results of benchmarking tests of multi-level virtualized environments are presented. There is analysed the performance impact of hardware virtualization, container-type isolation and programming level abstraction. The comparison is made on the basis of a proposed score metric that allows you to compare different aspects of performance. There is general performance (CPU and memory), networking, disk operations and application-like...
-
Non-isolating 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 non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Non-isolating bondage in graphs
PublikacjaA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Modelling and analysis of beam/bar structure by application of bond graphs
PublikacjaThe paper presents an uniform, port-based approach to modelling of beam/bar systems (trusses). Port-based model of such distributed parameter system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The constructed computational package enables the frequency...
-
Analysis of Accuracy of Modified Gradient Method in Indoor Radiolocalisation System
PublikacjaIn this paper a new method, called modified gradient method, has been proposed for position calculation on the basis of distance measurement in indoor environment. It is shown that well known method of position calculation such as Foy is inefficient in indoor environment. In this article is also described the indoor radiolocalisation system which was used for collecting distance measurements which were employed for further comparative...
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Evaluation the P-Delta Effect on Collapse Capacity of Adjacent Structures Subjected to Far-field Ground Motions
PublikacjaIn urban areas, adjacent structures can be seen in any insufficient distance from each other, because of economic reasons and refusal of acquired minimum separation distance according to seismic previsions. Collapse capacity assessment of structures is one of the important objectives of performance-based seismic engineering. The purpose of this study is to consider the pounding phenomenon and P-Delta effect in seismic collapse...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
A novel concept for tissue-metal detection and differentiation using an inductive proximity sensor
PublikacjaIn this paper a novel application of inductive proximity sensors for detection of living tissue by means of measurements of the coil impedance changes at different frequencies is described. The mathematical analyses utilizing Bessel function estimation include detected object size and its distance from a sensor. The main aim of this study is to prove the possibility of distinguishing between metal objects and living tissues. The...
-
Similarity Measures for Face Images: An Experimental Study
PublikacjaThis work describes experiments aimed at finding a straightforward but effective way of comparing face images.We discuss properties of the basic concepts, such as the Euclidean, cosine and correlation metrics, test the simplest version of elastic templates, and compare these solutions with distances based on texture descriptors (Local Ternary Patterns). The influence of selected image processing methods (e.g. bilateral ltering)...
-
Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs
PublikacjaIn the following paper it will be presented a new model for analysis (in polynomial time) of the effectiveness of the guard systems. Therewill be presented its practical applications in problems such as searching for the weakest points of the system, planning guards' paths or cameras deployment, switching image from multiple cameras on several monitors, or interception of the intruder. This model is based on describing the guarded...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
The complexity of bicriteria tree-depth
PublikacjaThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Numerical modelling of different airbag folding patterns and their influence on occupant responses in frontal vehicle impact
PublikacjaThis paper presented a procedure for airbag folding for the application in occupant safety studies and analysed the influence of different airbag folding patterns on the occupant severity in frontal impact. Airbags were folded in two patterns: zig-zag and top-roll, using two folding techniques: Initial Metric Method and Explicit Folding. The explicit folding was found to be more expensive in terms of preparation time. However,...
-
Using Continuous Integration Techniques in Open Source Projects – An Exploratory Study
PublikacjaFor a growing number of software projects, continuous integration (CI) techniques are becoming an essential part of the process. However, the maturity of their adoption in open source projects varies. In this paper, we present an empirical study on GitHub repositories to explore the use of continuous integration techniques in open source projects. Following the Goal-Question-Metric (GQM) approach, 3 research questions and 7 metrics...
-
Silent Sonar with matched filtration
PublikacjaRadars with continuous wave frequency (CW FM sonars) are used in radiolocation as 'silent sonars'. They determine the distance to target by measuring the difference between the frequency of the sounding signal and echo signal. The article presents the principle of operation and parameters of silent CW FM sonars. Target distance determined by these sonars is based on the signal at the output of the matched filter. The Doppler effect...
-
Non-Contact Temperature Measurements Dataset
PublikacjaThe dataset titled The influence of the distance of the pyrometer from the surface of the radiating object on the accuracy of measurements contains temperature measurements using a selection of four commercially available pyrometers (CHY 314P, TM-F03B, TFA 31.1125 and AB-8855) as a function of the measuring distance. The dataset allows a comparison of the accuracy and measuring precision of the devices, which are very important...
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Isolation Number versus Domination Number of Trees
PublikacjaIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Accuracy of the discrete Green's function computations
PublikacjaThis paper discusses the accuracy of the discrete Green's function (DGF) computations. Recently closed-form expression of the DGF and its efficient numerical implementation were presented which facilitate the DGF applications in FDTD simulations of radiation and scattering problems. By carefully comparing the DGF results to those of the FDTD simulation, one can make conclusions about the range of the applicability of the DGF for...
-
Monitoring of the Process of System Information Broadcasting in Time
PublikacjaOne of the problems of quantum physics is how a measurement turns quantum, noncopyable data, towards copyable classical knowledge. We use the quantum state discrimination in a central system model to show how its evolution leads to the broadcasting of the information, and how orthogonalization and decoherence factors allow us to monitor the distance of the state in question to the one perfectly broadcasting information, in any...
-
Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
Konferencje -
Person Tracking in Ultra-Wide Band Hybrid Localization System Using Reduced Number of Reference Nodes
PublikacjaIn this article a novel method of positional data integration in an indoor hybrid localization system combining inertial navigation with radio distance measurements is presented. A point of interest is the situation when the positional data and the radio distance measurements are obtained from less than thee reference nodes and it is impossible to unambiguously localize the moving person due to undetermined set of positional equations....
-
Internet photogrammetry for inspection of seaports
PublikacjaThis paper intends to point out the possibility of using Internet photogrammetry to construct 3D models from the images obtained by means of UAVs (Unmanned Aerial Vehicles). The solutions may be useful for the inspection of ports as to the content of cargo, transport safety or the assessment of the technical infrastructure of port and quays. The solution can be a complement to measurements made by using laser scanning and traditional...
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublikacjaOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Pedestrian Safety in Road Traffic in Poland
PublikacjaEvery third road accident in Poland involves a pedestrian as a participant or, most of the time, a casualty. Pedestrian accidents are usually the result of complex situations and the outcome of a number of factors related to driver and pedestrian behaviour and road infrastructure. Safety depends largely on how well the traffic condition is perceived and on visibility in traffic. The paper presents the results of analyses of methodologies...
-
Performance analysis of power swing blocking feature in ABB 670 series impedance relays
PublikacjaThis paper presents test results of a distance protection’s PSD power swing detection feature in ABB 670 series relays. A RED670 relay was tested, which is part of the hydroelectric set protection in Żarnowiec Pumped Storage Plant. The power swing blocking feature’s performance was analysed on the basis of the results of object tests made with an Omicron digital tester. Also presented are simulation results that illustrate the...
-
Shipping Low Frequency Noise and Its Propagation in Shallow Water
PublikacjaOne of the most significant factor influencing acoustical climate of the sea is underwater noise generated by moving ships. If the considered sea area has features of the shallow water, namely the wave frequency fulfils relation f < 10c/h, where c denotes phase speed of sound, and h is depths of the sea, then in certain distance from the wave source specific image of sound pressure distribution in the mean of wave modes appears....
-
Localization of sound sources with dual acoustic vector sensor
PublikacjaThe aim of the work is to estimate the position of sound sources. The proposed method uses a setup of two acoustic vector sensors (AVS). The intersection of azimuth rays from each AVS should indicate the position of a source. In practice, the result of position estimation using this method is an area rather than a point. This is a result of inaccuracy of the individual sensors, but more importantly, of the influence of a source...
-
Conley-Morse graphs for a population model with harvesting. Case He-S1: Equal harvesting of juveniles and adults, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case Hj-Se: Harvesting juveniles only, equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case He-Se: Equal harvesting and equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case Hj-S1: Harvesting juveniles only, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case Ha-S1: Harvesting adults only, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.