Wyszukiwarka
Filtry
wszystkich: 621
wybranych: 486
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: INTERVAL GRAPH COLORING
-
Software tool for modelling of mechatronic systems with elastic continua
PublikacjaThe paper presents a systematic computational package for modelling and analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The constructed computer program enables the frequency domain analysis of a class of linear systems and to obtain reduced order model in the form of bond graph. Obtained modal bond graph can be directly exported into 20-Sim package to further processing including nonlinear...
-
Weighted 2-sections and hypergraph reconstruction
PublikacjaIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
Finding small-width connected path decompositions in polynomial time
PublikacjaA 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...
-
Methods of measurement signal acquisition from the rotational flow meter for frequency analysis
PublikacjaOne of the simplest and commonly used instruments for measuring the flow of homogeneous substances is the rotational flow meter. The main part of such a device is a rotor (vane or screw) rotating at a speed which is the function of the fluid or gas flow rate. A pulse signal with a frequency proportional to the speed of the rotor is obtained at the sensor output. For measurements in dynamic conditions, a variable interval between...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublikacjaIn 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 Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Eigenfaces, Fisherfaces, Laplacianfaces, Marginfaces – How to Face the Face Verification Task
PublikacjaThis paper describes the exhaustive tests of four known methods of linear transformations (Eigenfaces, Fisherfaces, Laplacianfaces and Marginfaces) in the context of face verification task. Additionally, we introduce a new variant of the transformation (Laplacianface + LDA), and the specific interval-based decision rule. Both of them improve the performance of face verification, in general, however, our experiments show that the...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA 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...
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublikacjaIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....
-
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')...
-
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)....
-
All graphs with paired-domination number two less than their order
PublikacjaLet 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...
-
Modelling and analysis of beam/bar structure by application of bond graphs
PublikacjaThe paper presents an uniform, port-based approach to modelling of beam/bar systems (trusses). Port-based model of such distributed parameter system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The constructed computational package enables the frequency...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
New Approach to Noncasual Identification of Nonstationary Stochastic FIR Systems Subject to Both Smooth and Abrupt Parameter Changes
PublikacjaIn this technical note, we consider the problem of finite-interval parameter smoothing for a class of nonstationary linear stochastic systems subject to both smooth and abrupt parameter changes. The proposed parallel estimation scheme combines the estimates yielded by several exponentially weighted basis function algorithms. The resulting smoother automatically adjusts its smoothing bandwidth to the type and rate of nonstationarity...
-
Sport-related concussion alters cerebral hemodynamic activity during controlled respiration
PublikacjaThis study investigated cerebral hemodynamic activity following sport-related concussion. Prefrontal cortex oxygenation was assessed by near-infrared spectroscopy (NIRS) during a controlled breathing protocol. Wavelet transformation of the NIRS signals showed significant decreases in HbO2 and HbD amplitude at the respiratory frequency interval (0.10–0.6 HZ) from preseason baseline to acute concussion. These results suggest a decreased...
-
Fractional Problems with Right-Handed Riemann-Liouville Fractional Derivatives
PublikacjaIn this paper, we investigate the existence of solutions for advanced fractional differential equations containing the right-handed Riemann-Liouville fractional derivative both with nonlinear boundary conditions and also with initial conditions given at the end point T of interval [0,T ]. We use both the method of successive approximations, the Banach fixed point theorem and the monotone iterative technique, as well. Linear problems...
-
IZOLACJA I IDENTYFIKACJA NATURALNYCH SUBSTANCJI BARWIĄCYCH OBECNYCH W PRÓBKACH FARB ARTYSTYCZNYCH I TKANINACH POCHODZENIA HISTORYCZNEGO
PublikacjaNatural organic dyes are group of substances that belong to various types of chemical compounds. The most commonly used in paintings and dyeing textiles were naturally occurring dyestuffs from group of anthraquinones, flavones and indigoid dyes. Identification of coloring substances present in historical artistic paints provides relevant information for a wide range of specialists dealing with works of art and in the field of conservation science....
-
A risk comparison framework for autonomous ships navigation
PublikacjaMaritime autonomous surface ships (MASS) may operate in three predefined operational modes (OM): manual, remote, or autonomous control. Determining the appropriate OM for MASS is important for operators and competent authorities that monitor and regulate maritime traffic in given areas. However, a science-based approach to this respect is currently unavailable. To assist the selection of the proper OM, this study presents a risk-based...
-
Fractional problems with advanced arguments
PublikacjaThis paper concerns boundary fractional differential problems with advanced arguments. We investigate the existence of initial value problems when the initial point is given at the end point of an interval. Nonhomogeneous linear fractional differential equations are also studied. The existence of solutions for fractional differential equations with advanced arguments and with boundary value problems has been investigated by using...
-
Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs
PublikacjaIn the following paper it will be presented a new model for analysis (in polynomial time) of the effectiveness of the guard systems. Therewill be presented its practical applications in problems such as searching for the weakest points of the system, planning guards' paths or cameras deployment, switching image from multiple cameras on several monitors, or interception of the intruder. This model is based on describing the guarded...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
The complexity of bicriteria tree-depth
PublikacjaThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Capacity analysis of the selected track system in partially ordered space
PublikacjaA proper location of the interval sections has significant impact on the traffic flow in the railway track network. This issue is critical during line modernization as well as when a new solution accounting for the traffic forecast at particular element of the railway track network is developed . However, the situation is more complex and more expensive for railway stations since improvement of the capacity requires critical organizational...
-
Generalized Savitzky–Golay filters for identification of nonstationary systems
PublikacjaThe problem of identification of nonstationary systems using noncausal estimation schemes is consid-ered and a new class of identification algorithms, combining the basis functions approach with localestimationtechnique,isdescribed.Unliketheclassicalbasisfunctionestimationschemes,theproposedlocal basis function estimators are not used to obtain interval approximations of the parametertrajectory, but provide a sequence of point...
-
Errors of a Linear Current Approximation in High-Speed PMSM Drives
PublikacjaCurrent sampling techniques and predictive algorithms used in the digital control of electric drives rely on a simple mathematical model that assumes linear current changes upon constant supplying voltages. This paper identifies rotor movement as a factor that makes this assumption invalid when the rotor covers an angular distance of a few tens of degrees during the control interval duration. The errors of the linear current approximation...
-
The Effect of Full-Cell Impregnation of Pine Wood (Pinus sylvestris L.) on Changes in Electrical Resistance and on the Accuracy of Moisture Content Measurement Using Resistance Meters
PublikacjaThe impact of the full-cell impregnation of pine wood was investigated with respect to changes in electrical resistance and the accuracy of moisture content measurement. This study compared the resistance of impregnated and untreated pine timber harvested from the northern part of Poland (Pomeranian region). The wood was impregnated by the vacuum-pressure method. The preservative (TANALITH E 3475) and coloring (TANATONE 3950) agents...
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
The hat problem on cycles on at least nine vertices
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...
-
Isolation Number versus Domination Number of Trees
PublikacjaIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
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.
-
Estimating the parameter of inequality aversion on the basis of a parametric distribution of incomes
PublikacjaResearch background: In applied welfare economics, the constant relative inequality aversion function is routinely used as the model of a social decisionmaker’s or a society’s preferences over income distributions. This function is entirely determined by the parameter, ε, of inequality aversion. However, there is no authoritative answer to the question of what the range of ε an analyst should select for empirical work. Purpose...
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublikacjaOne 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...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Secure Italian domination in graphs
PublikacjaAn 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...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublikacjaIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
ANALIZA PRZEPUSTOWOŚCI WYBRANEGO UKŁADU TOROWEGO W PRZESTRZENI CZĘŚCIOWO – UPORZĄDKOWANEJ
PublikacjaNa sieci kolejowej istotny wpływ na płynność ruchu mają odpowiednio usytuowane odcinki odstępowe. Z podobną sytuacją mamy do czynienia przy modernizacji stacji kolejowych i tworzeniu nowych rozwiązań, w których należy uwzględnić prognozy rozwoju ruchu na danym elemencie sieci kolejowej. Jednak w przypadku stacji sytuacja staje się dużo bardziej skomplikowana i kosztowna, gdyż poprawa przepustowości wymaga istotnych zmian organizacyjnych...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublikacjaThe 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...
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
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...
-
Bounds on the cover time of parallel rotor walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublikacjaWe 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...
-
Modeling the impact of discretizing rotor angular position on computation of field-oriented current components in high speed electric drives
PublikacjaModern drives consist of alternating current electric motors, and the field-oriented control (FOC) of such motors enables fast, precise, and robust regulation of a drive's mechanical variables such as torque, speed, and position. The control algorithm, implemented in a microprocessor, requires feedback from motor currents, and the quality of this feedback is essential to a drive's control properties. Motor phase currents are sampled...
-
Modeling nutrient removal and energy consumption in an advanced activated sludge system under uncertainty
PublikacjaActivated sludge models are widely used to simulate, optimize and control performance of wastewater treatment plants (WWTP). For simulation of nutrient removal and energy consumption, kinetic parameters would need to be estimated, which requires an extensive measurement campaign. In this study, a novel methodology is proposed for modeling the performance and energy consumption of a biological nutrient removal activated sludge system...
-
Prediction of energy consumption and evaluation of affecting factors in a full-scale WWTP using a machine learning approach
PublikacjaTreatment of municipal wastewater to meet the stringent effluent quality standards is an energy-intensive process and the main contributor to the costs of wastewater treatment plants (WWTPs). Analysis and prediction of energy consumption (EC) are essential in designing and operating sustainable energy-saving WWTPs. In this study, the effect of wastewater, hydraulic, and climate-based parameters on the daily consumption of EC by...
-
Mild X-linked Alport syndrome due to the COL4A5 G624D variant originating in the Middle Ages is predominant in Central/East Europe and causes kidney failure in midlife
PublikacjaA study of 269 children enrolled into a National Registry for children with persistent glomerular hematuria identified 131 individuals with genetically confirmed X-linked Alport Syndrome. A single variant c.1871G>A p.Gly624Asp (G624D) in COL4A5 was predominant and accounted for 39% of Xlinked Alport Syndrome in unrelated Polish families (44 of 113). To evaluate its origins, the genetic variation in a 2.79 Mb segment encompassing...
-
Rigorous numerics for critical orbits in the quadratic family
PublikacjaWe develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition P of the parameter interval Ω=[1.4,2] into almost 4 million subintervals, for each of which we compute to high precision the...