Generators of supersymmetric polynomials in positive characteristic

In Kantor and Trishin (1997) [3], Kantor and Trishin described the algebra of polynomial invariants of the adjoint representation of the Lie superalgebra gl(m vertical bar n) and a related algebra A, of what they called pseudosymmetric polynomials over an algebraically closed field K of characteristic zero. The algebra A(s) was investigated earlier by Stembridge (1985) who in [9] called the elements of A(s) supersymmetric polynomials and determined generators of A(s). The case of positive characteristic p of the ground field K has been recently investigated by La Scala and Zubkov (in press) in [6]. We extend their work and give a complete description of generators of polynomial invariants of the adjoint action of the general linear supergroup GL(m vertical bar n) and generators of A(s).

Relating Crevassing to Non-Linear Strain in the Floating Part of Jakobshavn Isbrae, West Greenland

Jakobshavn Isbrae is a major ice stream that drains the west-central Greenland ice sheet and becomes afloat in Jakobshavn Isfiord (69degreesN, 49degreesW), where it has maintained the world's fastest-known sustained velocity and calving rate (7 km a(-1)) for at least four decades. The floating portion is approximately 12 km long and 6 km wide. Surface elevations and motion vectors were determined photogrammetrically for about 500 crevasses on the floating ice, and adjacent grounded ice, using aerial photographs obtained 2 weeks apart in July 1985. Surface strain rates were computed from a mesh of 399 quadrilateral elements having velocity measurements at each corner. It is shown that heavy crevassing of floating ice invalidates the assumptions of linear strain theory that (i) surface strain in the floating ice is homogeneous in both space and time, (ii) the squares and products of strain components are nil, and (iii) first- and second-order rotation components are small compared to strain components. Therefore, strain rates and rotation rates were also computed using non-linear strain theory. The percentage difference between computed linear and non-linear second invariants of strain rate per element were greatest (mostly in the range 40-70%) where crevassing is greatest. Isopleths of strain rate parallel and transverse to flow and elevation isopleths relate crevassing to known and inferred pinning points.

Simulation of SLA-based VM-scaling algorithms for cloud-distributed applications

Cloud Computing has evolved to become an enabler for delivering access to large scale distributed applications running on managed network-connected computing systems. This makes possible hosting Distributed Enterprise Information Systems (dEISs) in cloud environments, while enforcing strict performance and quality of service requirements, defined using Service Level Agreements (SLAs). {SLAs} define the performance boundaries of distributed applications, and are enforced by a cloud management system (CMS) dynamically allocating the available computing resources to the cloud services. We present two novel VM-scaling algorithms focused on dEIS systems, which optimally detect most appropriate scaling conditions using performance-models of distributed applications derived from constant-workload benchmarks, together with SLA-specified performance constraints. We simulate the VM-scaling algorithms in a cloud simulator and compare against trace-based performance models of dEISs. We compare a total of three SLA-based VM-scaling algorithms (one using prediction mechanisms) based on a real-world application scenario involving a large variable number of users. Our results show that it is beneficial to use autoregressive predictive SLA-driven scaling algorithms in cloud management systems for guaranteeing performance invariants of distributed cloud applications, as opposed to using only reactive SLA-based VM-scaling algorithms.

Numerical issues in Lagrangian tracking and topological evolution of fluid particles in wallbounded turbulent flows

The determination of the local Lagrangian evolution of the flow topology in wall-bounded turbulence, and of the Lagrangian evolution associated with entrainment across the turbulent / non-turbulent interface into a turbulent boundary layer, require accurate tracking of a fluid particle and its local velocity gradients. This paper addresses the implementation of fluid-particle tracking in both a turbulent boundary layer direct numerical simulation and in a fully developed channel flow simulation. Determination of the sub-grid particle velocity is performed using both cubic B-spline, four-point Hermite spline and higher-order Hermite spline interpolation. Both wall-bounded flows show similar oscillations in the Lagrangian tracers of both velocity and velocity gradients, corresponding to the movement of particles across the boundaries of computational cells. While these oscillation in the particle velocity are relatively small and have negligible effect on the particle trajectories for time-steps of the order of CFL = 0.1, they appear to be the cause of significant oscillations in the evolution of the invariants of the velocity gradient tensor.

Ulm, Germany, ca. 1740 (Raster Image)

