Wyszukiwarka
Filtry
wszystkich: 385
-
Katalog
Wyniki wyszukiwania dla: GRAFY DWUDZIELNE
-
The complexity of node blocking for dags
PublikacjaRozważamy następującą grę (pomiędzy dwoma graczami) kombinatoryczną o nazwie ''node blocking''. Dany jest graf skierowany. Każdy wierzchołek może być zajęty przez co najwyżej jeden token. Wyróżniamy dwa kolory tokenów, biały i czarny, każdy gracz może przemieszczać tylko własne tokeny. Gracze wykonują ruchy naprzemiennie. Ruch polega na wyborze dowolnego tokena własnego koloru i przesunięciu go na dowolnego niezajętego przez inny...
-
Quantitative Analysis of Biofilm Formed on Vascular Prostheses by Staphylococcus Epidermidis with Different ica and aap Genetic Status
PublikacjaOBJECTIVES: This study aims to examine biofilm formed on vascular prostheses by Staphylococcus epidermidis with different ica and aap genetic status, and to evaluate the effect of antibiotic-modified prostheses on bacterial colonization. METHODS: Biofilm formation was determined using fluorescence microscopy imaging. Quantitative analysis was conducted using the biofilm coverage ratio (BCR) calculations. RESULTS: Our investigations...
-
Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g tori
Dane BadawczeMorse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that have been carefully studied during past decades. For a given Morse–Smale diffeomorphism one can consider “Minimal set of Lefschetz periods”, which provides the information about the set of periodic points of...
-
Universal Augmentation Schemes for Network Navigability
PublikacjaRozważano problem uzupełniania grafu (reprezentującego np. sieci społeczne) poprzez dodanie w każdym węźle jednego dodatkowego skierowanego połączenia (długodystansowego). Dokładniej, dla każdego węzła definiuje się listę prawdopodobieństw istnienia połączenia wychodzącego z danego węzła do wszystkich pozostałych węzłów; wartości tych prawdopodobieństw muszą sumować się do jedności. Routing zachłanny w takiej sieci polega na przekazywaniu...
-
Fast service restoration under shared protection at lightpath level in survivable WDM mesh grooming networks
PublikacjaW artykule zaproponowano nowe podejście do optymalizacji rozdziału zasobów w przeżywalnych sieciach optycznych z agregacją strumieni ruchu. Zaproponowana metoda bazuje na wierzchołkowym kolorowaniu grafu konfliktów. Jest pierwszym podejściem, dedykowanym sieciom optycznym z agregację strumieni ruchu z pełną zdolnością do konwersji długości fal, która nie powoduje wydłużenia ściezek zabezpieczjących, a więc zapewnia szybkie odtwarzanie...
-
Algorytmy samostabilizujące w sieciach o wybranych topologiach
PublikacjaIdea algorytmów samostabilizujących została zapoczątkowana przez E. Dijkstrę artykułem pt. „Self-stabilizing systems in spite of distributed control” (Communications of the ACM, 1974). W rozprawie został położony nacisk na algorytmy samostabilizujące działające w sieciach o pewnych specyficznych topologiach, jak na przykład w grafach maksymalnych zewnętrznie planarnych, iloczynach kartezjańskich tych grafów ze ścieżkami i w drzewach. Wykorzystując...
-
High meniscal slope angle as a risk factor for meniscal allograft extrusion
PublikacjaA meniscal graft extrusion is still an unresolved problem that affects most patients after a meniscal transplantation. Despite the advances in surgical techniques, together with the improved methods for a meniscal allograft sizing, success is only observed in up to 75% of patients after they experience a meniscal allograft transplantation. Because a meniscal extrusion is associated with a cartilage deterioration and the progression...
-
Analiza ryzyka i zarządzanie bezpieczeństwem funkcjonalnym w instalacjach technicznych
PublikacjaW rozdziale przedstawiono wybrane zagadnienia dotyczące analizy ryzyka i zarządzania bezpieczeństwem funkcjonalnym w cyklu życia w instalacjach technicznych podwyższonego ryzyka w nawiązaniu do odpowiednich norm międzynarodowych i aktualnej literatury przedmiotu. Podkreślono znaczenie definiowania matrycy lub grafu ryzyka w danym systemie technicznym, które odgrywa istotną rolę w określeniu wymaganego poziomu nienaruszalności bezpieczeństwa...
-
Minimal number of periodic points for smooth self-maps of simply-connected manifolds
Dane BadawczeThe problem of finding the minimal number of periodic points in a given class of self-maps of a space is one of the central questions in periodic point theory. We consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant D_r[f] is equal to the minimal number of r-periodic points...
-
Estimation of wastewater treatment plant state for model predictive control of N-P remowal at medium time scale.
PublikacjaPrzy ograniczonych możliwościach pomiarowych estymaty stanu są potrzebne w sterowaniu optymalizującym, opartym na sterowaniu predykcyjnym, sterującym usuwaniem azotu i fosforu, w biologicznej oczyszczalni ścieków. Optymalizator MPC do implementacji sprzężenia zwrotnego z obiektu potrzebuje tych estymat. Dodatkowo aktualizowane muszą być parametry modelu Gray-Box wykorzystywanego w module MPC. Wtedy estymaty stanu są używane przez...
-
A new quaternion-based encryption method for DICOM images
PublikacjaIn this paper, a new quaternion-based lossless encryption technique for digital image and communication on medicine (DICOM) images is proposed. We have scrutinized and slightly modified the concept of the DICOM network to point out the best location for the proposed encryption scheme, which significantly improves speed of DICOM images encryption in comparison with those originally embedded into DICOM advanced encryption standard...
-
Distributed state estimation using a network of asynchronous processing nodes
PublikacjaWe consider the problem of distributed state estimation of continuous-time stochastic processes using a~network of processing nodes. Each node performs measurement and estimation using the Kalman filtering technique, communicates its results to other nodes in the network, and utilizes similar results from the other nodes in its own computations. We assume that the connection graph of the network is not complete, i.e. not all nodes...
-
A new diagnostic IR-thermal imaging method for evaluation of cardiosurgery procedures
PublikacjaTwo methods for monitoring the state of the myocardium during cardiosurgical interventions based on thermal IR imaging are presented below. These methods, called static thermography and active dynamic thermography (ADT), use information about the distribution of temperature on the surface, and an external excitation source to induce thermal transient processes in a tested object. Recording the time series of thermograms allows...
-
IR-THERMAL IMAGING IN CARDIOSURGERY
PublikacjaA method for monitoring the state of the myocardium during cardiosurgical interventions based on thermal IR imaging is presented. These methods called Static Thermography and Active Dynamic Thermography (ADT) uses information about distribution of temperature on the surface and an external excitation source to induce thermal transient processes in a tested object. Recording time series of thermograms allows to calculate parametric...
-
Masked arterial hypertension in a 64-year-old man with primary aldosteronism
Publikacja -
Modeling, run-time optimization and execution of distributed workflow applications in the JEE-based BeesyCluster environment
PublikacjaArtykuł prezentuje kompletne rozwiązanie do modelowania naukowych i biznesowych scenariuszy. statycznego i dynamicznego wyboru usług z uwzględnieniem parametrów jakościowych oraz wykonanie scenariuszy w rzeczywistym środowisku. Scenariusz jest modelowany jako acykliczny graf skierowany, w którym węzły reprezentują zadania zaś krawędzie zależności pomiędzy zadaniami. Warstwa pośrednia BeesyCluster jest wykorzystana do umożliwienia...
-
The maximum edge-disjoint paths problem in complete graphs
PublikacjaRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Studies on the Combined Impact of Starch Source and Multiple Processing on Selected Properties of Thermoplastic Starch/Ethylene-Vinyl Acetate Blends
PublikacjaThermoplastic starch (TPS)/ethylene vinyl acetate (EVA) blends compatibilized with polyethylene-graft-maleic anhydride (PE-g-MA) were prepared from various native starches (potato, maize and waxy maize) and subjected to multiple extrusion cycles. Source of starch has significant impact on its composition, hence properties of obtained TPS and their blends with EVA. Higher content of amylopectin in waxy maize starch, comparing to...
-
Równowaga strategiczna dla zbiorów defensywnych w drzewach
PublikacjaW pracy rozważany jest problem defensywnej równowagi strategicznej dla zbiorów defensywnych w drzewach (spójnych grafach acyklicznych), który polega na znalezieniu dwóch rozłącznych globalnych zbiorów defensywnych. Zagadnienie to znajduje zastosowanie w modelo- waniu problemów komunikacyjnych w sieciach. Dla danego grafu G podzbiór jego wierzchołków S jest zbiorem defensywnym, jeśli dla każdego wierzchołka v należącego do S spełniony...
-
Koncert Magia Fortepianu
WydarzeniaPrawykonanie utworu "Ad Astra" na cztery ręce na fortepian i orkiestrę smyczkową.
-
Heart rate variability and functional outcome in ischemic stroke
Publikacja -
Mining Knowledge of Respiratory Rate Quantification and Abnormal Pattern Prediction
PublikacjaThe described application of granular computing is motivated because cardiovascular disease (CVD) remains a major killer globally. There is increasing evidence that abnormal respiratory patterns might contribute to the development and progression of CVD. Consequently, a method that would support a physician in respiratory pattern evaluation should be developed. Group decision-making, tri-way reasoning, and rough set–based analysis...
-
Recurrence times in the Morse sets for a two-dimensional discrete neuron model (low resolution)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Synthesis and electronic properties of B-doped single wall carbon nanotubes
Publikacja -
A High-Efficient Measurement System With Optimization Feature for Prototype CMOS Image Sensors
PublikacjaIn this paper, a gray-scale CMOS image sensor (CIS) characterization system with an optimization feature has been proposed. By using a very fast and precise control of light intensity, based on the pulsewidth-modulation method, it is avoided to measure the illuminance every time. These features accelerate the multicriteria CIS optimization requiring many thousands of measurements. The system throughput is 2.5 Gb/s, which allows...
-
Metody projektowania topologii sieci kamer do celu re-identyfikacji i śledzenia obiektów w oparciu o modelowanie zachowań za pomocą grafu przepływów
ProjektyProjekt realizowany w Katedra Systemów Multimedialnych zgodnie z porozumieniem UMO-2014/15/N/ST6/04905 z dnia 2015-09-30
-
Hypertension is associated with dysfunction of both peripheral and central auditory system
Publikacja -
Generalised heart rate statistics reveal neurally mediated homeostasis transients
PublikacjaDistributions of accelerations and decelerations, obtained from increments of heart rate recorded during a head-up tilt table (HUTT) test provide short-term characterization of the complex cardiovascular response to a rapid controlled dysregulation of homeostasis. A generalised statistic is proposed for evaluating the neural reflexes responsible for restoring the homeostatic dynamics. An evaluation of the effects on heart rate...
-
Poszukiwanie nowych leków immunosupresyjnych (Quest for new immunosuppressive drugs)
PublikacjaTransplantology is getting more and more important in medicine. Development of surgical techniques and immunosuppressive treatment enabled to establish successful transplantations with various organs and tissues. However, allografts are recognized as foreign tissues and stimulate rejection, i.e. a strong immunological response which, if not stopped, results in complete destruction of the transplanted tissue. In order to prevent...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 4 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 4 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 6 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 6 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 5 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 5 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 8 and homology groups with the sum of ranks less or equal to 10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 8 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 7 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 7 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Dane BadawczeFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Dane BadawczeFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Dane BadawczeFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
A collection of directed graphs for the minimum cycle mean weight computation
Dane BadawczeThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
The values of Block Entropy for individuals with Normal Sinus Rhythm
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 54 patients with normal sinus rhythm (NSR). The original data were taken from PhysioNet Normal Sinus Rhythm RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E., Moody G.B.,...
-
Estimates for minimal number of periodic points for smooth self-maps of simply-connected manifolds
Dane BadawczeWe consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant Dr[f] is equal to the minimal number of r-periodic points in the smooth homotopy class of f. We assume that r is odd and all coefficients b(k) of so-called periodic expansion of Lefschetz numbers of iterations are...
-
Stochastic intervals for the family of quadratic maps
Dane BadawczeNumerical analysis of chaotic dynamics is a challenging task. The one-parameter families of logistic maps and closely related quadratic maps f_a(x)=a-x^2 are well-known examples of such dynamical systems. Determining parameter values that yield stochastic-like dynamics is especially difficult, because although this set has positive Lebesgue measure,...
-
The values of Permutation Entropy for individuals with Normal Sinus Rhythm
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 54 patients with normal sinus rhythm (NSR). The original data were taken from PhysioNet Normal Sinus Rhythm RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E., Moody G.B.,...
-
The values of Block Entropy for patients with Congestive Heart Failure
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 29 patients with congestive heart failure (CHF). The original data were taken from PhysioNet Congestive Heart Failure RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E.,...
-
The values of Permutation Entropy for patients with Congestive Heart Failure
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 29 patients with congestive heart failure (CHF). The original data were taken from PhysioNet Congestive Heart Failure RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E.,...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Dane BadawczeFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...