Filters
total: 1358
filtered: 1055
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: BIPARTITE GRAPHS
-
Attraction of Moths of Two Noctuidae Species to Field Traps Baited With a Mixture of two to three Homologous Acetates in Poland
Publication -
Infographics in Educational Settings: A Literature Review
PublicationInfographics are visual representations of data that utilize various graphic elements, including pie charts, bar graphs, line graphs, and histograms. Educators and designers can maximize the potential of infographics as powerful educational tools by carefully addressing challenges and capitalizing on emerging technologies. However, current education systems showcase the need for development guidelines and the best practices targeted...
-
Energy-Efficient Self-Supervised Technique to Identify Abnormal User Over 5G Network for E-Commerce
PublicationWithin the realm of e-commerce networks, it is frequently observed that certain users exhibit behavior patterns that differ substantially from the normative behaviors exhibited by the majority of users. The identification of these atypical individuals and the understanding of their behavioral patterns are of significant practical significance in maintaining order on e-commerce platforms. One such method for accomplishing this...
-
Energy-Efficient Self-Supervised Technique to Identify Abnormal User Over 5G Network for E-Commerce
PublicationWithin the realm of e-commerce networks, it is frequently observed that certain users exhibit behavior patterns that differ substantially from the normative behaviors exhibited by the majority of users. The identification of these atypical individuals and the understanding of their behavioral patterns are of significant practical significance in maintaining order on e-commerce platforms. One such method for accomplishing this objective...
-
Quantum Steering Inequality with Tolerance for Measurement-Setting Errors: Experimentally Feasible Signature of Unbounded Violation
Publicationuantum steering is a relatively simple test for proving that the values of quantum-mechanical measurement outcomes come into being only in the act of measurement. By exploiting quantum correlations, Alice can influence — steer — Bob ’ s physical system in a way that is impossible in classical mechanics, as shown by the violation of steering inequalities. Demonstrating this and similar quantum effects for systems of increasing size,...
-
Immunocytochemical Study on Endothelial Integrity of Saphenous Vein Grafts Harvested by Minimally Invasive Surgery with the Use of Vascular Mayo Stripers. A Randomized Controlled Trial
Publication -
Effects of Sterilization Methods on Different 3D Printable Materials for Templates of Physician-Modified Aortic Stent Grafts Used in Vascular Surgery—A Preliminary Study
Publication -
The operational method of filling information gaps in satellite imagery using numerical models
Publication -
Properties of Charge Carrier Traps in Lu2O3:Tb,Hf Ceramic Storage Phosphors Observed by High-Pressure Spectroscopy and Photoconductivity
Publication -
Effect of shallow traps on admittance spectra of the system carrying SCLC and on values of charge carrier mobility extracted from susceptance
PublicationThe work concerns small-signal spectra of space-charge-limited current below threshold frequency (ft) of shallow traps. It is shown that below ft the small-signal concentration of trapped charge carriers is proportional to and in phase with small-signal concentration of free charge carriers, so there is no room for “slow shallow traps”. Conductance can be reduced by the traps, however no change in the range of real capacitance...
-
Archives of civil engineering. Intelligent graphic modeler integrating FE analisys of transient heat transfer with early computer-aided design of energy-efficient buildings
PublicationW pracy zaprezentowano nowatorski Modeler Rozmyty, w którym zaimplementowano unikalną koncepcję rozpoznawania. Modeler Rozmyty dokonuje ekstrakcji danych geometrycznych poprzez rozpoznanie i identyfikację niedokładnych i niejednorodnych rysunków, złożonych z prostych obiektów graficznych.
-
Counting Lattice Paths With Four Types of Steps
Publication -
Distributed correlations and information flows within a hybrid multipartite quantum-classical system
PublicationUnderstanding the non-Markovian mechanisms underlying the revivals of quantum entanglement in the presence of classical environments is central in the theory of quantum information. Tentative interpretations have been given by either the role of the environment as a control device or the concept of hidden entanglement. We address this issue from an information-theoretic point of view. To this aim, we consider a paradigmatic tripartite...
-
Beyond the helium buffer: 12C−2 rotational cooling in cold traps with H2 as a partner gas: interaction forces and quantum dynamics
Publicationabstract = { The scattering cross-sections and corresponding rate coefficients for rotationally inelastic collisions of $^{12}$C$_2$^-$ ($^2 \Sigma_g^+$) with H$_2$ ($^1 \Sigma_g^+$) are presented over a broad range of cold-trap temperatures. They have been calculated using quantum scattering theory that employs a new ab initio potential energy surface. The rate coefficients for the inelastic processes in the anionic partner are...
-
Badania i obliczenia sprawdzające zaworu p-poż. 1" PN16 firmy GRAS
PublicationWykonano obliczenia sprawdzające dla zaworu przy różnych wariantach obciążenia. Sformułowano wnioski.
-
The Snow Team Problem
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Influence of edge subdivision on the convex domination number
PublicationWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Dedicated scheduling of tasks to minimize mean flow time
PublicationThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Endothelial integrity of radial artery grafts harvested by minimally invasive surgery — immunohistochemical studies of CD31 and endothelial nitric oxide synthase expressions: a randomized controlled trial☆
Publication -
Nonadditivity of quantum and classical capacities for entanglement breaking multiple-access channels and the butterfly network
PublicationWe analyze quantum network primitives which are entanglement breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channels and the quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. The present effects provide a qualitative...
-
Preliminary study on the influence of UV-C irradiation on microorganism viability and polyphenol compounds content during winemaking of ‘Regent’ red grape cultivar
Publication -
Polyvalent Mechanical Bacterial Lysate Administration Improves the Clinical Course of Grass Pollen–Induced Allergic Rhinitis in Children: A Randomized Controlled Trial
Publication -
Perspective Chapter: Reducing the Social Inequality Gaps in Older Ages in Low- and Middle-Income Countries
Publication -
Collaborative planning? Not yet seen in Poland. Identifying procedural gaps in the planning system 2003–2023
PublicationCollaborative planning aims to increase the legitimacy of decision-making in spatial development. In this approach, planning involves debate and engagement in discourse, and participation and interaction between actors are thus at the heart of the planning process. This article examines whether the planning system in Poland as defined for the period 2003–2025 provides a level of participation and deliberation and other qualities...
-
Role of nitrogen in optical and electrical band gaps of hydrogenated/hydrogen free carbon nitride film
PublicationWe report the optical and electrical band gap energy of amorphous hydrogenated carbon nitride (a-HCNx) and carbon nitride (a-CNx) as a function of nitrogen concentration (N/C). The optical band gap of a-HCNx and a-CNx films has been determined by means of Ellipsometry and UV-VIS. Both optical and electrical band gaps increase with elevated nitrogen concentration. Experimentally obtained electrical band gap is compared with the...
-
The trophic state of the Vistula Lagoon: an assessment based on selected biotic and abiotic parameters according to the Water Framework Directive**This work was supported by the Norway grants PNRF 82 A I.
Publication -
Caveolin 2: a facultative marker of unfavourable prognosis in long-term patency rate of internal thoracic artery grafts used in coronary artery bypass grafting. Preliminary report
Publication -
Non-volatile molecular composition and discrimination of single grape white of chardonnay, riesling, sauvignon blanc and silvaner using untargeted GC–MS analysis
PublicationThis study developed and applied a GC–MS method aiming at molecular fingerprinting of 120 commercial single grape white wines (Chardonnay, Riesling, Sauvignon Blanc and Silvaner) for possible authentication according to grape variety. The method allowed detection of 372 peaks and tentative identification of 146 metabolites including alcohols, organic acids, esters, amino acids and sugars. The grape variety effect explained 8.3%...
-
A policy view: gaps and weaknesses of substitution between biological products in law and economics dimension: the example of insulin
Publication -
NO-BROADCASTING OF NON-SIGNALLING BOXES VIA OPERATIONS WHICH TRANSFORM LOCAL BOXES INTO LOCAL ONES
PublicationWe deal with families of probability distributions satisfying non-signalling condition, called non-signalling boxes and consider a class of operations that transform local boxes into local ones (the one that admit LHV model). We prove that any operation from this class cannot broadcast a bipartite non-local box with 2 binary inputs and outputs. We consider a function called anti-Robustness which can not decrease under these operations....
-
Collective Uncertainty Entanglement Test
PublicationFor a given pure state of a composite quantum system we analyze the product of its projections onto aset of locally orthogonal separable pure states. We derive a bound for this product analogous to theentropic uncertainty relations. For bipartite systems the bound is saturated for maximally entangled statesand it allows us to construct a family of entanglement measures, we shall call collectibility. As thesequantities are experimentally...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
High performance filtering for big datasets from Airborne Laser Scanning with CUDA technology
PublicationThere are many studies on the problems of processing big datasets provided by Airborne Laser Scanning (ALS). The processing of point clouds is often executed in stages or on the fragments of the measurement set. Therefore, solutions that enable the processing of the entire cloud at the same time in a simple, fast, efficient way are the subject of many researches. In this paper, authors propose to use General-Purpose computation...
-
All Nonclassical Correlations Can Be Activated into Distillable Entanglement
PublicationWe devise a protocol in which general nonclassical multipartite correlations produce a physically relevant effect, leading to the creation of bipartite entanglement. In particular, we show that the relative entropy of quantumness, which measures all nonclassical correlations among subsystems of a quantum system, is equivalent to and can be operationally interpreted as the minimum distillable entanglement generated between the system...
-
Dynamics of quantum entanglement
PublicationA model of discrete dynamics of entanglement of a bipartite quantum state is considered. It involves a global unitary dynamics of the system and periodic actions of local bistochastic or decaying channel. For initially pure states the decay of entanglement is accompanied by an increase of von Neumann entropy of the system. We observe and discuss revivals of entanglement due to unitary interaction of subsystems. For some mixed states...
-
Entanglement and Nonlocality are Inequivalent for Any Number of Parties
PublicationUnderstanding the relation between nonlocality and entanglement is one of the fundamental problems in quantum physics. In the bipartite case, it is known that these two phenomena are inequivalent, as there exist entangled states of two parties that do not violate any Bell inequality. However, except for a single example of an entangled three-qubit state that has a local model, almost nothing is known about such a relation in multipartite...
-
Clearing directed subgraphs by mobile agents
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Communication and Load Balancing Optimization for Finite Element Electromagnetic Simulations Using Multi-GPU Workstation
PublicationThis paper considers a method for accelerating finite-element simulations of electromagnetic problems on a workstation using graphics processing units (GPUs). The focus is on finite-element formulations using higher order elements and tetrahedral meshes that lead to sparse matrices too large to be dealt with on a typical workstation using direct methods. We discuss the problem of rapid matrix generation and assembly, as well as...
-
Simple sufficient condition for subspace to be completely or genuinely entangled
PublicationWe introduce a simple sufficient criterion, which allows one to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We...
-
Studenckie Staże Zawodowe - Analiza Procesu Kwalifikacji w Kontekście Dopasowania Człowiek - Organizacja
PublicationProces kwalifikacji studentów na staże zawodowe ma charakter intuicyjny, główną rolę odgrywają w nich studenci oraz pracodawcy - oferenci staży. Skuteczność procesu można pokazać poprzez analizę sytuacji krytycznych. Artykuł omawia sytuacje, jakie pojawiły się w dwóch edycjach kwalifikowania na staże zawodowe. Do analizy procesu zastosowano dwie koncepcje teoretyczne: model ASA oraz dopasowanie organizacyjne, stosowane w doborze...
-
Thermodynamical approach to quantifying quantum correlations
PublicationWe consider the amount of work which can be extracted from a heat bath using a bipartite state ρ shared by two parties. In general it is less then the amount of work extractable when one party is in possession of the entire state. We derive bounds for this “work deficit” and calculate it explicitly for a number of different cases. In particuar, for pure states the work deficit is exactly equal to the distillable entanglement of...
-
On trees with double domination number equal to total domination number plus one
PublicationA total 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. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Auto/bio/géo/graphies : les enjeux spatiaux de la mémoire dans les récits autobiographiques et testimoniaux du temps de la guerre chez Durocher, Langfus, Rawicz
Publication -
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
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.
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Brushing with additional cleaning restrictions
PublicationIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublicationIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublicationWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...