A possible framework of the Lipkin model obeying the SU(n) algebra in arbitrary fermion number. I: The SU(2) algebras extended from the conventional fermion pair and determination of the minimum weight states [PDF]
The minimum weight states of the Lipkin model consisting of n single-particle levels and obeying the su(n)-algebra are investigated systematically. The basic idea is to use the su(2)-algebra which is independent of the su(n)-algebra.
Y. Tsue +3 more
openalex +3 more sources
Minimum Weight Pseudo-Triangulations [PDF]
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S))· log n) which is shown to be asymptotically worst-case optimal, i.e., there exists a point set S for which every pseudotriangulation has ...
Gudmundsson, Joachim +1 more
openaire +4 more sources
DESIGN AND STUDY OF DRIVE SWIVEL JOINTS FOR HYDRAULIC MANIPULATION SYSTEMS OF MOBILE TRANSPORT-TECHNOLOGICAL MACHINES [PDF]
The paper presents the design and principle of operation of a new type of articulated connection of adjacent links of manipulation systems of mobile transport and technological machines – the drive swivel joints to provide a rotary rela-tive movement of ...
Lagerev A.V., Lagerev I.A.
doaj +1 more source
On McEliece-Type Cryptosystems Using Self-Dual Codes With Large Minimum Weight
One of the Round 3 Finalists in the NIST post-quantum cryptography call is the Classic McEliece cryptosystem. Although it is one of the most secure cryptosystems, the large size of its public key remains a practical limitation. In this work, we propose a
Luca Mariot +2 more
doaj +1 more source
On minimum weight pseudo-triangulations [PDF]
AbstractIn this note we discuss some structural properties of minimum weight pseudo-triangulations of point sets.
Franz Aurenhammer +3 more
openaire +2 more sources
Chemical Reaction Optimization for Minimum Weight Dominating Set
Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight.
A. Pritam Khan Boni +1 more
doaj +1 more source
Kernel Partial Least Squares Feature Selection Based on Maximum Weight Minimum Redundancy
Feature selection refers to a vital function in machine learning and data mining. The maximum weight minimum redundancy feature selection method not only considers the importance of features but also reduces the redundancy among features.
Xiling Liu, Shuisheng Zhou
doaj +1 more source
Crack modeling via minimum-weight surfaces in 3d Voronoi diagrams
As the number one building material, concrete is of fundamental importance in civil engineering. Understanding its failure mechanisms is essential for designing sustainable buildings and infrastructure.
Christian Jung, Claudia Redenbach
doaj +1 more source
Through applying an exemplary design study, the dependencies between current density, temperatures, and weight in an electrical drive system for a small range aircraft with conventional electrical fan or propeller drives are evaluated. This study applies
Jan Hoffmann +2 more
doaj +1 more source
Bounds on minimum weight design [PDF]
A somewhat limited design procedure for elastic-perfectly plastic structures was developed previously [1] ∗ ∗ ^{**} . It is extended here to provide upper and lower bounds on the minimum weight of three dimensional structures and is specialized to safe one and two dimensional structures in ...
R.T. Shield, D.C. Drucker
openaire +3 more sources

