A fuzzy max-flow min-cut theorem

Interval-valued versions of the max-flow min-cut theorem and Karp-Edmonds algorithm are developed and provide robustness estimates for flows in networks in an imprecise or uncertain environment. These results are extended to networks with fuzzy capacities and flows. (C) 2001 Elsevier Science B.V. All rights reserved.

Cell compartmentalisation in planctomycetes: novel types of structural organisation for the bacterial cell

The organisation of cells of the planctomycete species Pirellula marina, Isosphaera pallida, Gemmata obscuriglobus, Planctomyces mat-is and Candidatus Brocadia anammoxidans was investigated based on ultrastructure derived from thin-sections of cryosubstituted cells, freeze-fracture replicas, and in the case of Gemmata obscuriglobus and Pirellllla marina, computer-aided 3-D reconstructions from serial sections of cryosubstituted cells. All planctomycete cells display a peripheral ribosome-free region, termed here the paryphoplasm, surrounding the perimeter of the cell, and an interior region including any nucleoid regions as well as ribosome-like particles, bounded by a single intracytoplasmic membrane (ICM), and termed the pirellulosome in Pirellula species. Immunogold labelling and RNase-gold cytochemistry indicates that in planctomycetes all the cell DNA is contained wholly within the interior region bounded by the ICM, and the paryphoplasm contains no DNA but at least some of the cell's RNA. The ICM in Isosphaera pallida and Planctomyces mat-is is invaginated such that the paryphoplasm forms a major portion of the cell interior in sections, but in other planctomycetes it remains as a peripheral zone. In the anaerobic ammonium-oxidising (anammox process) chemoautotroph Candidatus Brocadia anammoxidans the interior region bounded by ICM contains a further internal single-membrane-bounded region, the anam-moxosome. In Gemmata obscuriglobus. the interior ICM-bounded region contains the nuclear body, a double-membrane-bounded region containing the cell's nucleoid and all genomic DNA in addition to some RNA. Shared features of cell compartmentalisation in different planctomycetes are consistent with the monophyletic nature of the planctomycetes as a distinct division of the Bacteria. The shared organisational plan for the planctomycete cell constitutes a new type not known in cells of other bacteria.

Three-point boundary value problems for second-order, ordinary, differential equations

We establish existence results for solutions to three-point boundary value problems for nonlinear, second-order, ordinary differential equations with nonlinear boundary conditions. (C) 2001 Elsevier Science Ltd. All rights reserved.

Topological methods for some boundary value problems

We establish existence of solutions for a finite difference approximation to y = f(x, y, y ') on [0, 1], subject to nonlinear two-point Sturm-Liouville boundary conditions of the form g(i)(y(i),y ' (i)) = 0, i = 0, 1, assuming S satisfies one-sided growth bounds with respect to y '. (C) 2001 Elsevier Science Ltd. All rights reserved.

Differential inclusions and robust control theory

Uncontrolled systems (x) over dot is an element of Ax, where A is a non-empty compact set of matrices, and controlled systems (x) over dot is an element of Ax + Bu are considered. Higher-order systems 0 is an element of Px - Du, where and are sets of differential polynomials, are also studied. It is shown that, under natural conditions commonly occurring in robust control theory, with some mild additional restrictions, asymptotic stability of differential inclusions is guaranteed. The main results are variants of small-gain theorems and the principal technique used is the Krasnosel'skii-Pokrovskii principle of absence of bounded solutions.

Should optional properties be used in conceptual modelling? A theory and three empirical tests

An important feature of some conceptual modelling grammars is the features they provide to allow database designers to show real-world things may or may not possess a particular attribute or relationship. In the entity-relationship model, for example, the fact that a thing may not possess an attribute can be represented by using a special symbol to indicate that the attribute is optional. Similarly, the fact that a thing may or may not be involved in a relationship can be represented by showing the minimum cardinality of the relationship as zero. Whether these practices should be followed, however, is a contentious issue. An alternative approach is to eliminate optional attributes and relationships from conceptual schema diagrams by using subtypes that have only mandatory attributes and relationships. In this paper, we first present a theory that led us to predict that optional attributes and relationships should be used in conceptual schema diagrams only when users of the diagrams require a surface-level understanding of the domain being represented by the diagrams. When users require a deep-level understanding, however, optional attributes and relationships should not be used because they undermine users' abilities to grasp important domain semantics. We describe three experiments which we then undertook to test our predictions. The results of the experiments support our predictions.

