Search
Filters
total: 1985
filtered: 1687
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: DIRECT PRODUCT GRAPHS
-
Sources of Market Information, Its Quality and New Product Financial Performance
PublicationWhile we observe a growing interest in the role of market information in new product development (NPD), existing research has still largely ignored the quality of market information that is a crucial issue in the era of the information society. What does affect the quality of market information in new product development projects, and how does this quality influence the financial performance of new products? In this paper, we address...
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublicationMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublicationIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
Smart Virtual Product Development: Manufacturing Capability Analysis and Process Planning Module
PublicationSmart Virtual Product Development (SVPD) system provides effective use of information, knowledge, and experience in industry during the process of product development in Industry 4.0 scenario. This system comprises of three primary modules, each of which has been developed to cater to a need for digital knowledge capture for smart manufacturing in the areas of product design, production planning, and inspection planning. Manufacturing...
-
Towards Increasing Density of Relations in Category Graphs
PublicationIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Product diversification, relative specialisation and economic development: import-export analysis.
PublicationThis 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...
-
Direct estimation of linear and nonlinear functionals of quantum state
PublicationWe present a simple quantum network, based on the controlled-SWAP gate, that can extract certain properties of quantum states without recourse to quantum tomography. It can be used as a basic building block for direct quantum estimations of both linear and nonlinear functionals of any density operator. The network has many potential applications ranging from purity tests and eigenvalue estimations to direct characterization of...
-
Smart Innovation Engineering System - A Tool for Facilitating Product Innovation Process
PublicationFor the survival and prosperity of the manufacturing unit, entrepreneurs need to find out new ideas that can be implemented in the products leading to innovation. The current study employs a systematic approach for product innovation. In this approach past experiences based on innovation decisions are stored and recalled during the innovation problem solving process. Implementing this system in the process of product innovation...
-
IMPACT OF DIRECT CURRENT ON NITRIFYING BIOMASS
PublicationEffects of short term exposure of nitrifying biomass to direct current were studied. DC was applied to mixed liquor from municipal BNR plant using graphite electrodes in no substrate limiting conditions. Both, ammonia oxidizing bacteria (AOB) and nitrite oxidizing bacteria (NOB) populations were affected by the current, however in opposite ways. The AOB population activity was inhibited by applied voltage. Activity decrease was...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
Distributed Evacuation in Graphs with Multiple Exits
PublicationWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublicationThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
Machine learning approach to packaging compatibility testing in the new product development process
PublicationThe paper compares the effectiveness of selected machine learning methods as modelling tools supporting the selection of a packaging type in new product development process. The main goal of the developed model is to reduce the risk of failure in compatibility tests which are preformed to ensure safety, durability, and efficacy of the finished product for the entire period of its shelf life and consumer use. This kind of testing...
-
A Semiautomatic Experience-Based Tool for Solving Product Innovation Problem
PublicationIn this paper we present the idea of Smart Innovation Engineering (SIE) System and its implementation methodology. The SIE system is semi-automatic system that helps in carrying the process of product innovation. It collects the experiential knowledge from the formal decisional events. This experiential knowledge is collected from the group of similar products having some common functions and features. The SIE system behaves like...
-
Connection graphs
Publication -
From unextendible product bases to genuinely entangled subspaces
PublicationUnextendible product bases (UPBs) are interesting mathematical objects arising in composite Hilbert spaces that have found various applications in quantum information theory, for instance in a construction of bound entangled states or Bell inequalities without quantum violation. They are closely related to another important notion, completely entangled subspaces (CESs), which are those that do not contain any fully separable pure...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublicationA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Support Product Development Framework by Means of Set of Experience Knowledge Structure (SOEKS) and Decisional DNA
PublicationIn this paper, we propose a framework to support product development activi-ties by utilizing Set of Experience Knowledge Structure (SOEKS) and Decisional DNA (DDNA). This idea will provide a new direction to researchers working on product development, especially designers and manufacturers. They will be working on the same platform and this will be reducing their communication gap. Once the final idea is perceived about product...
-
Verification of punching shear outside the shear cap by the direct method
PublicationThe proposition of a method to verify the punching resistance for very large supports based on the EN 1992-1-1 standard is described in this paper. The present standard guidelines for the calculation of the punching resistance for large supports are also summarised. The proposed direct method is compared with other standard methods using an example taken from design practice. This method consists of a direct check of the shear...
-
A Framework for Searching in Graphs in the Presence of Errors
PublicationWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
A non-linear direct peridynamics plate theory
PublicationIn this paper a direct non-local peridynamics theory for thin plates is developed. Peridynamic points are assumed to behave like rigid bodies with independent translation and finite rotation degrees of freedom. The non-local mechanical interaction between points is characterized by force and moment vectors. The balance equations including the linear momentum, the angular momentum and the energy are presented. Peridynamic deformation...
-
Enhancing Product Innovation Through Smart Innovation Engineering System
PublicationThis 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
PublicationConsider 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
PublicationThis 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
PublicationThe 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...
-
Direct chromatographic methods in the context of green analytical chemistry
PublicationWe review analytical protocols based on gas and liquid chromatography (GC and LC), but involving no sample preparation.Green analytical chemistry seeks to minimize negative impacts of analytical chemistry. Direct analytical methods ideally fulfillthis requirement, as they preclude sample preparation - the most polluting step of the analytical procedure.We describe examples of GC methodologies for environmental and food analysis...
-
Paired domination versus domination and packing number in graphs
PublicationGiven 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...
-
Shear band evolution phenomena in direct shear test modelled with DEM.
PublicationA direct shear test is widely used in the geotechnical engineering field. It is an easy and quick test to measure the shear properties of soil. This test often replaces more expensive and difficult tri-axial shear test. Despite that the direct shear test is known and used for a long time, it is still not well investigated at the grain scale. This paper deals with the micro behaviour of the cohesionless sand inside the direct shear...
-
A memory efficient and fast sparse matrix vector product on a Gpu
PublicationThis 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
PublicationGiven 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,...
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważ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...
-
Named Property Graphs
Publication -
Serialization for Property Graphs
Publication -
On the deficiency of bipartite graphs
Publication -
Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublicationRozdział 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.
PublicationProblem 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.
PublicationNiniejszy 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.
PublicationRozdział 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.
PublicationRozdział 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
PublicationIn 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...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn 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?
PublicationThe 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
PublicationWe 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...
-
Binary-Encounter Model for Direct Ionization of Molecules by Positron-Impact
PublicationWe introduce two models for the computation of direct ionization cross sections by positron impact over a wide range of collision energies. The models are based on the binary-encounter-Bethe model and take into account an extension of the Wannier theory. The cross sections computed with these models show good agreement with experimental data. The extensions improve the agreement between theory and experiment for collision energies...
-
A new relevant membrane application: CO2 direct air capture (DAC)
PublicationSince carbon dioxide (CO2) is the primary greenhouse gas emitted into the atmosphere due to human activities, strong research efforts have been developed towards capturing and decreasing its production. Unfortunately, specific processes and activities make it impossible to avoid CO2 emissions. Among the different strategies scientists propose for CO2 reduction, direct CO2 capture from the atmosphere, also known as direct air capture...