Implementing

This paper presents a term graph rewriting system as an implementation for the -calculus, a substitution-free language that can be used to describe the behaviour of functional programming languages at a very low level of granularity, and has first been defined in [Stéphane Lengrand. Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. In Bernhard Gramlich and Salvador Lucas, editors, Electronic Notes in Theoretical Computer Science, volume 86. Elsevier, 2003; S. van Bakel, S. Lengrand, and P. Lescanne. The language : circuits, computations and classical logic. Submitted, 2004]. Since the calculus has a notion of binding, in the context of sharing a notion of rebinding is introduced that helps avoid double binding of names.     

Delay-dependent – filter design for stochastic time-delay systems

This paper is concerned with the problem of – filter design for a class of stochastic time-delay systems. A delay-dependent sufficient condition is presented, which guarantees the existence of a linear filter ensuring that the filtering error system is stochastically asymptotically stable and its – performance satisfies a prescribed level. A desired filter can be constructed by solving certain linear matrix inequalities. A numerical example is given to demonstrate the effectiveness of the proposed method.     

Dynamics of the difference equation

We study the invariant interval, the character of semicycles, the global stability, and the boundedness of the difference equation

where the initial conditions x_−k,…,x₋₁,x₀ are nonnegative, and p,q>0.     

anti-windup for linear dead-time systems

In this paper, we address and solve the problem of anti-windup augmentation for linear systems with input and output delay. In particular, we give a formal definition of an optimal gain based anti-windup design problem in the global, local, robust and nominal cases. For each of these cases we show that a specific anti-windup compensation structure (which is a generalization of the approach in the Proceedings of the Fourth ECC, Brussels, Belgium, July 1997) is capable of solving the anti-windup problem whenever this solvable. The effectiveness of the proposed scheme is shown on a simple example taken from the literature, in which the plant is a marginally stable linear system.     

Delay-dependent filtering for time-delayed LPV systems

The present paper addresses the parameter-dependent filter design problem for output estimation in linear parameter varying (LPV) plants that include constant delays in the state. We develop LMI-based delay-dependent conditions to guarantee stability and an induced gain bound performance for the filtering error system. An explicit characterization of the filters’ state–space representation is given in terms of the solutions to a convex optimization problem associated with the synthesis conditions. By taking the output estimation error into account as the criterion, the developed filters are shown to be capable of tracking the desired outputs of the time-delayed parameter varying system in the presence of external disturbances. Two families of filters are examined: memoryless and state-delayed filters. The latter one which involves a delay term in its dynamics has the benefit of reducing the conservatism in the design and improving performance. Illustrative examples are provided to demonstrate the feasibility and advantages of the proposed methodologies for memoryless and state-delayed filter design and to validate the superiority of using the state-delayed configuration compared to the conventional memoryless filters.     

-admissibility of the right-shift semigroup on

It is shown that the right-shift semigroup on does not satisfy the weighted Weiss conjecture for α(0,1). In other words, α-admissibility of scalar valued observation operators cannot always be characterised by a simple resolvent growth condition. This result is in contrast to the unweighted case, where 0-admissibility can be characterised by a simple growth bound. The result is proved by providing a link between discrete and continuous α-admissibility and then translating a counterexample for the unilateral shift on to continuous time systems.     

Thermodynamic evaluation of Cu– system based on newly determined Gibbs energy of formation of

Thermodynamic evaluation of Cu–Cu₃P system has been conducted by applying subregular solution model with Gibbs energy of Cu₃P formation that was newly determined by means of triple Knudsen cell mass spectrometry. Both the calculated vapor pressure of phosphorus and phase diagram of Cu–P system are excellently consistent with the literature data in the composition range of Cu–Cu₃P, indicating that there is no significant thermodynamic inconsistency between the present work based on the Gibbs energy of Cu₃P formation determined and the literature data.     

Correlation of solubilities for the system with the Pitzer model at 15, 25, 50, and

Solubility data of the NaCl+LiCl+H₂O system have been measured at 15 C. These data along with others recorded in the literature, at 25, 50, and 100 C, have been correlated using the Pitzer model and the extended Debye–Hückel model. The latter was used to determine the activity and osmotic coefficients of the binary systems NaCl+H₂O and LiCl+H₂O. The results obtained in this work show that the calculated solubility values are in good agreement with the experimental ones.     

Synthetic- control charts optimized for in-control and out-of-control regions

There are real industrial cases where small shifts in the quality of a productive process do not need to be detected, but, at the same time, it is necessary to maintain the performance of the control chart to detect large shifts which are considered important. In this paper the optimization, zero- and steady-state cases, of the synthetic- control chart is studied (standard, side-sensitive, group runs and side-sensitive group runs versions) with the aim of not detecting shifts in a region of admissible shifts (in-control region) and, at the same time, being able to detect shifts considered important (out-of-control region). Genetic algorithms have been employed to solve this optimization problem and user-friendly software has been developed with the objective of helping users to select the best synthetic- chart for the process. On the other hand, a comparison is made with the optimized EWMA chart for this in-control and out-of-control optimization problem.     

Performance bounds in linear control of unstable MIMO systems with pole location constraint

This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals.     

Combining OWL ontologies using -Connections

The standardization of the Web Ontology Language (OWL) leaves (at least) two crucial issues for Web-based ontologies unsatisfactorily resolved, namely how to represent and reason with multiple distinct, but linked ontologies, and how to enable effective knowledge reuse and sharing on the Semantic Web.In this paper, we present a solution for these fundamental problems based on -Connections. We aim to use -Connections to provide modelers with suitable means for developing Web ontologies in a modular way and to provide an alternative to the owl:imports construct.With such motivation, we present in this paper a syntactic and semantic extension of the Web Ontology language that covers -Connections of OWL-DL ontologies. We show how to use such an extension as an alternative to the owl:imports construct in many modeling situations. We investigate different combinations of the logics , and for which it is possible to design and implement reasoning algorithms, well-suited for optimization.Finally, we provide support for -Connections in both an ontology editor, SWOOP, and an OWL reasoner, Pellet.