In this paper, we show a general way to interpret the infrastructure of a global field of arbitrary unit rank. This interpretation generalizes the prior concepts of the giant-step operation and f -representations, and makes it possible to relate the infrastructure to the (Arakelov) divisor class group of the global field. In the case of global function fields, we present results that establish ...

We discuss the nonabelian world-volume action which governs the dynamics of N coincident Dp-branes. In this theory, the branes’ transverse displacements are described by matrix-valued scalar fields, and so this is a natural physical framework for the appearance of noncommutative geometry. One example is the dielectric effect by which Dp-branes may be polarized into a noncommutative geometry by ...

One of the most important parameters in designing electrical motors is heat generation by the motor and the way it is dissipated. Temperature rising reduce efficiency and reliability of traction motors and leads to failure. In this paper, an urban train traction motor in a 3D computational fluid dynamics (CFD) simulation has been investigated. Maxwell software for electromagnetic simulation and...

We construct a new harmonic family: dielectric flow solutions with maximal supersymmetry in eleven-dimensional supergravity. These solutions are asymptotically AdS4 ×S7, while in the infra-red the M2 branes are dielectrically polarized into M5 branes. These solutions are holographically dual to vacua of the mass deformed theory on M2 branes. They also provide an interesting insight on the super...

As mentioned before, the success of CASE relies on two noteworthy properties: the Sure Screening (SS) property and the Separable After Screening (SAS) property. In this section, we discuss the two properties in detail, and illustrate how these properties enable us to decompose the original regression problem to many small-size regression problems which can be fit separately. We then use these p...

I describe a modification to Shanks’ baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the advantage of being able to compute n quickly, which Shanks’ method fails to do when the order of G is infinite, unknown, or much larger than n. I describe the algorithm in detail. I also present the results of implementations of my a...