FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

A small GTP-binding protein dissociates from synaptic vesicles during exocytosis.

Low-molecular-weight GTP-binding proteins are strong candidates for regulators of membrane traffic. In yeast, mutations in the sec4 or ypt1 genes encoding small GTP-binding proteins inhibit constitutive membrane flow at the plasma membrane or Golgi complex, respectively. It has been suggested that membrane fusion-fission events are regulated by cycling of small GTP-binding proteins between a membrane-bound and free state, but although most of these small proteins are found in both soluble and tightly membrane-bound forms, there is no direct evidence to support such cycling. In rat brain a small GTP-binding protein, rab3A, is exclusively associated with synaptic vesicles, the secretory organelles of nerve terminals. Here we use isolated nerve terminals to study the fate of rab3A during synaptic vesicle exocytosis. We find that rab3A dissociates quantitatively from the vesicle membrane after Ca2(+)-dependent exocytosis and that this dissociation is partially reversible during recovery after stimulation. These results are direct evidence for an association-dissociation cycle of a small GTP-binding protein during traffic of its host membrane.     

The Huntington's disease candidate region exhibits many different haplotypes.

Analysis of 78 Huntington's disease (HD) chromosomes with multi-allele markers revealed 26 different haplotypes, suggesting a variety of independent HD mutations. The most frequent haplotype, accounting for about one third of disease chromosomes, suggests that the disease gene is between D4S182 and D4S180. However, the paucity of an expected class of chromosomes that can be related to this major haplotype by assuming single crossovers may reflect the operation of other mechanisms in creating haplotype diversity. Some of these mechanisms sustain alternative scenarios that do not require a multiple mutational origin for HD and/or its positioning between D4S182 and D4S180.     

Structure of the detoxification catalyst mercuric ion reductase from Bacillus sp. strain RC607

Several hundred million tons of toxic mercurials are dispersed in the biosphere. Microbes can detoxify organo-mercurials and mercury salts through sequential action of two enzymes, organomercury lyase and mercuric ion reductase (MerA). The latter, a homodimer with homology to the FAD-dependent disulphide oxidoreductases, catalyses the reaction NADPH + Hg(II)----NADP+ + H+ + Hg(0), one of the very rare enzymic reactions with metal substrates. Human glutathione reductase serves as a reference molecule for FAD-dependent disulphide reductases and between its primary structure and that of MerA from Tn501 (Pseudomonas), Tn21 (Shigella), p1258 (Staphylococcus) and Bacillus, 25-30% of the residues have been conserved. All MerAs have a C-terminal extension about 15 residues long but have very varied N termini. Although the enzyme from Streptomyces lividans has no addition, from Pseudomonas aeruginosa Tn501 and Bacillus sp. strain RC607 it has one and two copies respectively of a domain of 80-85 residues, highly homologous to MerP, the periplasmic component of proteins encoded by the mer operon. These domains can be proteolytically cleaved off without changing the catalytic efficiency. We report here the crystal structure of MerA from the Gram-positive bacterium Bacillus sp. strain RC607. Analysis of its complexes with nicotinamide dinucleotide substrates and the inhibitor Cd(II) reveals how limited structural changes enable an enzyme to accept as substrate what used to be a dangerous inhibitor. Knowledge of the mode of mercury ligation is a prerequisite for understanding this unique detoxification mechanism.     

Genotoxic effects of dithane M-45 on the bone marrow cells of mice in vivo

Genotoxic effects of dithane M-45 were studied on the bone marrow cells of male albino mice (Lacca strain) in vivo. Different doses (30 mg, 40 mg and 300 mg/kg b.wt) of dithane M-45 were injected intraperitoneally and their effects were investigated after time intervals of 1, 2, 5 and 10 days. The chromosomal aberrations observed in the bone marrow cells of male mice after treatment with dithane M-45 were fragments, rings, dicentric chromosomes, terminal chromatid deletions, chromatid gaps and breaks. In addition to these chromosomal aberrations, physiological effects such as uneven stretching of chromatin material, end-to-end chromosomal associations, exchange configurations, clumping, stickiness and centromeric associations were also observed.     

PEAK COVARIANCE STABILITY OF A RANDOM RICCATI EQUATION ARISING FROM KALMAN FILTERING WITH OBSERVATION LOSSES

We consider the stability of a random Riccati equation with a Markovian binary jump coefficient. More specifically, we are concerned with the boundedness of the solution of a random Riccati difference equation arising from Kalman filtering with measurement losses. A sufficient condition for the peak covariance stability is obtained which has a simpler form and is shown to be less conservative in some cases than a very recent result in existing literature. Furthermore, we show that a known sufficient condition is also necessary when the observability index equals one.     

CONSTRUCTIVE KISSING NUMBERS IN HIGH-DIMENSIONAL SPACES

In the present paper, we focus on constructive spherical codes. By employing algebraic geometry codes, we give an explicit construction of spherical code sequences. By making use of the idea involved in the proof of the Gilbert-Varshamov bound in coding theory, we construct a spherical code sequence in exponential time which meets the best-known asymptotic bound by Shamsiev and Wyner.