Results 1  10
of
50
The Name Discipline of Uniform Receptiveness
 Theoretical Computer Science
, 1997
"... In a process calculus, we say that a name x is uniformly receptive for a process P if: (1) at any time P is ready to accept an input at x, at least as long as there are processes that could send messages at x; (2) the input offer at x is functional, that is, all messages received by P at x are appli ..."
Abstract

Cited by 63 (4 self)
 Add to MetaCart
(Show Context)
In a process calculus, we say that a name x is uniformly receptive for a process P if: (1) at any time P is ready to accept an input at x, at least as long as there are processes that could send messages at x; (2) the input offer at x is functional, that is, all messages received by P at x are applied to the same continuation. In the calculus this discipline is employed, for instance, when modeling functions, objects, higherorder communications, remoteprocedure calls. We formulate the discipline of uniform receptiveness by means of a type system, and then we study its impact on behavioural equivalences and process reasoning. We develop some theory and proof techniques for uniform receptiveness, and illustrate their usefulness on some nontrivial examples.
Behavioral Equivalence in the Polymorphic PiCalculus
 JOURNAL OF THE ACM
, 1997
"... We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manip ..."
Abstract

Cited by 58 (8 self)
 Add to MetaCart
We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic picalculus and ML.
HigherOrder Concurrent Linear Logic Programming
 In Theory and Practice of Parallel Programming
, 1995
"... . We propose a typed, higherorder, concurrent linear logic programming called higherorder ACL, which uniformly integrates a variety of mechanisms for concurrent computation based on asynchronous message passing. Higherorder ACL is based on a proof search paradigm according to the principle, p ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
. We propose a typed, higherorder, concurrent linear logic programming called higherorder ACL, which uniformly integrates a variety of mechanisms for concurrent computation based on asynchronous message passing. Higherorder ACL is based on a proof search paradigm according to the principle, proofs as computations, formulas as processes in linear logic. In higherorder ACL, processes as well as functions, and other values can be communicated via messages, which provides high modularity of concurrent programs. Higherorder ACL can be viewed as an asynchronous counterpart of Milner's higherorder, polyadic  calculus. Moreover, higherorder ACL is equipped with an elegant MLstyle type system that ensures (1) well typed programs can never cause type mismatch errors, and (2) there is a type inference algorithm which computes a most general typing for an untyped term. We also demonstrate a power of higherorder ACL by showing several examples of "higherorder concurrent prog...
The Role of Dialectics in Defeasible Argumentation
, 1994
"... In A Mathematical Treatment of Defeasible Reasoning [8], or MTDR, a clear and theoretically sound structure for a reasoning system was introduced. Since its publication other proposals have been advanced [2, 9, 6, 1], some of them containing valuable observations on this foundation. This paper prese ..."
Abstract

Cited by 30 (18 self)
 Add to MetaCart
In A Mathematical Treatment of Defeasible Reasoning [8], or MTDR, a clear and theoretically sound structure for a reasoning system was introduced. Since its publication other proposals have been advanced [2, 9, 6, 1], some of them containing valuable observations on this foundation. This paper presents further developments based on the MTDR framework. Two main results are shown. Firstly, several alternative implementations of MTDR were based on dialectical concepts, which needed proper formalization. Secondly, the confrontation of the resulting formalism with the abovementioned work of other researchers has shown that some of the original definitions needed to be honed to avoid fallacious reasoning. The resulting, evolved,...
Microarray Optimizations: Increasing Spot Accuracy and Automated Identification of True Microarray Signals
, 2002
"... In this paper, fluorescent microarray images and various analysis techniques are described to improve the microarray data acquisition processes. Signal intensities produced by rarely expressed genes are initially correctly detected, but they are often lost in corrections for background, log or ratio ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
In this paper, fluorescent microarray images and various analysis techniques are described to improve the microarray data acquisition processes. Signal intensities produced by rarely expressed genes are initially correctly detected, but they are often lost in corrections for background, log or ratio. Our analyses indicate that a simple correlation between the mean and median signal intensities may be the best way to eliminate inaccurate microarray signals. Unlike traditional quality control methods, the low intensity signals are retained and inaccurate signals are eliminated in this mean and median correlation. With larger amounts of microarray data being generated, it becomes increasingly more difficult to analyze data on a visual basis. Our method allows for the automatic quantitative determination of accurate and reliable signals, which can then be used for normalization. We found that a mean to median correlation of 85% or higher not only retains more data than current methods, but the retained data is more accurate than traditional thresholds or common spot flagging algorithms. We have also found that by using pin microtapping and microvibrations, we can control spot quality independent from initial PCR volume.
Naming proofs in classical propositional logic
 IN PAWE̷L URZYCZYN, EDITOR, TYPED LAMBDA CALCULI AND APPLICATIONS, TLCA 2005, VOLUME 3461 OF LECTURE
