We introduce the concept of Loday algebroids, a generalization of Courant algebroids. We define the naive cohomology and modular class of a Loday algebroid, and we show that the modular class of the double of a Lie bialgebroid vanishes. For Courant algebroids, we describe the relation between the naive and standard cohomologies and we conjecture that they are isomorphic when the Courant algebro...

A numerical investigation is performed for non Newtonian fluids flow between two concentric cylinders. The D2Q9 lattice Boltzmann model developed from the Bhatangar-Gross-Krook (LBGK) approximation is used to obtain the flow field for fluids obeying to the power-law model. The inner and outer cylinders rotate in the same and the opposite direction while the end walls are maintained at rest. The...

We present a survey of recent research studies of the implementation of adaptive user models in human-computer interaction. A classification of research directions on adaptive user interfaces is first proposed; it takes account of the user characteristics that are modelled, the distribution of initiative and control of the system evolution between user and system, and the role of dynamic adapta...

Contractions of Leibniz algebras and Courant algebroids by means of (1,1)-tensors are introduced and studied. An appropriate version of Nijenhuis tensors leads to natural deformations of Dirac structures and Lie bialgebroids. One recovers presymplectic-Nijenhuis structures, PoissonNijenhuis structures, and triangular Lie bialgebroids as particular examples. MSC 2000: Primary 17B99; Secondary 17...

The paper is devoted to the inverse problem of recovering a 2D periodic structure from scattered waves measured above and below the structure. We show that measurements corresponding to a nite number of refractive indices above or below the grating pro le, uniquely determine the periodic interface in the inverse TE transmission problem. If a priori information on the height of the di raction gr...

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting rules; specifically, we consider the Approval-based and the Borda-based variants of both the Chamberlin– Courant rule and the Monroe rule. We complement our a...