Search
Filters
total: 1985
filtered: 1687
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: DIRECT PRODUCT GRAPHS
-
Deterministic Rendezvous in Restricted Graphs
PublicationIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
The role of robotisation in improving bakery product quality
PublicationThe article aims to present the role of robotisation in increasing bakery product quality, as it is closely linked to machine reliability, as well as hygienic and sanitary conditions. All machines employed in the production process ought to be maintained at full production potential and reliability, which also has a fundamental influence on the final product’s quality. While participating in the 2014-2020 Smart Growth Operational...
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
The Role of a Software Product Manager in Various Business Environments
PublicationThe aim of the paper is to identify the role of the software product manager depending on the size of the company and the characteristics of the product they are working on. This has been achieved in cooperation with 15 experts from the IT industry. The companies were divided into 4 levels of size: micro-enterprises, small businesses, medium businesses and large enterprises. The characteristics of the products were divided into...
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Chromatic cost coloring of weighted bipartite graphs
PublicationGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Reactions of solute species at an electrode modified with titanocene functionalized polypyrrole film: ferrocene and titanocene dichloride
PublicationPo raz pierwszy zbadano możliwość intermediacji ładunku poprzez centra tytanocenowe polimeru modyfikowanego chemicznie związanymi grupami dichloro tytanocenowymido polipirolu. Badano reakcje elektrodowe ferrocenu i dichlorotytanocenu. Wykazano aktywność elektrodową w zakresie potencjałów redoks pary Ti(IV/TiIII)w stosunku do reakcji redoks ferrocenu i reakcji dichlorotytanocenu. Wykazano, że centra TcCl2 polimeru są zadowalająco...
-
NEW PRODUCT DEVELOPMENT FROM THE PERSPECTIVE OF CREATING A COMPETITIVE ADVANTAGE
PublicationIt is acknowledged that achieving product-based competitive advantage is a key task for a company. However, there is still a research gap in determining those specific actions in the process of developing new products that arise from companies' efforts to achieve product-based competitive advantage. Therefore, the aim of this study is to determine the specific actions in the new product development (NPD) process that result from...
-
The impact of end-user participation in IT projects on product usability
PublicationMany companies implementing new IT projects encounter numerous problems with ensuring good final product usability. The strong market competition they experience often results in necessity of undertaking difficult decisions with regard to cost minimization. This may force cuts in usability expertise and consulting, most often by limiting end-user participation in the project. However, it may also result in serious consequences...
-
Evaluation of Selected UX Techniques by Product Managers - A Preliminary Survey
PublicationIn this paper we present the results of an opinion survey among 28 IT product managers who evaluated the subjective usefulness of 24 selected UX techniques to 6 IT product management tasks derived from ProdBOK®. We selected the UX techniques based on the literature review and 6 interviews with experienced IT product managers. Based on the survey results, we propose our recommendation of useful techniques for 5 of the 6 studied...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
The Backbone Coloring Problem for Small Graphs
PublicationIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
Birch sap concentrate as a potential modern food product
PublicationThis paper presents birch sap concentrate obtained by the reverse osmosis method. It is characterized by sweet taste, high content of minerals and no risk to consumers in terms of content of heavy metals standardized in the European Union food legislation. This beverage has all the features of a modern food product, i.e. it has an attractive taste, is obtained using new technology, meets the clean label requirements and can be...
-
Framework for Product Innovation Using SOEKS and Decisional DNA
PublicationProduct innovation always requires a foundation based on both knowledge and experience. The production and innovation process of products is very similar to the evolution process of humans. The genetic information of humans is stored in genes, chromosomes and DNA. Similarly, the information about the products can be stored in a system having virtual genes, chromosomes and decisional DNA. The present paper proposes a framework for...
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Direct detection of quantum entanglement
PublicationBasing on positive maps separability criterion we propose the experimentally viable, direct detection of quantum entanglement. It is efficient and does not require any a priori knowledge about the state. For two qubits it provides a sharp (i.e., “if and only if”) separability test and estimation of amount of entanglement. We view this method as a new form of quantum computation, namely, as a decision problem with quantum data structure.
-
Towards Experience-Based Smart Product Design for Industry 4.0
PublicationThis paper presents the concept of smart virtual product development (SVPD) system capable of supporting industrial product development process. It enhances the decision making process during different stages and activities involved in product development i.e. product design, manufacturing, and its inspection planning. The enhancement is achieved by using the explicit knowledge of formal past decision events, which are captured,...
-
Experience-Based Decisional DNA (DDNA) to Support Product Development
PublicationKnowledge and experience are important requirements for product development. The aim of this paper is to propose a systematic approach for industrial product development. This approach uses smart knowledge management system comprising of Set of Experience Knowledge Structure and Decisional DNA (DDNA) along with Virtual Engineering Tools (Virtual engineering object, Virtual engineering process, and Virtual engineering factory)....
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Non-isolating 2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Interval incidence coloring of subcubic graphs
PublicationIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
The Technological Advancement of New Products, Product Newness and Market Information
PublicationThe purpose of this study is to propose product newness and obtaining market information as mediators of the relationship between the technological advancement of a new product and its commercial success. So far, little is known about the mediators of this relationship but knowledge about the factors that strengthen or weaken it is valid, both for the theory and practice of new product management. On the one hand, product newness...
-
Experience based decisional DNA to support smart product design
PublicationThis paper presents the idea of Smart Virtual Product Development (SVPD) system to support product design. The foundations of the system are based upon smart knowledge management techniques called Set of Experience Knowledge Structure (SOEKS) and Decisional DNA (DDNA). It enhances the industrial product development process by using the previous experiential knowledge gathered from the formal decisional activities. This experiential...
-
On domination multisubdivision number of unicyclic graphs
PublicationThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
On-line ranking of split graphs
PublicationA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Amplification of a single-locus variable-number direct-repeats with restriction fragment length polymorphism (DR-PCR/RFLP) for genetic typing of Acinetobacter baumannii strains
PublicationW celu poszukiwania nowych metod typowania genetycznego szczepów Acinetobacter baumannii przydatnych w szpitalnych badaniach epidemiologicznych przeprowadzono analizę dostępnych w banku genów sekwencji szczepów referencyjnych na obecność nowych motywów repetytywnych. Do badania polimorfizmu sekwencji repetytywnych w szczepach Acinetobacter sp. wykorzystano proste powtórzenia typu "direct repeat" (DR) zlokalizowane w jednym miejscu...
-
Mass Spectrometry-Based Direct Analytical Techniques
PublicationDirect analysis of samples is considered as one of the most environmentally sustainable solutions in analytical chemistry. In the ideal case, such solutions do not require sample preparation and analytes separation steps, therefore do not consumpt harmful substances (or consumpt only minimum amounts of them) and do not generate hazardous waste. Technical solutions for direct analysis also offer miniaturized and field-portable analyzers...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Community of Practice for Product Innovation Towards the Establishment of Industry 4.0
PublicationThe aim of this paper is to present the necessity of formulating the Community of Practice for Product Innovation process based on Cyber-Physical Production Systems towards the establishment of Industry 4.0. At this developing phase of Industry 4.0, there is a need to define a clear and more realistic approach for implementation process of Cyber-Physical Production Systems in manufacturing industries. Today Knowledge Management...
-
Multiacces quantum communication and product higher rank numerical range
PublicationIn the present paper we initiate the study of the product higher rank numerical range. The latter, being a variant of the higher rank numerical range, is a natural tool for study- ing a construction of quantum error correction codes for multiple access channels. We review properties of this set and relate it to other numerical ranges, which were recently introduced in the literature. Further, the concept is applied to the construction...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Establishing intelligent enterprise through community of practice for product innovation
PublicationThis paper presents the idea of implementing the virtual Community of Practice for Product Innovation processes towards the establishment of intelligent enterprise. Since the fourth industrial revolution is passing through the developing phase, implementation of Cyber-Physical Production Systems require more realistic approach. Knowledge Management and Engineering plays an important role in manufacturing industries facing global...
-
The paired-domination and the upper paired-domination numbers of graphs
PublicationIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
Direct spectrum detection based on Bayesian approach
PublicationThe paper investigates the Bayesian framework's performance for a direct detection of spectrum parameters from the compressive measurements. The reconstruction signal stage is eliminated in by the Bayesian Compressive Sensing algorithm, which causes that the computational complexity and processing time are extremely reduced. The computational efficiency of the presented procedure is significantly...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Degree product formula in the case of a finite group action
PublicationLet V, W be finite dimensional orthogonal representations of a finite group G. The equivariant degree with values in the Burnside ring of G has been studied extensively by many authors. We present a short proof of the degree product formula for local equivariant maps on V and W.
-
Experience Based Decisional DNA (DDNA) to Support Sustainable Product Design
PublicationThis paper presents the idea of providing engineering design knowledge to designers working on sustainable product design and development process. The new product development process often requires significant amount of design knowledge which can be saved and recalled by designers during the design process. This knowledge is very important for successful sustainable product development as it can include material selection, product...
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Carburization Behavior of High-Grade Pellets After Direct Reduction in Pure Hydrogen
PublicationCarburization is a critical aspect in the iron and steel industry as it significantly affects the mechanical and chemical properties of the final product. This study provides a comprehensive analysis of the carburization potential of high-grade quality iron ore pellets after direct reduction in pure hydrogen. The results show that the porosity of the pellets has a significant impact on the efficiency and success of the direct reduction...
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...