Wyszukiwarka
Wyniki wyszukiwania dla: FERTILITY REBOUND
-
Is 9-acridinamine anion a dispersion-bound anion?
Publikacja -
On quantum cryptography with bipartite bound entangled states
PublikacjaOstatnio pokazano bezpośrednie zastosowanie splątania związanego w kryptografii kwantowej. W niniejszym artykule dokonano przeglądu niektórych najnowszych osiągnięć dotyczących tego zagadnienia. W szczególności przypomniano istotne pojęcia i definicje. Ponadto podano nową konstrukcję stanów o splątaniu związanym, posiadających bezpieczne korelacje, dostarczając w ten sposób niskowymiarowe (6x6) stany o splątaniu związanym z niezerowym...
-
Lower bound on the paired domination number of a tree
PublikacjaW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
Bound entanglement for continuous variables is a rare phenomenon
PublikacjaWykazano, że splątanie związane w przypadku zmiennych ciągłych jest rzadkimfenomenem. W szczególności pokazano, że zbiór stanów niedestylowalnych jestnigdzie gęsty w zbiorze wszystkich stanów kwantowych. Poddano dyskusji splą-tanie związane w kontekście liczby Schmidta.
-
Recommendations of the Polish Psychiatric Association for treatment of affective disorders in women of childbearing age. Part III: Approach to pregnancy loss and unsuccessful in vitro treatment of infertility
Publikacja -
On the lower smoothing bound in identification of time-varying systems
PublikacjaIn certain applications of nonstationary system identification the model-based decisions can be postponed, i.e. executed with a delay. This allows one to incorporate in the identification process not only the currently available information, but also a number of ''future'' data points. The resulting estimation schemes, which involve smoothing, are not causal. Assuming that the infinite observation history is available, the paper...
-
A few steps more towards NPT bound entanglement
PublikacjaIn this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of...
-
Distinguishing views in symmetric networks: A tight lower bound
PublikacjaThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
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...
-
Lower bound on the weakly connected domination number of a tree
PublikacjaPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
Fate of Dipole-Bound Anion States when Hydrated
Publikacja -
Is the p-chloroaniline anion bound almost entirely by correlation?
Publikacja -
Active farmsteads are year-round strongholds for farmland birds
Publikacja -
Molecular dynamics of fentanyl bound to μ-opioid receptor
Publikacja -
Elastic modulus of Cement Bound Granular Material (CBGM)
Publikacja -
Lower bound on the distance k-domination number of a tree
PublikacjaW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
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,...
-
W-like bound entangled states and secure key distillation
PublikacjaWe construct multipartite entangled states with underlying W-type structuresatisfying positive partial transpose (PPT) condition under any (N −1)|1 partition. Then we showhow to distill a N-partite secure key from the states using two different methods: direct applicationof local filtering and novel random key distillation scheme in which we adopt the idea from recentresults on entanglement distillation. Open problems and possible...
-
Bound on Bell inequalities by fraction of determinism and reverse triangle inequality
PublikacjaIt is an established fact that entanglement is a resource. Sharing an entangled state leads to nonlocal correlations and to violations of Bell inequalities. Such nonlocal correlations illustrate the advantage of quantum resources over classical resources. In this paper, we quantitatively study Bell inequalities with 2 × n inputs. As found in Gisin et al. [Int. J. Quantum. Inform. 05, 525 (2007)], quantum mechanical correlations...
-
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...
-
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 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...
-
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...
-
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...
-
Dipole-Bound Anions of Glycine Based on the Zwitterion and Neutral Structures
Publikacja -
An excess electron bound to urea. I. Canonical and zwitterionic tautomers
Publikacja -
An excess electron bound to urea oligomers. II. Chains and ribbons
Publikacja -
Rank two bibartite bound entangled states do not exist.
PublikacjaWykazano, że nie istnieją stany rzędu dwa które zawierałyby splątanie. Pokazano związki między lokalnym a globalnym rzędem macierzy gęstości oraz ewentualną możliwością wydestylowania kwantowego splątania.
-
Zero-range potentials for Dirac particles: Bound-state problems
PublikacjaA model in which a massive Dirac particle in $\mathbb{R}^{3}$ is bound by $N\geqslant1$ spatially distributed zero-range potentials is presented. Interactions between the particle and the potentials are modeled by subjecting a particle's bispinor wave function to certain limiting conditions at the potential centers. Each of these conditions is parametrized by a $2\times2$ Hermitian matrix (or, equivalently, a real scalar and a...
-
Laboratory Examination of Frost-heaving Properties of Road Unbound Mixtures Based on Fines Content and Plasticity Index
Publikacja -
Low-dimensional bound entanglement with one-way distillable cryptographic key
PublikacjaIn this paper, we provide a class of bound entangled states that have positive distillable secure key rate. The smallest state of this kind is 4 circle times 4, which shows that peculiar security contained in bound entangled states does not need high-dimensional systems. We show that for these states a positive key rate can be obtained by one-way Devetak-Winter (DW) protocol. Subsequently, the volume of bound entangled key-distillable...
-
An excess electron bound to urea. III. The urea dimer as an electron trap
Publikacja -
Bound-Excited Electronic States of the Anion of 2,3,5,6-Tetrafluoro-7,7,8,8-tetracyanoquinodimethane
Publikacja -
Formation of Enormously Strongly Bound Anionic Clusters Predicted in Binary Superacids
Publikacja -
Large eddy simulation predictions of absolutely unstable round hot jet
Publikacja -
Numerical Modelling of Forced Convection of Nanofluids in Smooth, Round Tubes: A Review
PublikacjaA comprehensive review of published works dealing with numerical modelling of forced convection heat transfer and hydrodynamics of nanofluids is presented. Due to the extensive literature, the review is limited to straight, smooth, circular tubes, as this is the basic geometry in shell-and-tube exchangers. Works on numerical modelling of forced convection in tubes are presented chronologically in the first part of the article....
-
What Can Be Observed Locally? Round based models for quantum distributed computing
PublikacjaW pracy rozważono zagadnienie lokalności w kontekście informacji kwantowej w obliczeniach rozproszonych. Rozważono dwa kwantowe rozszerzenia modelu LOCAL Liniala, otrzymane poprzez: (1) inicjalizację systemu w kwantowym stanie splątanym, (2) zastosowanie kwantowych kanałów komunikacyjnych. Dla obydwu typów rozszerzeń zaproponowano przykłady problemów, których złożoność rundowa ulega redukcji w porównaniu do oryginalnego modelu...
-
The Round Robin approach applied to nanoinformatics: consensus prediction of nanomaterials zeta potential
Publikacja -
Algorytm branch-and-bound dla pewnego problemu szeregowania zadań uwarunkowanych czasowo
PublikacjaW artykule został przedstawiony algorytm branch-and-bound dla problemu szeregowania zadań uwarunkowanych czasowo 1 | pi = 1 + aisi | sum Ci. Przedstawiono także wyniki eksperymentów komputerowych prezentujących wydajność algorytmu. Zastosowanie przedstawionego algorytmu umożliwia powiększenie "obliczalnych" rozmiarów instancji o 6-10 zadań w stosunku do algorytmu pełnego przeszukiwania.
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublikacjaIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....
-
A strongly bound OF3- anion and its unstable parent neutral OF3 species
Publikacja -
Interfacial behavior of polar, weakly polar, and nonpolar compounds bound to activated carbons
Publikacja -
Dirichlet-to-Neumann and Neumann-to-Dirichlet embedding methods for bound states of the Dirac equation
PublikacjaZaprezentowano uogólnienie formalizmu operatorów Dirichleta-Neumanna (DtN) i Neumanna-Dirichleta (NtD) na przypadek równania Diraca. Przedstawiono zastosowanie tego formalizmu do znajdowania poziomów energetycznych cząstki Diraca związanej w potencjale.
-
Dirichlet-to-Neumann and Neumann-to-Dirichlet embedding methods for bound states of the Schrodinger equation.
PublikacjaPrzeformułowano metodę Inglesfielda, stosowaną do obliczania własności stanów związanych równania Schrodingera, stosując formalizm operatorów całkowych Dirichleta-do-Neumanna(DtN) i Neumanna-do-Dirichleta (NtD). Wykorzystano zasady wariacyjne dla energii dopuszczające użycie funkcji próbnych nieciągłych wraz z pochodnymi. Podano metodę konstrukcji jąder operatorów DtN i NtD za pomocą rozwiązań zagadnienia własnego typu Steklova....
-
Experimental Investigations of Forced Convection of Nanofluids in Smooth, Horizontal, Round Tubes: A Review
PublikacjaA comprehensive review of published works dealing with experimental studies of forced convection heat transfer of nanofluids is presented. The survey is limited to straight, smooth, and round tubes. Moreover, only mono nanofluids exhibiting Newtonian behaviour are considered. Works on experimental research of forced convection in tubes are presented in a chronological order in the first part of the article. In this part, attention...
-
An investigation of structural responses of inverted pavements by numerical approaches considering nonlinear stress-dependent properties of unbound aggregate layer
Publikacja -
(MgO)n−(n=1–5)Clusters: Multipole-Bound Anions and Photodetachment Spectroscopy
Publikacja -
Anab initiostudy of the betaine anion–dipole-bound anionic state of a model zwitterion system
Publikacja -
Influence of hydrophobic nanosilica and hydrophobic medium on water bound in hydrophilic components of complex systems
Publikacja -
Graffiti saves birds: A year-round pattern of bird collisions with glass bus shelters
Publikacja