10744767
Typing Aberrance in Signal Transduction
We have developed a calculus, called Ipi, for describing the aberrance in biological models. Our approach extends the traditional pi calculus to handle aberrant process in the signal transduction. In this paper we propose a typing system that replaces the tag system of Ipi calculus. It is shown that the typing system is equal to the tag system in terms of the expressive power.
31540088
Analyzing iKP Security in Applied Pi Calculus
The security for electronic payments is very important in electronic commerce. Many electronic payment protocols have been proposed recently to meet the security requirements. Since the design of a protocol is a difficult and error-prone task, the use of formal methods that allow for the verification of such protocols has received increasing attention. In this paper we take a look at the iKP from the point of view of the applied pi calculus. The iKP is described in the calculus and some security properties, mainly the authentication and anonymity properties, are verified.
3070522
Representation of the Signal Transduction with Aberrance Using Ipi Calculus
The pi calculus has been applied to modelling biochemical networks. In these applications, the modelling is done without considerations to exceptions. The Ipi calculus, the Interference pi calculus, is introduced to describe the signal transduction with aberrance. The calculus is obtained by adding two aberrant actions into the pi calculus and a tag system to check existing aberrance. A model of the signal transduction, RTK-MAPK, with the aberrant Ras is highlighted to illustrate the expressive power of the Ipi calculus.
17312614
Secrecy of Signals by Typing in Signal Transduction
We discuss secrecy of signals in signal transduction. As we have developed a basic concurrent language with interferencial coefficients, Iπ-calculus, to describe aberrance in biological models, a typing system for Iπ-calculus is proposed for achieving secrecy of signals in signal transduction. We show that this typing system guarantees that, if signal transduction typechecks, then it does not leak aberrance of signals.
109807
One table stores all: Enabling painless free-and-easy data publishing and sharing
In this paper, we present a free-and-easy data publishing and sharing system based on folksonomy. The system accepts data objects described with user-created metadata, called data units. The system supports flexible structure on the data units, and places no restrictions on the vocabulary used. We devise a generic table model for storing and representing the data units of various structures. We propose a framework for managing the data units and providing browsing, searching and querying services over them. We present our current approaches and discuss relevant research issues.
580501
The PADRES Distributed Publish/Subscribe System
Workflow management systems are traditionally centralized, creating a single point of failure and a scalability bottleneck. In collaboration with Cybermation, Inc., we have developed a content-based publish/subscribe platform, called PADRES, which is a distributed middleware platform with features inspired by the requirements of workflow management and business process execution. These features constitute original additions to publish/subscribe systems and include an expressive subscription language, composite subscription processing, a rulebased matching and routing mechanism, historc, query-based data access, and the support for the decentralized execution of business process specified in XML. PADRES constitutes the basis for the next generation of enterprise management systems developed by Cybermation, Inc., including business process automation, monitoring, and execution applications.
1640564
Schema Mapping in P2P Networks Based on Classification and Probing
In this paper, we address the problems of adaptive schema mappings between different peers in peer-to-peer networks and searching for interesting data residing at different peers based on such mappings. We begin by classifying the shared schema of each peer into a taxonomy of relation categories and attribute categories. We then propose our adaptive schema mapping by selectively probing the shared schema with query probes, which are generated by the classification rules. To improve the accuracy of schema mapping, we introduce the notion of confusion matrix and prior-knowledge. Finally, we present the query reformulation strategy for retrieving and integrating data from all relevant peers. We have implemented our proposed schema mapping and query processing methods in real settings with real datasets. The experimental results show that our method can be adopted effectively in practice.
1876314
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
A tree of rings is an undirected graph obtained from a tree by replacing each node of the tree with a cycle and then contracting the edges of the tree so that two cycles corresponding to the two end-nodes of any edge have precisely one node in common. Given a set of paths on a tree of rings, the routing problem is to color the paths with the smallest number of colors so that any two paths sharing an edge are assigned different colors. We present a 2-approximation algorithm in this paper.
2186483
Improvements for the Symbolic Verification of Timed Automata
Based on the equivalence relation for location based reachability between continuous and integer semantics of closed timed automata, Beyer et al. have implemented the verifier Rabbit, with the uniform representation of reachable configurations. However, the growth of maximal constant of clock variables will decline the performance of Rabbit. The paper proposes an improved symbolic method, using binary decision diagrams (BDDs) to store the symbolic representation of discretized states, for the verification of timed systems. Compared with Rabbit, experiments demonstrate that besides the memory reduction, our implementation is also less sensitive to the size of clock domain.