Filtry
wszystkich: 114
Wyniki wyszukiwania dla: MINIMAL DOUBLE DOMINATING SET
-
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 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Minimal Sets of Lefschetz Periods for Morse-Smale Diffeomorphisms of a Connected Sum of g Real Projective Planes
PublikacjaThe dataset titled Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes contains all of the values of the topological invariant called the minimal set of Lefschetz periods, computed for Morse-Smale diffeomorphisms of a non-orientable compact surface without boundary of genus g (i.e. a connected sum of g real projective planes), where g varies from 1 to...
-
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)....
-
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...
-
Complexity Issues on of Secondary Domination Number
PublikacjaIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Critical graphs upon multiple edge subdivision
PublikacjaA subset D of V (G) is a dominating set of a graph G if every vertex of V (G) − D has at least one neighbour in D; let the domination number γ(G) be the minimum cardinality among all dominating sets in G. We say that a graph G is γ-q-critical if subdividing any q edges results in a graph with domination number greater than γ(G) and there exists a set of q − 1 edges such that subdividing these edges results in a graph with domination...
-
Entropy function application within the selection process of diagnostic parameters of marine diesel and gas turbine engines
PublikacjaThe paper presents the method of conducting an analysis of the diagnostic informativeness among the parameters characterizing the observed gas dynamic processes carried out within working spaces of marine diesel and gas turbine engines. An entropy function, as the measure of uncertainty of the identified states' set of the engine unfitness was applied. Having evaluated the diagnostic information the most adequate parameters were...
-
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|...
-
The database of odd algebraic periods for quasi-unipotent self-maps of a space having the same homology group as the connected sum of g tori
Dane BadawczeThe dataset consists of 20 files indexed by numbers g=1,...,20. Each file provides sets of odd algebraic periods for all quasi-unipotent self-maps of a space having the same homology groups as the connected sum of g tori. Let us remark that each data set covers all algebraical restrictions that come from zeta functions for the sets of minimal Lefschetz...
-
Extending touch-less interaction with smart glasses by implementing EMG module
PublikacjaIn this paper we propose to use temporal muscle contraction to perform certain actions. Method: The set of muscle contractions corresponding to one of three actions including “single-click”, “double-click” “click-n-hold” and “non-action” were recorded. After recording certain amount of signals, the set of five parameters was calculated. These parameters served as an input matrix for the neural network. Two-layer feedforward neural...
-
Database of algebraic periods of quasi-unipotent orientation-preserving homeomorphisms of orientable surfaces
Dane BadawczeThe set of algebraic periods of a map contains important information about periodic points and, in addition, is a homotopy invariant of the map. It is determined by indices of nonzero Dold coefficients which are computed purely algebraically from maps induced on homology groups of a considered space. In this dataset, we include for a given g=1,2,...,30,...
-
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
PublikacjaDisjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k> 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links...
-
Generic invariant measures for iterated systems of interval homeomorphisms
PublikacjaIt is well known that iterated function systems generated by orientation preserving homeomorphisms of the unit interval with positive Lyapunov exponents at its ends admit a unique invariant measure on (0, 1) provided their action is minimal. With the additional requirement of continuous differentiability of maps on a fixed neighbourhood of {0,1} { 0 , 1 } , we present a metric in the space of such systems which renders it complete....
-
INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS
PublikacjaA minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network...
-
Minimal number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublikacjaLet M be a smooth compact and simply-connected manifold with simply-connected boundary ∂M, r be a fixed odd natural number. We consider f, a C1 self-map of M, preserving ∂M . Under the assumption that the dimension of M is at least 4, we define an invariant Dr(f;M,∂M) that is equal to the minimal number of r-periodic points for all maps preserving ∂M and C1-homotopic to f. As an application, we give necessary and sufficient...
-
Stability of roof trusses stiffened by trapezoidal sheeting and purlins
PublikacjaIn the article linear buckling analysis of a set of steel trusses braced by purlins and trapezoidal sheeting are conducted. The buckling load factor due to the height of a corrugated sheeting profile is investigated in parametric studies. The minimal height of trapezoidal sheeting required for preventing the sheeting and chords of the trusses against the buckling is obtained. Two groups of models are considered: “axial” model as...
-
Featured based CAVE software factory
PublikacjaIn the paper we convey the lessons learned along the path we have gone through several years since establishing a room-sized CAVE installation at our university, from craft manufacturing and ad-hoc software reuse of VR software products to the robust feature driven software product line (SPL) implementing the Product Line Engineering (PLE) factory paradigm. With that we can serve all our departments and other entities from the...
-
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,...
-
Thermal Buckling Analysis of Circular Bilayer Graphene sheets Resting on an Elastic Matrix Based on Nonlocal Continuum Mechanics
PublikacjaIn this article, the thermal buckling behavior of orthotropic circular bilayer graphene sheets embedded in the Winkler–Pasternak elastic medium is scrutinized. Using the nonlocal elasticity theory, the bilayer graphene sheets are modeled as a nonlocal double–layered plate that contains small scale effects and van der Waals (vdW) interaction forces. The vdW interaction forces between the layers are simulated as a set of linear springs...
-
Full CI ground state potential energy curves and one-electron relativistic corrections for hydrogen molecule in various basis sets
Dane BadawczeThis dataset consists of Full CI ground state Born-Oppenheimer potential energy curves and one-electron relativistic corrections for hydrogen dimer. Nonrelativistic energies, as well as one electron relativistic corrections (treated perturbatively with help of the Cowan-Griffin Hamiltonian) are presented for internuclear distances between 0.8 and 10...
-
Towards a classification of networks with asymmetric inputs
PublikacjaCoupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart et al (2003 SIAM J. Appl. Dyn. Syst. 2, 609–646), Golubitsky et al (2005 SIAM J. Appl. Dyn. Syst. 4, 78–100) and Field (2004 Dyn. Syst. 19, 217–243). It is known that two non-isomorphic n-cell coupled networks can determine the same sets of...
-
Using Minimum Actuators to Control Shape and Stress of a Double Layer Spherical Model Under Gravity and Lateral Loadings
PublikacjaSpherical domes are picturesque structures built in developed countries to attract tourists. Due to horizontal and vertical overloading, the structures’ attractive shapes may be disturbed, and some members' stress may exceed the elastic level. In this paper, the shape and stress of a deformed double-layer spherical numerical model due to simultaneous lateral and vertical loadings are controlled, meanwhile, the number of actuators...
-
Redukcja czasu analizy MZP przez ograniczenie rozmiaru rozwiązania
PublikacjaAnaliza drzew niezdatności jest uznaną metodą analizy bezpieczeństwa systemów. Notacja ECSDM pozwala definiować zależności czasowe między zdarzeniami drzewa oraz przeanalizować je w celu określenia zależności pomiędzy zdarzeniami z Minimalnych Zbiorów Przyczyn (MZP). Dzięki wprowadzeniu klasyfikacji zdarzeń z MZP można wyodrębnić zależności czasowe istotne dla zapobiegania wywoływania hazardu przez konkretny MZP. Pozostałe zależności...
-
ADAPTIVE BACKSTEPPING TRACKING CONTROL FOR OVER-ACTUATED DP MARINE VESSEL WITH INERTIA UNCERTAINTIES
PublikacjaDesigning a tracking control system for an over-actuated dynamic positioning marine vessel in the case of insufficient information on environmental disturbances, hydrodynamic damping, Coriolis forces and vessel inertia characteristics is considered. The designed adaptive MIMO backstepping control law with control allocation is based on Lyapunov control theory for cascaded systems to guarantee stabilization of the marine vessel...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublikacjaW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
Data on LEGO sets release dates and retail prices combined with aftermarket transaction prices between June 2018 and June 2023.
Dane BadawczeThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction.
-
The importance of the bottom layer in double-layer porous asphalt for noise reduction
PublikacjaDouble-layer porous asphalt concrete (DPAC) surfaces are generally considered to be the acoustically most effective low noise road surfaces ready for implementation. While DPAC used on highways in warm climates may have an average life of around 8 years, in Scandinavia with severe winter climate DPAC usually survive only about 3 years; partly due to wear of studded tyres. An ongoing project in Sweden, applying DPAC and single-layer...
-
On the size of identifying codes in triangle-free graphs
PublikacjaIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Sodium alginate decreases the permeability of intestinal mucus
PublikacjaIn the small intestine the nature of the environment leads to a highly heterogeneous mucus layer primarily composed of the MUC2 mucin. We set out to investigate whether the soluble dietary fibre sodium alginate could alter the permeability of the mucus layer. The alginate was shown to freely diffuse into the mucus and to have minimal effect on the bulk rheology when added at concentrations below 0.1%. Despite this lack of interaction...
-
eFRADIR: An Enhanced FRAmework for DIsaster Resilience
PublikacjaThis paper focuses on how to increase the availability of a backbone network with minimal cost. In particular, the new framework focuses on resilience against natural disasters and is an evolution of the FRADIR/FRADIR-II framework. It targets three different directions, namely: network planning, failure modeling, and survivable routing. The steady state network planning is tackled by upgrading a sub-network (a set of links termed...
-
Vehicle detector training with minimal supervision
PublikacjaRecently many efficient object detectors based on convolutional neural networks (CNN) have been developed and they achieved impressive performance on many computer vision tasks. However, in order to achieve practical results, CNNs require really large annotated datasets for training. While many such databases are available, many of them can only be used for research purposes. Also some problems exist where such datasets are not...
-
Short & double rotation of Miscanthus x giganteus on marginal soil with biochars amendments - elemental composition of plant biomass
Dane BadawczeThis dataset provides the results of short and double rotations of Miscanthus giganteus on marginal soils. Biochars were added to poor soil to improve its properties. The experimental pots were also fed with alternative fertilizer, which included spent coffee grounds and NPK standard fertilizer. This data set contains the elemental composition results...
-
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...
-
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...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Potential energy curves, transition and permanent dipole moments of KRb
PublikacjaWe present extensive calculations of 48 adiabatic potential energy curves of the KRb molecule. Efforts have been focused on preparing the appropriate basis sets. Compared to previous approaches, the set of new potential energy curves is extended to higher excitations, including the single-excited K(4s2S)+Rb(5d2D) and double-excited K(4p2P)+Rb(5p2P) atomic limits. Larger distances between nuclei are also taken into account. New...
-
Global defensive secure structures
PublikacjaLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
Super tough interpenetrating polymeric network of styrene butadiene rubber‐poly (methyl methacrylate) incorporated with general purpose carbon black ( N660 )
PublikacjaA classic set of polymeric interpenetrating polymeric network (IPN) microcomposites has been fabricated using an elastomer—styrene butadiene rubber [SBR], a thermoplastic poly(methyl methacrylate)-PMMA and with carbon black (CB)-N660 as a filler and reinforcing agent. This synthesized IPN composite can be promisingly employed as a toughened plastic and vibrational damper in a wide service range with excellent thermal stability,...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,7 V at 189 mA. Sample 61.
Dane BadawczeDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,7 V and discharged to 10 mV by constant current 189 mA. Sample 61.The images were taken with thermographic camera VigoCAM V50. The sample was covered by black graphite paint to ensure uniform surface...
-
The Concept of a Measurement Data Acquisition Platform Based on Compressive Sensing
PublikacjaThe paper introduces the concept of a modern software-hardware platform for data acquisition and analysis, capable of efficiently handling vast amounts of measurement data in real time with minimal energy consumption. The current methodologies for information acquisition are predicated upon traditional sampling techniques, which frequently yield redundant data necessitating subsequent compression. The novel approach is based on...
-
Computational Bar Size Optimization of Single Layer Dome Structures Considering Axial Stress and Shape Disturbance
PublikacjaA computational method is proposed in this paper to minimize the material usage in the construction of modern spatial frame structures by prestressing a minimal number of members. The computational optimization is conducted in two steps. Firstly, a numerical model of a single-layer dome structure is used to minimize the cross-sectional area through several iterations. Different assumed ratios (r) ranging from 0.95 to 0.75 are multiplied...
-
Surface Charge Density Spectra: Complex Analysis of the Electrical Double Layer Developed from Measurements of Hexanol Adsorption Kinetics
PublikacjaA procedure for deriving surface charge density spectra from differential capacitance data is presented in this study, providing a deeper analysis of the generated charge. A set of simulated differential capacitance spectra was determined for three types of adsorption process control: diffusion control, adsorption control, and mixed control. Based on the differential capacitance curves and spectra, surface charge density spectra...
-
Acoustic lifecycle study of the double-layer porous asphalt on E4 in Huskvarna, Sweden
PublikacjaIn 2010 a double-layer porous asphalt concrete (DPAC) pavement was constructed on the E4 motorway through the Swedish city Huskvarna. Earlier experience in Sweden indicated that it was feasible to obtain a high initial noise reduction but due to the widespread use of studded tires in winter, clogging and ravelling created losses of around 2 dB per year, with an expected acoustical lifetime of only 3 years. However, the improved...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 4 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 4 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 6 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 6 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 7 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 7 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 5 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 5 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 8 and homology groups with the sum of ranks less or equal to 10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 8 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Molecular Strategy for Survival at a Critical High Temperature in Eschierichia coli
PublikacjaThe molecular mechanism supporting survival at a critical high temperature (CHT) in Escherichia coli was investigated. Genome-wide screening with a single-gene knockout library provided a list of genes indispensable for growth at 47°C, called thermotolerant genes. Genes for which expression was affected by exposure to CHT were identified by DNA chip analysis. Unexpectedly, the former contents did not overlap with the latter except...