نتایج جستجو برای: wall structural partition

تعداد نتایج: 591732  

Journal: :Electronic Notes in Discrete Mathematics 2015
Márcia R. Cerioli Taísa L. Martins

Miklavič and Milanič (2011) introduced the connections among the classes of equistable, general partition and triangle graphs. We present results concerning the three classes aforementioned. In particular, we show that the general partition and triangle classes are both closed under the operations of substitution, induction and contraction of modules. Moreover, we show that the triangle conditi...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علم و صنعت ایران 1380

در این پایان نامه خواص و جنبه های مختلف کربن معرفی و مروری کلی بر روشهای ساخت ، ساختار و خواص انواع مختلف کربن از کربنهای bulk(شامل گرافیت ، گرافیت turbostratic، الیاف کربن، دوده هاو ... ) تا کربنهای نانومقیاس (شامل fullerenes ، کپسولهای نانومقیاس ، کربنهای nanotube و ... ) ارائه می شود. عمده کار متوجه کربنهای nanotube(اعم از multi-wall و single-wall ) است و ساختار ، عیوب شبکه ای و روشهای ساخت ...

Journal: :The EMBO journal 2007
Jakob Møller-Jensen Simon Ringgaard Christopher P Mercogliano Kenn Gerdes Jan Löwe

Accurate DNA partition at cell division is vital to all living organisms. In bacteria, this process can involve partition loci, which are found on both chromosomes and plasmids. The initial step in Escherichia coli plasmid R1 partition involves the formation of a partition complex between the DNA-binding protein ParR and its cognate centromere site parC on the DNA. The partition complex is reco...

2007
Shao-You Zhao Yao-Zhong Zhang

By means of the Drinfeld twists, we derive the determinant representations of the partition functions for the gl(1|1) and gl(2|1) supersymmetric vertex models with domain wall boundary conditions. In the homogenous limit, these determinants degenerate to simple functions.

Journal: :Journal of the Korea institute for structural maintenance and inspection 2016

Journal: :Discrete Mathematics 2010
Bill Jackson Tibor Jordán

For each rational number q ≥ 1, we describe two partitions of the vertex set of a graph G, called the q-brick partition and the q-superbrick partition. The special cases when q = 1 are the partitions given by the connected components and the 2-edge-connected components of G, respectively. We obtain structural results on these partitions and describe their relationship to the principal partition...

2009
MARK-JAN NEDERHOF GIORGIO SATTA

We investigate the problem of computing the partition function of a probabilistic context-free grammar, and consider a number of applicable methods. Particular attention is devoted to PCFGs that result from the intersection of another PCFG and a finite automaton. We report experiments involving the Wall Street Journal corpus.

2005
D. M. Day M. K. Bhardwaj G. M. Reese J. S. Peery

The simulation of three dimensional structural dynamics on massively parallel platforms places stringent requirements on the existing software infrastructure. A constrained and nonlinear graph partitioning problem that arises in scalable iterative substructuring methods, such as FETI methods, is identified. New sufficient criteria on a partition are presented that ensure the applicability of FE...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید