Search
Filters
total: 1354
-
Catalog
displaying 1000 best results Help
Search results for: bipartite graphs
-
Local hidden–variable models for entangled quantum states
PublicationWhile entanglement and violation of Bell inequalities were initially thought to be equivalent quantum phenomena, we now have different examples of entangled states whose correlations can be described by local hidden-variable models and, therefore, do not violate any of the Bell inequalities. We provide an up-to-date overview of the existing literature regarding local hidden-variable models for entangled quantum states, in both...
-
Modeling of the internal combustion engine cooling system
PublicationThe article concerns computer modelling of processes in cooling systems of internal combustion engines. Modelling objectives and existing commercial programs are presented. It also describes Author’s own method of binding graphs used to describe phenomena in the cooling system of a spark ignition engine. The own model has been verified by tests on the engine dynamometer. An example of using a commercial program for experimental...
-
On the connected and weakly convex domination numbers
PublicationIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
On the Hat Problem on the Cycle C7
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 a win. In this version every player can...
-
Independence in uniform linear triangle-free hypergraphs
PublicationThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Evaluation of the geranyl esters-containing pheromone traps used for monitoring Elateridae family beetles in crops Ocena pułapek feromonowych zawierających estry geranylu stosowanych do monitorowania chrząszczy z rodziny Elateridae w uprawach
Publication -
Study of the influence of the presence of Dr fimbriae on the sedimentation of recombinant Escherichia coli strains: AAEC191A and BL21(DE3)
Open Research DataCell sedimentation in the medium is a common phenomenon in most bacterial enviroments. This study specifically investigated the impact of Dr fimbriae presence on cell deposition. To explore this, recombinant Escherichia coli strains were employed, including BL21(DE3)/pCC90, BL21(DE3)/pACYCpBAD, BL21(DE3)/pCC90 Dra D-mut, BL21(DE3)/pCC90 D54-STOP, AAEC191A/pCC90,...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
Numerical modelling of POC dynamics in the southern Baltic under possible future conditions determined by nutrients, light and temperature**The study was financially supported by the Polish Ministry of Science and Higher Education (grants: NN305 111636 and NN306 404338) and Baltic-C – the BONUS funded project.
Publication -
Factory Acceptance Test – Strain Gauge Measurement, Report no: WOiO /II/123/2014
PublicationTested object was 40 meters long jib and its foundation, placed in Gdansk Shiprepair Yard, manufactured by KMK. The contruction was dedicated to the passenger cruise vessel "Quantum of the Seas" The Strain Gauge measurement in different location and load situation was done in order to validate calculation finite element models used during strength analysis for project. The expertise contains: methodology of the measurements, description...
-
Factory Acceptance Test – Strain Gauge Measurement - Report no: WOiO /II/88/2014
PublicationTested object was 40 meters long jib and its foundation, placed in Gdansk Shiprepair Yard, manufactured by KMK. The contruction was dedicated to the passenger cruise vessel "North Star" The Strain Gauge measurement in different location and load situation was done in order to validate calculation finite element models used during strength analysis for project. The expertise contains: methodology of the measurements, description...
-
Arch bridges under test loadings
PublicationThis paper illustrates experience in arch bridges test loadings of the research team of Department of Structural Mechanics and Bridge Structures from the Gdansk University of Technology. The presented calculations results constist the analysis of spatial construction schemes made using the finite elements method (FEM) and its comparison to the field studies. Arch bridges with the longest spans, visualisation of the computational...
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Software tool for modelling of mechatronic systems with elastic continua
PublicationThe paper presents a systematic computational package for modelling and analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The constructed computer program enables the frequency domain analysis of a class of linear systems and to obtain reduced order model in the form of bond graph. Obtained modal bond graph can be directly exported into 20-Sim package to further processing including nonlinear...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Weighted 2-sections and hypergraph reconstruction
PublicationIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Joanna Rymaszewska prof. dr hab. n. med.
PeopleCV Joanna Rymaszewska Wroclaw University of Science and Technology, Wroclaw, Poland +48 601 98 26 24, joanna.rymaszewska@pwr.edu.pl orcid.org/0000-0001-8985-3592 2023 → Professor of Wroclaw University of Science and Technology (WUST), Poland 2011 → 2023 Professor of Wroclaw Medical University (WMU), PL 2016 → 2022 Head of the Department of Psychiatry, Wroclaw Medical University 2016 → 2022 Head of the Clinic of Psychiatry,...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublicationIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Michał Ryms dr inż.
PeopleMichał Ryms, PhD, Eng. is the physicist, graduate of the Gdańsk University of Technology. PhD thesis defended at the Chemical Faculty. Since 2011 an employee at the Department of Chemical Apparatus and Theory of Machines, Chemical Faculty, Gdansk University of Technology, POLAND – now as an assistant professor. His research interests includes: improvement of energy efficiency and possibilities of new application of phase change...
-
International Conference Computer Graphics, Imaging and Visualization
Conferences -
Soft Computing in Computer Graphics, Imaging, and Vision
Conferences -
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
3D Computer Model of the Hip Joint Cartilage
PublicationThis paper presents 3D computer model of the hip joint cartilage in the ANSYS program. Model is made on the basis of anatomy and collected data on the material constants of bone and cartilage components. Analysis and comparison of biochemical model, viscoelastic and molecular mixed - aggregation serves to facilitate the creation of the next model of reality, which could be used in the design of joint prostheses. The correctness...
-
Towards Effective Processing of Large Text Collections
PublicationIn the article we describe the approach to parallelimplementation of elementary operations for textual data categorization.In the experiments we evaluate parallel computations ofsimilarity matrices and k-means algorithm. The test datasets havebeen prepared as graphs created from Wikipedia articles relatedwith links. When we create the clustering data packages, wecompute pairs of eigenvectors and eigenvalues for visualizationsof...
-
Detecting type of hearing loss with different AI classification methods: a performance review
PublicationHearing is one of the most crucial senses for all humans. It allows people to hear and connect with the environment, the people they can meet and the knowledge they need to live their lives to the fullest. Hearing loss can have a detrimental impact on a person's quality of life in a variety of ways, ranging from fewer educational and job opportunities due to impaired communication to social withdrawal in severe situations. Early...
-
Engineering Graphics I, W/P, MiBM, sem 01, zimowy 2021/2022 (PG_00055216)
e-Learning CoursesKurs dla zajęć z Grafiki Inżynierskiej I dla MiBM spec. DaPE --- Course for the Enginnering Graphics I for DaPE
-
Brief Announcement: Energy Constrained Depth First Search
PublicationDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
Preface
PublicationThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
Dotacje unijne jako źródło finansowania innowacji w małych i średnich przedsiębiorstwach
PublicationArtykuł dotyczy wskazania możliwości pozyskania źródeł finansowania innowacji małych i średnich przedsiębiorstw. Przykładem tego mają być dostępne obecnie lub w przyszłości granty i fundusze unijne. W artykule przedstawiono owe dotacje i ogólne ich zasady z uwzględnieniem programu z jakiego pochodzą i dla jakiego podmiotu mają być dedykowane. Ponadto zaprezentowano propozycje na co mogą być przeznaczone środki z poszczególnych...
-
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...
-
W-like bound entangled states and secure key distillation
PublicationWe construct multipartite entangled states with underlying W-type structuresatisfying positive partial transpose (PPT) condition under any (N −1)|1 partition. Then we showhow to distill a N-partite secure key from the states using two different methods: direct applicationof local filtering and novel random key distillation scheme in which we adopt the idea from recentresults on entanglement distillation. Open problems and possible...
-
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...
-
Case Study NEB Atlas / part I - 3D Models / King's Cross, London
Open Research DataThe data presents the results of work on the analysis of contemporary neighbourhoods. The aim of this part of the research was to create a digital model - a simplified digital twin - for selected parts of housing estates already realised in various cities in Europe. This group presents a model for a fragment of the King's Cross, London, UK. The students...
-
How to render FDTD computations more effective using agraphics accelerator.
PublicationGraphics processing units (GPUs) for years have been dedicated mostly to real time rendering. Recently leading GPU manufactures have extended their research area and decided to support also graphics computing. In this paper, we describe an impact of new GPU features on development process of an efficient finite difference time domain (FDTD) implementation.
-
Tomasz Dziubich dr inż.
PeopleScientific projects and grants Internet platform for data integration and collaboration of medical research teams for the stroke treatment centers 2013 - 2016 MAYDAY EURO 2012 Supercomputer Platform for Context Analysis of Data Streams in Identification of Specified Objects or Hazardous Events – task 4.2 (Development of algorithms and applications supporting medical diagnosis), 2008-2012 Other GrandPrix on trade show ...
-
Acoustic Hysteresis in Flows with Different Kinds of Relaxation and Attenuation
PublicationGraphs in the thermodynamic plane acoustic pressure versus excess acoustic density representing acoustic hysteresis, are considered as indicators of relaxation processes, equilibrium parameters of a flow, and kinds of wave exciters. Some flows with deviation from adiabaticity are examined: the Newtonian flow of a thermocon- ducting gas, the flow of a gas with vibrational relaxation, the flow of liquid electrolyte with a chemical...
-
Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
Conferences -
Engineering Graphics I, PG_00055216 2023/24
e-Learning Courses -
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...
-
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...
-
Laser granulometer as an useful tool for selection of appropriate membranes used in the MIEX®DOC-UF/MF hybrid process
PublicationIn the study, particle size distribution of the MIEX® resin was presented. Such analyses enable to determinate whether presence of fine resin fraction may be the reason for unfavorable membrane blocking during water purification by the hybrid MIEX®DOC-microfiltration/ultrafiltration systems. Granulometric analysis of resin grains using the laser diffraction particle size analyzer (laser granulometer) was carried out as well as...
-
Case Study NEB Atlas / part I - 3D Models / Brunnshög, Lund
Open Research DataThe data presents the results of work on the analysis of contemporary neighbourhoods. The aim of this part of the research was to create a digital model - a simplified digital twin - for selected parts of housing estates already realised in various cities in Europe. This group presents a model for a fragment of the Brunnshög district in Lund, Sweden....
-
Mirosław Andrusiewicz prof. dr hab. n. med. i n. o zdr.
PeopleDiplomas, degrees conferred in specific areas ̶ Post-doctoral degree in medical sciences (doctor habilitated) (discipline: medical biology) December 4, 2017; Title of academic achievement: "Analysis of selected genes involved in the control of pathological changes in cells derived from internal female reproductive organs"; Poznan University of Medical Sciences, Faculty of Medicine II; re-viewers: Prof. Katarzyna Ziemnicka,...
-
Experimental Investigations On The Momentum Pressure Drop During Flow Boiling Of R134a
PublicationThe article presents experimental investigations of the pressure drop during twophase flow. Experiments were performed for both adiabatic and heated flow of R134a. Obtained flow patterns were compared with the literature. Obtained data is used to validate momentum pressure drop predictions, a set of graphs showing comparisons, for a representative set of experimental conditions, of the two-phase frictional pressure gradients for...
-
Neural Network Subgraphs Correlation with Trained Model Accuracy
PublicationNeural Architecture Search (NAS) is a computationally demanding process of finding optimal neural network architecture for a given task. Conceptually, NAS comprises applying a search strategy on a predefined search space accompanied by a performance evaluation method. The design of search space alone is expected to substantially impact NAS efficiency. We consider neural networks as graphs and find a correlation between the presence...
-
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.
-
Topic 1: Transformations / Spatial form design, scale 1:1
e-Learning CoursesBrief description: The subject matter of the spatial form design classes is transformation. First, a black square becomes a flat graphic composition, which is then converted to color. The final stage of the transformation process is a spatial object, which is by assumption devoid of any utilitarian functions. Course content / classes schedule: 1. Graphic. The task is to create an achromatic flat composition in the contrast...