Wyszukiwarka
Filtry
wszystkich: 1983
-
Katalog
- Publikacje 1685 wyników po odfiltrowaniu
- Czasopisma 20 wyników po odfiltrowaniu
- Konferencje 9 wyników po odfiltrowaniu
- Osoby 28 wyników po odfiltrowaniu
- Projekty 6 wyników po odfiltrowaniu
- Kursy Online 14 wyników po odfiltrowaniu
- Wydarzenia 5 wyników po odfiltrowaniu
- Dane Badawcze 216 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: DIRECT PRODUCT GRAPHS
-
A comprehensive overview of software product management challenges
PublikacjaThe principal focus of software product management is to ensure the economic success of the product, which means to prolong the product life as much as possible with modest expenditures to maximizs profits. Software product managers play an important role in the software development organization while being responsible for the strategy, business case, product roadmap, high-level requirements, product deployment (release-management),...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
New Product Creativity Dimensions and Performance
PublikacjaA new product’s meaningfulness and novelty are recognized as two distinct and important dimensions. Thus, researchers started to investigate their impact on new product performance. However, researchers’ reports on the impact of novelty on performance are still mixed, and several issues need to be solved. One of these problems is comparing how strongly each of these dimensions affects the new product performance. The other is to...
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Edge and Pair Queries-Random Graphs and Complexity
PublikacjaWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
The new concept of product. Cooling band
PublikacjaThe chapter below presents the innovative solution consist in applying the cooling band to help holding the hot object. The solution was found through substitute inputs analysis and brain storm method. The new product was submitted in Polish Patent Office under the No. W.120905.
-
Different sources of market information and product innovativeness
PublikacjaThe purpose of this study is to identify whether the gathering of market information from different sources – i.e. from customers, competitors and other entities – is related to product innovativeness. The relationships proposed so far have not been empirically investigated but they can have important theoretical and practical implications for product innovation. To achieve the purpose of the paper data concerning 287 new products...
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Non-isolating bondage in graphs
PublikacjaA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 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 at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Theory and Applications of Graphs
Czasopisma -
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
The hat problem on a union of disjoint graphs
PublikacjaThe 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...
-
Experience-Based Product Inspection Planning for Industry 4.0
PublikacjaIn this paper we describe how our Smart Virtual Product Development (SVPD) system can be used to enhance product inspection planning. The SVPD system is comprised of three main modules, these being the design knowledge management (DKM) module, the manufacturing capability and process planning (MCAPP) module, and the product inspection planning (PIP) module. Experiential knowledge relating to formal decisional events is collected,...
-
Marek Czachor prof. dr hab.
Osoby -
Tensor-product versus geometric-product coding
PublikacjaKodowanie przy pomocy iloczynów tensorowych, a kodowanie przy pomocy iloczynów geometrycznych. Formalizm jest zilustrowany przy pomocy paru przykładów.
-
Smart Innovation Management in Product Life Cycle
PublikacjaThe present paper proposes a framework for smart innovation management of the product using a Smart Knowledge Management System comprising Set of Experience Knowledge Structure (SOEKS) and Decisional DNA. This proposed system will allow the entrepreneurs and organizations to perform the innovation process technically and quickly as this framework will store knowledge as well as experiences of the past innovations done in various...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn 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
PublikacjaThe 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
PublikacjaIn 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
PublikacjaThe 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
PublikacjaWe 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
PublikacjaGiven 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
PublikacjaPo 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
PublikacjaIt 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
PublikacjaMany 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
PublikacjaIn 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
PublikacjaIn 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
PublikacjaIn 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
PublikacjaThe 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
PublikacjaWe 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
PublikacjaThis 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
PublikacjaProduct 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
PublikacjaIn 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...
-
Towards Experience-Based Smart Product Design for Industry 4.0
PublikacjaThis 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
PublikacjaKnowledge 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
PublikacjaA 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
PublikacjaA 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
PublikacjaIn 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
PublikacjaThe 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
PublikacjaThis 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...
-
Direct detection of quantum entanglement
PublikacjaBasing 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.
-
On domination multisubdivision number of unicyclic graphs
PublikacjaThe 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
PublikacjaA 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
PublikacjaIn 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
PublikacjaW 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...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe 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
PublikacjaThe 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...
-
Mass Spectrometry-Based Direct Analytical Techniques
PublikacjaDirect 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...