Studies on the exchange characteristics of [Co(NH3)6]3+ in amberlite IRC-50

Summary The exchange of Co(NH₃)₆]³⁺-ions on amberlite IRC-50 resin has been studied at room temperature. For this exchange process the cations are effective in the order: Cs⁺<Rb⁺<K⁺<Na⁺<Li⁺<NH₄ ⁺<Mg²⁺ <Ca²⁺<H⁺ and (C₂H₅)₄N<(CH₃)₄N⁺ ≪Cetyltrimethylammonium-ion <Cetylpyridinium-ion. The logarithm of the selectivity coefficient gives linear graphs when plotted against the radius of the hydrated ions or the reciprocals of theDebye-Hückel parameter?.     

Studies of carbazole-based polyarylates

A low temperature solution condensation method with pyridine as acceptor-catalytic reagent was applied to the synthesis of polyarylates from carbazole and bisphenol A/phenolphthalein. The polyarylates were classified with respect to their structure, thermal stability, and dielectric behavior.     

Radiotracer measurement of the volatilization of organic trace constituents from water

Abstract The mass-transfer coefficient for the volatilization of organic microconstituents from water can be determined by laboratory radiotracer experiments. Formulation and practical aspects are considered and illustrated by the example of a 5.10(-7) M solution of monochlorobenzene.     

Crystal and molecular structure of a new biguanide metal complex, [Cu(AMNH)2]Cl2

The crystal structure of C₆H₁₆N₈O₂·CuCl₂, a biguanide metal complex, has been determined by X-ray diffraction data using MoK radiation. The compound crystallizes in the monoclinic space groupP2₁/a, witha=11.074(4),b=12.061(4),c=5.312(3)Å and=102.8(1)°.The structure was solved by direct methods and refined by full-matrix least-squares to a finalR value 0.037 with 1245 unique reflections. The complex molecule is centrosymmetric, with the Cu atom (0.5,0.5,0.5) on a crystallographic center of symmetry. The complex molecule is rhombic planar with a trans configuration.     

On sparse spanners of weighted graphs

Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882.