Comparison of motor stator teeth built of soft magnetic composite and laminated silicon steel sheets in an axial flux permanent magnet synchronous machine

This paper compares the iron losses generated by the concentrated excitation windings for the axial flux permanent magnet synchronous machine stator core elements constructed with laminated silicon steel sheets and soft magnetic composites. The two types of eddy current losses for laminated silicon steel sheets are taken into account. A 3D nonlinear finite element method in the time domain is used to calculate all flux density distributions for various frequencies and different magnitudes. Experimental measurements are also performed to validate the 3D model

Vortex-line liquid phases: Longitudinal superconductivity in the lattice London model

We study the vortex-line lattice and liquid phases of a clean type-II superconductor by means of Monte Carlo simulations of the lattice London model. Motivated by a recent controversy regarding the presence, within this model, of a vortex-liquid regime with longitudinal superconducting coherence over long length scales, we directly compare two different ways to calculate the longitudinal coherence. For an isotropic superconductor, we interpret our results in terms of a temperature regime within the liquid phase in which longitudinal superconducting coherence extends over length scales larger than the system thickness studied. We note that this regime disappears in the moderately anisotropic case due to a proliferation, close to the flux-line lattice melting temperature, of vortex loops between the layers.Comment: 8 pages, Revtex, with eps figures. To appear in Phys. Rev.

Analysis of the Maximal Pattern Mining method and its variants

In this paper, within the framework of process mining we examine the Maximal Pattern Mining method introduced by Liesaputra et al. in [1]. This method constructs a transition graph, i.e. a labelled directed graph for traces with similar structure. The idea behind the algorithm is to analyze the traces in the event log, identify loops, parallel events and optionality between them, in order to determine the maximal patterns. In [1], the authors provide a pseudo code for the skeleton of their algorithm and discuss some parts, but other parts are not detailed. Here, we briefly discuss the steps of the algorithm and elaborate the steps that are not explained in [1]. We introduce some new subroutines to handle the loops, parallel and optional sequences

Seymour's second neighborhood conjecture for tournaments missing a generalized star

Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. We prove its weighted version for tournaments missing a generalized star. As a consequence the weighted version holds for tournaments missing a sun, star, or a complete graph.Comment: Accepted for publication in Journal of Graph Theory in 24 June 201