Derivation of fluorine-containing pyridine dicarboxylates. II. Elaboration at the 4-position

In response to the bio-activity found in fluorine-containing 4-alkyl-3, 5-pyridinedicarboxylates, a series of novel 4-substituted derivatives, not directly available by Hantzsch sequences, were prepared. Starting 4-alkylpyridines, 1 , were converted via enamine 2 to materials 3–8 . Derivatives 9–16 in turn were derived from aldehyde 3 , while acid derivatives 28–36 were prepared from 14 . Addition of oxygen, sulfur, and carbenoids effected conversion of 4-allylpyridine 16 to epoxy and cyclopropyl derivative 16–22 . A number of neighboring group effects were noted, including those forming the fused-ring systems 23-27 .     

On the heterogeneity of125I-labelled proteins used as tracers in radioimmunoassay

The distribution of mono- poly- and unlabelled protein molecules in the radiolabelling mixture was calculated from probability point of view as a function of the radioiodine/protein ratio.     

Analysis and prediction of primary structures of proteins using a computer

On the basis of a computer analysis of four classes of toxic polypeptides, generalized primary structures of each class have been obtained which can be used for planning the synthesis of biologically active compounds.     

Quantitative Bestimmungen mittels cyclischer Voltammetrie an der Phasengrenze zweier mischbarer Elektrolytl?sungen

Summary This paper presents some applications of cyclic voltammetry at the interface of two immiscible electrolyte solutions by means of an experimental set-up described in a former publication. When using special sample preparation good results are obtained for the determination of iodide and quinine in pharmaceutical products as well as for the determination of quinine in tonic water and dodecylsulfate in a tooth-salt.

---

---

Herrn Prof. Dr. Günther Tölg zum 60. Geburtstag gewidmet     

The auction algorithm for the transportation problem

The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.