In this paper we focus on the synthesis of labelled transition systems (LTSs) for process calculi using Mobile Ambients (MAs) as a testbed. Our proposal is based on a graphical encoding: a process is mapped into a graph equipped with interfaces such that the denotation is fully abstract with respect to the standard structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (BCs), which is an instance of relative pushouts (RPOs). The BC mechanism allows the effective construction of an LTS that has graphs with interfaces as states and labels, and such that the associated bisimilarity is a congruence. We focus here on the analysis of an LTS over processes as graphs with interfaces: we use the LTS on graphs to recover an LTS directly defined over the structure of MA processes and define a set of SOS inference rules capturing the same operational semantics.

We discuss some recent results related to the deduction of a suitable probabilistic model for the description of the statistical features of a given deterministic dynamics. More precisely, we motivate and investigate the computability of invariant measures and some related concepts. We also present some experiments investigating the limits of naive simulations in dynamics.

We consider a class of uncertain non-linear systems preceded by unknown backlash-like hysteresis, which is modelled by a differential equation. We propose a new state feedback robust adaptive control scheme using a backstepping technique and properties of the differential equation. In this control scheme, we construct a new continuous function to design an estimator to estimate the unknown constant parameters and the unknown bound of a ‘disturbance-like’ term. The transient performance of the output tracking error can be guaranteed by the introduction of pre-estimates of the unknown parameters in our controller together with update laws. We do not require bounds on the ‘disturbance-like’ term or unknown system parameters in this scheme. The global stability of the closed-loop system can be proved.

In this paper we characterise the categories of Lawvere theories and equational theories that correspond to the categories of analytic and polynomial monads on Set, and hence also to the categories of the symmetric and rigid operads in Set. We show that the category of analytic monads is equivalent to the category of regular-linear theories. The category of polynomial monads is equivalent to the category of rigid theories, that is, regular-linear theories satisfying an additional global condition. This solves a problem posed by A. Carboni and P. T. Johnstone. The Lawvere theories corresponding to these monads are identified via some factorisation systems. We also show that the categories of analytic monads and finitary endofunctors on Set are monadic over the category of analytic functors. The corresponding monad for analytic monads distributes over the monad for finitary endofunctors and hence the category of (finitary) monads on Set is monadic over the category of analytic functors. This extends a result of M. Barr.

Amalgamation is a well-known concept for graph transformations that is used to model synchronised parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalisation of the operational semantics of statecharts and other visual modelling languages, where typed attributed graphs are used for multiple rules with nested application conditions. However, the theory of amalgamation for the double-pushout approach has so far only been developed on a set-theoretical basis for pairs of standard graph rules without any application conditions.

For this reason, in the current paper we present the theory of amalgamation for $\mathcal{M}$-adhesive categories, which form a slightly more general framework than (weak) adhesive HLR categories, for a bundle of rules with (nested) application conditions. The two main results are the Complement Rule Theorem, which shows how to construct a minimal complement rule for each subrule, and the Multi-Amalgamation Theorem, which generalises the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronised parallelism. In order to apply the largest amalgamated rule, we use maximal matchings, which are computed according to the actual instance graph. The constructions are illustrated by a small but meaningful running example, while a more complex case study concerning the firing semantics of Petri nets is presented as an introductory example and to provide motivation.

We show that the problem of whether a finite set of regular-linear axioms defines a rigid theory is undecidable.

We consider structured specifications built from flat specifications using union, translation and hiding with their standard model-class semantics in the context of an arbitrary institution. We examine the alternative of sound property-oriented semantics for such specifications, and study their relationship to model-class semantics. An exact correspondence between the two (completeness) is not achievable in general. We show through general results on property-oriented semantics that the semantics arising from the standard proof system is the strongest sound and compositional property-oriented semantics in a wide class of such semantics. We also sharpen one of the conditions that does guarantee completeness and show that it is a necessary condition.

We examine the construction of joint probabilities for non-commuting observables. We show that there are indications in standard quantum mechanics that imply the existence of conditional expectation values, which in turn implies the existence of a joint distribution. We also argue that the uncertainty principle has no bearing on the existence of joint distributions but only constrains the marginal distributions. In addition, we show that within classical probability theory there are mathematical quantities that are similar to quantum mechanical wave functions. This is shown by generalising a theorem of Khinchin on the necessary and sufficient conditions for a function to be a characteristic function.

