Search
Filters
total: 1150
filtered: 882
-
Catalog
Chosen catalog filters
Search results for: graph distance metric
-
Minimum order of graphs with given coloring parameters
PublicationA 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
PublicationIn 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
PublicationLet 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
PublicationIn 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
PublicationThis 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
PublicationIn 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
PublicationGiven 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
PublicationThe 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...
-
Using Continuous Integration Techniques in Open Source Projects – An Exploratory Study
PublicationFor 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...
-
Numerical modelling of different airbag folding patterns and their influence on occupant responses in frontal vehicle impact
PublicationThis 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,...
-
Silent Sonar with matched filtration
PublicationRadars 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
PublicationThe 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...
-
2-Coloring number revisited
Publication2-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
PublicationThe 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
PublicationIf 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)....
-
Algorithms for testing security in graphs
PublicationIn 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...
-
A note on total reinforcement in graphs
PublicationIn 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
PublicationThis 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
PublicationOne 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...
-
Internet photogrammetry for inspection of seaports
PublicationThis 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...
-
Person Tracking in Ultra-Wide Band Hybrid Localization System Using Reduced Number of Reference Nodes
PublicationIn 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....
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne 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
PublicationFor 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
PublicationAn 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
PublicationEvery 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
PublicationThis 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...
-
The Maslov index and the spectral flow—revisited
PublicationWe give an elementary proof of a celebrated theorem of Cappell, Lee and Miller which relates the Maslov index of a pair of paths of Lagrangian subspaces to the spectral flow of an associated path of self-adjoint first-order operators. We particularly pay attention to the continuity of the latter path of operators, where we consider the gap-metric on the set of all closed operators on a Hilbert space. Finally, we obtain from Cappell,...
-
Localization of sound sources with dual acoustic vector sensor
PublicationThe 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...
-
Shipping Low Frequency Noise and Its Propagation in Shallow Water
PublicationOne 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....
-
Bounds on the cover time of parallel rotor walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
On-line ranking of split graphs
PublicationA 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...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
Electromagnetic Field Associated With Dermoscope Magnets May Affect the Safety of Cardiac Implanted Electronic Devices Patients
PublicationDermoscopy is currently used as an auxiliary tool in general dermatology. Since some commercially available dermoscopes have built-in magnets, electromagnetic interference (EMI) may occur when examining cardiac implantable electronic devices (CIED) patients. The aim of the study was to create maps of electromagnetic fields defining a safe distance in terms of EMI. The study was performed in laboratory conditions using measuring...
-
Wordventure - cooperative wordnet editor. Architecture for lexical semantic aquisition
PublicationThis article presents architecture for acquiring lexical semanticsin a collaborative approach paradigm. The system enablesfunctionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation.It has been used for semantic network presentation,and brings simultaneously modification functionality.
-
Analyzing sets of phylogenetic trees using metrics
PublicationThe reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetictrees...
-
Melody Harmonization with Interpolated Probabilistic Models
PublicationMost melody harmonization systems use the generative hidden Markov model (HMM), which model the relation between the hidden chords and the observed melody. Relations to other variables, such as the tonality or the metric structure, are handled by training multiple HMMs or are ignored. In this paper, we propose a discriminative means of combining multiple probabilistic models of various musical variables by means of model interpolation....
-
Abdominal Aortic Aneurysm segmentation from contrast-enhanced computed tomography angiography using deep convolutional networks
PublicationOne of the most common imaging methods for diagnosing an abdominal aortic aneurysm, and an endoleak detection is computed tomography angiography. In this paper, we address the problem of aorta and thrombus semantic segmentation, what is a mandatory step to estimate aortic aneurysm diameter. Three end-to-end convolutional neural networks were trained and evaluated. Finally, we proposed an ensemble of deep neural networks with underlying...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Noise effect on parameters of quiet sonar with code modulation
PublicationEarlier publications of the paper authors have shown that the use of code keying mixed with the CW FM sound signal allows the significant reduction in the distance measurement error, compared to classic silent CW FM sonar. In addition to the code modulation parameters, the magnitude of this error is influenced by the received input acoustic noise. The article shows the dependence of the input signal-to-noise ratio and the sound...
-
SPATIAL APPROACH TO HETEROGENEITY OF INFLATION EXPECTATIONS IN THE EURO AREA
PublicationIn this article, we examine the spatial heterogeneities in inflation expectations of the euro area consumers. We expect to find them heterogeneous in our research period of 2001-2016. Contrary to standard examination of heterogeneity, a spatial correlation analysis is applied by referring to global and local correlation measures. It is performed with the economic distance-based weights (the difference in HICP rates). Application...
-
WordVenture - COOPERATIVE WordNet EDITOR Architecture for Lexical Semantic Acquisition
PublicationThis article presents architecture for acquiring lexical semantics in a collaborative approach paradigm. The system enables functionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation. It has been used for semantic network presentation, and brings simultaneously modification functionality.
-
Distributed NVRAM Cache – Optimization and Evaluation with Power of Adjacency Matrix
PublicationIn this paper we build on our previously proposed MPI I/O NVRAM distributed cache for high performance computing. In each cluster node it incorporates NVRAMs which are used as an intermediate cache layer between an application and a file for fast read/write operations supported through wrappers of MPI I/O functions. In this paper we propose optimizations of the solution including handling of write requests with a synchronous mode,...
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublicationIn this paper, a systematic approach to an extensive search for topologies of cross-coupled filters with generalized Chebyshev response is presented. The technique applies graph theory to find unique, nonisomorphic filter configurations, and tests whether a specific frequency response can be realized in a given set of topologies. The results of the search are then stored in a database of possible filter configurations.
-
Continuous wave sonar with hyperbolic frequency modulation keyed by pseudo-random sequence
PublicationA CW FM type sounding signal is used in the classical solution of silent sonar. While the signal provides a relatively simple implementation of digital signal processing, and ensures good detection conditions, unfortunately, in the presence of the Doppler effect, distance measurement results tend to be wrong. This is due to the fact that the received signal’s instantaneous frequency value is dependent both on the distance to the...
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Mechanical Properties and Wear Susceptibility Determined by Nanoindentation Technique of Ti13Nb13Zr Titanium Alloy after “Direct Laser Writing”
PublicationLaser treatment has often been applied to rebuild the surface layer of titanium and its alloys destined for long-term implants. Such treatment has always been associated with forming melted and re-solidified thin surface layers. The process parameters of such laser treatment can be different, including the patterning of a surface by so-called direct writing. In this research, pulse laser treatment was performed on the Ti13Nb13Zr...
-
Physical crosslinking of hyaluronic acid in the presence of phospholipids in an aqueous nano-environment
PublicationHyaluronic acid and phospholipids are two components in the synovial joint cavity that contribute to joint lubrication synergistically. Molecular dynamics simulations were performed and hydrogen bonds in hyaluronic acid were analyzed to identify specific sites that are responsible for its physical cross-linking. Two molecular masses of hyaluronic acid, 10 kDa and 160 kDa, were considered. We use molecular dynamics simulations and...