Wyszukiwarka
Filtry
wszystkich: 690
Wyniki wyszukiwania dla: X-OUTER-INDEPENDENT DOMINATING SET
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-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. A total outer-independent dominating set of a graph 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 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph 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 nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 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,...
-
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...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
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...
-
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|...
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Hybrid no-signaling-quantum correlations
PublikacjaFundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...
-
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...
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
A coupled constitutive model for fracture in plain concrete based on continuum theory with non-local softening and eXtended Finite Element Method
PublikacjaThe paper presents a constitutive model for concrete which combines a continuous and discontinuous fracture description. In a continuum regime, two different constitutive laws were used. First, a plasticity model with a Rankine failure criterion and an associated fl ow rule was used. Second, a constitutive law based on isotropic damage mechanics was formulated. In order to capture the width of a localized zone and to obtain mesh-independent...
-
Artificial neural network prophecy of ion exchange process for Cu (II) eradication from acid mine drainage
PublikacjaThe removal of heavy metal ions from wastewater was found to be significant when the cation exchange procedure was used effectively. The model of the cation exchange process was built using an artificial neural network (ANN). The acid mine drainage waste’s Cu(II) ion was removed using Indion 730 cation exchange resin. Experimental data from 252 cycles were recorded. In a column study, 252 experimental observations validated the...
-
Two bacterial small heat shock proteins, IbpA and IbpB, form a functional heterodimer
PublikacjaSmall heat shock proteins (sHsps) are a conserved class of ATP-independent chaperones which in stress conditions bind to unfolded protein substrates and prevent their irreversible aggregation. Substrates trapped in sHsps-containing aggregates are efficiently refolded into native structures by ATP-dependent Hsp70 and Hsp100 chaperones. Most γ-proteobacteria possess a single sHsp (IbpA), while in a subset of Enterobacterales, as...
-
The accretion of the new ice layer on the surface of hexagonal ice crystal and the influence of the local electric field on this process
PublikacjaThe process of creation of a new layer of ice on the basal plane and on the prism plane of a hexagonal ice crystal is analyzed. It is demonstrated that the ordering of water molecules in the already existing crystal affects the freezing. On the basal plane, when the orientations of water molecules in the ice block are random, the arrangement of the new layer in a cubic manner is observed more frequently — approximately 1.7 times...
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
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...
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
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...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA 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,...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a 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. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
On trees attaining an upper bound on the total domination number
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
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...
-
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...
-
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)....
-
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...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
On the super domination number of lexicographic product graphs
PublikacjaThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
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...
-
On the double bondage in graphs
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
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...
-
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)....
-
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')...
-
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...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Asynchronous phase-location system
PublikacjaThis paper presents concept and implementation of digital phase-location system, designed as a navigational aid for marine applications. The main feature of the proposed system is the ability to work in both synchronous mode, with one master station and set of slave stations synchronised with master, and in asynchronous mode with independent clocking of all stations.
-
Digital phase-location system for marine applications
PublikacjaThis paper presents concept and implementation of digital phase-location system, designed as a navigational aid for marine applications. Main feature of proposed system is the ability to work in both synchronous mode, with one master station and set of slave stations synchronized with master, and in asynchronous mode with independent clocking of all stations.
-
Equivariant Morse equation
PublikacjaThe paper is concerned with the Morse equation for flows in a representation of a compact Lie group. As a consequence of this equation we give a relationship between the equivariant Conley index of an isolated invariant set of the flow given by x˙ = − ∇f(x) and the gradient equivariant degree of ∇f. Some multiplicity results are also presented.
-
Phase-difference positioning in asynchronous system
PublikacjaThis paper presents concept and implementation of digital positioning system based on phase difference measurements, designed as a navigational aid for marine applications. Main feature of proposed system is the ability to work in both synchronous mode, with one master station and set of slave stations synchronized with master, and in asynchronous mode with independent clocking of all stations.
-
Determination of the chemical structure of potential organic impurities occurring in drug substance opipramol
PublikacjaThe tricyclic antipsychotic and antidepressant drug opipramol (opipramole) was examined with regard to the chemical structure of its organic impurities. Impurities were isolated from the technical product by chromatographic methods and their chemical structures were established by 1H NMR, MS and FTIR and further confirmed by comparison with commercially available products or with products obtained by independent synthesis, and...
-
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...
-
Fabrication and Crystal Structure of Sol-Gel Deposited BST Thin Films with Compositional Gradient
PublikacjaIn the present research technology of compositionally graded barium strontium titanate Ba1-xSrxTiO3 thin films deposited on stainless steel substrates by sol-gel spin coating followed with thermal annealing at T = 650°C is reported. Results of thermal behavior of the sol-gel derived powders with compositions used for fabrication of graded structure (i.e. with Sr mole fraction x = 0.5, 0.4 and 0.3) are described. X-ray diffraction...
-
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...
-
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...
-
Elemental and tight monogamy relations in nonsignaling theories
PublikacjaPhysical principles constrain the way nonlocal correlations can be distributed among distant parties. These constraints are usually expressed by monogamy relations that bound the amount of Bell inequality violation observed among a set of parties by the violation observed by a different set of parties. We prove here that much stronger monogamy relations are possible for nonsignaling correlations by showing how nonlocal correlations...
-
The Ellenbogen’s “Matter as Software” Concept for Quantum Computer Implementation: IV. The X@C60 Molecular Building Blocks (MBBs) and Computing System Lifetime Estimation
PublikacjaThe problem of approximate lifetimes of individual X@C60 MBBs and tip-based nanofabricated quantum computing device systems is discussed under the conservative assumption of single-point failure. A single chemical transformation of the C60 cage into high-energy opened o-C60 isomer which forms the communication canal for the low energy transfer of an X atom from X@C60 MBB to the outside environment was studied. According to the...
-
Corrosion of evaporator tubes in low emission steam boilers
PublikacjaPurpose of this paper is to reveal the mechanisms of corrosion processes of outer surfaces of low-emission steam boiler evaporator tubes. Examinations were performed to find the reasons of different corrosion susceptibility of tubes situated at combustion chamber on various levels. Examinations were conducted on several segments of 57 x 5.0 mm evaporator tubes made of 16M (16Mo3) steel grade. Segments were taken from level of...
-
Studies on formation and percolation in ionic liquids/TX-100/water microemulsions
PublikacjaTernary microemulsion systems of H2O/Triton X-100/[BMIM][Tf2N], and H2O/Triton X-100/[BMIM][PF6] were prepared, compared and characterized for phase behavior for different water/surfactant ratios, at 25 °C. It was found that a change of an anion structure in the ionic liquids determines the total monophasic area of the systems. A liquid crystalline mesophase was detected in H2O/Triton X-100/[BMIM][PF6]. The microemulsion domains...
-
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,...
-
Full scattering profile of circular optical phantoms mimicking biological tissue
PublikacjaHuman tissue is one of the most complex optical media since it is turbid and nonhomogeneous. In our poster, we suggest a new type of skin phantom and an optical method for sensing physiological tissue condition, basing on the collection of the ejected light at all exit angles, to receive the full scattering profile. Conducted experiments were carried out on an unique set-up for noninvasive encircled measurement. Set-up consisted...
-
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...
-
Ce site dilution effects in the antiferromagnetic heavy fermion CeIn3
PublikacjaLa-doped intermetallic single crystals of Ce1−xLaxIn3 were synthesized via an In self-flux method throughout the entire range (x = 0–1). The prototypical heavy-fermion compound CeIn3 shows an antiferromagnetic phase transition at 10.1 K and becomes superconducting near a critical pressure where TN is completely suppressed. As the La concentration increases, Ce moments are diluted, and the lattice constant increases linearly, satisfying Vegard’s...
-
Randomness Amplification under Minimal Fundamental Assumptions on the Devices
PublikacjaRecently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components...
-
Linux scheduler improvement for time demanding network applications, running on Communication Platform Systems
PublikacjaCommunication Platform Systems as ex. ATCA standard blades located in standardized chassis provides high level communication services between system peripherals. Each ATCA blade brings dedicated functionality to the system but can as well exist as separated host responsible for servicing set of task. According to platform philosophy these parts of system can be quite independent against another solutions provided by competitors....
-
Autocorrelation function for the chosen effective potential of the diatomic silver anion
Dane BadawczeThe process of a two-channel decay of the diatomic silver anion (Ag2-), namely the spontaneous electron ejection giving Ag2 + e- and the dissociation leading to Ag- + Ag is theoretically studied. The ground state potential energy curves (PECs) of the neutral silver dimer and anionic silver diatomic molecule are calculated using the single reference...
-
Non-adiabatic coupling elements between the diatomic silver anion and neutral silver dimer plus continuum electron
Dane BadawczeThe process of a two-channel decay of the diatomic silver anion (Ag2-), namely the spontaneous electron ejection giving Ag2 + e- and the dissociation leading to Ag- + Ag is theoretically studied. The ground state potential energy curves (PECs) of the neutral silver dimer and anionic silver diatomic molecule are calculated using the single reference...
-
Properties of Composite Oxide Layers on The Ti13Nb13Zr Alloy
PublikacjaThe development of composite oxide layers on the Ti13Nb13Zr alloy, their structure and properties have been demonstrated. Two subsequent methods were applied to prepare the composite layers. During the first stage gas oxidation produced a solid oxide layer, and subsequently oxide nanotubes were produced by using an electrochemical method. Scanning electron microscopy (SEM), chemical analysis, energy dispersive X-ray spectroscopy...
-
Mechanical Behavior of Bi-Layer and Dispersion Coatings Composed of Several Nanostructures on Ti Substrate
PublikacjaThree coatings suitable for biomedical applications, including the dispersion coating composed of multi-wall carbon nanotubes (MWCNTs), MWCNTs/TiO2 bi-layer coating, and MWCNTs-Cu dispersion coating, were fabricated by electrophoretic deposition (EPD) on Ti Grade II substrate. Optical microscopy, scanning electron microscopy, energy-dispersive X-ray spectroscopy, and nanoindentation were applied to study topography, chemical, and...
-
Structural properties of mixed conductor Ba1−xGd1−yLax+yCo2O6−δ
PublikacjaBa1−xGd1−yLax+yCo2O6−δ (BGLC) compositions with large compositional ranges of Ba, Gd, and La have been characterised with respect to phase compositions, structure, and thermal and chemical expansion. The results show a system with large compositional flexibility, enabling tuning of functional properties and thermal and chemical expansion. We show anisotropic chemical expansion and detailed refinements of emerging phases as La is...
-
Multi-mode vibronic interactions in the five lowest electronic states of the fluorobenzene radical cation
PublikacjaThe multi-mode vibronic interactions between the five lowest electronic states of the fluorobenzene radical cation are investigated theoretically, based on ab initio electronic structure data, and employing the linear vibronic coupling model. Low-energy conical intersections, and strong vibronic couplings are found to prevail within the set of X-A and B-C-D cationic states, while the interactions between these two sets of states...
-
Gaining knowledge through experience: developing decisional DNA applications in robotics
PublikacjaOmówiono nowatorskie podejscie do zastosowania wiedzy opartej na doświadczeniu i budowie decyzyjnego DNA w obszarach związanych z robotyką.In this article, we explore an approach that integrates Decisional DNA, a domain-independent, flexible, and standard knowledge representation structure, with robots in order to test the usability and suitability of this novel knowledge representation structure. Core issues in using this Decisional...
-
Texture Features for the Detection of Playback Attacks: Towards a Robust Solution
PublikacjaThis paper describes the new version of a method that is capable of protecting automatic speaker verification (ASV) systems from playback attacks. The presented approach uses computer vision techniques, such as the texture feature extraction based on Local Ternary Patterns (LTP), to identify spoofed recordings. Our goal is to make the algorithm independent from the contents of the training set as much as possible; we look for the...
-
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...
-
Facile formation of self-organized TiO2 nanotubes in electrolyte containing ionic liquid - ethylammonium nitrate and their remarkable photocatalytic properties
PublikacjaThe oriented TiO2 nanotube arrays (NTs) are identified as a stable, active and recyclable photocatalytic surface. However, their photoactivity is strictly depended on morphology (especially length), which could be controlled by anodic oxidation parameters, including electrolyte properties. To control the morphology, were successfully synthesized a series of NTs by a novel approach where ionic liquid (IL), ethylammonium nitrate...
-
The influence of the type of halogen substituent and its position on the molecular conformation, intermolecular interactions and crystal packing for a series of 1-benzoyl-3-(halogenophenyl)thioureas
PublikacjaBy the reaction of benzoyl chloride, potassium isothiocyanate and the appropriate halogenoaniline, i.e. 2/3/4-(bromo/iodo)aniline, we have obtained five new 1-benzoyl-3-(halogenophenyl)thioureas, namely, 1-benzoyl-3-(2-bromophenyl)- thiourea and 1-benzoyl-3-(3-bromophenyl)thiourea, C14H11BrN2OS, and 1-benzoyl-3-(2-iodophenyl)thiourea, 1-benzoyl-3-(3-iodophenyl)thiourea and 1-benzoyl-3-(4-iodophenyl)thiourea, C14H11IN2OS. Structural...
-
System for characterisation and multidimensional imaging of seafloor using multibeam sonar data
PublikacjaMultibeam sonars are widely used in applications like high resolution bathymetry measurements, underwater object detection and imaging, etc. Also, they are the promising tool in seafloor characterisation and classification, having several advantages over conventional single beam echosounders. The proposed approach to seafloor classification relies on the combined use of three different techniques. In each of them, a set of descriptors...
-
On Dynamic Extension of a Local Material Symmetry Group for Micropolar Media
PublikacjaFor micropolar media we present a new definition of the local material symmetry group considering invariant properties of the both kinetic energy and strain energy density under changes of a reference placement. Unlike simple (Cauchy) materials, micropolar media can be characterized through two kinematically independent fields, that are translation vector and orthogonal microrotation tensor. In other words, in micropolar continua...
-
The Influence of Selecting Regions from Endoscopic Video Frames on The Efficiency of Large Bowel Disease Recognition Algorithms
PublikacjaThe article presents our research in the field of the automatic diagnosis of large intestine diseases on endoscopic video. It focuses on the methods of selecting regions of interest from endoscopic video frames for further analysis by specialized disease recognition algorithms. Four methods of selecting regions of interest have been discussed: a. trivial, b. with the deletion of characteristic, endoscope specific additions to the...
-
The Potential of Greed for Independence
PublikacjaThe 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...
-
Experimental results of full scattering profile from finger tissue-like phantom
PublikacjaHuman tissue is one of the most complex optical media since it is turbid and nonhomogeneous. We suggest a new optical method for sensing physiological tissue state, based on the collection of the ejected light at all exit angles, to receive the full scattering profile. We built a unique set-up for noninvasive encircled measurement. We use a laser, a photodetector and finger tissues-mimicking phantoms presenting different optical...
-
Universal and contextualized public services: Digital public service innovation framework
PublikacjaIn view of the rising social and economic inequalities, public service delivery should be both universal, i.e. independent of the recipients' social or economic status, and contextualized, i.e. able to compensate for different local needs and conditions. Reconciling both properties requires various forms of innovations, chief among them innovations in digital public services. Building upon the four-stage model underpinning the...
-
Biometric identity verification
PublikacjaThis chapter discusses methods which are capable of protecting automatic speaker verification systems (ASV) from playback attacks. Additionally, it presents a new approach, which uses computer vision techniques, such as the texture feature extraction based on Local Ternary Patterns (LTP), to identify spoofed recordings. We show that in this case training the system with large amounts of spectrogram patches may be difficult, and...
-
Mechanical Behavior of Bi-Layer and Dispersion Coatings Composed of Several Nanostructures on Ti13Nb13Zr Alloy
PublikacjaTitanium implants are commonly used because of several advantages, but their surface modification is necessary to enhance bioactivity. Recently, their surface coatings were developed to induce local antibacterial properties. The aim of this research was to investigate and compare me-chanical properties of three coatings: multi-wall carbon nanotubes (MWCNTs), bi-layer composed of an inner MWCNTs layer and an outer TiO2 layer, and...
-
Trade-offs in multiparty Bell-inequality violations in qubit networks
PublikacjaTwo overlapping bipartite binary input Bell inequalities cannot be simultaneously violated as this would contradict the usual no-signalling principle. This property is known as monogamy of Bell inequality violations and generally Bell monogamy relations refer to trade-offs between simultaneous violations of multiple inequalities. It turns out that multipartite Bell inequalities admit weaker forms of monogamies that allow for violations...
-
Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario
PublikacjaOne of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing...
-
Analysis of server-side and client-side Web-GIS data processing methods on the example of JTS and JSTS using open data from OSM and geoportal
PublikacjaThe last decade has seen a rapid evolution of processing, analysis and visualization of freely available geographic data using Open Source Web-GIS. In the beginning, Web-based Geographic Information Systems employed a thick-client approach which required installation of platform-specific browser plugins. Later on, research focus shifted to platform-independent thin client solutions in which data processing and analysis was performed...
-
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...
-
Evolution of the nanostructure of Pt and Pt–Co polymer electrolyte membrane fuel cell electrocatalysts at successive degradation stages probed by X-ray photoemission
PublikacjaWe present a set of XPS (X-ray photoemission spectroscopy) measurements and detailed data-analysis of electrodes for polymer electrolyte membrane fuel cell (PEMFC) based on carbon supported catalysts (Pt and Pt–Co) subjected to a step-like potential cycling (accelerated degradation test). The results of the measurements complete and corroborate parallel TEM (transmission electron microscopy), XRD (X-ray diffraction) and XAS (X-ray...
-
An interactive system for remote modeling and design validation of hybrid photovoltaic systems
PublikacjaAbstract: A multi-functional demonstrator of the interactive system is presented. The demostrator enables modeling, monitoring and design validation of hybrid photovoltaic systems assisted by fuel cells and thermoelectric generators, as well as experimentation and scientific research. A block diagram of the system is presented and the selection of its components is discussed. Availability of the system via Ethernet or GSM...
-
The Decisional DNA-Based Smart Bike for Internet of Things
PublikacjaIn this paper, we introduce a novel application of the Internet of Things, the Decisional DNAbased Smart Bike. The Decisional DNA is a domain-independent, flexible and standard knowledge representation structure; it allows its domains to acquire and store experiential knowledge and formal decision events in an explicit way. By using Decisional DNA, the sensor-equipped bicycle is able to learn its user’s weight, riding habits, etc....
-
Polynomial analysis as a new way of describing dynamic impedance spectra – Differential and relative impedance spectra
PublikacjaModel measurements of an equivalent electrical system were carried out using the technique of Dynamic Electrochemical Impedance Spectroscopy. The measurement took the form of potentiodynamic changes imposed on the tested system. Using the possibility of continuous impedance measurements, an attempt was made to develop an original and innovative method of analyzing impedance spectrograms, which is termed polynomial analysis. As...
-
Synthesis, structure, DNA binding and anticancer activity of mixed ligand ruthenium(II) complex
PublikacjaIn order to obtain a potential chemotherapeutic which is not affected on the normal BALB/3T3 cell line, a new arene ruthenium(II) complex {[RuCl(L1)(η6-p-cymene)]PF6}2 · H2O has been synthesized by a direct reaction of precursor, [{(η6-p-cymene)Ru(μ-Cl)}2Cl2], with N,N-chelating ligand (L1 - 2,2′-bis(4,5-dimethylimidazole). The compound has been fully characterized by elemental analysis, X-ray diffraction, IR, UV–Vis and 1H, 13C...
-
Lanthanide ions (Eu3+, Er3+, Pr3+) as luminescence and charge carrier centers in Sr2TiO4
PublikacjaA series of strontium orthotitanate (Sr2TiO4) samples doped with 2% of a mole of europium, praseodymium, and erbium were obtained using the solid-state synthesis method. The X-ray diffraction (XRD) technique confirms the phase purity of all samples and the lack of the influence of dopants at a given concentration on the structure of materials. The optical properties indicate, in the case of Sr2TiO4:Eu3+, two independent emission...