Wyniki wyszukiwania dla: MIXED CONVEX ROOF - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: MIXED CONVEX ROOF
Przykład wyników znalezionych w innych katalogach

Wyniki wyszukiwania dla: MIXED CONVEX ROOF

  • Squashed entanglement for multipartite states and entanglement measures based on the mixed convex roof

    Publikacja
    • D. Yang
    • K. Horodecki
    • M. Horodecki
    • P. Horodecki
    • J. Oppenheim
    • W. Song

    - IEEE TRANSACTIONS ON INFORMATION THEORY - Rok 2009

    New measures of multipartite entanglement are constructedbased on two definitions of multipartite information anddifferent methods of optimizing over extensions of the states. Oneis a generalization of the squashed entanglement where one takesthe mutual information of parties conditioned on the state's extensionand takes the infimum over such extensions. Additivity ofthe multipartite squashed entanglement is proved for both versionsof...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Acceleration of Electromagnetic Simulations on Reconfigurable FPGA Card

    Publikacja

    - Rok 2023

    In this contribution, the hardware acceleration of electromagnetic simulations on the reconfigurable field-programmable-gate-array (FPGA) card is presented. In the developed implementation of scientific computations, the matrix-assembly phase of the method of moments (MoM) is accelerated on the Xilinx Alveo U200 card. The computational method involves discretization of the frequency-domain mixed potential integral equation using...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Weakly convex and convex domination numbers of some products of graphs

    If $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}...

  • The convex domination subdivision number of a graph

    Publikacja

    Let 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...

    Pełny tekst do pobrania w portalu

  • On the connected and weakly convex domination numbers

    In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...

    Pełny tekst do pobrania w portalu

  • Weakly convex domination subdivision number of a graph

    Publikacja

    - FILOMAT - Rok 2016

    A 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...

    Pełny tekst do pobrania w portalu

  • Influence of edge subdivision on the convex domination number

    We study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.

    Pełny tekst do pobrania w portalu

  • Weakly convex and convex domination numbers.

    Publikacja

    - Rok 2004

    W artykule przedstawione są nowo zdefiniowane liczby dominowania wypukłego i słabo wypukłego oraz ich porównanie z innymi liczbami dominowania. W szczególności, rozważana jest równość liczby dominowania spójnego i wypukłego dla grafów kubicznych.

  • Stability of roof trusses stiffened by corrugated sheets

    Publikacja

    - Rok 2010

    The present parametric study is devoted to the stability analysis of a set of trusses stiffened by decking of corrugated steel sheets. For different parameters of corrugated sheets the critical loading of the roof is calculated. In the parametrical analysis the threshold bracing condition of the roof is obtained. Then the geometrically non-linear analysis of trusses braced by corrugated sheets was conducted. As a results of non-linear...

  • The reasons of considarable deflections of roof trusses in engineering analysis

    Publikacja

    - Rok 2013

    The aim of the paper is to present an unconventional analysis of deformations of roof trusses of an exhibition pavilion. Structure of the main hall of the pavilion consists of repeatable span frames with steel pillars made of I-sections, fastened in the foundations and hinged supporting roof girders. The roof trusses, completed in steel construction, have undergone considerable permanent deflections. Deformations of the lower chord...