the first enzyme of the pathway for uridine diphosphate n-acetyl-d-glucosamine (udpag) biosynthesis i.e. l-glutamine: d-fructose 6-p amidotransferase (e.c. 2.6.1.16) was purified 52-fold from human placenta using methanol fractionation and column chromatography on deae-sephadex a-50. the enzyme showed optimal activity in a broad range of ph from 5.8 to 7.8 in both phosphate and cacodylate buffe...

In many experiments, not all explanatory variables can be controlled. When the units arise sequentially, different approaches may be used. The authors study a natural sequential procedure for “marginally restricted” D-optimal designs. They assume that one set of explanatory variables (x1) is observed sequentially, and that the experimenter responds by choosing an appropriate value of the explan...

This study concerns the scope to improve water flooding in heterogeneous reservoirs. We used an existing, in-house developed, optimization program consisting of a reservoir simulator in combination with an adjoint-based optimal control algorithm. In particular we aimed to examine the scope for optimization in a two-dimensional horizontal reservoir containing a single high permeable streak, ...

The duel paradigm appeared in the recent years as crucial to design eecient 1D or 2D pattern matching algorithms. It relies on the computation of witnesses, i.e. mismatching positions between two overlapping copies of a pattern p searched in a text t. Although this is easily done in linear time in 1D, the two previous algorithms in 2D rely on quite intricate data structures. We prove new struct...

The monopolist’s incentives towards product and process innovations are evaluated against the social optimum. The main ...ndings are that (i) the incentive to invest in cost-reducing R&D is inversely related to the number of varieties being supplied at equilibrium, under both regimes; (ii) distortions obtain under monopoly, w.r.t. both the number of varieties and the technology. With substitute...

This paper investigates the use of Design of Experiments in observational studies in order to select informative observations and features for classification. D-optimal plans are searched for in existing data and based on these plans the variables most relevant for classification are determined. The adapted models are then compared with respect to their predictive accuracy on an independent tes...

A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This cocktail algorithm extends the well-known vertex direction method (VDM; Fedorov 1972) and the multiplicative algorithm (Silvey, Titterington and Torsney, 1978), and shares their simplicity and monotonic convergence properties. Numerical examples show that the cocktail algorithm can lead to dramat...

In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for dimensional n n meshes, d> 1. For these networks we present asymptotically optimal O(kpnd) step oblivious k-k routing algorithms for all k and d > 1.