نتایج جستجو برای: dual construct

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

Journal: :Des. Codes Cryptography 2018
Masaaki Harada

We give a classification of four-circulant singly even self-dual [60, 30, d] codes for d = 10 and 12. These codes are used to construct extremal singly even self-dual [60, 30, 12] codes with weight enumerator for which no extremal singly even self-dual code was previously known to exist. From extremal singly even self-dual [60, 30, 12] codes, we also construct extremal singly even self-dual [58...

Journal: :Spine 2000
I Oda B W Cunningham G A Lee K Abumi K Kaneda P C McAfee

STUDY DESIGN Three types of anterior thoracolumbar multisegmental fixation were biomechanically compared in construct stiffness and rod-screw strain. OBJECTIVES To investigate the effects of rod diameter and rod number on construct stiffness and rod-screw strain in anterior thoracolumbar multisegmental instrumentation. SUMMARY OF BACKGROUND DATA No studies have been undertaken to investigat...

Journal: :Journal of Object Technology 2009
Stein Krogdahl Birger Møller-Pedersen Fredrik Sørensen

It has been recognized that there is a need for a language mechanism that support reuse of collections of related classes. Existing approaches either use an enclosing class for this purpose, or introduce a special purpose, new language construct. In this paper we explore the use of packages for the grouping of related classes. Ordinary packages are already grouping of classes, so we explore the...

2011
Muhammad Arzaki Djoko Suprijanto D. Suprijanto

We study self-dual codes over ring Z8. We introduce elementary methods to construct new self-dual codes over Z8, for arbitrary length. Mathematics Subject Classification: 94B05, 94B60

2014
Hyun Jin Kim HYUN JIN KIM

We construct new binary optimal self-dual codes of length 50. We develop a construction method for binary self-dual codes with a fixed-point-free automorphism of order 2. Using this method, we find new binary optimal self-dual codes of length 52. From these codes, we obtain Lee-optimal self-dual codes over the ring F2 + uF2 of lengths 25 and 26.

2006
Hang-Chin Lai

Convexity assumptions for fractional programming of variational type are relaxed to generalized invexity. The sufficient optimality conditions are employed to construct a mixed dual programming problem. It will involve the Wolfe type dual and Mond-Weir type dual as its special situations. Several duality theorems concerning weak, strong, and strict converse duality under the framework in mixed ...

2001
Shu-Yen Pan SHU-YEN PAN

In this paper, we construct a splitting of the metaplectic cover of the reductive dual pairs of orthogonal and symplectic groups or the reductive dual pairs of unitary groups over a nonarchimedean local field with respect to a generalized lattice model of the Weil representation. We also prove a result concerning the splitting that we construct and the theta dichotomy for unitary group. The spl...

2012
FREDERICK P. GARDINER YUNPING JIANG

We construct the dual Cantor set for a degree two expanding map f acting as cover of the circle T onto itself. Then we use the criterion for a continuous function on this Cantor set to be the scaling function of a uniformly asymptotically affine UAA expanding map to show that the scaling function for f descends to a continuous function on a dual circle T∗. We use this representation to view the...

2011
Thomas M. Fiore Thomas Noll

The goal of this article is to clarify the relationship between the topos of triads and the neo-Riemannian PLR-group. To do this, we first develop some theory of generalized interval systems: 1) we prove the well known fact that every pair of dual groups is isomorphic to the left and right regular representations of some group (Cayley’s Theorem), 2) given a simply transitive group action, we sh...

2008
David Aspinall Ewen Denney Christoph Lüth

We introduce and study a tactic language, Hitac, for constructing hierarchical proofs, known as hiproofs. The idea of hiproofs is to superimpose a labelled hierarchical nesting on an ordinary proof tree. The labels and nesting are used to describe the organisation of the proof, typically relating to its construction process. This can be useful for understanding and navigating the proof. Tactics...

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

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