Representations by Contact and Intersection of Segments

A necessary and sufficient condition is given for a connected bipartite graph to be the incidence graph of a contact family of segments and points. We deduce that any four-connected three-colorable plane graph is the contact graph of a family of segments and that any four-colored planar graph without an induced C₄ using four colors is the intersection graph of a family of straight line segments.     

Engineering Model of a Nonisobaric Heavily Laden Gas‐Particle Jet

An axisymmetrical model of a rapid nonisobaric heavily laden gas‐particle jet is developed. The model is based on the general functions for both axial and radial pressure distributions, which were discovered by a numerical study of rapid gas‐particle jets by the CFD code. The model equations were solved analytically. The results obtained by the model developed are in good agreement with those computed by the CFD code for a wide range of flow parameters.     

Outbreak of trichinosis in France associated with eating horse meat

The investigation of a trichinosis outbreak in Auvergne, France identified 23 cases in 12 households living in two cities-Clermont-Ferrand and Montlu?on-between 15 February and 7 March 1991. One patient required intensive care, 15 had major symptoms, and seven had minor or no symptoms. Two case control studies demonstrated a significant (p < 0.01) association between eating horse meat and acute trichinosis. Veterinary services found that three supermarkets where the patients had bought horse meat during the suspected period had been supplied by a single wholesaler. The analysis of the wholesaler's records revealed that the implicated horse meat had been imported from a slaughterhouse in the United States. This outbreak occurred despite a requirement in France for all meat from horses slaughtered in France and in countries exporting meat to France to be examined systematically for trichinella.     

Rapid, sensitive procedure to determine buspirone levels in rat brains using gas chromatography with nitrogen-phosphorus detection

Reported here is a rapid, sensitive and relatively inexpensive procedure using gas chromatography with nitrogen-phosphorus detection (GC-NPD) to quantify buspirone levels in brains of rats. The analyte was directly extracted from brain homogenate with toluene after basification and then subjected to GC-NPD analysis using a capillary column. The calibration curves were linear over the range of 10 to 320 ng per 2 ml of brain homogenate, with typical r2 values >0.99. The assay was highly reproducible and gave peaks with excellent chromatographic properties.     

Environmental Control Symposium

MAN is but a part of the universe; his capabilities make him a significant link, in the cycle of life. To ensure this life, man must live in harmony with his environment. Recently, a disharmony has been discovered which could have grave effects upon the existence of man. It appears that man in his great thrust forward is destroying his own environment. The gravity of this threat to man's own existence carries some intrinsic problems of its own: man must allow his reason rather than his emotion to take command.     

An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function

The Lovász ?-function (Lovász in IEEE Trans. Inf. Theory, 25:1–7, 1979) of a graph G=(V,E) can be defined as the maximum of the sum of the entries of a positive semidefinite matrix X, whose trace Tr(X) equals 1, and X _ij =0 whenever {i,j}∈E. This function appears as a subroutine for many algorithms for graph problems such as maximum independent set and maximum clique. We apply Arora and Kale’s primal-dual method for SDP to design an algorithm to approximate the ?-function within an additive error of δ>0, which runs in time $O(\frac{\vartheta ^{2} n^{2}}{\delta^{2}} \log n \cdot M_{e})$ , where ?=?(G) and M _e =O(n ³) is the time for a matrix exponentiation operation. It follows that for perfect graphs G, our primal-dual method computes ?(G) exactly in time O(? ² n ⁵logn). Moreover, our techniques generalize to the weighted Lovász ?-function, and both the maximum independent set weight and the maximum clique weight for vertex weighted perfect graphs can be approximated within a factor of (1+?) in time O(? ^?2 n ⁵logn).