Batie et al. [Chemistry and Biochemistiv, of "avoenzymes, 3, 543-556 (1991)] proposed a classification system for ring-hydroxylating oxygenases in which the oxygenases are grouped into three c)asses in terms of the number of constituent components and the nature of the redex centers. But in recent years, many ringhydroxylating oxygenases haye been newly identified and characterized, and found d...

This report states and sketches the proofs for some important properties of IsaCoSy’s constraint generation algorithm. We claim that for any rewrite rule, the constraint generation algorithm produces constraints that will prohibit the synthesis of exactly the terms containing a redex which can be rewritten by that rule (and no others).

We present DBtk, a toolkit for Directed Bigraphs. DBtk supports a textual language for directed bigraphs, the graphical visualization of bigraphs, the calculation of IPO labels, and the calculation of redex matchings. Therefore, this toolkit provides the main functions needed to implement simulators and verification tools.

Motivated by parallel optimization, we experiment EDA-like adaptation-rules in the case of λ large. The rule we use, essentially based on estimation of multivariate normal algorithm, is (i) compliant with all families of distributions for which a density estimation algorithm exists (ii) simple (iii) parameter-free (iv) better than current rules in this framework of λ large. The speed-up as a fu...

this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...

A rewrite sequence is said to be outermost-fair if every out-ermost redex occurrence is eventually eliminated. O'Donnell has shown that outermost-fair rewriting is normalising for almost orthogonal rst-order term rewriting systems. In this paper we extend this result to the higher-order case.

This paper attempts to improve the computational efficiency of the well known particle swarm optimization (PSO) algorithm for tackling discrete sizing optimization problems of steel frame structures. It is generally known that, in structural design optimization applications, PSO entails enormously time-consuming structural analyses to locate an optimum solution. Hence, in the present study it i...