Microecological regulative principles of human gastrointestinal flora

In the course of coevolution of man and microorganisms the macroorganism must have developed mechanisms which allow a qualitative and quantitative regulation in his microbial colonization. On the several places, microbial growth is limited by various factors. Adherence ability of microorganisms belongs to the special colonization events. An uninhibited colonization begins if regulative factors are omitted. Factors of the host are only partially able to kill the microorganisms. Microbes possess signal receptors managing adaptation to environmental changes. If a strategy of growth and multiplication is not realizable such factors change to a strategy of survival. Very likely, these common microbiological principles are valid to the gastrointestinal tract, too.     

轧染时的直接上染性(第2部分):还原性染料、硫化还原性染料

第1部分介绍了浸轧染色的印花头梢色差和宽度上染色印疵的形成原因.第2部分以实验经验,说明使用水不溶性染料产生的染色问题.     

Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

We carefully study the number of arithmetic operations required to compute rational Puiseux expansions of a bivariate polynomial F over a finite field. Our approach is based on the rational Newton-Puiseux algorithm introduced by D. Duval. In particular, we prove that coefficients of F may be significantly truncated and that certain complexity upper bounds may be expressed in terms of the output size. These preliminary results lead to a more efficient version of the algorithm with a complexity upper bound that improves previously published results. We also deduce consequences for the complexity of the computation of the genus of an algebraic curve defined over a finite field or an algebraic number field. Our results are practical since they are based on well established subalgorithms, such as fast multiplication of univariate polynomials with coefficients in a finite field.     

Compound Node–Kayles on paths

In his celebrated book [J.H. Conway, On Numbers and Games, Academic Press, New-York, 1976, Second edition (2001), A.K. Peters, Wellesley, MA], J.H. Conway introduced twelve versions of compound games. We analyze these twelve versions for the Node–Kayles game on paths. For usual disjunctive compound, Node–Kayles has been solved for a long time under normal play, while it is still unsolved under misère play. We thus focus on the ten remaining versions, leaving only one of them unsolved.     

Functional display of active bovine adrenodoxin on the surface of E. coli by chemical incorporation of the [2Fe-2S] cluster

The display of heterologous proteins on the surface of living cells bears promising options for a wide variety of biotechnological applications. Up to now, however, cellular surface display was merely restricted to simple polypeptide chains. Here we present for the first time the efficient display of a protein (bovine adrenodoxin) that contains an inorganic, prosthetic group in its active form on the surface of Escherichia coli. For this purpose apo-adrenodoxin was transported to the cell surface and anchored within the outer membrane by the autotransporter pathway. Incorporation of the iron-sulfur cluster was achieved by a single-vial, one-step titration under anaerobic conditions. The biological function of surface-displayed holo-adrenodoxin could be established through adrenodoxin-dependent steroid conversion by two different cytochrome P450 enzymes and the number of functional molecules on the cell surface could be determined to be more than 10(5) per cell. Neither the expression of adrenodoxin nor the incorporation of the chemical iron-sulfur cluster reduced the viability of the bacterial cells.     

Three-stage hybrid-flowshop model for cross-docking

This paper deals with the optimization of a cross-docking system. It is modeled as a three-stage hybrid flowshop, in which shipments and orders are represented as batches. The first stage corresponds to the receiving docks, the second stage corresponds to the sorting stations, and the third stage corresponds to the shipping docks. The objective of the problem is to find a schedule that minimizes the completion time of the latest batch. In order to obtain good quality feasible solutions, we have developed several heuristic schemes depending on the main stage considered, and several rules to order the batches in this stage. Then, we propose a branch-and-bound algorithm that takes into account the decomposition of the problem into three stages. To evaluate the heuristics and to reduce the tree size during the branch-and-bound computation, we also propose lower bounds. Finally, the computational experiments are presented to demonstrate the efficiency of our heuristics. The results show that the exact approach can solve instances containing up to 9–10 batches in each stage (i.e., up to 100 jobs). In addition, our heuristics were evaluated over instances with up to 3000 jobs, and they can provide good quality feasible solutions in a few seconds (i.e., less than 2 s per heuristic).