scholarly journals AUTOMATIC WINDING GENERATION USING MATRIX REPRESENTATION - ANFRACTUS TOOL 1.0

2018 ◽  
Vol 58 (1) ◽  
pp. 37 ◽  
Author(s):  
Daoud Ouamara ◽  
Frédéric Dubas ◽  
Mohamed Nadjib Benallal ◽  
Sid Ali Randi ◽  
Christophe Espanet
Keyword(s):  
Matrix Representation ◽  
Automatic Generation ◽  
Harmonic Spectrum ◽  
Electrical Machines ◽  
Generation Process ◽  
Magnetomotive Force ◽  
Research Software ◽  
Input Parameters ◽  
The Matrix ◽  
Original Approach

This paper describes an original approach dealing with AC/DC winding design in electrical machines. A research software called “ANFRACTUS Tool 1.0”, allowing automatic generation of all windings in multi-phases electrical machines, has been developed using the matrix representation. Unlike existent methods, where the aim is to synthesize a winding with higher performances, the proposed method provides the opportunity to choose between all doable windings. The specificity of this approach is based on the fact that it take only the slots, phases and layers number as input parameters. The poles number is not requested to run the generation process. Windings generation by matrix representation may be applied for any number of slots, phases and layers. The software do not deal with the manner that coils are connected but just the emplacement of coils in each slot with its current sense. The waveform and the harmonic spectrum of the total magnetomotive force (MMF) are given as result.

scholarly journals GENERAL CALCULATION OF WINDING FACTOR FOR MULTI-PHASE/-LAYER ELECTRICAL MACHINES IRRESPECTIVE OF POLES NUMBER

2019 ◽  
Vol 59 (2) ◽  
pp. 153-161
Author(s):  
Daoud Ouamara ◽  
Frédéric Dubas ◽  
Sid Ali Randi ◽  
Mohamed Nadjib Benallal ◽  
Christophe Espanet
Keyword(s):  
Single Phase ◽  
Matrix Representation ◽  
Electrical Machines ◽  
Phase Layer ◽  
Rotor Design ◽  
The Matrix ◽  
New Feature ◽  
Multi Phase ◽  
Winding Factor ◽  
General Method

In this paper, a method to calculate the winding factor by only considering stator parameters without the rotor ones is developed. This is interesting because it allows the separation of the stator and rotor design, unlike the existing methods in the literature. A general method based on the matrix representation of a winding is presented. This approach requires the knowledge of four parameters : i) slots number, ii) phases number, iii) layers number, and iv) single-phase spatial distribution. A new feature of the multi-layer windings is introduced, it is called false-zero windings, which is divided into two categories: i) α-windings (i.e., odd false-zero windings), and ii) β-windings (i.e., even false-zero windings). The windings having no false-zero are categorized as γ-windings. The calculations are applied for single and multi-phase/-layer windings. The results of the comparison are satisfactory. The code used for the calculation is given in Appendix.

Molecules in strong laser fields: vibrational inversion and harmonic generation

1994 ◽  
Vol 72 (3) ◽  
pp. 673-677 ◽  
Author(s):  
Eric E. Aubanel ◽  
André D. Bandrauk
Keyword(s):  
Harmonic Generation ◽  
Laser Pulses ◽  
Harmonic Spectrum ◽  
Femtosecond Laser Pulses ◽  
Generation Process ◽  
High Order Harmonic Generation ◽  
Vibrationally Excited ◽  
Potential Wells ◽  
High Order Harmonic ◽  
Vibrational Levels

We examine two consequences of the unique behaviour of molecules in strong fields. First, by time gating of laser-induced avoided crossings with femtosecond laser pulses, one can obtain efficient vibrational inversion into a narrow distribution of vibrational levels of a molecular ion. We demonstrate this by numerical solution of the time-dependent Schrödinger equation for [Formula: see text] Second, we show results of numerical calculation with vibrationally excited [Formula: see text] of harmonic generation up to the 11th order of an intense 1064- nm laser. We predict that competition of photodissociation can be minimized by trapping the molecule in high-field-induced potential wells, thus enhancing the high-order harmonic generation process. Furthermore, the harmonic spectrum can serve as a measure of the structure of these laser-induced potentials.

MRHS solver based on linear algebra and exhaustive search

2018 ◽  
Vol 12 (3) ◽  
pp. 143-157 ◽  
Author(s):  
Håvard Raddum ◽  
Pavol Zajac
Keyword(s):  
Linear Algebra ◽  
Matrix Representation ◽  
Equation System ◽  
Exhaustive Search ◽  
Binary Matrix ◽  
Algebraic Attacks ◽  
The Matrix ◽  
Speed Up ◽  
Symmetric Key

Abstract We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks. We give an algorithm for solving the system and compute its complexity. The complexity is normally close to exhaustive search on the variables representing the user-selected key. Finally, we show that for some variants of LowMC, the joined MRHS matrix representation can be used to speed up regular encryption in addition to exhaustive key search.

scholarly journals The Explicit Laplace Transform for the Wishart Process

