An overview of MiMo2

The MiMo2 translation system combines several leading ideas in the areas of linguistics, computation and translation. In the area of translation we follow the ideas of Landsbergen (1987) by assuming that translation is symmetric; and combine these ideas with the advantages of a transfer approach. Computationally the system focuses on computability and declarativity. The linguistics of the system is based on a lexicalistic and sign-based approach to grammar.MiMo2 is a sideline project of the Dutch Eurotra team in Utrecht. An extended version of this article was presented at the machine translation workshop in Austin, Texas, June 1990.     

CAT2: An experimental eurotra alternative

In developing a theory of MT, it is desirable to have a methodology just powerful enough to achieve the intended results without introducing unnecessary complexity. A formalism designed to embody the methodology, and its implementation in some computer language, should also reflect this characteristic. This notion of appropriate complexity underlies the philosophy behind the cat2 MT system, a powerful yet simple instantiation of the Eurotra MT methodology. This report describes the cat2 formalism, and compares it to the Eurotra Engineering Framework, as well as to other formalisms for linguistic analysis. It is stressed that with a minimal set of formal devices the cat2 formalism achieves a level of adequacy equivalent to if not superior to the official Eurotra system.     

Compositional Abstractions of Hybrid Control Systems

Abstraction is a natural way to hierarchically decompose the analysis and design of hybrid systems. Given a hybrid control system and some desired properties, one extracts an abstracted system while preserving the properties of interest. Abstractions of purely discrete systems is a mature area, whereas abstractions of continuous systems is a recent activity. In this paper we present a framework for abstraction that applies to discrete, continuous, and hybrid systems. We introduce a composition operator that allows to build complex hybrid systems from simpler ones and show compatibility between abstractions and this compositional operator. Besides unifying the existing methodologies we also propose constructions to obtain abstractions of hybrid control systems.     

Eurotra: General system design

This article gives a general overview of the technical, scientific and philosophical character of the Eurotra machine translation program, outlines its developmental history and lists some plans for future work.The authors thank Steven Krauwer for valuable comments.     

The use of lexical semantics in interlingual machine translation

This paper describes the lexical-semantic basis for UNITRAN, an implemented scheme for translating Spanish, English, and German bidirectionally. Two claims made here are that the current representation handles many distinctions (or divergences) across languages without recourse to language-specific rules and that the lexical-semantic framework provides the basis for a systematic mapping between the interlingua and the syntactic structure. The representation adopted is an extended version of lexical conceptual structure which is suitable to the task of translating between divergent structures for two reasons: (1) it provides an abstraction of language-independent properties from structural idiosyncrasies; and (2) it is compositional in nature. The lexical-semantic approach addresses the divergence problem by using a linguistically grounded mapping that has access to parameter settings in the lexicon. We will examine a number of relevant issues including the problem of defining primitives, the issue of interlinguality, the cross-linguistic coverage of the system, and the mapping between the syntactic structure and the interlingua. A detailed example of lexical-semantic composition will be presented.     

Aspects of Compositionality

We introduce several senses of the principle ofcompositionality. We illustrate the difference between them with thehelp of some recent results obtained by Cameron and Hodges oncompositional semantics for languages of imperfect information.     

HA和HYP分子内质子传递模式差异的理论研究

采用量子化学从头算的计算方法,研究了竹红菌素(HA)4种异构体发生分子内质子传递(IPT)的过程。结果表明,在竹红菌素分子内质子传递的过程中不会发生碳骨架结构的变化,这与之前文献中的猜测是不一致的,利用CIS和TD方法计算研究了竹红菌素激发态分子内质子传递的过程.结果表明,竹红菌素顺式结构的IPT过程是一个～10ps的瞬态过程,而竹红菌素反式结构的IPT过程则是一个～50～250ps的瞬态过程.根据计算结果我们对竹红菌素和金丝桃蒽酮分子内质子传递模式之间的差异做出了初步的解释.     

Verification of Hierarchical State/Event Systems using Reusability and Compositionality

We investigate techniques for verifying hierarchical systems, i.e., finite state systems with a nesting capability. The straightforward way of analysing a hierarchical system is to first flatten it into an equivalent non-hierarchical system and then apply existing finite state system verification techniques. Though conceptually simple, flattening is severely punished by the hierarchical depth of a system. To alleviate this problem, we develop a technique that exploits the hierarchical structure to reuse earlier reachability checks of superstates to conclude reachability of substates. We combine the reusability technique with the successful compositional technique of J. Lind-Nielsen, H.R. Andersen, G. Behrmann, H. Hulgaard, K. Kristoffersen, and K.G. Larsen, 1998. In: Tools and Algorithms for the Construction and Analysis of Systems, Vol. 1384 of Lecture Notes in Computer Science, pp. 201–216, and investigate the combination experimentally on industrial systems and hierarchical systems generated according to our expectations to real systems. The experimental results are very encouraging: whereas a flattening approach degrades in performance with an increase in the hierarchical depth (even when applying the technique of J. Lind-Nielsen et al. (1998)), the new approach proves not only insensitive to the hierarchical depth, but even leads to improved performance as the depth increases.     

Formal Features of Compositionality

We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a canonical compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.     

On the difficulty of really considering a radical novelty

