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.     

Asymmetry in the Multiprotein Systems of Molecular Biology

Signaling in living systems needs to achieve high specificity, to be reversible, and to achieve high signal to noise. Signaling mediated by multiprotein systems has evolved that avoids the requirement for high-affinity binary complexes that would be difficult to reverse and which, in the overcrowded cell, would lead to excessive noise in the system. Symmetrical structures are only occasionally formed. When they are, it is principally to colocate components, for example, the tyrosyl kinases of growth factors, where dimers form. Symmetry is, however, often broken, presumably to create more sensitivity and specificity in the signaling system by assembling other components, into higher-order multiprotein systems. The binding of a single heparin to two 1:1 FGF:FGFR complexes is an example, as is the binding of a single ligase to the Xrcc4 dimer, perhaps so creating a further DNA-binding site.     

The Residually Weakly Primitive Geometries of M 22

We announce the classification of all firm and residually connected geometries satisfying the conditions (I P)₂ and (2T)₁ and on which the Mathieu group M ₂₂ acts flag-transitively and residually weakly primitively. The complete list of geometries is available as a supplement to this note [6].     

Constructions of rank five geometries for the Mathieu group M 22

We construct nine rank five incidence geometries that are firm and residually connected and on which the Mathieu group M²² acts flag-transitively. The constructions use mainly objects arising from the Steiner systemS(3, 6, 22). One of these geometries was constructed by Meixner and Pasini in [10]. Three of them are obtained from the geometry of Meixner and Pasini using doubling (see [8] or [12]) or similar constructions. The remaining five are new and four of them have a star diagram. These latter four geometries are constructed using special partitions of the 22 points of the Steiner system S(3, 6, 22).     

Delphinidin–Aluminum(III) Complexes in Aqueous and Non-Aqueous Media: Spectroscopic Characterization and Theoretical Study

Summary. The study of delphinidin complexation with trivalent aluminum in acidic aqueous buffered (pH 3.0 and 3.8) and methanolic solutions was performed utilizing electronic absorption spectroscopy and quantum chemical calculations. In its structure delphinidin possesses several chelating sites in competition towards aluminum(III). Molar ratio plots denoted the formation of only one aluminum(III):delphinidin complex of stoichiometry of 1:1 in both investigated media. Semiempirical calculations, performed at the restricted HF AM1 level, enabled the determination of the structural features of free delphinidin and structural modifications caused by chelation of aluminum(III). Considering the pigment molecular structure and the results of the theoretical calculations it is possible to equally implicate C3′–C4′ and C4′–C5′ hydroxyl groups as those with the predominant chelating power.     

Electrochemical grafting by reduction of 4-aminoethylbenzenediazonium salt: Application to the immobilization of (bio)molecules

We propose in this study a simple and rapid way to produce stable amino-derivatized conductive surfaces for the subsequent immobilization of (bio)molecules. This was achieved through the use of (4-aminoethyl)benzenediazonium salt (AEBD), which was immobilized on glassy carbon and gold electrodes by its electrochemical reduction. The presence of terminal grafted amino functions was evidenced with XPS by analyzing N1s core level. Besides this conventional surface characterisation, an electrochemical strategy is proposed here to evidence the presence of immobilized amines, in which the chemical reactivity of amines towards 2,4,6-trinitrobenzenesulfonic acid (TNBS) is used. Surface-bound TNBS served as an electrochemical marker and was detected by cyclic voltammetry. Additionally, pre-modified gold electrodes with amino functions can be derivatized with biomolecules such as glutathione (GSH). Glutathione attachment was evidenced by studying the electrochemical behaviour of ferri/ferrocyanide redox before and after its immobilization. The functionalized electrodes were then used for the detection of copper ions in neutral aqueous solutions.     

Interplay between Auger and ionization processes in nanocrystal quantum dots

We study the interplay between Auger effects and ionization processes in the limit of strong electronic confinement in core/shell CdSe/ZnS semiconductor nanocrystal quantum dots. Spectrally resolved fluorescence decay measurements reveal a monotonic increase of the photoluminescence decay rate on excitation density. Our results suggest that Auger recombination accelerates ionization processes that lead to the occupation of dark, nonemissive nanocrystal states. A model is proposed in the quantized Auger regime describing these experimental observations and providing an estimate of the Auger assisted ionization rates.     

Avoiding linear dependencies in LFSR test pattern generators

Linear Feedback Shift Registers (LFSRs) constitute a very efficient mechanism for generating pseudoexhaustive or pseudo-random test sets for the built-in self-testing of digital circuits. However, a well-known problem with the use of LFSRs is the occurrence of linear dependencies in the generated patterns. In this paper, we show for the first time that the amount of linear dependencies can be controlled by selecting appropriate characteristic polynomials and reordering the LFSR cells. We identify two classes of such polynomials which, by appropriate LFSR cell ordering, guarantee that a large ratio of linear dependencies cannot occur. Experimental results show significant enhancements on the fault coverage for pseudo-random testing and support the theoretical relation between minimization of linear dependencies and effective fault coverage.This work was partially supported by NSF grant MIP-9409905, a 1993–94 ACM/IEEE Design Automation Scholarship and a grant from Nissan Corporation. A preliminary version of this work appeared in A Class of Good Characteristic Polynomials for LFSR Test Pattern Generators, in Proc. of IEEE International Conference on Computer Design, Oct. 1994, pp. 292–295, where it received the ICCD'94 Best Paper Award.