Wyszukiwarka
Filtry
wszystkich: 2328
-
Katalog
- Publikacje 1532 wyników po odfiltrowaniu
- Czasopisma 16 wyników po odfiltrowaniu
- Konferencje 9 wyników po odfiltrowaniu
- Osoby 34 wyników po odfiltrowaniu
- Wynalazki 11 wyników po odfiltrowaniu
- Projekty 5 wyników po odfiltrowaniu
- Kursy Online 519 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 199 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: STRONG PRODUCT GRAPHS
-
Enhancing Product Innovation Through Smart Innovation Engineering System
PublikacjaThis paper illustrates the idea of Smart Innovation Engineering (SIE) System that helps in carrying the process of product innovation. The SIE system collects the experiential knowledge from the formal decisional events. This experiential knowledge is collected from the set of similar products having some common functions and features. Due to the fact that SIE system collects, captures and reuses the experiential knowledge of all...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
Generative Process Planning with Reasoning based on Geometrical Product Specification
PublikacjaThe focus of this paper is on computer aided process planning for parts manufacture in systems of definite process capabilities, involving the use of multi-axis machining centers for parts shaping and grinding machines for finishing. It presents in particular a decision making scheme for setup determination as a part of generative process planning. The planning procedurę consists of two stages. The first stage is associated with...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
A memory efficient and fast sparse matrix vector product on a Gpu
PublikacjaThis paper proposes a new sparse matrix storage format which allows an efficient implementation of a sparse matrix vector product on a Fermi Graphics Processing Unit (GPU). Unlike previous formats it has both low memory footprint and good throughput. The new format, which we call Sliced ELLR-T has been designed specifically for accelerating the iterative solution of a large sparse and complex-valued system of linear equations arising...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
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 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...
-
On the deficiency of bipartite graphs
Publikacja -
Named Property Graphs
Publikacja -
Serialization for Property Graphs
Publikacja -
Rank Coloring of Graphs.
PublikacjaRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublikacjaRozdział poświęcony jest cyrkularnemu modelowi kolorowania krawędzi. Rozważana jest zarówno wersja wierzchołkowa i krawędziowa. Szczególny nacisk położono na złożoność obliczeniową i zastosowania dla omawianych modeli kolorowania.
-
Harmonions Coloring of Graphs.
PublikacjaProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
T-coloring of graphs.
PublikacjaNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Classical coloring of graphs.
PublikacjaRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublikacjaRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
On iterates of strong Feller operators on ordered phase spaces.
PublikacjaPraca dotyczy asymptotycznych własności iteracji operatorów Markowa. Udowodniono, że operatory Lasoty i ich wielowymiarowe uogólnienia są asymptotycznie stabilne. Wyniki mają zastosowanie w modelowaniu rozwoju komórki.
-
Determination of the total number of microorganisms in a model food product preserved by CS-2a and CS-2b.
Dane BadawczeThe dataset contains the results of determination of the total number of microorganisms in a model food product after the use of the innovative preservatives: CS-2a and CS-2b and control (K) after seven days of refrigerated storage of the product. The test was performed using the surface inoculation method.
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Brand loyalty creation in the social network. Does the product category matter?
PublikacjaThe final goal of all marketers’ effort is to achieve a high level of loyalty toward their brands. Social network brand sites are increasingly attracting the attention of scientists and managers intrigued by their potential application for brand loyalty creation. The aim of this research, based on European sample, is to fill the gap in understanding the product category loyalty and brand loyalty relation as an output of brand identification...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublikacjaWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Global Product as a Result of Globalization Process
Publikacja -
Relative product diversification in the course of economic development: import-export analysis.
PublikacjaThis paper contributes to trade diversification literature by comparing changes in relative (i.e. assessed in comparison with world patterns) heterogeneity of import and export structures in the process of economic development. In particular, by focusing on the diversification of imports, we add a missing piece to already analysed export trends. We use highly disaggregated trade statistics (4963 product lines) for 163 countries...
-
GROUPS OF GERMAN DOMESTIC APPLIANCE MANUFACTURERS ACCORDING TO NEW PRODUCT DEVELOPMENT PRACTICES
PublikacjaFinding the best way to develop new products has been always a hot topic for practitioners and academics. However, so far only a few of these kinds of studies have concentrated on a single industry. In this paper, we group German domestic appliance manufacturers with regards to their new product development (NPD) practices to discover their attitude to NPD effort. By conducting a survey we found that three different groups of manufacturers...
-
Nonlinear strain gradient and micromorphic one-dimensional elastic continua: Comparison through strong ellipticity conditions
PublikacjaWe discuss the strong ellipticity (SE) conditions for strain gradient and micromorphic continua considering them as an enhancement of a simple nonlinearly elastic material called in the following primary material. Recently both models are widely used for description of material behavior of beam-lattice metamaterials which may possess various types of material instabilities. We analyze how a possible loss of SE results in the behavior...
-
Strong-coupling character of superconducting phase in compressed selenium hydride
Publikacja -
Kinetics and mechanism of the dehydrohalogenation of Ar2CHCX3 and Ar2CHCHX2 by strong N-bases
Publikacja -
Strong Monogamies of No-Signaling Violations for Bipartite Correlation Bell Inequalities
PublikacjaThe phenomenon of monogamy of Bell inequality violations is interesting both from the fundamental perspective as well as in cryptographic applications such as the extraction of randomness and secret bits. In this article, we derive new and stronger monogamy relations for violations of Bell inequalities in general no-signaling theories. These relations are applicable to the class of binary output correlation inequalities known as...
-
Greedy T-colorings of graphs
PublikacjaTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
Interval Edge-Coloring of Graphs
Publikacja -
Correction to: Serialization for Property Graphs
Publikacja -
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Interval edge-coloring of graphs.
PublikacjaRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
Equitable vertex coloring of graphs
PublikacjaW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
A Model of Thermal Energy Storage According to the Convention of Bond Graphs (BG) and State Equations (SE)
PublikacjaThe main advantage of the use of the Bond Graphs method and State Equations for modeling energy systems with a complex structure (marine power plants, hybrid vehicles, etc.) is the ability to model the system components of different physical nature using identical theoretical basis. The paper presents a method of modeling thermal energy storage, which is in line with basic BG theory. Critical comments have been put forward concerning...
-
Noncentrosymmetric Triangular Magnet CaMnTeO6: Strong Quantum Fluctuations and Role of s0 versus s2 Electronic States in Competing Exchange Interactions
PublikacjaNoncentrosymmetric triangular magnets offer a unique platform for realizing strong quantum fluctuations. However, designing these quantum materials remains an open challenge attributable to a knowledge gap in the tunability of competing exchange interactions at the atomic level. Here, a new noncentrosymmetric triangular S = 3/2 magnet CaMnTeO6 is created based on careful chemical and physical considerations. The model material...
-
Superconducting SrSnP with Strong Sn–P Antibonding Interaction: Is the Sn Atom Single or Mixed Valent?
PublikacjaThe large single crystals of SrSnP were prepared using Sn self-flux method. The superconductivity in the tetragonal SrSnP is observed with the critical temperature of ∼2.3 K. The results of a crystallographic analysis, superconducting characterization, and theoretical assessment of tetragonal SrSnP are presented. The SrSnP crystallizes in the CaGaN structure type with space group P4/nmm (S.G. 129, Pearson symbol tP6) according...
-
NATURAL PRODUCT RESEARCH
Czasopisma -
Performance of the Direct Sequence Spread Spectrum Underwater Acoustic Communication System with Differential Detection in Strong Multipath Propagation Conditions
PublikacjaThe underwater acoustic communication (UAC) operating in very shallow-water should ensure reliable transmission in conditions of strong multipath propagation, significantly disturbing the received signal. One of the techniques to achieve this goal is the direct sequence spread spectrum (DSSS) technique, which consists in binary phase shift keying (BPSK) according to a pseudo-random spreading sequence. This paper describes the DSSS...
-
Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs
PublikacjaIn this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party xor game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games...
-
Negative result about the construction of genuinely entangled subspaces from unextendible product bases
PublikacjaUnextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital interest for over two decades now. An open question asks about the existence of UPBs, which are genuinely unextendible, i.e., they are not extendible even with biproduct vectors. In other words,...
-
Chemical Product and Process Modeling
Czasopisma -
International Journal of Product Development
Czasopisma