2014 ◽  
Vol 51 (3) ◽  
pp. 640-656 ◽  
Author(s):  
Alessandro Gnoatto ◽  
Martino Grasselli
Keyword(s):  
Differential Equation ◽  
Ordinary Differential Equation ◽  
Laplace Transform ◽  
Explicit Formula ◽  
Time Integral ◽  
Variation Of Constants ◽  
The Matrix ◽  
Wishart Process ◽  
New Formula ◽  
Original Approach

We derive the explicit formula for the joint Laplace transform of the Wishart process and its time integral, which extends the original approach of Bru (1991). We compare our methodology with the alternative results given by the variation-of-constants method, the linearization of the matrix Riccati ordinary differential equation, and the Runge-Kutta algorithm. The new formula turns out to be fast and accurate.

Molecular and morphometric characterisation of Xiphinema globosum Sturhan, 1978 (Nematoda: Longidoridae) from Spain

Nematology ◽  
2011 ◽  
Vol 13 (1) ◽  
pp. 17-28 ◽  
Author(s):  
Blanca Landa ◽  
Carolina Cantalapiedra-Navarrete ◽  
Juan Palomares-Rius ◽  
Pablo Castillo ◽  
Carlos Gutiérrez-Gutiérrez
Keyword(s):  
Phylogenetic Trees ◽  
18S Rrna ◽  
Matrix Representation ◽  
Natural Environments ◽  
28S Rrna ◽  
Parsimony Method ◽  
Rdna Genes ◽  
Supertree Method ◽  
The Matrix ◽  
Relationship Of

AbstractDuring a recent nematode survey in natural environments of the Los Alcornocales Regional Park narrow valleys, viz., the renowned 'canutos' excavated in the mountains that maintain a humid microclimate, in southern Spain, an amphimictic population of Xiphinema globosum was identified. Morphological and morphometric studies on this population fit the original and previous descriptions and represent the first report from Spain and southern Europe. Molecular characterisation of X. globosum from Spain using D2-D3 expansion regions of 28S rRNA, 18S rRNA and ITS1-rRNA is provided and maximum likelihood and Bayesian inference analysis were used to reconstruct phylogenetic relationships within X. globosum and other Xiphinema species. A supertree solution of the different phylogenetic trees obtained in this study and in other published studies using rDNA genes are presented using the matrix representation parsimony method (MRP) and the most similar supertree method (MSSA). The results revealed a closer phylogenetic relationship of X. globosum with X. diversicaudatum, X. bakeri and with some sequences of unidentified Xiphinema spp. deposited in GenBank.

Leontev Input-Output Balance Model as a Dynamic System Control Problem

2021 ◽  
pp. 66-82
Author(s):  
S.N. Masaev
Keyword(s):  
Dynamic System ◽  
Matrix Representation ◽  
External Environment ◽  
Balance Model ◽  
System Control ◽  
Operational Mode ◽  
Input Output ◽  
System A ◽  
The Matrix ◽  
Research Show

The purpose of the study was to determine the problem of control of a dynamic system of higher dimension. Relying on Leontev input-output balance, we formalized the dynamic system and synthesized its control. Within the research, we developed a mathematical model that combines different working objects that consume and release various resources. The value of the penalty for all nodes and objects is introduced into the matrix representation of the problem, taking into account various options for their interaction, i.e., the observation problem. A matrix representation of the planning task at each working object is formed. For the formed system, a control loop is created; the influencing parameters of the external environment are indicated. We calculated the system operational mode, taking into account the interaction of the nodes of objects with each other when the parameters of the external environment influence them. Findings of research show that in achieving a complex result, the system is inefficient without optimal planning and accounting for the matrix of penalties for the interaction of nodes and objects of the dynamic system with each other. In a specific example, for a dynamic system with a dimension of 4.8 million parameters, we estimated the control taking into account the penalty matrix, which made it possible to increase the inflow of additional resources from the outside by 2.4 times from 130 billion conv. units up to 310 conv. units in 5 years. Taking into account the maximum optimization of control in the nodes, an increase of 3.66 times in the inflow of additional resources was ensured --- from 200.46 to 726.62 billion rubles

Matrix representation of formal polynomials over max-plus algebra

2020 ◽  
pp. 2150216
Author(s):  
Cailu Wang ◽  
Yuegang Tao
Keyword(s):  
Matrix Method ◽  
Polynomial Algorithm ◽  
Polynomial Function ◽  
Matrix Representation ◽  
Sufficient Condition ◽  
Polynomial Functions ◽  
Canonical Forms ◽  
Necessary And Sufficient Condition ◽  
The Matrix ◽  
Necessary And Sufficient

This paper proposes the matrix representation of formal polynomials over max-plus algebra and obtains the maximum and minimum canonical forms of a polynomial function by standardizing this representation into a canonical form. A necessary and sufficient condition for two formal polynomials corresponding to the same polynomial function is derived. Such a matrix method is constructive and intuitive, and leads to a polynomial algorithm for factorization of polynomial functions. Some illustrative examples are presented to demonstrate the results.

Sign in / Sign up

Export Citation Format

Share Document