Attomole protein analysis by CIEF with LIF detection

We have coupled CIEF with an LIF detector that is based on a post‐column sheath flow cuvette. We employed Chromeo P503 as a fluorogenic reagent to label proteins before analysis. This reagent reacts with the ε‐amine of lysine residues, preserving the cationic nature of the residue; labeled proteins generate extremely sharp peaks in CIEF. A set of four standard proteins generated a linear relationship between migration time and pI. A protein homogenate prepared from a Barrett's esophagus cell line resolved over 100 components in a 40 min separation. Detection limits for Chromeo P503‐labeled β‐lactoglobulin were 5 amol injected into the capillary. Fluorescent impurities present in the ampholytes generated a large background signal that degraded the detection limit by four orders of magnitude compared with other forms of capillary electrophoresis with this detector.     

Bestimmung des Schwefels in organischen Verbindungen

Ohne Zusammenfassung     

Kupfer

Ohne Zusammenfassung     

Prioritizing edge over node: process control in supply chain networks and push-pull strategies

We outline recent work identifying an equilibrium solution in a supply chain network. The solution overcomes some difficulties associated with the bullwhip effect through limited cooperation and coordination along edges (links) in the supply chain network. The links constitute the stochastic modelling entities rather than the nodes of the network. We outline a range of feedback mechanisms that monitor and restore equilibrium in a supply chain. One of these is prediction capability charts which monitor the process. These charts are used by the decision makers to profile the allocation of inventory in the supply chain and identify out of control conditions. They maintain quality within the network, as well as intelligently track the way the network evolves in conditions of changing variability. We illustrate with an example simulating a push strategy in the clothing industry.     

Exploiting planarity in separation routines for the symmetric traveling salesman problem

At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cut is due in large part to the availability of effective separation procedures; that is, routines for identifying violated linear constraints.

For two particular classes of constraints, known as comb and domino-parity constraints, it has been shown that separation becomes easier when the underlying graph is planar. We continue this line of research by showing how to exploit planarity in the separation of three other classes of constraints: subtour elimination, 2-matching and simple domino-parity constraints.     

Polyether antibiotic CP44,161

The crystal structure of antibiotic CP44,161, 6-(7-{2-ethyl-2-[5-(1-hydroxy­methyl)-5-methyl-2,3,4,5-tetra­hydro-2-furyl]-4,10,-­12-tri­methyl-1,6,8-trioxadi­spiro­[4.1.5.3]­pentadec-13-en-9-yl}-4-hydroxy-3,5-di­methyl-6-oxononyl)-2-hydroxy-3-methyl­benzoic acid monohydrate, C₄₃H₆₆O₁₀·H₂O, has been determined by X-ray crystallography. The mol­ecule adopts a cyclic conformation, with a centrally located water mol­ecule contributing to the stability of the conformation through hydrogen-bonding interactions.     

Minimal surfaces over stars

A JS surface is a minimal graph over a polygonal domain that becomes infinite in magnitude at the domain boundary. Jenkins and Serrin characterized the existence of these minimal graphs in terms of the signs of the boundary values and the side-lengths of the polygon. For a convex polygon, there can be essentially only one JS surface, but a non-convex domain may admit several distinct JS surfaces. We consider two families of JS surfaces corresponding to different boundary values, namely JS₀ and JS₁, over domains in the form of regular stars. We give parameterizations for these surfaces as lifts of harmonic maps, and observe that all previously constructed JS surfaces have been of type JS₀. We give an example of a JS₁ surface that is a new complete embedded minimal surface generalizing Scherk's doubly periodic surface, and show also that the JS₀ surface over a regular convex 2n-gon is the limit of JS₁ surfaces over non-convex stars. Finally we consider the construction of other JS surfaces over stars that belong neither to JS₀ nor to JS₁.