We study single-flavour quark pairing (“self-pairing”) in colour-superconducting phases of quark matter, paying particular attention to the difference between scenarios where all three flavours undergo single-flavour pairing, and scenarios where two flavours pair with each other (“2SC” pairing) and the remaining flavour self-pairs. We perform our calculations in the mean field approximation usi...

Abstract—In this paper we extend CSL (Continuous Stochastic Logic) with an expected time and an expected reward operator, both of which are parameterized by a random terminal time. With the help of such operators we can state for example that the expected sojourn time in a set of goal states within some generally distributed delay is at most (at least) some time threshold. In addition, certain ...

Conventional stream mining algorithms focus on single and stand-alone mining tasks. Given the single-pass nature of data streams, it makes sense to maximize throughput by performing multiple complementary mining tasks concurrently. We investigate the potential of concurrent semi-supervised learning on data streams and propose an incremental algorithm called CSL-Stream (Concurrent Semi–supervise...

Ubicomp applications are characterized as situationaware, frequently-and-ephemerally-communicated and QoS-properties-associated. Using middleware to provide multiple QoS support for these ubicomp applications will enhance the development of the ubicomp applications. To satisfy the different QoS requirements of various applications in ubicomp environments, which are heterogeneous and resource-va...

In this paper algorithms for model checking CSL (continuous stochastic logic) against infinite-state continuous-time Markov chains of so-called quasi birth-death type are developed. In doing so we extend the applicability of CSL model checking beyond the recently proposed case for finite-state continuous-time Markov chains, to an important class of infinite-state Markov chains. We present synta...

The Computer Systems Laboratory (CSL), National Institute of Standards and Technology, sponsored the sixteenth North American ISDN Users' Forum (NIUF) at its Gaithersburg, Maryland site on October 26-30, 1992. About 250 users, implementors, and service providers of ISDN technology attended the meeting. CSL collaborated with industry in 1988 to establish the NIUF to ensure that emerging ISDN app...

This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (MTBDDs). Properties are expressed in Continuous Stochastic Logic (CSL) [7] which includes the means to express both transient and steady-state performance measures. We show that all CSL operators can be treated using standard o...

In this paper we investigate a potential use of fluid approximation techniques in the contextof stochastic model checking of CSL formulae. We focus on properties describing the behaviourof a single agent in a (large) population of agents, exploiting a limit result known also asfast simulation. In particular, we will approximate the behaviour of a single agent with atime-inhomoge...