Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus
Proof systems for weak bisimulation equivalences in the π-calculus are presented, and their soundness and completeness are shown. The proofs of the completeness results rely on the notion of symbolic bisimulation. Two versions of π-calculus are investigated, one without and the other with the mismatch construction. For each version of the calculus proof systems for both late and early weak bisimulation equivalences are studied. Thus there are four proof systems in all. These proof systems are related in a natural way: the proof systems for early and late equivalences differ only in the inference rule for the input prefix, while the proof system for the version of π-calculus with mismatch is obtained by adding a single inference rule for the version without it.

title: Computing bisimulations for finite-control π-calculus
abstract: Symbolic bisimulation avoids the infinite branching problem caused by instantiating input names with all names in the standard definition of bisimulation in π-calculus. However, it does not automatically lead to an efficient algorithm, because symbolic bisimulation is indexed by conditions on names, and directly manipulating such conditions can be computationally costly. In this paper a new notion of bisimulation is introduced, in which the manipulation of maximally consistent conditions is replaced with a systematic employment of schematic names. It is shown that the new notion captures symbolic bisimulation in a precise sense. Based on the new definition an efficient algorithm, which instantiates input names “on-the-fly”, is presented to check bisimulations for finite-control π-calculus.

title: Model checking value-passing processes
abstract: An algorithm for model checking value-passing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mu-calculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and contains the propositional mu-calculus as a proper subset. The algorithm instantiates input variables on-the-fly and states are only generated when they are needed for the computation. To handle alternating fix-points properly, a multi-stack is employed and the controlling strategy is such that a state is evaluated without depending on the default values for more deeply nested states. The algorithm is shown correct with respect to the semantics of the predicate mu-calculus. Its complexity is also analysed.

title: Axiomatising timed automata
abstract: Timed automata has been developed as a basic semantic model for real time systems. Its algorithmic aspects for automated analysis have been well studied. But so far there is still no satisfactory algebraic theory to allow the derivation of semantical equivalence of automata by purely syntactical manipulation. The aim of this paper is to provide such a theory. We present an inference system of timed bisimulation equivalence for timed automata based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form 
$\phi \rhd t = u$ where 
$\phi$ is a clock constraint and t,u are terms denoting timed automata. The inference system is shown to be sound and complete for timed bisimulation. The proof of the completeness result relies on the notion of symbolic timed bisimulation, adapted from the work on value–passing processes.

title: Symbolic Bisimulations

title: Unique Fixpoint Induction for Mobile Processes
abstract: Complete proof systems for bisimulation equivalences in the π-calculus with recursion are presented. The key inference rule dealing with recursion is unique fixpoint induction which generalises that used in [Mil84] for regular pure-CCS. It is shown that the proof systems are sound, and also complete when restricted to the subset of π-calculus where recursions are guarded and the parallel composition is disallowed. These results on the one hand extend the proof systems for recursion-free π-calculus in [Lin94, Lin95] to infinite processes, on the other hand extend the inference system for guarded regular pure-CCS of [Mil84] to π-calculus.

title: CORNet: A Scalable and Bandwidth-Efficient Optical Burst Switching Ring Architecture for Metro Area Networks
abstract: The rapid evolution of networks has been driven by new advances in enabling technologies and the explosive growth of Internet traffic. optical burst switching (OBS) is not only cost-effective, but also provides high throughput, high bandwidth utilization, and low transmission latency. These benefits make OBS a viable solution for next-generation metro area networks (MANs) in which the traffic models are changed more dramatically than today's networks. Based on wavelength division multiplexing (WDM) technology, this study presents a loss-free optical burst switching metro ring architecture, designated the collision-free optic-burst ring network (CORNet). The proposed architecture ensures a collision-free transmission of data bursts, while retaining the advantage of the statistical multiplexing provided by conventional OBS networks. The simulation results confirm the effectiveness of the proposed CORNet architecture

title: A Note on the Decomposition Methods for Support Vector Regression
abstract: The dual formulation of support vector regression involves two closely related sets of variables. When the decomposition method is used, many existing approaches use pairs of indices from these two sets as the working set. Basically, they select a base set first and then expand it so all indices are pairs. This makes the implementation different from that for support vector classification. In addition, a larger optimization subproblem has to be solved in each iteration. We provide theoretical proofs and conduct experiments to show that using the base set as the working set leads to similar convergence (number of iterations). Therefore, by using a smaller working set while keeping a similar number of iterations, the program can be simpler and more efficient.

title: A switched delay line based optical switch architecture with a bypass line
abstract: This paper proposes a new switching architecture to be used in all-optical networks. The proposed switch, M-B-Quadro switch, is extended from an original 2/spl times/2 two-stage multi-buffer switched delay line based optical switching node, known as M-Quadro node. By incorporating bypass lines and employing a novel switch control strategy, denoted as LAVS, the switching node can effectively resolve packet contentions, thus reducing the packet deflection probability substantially.

title: Navigating inner space: 3-D assistance for minimally invasive surgery
abstract: Since its inception about three decades ago, modern minimally invasive surgery has made huge advances in both technique and technology. However, the minimally invasive surgeon is still faced with daunting challenges in terms of visualization and hand-eye coordination. At the Center for Computer Integrated Surgical Systems and Technology (CISST) we have been developing a set of techniques for assisting surgeons in navigating and manipulating the three-dimensional space within the human body. In order to develop such systems, a variety of challenging visual tracking, reconstruction and registration problems must be solved. In addition, this information must be tied to methods for assistance that improve surgical accuracy and reliability but allow the surgeon to retain ultimate control of the procedure and do not prolong time in the operating room. In this article, we present two problem areas, eye microsurgery and thoracic minimally invasive surgery, where computational vision can play a role. We then describe methods we have developed to process video images for relevant geometric information, and related control algorithms for providing interactive assistance. Finally, we present results from implemented systems.

title: Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
abstract: We propose a thresholded ensemble model for ordinal regression problems. The model consists of a weighted ensemble of confidence functions and an ordered vector of thresholds. We derive novel large-margin bounds of common error functions, such as the classification error and the absolute error. In addition to some existing algorithms, we also study two novel boosting approaches for constructing thresholded ensembles. Both our approaches not only are simpler than existing algorithms, but also have a stronger connection to the large-margin bounds. In addition, they have comparable performance to SVM-based algorithms, but enjoy the benefit of faster training. Experimental results on benchmark datasets demonstrate the usefulness of our boosting approaches.