Thermal/mechanical simulation and laboratory fatigue testing of an alternative yttria tetragonal zirconia polycrystal core-veneer all-ceramic layered crown design

This study evaluated the stress levels at the core layer and the veneer layer of zirconia crowns (comprising an alternative core design vs. a standard core design) under mechanical/thermal simulation, and subjected simulated models to laboratory mouth-motion fatigue. The dimensions of a mandibular first molar were imported into computer-aided design (CAD) software and a tooth preparation was modeled. A crown was designed using the space between the original tooth and the prepared tooth. The alternative core presented an additional lingual shoulder that lowered the veneer bulk of the cusps. Finite element analyses evaluated the residual maximum principal stresses fields at the core and veneer of both designs under loading and when cooled from 900 degrees C to 25 degrees C. Crowns were fabricated and mouth-motion fatigued, generating master Weibull curves and reliability data. Thermal modeling showed low residual stress fields throughout the bulk of the cusps for both groups. Mechanical simulation depicted a shift in stress levels to the core of the alternative design compared with the standard design. Significantly higher reliability was found for the alternative core. Regardless of the alternative configuration, thermal and mechanical computer simulations showed stress in the alternative core design comparable and higher to that of the standard configuration, respectively. Such a mechanical scenario probably led to the higher reliability of the alternative design under fatigue.

Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Stiffly accurate Runge-Kutta methods for stiff stochastic differential equations

In this paper we discuss implicit methods based on stiffly accurate Runge-Kutta methods and splitting techniques for solving Stratonovich stochastic differential equations (SDEs). Two splitting techniques: the balanced splitting technique and the deterministic splitting technique, are used in this paper. We construct a two-stage implicit Runge-Kutta method with strong order 1.0 which is corrected twice and no update is needed. The stability properties and numerical results show that this approach is suitable for solving stiff SDEs. (C) 2001 Elsevier Science B.V. All rights reserved.

Colourful objects through animal eyes

To understand how bees, birds, and fish may use colour vision for food selection and mate choice, we reconstructed views of biologically important objects taking into account the receptor spectral sensitivities. Reflectance spectra a of flowers, bird plumage, and fish skin were used to calculate receptor quantum catches. The quantum catches were then coded by red, green, and blue of a computer monitor; and powers, birds, and fish were visualized in animal colours. Calculations were performed for different illumination conditions. To simulate colour constancy, we used a von Kries algorithm, i.e., the receptor quantum catches were scaled so that the colour of illumination remained invariant. We show that on land this algorithm compensates reasonably well for changes of object appearance caused by natural changes of illumination, while in water failures of von Kries colour constancy are prominent. (C) 2000 John Wiley & Sons, Inc.

Quantitative analysis of the time courses of enzyme-catalyzed reactions

The catalytic properties of enzymes are usually evaluated by measuring and analyzing reaction rates. However, analyzing the complete time course can be advantageous because it contains additional information about the properties of the enzyme. Moreover, for systems that are not at steady state, the analysis of time courses is the preferred method. One of the major barriers to the wide application of time courses is that it may be computationally more difficult to extract information from these experiments. Here the basic approach to analyzing time courses is described, together with some examples of the essential computer code to implement these analyses. A general method that can be applied to both steady state and non-steady-state systems is recommended. (C) 2001 academic Press.

Stochastic gauges in quantum dynamics for many-body simulations

Quantum dynamics simulations can be improved using novel quasiprobability distributions based on non-orthogonal Hermitian kernel operators. This introduces arbitrary functions (gauges) into the stochastic equations. which can be used to tailor them for improved calculations. A possible application to full quantum dynamic simulations of BEC's is presented. (C) 2001 Elsevier Science B.V. All rights reserved.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.