Results 11 - 20 of 10,948

Graph Algebras for Bigraphs

by Davide Grohmann, Marino Miculan , 2010
"... Binding bigraphs are a graphical formalism intended to be a meta-model for mobile, concurrent and communicating systems. In this paper we present an algebra of typed graph terms which correspond precisely to binding bigraphs over a given signature. As particular cases, pure bigraphs and local bigra ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Binding bigraphs are a graphical formalism intended to be a meta-model for mobile, concurrent and communicating systems. In this paper we present an algebra of typed graph terms which correspond precisely to binding bigraphs over a given signature. As particular cases, pure bigraphs and local

A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation

by Ian Foster, Carl Kesselman, Craig Lee, Bob Lindell, Klara Nahrstedt, Alain Roy
"... The realization of end-to-end quality of service (QoS) guarantees in emerging network-based applications requires mechanisms that support first dynamic discovery and then advance or immediate reservation of resources that will often be heterogeneous in type and implementation and independently contr ..."
Abstract - Cited by 245 (26 self) - Add to MetaCart
controlled and administered.We propose the Globus Architecture for Reservation and Allocation (GARA) to address these four issues.GARA treats both reservations and computational elements such as processes, network flows, and memory blocks as first class entities, allowing them to be created, monitored

Trace inference, curvature consistency, and curve detection

by Pierre Parent, Steven W. Zucker - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1989
"... We describe a novel approach to curve inference based on curvature information. The inference procedure is divided into two stages: a trace inference stage, to which this paper is devoted, and a curve synthesis stage, which will be treated in a separate paper. It is shown that recovery of the trace ..."
Abstract - Cited by 241 (15 self) - Add to MetaCart
We describe a novel approach to curve inference based on curvature information. The inference procedure is divided into two stages: a trace inference stage, to which this paper is devoted, and a curve synthesis stage, which will be treated in a separate paper. It is shown that recovery of the trace

Bigraphical Reactive Systems: Basic Theory

by Robin Milner - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF MATHEMATICIANS , 2001
"... A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which ..."
Abstract - Cited by 26 (7 self) - Add to MetaCart
A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which

Distributed multirobot localization

by Stergios I. Roumeliotis, George A. Bekey - IEEE Transactions on Robotics and Automation , 2002
"... Abstract. This paper presents a new approach to the cooperative localization problem, namely distributed multi-robot localization. A group of M robots is viewed as a single system composed of robots that carry, in general, di erent sensors and have di erent positioning capabilities. A single Kalman ..."
Abstract - Cited by 180 (20 self) - Add to MetaCart
to allow for distributed processing, the equations of the centralized Kalman lter are treated so that this lter can be decomposed into M modi ed Kalman lters each running on a separate robot. The distributed localization algorithm is applied to a group of 3 robots and the improvement in localization

TERMGRAPH 2009 Graph Grammars for Local Bigraphs

by Davide Grohmanna, Marino Miculana
"... We give a formal connection between the graph grammars of Synchronized Hyperedge Replacement and Architectural Design Rewriting, and local bigraphs. First, we define a category of SHR agents, which extend SHR graphs allowing for open systems (i.e., systems with “holes”) and multiple locations. Then, ..."
Abstract - Add to MetaCart
We give a formal connection between the graph grammars of Synchronized Hyperedge Replacement and Architectural Design Rewriting, and local bigraphs. First, we define a category of SHR agents, which extend SHR graphs allowing for open systems (i.e., systems with “holes”) and multiple locations. Then

Controlling resource access in Directed Bigraphs

by Davide Grohmann, Marino Miculan, Davide Grohmann, Marino Miculan
"... Abstract: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous versions, we add the possibility that components may govern the access to resources, like (web) servers control requ ..."
Abstract - Add to MetaCart
Abstract: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous versions, we add the possibility that components may govern the access to resources, like (web) servers control

Anchor-PROMPT: Using Non-Local Context for Semantic Matching

by Natalya F. Noy, Mark A. Musen - IN PROCEEDINGS OF THE WORKSHOP ON ONTOLOGIES AND INFORMATION SHARING AT THE INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI , 2001
"... Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web where they provide semantics for annotations in Web pages. This distributed nature of ontology development has led t ..."
Abstract - Cited by 182 (8 self) - Add to MetaCart
and implemented Anchor-PROMPT---an algorithm that finds semantically similar terms automatically. Anchor-PROMPT takes as input a set of anchors---pairs of related terms defined by the user or automatically identified by lexical matching. AnchorPROMPT treats an ontology as a graph with classes as nodes

Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names

by Mikkel Bundgaard, Thomas Hildebrandt - Proceedings of the Graph Transformation for Verification and Concurrency workshop (GT-VC'05) , 2006
"... Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own linkages and nested locations, generalising both characteristics of the π-calculus and the Mobile Ambients calculus. We give the first bigraphical presentatio ..."
Abstract - Cited by 22 (13 self) - Add to MetaCart
presentation of a non-linear, higher-order process calculus with nested locations, non-linear active process mobility, and local names, the calculus of Higher-Order Mobile Embedded Resources (Homer). The presentation is based on Milner’s recent presentation of the λ-calculus in local bigraphs. The combination

Local anesthetics : hydrophilic and hydrophobic pathways for the drug-receptor reaction

by Bertil Hille - J. Gen , 1977
"... neutral, amine, and quaternary local anesthetic compounds. The kinetics of the Na currents are governed by a composite of voltage- and time-dependent gating processes with voltage- and time-dependent block of channels by drug. Conventional measurements of steady-state sodium inactivation by use of 5 ..."
Abstract - Cited by 171 (0 self) - Add to MetaCart
neutral, amine, and quaternary local anesthetic compounds. The kinetics of the Na currents are governed by a composite of voltage- and time-dependent gating processes with voltage- and time-dependent block of channels by drug. Conventional measurements of steady-state sodium inactivation by use
Results 11 - 20 of 10,948