Causal behavioural profiles : efficient computation, applications, and evaluation

Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S- or T-nets. We also elaborate on the findings of applying our technique to three industry model collections.

On effective linearly ordered sets of comparison functions

Both the existence and the non-existence of a linearly ordered (by certain natural order relations) effective set of comparison functions (=dense comparison classes) are compatible with the ZFC axioms of set theory.

Les distances entre les attributs internes du visage humain

La zeitgesit contemporaine sur la reconnaissance des visages suggère que le processus de reconnaissance reposerait essentiellement sur le traitement des distances entre les attributs internes du visage. Il est toutefois surprenant de noter que cette hypothèse n’a jamais été évaluée directement dans la littérature. Pour ce faire, 515 photographies de visages ont été annotées afin d’évaluer l’information véhiculée par de telles distances. Les résultats obtenus suggèrent que les études précédentes ayant utilisé des modifications de ces distances ont présenté 4 fois plus d’informations que les distances inter-attributs du monde réel. De plus, il semblerait que les observateurs humains utilisent difficilement les distances inter-attributs issues de visages réels pour reconnaître leurs semblables à plusieurs distances de visionnement (pourcentage correct maximal de 65%). Qui plus est, la performance des observateurs est presque parfaitement restaurée lorsque l’information des distances inter-attributs n’est pas utilisable mais que les observateurs peuvent utiliser les autres sources d’information de visages réels. Nous concluons que des indices faciaux autre que les distances inter-attributs tel que la forme des attributs et les propriétés de la peau véhiculent l’information utilisée par le système visuel pour opérer la reconnaissance des visages.

Reducing the conservatism of LMI-based stabilisation conditions for TS fuzzy systems using fuzzy Lyapunov functions

In this article, the fuzzy Lyapunov function approach is considered for stabilising continuous-time Takagi-Sugeno fuzzy systems. Previous linear matrix inequality (LMI) stability conditions are relaxed by exploring further the properties of the time derivatives of premise membership functions and by introducing slack LMI variables into the problem formulation. The relaxation conditions given can also be used with a class of fuzzy Lyapunov functions which also depends on the membership function first-order time-derivative. The stability results are thus extended to systems with large number of rules under membership function order relations and used to design parallel-distributed compensation (PDC) fuzzy controllers which are also solved in terms of LMIs. Numerical examples illustrate the efficiency of the new stabilising conditions presented. © 2013 Copyright Taylor and Francis Group, LLC.

Emergência de classes seqüenciais após treino com pareamento consistente

Relações de ordem podem ser documentadas por meio de testes comportamentais através das propriedades de assimetria, transitividade e conectividade. A emergência de classes seqüenciais pode ser estabelecidas de diferentes maneiras, inclusive a partir do matching to sample com pareamento consistente de estímulos e sem conseqüências imediatas. O presente estudo buscou verificar o efeito do treino com pareamento consistente entre estímulos visuais sobre desempenhos emergentes. Cinco universitários de ambos os sexos foram submetidos ao treino das relações condicionais AB, AC e AD. A tarefa dos participantes era responder ordinalmente a dígitos e formas geométricas abstratas. Em seguida, os participantes foram expostos a testes para ordenação de três seqüências diferentes com cinco estímulos. Três participantes alcançaram o critério de acerto e apresentaram um responder consistente nos testes. Os resultados indicaram que o treino foi efetivo no estabelecimento de relações de ordem entre estímulos e replicam dados da literatura no estabelecimento de desempenho seqüencial após treino com matching to sample.

Espaços vetoriais e topológicos de intervalos generalizados com alguns conceitos de cálculo e otimização intervalar

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Generalized interval vector spaces and interval optimization

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Myth, Language, and Complex Ideologies

