Search
Filters
total: 902
filtered: 632
-
Catalog
Chosen catalog filters
Search results for: CATEGORY GRAPH
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 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 a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublicationIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Self diagnostics using smart glasses - preliminary study
Publicationn this preliminary study we analyzed the possibility of the reliable measurement of biomedical signals with some potential hardware extensions of smart glasses. Using specially designed experimental prototypes four category of biomedical signals were measured: electrocardiograms, electromyograms, electroencephalograms and respiration waveforms. Experi- ments with volunteers proved that using even simple construc- tion of sensors...
-
Load test of new European record holder in span length among extradosed type bridges
PublicationThe article presents acceptance load tests of a newly built extradosed MS-3 bridge located along the national road DK-16 near Ostróda (Poland). The structure features significant dimension in European reference scale. It is a new record holder in span length regarding this distinct bridge category. Its length ranges 206 m. Static and dynamic load tests were performed here. The program was extended by entire structural laser scanning...
-
Analiza spostrzeżeń podczas audytów w przedsiębiorstwach z branży spożywczej
PublicationAnalizowano dane z 54 przedsiębiorstw potwierdzających zgodność z wdrożonym systemem ISO 22000 w latach 2005–2013 przez jednostkę certyfikującą DNV GL–BA. Przedstawiono najczęściej spotykane kategorie niezgodności stwierdzane podczas audytów certyfikujących w przedsiębiorstwach należących do łańcucha żywnościowego. Przeanalizowano występujące problemy wpływające na bezpieczeństwo żywności podczas procesu produkcyjnego. Obliczono...
-
Compensation of Voltage Drops in Trolleybus Supply System Using Battery-Based Buffer Station
PublicationThis paper analyzes the results of a trial operation of a battery-based buffer station supporting a selected section of trolleybus power supply systems in Pilsen, Czech Republic. The buffer station aims to prevent the catenary from excessive voltage drops in a part of the route that is most remote from the traction substation. Compensation of voltage drops is carried out by continuously measuring the catenary voltage and injecting...
-
SAILING ROUTE PLANNING METHOD CONSIDERING VARIOUS USER CATEGORIES
PublicationThe article describes the methodology related to determining the multi-criteria routes for sailing ships. Details of sea area discretisation and discretisation of the description of the sailing vessel properties and manoeuvring principles are shown. User requirements were specified (for five different categories of users) and on this basis the criteria for selecting the most suitable shipping route were formulated. The presented...
-
Asymptotic behaviour in the set of nonhomogeneous chains of stochastic operators
PublicationWe study different types of asymptotic behaviour in the set of (infinite dimensional) nonhomogeneous chains of stochastic operators acting on L1(μ) spaces. In order to examine its structure we consider different norm and strong operator topologies. To describe the nature of the set of nonhomogeneous chains of Markov operators with a particular limit behaviour we use the category theorem of Baire. We show that the geometric structure...
-
Aspect-Oriented Management of Service Requests for Assurance of High Performance and Dependability
PublicationA new approach to service requests management in case of insufficient hardware resources is proposed. It is based on wide aspects of requests analysis and it assures reliable and fast access to priority services. Requests are analyzed for, among others, time of occurrence, category of user who made the request, type of service, current system load and hardware utilization. Deterministic but dynamic rules help to manage system load...
-
Preface
PublicationThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
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...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
The hat problem on cycles on at least nine vertices
PublicationThe 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...
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
Ways of Harmonising Polish Competition Law with the Competition Law of the EU
PublicationThis article discusses the harmonisation of laws within the EU focusing on the specific ways of achieving an approximation of the Polish legal system with European competition law. It identifies and gives an overview of three specific ways of harmonising national laws with EU antitrust provisions: (1) spontaneous (or bottom-up) harmonisation; (2) judicial harmonisation and; (3) legislative harmonisation by means of EU Directives....
-
Analysis of soundscape recordings in close proximity to the road in changeable wather conditions
PublicationThe acoustic vehicle sensing is the least invasive type of traffic detection. Also, acoustic-based vehicle detection technology is insensitive to precipitation and can operate in low light level. Therefore, this kind of method may be used for automatic detection of the vehicle passage events. It can also be employed for measurements of a vehicle speed and the vehicle assignment to the particular category. In this paper the results...
-
A sector-an industry? Definitional challenges in economic sciences
Publicationthe aim of our paper is to present definitional challenges that we as scholars and teachers face while attempting to relate to a sector and an industry terms in economic analyses and from strategic management perspective. we employ secondary research and analyse the state of the academic discourse and common usages of the above terms. we argue that for an economic statistician classifications should be consistent and highlight...
-
Adaptive Method of Raster Images Compression and Examples of Its Applications in the Transport Telematic Systems
PublicationThe paper presents a concept and exemplary application of an adaptive method of compression of raster images which may be applied, i.a. in ITS systems. The described method allows to improve the efficiency of systems belonging to ITS category, which require transmission of large volumes of image data through telecommunications networks. The concept of the adaptive method of compression of raster images described in the paper uses...
-
The entrepreneurship of host cities of the Olympic Games – Between success and social destruction
PublicationMany publications focus on the deficit nature of the Olympic Games organisation, when considered from the point of view of host cities – organisers of such events. However, does such an event actually affect the region and the host country in a positive way? The presented article aims at the assessment of the organisation of mass sports events, such as the Olympic Games, taking into consideration entrepreneurial activities which...
-
Customer Assessment of Brand Valuation and Social Media
PublicationThe research problem engaged in this article is to determine whether contemporary consumers are able to assess brand equity in the overabundance of brands and products with similar features and qualities. The author argues that in the existing circumstances when differences between brands become insignificant the consumer is not capable of assessing their equity adequately. In order to verify the thesis the author has accepted...
-
Machining process sequencing and machine assignment in generative feature-based CAPP for mill-turn parts
PublicationProcess selection and sequencing, as one of the most complex issues when evaluated from a mathematical point of view and crucial in CAPP, still attract research attention. For the current trend of intelligent manufacturing, machining features (MFs) are the information carriers for workpiece geometry and topology representation. They are basically derived from CAD models and are used by downstream engineering applications. A feature-based...
-
Counting Lattice Paths With Four Types of Steps
Publication -
Wordventure - cooperative wordnet editor. Architecture for lexical semantic aquisition
PublicationThis article presents architecture for acquiring lexical semanticsin a collaborative approach paradigm. The system enablesfunctionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation.It has been used for semantic network presentation,and brings simultaneously modification functionality.
-
WordVenture - COOPERATIVE WordNet EDITOR Architecture for Lexical Semantic Acquisition
PublicationThis article presents architecture for acquiring lexical semantics in a collaborative approach paradigm. The system enables functionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation. It has been used for semantic network presentation, and brings simultaneously modification functionality.
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
Distributed NVRAM Cache – Optimization and Evaluation with Power of Adjacency Matrix
PublicationIn this paper we build on our previously proposed MPI I/O NVRAM distributed cache for high performance computing. In each cluster node it incorporates NVRAMs which are used as an intermediate cache layer between an application and a file for fast read/write operations supported through wrappers of MPI I/O functions. In this paper we propose optimizations of the solution including handling of write requests with a synchronous mode,...
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublicationIn this paper, a systematic approach to an extensive search for topologies of cross-coupled filters with generalized Chebyshev response is presented. The technique applies graph theory to find unique, nonisomorphic filter configurations, and tests whether a specific frequency response can be realized in a given set of topologies. The results of the search are then stored in a database of possible filter configurations.
-
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.
-
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.
-
QUALITY GAPS IN HIGHER EDUCATION FROM THE PERSPECTIVE OF STUDENTS
PublicationThe presented research work relates to the category of quality in higher education. This article aims to present the determinants of the quality of education in the context of international standards. The background of the considerations is the Bologna Declaration and the European Higher Education Area. The results of the research carried out with the use of the nominal group method and the data analysis carried out based on the...
-
Wavelet transform-based approach to defect identification in railway carbon contact strips.
PublicationPantographs of electric rail vehicles are fitted with carbon contact strips, which slide along the contact wire of catenary to provide constant electrical contact. Contact strips are exposed to wear and damages. Using damaged contact strips significantly increases the risk of catenary rupture. Therefore, their technical condition has to be inspected frequently. In previous work a 3D laser scanning system was proposed for recording...
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Trees with equal restrained domination and total restrained domination numbers
PublicationW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
Weakly connected domination subdivision numbers
PublicationLiczba podziału krawędzi dla dominowania słabo spójnego to najmniejsza liczba krawędzi jaką należy podzielić, aby wzrosła liczba dominowania słabo wypukłego. W pracy przedstawione są własności liczby podziału krawędzi dla dominowania słabo spójnego dla różnych grafów.
-
Convex universal fixers
PublicationPraca dotyczy dominowania wypukłego w grafach pryzmowych.
-
Total outer-connected domination in trees
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
A note on mixed tree coloring
PublicationZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
Network Approach to Increments of RR-intervals for Visualization of Dynamics of Cardiac Regulation
PublicationThe transition network for RR -increments is pre- sented in a directed and weighted graph, with vertices represent- ing RR -increments and edges corresponding to the order in a sequence of increments. The adjacency matrix and the transition matrix of this network provide a graphical tool which could be useful in the assessment of cardiac regulation. As an example, the method is applied in detecting differences between diurnal activity...
-
3D scanning system for railway current collector contact strips
PublicationUndisturbed collection of current from a contact wire of the catenary constitutes one of the basic elements in reliable operation of electrified rail transport, particularly when vehicles move at high speed. Quality of current collection is influenced by the construction of catenary and current collectors, as well as by the technical condition and regulation of these two elements. Total contact force of a current collector head...
-
Evaluation of Path Based Methods for Conceptual Representation of the Text
PublicationTypical text clustering methods use the bag of words (BoW) representation to describe content of documents. However, this method is known to have several limitations. Employing Wikipedia as the lexical knowledge base has shown an improvement of the text representation for data-mining purposes. Promising extensions of that trend employ hierarchical organization of Wikipedia category system. In this paper we propose three path-based...
-
Fluorescence of p-hydroxyazobenzocrowns – Tautomeric equilibrium effect
PublicationThe spectroscopic properties of a series of para-hydroxyazobenzocrowns, including three novel compounds, were investigated using UV–Vis absorption and emission spectroscopy. This study presents, for the first time, determined quantum yield (QY) values for macrocycles of this category, ranging between 0.122 and 0.195. The highest values were obtained for crowns bearing two phenyl substituents in benzene rings. The impact of aromatic...