A closed model category for ()-connected spaces

For each integer , we give a distinct closed model category structure to the category of pointed spaces such that the corresponding localized category is equivalent to the standard homotopy category of -connected CW-complexes. The structure of closed model category given by Quillen to is based on maps which induce isomorphisms on all homotopy group functors and for any choice of base point. For each , the closed model category structure given here takes as weak equivalences those maps that for the given base point induce isomorphisms on for .

     

Large volume sample application by a simplified “closed” on-column injector in capillary gas chromatography

Summary A new simplified version of a closed on-column injector is introduced. Because of its design isobaric injection conditions do not have to be followed and a wide range of injection temperatures above the boiling point of the sample solvent can be chosen for on-column injections in capillary gas chromatography. Also, when following certain basic injection rules, injections of large sample volumes (20 l or more) give accurate and reproducible results without further problems.Presented at the 17th International Symposium on Chromatography, September 25–30, 1988, Vienna, Austria.     

An analysis of the complex molecular orbitals method

Numerical results for the ground state of the HN ₂ ⁺ and HCO⁺ molecular ions at their near equilibrium geometry, obtained by the complex molecular orbitals (CMO) method in the extended basis set, are reported. The CMO wavefunction of the HN ₂ ⁺ ion is compared with the CI wavefunction obtained in the same basis set. This reveals the nature of approximations inherent in the CMO method. A peculiar feature of the occupation numbers of the CMO natural orbitals is also explained.Alexander von Humboldt Fellow. On leave from the Institute Rudjer Bokovi, Zagreb, Croatia, Yugoslavia.     

Oral malodor,assessed by closed-loop,gas chromatography,and ion-trap technology

A method is described for the analysis of volatile organic compounds in saliva and tongue coating samples. The techniue is based on an off-line preconcentration step by means of a closed-loop trapping system followed by gas chromatography-ion trap detection. With the closed-loop technique, the volatile organic compounds(VOCs) are released from the matrix and trapped on an adsorbent without interference of water. The VOCs are released from the adsorbent into the gas chromatograph by thermdesorption. After separation, identification of the compounds is performed by ion trap technology. By this technique 82 compounds could be demonstrated in saliva and tongue coating samples. The technique is also used to demonstrate the formation of volatile bacterial fermentation compounds when a protein substrate is added to tongue coating samples. It is considered a very promising tool in further research on oral malodor.     

Analytical Aspects of Photoelectron Spectroscopy

Photoelectron spectroscopy is a new technique for experimentally measuring the binding energies of electrons in molecules. The basic principles of the method are outlined and simple guidelines for the interpretation of u.v.-excited photoelectron spectra are laid down. The analytical potential and possible development of the method are briefly surveyed.     

A simplified adaptive Cartesian grid system for solving the 2D shallow water equations

This paper presents a new simplified grid system that provides local refinement and dynamic adaptation for solving the 2D shallow water equations (SWEs). Local refinement is realized by simply specifying different subdivision levels to the cells on a background uniform coarse grid that covers the computational domain. On such a non‐uniform grid, the structured property of a regular Cartesian mesh is maintained and neighbor information is determined by simple algebraic relationships, i.e. data structure becomes unnecessary. Dynamic grid adaptation is achieved by changing the subdivision level of a background cell. Therefore, grid generation and adaptation is greatly simplified and straightforward to implement. The new adaptive grid‐based SWE solver is tested by applying it to simulate three idealized test cases and promising results are obtained. The new grid system offers a simplified alternative to the existing approaches for providing adaptive mesh refinement in computational fluid dynamics. Copyright © 2011 John Wiley & Sons, Ltd.     

A three‐dimensional Cartesian cut cell method for incompressible viscous flow with irregular domains

A three‐dimensional Cartesion cut cell method is presented for the simulations of incompressible viscous flows with irregular domains. A new model (referred to as ‘6+N’ model) is proposed to describe arbitrarily shaped cut cells and treat all the cells as polyhedrons with 6+N faces. The finite volume discretization of the Navier–Stokes equation is then implemented by using the ‘6+N’ model to separate the surface flux integrals into two parts, that is, the fluxes through the basic face of the hexahedron and those through the cutting surfaces. The previously proposed Kitta Cube algorithm and volume computer‐aided design platform (J. Comput. Aided. Des. 2005; 37(4): 1509–1520. Doi:10.1016/j.cad.2005.03.006) are adopted to generate cut cells and provide shape data and physical attributes for the numerical analysis. A modified SIMPLE‐based smoothing pressure correction scheme is applied to suppress checkerboard pressure oscillations caused by the collocated arrangement of velocities and pressure. The calculation accuracy of the numerical method expressed by L₁ and L _∞ norm errors is first demonstrated by the simulation of a pipe flow. Then its feasibility, efficiency, and potential in engineering applications are verified by applying it to solve natural convections between concentric spheres and between eccentric spheres. The heat transfer patterns in eccentric spheres are also obtained by using the numerical method. Copyright © 2011 John Wiley & Sons, Ltd.     

乘积图的Fractional控制

Let G =(V,E) be a simple graph.For any real function g :V-→ R and a subset S V,we write g(S) =∑v∈Sg(v).A function f :V-→ [0,1] is said to be a fractional dominating function(F DF) of G if f(N [v]) ≥ 1 holds for every vertex v ∈ V(G).The fractional domination number γf(G) of G is defined as γf(G) = min{f(V)|f is an F DF of G }.The fractional total dominating function f is defined just as the fractional dominating function,the difference being that f(N(v)) ≥ 1 instead of f(N [v]) ≥ 1.The fractional total domination number γ0f(G) of G is analogous.In this note we give the exact values ofγf(Cm × Pn) and γ0f(Cm × Pn) for all integers m ≥ 3 and n ≥ 2.