In this paper we make an empirical comparison of sales time series for online and offline channels. In particular, we analyse the sales dynamic and fluctuation level underlying the sales time series in different channels. The accumulative daily sales distributions of commodities are analysed statistically and the daily sales series are also studied from the perspective of complex networks. We find that most of the commodities' accumulative sales distributions can be fitted by power-law distributions. Visibility graphs are constructed for the daily sales series, and the accumulative degree distributions are also investigated – it is found that they also almost follow power-law distribution. The constant parameter α indicates that different specifications of the same goods have different sales characteristics, and different forms of packaging of commodities, either special offer or ordinary, also show distinctive sales fluctuation levels. The differences show that the direction of these relationships is opposite for online and offline channels.

Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church–Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of $\mathcal{M}$-adhesive categories, where $\mathcal{M}$-adhesive categories are slightly more general than weak adhesive high-level replacement categories. Most of the proofs are based on the corresponding statements for rules without application conditions and two shift lemmas stating that nested application conditions can be shifted over morphisms and rules.

Quantum computation and quantum computational logics give rise to some non-standard probability spaces that are interesting from a formal point of view. In this framework, events represent quantum pieces of information (qubits, quregisters, mixtures of quregisters), while operations on events are identified with quantum logic gates (which correspond to dynamic reversible quantum processes). We investigate the notion of Shi–Aharonov quantum computational algebra. This structure plays the role for quantum computation that is played by σ-complete Boolean algebras in classical probability theory.

Item recognition has become a hotspot in the field of computer vision research. SIFT has the advantage of requiring a low amount of information, a fast running speed and high precision, but it requires large data calculations and thus takes a long time to perform the item recognition. In this paper we propose a method of item recognition based on SIFT and SURF that provides a new way to solve the problem of item recognition, and has both feasibility and availability. This technique currently ignores colour information when dealing with colour images, but the evaluation method is capable of taking colour quality characteristics into account so it should be possible to improve the algorithm in the future. Experimental results show that this system of item recognition based on the SURF algorithm gives better matching recognition, is faster and has greater robustness.

Seely's paper Locally cartesian closed categories and type theory (Seely 1984) contains a well-known result in categorical type theory: that the category of locally cartesian closed categories is equivalent to the category of Martin-Löf type theories with Π, Σ and extensional identity types. However, Seely's proof relies on the problematic assumption that substitution in types can be interpreted by pullbacks. Here we prove a corrected version of Seely's theorem: that the Bénabou–Hofmann interpretation of Martin-Löf type theory in locally cartesian closed categories yields a biequivalence of 2-categories. To facilitate the technical development, we employ categories with families as a substitute for syntactic Martin-Löf type theories. As a second result, we prove that if we remove Π-types, the resulting categories with families with only Σ and extensional identity types are biequivalent to left exact categories.

We give a constructive proof showing that every finitely generated polynomial ideal has a Gröbner basis, provided the ring of coefficients is Noetherian in the sense of Richman and Seidenberg. That is, we give a constructive termination proof for a variant of the well-known algorithm for computing the Gröbner basis. In combination with a purely order-theoretic result we have proved in a separate paper, this yields a unified constructive proof of the Hilbert basis theorem for all Noether classes: if a ring belongs to a Noether class, then so does the polynomial ring. Our proof can be seen as a constructive reworking of one of the classical proofs, in the spirit of the partial realisation of Hilbert's programme in algebra put forward by Coquand and Lombardi. The rings under consideration need not be commutative, but are assumed to be coherent and strongly discrete: that is, they admit a membership test for every finitely generated ideal. As a complement to the proof, we provide a prime decomposition for commutative rings possessing the finite-depth property.

Active-Passive-Jamming (APJ) is formed by a chaff decoy reflecting jamming signals from an aircraft's active-ECM jammer. The effectiveness of APJ depends on many factors, one of which is the jamming signal's frequency feature. In this paper, we discuss and analyse APJ's frequency feature in a typical given offense-defense scenario for the case where the ECM jammer adopted is velocity gate pull off (VGPO), which is a kind of deception jamming technique. Our results show that the APJ's frequency feature depends not only on the jamming techniques of the jammer, but also on the Native Doppler Frequency (NDF), which is related to the relative positions, distances, angles and velocities of the jammer, radar and chaff decoy. We also carried out simulations, and the results show that the APJ mode can be useful for jamming an enemy radar.