This layer is a georeferenced raster image of the historic paper map entitled: Ulma memorabilis ac permunita libera Imperii Civitas ad Danubium, ubi Ilara et Blavus ei miscentur = Ulm eine considerable Freye Reichs Statt in Schwaben, wo die Flüsse Iler u. Blau in die Donau fallen, verfertigt durch Matthaeum Seutter, Seiner Kayserl. u. Königl. Cathol. Majest. Geogr. in Augspurg. It was published by Matthaeus Seutter, ca. 1740. Scale [ca. 1:4,300]. Covers Ulm, Germany. Map in Latin and German. The image inside the map neatline is georeferenced to the surface of the earth and fit to the Deutsches Hauptdreiecksnetz (DHDN) 3-degree Gauss-Kruger Zone 3 coordinate system. All map collar and inset information is also available as part of the raster image, including any inset maps, profiles, statistical tables, directories, text, illustrations, index maps, legends, or other information associated with the principal map. This map shows features such as roads, drainage, built-up areas and selected buildings, fortifications, ground cover, and more. Relief shown pictorially. Includes also index, text, and panorama of Ulm seen from the North East.This layer is part of a selection of digitally scanned and georeferenced historic maps from the Harvard Map Collection. These maps typically portray both natural and manmade features. The selection represents a range of originators, ground condition dates, scales, and map purposes.

CSMINI - applications of a mini programming system on PLATO IV /

"The work reported here was performed 1975/1976 while the author held a visiting appointment in the Department of Computer Science at the University of Illinois at Urbana Champaign. A part was added during another visit in summer 1978."

The JNR Property and the Borel Structure of a Banach Space

Research partially supported by a grant of Caja de Ahorros del Mediterraneo.

Isomorphism of Commutative Group Algebras of Finite Abelian Groups

Let a commutative ring R be a direct product of indecomposable rings with identity and let G be a finite abelian p-group. In the present paper we give a complete system of invariants of the group algebra RG of G over R when p is an invertible element in R. These investigations extend some classical results of Berman (1953 and 1958), Sehgal (1970) and Karpilovsky (1984) as well as a result of Mollov (1986).

MINING AND VERIFICATION OF TEMPORAL EVENTS WITH APPLICATIONS IN COMPUTER MICRO-ARCHITECTURE RESEARCH

Computer simulation programs are essential tools for scientists and engineers to understand a particular system of interest. As expected, the complexity of the software increases with the depth of the model used. In addition to the exigent demands of software engineering, verification of simulation programs is especially challenging because the models represented are complex and ridden with unknowns that will be discovered by developers in an iterative process. To manage such complexity, advanced verification techniques for continually matching the intended model to the implemented model are necessary. Therefore, the main goal of this research work is to design a useful verification and validation framework that is able to identify model representation errors and is applicable to generic simulators. The framework that was developed and implemented consists of two parts. The first part is First-Order Logic Constraint Specification Language (FOLCSL) that enables users to specify the invariants of a model under consideration. From the first-order logic specification, the FOLCSL translator automatically synthesizes a verification program that reads the event trace generated by a simulator and signals whether all invariants are respected. The second part consists of mining the temporal flow of events using a newly developed representation called State Flow Temporal Analysis Graph (SFTAG). While the first part seeks an assurance of implementation correctness by checking that the model invariants hold, the second part derives an extended model of the implementation and hence enables a deeper understanding of what was implemented. The main application studied in this work is the validation of the timing behavior of micro-architecture simulators. The study includes SFTAGs generated for a wide set of benchmark programs and their analysis using several artificial intelligence algorithms. This work improves the computer architecture research and verification processes as shown by the case studies and experiments that have been conducted.

Écriture, stéréotypes et créativité

Notre objectif consiste à interroger les effets de dispositifs d’enseignement apprentissage de l’écriture narrative, en prenant pour analyseur l’usage du stéréotype par des élèves de la fin de l’école élémentaire. Le stéréotype, considéré comme le lieu commun de l’expression (Dufays & Kervin, 2010) est potentiellement générateur de ressources (Marin & Crinon, 2014, à paraître) par les contraintes mêmes qu’il induit (Plane, 2006). En prise sur l’appréhension des critères de genre, la reconnaissance des stéréotypes renvoie à une forme particulièrement discriminante de capital symbolique (Tardy et Swales, 2008) dont il convient d’envisager les effets sur la régulation des inégalités entre élèves (Rochex & Crinon, 2011). Nous présentons en complémentarité deux recherches, dans lesquelles les élèves bénéficient de ressources de nature différente : l’aide apportée y assumant pour la première le statut d’outil technique (Crinon, Legros & Marin, 2002-2003), alors qu’elle relève pour la seconde d’un instrument psychologique (Marin, 2011). Les résultats de ces recherches montrent comment la focalisation sur les critères de genre constitue une ressource utile aux élèves, la seconde mettant en exergue le rôle des tuteurs dans la critique des textes de leurs pairs et son effet récursif sur la conscientisation des invariants génériques du texte de fiction.

