We consider a class of continuous-time cooperative systems evolving on the positive orthant R+. We show that if the origin is globally attractive, then it is also globally stable and, furthermore, there exists an unbounded invariant manifold where trajectories strictly decay. This leads to a small-gain type condition which is sufficient for global asymptotic stability (GAS) of the origin. We es...

This work presents an exponentially weighted moving average (EWMA)-based synthesised control scheme for a process with outliers. Based on experience, some processes occasionally have outliers. The use of traditional mean ( X ) and range (R) control charts (denoted as X=R) for monitoring process mean and variance leads to high-level false alarms. In this study, the fast-detection technique (EWMA...

This paper proposes a new topic in substructural logic for use in research joining the fields of relevance and fuzzy logics. For this, we consider old and new relevance principles. We first introduce fuzzy systems satisfying an old relevance principle, i.e., Dunn’s weak relevance principle. We present ways to obtain relevant companions of the weakening-free uninorm (based) systems introduced by...

The contemporary robotics is an excellent tool for teaching science and engineering and an attractive topic for students of all ages. Problems of robotics are fundamentally about the couple sensing – action, the two parallel activities bounded by the robot’s dynamics. It is just the robot’s dynamics that makes the relation “sense – act” difficult to control and calls for the advanced study. The...

Pull requests form a new method for collaborating in distributed software development. To study the pull request distributed development model, we constructed a dataset of almost 900 projects and 350,000 pull requests, including some of the largest users of pull requests on Github. In this paper, we describe how the project selection was done, we analyze the selected features and present a mach...

In this paper we present a new computer based training environment for the domain of air traffic control. It is the application of an already existing implementation of a cognitive model for air traffic control (Niessen et al., 1998) that is based on the psychologically founded cognitive architecture ACT-R (Anderson & Lebiere, 1998). The novelty of our new training system lies in its approach t...

In this paper, we develop techniques of action refinement for probabilistic processes within the context of a probabilistic process algebra. A semantic counterpart is carried out in a non-interleaving causality based setting, probabilistic bundle event structures. We show that our refinement notion has the following nice properties: the behaviour of the refined system can be inferred compositio...

ẋ = f (t, x) + g(t, x)u (1.1) x ∈ Rn, t 0, u ∈ U where f (t, x) and g(t, x) are C0 mappings on R+ × Rn , locally Lipschitz with respect to x ∈ Rn , with f (t, 0) = 0 for all t 0 and U ⊆ Rm is a convex set that contains 0 ∈ Rm . Our objective is to give necessary and sufficient conditions for the existence of a C0 function k : R+ × Rn → U , with k(·, 0) = 0, k(t, x) being locally Lipschitz with ...

Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) index regions in the tree may be modified during ordinary insert and delete operations, and (2) node splits during inserts are quite expensive. Both these characteristics may lead to reduced concurrency of update and query...

The question, how true concurrency differs from interleaving, has been studied intensively, beginning with the works of Mazurkiewicz [Maz], Milner [Mil], Pratt [Pra] and many others. The Mazurkiewicz trace theory requests for specifying the dependency relation, which makes such difference explicit. If in some state the sequences ab and ba are executable, then if a and b are independent, then bo...