Comparison of two approaches to compute magnetic field in problems with random domains [PDF]
This paper is a postprint of a paper submitted to and accepted for publication in Science, Measurement & Technology, IET and is subject to Institution of Engineering and Technology Copyright.
MAC, Duy Hung +2 more
core +1 more source
Time-domain Transient Magnetic Field Analysis of Metallic Weapons [PDF]
Metallic weapons in a time varying magnetic field develop eddy currents. A method of identification of field bahaviour and eddy current in metallic weapons is established by the application of finite element analysis in time-domain transient magnetic ...
Pati, Prasanta, Mather, Peter
core +4 more sources
Finite element method using vector finite elements applied to eddy current problems [PDF]
Vector fields found in electromagnetics are fundamentally different to vector fields found in other research areas such as structural mechanics. Electromagnetic vector fields possess different physical behaviour patterns and different properties in ...
Adams, Leila
core +1 more source
Field Simulation as an Aid to Machine Design: The State of the Art [PDF]
The paper provides an overview of the modern field simulation techniques available to assist in the design and performance prediction of electromechanical devices, including electric motors. Commercial software, usually based on finite element or related
Sykulski, J.K.
core +2 more sources
Lookup Table-Based Design of Scalar Multiplication for Elliptic Curve Cryptography
This paper is aimed at using a lookup table method to improve the scalar multiplication performance of elliptic curve cryptography. The lookup table must be divided into two polynomials and requires two iterations of point doubling operation, for which ...
Yan-Duan Ning +3 more
doaj +1 more source
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj +1 more source
On the Orders of the Elements of a Square Extension of a Finite Field of Characteristic 2
Let F(2m) will be an arbitrary finite field of characteristic 2. It’s square extension will be considered as an algebra with basiс elements 1 and e over the field F(2m).
Valery Maximov, Victoria Remezova
doaj +1 more source
FINITE UNDECIDABILITY IN NIP FIELDS
AbstractA field K in a ring language $\mathcal {L}$ is finitely undecidable if $\mbox {Cons}(T)$ is undecidable for every nonempty finite $T \subseteq {\mathtt{Th}}(K; \mathcal {L})$ . We extend a construction of Ziegler and (among other results) use a first-order classification of Anscombe and Jahnke to prove every NIP henselian nontrivially ...
openaire +1 more source
Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields
The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix B ∈ 𝔽n×n is defined as ℓ1ℓ2· · · ℓn, where ℓj ∈ {A, S, N} according to whether all, some but not all, or none of the principal minors of order j of B are nonzero ...
Dukes Peter J., Martínez-Rivera Xavier
doaj +1 more source
Model theory of finite fields and pseudo-finite fields
This article gives a survey of the main results obtained to date on finite fields and pseudo-finite fields. In his famous paper ``The elementary theory of finite fields'' [Ann. Math. (2) 88, 239-271 (1968; Zbl 0195.05701)], \textit{J. Ax} has shown that the set \(T_f\) of sentences true in all finite fields is decidable.
openaire +1 more source

