Collaborative distributed decision making for large scale disaster relief operations: Drawing analogies from robust natural systems

One of the most ignored, but urgent and vital challenges confronting society today is the vulnerability of urban areas to extreme events. Current organization of response systems, predominantly based on a command and control model, limits their effectiveness and efficiency. Particularly, in decision‐making processes where a large number of actors may be involved. In this article, a new distributed collaborative decision‐making model is proposed to overcome command and control limitations encountered in stressful, hostile, chaotic, and large‐scale settings. This model was derived by borrowing concepts from the collective decision making of honeybees foraging, a successful process in solving complex tasks within complex settings. The model introduced in this article was evaluated through differential equations, i.e., continuous analysis, and difference equations, i.e., discrete analysis. The most important result found is that the best available option in any large‐scale decision‐making problem can be configured as an attractor, in a distributed and timely manner. We suggest that the proposed model has the potential to facilitate decision‐making processes in large‐scale settings. © 2005 Wiley Periodicals, Inc. Complexity 11:28–38, 2005     

Estimating the largest singular values of large sparse matrices via modified moments

We describe a procedure for determining a few of the largest singular values of a large sparse matrix. The method by Golub and Kent which uses the method of modified moments for estimating the eigenvalues of operators used in iterative methods for the solution of linear systems of equations is appropriately modified in order to generate a sequence of bidiagonal matrices whose singular values approximate those of the original sparse matrix. A simple Lanczos recursion is proposed for determining the corresponding left and right singular vectors. The potential asynchronous computation of the bidiagonal matrices using modified moments with the iterations of an adapted Chebyshev semi-iterative (CSI) method is an attractive feature for parallel computers. Comparisons in efficiency and accuracy with an appropriate Lanczos algorithm (with selective re-orthogonalization) are presented on large sparse (rectangular) matrices arising from applications such as information retrieval and seismic reflection tomography. This procedure is essentially motivated by the theory of moments and Gauss quadrature.This author's work was supported by the National Science Foundation under grants NSF CCR-8717492 and CCR-910000N (NCSA), the U.S. Department of Energy under grant DOE DE-FG02-85ER25001, and the Air Force Office of Scientific Research under grant AFOSR-90-0044 while at the University of Illinois at Urbana-Champaign Center for Supercomputing Research and Development.This author's work was supported by the U.S. Army Research Office under grant DAAL03-90-G-0105, and the National Science Foundation under grant NSF DCR-8412314.     

Scaling by Binormalization

We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices.     

Cetyltrimethylammonium hydroxide (CTAOH) as a general, ecofriendly catalyst for the formation of carbon-carbon bond through nitroalkanes

Nitroalkanes have been found to give good yields in Michael and nitroaldol (Henry) reactions by the use of a catalytic amount (10 mol%) of CTAOH, at room temperature and under solvent free conditions and in very short reaction times. The methods do not need a large excess of the nitroalkanes and show good chemoselectivity toward further functionalities.     

Two-step photoionization of Na2: dependence on alignment

Laser light is used for two-step photoionization of Na₂. the first step depends on the moleculer orientation, the second step doesnot. This yields a method for the analysis of molecular alignment.     

A palladium-catalyzed synthetic approach to new Huperzine A analogues modified at the pyridone ring

The synthesis of two new Huperzine A analogues is reported. Both products present an amino substituted benzo-fused system in place of the pyridone ring of the natural alkaloid. The synthetic strategy to the two analogues is based on three different key palladium-catalyzed steps, namely a carbonylation reaction, an epoxide isomerization and a bicycloannulation reaction.     

Hydrogen‐bonded supramolecule of N,N′‐bis(4‐pyridylmethyl)oxalamide and a zigzag chain structure of catena‐poly[[[dichloridocobalt(II)]‐μ‐N,N′‐bis(4‐pyridylmethyl)oxalamide‐κ2N4:N4′] hemihydrate]

N,N′‐Bis(4‐pyridylmethyl)oxalamide, C₁₄H₁₄N₄O₂, exists as a dimer which is extended into a two‐dimensional network with other dimers through pyridine–amide hydrogen bonds. The crystal structure of the title coordination polymer, {[CoCl₂(C₁₄H₁₄N₄O₂)]·0.5H₂O}_n, features a one‐dimensional zigzag chain, in which the cobalt ion sits at a twofold symmetry position and adopts a tetrahedral geometry, and the bridging ligand lies on an inversion center and connects to Co^II ions in a bis‐monodentate mode. Furthermore, two interwoven chains create a cavity of ca 8.6 × 8.6 Å, which produces a three‐dimensional channel. Water molecules are held in the channel by hydrogen bonds.     

Substituent control of hydrogen bonding in palladium(II)-pyrazole complexes

Inter- and intramolecular hydrogen bonding of an N-H group in pyrazole complexes was studied using ligands with two different groups at pyrazole C-3 and C-5. At C-5, groups such as methyl, i-propyl, phenyl, or tert-butyl were present. At C-3, side chains L-CH(2)- and L-CH(2)CH(2)- (L = thioether or phosphine) ensured formation of chelates to a cis-dichloropalladium(II) fragment through side-chain atom L and the pyrazole nitrogen closest to the side chain. The significance of the ligands is that by placing a ligating side chain on a ring carbon (C-3), rather than on a ring nitrogen, the ring nitrogen not bound to the metal and its attached proton are available for hydrogen bonding. As desired, seven chelate complexes examined by X-ray diffraction all showed intramolecular hydrogen bonding between the pyrazole N-H and a chloride ligand in the cis position. In addition, however, intermolecular hydrogen bonding could be controlled by the substituent at C-5: complexes with either a methyl at C-5 or no substituent there showed significant intermolecular hydrogen bonding interactions, which were completely avoided by placing a tert-butyl group at C-5. The acidity of two complexes in acetonitrile solutions was estimated to be closer to that of pyridinium ion than those of imidazolium or triethylammonium ions.     

Polycondensed heterocycles. I. Synthesis of 11-oxo-5H, 11H-pyrrolo[2,1-c][1,4]benzothiazepine,Derivative of a novel ring system

The synthesis of the title compound 4 by cyclization of 1-(2-ethoxycarbonylthiobenzyl)pyrrole 9 , prepared by treating with ethyl chloroformate the 1-(2-mercaptobenzyl)pyrrole 7 previously obtained by debenzylation of 1-(2-benzylthiobenzyl)pyrrrole 6 , failed. On the other hand 4 was successfully synthesized by intramolecular cyclization of 1-(2-mercaptobenzyl)pyrrole-2-carboxylic acid 15 by DMAP -catalyzed DCC method. The pyrrole 6 and 1-(2-benzylthiobenzyl)pyrrole-2-carboxaldehyde 11 were useful as starting materials to obtain 1-(2-benzylthiobenzyl)pyrrole-2-carbonitrile 13 , which was hydrolyzed to corresponding amide 16 . Debenzylation of 16 afforded 1-(2-mercaptobenzyl)pyrrole-2-carboxyamide 17 , whose hydrolysis led to required acid 15 .     

A note on the kernel of a locally nilpotent derivation

This note concerns locally nilpotent derivations of the polynomial ring . It is shown that if annihilates a polynomial in two variables, then annihilates a variable.