The fundamental assumptions in Dijkstra's influential article on computing science teaching are challenged. Dijkstra's paper presents the radical novelties of computing, and the consequent problems that we must tackle through a formal, logic-based approach to program derivation. Dijkstra's main premise is that the algorithmic programming paradigm is the only one, in fact, the only possible one. It is argued that there is at least one other, the network-programming paradigm, which itself is a radical novelty with respect to the implementation of problems on computers. And, as one might expect of a radical alternative, it shows much of the conventional wisdom concerning computing science, which Dijkstra variously attacks and dispenses, to be special pleading; not universals of computing at all. Finally, we explore what is known of this new paradigm in order to see what light it sheds on the fundamental problems that computing really does present to us. Not surprisingly, some become less problematic, some disappear altogether and others take their place, but, in general, it must be of benefit to modern computer technology to gain a wider perspective on the possibilities instead of seeing everything through the traditional tunnel of programming as formula derivation, and computers as the requisite, special type of symbol manipulation device.By means of metaphors and analogies, we try to link the new to the old, the novel to the familiar ... in the case of a sharp discontinuity, however, the method breaks down ... our past experience is no longer relevant; the analogies become to shallow; and, the metaphors become more misleading than illuminating. This is the situation that is characteristic of the radical novelty. (Dijkstra, 1989, p. 1398).     

二元联系数A+Bi的理论基础与基本算法及在人工智能中的应用

二元联系数4＋Bi的特点是把确定性测度与不确定测度联系在一起,基本思想是把一个确定集与一个不确定集联系在一起去研究同一个客观对象,其理论基础是集对论,概率、模糊隶属度、区间数可以转换成二元联系数,基本算法简明实用,因而可用于不同不确定性问题的处理．     

Modal synthesis: Generalization of MacNeal's method. theoretical basis

In this paper, a theoretical basis of the generalization of MacNeal's modal synthesis method [1] is presented.This method allows the computation of eigenvectors and eigenfrequencies of a structure from the eigenfrequencies and modes of the subcomponents of this structure, already independently analysed. These frequencies and modes may have been obtained by computation or measured. A set of linear equations expresses the assembly conditions of the subsets.There are in this method no restrictions on the boundary conditions of the subsets. They may have been analysed free-free or supported. The global system may also be supported or not.This theoretical formulation has been introduced and tested in the ASKA program.     

Compositionality and the Modelling of Complex Concepts

The nature of complex concepts has important implications for the computational modelling of the mind, as well as for the cognitive science of concepts. This paper outlines the way in which RVC – a Relational View of Concepts – accommodates a range of complex concepts, cases which have been argued to be non-compositional. RVC attempts to integrate a number of psychological, linguistic and psycholinguistic considerations with the situation-theoretic view that information-carrying relations hold only relative to background situations. The central tenet of RVC is that the content of concepts varies systematically with perspective. The analysis of complex concepts indicates that compositionality too should be considered to be sensitive to perspective. Such a view accords with concepts and mental states being situated and the implications for theories of concepts and for computational models of the mind are discussed.     

元胞自动机可逆性研究

元胞自动机是对复杂适应系统建模的重要理论工具。可逆性是元胞自动机的一个重要属性,是模拟物理可逆空间的必要条件。本文介绍元胞自动机的基本概念、可逆性和可计算性,并介绍一维可逆元胞自动机可计算的证明思路。     

Token reference vs. type reference: Implications for machine translation

This paper is concerned with the conditions under which token reference to individuals comes about on the one hand and type reference to the whole kind of an entity is rendered on the other. We consider how the process of reference comes about with nouns inherently denoting mass concepts and with nouns denoting countable concepts. We exemplify the interpretation of np readings with a rule component which has been implemented in the machine translation system cat2. Out of these np readings those articles are to be generated which are in accordance with the language-specific conventions.I would like to thank Randall Sharp for many discussions particularly about the English examples and for correcting my English. I would also like to thank Nadia Mesli for helping me with the French examples. With respect to my own explanation of the translation from German to French I am indebted to Michael Grabski, whose extensive classification of examples inspired me. Last but not least, thanks are due to the editors Erich Steiner and Valerio Allegranza, who pointed out a number of inconsistencies to me.     

Q-Automata: Modelling the Resource Usage of Concurrent Components

Q–automata are introduced to model quality aspects of component-based software. We propose Q-algebras as a general framework that allows us to combine and choose between quality values. Such values are added to the transitions of automata, which represent components or channels. These automata can be composed by a product construction yielding a more complex Q-automaton labelled with the combined costs of its components. Thus we establish compositionality of quality of service based on an algebra of quality attributes associated with processes represented by automata.     

Compositional Petri Net Approach to the Development of Concurrent and Distributed Systems

In the paper, a formal model based on Petri nets is proposed in the context of a compositional approach to the development and analysis of complex concurrent and distributed systems. Mutlilabels of Petri nets are introduced allowing labeling a transition not only with a single symbol, but also with a multiset of symbols. Operations on multilabeled Petri nets—parallel composition and restriction—are defined. A definition of a Petri net entity is given based on the notion of multilabels. A Petri net entity is a Petri net with a set of multilabels, where each multilabel is regarded as an access point of the entity. The operation of entity composition is introduced. Equivalence of entities is defined based on bisimulation equivalence of Petri nets. It is shown that the equivalence relation is congruent with respect to entity composition. It is also demonstrated that the composition operation is commutative and associative.     

The theoretical analysis of FDA and applications

Representation and embedding are usually the two necessary phases in designing a classifier. Fisher discriminant analysis (FDA) is regarded as seeking a direction for which the projected samples are well separated. In this paper, we analyze FDA in terms of representation and embedding. The main contribution is that we prove that the general framework of FDA is based on the simplest and most intuitive FDA with zero within-class variance and therefore the mechanism of FDA is clearly illustrated. Based on our analysis, ε-insensitive SVM regression can be viewed as a soft FDA with ε-insensitive within-class variance and L₁ norm penalty. To verify this viewpoint, several real classification experiments are conducted to demonstrate that the performance of the regression-based classification technique is comparable to regular FDA and SVM.