Modules are requisite for the realization of modular reconfigurable manipulators. The design of modules in literature mainly revolves around geometric aspects and features such as lengths, connectivity and adaptivity. Optimizing and designing the modules based on dynamic performance is considered as a challenge here. The present paper introduces an Architecture-Prominent-Sectioning (APS) strategy for the planning of architecture of modules such that a reconfigurable manipulator possesses minimal joint torques during its operations. Proposed here is the transferring of complete structure into an equivalent system, perform optimization and map the resulting arrangement into possible architecture. The strategy has been applied on a set of modular configurations considering three-primitive-paths. The possibility of getting advanced/complex shapes is also discussed to incorporate the idea of a modular library.

Malgré le développement de molécules plus spécifiques, les neuroleptiques ne demeurent qu’un traitement partiellement efficace de la schizophrénie. Une proportion importante de patients, 30 à 40 %, ne montre qu’une rémission partielle des symptômes psychotiques. Les symptômes psychotiques persistants représentent un défi majeur pour les soins psychiatriques, car ils sont accompagnés d’un risque augmenté d’hospitalisations non-volontaires et interfèrent avec le fonctionnement social et professionnel.

Pourquoi un programme d’entraînement cognitif ?

D’une part, on peut relever la richesse des savoirs sur les distorsions métacognitives dans la schizophrénie.

D’autre part, il y a bien là une intention de réduire le fossé actuel entre la compréhension avancée des processus cognitifs et métacognitifs dans la schizophrénie et son utilisation pratique dans le traitement clinique.

Elle renvoie aux connaissances que nous avons de notre propre fonctionnement cognitif et au pilotage de nos comportements grâce à la mise en œuvre de procédures adaptées.

Elle traduit en quelque sorte l’aptitude à réfléchir sur ses propres processus cognitifs et à les contrôler, ce qui inclut des connaissances sur : pourquoi, comment, quand s’engager dans des activités cognitives variées.

Des programmes ont été conçus pour cibler les erreurs cognitives communes et les biais de résolution de problèmes associés à la schizophrénie et aux psychoses en général. Ces erreurs et biais peuvent à eux seuls ou combinés culminer dans le développement et le maintien de fausses croyances jusqu’aux délires.

La psychose n’est pas un événement soudain et momentané. Le plus souvent, elle est le résultat de changements graduels dans la façon d’appréhender ses propres pensées et l’environnement social. L’amélioration des compétences métacognitives pourrait agir de façon prophylactique sur les rechutes psychotiques.

This article began as a study of the structure of infinite permutation groups $G$ in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point stabilisers are merely assumed to satisfy min-n, the minimal condition on normal subgroups. The groups $G$ are then of two kinds. Either they have a maximal finite normal subgroup, modulo which they have either one or two minimal nontrivial normal subgroups, or they have a regular normal subgroup $M$ which is a divisible abelian $p$ -group of finite rank. In the latter case the point stabilisers are finite and act irreducibly on a $p$ -adic vector space associated with  $M$ . This leads to our second variation, which is a study of the finite linear groups that can arise.

We present and evaluate a compiler from Prolog (and extensions) to JavaScript which makes it possible to use (constraint) logic programming to develop the client side of web applications while being compliant with current industry standards. Targeting JavaScript makes (C)LP programs executable in virtually every modern computing device with no additional software requirements from the point of view of the user. In turn, the use of a very high-level language facilitates the development of high-quality, complex software. The compiler is a back end of the Ciao system and supports most of its features, including its module system and its rich language extension mechanism based on packages. We present an overview of the compilation process and a detailed description of the run-time system, including the support for modular compilation into separate JavaScript code. We demonstrate the maturity of the compiler by testing it with complex code such as a CLP(FD) library written in Prolog with attributed variables. Finally, we validate our proposal by measuring the performance of some LP and CLP(FD) benchmarks running on top of major JavaScript engines.

We find the model completion of the theory modules over , where is a finitely generated commutative algebra over a field K. This is done in a context where the field K and the module are represented by sorts in the theory, so that constructible sets associated with a module can be interpreted in this language. The language is expanded by additional sorts for the Grassmanians of all powers of Kn, which are necessary to achieve quantifier elimination.

The result turns out to be that the model completion is the theory of a certain class of “big” injective modules. In particular, it is shown that the class of injective modules is itself elementary. We also obtain an explicit description of the types in this theory.

