The Tree Decomposition Conjecture by Bárat and Thomassen states that for every tree T there exists a natural number k(T ) such that the following holds: If G is a k(T )-edge-connected simple graph with size divisible by the size of T , then G can be edge-decomposed into subgraphs isomorphic to T . The results on modulo k-orientations by Thomassen show that the Tree Decomposition Conjecture hold...

MOTIVATION Automatic decomposition of a multi-domain protein into individual domains represents a highly interesting and unsolved problem. As the number of protein structures in PDB is growing at an exponential rate, there is clearly a need for more reliable and efficient methods for protein domain decomposition simply to keep the domain databases up-to-date. RESULTS We present a new algorith...

Hexahedral meshing needs performing volume decomposition that decomposes a complex shape into simple hex meshable sub-domains, which is a very time-consuming and experience needed work. It is necessary to research and develop intelligent swept volume decomposition approaches. The fundamental work of the volume decomposition approaches based on reconstruction of swept features is to recognize th...

Given graphs G and H and a positive number b, a weighted (H, b)-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms an H-subgraph. We assign a weight of b to each H-subgraph in the decomposition and a weight of 1 to single edges. The total weight of the decomposition is the sum of the weights of all elements in the decomposition. Let φ(n,H...

An H-decomposition of a graph G is a partition of the edge-set of G into subsets, where each subset induces a copy of the graph H. A k-orthogonal H-decomposition of a graph G is a set of k H-decompositions of G, such that any two copies of H in distinct H-decompositions intersect in at most one edge. In case G=Kn and H=Kr , a k-orthogonal Kr -decomposition of Kn is called an (n, r, k) completel...

The introduction of lifting implementations for image wavelet decomposition generated possibilities of several applications and several adaptive decomposition variations. The prediction step of a lifting stage constitutes the interesting part of the decomposition since it aims to reduce the energy of one of the decomposition bands by making predictions using the other decomposition band. In tha...

one of the locations of renal artery atherosclerosis is at the orifice of the renal artery, therefore thestructure of this orifice was assessed in 6 normal, adult male dogs by light microscopy (lm) andtransmission electron microscopy (tem). for the lm study, processed tissues were embedded in paraffinand sectioned serially into 6-μm thickness. sections were stained with orcein. for the tem stud...

In K-edge decomposition imaging for the multienergy system with photon counting detectors (PCDs), energy bins significantly affect intensity of extracted signal. Optimized can provide a better signal to improve quality images and have potential reduce amount contrast agents. this article, we present Gaussian spectrum selection method (GSSM) which extract an optimized by optimizing compared conv...