In model transformations, where source models are automatically translated into target models or code, termination is necessary for the transformation to be well defined. There are a number of specific termination criteria that can be used when specifying model transformations by graph transformation, though termination is undecidable in general. Unfortunately, and particularly for large and heterogeneous specifications, it is often not possible to use a single termination criterion. In this paper, we propose an approach that applies different criteria to suitable subsets of rules so that termination can be shown locally using the most suitable technique for each subset. Global termination then follows if certain causal dependencies between rules in different subsets are acyclic. The theory is developed at the level of typed attributed graphs, and is motivated and illustrated by a case study translating UML activity diagrams to CSP.

Stochastic gene expression (SGE) is now considered to be an established fact and has become an important subject of research (Viñuelas et al. 2012). During the last decade, the availability of new techniques has made possible the production of more precise and more spectacular data showing the extensive variability in gene expression occurring between individual cells. However, evidence supporting probabilistic models of cell behaviour and gene expression has been available for quite a long time – for example, see the reviews in Laforge et al. (2005) and Golubev (2010). It should be noted that the first model of stochastic cell differentiation was proposed in 1964 (Till et al. 1964), which is almost at the same time as the genetic programming theory (Jacob and Monod 1961), which is deterministic in nature. One can thus wonder why the determinist view of biology has remained dominant for such a long time, and what makes a probabilistic view more acceptable nowadays? In this short paper, I will briefly argue that there is a strong epistemological obstacle to the acceptance of probabilism in biology, and that even today SGE is not integrated into a fully probabilistic approach of cellular processes, but rather into a concept that I call ‘determinism with noise’. I will argue that a new fully probabilistic theoretical framework is needed to truly integrate the stochastic aspects of cell physiology.

Biology has contradictory relationships with randomness. First, it is a complex issue for an empirical science to ensure that apparently random events are truly random, this being further complicated by the loose definitions of unpredictability used in the discipline. Second, biology is made up of many different fields, which have different traditions and procedures for considering random events. Randomness is in many ways an inherent feature of evolutionary biology and genetics. Indeed, chance/Darwinian selection principles, as well as the combinatorial genetic lottery leading to gametes and fertilisation, rely, at least partially, on probabilistic laws that refer to random events. On the other hand, molecular biology has long been based on deterministic premises that have led to a focus on the precision of molecular interactions to explain phenotypes, and, consequently, to the relegation of randomness to the marginal status of ‘noise’. However, recent experimental results, as well as new theoretical frameworks, have challenged this view and may provide unifying explanations by acknowledging the intrinsic stochastic dimension of intracellular pathways as a biological parameter, rather than just as background noise. This should lead to a significant reappraisal of the status of randomness in the life sciences, and have important consequences on research strategies for theoretical and applied biology.

The original software reliability demonstration test (SRDT) does not take adequate account of prior knowledge or the prior distribution, which can lead to an expensive use of many resources. In the current paper, we propose a new improved Bayesian based SRDT method. We begin by constructing a framework for the SRDT scheme, then we use decreasing functions to construct the prior distribution density functions for both discrete and continuous safety-critical software, and then present schemes for both discrete and continuous Bayesian software demonstration functions (which we call DBSDF and CBSDF, respectively). We have carried out a set of experiments comparing our new schemes with the classic demonstration testing scheme on several published data sets. The results reveal that the DBSDF and CBSDF schemes are both more efficient and more applicable, and this is especially the case for safety-critical software with high reliability requirements.

Triple graph grammars (TGGs) are a well-established concept for the specification and execution of bidirectional model transformations within model driven software engineering. Their main advantage is an automatic generation of operational rules for forward and backward model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we present several important results for analysing model transformations based on the formal categorical foundation of TGGs within the framework of attributed graph transformation systems.

Our first main result shows that the crucial properties of correctness and completeness are ensured for model transformations. In order to analyse functional behaviour, we generate a new kind of operational rule, called a forward translation rule. We apply existing results for the analysis of local confluence for attributed graph transformation systems. As additional main results, we provide sufficient criteria for the verification of functional behaviour as well as a necessary and sufficient condition for strong functional behaviour. In fact, these conditions imply polynomial complexity for the execution of the model transformation. We also analyse information and complete information preservation of model transformations, that is, whether a source model can be reconstructed (uniquely) from the target model computed by the model transformation. We illustrate the results for the well-known model transformation example from class diagrams to relational database models.