Standard Functional Uniication Grammars (FUGs) provide a structurally guided top-down control regime for sentence generation. When using FUGs to perform content realization as a whole, including lexical choice, this regime is no longer appropriate for two reasons: (1) the uniication of non-lexicalized semantic input with an integrated lexico-grammar requires mapping \\oating" semantic elements ...

Wolf (2005; 2007) argues that the realization of featural affixes in mutation morphology is triggered by the constraint MaxFlt which requires that phonological material not linked to a root node (“floating features”) is fully preserved in the output. As evidence that the realization of floating features cannot be achieved by the weaker, but more general constraint Realize Morpheme (van Oostendo...

The thesis provides a detailed analysis of the independence structure possessed by multiscale models and demonstrates that such an analysis provides important insight into the multiscale stochastic realization problem. Multiscale models constitute a broad class of probabilistic models which includes the well-known subclass of multiscale autoregressive (MAR) models. MAR models have proven useful...

model order reduction is known as the problem of minimizing the -norm of the difference between the transfer function of the original system and the reduced one. in many papers, linear matrix inequality (lmi) approach is utilized to address the minimization problem. this paper deals with defining an extra matrix inequality constraint to guarantee that the minimum phase characteristic of the sys...

This paper presents a tuned behavior-based guidance algorithm for formation flight of quadrotors. The behavior-based approach provides the basis for the simultaneous realization of different behaviors such as leader following and obstacle avoidance for a group of agents; in our case they are quadcopters. In this paper optimization techniques are utilized to tune the parameters of a behavior-bas...

We argue to base the compilation of a particular language for writing constraint solvers, CHR, on partial evaluation (PE). In contrast to previous compilers realizations the semantics of the generated code are easier to prove to correspond to the intended ones and we can capitalize on the possibility to control the degree of PE, which allows for everything between interpreted execution to full ...

We report on the design and implementation of a system for collaborative constraint solving. The system takes advantage of the capabilities of Jini to implement the infrastructure required by such a system. We describe the conceptual model, its realization as a genuine Jini application, and illustrate it’s functionality.

We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into the hierarchical graph rewriting language lmntal. The support of lmntal to express local computations and to describe the migration of processes and rules between local computation spaces allows a clear and simple enco...

We point out several features of the quantum Hamiltonian constraints recently introduced by Thiemann for Euclidean gravity. In particular we discuss the issue of the constraint algebra and of the quantum realization of the object qVb, which is classically the Poisson Bracket of two Hamiltonians.

Unification is a basic concept in several traditional symbolic formalisms that should be well-suited for a connectionist implementation due to the intuitive nature of the notions it formalizes. It is shown that by approaching unification from a graph matching and constraint satisfaction perspective a natural and efficient realization in a structured connectionist network can be found.