Ideologies use for their conservation and propagation persuasive methods of communication: rhetoric. Rhetoric is analyzed from the semiotic and logical-mathematical points of view. The following hypotheses are established: (1) language L is a self-explanatory system, mediated by a successive series of systems of cultural conventions, (2) connotative significances of an ideological advertising rhetoric must be known, and (3) the notion of ideological information is a neutral notion that does not imply the valuation of ideology or its conditions of veracity or falsification. Rhetorical figures like metonymy, metaphor, parable analogy, and allegory are defined as relations. Metaphor and parable are order relations. Operations of metonymic and metaphoric substitution are defined and several theorems derived from these operations have been deduced.

Minimal instrumentation may compromise failure diagnosis with an ecological interface

Interfaces designed according to ecological interface design (EID) display higher-order relations and properties of a work domain so that adaptive operator problem solving can be better supported under unanticipated system conditions. Previous empirical studies of EID have assumed that the raw data required to derive and communicate higher-order information would be available and reliable. The present research examines the relative advantages of an EID interface over a conventional piping-and-instrumentation diagram (PID) when instrumentation is maximally or only minimally adequate. Results show an interaction between interface and the adequacy of the instrumentation. Failure diagnosis performance with the EID interface with maximally adequate instrumentation is best overall. Performance with the EID interface drops more drastically from maximally to minimally adequate instrumentation than does performance with the PID interface, to the point where the EID interface with minimally adequate instrumentation supports nonsignificantly worse performance than does the equivalent PID interface. Actual or potential applications of this research include design of instrumentation and displays for complex industrial processes.

On the Arithmetic of Errors

An approximate number is an ordered pair consisting of a (real) number and an error bound, briefly error, which is a (real) non-negative number. To compute with approximate numbers the arithmetic operations on errors should be well-known. To model computations with errors one should suitably define and study arithmetic operations and order relations over the set of non-negative numbers. In this work we discuss the algebraic properties of non-negative numbers starting from familiar properties of real numbers. We focus on certain operations of errors which seem not to have been sufficiently studied algebraically. In this work we restrict ourselves to arithmetic operations for errors related to addition and multiplication by scalars. We pay special attention to subtractability-like properties of errors and the induced “distance-like” operation. This operation is implicitly used under different names in several contemporary fields of applied mathematics (inner subtraction and inner addition in interval analysis, generalized Hukuhara difference in fuzzy set theory, etc.) Here we present some new results related to algebraic properties of this operation.

Preference inference based on Pareto models

In this paper, we consider Preference Inference based on a generalised form of Pareto order. Preference Inference aims at reasoning over an incomplete specification of user preferences. We focus on two problems. The Preference Deduction Problem (PDP) asks if another preference statement can be deduced (with certainty) from a set of given preference statements. The Preference Consistency Problem (PCP) asks if a set of given preference statements is consistent, i.e., the statements are not contradicting each other. Here, preference statements are direct comparisons between alternatives (strict and non-strict). It is assumed that a set of evaluation functions is known by which all alternatives can be rated. We consider Pareto models which induce order relations on the set of alternatives in a Pareto manner, i.e., one alternative is preferred to another only if it is preferred on every component of the model. We describe characterisations for deduction and consistency based on an analysis of the set of evaluation functions, and present algorithmic solutions and complexity results for PDP and PCP, based on Pareto models in general and for a special case. Furthermore, a comparison shows that the inference based on Pareto models is less cautious than some other types of well-known preference model.

Fixed Point vs. First-Order Logic on Finite Ordered Structures with Unary Relations

We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which cannot be defined by a first-order formula, even when every inductive sentence (i.e., closed formula) can be expressed in first-order over this particular class. Our proof first establishes a property valid for every unary relation definable by first-order logic over these classes which is peculiar to classes of ordered structures with unary relations. In a second step we show that this property itself can be expressed in fixed point logic and can be used to construct a non-elementary unary relation.

Labor-management relations in the Federal Service : answers to questions about Executive Order 11491.

Mode of access: Internet.

United States Court of Appeals for the District of Columbia Circuit, no. 81-2135, Professional Air Traffic Controllers Organization, petitioner v. Federal Labor Relations Authority, respondent, Federal Aviation Administration, intervenor : petition for review of an order of the Federal Labor Relations Authority, argued December 3, 1981, decided June 11, 1982.

Cover title.