Search
Search results for: GRAFY ANONIMOWE
-
Równowaga strategiczna dla zbiorów defensywnych w drzewach
PublicationW 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...
-
Modeling, run-time optimization and execution of distributed workflow applications in the JEE-based BeesyCluster environment
PublicationArtykuł 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...
-
Synthesis and electronic properties of B-doped single wall carbon nanotubes
Publication -
Koncert Magia Fortepianu
EventsPrawykonanie utworu "Ad Astra" na cztery ręce na fortepian i orkiestrę smyczkową.
-
A High-Efficient Measurement System With Optimization Feature for Prototype CMOS Image Sensors
PublicationIn 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...
-
An image processing approach for fatigue crack identification in cellulose acetate replicas
PublicationThe cellulose acetate replication technique is an important method for studying material fatigue. However, extracting accurate information from pictures of cellulose replicas poses challenges because of distortions and numerous artifacts. This paper presents an image processing procedure for effective fatigue crack identification in plastic replicas. The approach employs thresholding, adaptive Gaussian thresholding, and Otsu binarization...
-
Recurrence times in the Morse sets for a two-dimensional discrete neuron model (low resolution)
Open Research DataThis 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.
-
Hypertension is associated with dysfunction of both peripheral and central auditory system
Publication -
Generalised heart rate statistics reveal neurally mediated homeostasis transients
PublicationDistributions 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...
-
Asocjacje – jak gdyby, tak jakby…
PublicationKrzysztof Wróblewski prezentuje „In Touch / Anonymous”. (Twarz – jako maska, dłoń – jako dotyk i ślad) – dwa obrazy (olej na płótnie, wymiary: 146x228 cm) wraz z komentarzem: „W kuratorskim tekście do wystawy Asocjacje – jak gdyby, tak jakby zainteresował mnie cytat z teorii umysłu: jesteśmy świadomi umysłów innych ludzi i to ma wpływ na nasze poczynania i procesy umysłowe. Sztuka jako jedno z narzędzi komunikacji jest wysyłaniem...
-
Poszukiwanie nowych leków immunosupresyjnych (Quest for new immunosuppressive drugs)
PublicationTransplantology 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...
-
Synthetic Principles Determining Local Organization of Copolyesters Prepared from Lactones and Macrolactones
PublicationA highly effective and facile technique for catalytic ring-opening copolymerization (cROP) of lactones viz. ε- caprolactone and ε-decalactone with ω-pentadecalactone is being described. The reactions were mediated by Zn- and Cabased tridentate Schiff base complexes and benzyl alcohol as initiator. The catalysts were successfully employed for the preparation of numerous block and random copolymers. To unravel the composition of...
-
Cognitive Dysfunction in Type 1 Diabetes Mellitus
Publication -
Compensatory functional reorganization may precede hypertension-related brain damage and cognitive decline
Publication -
Algoritmically improved microwave radar monitors breathing more acurrate than sensorized belt
PublicationThis paper describes a novel way to measure, process, analyze, and compare respiratory signals acquired by two types of devices: a wearable sensorized belt and a microwave radar-based sensor. Both devices provide breathing rate readouts. First, the background research is presented. Then, the underlying principles and working parameters of the microwave radar-based sensor, a contactless device for monitoring breathing, are described....
-
Elimination of metal catalyst and carbon-like impurities from single-wall carbon nanotube raw material
Publication -
Efficient production of B-substituted single-wall carbon nanotubes
Publication -
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
Open Research DataAn 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
Open Research DataAn 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
Open Research DataAn 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
Open Research DataAn 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
Open Research DataAn 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...
-
A collection of directed graphs for the minimum cycle mean weight computation
Open Research DataThis 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
Open Research DataThe 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.,...
-
Stochastic intervals for the family of quadratic maps
Open Research DataNumerical 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
Open Research DataThe 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
Open Research DataThe 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
Open Research DataThe 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 being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor 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)
Open Research DataFor 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)
Open Research DataFor 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)
Open Research DataFor 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...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Open Research DataFor 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)
Open Research DataFor 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).
Open Research DataFor 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)...
-
Estimates for minimal number of periodic points for smooth self-maps of simply-connected manifolds
Open Research DataWe 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...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Open Research DataFor 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)
Open Research DataFor 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...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublicationW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych - każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublicationW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
Methods for design of the camera network topology aimed to re-identification and tracking objects on the basis of behavior modeling with the flow graph
ProjectsProject realized in Department of Multimedia Systems according to UMO-2014/15/N/ST6/04905 agreement from 2015-09-30
-
The phenomenon of HbA1c stability and the risk of hypoglycemia in long-standing type 1 diabetes
Publication -
An optimized system for sensor ontology meta-matching using swarm intelligent algorithm
PublicationIt is beneficial to annotate sensor data with distinct sensor ontologies in order to facilitate interoperability among different sensor systems. However, for this interoperability to be possible, comparable sensor ontologies are required since it is essential to make meaningful links between relevant sensor data. Swarm Intelligent Algorithms (SIAs), namely the Beetle Swarm Optimisation Algorithm (BSO), present a possible answer...
-
Morse decompositions for a two-dimensional discrete neuron model (low resolution)
Open Research DataThis 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.
-
Morse decompositions for a two-dimensional discrete neuron model (limited range)
Open Research DataThis 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.
-
Morse decompositions for a two-dimensional discrete neuron model (full range)
Open Research DataThis 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.
-
Self-healing mechanism of metallopolymers investigated by QM/MM simulations and Raman spectroscopy
PublicationThe thermally induced self-healing mechanisms in metallopolymers based on bisterpyridine complexes of iron(II) sulfate and cadmium(II) bromide, respectively, were studied by means of combined quantum mechanical/molecular mechanical (QM/MM) simulations and Raman spectroscopy. Two possible healing schemes, one based on a decomplexation of the cross-linking complexes and a second one relying on the dissociation of ionic clusters,...
-
Zespołowe projekty badawcze
e-Learning Courses -
Clonal selection in discrete optimization
PublicationW rozprawie zajmujemy się efektywnymi metodami przybliżonego rozwiązywania problemów optymalizacji dyskretnej, a w szczególności algorytmami opartymi na metodzie selekcji klonalnej (SK), należącymi do kategorii sztucznych systemów immunologicznych. Techniki optymalizacji to znaczące pole badań w informatyce, a niektóre ze starszych technik, takie jak algorytmy genetyczne, symulowane wyżarzanie czy przeszukiwanie tabu, stały się...
-
CP2015 – zmodyfikowana metodyka przewidywania hałasu powstającego na parkingach, stacjach paliw, MOP-ach i punktach poboru opłat
PublicationW przypadku przedsięwzięć „mogących zawsze lub potencjalnie znacząco oddziaływać na środowisko” pierwszą decyzją, którą należy uzyskać w ramach procedury inwestycyjnej, jest decyzja o środowiskowych uwarunkowaniach (w skrócie: decyzja środowiskowa, DŚU). Procedura związana z uzyskaniem DŚU została opisana w Ustawie z 3 października 2008 r. o udostępnianiu informacji o środowisku i jego ochronie, udziale społeczeństwa w ochronie...