Diagnostic goal driven modelling and simulation of multiscale process systems

A systematic goal-driven top-down modelling methodology is proposed that is capable of developing a multiscale model of a process system for given diagnostic purposes. The diagnostic goal-set and the symptoms are extracted from HAZOP analysis results, where the possible actions to be performed in a fault situation are also described. The multiscale dynamic model is realized in the form of a hierarchical coloured Petri net by using a novel substitution place-transition pair. Multiscale simulation that focuses automatically on the fault areas is used to predict the effect of the proposed preventive actions. The notions and procedures are illustrated on some simple case studies including a heat exchanger network and a more complex wet granulation process.

Refinement-robust fairness

We motivate and study the robustness of fairness notions under refinement of transitions and places in Petri nets. We show that the classical notions of weak and strong fairness are not robust and we propose a hierarchy of increasingly strong, refinement-robust fairness notions. That hierarchy is based on the conflict structure of transitions, which characterizes the interplay between choice and synchronization in a fairness notion. Our fairness notions are defined on non-sequential runs, but we show that the most important notions can be easily expressed on sequential runs as well. The hierarchy is further motivated by a brief discussion on the computational power of the fairness notions.

Use of anion clay hydrotalcite to remove coloured organics from aqueous solutions

Anion clay hydrotalcite sorbents were prepared to investigate their adsorption capabilities in the removal of coloured organic substances from various aqueous systems. Anion clay hydrotalcite was found to be particularly effective at removing negatively charged species. Its excellent uptake levels of anionic species can be accounted for by its high surface area and anion exchange ability. That is, coloured substances can be adsorbed on the surface or enter the interlayer region of the clay by anion exchange. In the adsorption of Acid Blue 29 on the anion clay hydrotalcite, an equilibrium time of 1 h with dye removal exceeding 99% was obtained. The hydrotalcite was found to have an adsorption capacity marginally below that of commercial activated carbon. It should be noted that the spent sorbents can be regenerated easily by heating at 723 K to remove all adsorbed organics. The reused sorbents displayed greater adsorption capabilities than the newly prepared hydrotalcite. Hence, the anion clay hydrotalcite is easily recoverable and reusable such that it is a promising sorbent for environmental and purification purposes. (C) 2002 Elsevier Science B.V. All rights reserved.

Coloured oil droplets enhance colour discrimination

The eyes of most diurnal reptiles and birds contain coloured retinal filters-oil droplets. Although these filters are widespread, their adaptive advantage remains uncertain. To understand why coloured oil droplets appeared and were retained during evolution, I consider both the benefits and the costs of light filtering in the retina. Oil droplets decrease cone quantum catch and reduce the overlap in sensitivity between spectrally adjacent cones. The reduction of spectral overlap increases the volume occupied by object colours in a cone space, whereas the decrease in quantum catch increases noise, and thus reduces the discriminability of similar colours. The trade-off between these two effects determines the total benefit of oil droplets. Calculations show that coloured oil droplets increase the number of object colours that can be discriminated, and thus are beneficial for colour vision.

Edge-coloured cube decompositions

An edge-colored graph is a graph H together with a function f:E(H) → C where C is a set of colors. Given an edge-colored graph H, the graph induced by the edges of color c C is denoted by H(c). Let G, H, and J be graphs and let μ be a positive integer. A (J, H, G, μ) edge-colored graph decomposition is a set S = {H 1,H 2,...,H t} of edge-colored graphs with color set C = {c 1, c 2,..., c k} such that Hi ≅ H for 1 ≤ i ≤ t; Hi (cj) ≅ G for 1 ≤ i ≤ t and ≤ j ≤ k; and for j = 1, 2,..., k, each edge of J occurs in exactly μ of the graphs H 1(c j ), H 2(c j ),..., H t (c j ). Let Q 3 denote the 3-dimensional cube. In this paper, we find necessary and sufficient conditions on n, μ and G for the existence of a (K n ,Q 3,G, μ) edge-colored graph decomposition. © Birkhäuser Verlag, Basel 2007.

Differential Priors for Elastic Nets

The elastic net and related algorithms, such as generative topographic mapping, are key methods for discretized dimension-reduction problems. At their heart are priors that specify the expected topological and geometric properties of the maps. However, up to now, only a very small subset of possible priors has been considered. Here we study a much more general family originating from discrete, high-order derivative operators. We show theoretically that the form of the discrete approximation to the derivative used has a crucial influence on the resulting map. Using a new and more powerful iterative elastic net algorithm, we confirm these results empirically, and illustrate how different priors affect the form of simulated ocular dominance columns.