Codis no lineals en MAGMA: construcció de codis perfectes

La finalitat d'aquest projecte és aconseguir construir codis binaris perfectes no lineals de manera eficient. Per a fer-ho, hem desenvolupat un paquet de software per a l'intèrpret MAGMA que conté funcions per a la construcció de codis perfectes, càlcul d'invariants de codis i altres funcions complementàries per a fer càlculs sobre les paraules d'un codi.

Integral formulae for a Riemannian manifold with a distribution

We obtain a new series of integral formulae for symmetric functions of curvature of a distribution of arbitrary codimension (an its orthogonal complement) given on a compact Riemannian manifold, which start from known formula by P.Walczak (1990) and generalize ones for foliations by several authors: Asimov (1978), Brito, Langevin and Rosenberg (1981), Brito and Naveira (2000), Andrzejewski and Walczak (2010), etc. Our integral formulae involve the co-nullity tensor, certain component of the curvature tensor and their products. The formulae also deal with a number of arbitrary functions depending on the scalar invariants of the co-nullity tensor. For foliated manifolds of constant curvature the obtained formulae give us the classical type formulae. For a special choice of functions our formulae reduce to ones with Newton transformations of the co-nullity tensor.

Index theory for basic Dirac operators on Riemannian foliations

In this paper we prove a formula for the analytic index of a basic Dirac-type operator on a Riemannian foliation, solving a problem that has been open for many years. We also consider more general indices given by twisting the basic Dirac operator by a representation of the orthogonal group. The formula is a sum of integrals over blowups of the strata of the foliation and also involves eta invariants of associated elliptic operators. As a special case, a Gauss-Bonnet formula for the basic Euler characteristic is obtained using two independent proofs.

Generalized adiabatic invariance

In this paper we find the quantities that are adiabatic invariants of any desired order for a general slowly time-dependent Hamiltonian. In a preceding paper, we chose a quantity that was initially an adiabatic invariant to first order, and sought the conditions to be imposed upon the Hamiltonian so that the quantum mechanical adiabatic theorem would be valid to mth order. [We found that this occurs when the first (m - 1) time derivatives of the Hamiltonian at the initial and final time instants are equal to zero.] Here we look for a quantity that is an adiabatic invariant to mth order for any Hamiltonian that changes slowly in time, and that does not fulfill any special condition (its first time derivatives are not zero initially and finally).

Conservation Laws in Cellular Automata

Conservation laws in physics are numerical invariants of the dynamics of a system. In cellular automata (CA), a similar concept has already been defined and studied. To each local pattern of cell states a real value is associated, interpreted as the “energy” (or “mass”, or . . . ) of that pattern.The overall “energy” of a configuration is simply the sum of the energy of the local patterns appearing on different positions in the configuration. We have a conservation law for that energy, if the total energy of each configuration remains constant during the evolution of the CA. For a given conservation law, it is desirable to find microscopic explanations for the dynamics of the conserved energy in terms of flows of energy from one region toward another. Often, it happens that the energy values are from non-negative integers, and are interpreted as the number of “particles” distributed on a configuration. In such cases, it is conjectured that one can always provide a microscopic explanation for the conservation laws by prescribing rules for the local movement of the particles. The onedimensional case has already been solved by Fuk´s and Pivato. We extend this to two-dimensional cellular automata with radius-0,5 neighborhood on the square lattice. We then consider conservation laws in which the energy values are chosen from a commutative group or semigroup. In this case, the class of all conservation laws for a CA form a partially ordered hierarchy. We study the structure of this hierarchy and prove some basic facts about it. Although the local properties of this hierarchy (at least in the group-valued case) are tractable, its global properties turn out to be algorithmically inaccessible. In particular, we prove that it is undecidable whether this hierarchy is trivial (i.e., if the CA has any non-trivial conservation law at all) or unbounded. We point out some interconnections between the structure of this hierarchy and the dynamical properties of the CA. We show that positively expansive CA do not have non-trivial conservation laws. We also investigate a curious relationship between conservation laws and invariant Gibbs measures in reversible and surjective CA. Gibbs measures are known to coincide with the equilibrium states of a lattice system defined in terms of a Hamiltonian. For reversible cellular automata, each conserved quantity may play the role of a Hamiltonian, and provides a Gibbs measure (or a set of Gibbs measures, in case of phase multiplicity) that is invariant. Conversely, every invariant Gibbs measure provides a conservation law for the CA. For surjective CA, the former statement also follows (in a slightly different form) from the variational characterization of the Gibbs measures. For one-dimensional surjective CA, we show that each invariant Gibbs measure provides a conservation law. We also prove that surjective CA almost surely preserve the average information content per cell with respect to any probability measure.