The Lagrange dual function is: g(u, v) = min x L(x, u, v) The corresponding dual problem is: maxu,v g(u, v) subject to u ≥ 0 The Lagrange dual function can be viewd as a pointwise maximization of some affine functions so it is always concave. The dual problem is always convex even if the primal problem is not convex. For any primal problem and dual problem, the weak duality always holds: f∗ ≥ g...

We present definitions of homology groups Hn(p), n ≥ 0, associated to a complete type p. We show that if the generalized amalgamation properties hold, then the homology groups are trivial. We compute the group H2(p) for strong types in stable theories and show that any profinite abelian group can occur as the group H2(p). The work described in this paper was originally inspired by Hrushovski’s ...

We deene a higher order logic which has only a weak notion of type, and which permits all terms of the untyped lambda calculus and allows the use of the Y combinator in writing recursive predicates. The consistency of the logic is maintained by a distinction between use and mention, as in Gilmore's logics. We give a consistent model theory and a proof system which is valid with respect to the m...

The phrase \optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretation. As it has become clear that it does not imply \optimality" in the everyday meaning of the word, we propose to rename the concept \Jones-optimality". We argue that the 1993 de nition of Jones-optimality is in principle ...

This paper presents an environment for collecting clinical data using structured speech input. The system uses nomenclature terms and data consistency rules to limit speech input to a discrete set of phrases which can be configured to support a wide range of studies. This information is stored in an eventoriented data model as strongly typed observations for subsequent distribution and data ana...

The purpose of this study was to examine the psychometric properties of the Korean version of the Organizational Culture Assessment Instrument (OCAI) based on the Competing Values Framework (CVF). More specially, cultural equivalence between the Korean version and the original English version of the OCAI was evaluated using 39 bilingual Koreans. Next, a field test was conducted to examine scale...

The use of strong typing, exemplified in the Ascend modeling language, is a recent phenomenon in executable modeling languages for mathematical modeling. It is also one that has significant potential for improving the functionality of computer-based modeling environments. Besides being a strongly typed language, Ascend is unique in providing operators that allow dynamic type inference, a featur...

This paper presents a pragmatic way of implementing content-based publish/subscribe in a strongly typed object-oriented language. In short, we use structural reflection to implement filter objects through which applications express their subscription patterns. Our approach is pragmatic in the sense that it alleviates the need for any specific subscription language. It preserves encapsulation of...

We describe a general technique for determining upper bounds on maximal values (or lower bounds on minimal costs) in stochastic dynamic programs. In this approach, we relax the nonanticipativity constraints that require decisions to depend only on the information available at the time a decision is made and impose a “penalty” that punishes violations of nonanticipativity. In applications, the h...

Ant Colony algorithms are population-based methods widely used in combinatorial optimization problems. We propose a strongly typed genetic programming approach to automatically evolve the communication mechanism that allows ants to cooperatively solve a given problem. Results obtained with several TSP instances show that the evolved pheromone update strategies are effective, exhibit a good gene...