Results 1  10
of
1,532
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important since almost all CLP systems use an incomplete solver. Third, we give conditions on the (possibly incomplete) solver which ensure that the operational semantics is confluent, that is, has independence of literal scheduling.
Particle Representations for MeasureValued Population Models
 Ann. Probab
, 1998
"... Models of populations in which a type or location, represented by a point in a metric space E, is associated with each individual in the population are considered. A population process is neutral if the chances of an individual replicating or dying do not depend on its type. Measurevalued processes ..."
Abstract

Cited by 109 (4 self)
 Add to MetaCart
Models of populations in which a type or location, represented by a point in a metric space E, is associated with each individual in the population are considered. A population process is neutral if the chances of an individual replicating or dying do not depend on its type. Measurevalued processes are obtained as infinite population limits for a large class of neutral population models, and it is shown that these measurevalued processes can be represented in terms of the total mass of the population and the de Finetti measures associated with an E 1 valued particle model X = (X 1 ; X 2 ; : : :) such that for each t 0, (X 1 (t); X 2 (t); : : :) is exchangeable. The construction gives an explicit connection between genealogical and diffusion models in population genetics. The class of measurevalued models covered includes both neutral FlemingViot and DawsonWatanabe processes. The particle model gives a simple representation of the DawsonPerkins historical process and Perkins h...
A picalculus semantics for an objectbased design notation
 Proceedings of CONCUR'93, LNCS 715
, 1993
"... Abstract. Companion papers give examples of the development of concurrent programs using a design notation which employs a number of concepts from objectoriented programming languages. This paper documents the semantics of the design language by providing a mapping to the picalculus. 1 ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
Abstract. Companion papers give examples of the development of concurrent programs using a design notation which employs a number of concepts from objectoriented programming languages. This paper documents the semantics of the design language by providing a mapping to the picalculus. 1
Multidimensional morphable models: A framework for representing and matching object classes
 Int. J. Comput. Vis
, 1998
"... This thesis describes a flexible model for representing images of objects of a certain class, such as faces, and introduces a new algorithm for matching the model to novel images from the class. The model and matching algorithm are very general and can be used for many image analysis tasks. The flex ..."
Abstract

Cited by 91 (15 self)
 Add to MetaCart
This thesis describes a flexible model for representing images of objects of a certain class, such as faces, and introduces a new algorithm for matching the model to novel images from the class. The model and matching algorithm are very general and can be used for many image analysis tasks. The flexible model, called a multidimensional morphable model, is learned from example images (called prototypes) of objects of a class. In the learning phase, pixelwise correspondences between a reference prototype and each of the other prototypes are first computed and then used to obtain shape and texture vectors associated with each prototype. The morphable model is then synthesized as a linear combination that spans the linear vector space determined by the prototypical shapes and textures. We next introduce an effective stochastic gradient descent algorithm that automatically matches a model to a novel image by finding the parameters that minimize the error between the image generated by the model and the novel image. Several experiments demonstrate the robustness and the broad range of applicability of the matching algorithm and the underlying
Integrin cytoplasmic domains mediate insideout signal transduction
 J. Cell
, 1994
"... Abstract. We analyzed the binding of fibronectin to integrin a5/31 in various cells; in some cells fibronectin bound with low affinity (e.g., K562 cells) whereas in others (e.g., CHO), it bound with high affinity (Kd,~ 100 nM) in an energydependent manner. We constructed chimeras of the extracellul ..."
Abstract

Cited by 83 (6 self)
 Add to MetaCart
Abstract. We analyzed the binding of fibronectin to integrin a5/31 in various cells; in some cells fibronectin bound with low affinity (e.g., K562 cells) whereas in others (e.g., CHO), it bound with high affinity (Kd,~ 100 nM) in an energydependent manner. We constructed chimeras of the extracellular and transmembrane domains of c~3 joined to the cytoplasmic domains of otsBl. The affinity state of these chimeras was assessed by binding of fibrinogen or the monoclonal antibody, PACl. The cytoplasmic domains of 0~5/ ~ conferred an energydependent high affinity state on otnbB3 in CliO but not K562 cells. Three additional tx cytoplasmic domains (ix2, otv~, ot~B) conferred PAC1 binding in CHO cells, while three others (otM, OiL, av) did not. In the high affinity ot chimeras, cotransfection with a truncated (~3A724) or mutated (~3(S752"~P)) 83 subunit abolished high affinity binding. Thus, both cytoplasmic domains are required for energydependent, cell typespecific affinity modulation. In addition, mutations that disrupted a highly conserved o ~ subunit GFFICR motif, resulted in high affinity binding of ligands to Otnb/~3. In contrast to the chimeras, the high affinity state of these mutants was independent of cellular metabolism, cell type, and the bulk of the ~ subunit cytoplasmic domain. Thus, integrin cytoplasmic domains mediate insideout signaling. Furthermore, ' the highly conserved GFFKR motif of the c ~ Subunit cytoplasmic domain maintains the default low affinity state. C ELLS alter their adhesiveness in response to developmental events or environmental cues. These adaptations are often mediated through integrins, adhesion receptors composed of two transmembrane subunits, ct and B (43). Rapid changes in integrin function are critical in cell migration, cellular aggregation, and leukocyte transmigration
Using Powerdomains to Generalize Relational Databases
 Theoretical Computer Science
, 1991
"... Much of relational algebra and the underlying principles of relational database design have a simple representation in the theory of domains that is traditionally used in the denotational semantics of programming languages. By investigating the possible orderings on powerdomains that are wellknown ..."
Abstract

Cited by 77 (20 self)
 Add to MetaCart
Much of relational algebra and the underlying principles of relational database design have a simple representation in the theory of domains that is traditionally used in the denotational semantics of programming languages. By investigating the possible orderings on powerdomains that are wellknown in the study of nondeterminism and concurrency it is possible to show that many of the ideas in relational databases apply to structures that are much more general than relations. This also suggests a method of representing database objects as typed objects in programming languages. In this paper we show how operations such as natural join and projection  which are fundamental to relational database design  can be generalized, and we use this generalized framework to give characterizations of several relational database concepts including functional dependencies and universal relations. All of these have a simpleminded semantics in terms of the underlying domains, which can be thought ...
Results 1  10
of
1,532