Filtry
wszystkich: 1164
-
Katalog
- Publikacje 892 wyników po odfiltrowaniu
- Czasopisma 16 wyników po odfiltrowaniu
- Konferencje 16 wyników po odfiltrowaniu
- Osoby 11 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 8 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
-
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.
-
Conley-Morse graphs for a population model with harvesting. Case Ha-Se: Harvesting adults 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.
-
On minimum cost edge searching
PublikacjaWe 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
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...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublikacjaWe 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...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublikacjaThe 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...
-
Bounds on the cover time of parallel rotor walks
PublikacjaThe 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...
-
The Maslov index and the spectral flow—revisited
PublikacjaWe 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,...
-
Electromagnetic Field Associated With Dermoscope Magnets May Affect the Safety of Cardiac Implanted Electronic Devices Patients
PublikacjaDermoscopy 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
PublikacjaThis 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.
-
Molecular geometry of hexachlorobenzene
Dane BadawczePresented data shows molecular geometry of the ground singlet state of hexachlorobenzene and hexachlorobenzene with potassium atom in 10 angstrom distance. The geometry was obtained via MP2 and CCSD calculations using balanced polarized triple-zeta def2-TZVP basis set. Geometry is provided in the XYZ file format.
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe 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...
-
Analyzing sets of phylogenetic trees using metrics
PublikacjaThe 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
PublikacjaMost 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
PublikacjaOne 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...
-
WordVenture - COOPERATIVE WordNet EDITOR Architecture for Lexical Semantic Acquisition
PublikacjaThis 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.
-
SPATIAL APPROACH TO HETEROGENEITY OF INFLATION EXPECTATIONS IN THE EURO AREA
PublikacjaIn 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...
-
Noise effect on parameters of quiet sonar with code modulation
PublikacjaEarlier 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...
-
Turán numbers for odd wheels
PublikacjaThe 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...
-
Distributed NVRAM Cache – Optimization and Evaluation with Power of Adjacency Matrix
PublikacjaIn 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,...
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublikacjaIn 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
PublikacjaA 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
PublikacjaA 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...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Przejazdy kolejowe na modernizowanych i rewitalizowanych liniach kolejowych - przepisy a rzeczywistość
PublikacjaPrzy modernizacji i rewitalizacji dróg szynowych jednym z elementów infrastruktury, wymagającym szczególnej uwagi już na etapie planowania inwestycji, są przejazdy i przejścia w poziomie szyn. Obowiązujące przepisy krajowe pochodzą z lat 90. ubiegłego wieku i w wielu aspektach nie uwzględniają specyfiki najczęściej obecnie występujących na liniach kolejowych inwestycji modernizacyjnych i rewitalizacyjnych. W przypadku linii należących...
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
PublikacjaW artykule rozważamy listowo-kosztowe kolorowanie wierzchołków i krawędzi grafu w modelu wierzchołkowym, krawędziowym, totalnym i pseudototalnym. Stosujemy programowanie dynamiczne w celu otrzymania algorytmów wielomianowych dla drzew. Następnie uogólniamy to podejście na dowolne grafy z ograniczonymi liczbami cyklomatycznymi i na ich multikolorowania.
-
Total outer-connected domination in trees
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublikacjaW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Weakly connected domination subdivision numbers
PublikacjaLiczba podziału krawędzi dla dominowania słabo spójnego to najmniejsza liczba krawędzi jaką należy podzielić, aby wzrosła liczba dominowania słabo wypukłego. W pracy przedstawione są własności liczby podziału krawędzi dla dominowania słabo spójnego dla różnych grafów.
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Publikacja -
Trees with equal restrained domination and total restrained domination numbers
PublikacjaW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
Convex universal fixers
PublikacjaPraca dotyczy dominowania wypukłego w grafach pryzmowych.
-
Domination numbers in graphs with removed edge or set of edges
PublikacjaW artykule przedstawiony jest wpływ usuwania krawędzi lub zbioru krawędzi na liczby dominowania spójnego i słabo spójnego.
-
Physical crosslinking of hyaluronic acid in the presence of phospholipids in an aqueous nano-environment
PublikacjaHyaluronic 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...
-
Mechanical Properties and Wear Susceptibility Determined by Nanoindentation Technique of Ti13Nb13Zr Titanium Alloy after “Direct Laser Writing”
PublikacjaLaser 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...
-
A note on mixed tree coloring
PublikacjaZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublikacjaW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
Network Approach to Increments of RR-intervals for Visualization of Dynamics of Cardiac Regulation
PublikacjaThe transition network for RR -increments is pre- sented in a directed and weighted graph, with vertices represent- ing RR -increments and edges corresponding to the order in a sequence of increments. The adjacency matrix and the transition matrix of this network provide a graphical tool which could be useful in the assessment of cardiac regulation. As an example, the method is applied in detecting differences between diurnal activity...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
EFEKTYWNOŚĆ STOSOWANIA ZDERZAKÓW STYROPIANOWYCH POMIĘDZY ZDERZAJĄCYMI SIĘ KONSTRUKCJAMI STALOWYMI
PublikacjaPodczas wstrząsów sejsmicznych o różnym natężeniu, wielokrotnie obserwowano zjawisko zde-rzania się konstrukcji ze sobą sąsiadujących, co mogło prowadzić nawet do jej całkowitego zniszczenia. Na podstawie obserwacji, badań numeryczny i eksperymentalnych stwierdzono, że przyczyną kolizji jest niedostateczna przerwa pomiędzy konstrukcjami. Ponadto czynnikami, które również mogą doprowadzić do zderzeń są różnice w masach lub sztywnościach...
-
Comparison of new position estimation algorithm for indoor environment
PublikacjaIn the paper a new position estimation algorithm based on distance measurements is presented. This algorithm is dedicated for indoor environments. In the paper the new algorithm is compared with Chan algorithm. For the comparison were used real measurements conducted inside a building.
-
Optimal Components Design for Modified Z-Source Based IPT Approach
PublikacjaThis paper describes components estimation process for IPT approach based on Z-source network. Proposed model covers main parameters of the system and gives efficient way to evaluate optimal parameters for fixed switching frequency and distance.
-
HYDROACOUSTIC NOISE MEASUREMENTS
PublikacjaThe paper deals mainly with investigation of underwater noise that propagation is in shallow water. In this paper has been presented the experimental investigation results concerning the distribution of the sound field pressure generated by moving ships in the shallow water at the small distance from the ship. The main acoustical characteristics describing features of the field are spectrograms in pseudo 3D system – distance and frequency...
-
Verification of Formulas for Periods of Adjacent Buildings Used to Assess Minimum Separation Gap Preventing Structural Pounding during Earthquakes
PublikacjaInsufficient separation distance between adjacent buildings may lead to serious damages during earthquakes due to structural pounding. The best way to prevent collisions is to provide sufficiently large separation distance between the structures. In this paper, the periods of two closely-spaced linear and nonlinear buildings have been investigated so as to accurately assess the minimum in-between separation gap. A new equation...
-
Recognition, understanding and aestheticization of freehand drawing flowcharts
PublikacjaIn this paper a concept of FCA, a system for recognizing, understanding and aestheticization of freehand drawing flow charts is described. The system is based on a proposed by the author FlowGram graph grammar describing flow charts drawing. An open format FlowChartML for flow charts description is also proposed. The aestheticization criterion is formulated that allows for automatic beautification of flow charts. First experiments...
-
On zero-error codes produced by greedy algorithms
PublikacjaWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
Performance comparison of new modified gradient algorithm and Foy algorithm for iterative position calculation
PublikacjaIn the paper a new position calculation algorithm is presented. It is proposed for indoor environments and is called modified gradient algorithm. This algorithm is compared with well-known Foy algorithm. The comparative analysis is based on real distance measurements conducted in indoor environment.