"... We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentiali ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cutelimination procedure. This gives us a “Boolean ” category, which is not a poset. With the semiring of natural numbers, we obtain a sound semantics for classical logic, in which fewer proofs are identified. Though a “real” sequentialization theorem is missing, these proof nets have a grip on complexity issues. In both cases the cut elimination procedure is closely related to its equivalent in the calculus of structures.
ThresholdBased Dynamic Replication in LargeScale VideoonDemand Systems
, 1998
"... Recent advances in high speed networking technologies and video compression techniques have made VideoonDemand (VOD) services feasible. A largescale VOD system imposes a large demand on I/O bandwidth and storage resources, and therefore, parallel disks are typically used for providing VOD service ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
Recent advances in high speed networking technologies and video compression techniques have made VideoonDemand (VOD) services feasible. A largescale VOD system imposes a large demand on I/O bandwidth and storage resources, and therefore, parallel disks are typically used for providing VOD service. Although striping of movie data across a large number of disks can balance the utilization among these disks, such a striping technique can exhibit additional complexity, for instance, in data management, such as synchronization among disks during data delivery, as well as in supporting fault tolerant behavior. Therefore, it is more practical to limit the extent of data striping, for example, by arranging the disks in groups (or nodes) and then allowing intragroup (or intranode) data striping only. With multiple striping groups, however, we may need to assign a movie to multiple nodes so as to satisfy the total demand of requests for that movie. Such an approach gives rise to several design issues, including: (1) what is the right number of copies of each movie we need so as to satisfy the demand and at the same time not waste storage capacity, (2) how to assign these movies to dierent nodes in the system, and (3) what are ecient approaches to altering the number of copies of each movie (and their placement) when the need for that arises. In this paper, we study an approach to dynamically recon guring the VOD system so as to alter the number of copies of each movie maintained on the server as the access demand for these movies uctuates. We propose various approaches to addressing the above stated issues, which result in a VOD design that is adaptive to the changes in data access patterns. Performance evaluation is carried out to quantify the costs and the performance g...
L.: Constructing free Boolean categories
, 2005
"... By Boolean category we mean something which is to a Boolean algebra what a category is to a poset. We propose an axiomatic system for Boolean categories, which is different in several respects from the ones proposed recently. In particular everything is done from the start in a *autonomous category ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
By Boolean category we mean something which is to a Boolean algebra what a category is to a poset. We propose an axiomatic system for Boolean categories, which is different in several respects from the ones proposed recently. In particular everything is done from the start in a *autonomous category and not in a weakly distributive one, which simplifies issues like the Mix rule. An important axiom, which is introduced later, is a “graphical ” condition, which is closely related to denotational semantics and the Geometry of Interaction. Then we show that a previously
Efficiency of JADE agent platform
, 2005
"... Agent oriented programming is often claimed to become the next breakthrough in development and implementation of largescale complex software systems. At the same time it is rather difficult to find successful applications of agent technology, in particular when largescale systems are considered. ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
Agent oriented programming is often claimed to become the next breakthrough in development and implementation of largescale complex software systems. At the same time it is rather difficult to find successful applications of agent technology, in particular when largescale systems are considered. The aim of this paper is to investigate if one of the possible limits could be the scalability of existing agent environments. For this purpose we have selected JADE agent platform and investigated its performance in a number of testscenarios. Results of our experiments are presented and discussed.