The induced 2-tuple linguistic generalized OWA operator and its application in linguistic decision making

[spa] Se presenta el operador de media ponderada ordenada generalizada lingüística de 2 tuplas inducida (2-TILGOWA). Es un nuevo operador de agregación que extiende los anteriores modelos a través de utilizar medias generalizadas, variables de ordenación inducidas e información lingüística representada mediante el modelo de las 2 tuplas lingüísticas. Su principal ventaja se encuentra en la posibilidad de incluir a un gran número de operadores de agregación lingüísticos como casos particulares. Por eso, el análisis puede ser visto desde diferentes perspectivas de forma que se obtiene una visión más completa del problema considerado y seleccionar la alternativa que parece estar en mayor concordancia con nuestros intereses o creencias. A continuación se desarrolla una generalización mayor a través de utilizar medias cuasi-aritméticas, obteniéndose el operador Quasi-2-TILOWA. El trabajo finaliza analizando la aplicabilidad del nuevo modelo en un problema de toma de decisiones sobre gestión de la producción.

The generalized index of maximum and minimum level and its application in decision making

[spa] El índice del máximo y el mínimo nivel es una técnica muy útil, especialmente para toma de decisiones, que usa la distancia de Hamming y el coeficiente de adecuación en el mismo problema. En este trabajo, se propone una generalización a través de utilizar medias generalizadas y cuasi aritméticas. A estos operadores de agregación, se les denominará el índice del máximo y el mínimo nivel medio ponderado ordenado generalizado (GOWAIMAM) y cuasi aritmético (Quasi-OWAIMAM). Estos nuevos operadores generalizan una amplia gama de casos particulares como el índice del máximo y el mínimo nivel generalizado (GIMAM), el OWAIMAM, y otros. También se desarrolla una aplicación en la toma de decisiones sobre selección de productos.

Matching at one loop for the four-quark operators in NRQCD

The matching coefficients for the four-quark operators in NRQCD (NRQED) are calculated at one loop using dimensional regularization for ultraviolet and infrared divergences. The matching for the electromagnetic current follows easily from our results. Both the unequal and equal mass cases are considered. The role played by the Coulomb infrared singularities is explained in detail.

Canonical Noether symmetries and commutativity properties for gauge systems

For a dynamical system defined by a singular Lagrangian, canonical Noether symmetries are characterized in terms of their commutation relations with the evolution operators of Lagrangian and Hamiltonian formalisms. Separate characterizations are given in phase space, in velocity space, and through an evolution operator that links both spaces. 2000 American Institute of Physics.

Higher order Lagrangian systems: Geometric structures, Dynamics, and Constraints

In order to study the connections between Lagrangian and Hamiltonian formalisms constructed from aperhaps singularhigher-order Lagrangian, some geometric structures are constructed. Intermediate spaces between those of Lagrangian and Hamiltonian formalisms, partial Ostrogradskiis transformations and unambiguous evolution operators connecting these spaces are intrinsically defined, and some of their properties studied. Equations of motion, constraints, and arbitrary functions of Lagrangian and Hamiltonian formalisms are thoroughly studied. In particular, all the Lagrangian constraints are obtained from the Hamiltonian ones. Once the gauge transformations are taken into account, the true number of degrees of freedom is obtained, both in the Lagrangian and Hamiltonian formalisms, and also in all the intermediate formalisms herein defined.

A new aggregation method for strategic decision making and its application in assignment theory

A new aggregation method for decision making is presented by using induced aggregation operators and the index of maximum and minimum level. Its main advantage is that it can assess complex reordering processes in the aggregation that represent complex attitudinal characters of the decision maker such as psychological or personal factors. A wide range of properties and particular cases of this new approach are studied. A further generalization by using hybrid averages and immediate weights is also presented. The key issue in this approach against the previous model is that we can use the weighted average and the ordered weighted average in the same formulation. Thus, we are able to consider the subjective attitude and the degree of optimism of the decision maker in the decision process. The paper ends with an application in a decision making problem based on the use of the assignment theory.

A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied

Minimum-uncertaity states and pseudoclassical dynamics. II

The set of initial conditions for which the pseudoclassical evolution algorithm (and minimality conservation) is verified for Hamiltonians of degrees N (N>2) is explicitly determined through a class of restrictions for the corresponding classical trajectories, and it is proved to be at most denumerable. Thus these algorithms are verified if and only if the system is quadratic except for a set of measure zero. The possibility of time-dependent a-equivalence classes is studied and its physical interpretation is presented. The implied equivalence of the pseudoclassical and Ehrenfest algorithms and their relationship with minimality conservation is discussed in detail. Also, the explicit derivation of the general unitary operator which linearly transforms minimum-uncertainty states leads to the derivation, among others, of operators with a general geometrical interpretation in phase space, such as rotations (parity, Fourier).