Filtry
wszystkich: 1240
wybranych: 868
Wyniki wyszukiwania dla: bounded-degree graphs
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublikacjaW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami o magnesach trwałych (BMMT). W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model SBMT w ujęciu GW dla potrzeb modelowania...
-
<p>Analysis of the degree of acceptance of illness among older adults living in a nursing home undergoing rehabilitation – an observational study</p>
Publikacja -
Modelling of ic engine coolant system with permanent magnet brushless motor - bond graphs approach
PublikacjaW pierwszej części referatu przedstawiono strukturę i podstawy modelowania w ujęciu grafów wiązań nowoczesnego (nowej generacji) systemu chłodzenia silnika spalinowego. Istotną cechą rozważnego systemu chłodzenia jest zastosowanie zintegrowanego układu: pompa cieczy chłodzącej-bezszczotkowy silniki prądu stałego (BSPS, ang. BDCM). W kolejnych częściach referatu przedstawiono: podstawy modelowania całego systemu chłodzenia, model...
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublikacjaThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Three-dimensional fractographic analysis of total fracture areas in 6082 aluminium alloy specimens under fatigue bending with controlled damage degree
Publikacja -
The Use of Artificial Neural Networks and Decision Trees to Predict the Degree of Odor Nuisance of Post-Digestion Sludge in the Sewage Treatment Plant Process
PublikacjaThis paper presents the application of artificial neural networks and decision trees for the prediction of odor properties of post-fermentation sludge from a biological-mechanical wastewater treatment plant. The input parameters were concentrations of popular compounds present in the sludge, such as toluene, p-xylene, and p-cresol, and process parameters including the concentration of volatile fatty acids, pH, and alkalinity in...
-
On parameter derivatives of the associated Legendre function of the first kind (with applications to the construction of the associated Legendre function of the second kind of integer degree and order)
PublikacjaZnaleziono cztery nowe wyrażenia dla pochodnej stowarzyszonej funkcji Legendre'a pierwszego rodzaju względem jej stopnia w przypadku, gdy rząd i stopień są liczbami naturalnymi. Wyniki wykorzystano do podania nowych wyrażeń dla stowarzyszonych funkcji Legendre'a drugiego rodzaju z naturalnymi rzędem i stopniem.
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Modelling of Objects Behaviour for Their Re-identification in Multi-camera Surveillance System Employing Particle Filters and Flow Graphs
PublikacjaAn extension of the re-identification method of modeling objects behavior in muti-camera surveillance systems, related to adding a particle filter to the decision-making algorithm is covered by the paper. A variety of tracking methods related to a single FOV (Field of Vision) are known, proven to be quite different for inter-camera tracking, especially in case of non-overlapping FOVs. The re-identification methods refer to the...
-
Effect of the production method on the properties of RS3/RS4 type resistant starch. Part 2. Effect of a degree of substitution on the selected properties of acetylated retrograded starch
Publikacja -
An influence of molecular weight, deacetylation degree of chitosan xerogels on their antimicrobial activity and cytotoxicity. Comparison of chitosan materials obtained using lactic acid and CO2 saturation.
PublikacjaThis paper presents a comparison of the antimicrobial activity and cytotoxicity against L929 cells of chitosan xerogels prepared by dissolving the polymer in a solution of lactic acid (LA) or carbonic acid (CO2) and then freeze-drying. There was no simple relationship between the antimicrobial activity and cytotoxicity of the samples obtained using both techniques (LA and CO2). Chitosan materials obtained by the LA method in a...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Decision Support in Selecting a Reliable Strategy for Sustainable Urban Transport Based on Laplacian Energy of T-Spherical Fuzzy Graphs
Publikacja -
Zero-visibility cops and robber and the pathwidth of a graph
PublikacjaWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
-
Equivalence of equicontinuity concepts for Markov operators derived from a Schur-like property for spaces of measures
PublikacjaVarious equicontinuity properties for families of Markov operators have been – and still are – used in the study of existence and uniqueness of invariant probability for these operators, and of asymptotic stability. We prove a general result on equivalence of equicontinuity concepts. It allows comparing results in the literature and switching from one view on equicontinuity to another, which is technically convenient in proofs....
-
A note on an approximative scheme of finding almost homoclinic solutions for Newtonian systems
PublikacjaIn this work we will be concerned with the existence of an almost homoclinic solution for a perturbed Newtonian system in a finite dimensional space. It is assumed that a potential is C^1 smooth and its gradient is bounded with respect to a time variable. Moreover, a forcing term is continuous, bounded and squere integrable. We will show that the appproximative scheme due to J. Janczewska for a time periodic potential extends to...
-
A survey on known values and bounds on the Shannon capacity
PublikacjaIn this survey we present exact values and bounds on the Shannon capacity for different classes of graphs, for example for regular graphs and Kneser graphs. Additionally, we show a relation between Ramsey numbers and Shannon capacity.
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Product Graph Invariants with Applications in the Theory of Information
PublikacjaThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublikacjaW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
Counting Lattice Paths With Four Types of Steps
Publikacja -
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
A construction for the hat problem on a directed graph
PublikacjaA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
Rothe’s method for physiologically structured models with diffusion
PublikacjaWe consider structured population models with diffusion and dynamic boundary conditions. The respective approximation, called Rothe’s method, produces positive and exponentially bounded solutions. Its solutions converge to the exact solution of the original PDE.
-
Restricted open shop scheduling
PublikacjaIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
Parseval Wavelet Frames on Riemannian Manifold
PublikacjaWe construct Parseval wavelet frames in L 2 (M) for a general Riemannian manifold M and we show the existence of wavelet unconditional frames in L p (M) for 1 < p < ∞. This is made possible thanks to smooth orthogonal projection decomposition of the identity operator on L 2 (M), which was recently proven by Bownik et al. (Potential Anal 54:41–94, 2021). We also show a characterization of Triebel–Lizorkin F sp,q (M) and Besov B...
-
Influence of edge subdivision on the convex domination number
PublikacjaWe 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.
-
Dedicated scheduling of tasks to minimize mean flow time
PublikacjaThis 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.
-
Graph classes generated by Mycielskians
PublikacjaIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Generalized Dobrushin Coefficients on Banach Spaces
PublikacjaThe asymptotic behavior of iterates of bounded linear operators (not necessarily positive), acting on Banach spaces, is studied. Through the Dobrushin ergodicity coefficient, we generalize some ergodic theorems obtained earlier for classical Markov semigroups acting on L1 (or positive operators on abstract state spaces).
-
Wykorzystanie tomografii komputerowej przy analizie jakości zacementowania - migracja gazu
PublikacjaArtykuł przedstawia opis zjawiska znanego w wiertnictwie otworowym jako migracja gazu. Opisano główne przyczyny powstawania tego negatywnego zjawiska polegającego na przepływie gazów a także płynów w zaczynie cementacyjnym lub kamieniu cementowym. Przygotowano próbki imitujące zacementowany odcinek rur okładzinowych. Skupiono się na wykorzystaniu tomografii komputerowej, oraz analizie zrekonstruowanego trójwymiarowego obrazu, w...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublikacjaArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
Robust Monitoring of Water Quality in Drinking Water Distribution System
PublikacjaThe paper develops a novel open loop set bounded observer for robust estimation of water quality in DWDS based on the advanced nonlinear quality dynamics model including disinfections by-products (DBPs). The observer utilises a cooperativeness of the quality dynamics model and is computationally efficient, hence applicable to on-line quality monitoring. The simulation results illustrate its good and sustainable performance.
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublikacjaW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
Monotone iterative method to second order differential equations with deviating arguments involving Stieltjes integral boundary conditions
PublikacjaWe use a monotone iterative method for second order differential equations with deviating arguments and boundary conditions involving Stieltjes integrals. We establish sufficient conditions which guarantee that such problems have extremal solutions in the corresponding region bounded by lower and upper solutions. We also discuss the situation when problems have coupled quasi-solutions. We illustrate our results by three examples.
-
First-order differential equations with nonlocal boundary conditions
PublikacjaWe study a first-order boundary value problem subject to some boundary conditions given by Riemann-Stieltjes integrals. Using a monotone iterative method, we formulate sufficient conditions which guarantee the existence of extremal or quasi-solutions in the corresponding region bounded by upper and lower solutions of our problems. The case when a unique solution exists is also investigated. Some examples are given to illustrate...
-
The complexity of minimum-length path decompositions
PublikacjaWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublikacjaSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
A closer look at how the dispersive liquid–liquid microextraction method works. Investigation of the effect of solvent mixture composition on the quality and stability of the cloudy state
PublikacjaThe dispersive liquid–liquid microextraction (DLLME) is one of the most popular miniaturized extraction procedures. In this paper, the degree of dispersion and dispersion stability were studied with the aim to assess the correlations of these parameters with efficiency for the selected analytical application. The dependence between the degree of dispersion (cloudy state quality) and its stability obtained by various emulsification...
-
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
PublikacjaWithin this paper, we consider the problem of on-line partitioning the sequence of jobs which are competing for non-sharable resources. As a result of partitioning we get the subsets of jobs that form separate instances of the on-line scheduling problem. The objective is to generate a partition into the minimum number of instances such that the response time of any job in each instance is bounded by a given constant. Our research...
-
Properties of the triset metric for phylogenetic trees
Publikacjathe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
Robustified estimators of radar elevation angle using a specular multipath model
PublikacjaWe consider the problem of estimating the elevation angle in the presence of multipath. The proposed method belongs to the class of maximum likelihood-like estimators and employs a modified specular reflection model that accounts for the uncertainty of the steering vector by assuming that they are subject to unknown deterministic perturbations with bounded norms. The analysis, performed using convex optimization methods, allows...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublikacjaLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
A Strategy to Locate Fixed Points and Global Perturbations of ODE’s: Mixing Topology with Metric Conditions
PublikacjaIn this paper we discuss a topological treatment for the planar system z' = f (t, z) + g(t, z) where f and g are T -periodic in time and g(t, z) is bounded. Namely, we study the effect of g(t, z) in two different frameworks: isochronous centers and time periodic systems having subharmonics. The main tool employed in the proofs consists of a topological strategy to locate fixed points in the class of orientation preserving embedding...