The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specifications and code, and a refinement relation that models the notion of correct implementation. In this paper we extend and generalise earlier work on contextual refinement. Contextual refinement simplifies the refinement process by abstractly capturing the context of a subcomponent of a program, which typically includes information about the values of the free variables. This paper also extends and generalises module refinement. A module is a collection of procedures that operate on a common data type; module refinement between a specification module A and an implementation module C allows calls to the procedures of A to be systematically replaced with calls to the corresponding procedures of C. Based on the conditions for module refinement, we present a method for calculating an implementation module from a specification module. Both contextual and module refinement within the refinement calculus have been generalised from earlier work and the results are presented in a unified framework.

Let $G$ be a locally compact group, and let $L^1 (G)$ be the Banach algebra which is the group algebra of $G$. We consider a variety of Banach left $L^1 (G)$ -modules over $L^1 (G)$ , and seek to determine conditions on $G$ that determine when these modules are either projective or injective or flat in the category. The answers typically involve $G$ being compact or discrete or amenable. For example, in the case where $G$ is discrete and $1 < p < \infty$, we find that the module $\ell^p (G)$ is injective whenever $G$ is amenable, and that, if it is amenable, then $G$ is ‘pseudo-amenable’, a property very close to that of amenability.

Constructor-Based Conditional Rewriting Logic is a general framework for integrating first-order functional and logic programming which gives an algebraic semantics for nondeterministic functional-logic programs. In the context of this formalism, we introduce a simple notion of program module as an open program which can be extended together with several mechanisms to combine them. These mechanisms are based on a reduced set of operations. However, the high expressiveness of these operations enable us to model typical constructs for program modularization like hiding, export/import, genericity/instantiation, and inheritance in a simple way. We also deal with the semantic aspects of the proposal by introducing an immediate consequence operator, and studying several alternative semantics for a program module, based on this operator, in the line of logic programming: the operator itself, its least fixpoint (the least model of the module), the set of its pre-fixpoints (term models of the module), and some other variations in order to find a compositional and fully abstract semantics w.r.t. the set of operations and a natural notion of observability.

For constant linear systems we are introducing integral reconstructors and generalized proportional-integral controllers, which permit to bypass the derivative term in the classic PID controllers and more generally the usual asymptotic observers. Our approach, which is mainly of algebraic flavour, is based on the module-theoretic framework for linear systems and on operational calculus in Mikusiński's setting. Several examples are discussed.

Let A be a finite-dimensional k-algebra over algebraically closed field k and $m{\rm mod}\, A$ be the category of finite-dimensional left A-modules. We show that a module M in ${\rm mod}\, A$ degenerates to another module N in ${\rm mod}\, A$ if and only if there is an exact sequence $0\to N\to M\oplus Z\to Z\to 0$ in ${\rm mod}\, A$ for some A-module Z. Moreover, we give a description of minimal degenerations of finite-dimensional A-modules.

Interpretations of most existing controllability and observability notions for linear delay systems are given. Module theoreticcharacterizations are presented. This setting enables a clear and precise comparison of the various examined notions. A new notion ofcontrollability is introduced, which is called pi-freeness.

In this paper we obtain several new characterizations of modules having small cofinite irreducibles. One of these characterizations involves a metric topology defined on the submodule lattice.

Every invertible n-by-n matrix over a ring R satisfying the first Bass stable range condition is the product of n simple automorphisms, and there are invertible matrices which cannot be written as the products of a smaller number of simple automorphisms. This generalizes results of Ellers on division rings and local rings.

‘Divide and conquer’ is a traditional approach in various fields of applied mathematics. In reliability, only modules have been proposed to decompose complex coherent systems. However, a system may include no modules, except ‘trivial’ ones. This paper is the second step of a study concerned with module generalizations : in the first step, pseudo-modules have been retained as the most general coherent subsystems which can yield a complete extension of the fundamental results concerning modules; in addition, it has been proved that they concern any binary coherent system; in this paper, it is shown that pseudo-modular decompositions are the most general coherent decompositions which can yield a complete extension of all the ‘refined bounds’ for the interval reliability and the availability currently proposed in terms of modular decompositions.

This study also yields some fundamental results to extend all the ‘refined bounds’ currently proposed for multistate coherent systems, using an easier approach.