scholarly journals Algorithmic and explicit determination of the Lovász number for certain circulant graphs

2007 ◽  
Vol 155 (14) ◽  
pp. 1812-1825 ◽  
Author(s):  
Valentin Brimkov
Keyword(s):  
Circulant Graphs ◽  
Explicit Determination ◽  
Lovász Number

A Hybrid Highly Parallelizable Algorithm for the Dynamics of Rigid Body Chain Systems

1999 ◽  
Author(s):  
Shanzhong Duan ◽  
Kurt S. Anderson
Keyword(s):  
Rigid Body ◽  
Degrees Of Freedom ◽  
High Efficiency ◽  
Equations Of Motion ◽  
Constraint Forces ◽  
Dynamics Of Rigid Body ◽  
A Chain ◽  
Explicit Determination ◽  
Order Algorithm

Abstract The paper presents a new hybrid parallelizable low order algorithm for modeling the dynamic behavior of multi-rigid-body chain systems. The method is based on cutting certain system interbody joints so that largely independent multibody subchain systems are formed. These subchains interact with one another through associated unknown constraint forces f¯c at the cut joints. The increased parallelism is obtainable through cutting the joints and the explicit determination of associated constraint loads combined with a sequential O(n) procedure. In other words, sequential O(n) procedures are performed to form and solve equations of motion within subchains and parallel strategies are used to form and solve constraint equations between subchains in parallel. The algorithm can easily accommodate the available number of processors while maintaining high efficiency. An O[(n+m)Np+m(1+γ)Np+mγlog2Np](0<γ<1) performance will be achieved with Np processors for a chain system with n degrees of freedom and m constraints due to cutting of interbody joints.

Two new measurement methods for explicit determination of complex permittivity

1998 ◽  
Vol 46 (11) ◽  
pp. 1614-1619 ◽  
Author(s):  
C. Wan ◽  
B. Nauwelaers ◽  
W. De Raedt ◽  
M. Van Rossum
Keyword(s):  
Complex Permittivity ◽  
Measurement Methods ◽  
Explicit Determination

On the Lovász Number of Certain Circulant Graphs

2000 ◽  
pp. 291-305 ◽  
Author(s):  
Valentin E. Brimkov ◽  
Bruno Codenotti ◽  
Valentino Crespi ◽  
Mauro Leoncini
Keyword(s):  
Circulant Graphs ◽  
Lovász Number

Extensions of I-Bisimple Semigroups

1967 ◽  
Vol 19 ◽  
pp. 419-426 ◽  
Author(s):  
R. J. Warne
Keyword(s):  
Homomorphic Image ◽  
Natural Order ◽  
Isomorphism Theorem ◽  
Maximal Group ◽  
Homomorphism Theorem ◽  
Complete Determination ◽  
Explicit Determination ◽  
Usual Order

A bisimple semigroup S is called I-bisimple if Es, the set of idempotents of S, with its natural order is order-isomorphic to I, the set of integers, under the reverse of the usual order. In (9), the author completely determined the structure of I-bisimple semigroups mod groups; in this paper, he also gave an isomorphism theorem, a homomorphism theorem, an explicit determination of the maximal group homomorphic image, and a complete determination of the congruences for these semigroups.

Sign in / Sign up

Export Citation Format

Share Document