displaying 1000 best results Help
Search results for: SHANNON CAPACITY OF GRAPHS
-
Maximum forces in tendon connections for an anchor with a pin in the full sample experiment
Open Research DataThe main objective of the all study was to assess the load capacity of a new implant device for knotless tendon anastomosis. During this series of experiments the load capacity of the anchoring element with a pin (see figure 1) was examined. Tendons from fresh swine legs (commercially available) served as the biological material. All samples were subjected...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublicationW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
Maximum forces in tendon connections for an anchor without pin in the single-side sample experiment
Open Research DataThe main objective of the all study was to assess the load capacity of a new implant device for knotless tendon anastomosis. During this series of experiments the load capacity of the anchoring element without a pin (see figure 1) was examined. Tendons from fresh swine legs (commercially available) served as the biological material. All samples were...
-
Maximum forces in tendon connections for an anchor with pin in the single-side sample experiment
Open Research DataThe main objective of the all study was to assess the load capacity of a new implant device for knotless tendon anastomosis. During this series of experiments the load capacity of the anchoring element with a pin (see figure 1) was examined. Tendons from fresh swine legs (commercially available) served as the biological material. All samples were subjected...
-
Maximum forces in tendon connections for the Kessler suture in the single-side sample experiment
Open Research DataThe main objective of the all study was to assess the load capacity of a new implant device for knotless tendon anastomosis. During this series of experiments the load capacity of the traditional two-strand Kessler sutures (3-0 sutures) was examined. Tendons from fresh swine legs (commercially available) served as the biological material. All samples...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
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.
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
Joanna Bach-Głowińska dr inż. arch.
PeopleI am an architect by education (M.Sc. Arch 1994) and practice (1994-2011), a Town Planner by practice (1999-2017, Ministerial Entitlements 1655/2002), and a Researcher (Ph.D.2012, Postdoctoral Research Fellow at Glasgow School of Art 2013 - 2015, also teaching on Gdansk University of Technology since 2014). I have been the Principal Investigator of Era Net Urban Transformation Capacities EmbedterLabs: Better Embedded Labs for More...
-
Relations between the domination parameters and the chromatic index of a graph
PublicationIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
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.
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublicationSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
The complexity of minimum-length path decompositions
PublicationWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Directed percolation effects emerging from superadditivity of quantum networks
PublicationEntanglement-induced nonadditivity of classical communication capacity in networks consisting of quantum channels is considered. Communication lattices consisting of butterfly-type entanglement-breaking channels augmented, with some probability, by identity channels are analyzed. The capacity superadditivity in the network is manifested in directed correlated bond percolation which we consider in two flavors: simply directed and...
-
Properties of the triset metric for phylogenetic trees
Publicationthe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
Łukasz Szeremeta
PeopleMy current research areas are issues related to the Property Graphs, Cheminformatics and Semantic Web. I am also interested in the latest applications of Artificial Intelligence.
-
Flood Classification in a Natural Wetland for Early Spring Conditions Using Various Polarimetric SAR Methods
PublicationAbstract--- One of the major limitations of remote sensing flood detection is the presence of vegetation. Our study focuses on a flood classification using Radarsat-2 Quad-Pol data in a natural floodplain during leafless, dry vegetation (early spring) state. We conducted a supervised classification of a data set composed of nine polarimetric decompositions and Shannon entropy followed by the predictors' importance estimation to...
-
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ą...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
TG and DTG profiles for plastics: LDPE, HDPE, PP, PD and PET
Open Research DataThe dataset includes:
-
Polynomial triset metric for unrooted phylogenetic trees
Publicationthe following paper presents a polynomial triset metric for unrooted phylogenetic trees (based on weighted bipartite graphs and the method of determining a minimum edge cover) and its basic characteristics. also a list of further directions of research and examples of the wider use of this metric is presented.
-
The Complexity of Zero-Visibility Cops and Robber
PublicationIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
Distributed graph searching with a sense of direction
PublicationIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Mechanizmy mocowe na rynkach energii elektrycznej
PublicationW artykule scharakteryzowano rozliczenia mocowe związane z dostawą energii elektrycznej. Opisano najważniejsze mechanizmy mocowe, skupiając się głównie na rozwiązaniach stosowanych w krajach europejskich. Na tym tle przedstawiono zasady funkcjonowania rynku mocy w Polsce. Omówiono wyniki pierwszych aukcji krajowych. Wskazano na możliwy wpływ funkcjonowania rynku mocy na rynek energii elektrycznej.
-
CAP4CITY [CAP4CITY] Strengthening Governance Capacity for Smart Sustainable Cities
ProjectsProject realized in Danube University Krems according to 598273-EPP-1-2018-1-AT-EOOKA2-CBHE-JP agreement from 2019-06-03
-
Scrutiny of power grids by penetrating PV energy in wind farms: a case study of the wind corridor of Jhampir, Pakistan
PublicationThis study examines the problems caused by intermittent renewable energy sources, especially wind farms, and suggests a different solar energy penetration strategy to improve their loading capacity. The study uses real-time data from a wind farm in Jhampir, Pakistan, to analyse and assess various aspects of grid stations connected to wind farms. Electrical Transient Analyzer Program is used to validate the results by linking these...
-
Scrutiny of power grids by penetrating PV energy in wind farms: a case study of the wind corridor of Jhampir, Pakistan
PublicationThis study examines the problems caused by intermittent renewable energy sources, especially wind farms, and suggests a different solar energy penetration strategy to improve their loading capacity. The study uses real-time data from a wind farm in Jhampir, Pakistan, to analyse and assess various aspects of grid stations connected to wind farms. Electrical Transient Analyzer Program is used to validate the results by linking...
-
Aspects of multistation quantum information broadcasting
PublicationWe study quantum information transmission over multiparty quantum channel. In particular, we show an equivalence of different capacity notions and provide a multiletter characterization of a capacity region for a general quantum channel with k senders and m receivers. We point out natural generalizations to the case of two-way classical communication capacity. (C) 2010 Elsevier B.V. All rights reserved.
-
Red Algae – An Alternative Source of Carbon Material for Energy Storage Application
PublicationNew electrode material obtained by pyrolysis of aquatic biomass macro (red algae) soaked with glucose solution has been characterized by SEM, EDX and Raman spectroscopy. Graphitized carbon was identified by Raman spectroscopy. Galvanostatic cyclic polarization of the materials in contact with 1M LiPF6 electrolyte in EC:DMC (1:1 v/v) and Li as a counter electrode was performed. Specific capacity of the novel material was enhanced...
-
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...
-
Julita Wasilczuk dr hab.
PeopleBorn on 5th of April, 1965 in Gdansk. In 1987-1991 studied the economics of transport, at the University of Gdansk. At 1993 she started to work at the Faculty of Management and Economics. In 1997 received a PhD at the faculty, in 2006 habilitation at the Faculty of Management, University of Gdansk. Since 2009 Associate Professor at Gdansk University of Technology. In 2010-2012 Associate Professor of Humanistic High School at Gdansk. The...
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublicationWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
-
Thermal conductivity of M0-M100 specimens
Open Research DataThermal conductivity and volumetric heat capacity values of M0, M20, M40, M60, M80, M100 samples
-
Morse decompositions for a non-linear Leslie population model with 2 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Morse decompositions for a non-linear Leslie population model with 3 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
CRVG - a new model for wireless networks topology generation
PublicationThis paper presents a new model of wireless network topology generator. Its main advantage is the possibility of relatively sparse networks generation. Because no iteration is needed, the model can be used for massive generation of networks for testing. The topological properties of produced graphs place them in the class of scale free networks, resembling real ones.
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Scheduling of compatible jobs on parallel machines
PublicationThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Antioxidant Interactions between Major Phenolic Compounds Found in 'Ataulfo' Mango Pulp: Chlorogenic, Gallic, Protocatechuic and Vanillic Acids
PublicationPhenolic compounds are known to have antioxidant capacity; however, there is little information about molecular interactions between particular phenolics found in fruits at different developmental stages. Therefore, the total antioxidant capacity of the phenolic compounds of a fruit may not correspond to the sum of individual antioxidant capacity given by antioxidants from that tissue. In this study, individual antioxidant capacity...
-
Analysis of efficiency of phosphates sorption by different granulation of selected reactive material
PublicationIn the light of the need to find an effective way to remove phosphorus from wastewater, studies on the suitability of sorption materials in this process should be conducted. The aim of the study was to examine the potential benefits of using selected adsorbents to reduce orthophosphates from the model solution under steady conditions. The study was conducted on a laboratory scale using synthetic wastewater with concentration of...
-
Nitrogen (N2) adsorption/desorption isotherms of PC-X (porous carbon materials obtained at various temperatures)
Open Research DataThese data contain nitrogen (N2) adsorption/desorption isotherms of PC-700 (porous carbon obtained at 700 °C), PC-800 (porous carbon obtained at 800°C), PC-900 (porous carbon materials obtained at 900°C). Data showed typical type-I isotherms, indicating the presence of micropores in their structures. PC-900, compared with PC-700 and PC-800, showed a...
-
VOLTAMMETRIC DETERMINATION OF DEOXYRIBONUCLEIC ACID PRESENCE ON A CARBON ELECTRODE
PublicationThis paper presents a voltammetry as a useful method to analyse DNA from different species. This electrochemical method is well know and used in different analyses. The influence of an area of working electrode and the capacity component, is shown at equals and the measurement. In voltammetry DNA measurement the capacity component is very important and must be taken into consideration. All mathematical analyses were verify at laboratory.
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublicationAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
On zero-error codes produced by greedy algorithms
PublicationWe 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.
-
Purely quantum superadditivity of classical capacities of quantum multiple access channels
PublicationWe are studying classical capacities of quantum memoryless multiaccess channels in geometric terms and we are revealing a break of additivity of the Holevo-like capacity. This effect is a purely quantum mechanical one, since, as we point out, the capacity regions of all classical memoryless multiaccess channels are additive. It is the first such effect revealed in the field of classical information transmission via quantum channels.
-
Global defensive secure structures
PublicationLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...