Definition. A definable orientation of a definable manifold Y of dimension m is a map s which assigns to each point y ∈ Y a generator s(y) of the local definable homology group H m (Y, Y − y) and which is locally constant in the following sense: for each proper m-ball B of Y there is a class ζB ∈ H m (Y, Y − B) such that for each p ∈ B the natural homomorphism j p : H def m (Y, Y −B)→ H m (Y, Y...

this paper provides a review on major ergodic features of semi-independent hyper mv {algebra dynamical systems. theorems are presentedto make contribution to calculate the entropy. particularly, it is proved that thetotal entropy of those semi-independent hyper mv {algebra dynamical systemsthat have a generator can be calculated with respect to their generator ratherthan considering all the par...

This paper presents an approach to calculate the equivalent stray capacitance (SC) of n-turn of the helical flux compression generator (HFCG) coil with multi layer conductor wire filaments (MLCWF) in the form of rectangular cross-section. This approach is based on vespiary regular hexagonal (VRH) model. In this method, wire filaments of the generator coil are separated into many very small simi...

Several recent cryptographic constructions – including a public key encryption scheme, a fully homomorphic encryption scheme, and a candidate multilinear map construction – rely on the hardness of the short generator principal ideal problem (SG-PIP): given a Z-basis of some principal (fractional) ideal in an algebraic number field that is guaranteed to have an exceptionally short generator with...

It is known that extremal doubly-even self-dual codes of length n ≡ 8 or 0 (mod 24) yield 3or 5-designs respectively. In this paper, by using the generator matrices of bordered double circulant doubly-even self-dual codes, we give 3-(n, k; m)-SEEDs with (n, k, m) ∈ {(32, 8, 5), (56, 12, 9), (56, 16, 9), (56, 24, 9), (80, 16, 52)}. With the aid of computer, we obtain 22 generator matrices of bor...

One of the vexing problems that besets concurrent use of multiple, heterogeneous resources is format multiplicity. C(2)M aims to equip scientists with a wrapper generator on their desktop. The wrapper generator can build wrappers, or converters that can convert data from or into different formats, from a high-level description of the formats. The language in which such a high-level description ...

ly we know that 〈A 〉 always exists since 〈A 〉 = ⋂ {H ⊆ G | A ⊆ H subgroup } But computationally this is useless: we already have to know all subgroups (containing A) to compute the intersection. Even if G is finite and relatively small, there is no hope to build an algorithm on this characterization. Also note that 〈A 〉 is one of the H’s on the right hand side (impredicative definition). So how...

Let T (t), 0 ≤ t < ∞, be a one parameter c0-semigroup of bounded linear operators on a Banach space X with infinitesimal generator A and R(λ, A) be the resolvent operator of A. The Hille-Yosida Theorem for c0-semigroups asserts that the resolvent operator of the infinitesimal generator A satisfies ‖R(λ, A)‖ ≤ M λ−ω for some constants M > 0 and λ ∈ R (the set of real numbers), λ > ω. The object ...