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...

ConTroll is a grammar development system which supports the implementation of current constraint-based theories. It uses strongly typed feature structures as its principal data structure and ooers deenite relations, universal constraints, and lexical rules to express grammar constraints. The aspects of ConTroll of relevance to the development of large grammars are discussed in detail. The syste...

A criterion is given for a strong type in a finite rank stable theory T to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana [5] which give criteria for a compact complex analytic space to be “algebraic” (namely Moishezon). The canonical base property for a stable theory states that the type of the canonical base of a stationary type over a re...

Let p be a strong type of an algebraically closed tuple over B = acl(B) in any theory T . Depending on a ternary relation |̂ ∗ satisfying some basic axioms (there is at least one such, namely the trivial independence in T ), the first homology group H∗ 1 (p) can be introduced, similarly to [3]. We show that there is a canonical surjective homomorphism from the Lascar group over B to H∗ 1 (p). We...

Two important aspects of semantic parsing for question answering are the breadth of the knowledge source and the depth of logical compositionality. While existing work trades off one aspect for another, this paper simultaneously makes progress on both fronts through a new task: answering complex questions on semi-structured tables using question-answer pairs as supervision. The central challeng...

Component states can be formalized in higher-order logic as (1) functions from variables to values and (2) records, among other possibilities. Variable-to-value maps are natural, but they yield weak typing and restrict the user to a predefined value space. Record types define component signatures and properties need to be transferred between the various signatures. The method yields strong typi...

Entities in engineering design databases need to evolve in both structure and behavior. Such a need is not well addressed by object-oriented data models based on the class concept. On the contrary, models that are based on the prototype concept allow dynamic object evolution but they do not have the abilities for object classification and strong typing supported by models that have classes. In ...

We show that the Hardy-Littlewood maximal operator and a class of CalderónZygmund singular integrals satisfy the strong type modular inequality in variable Lp spaces if and only if the variable exponent p(x) ∼ const.