Characteristics of black carbon aerosol in Jiaxing,China during autumn 2013

We conducted measurements of black carbon（BC） aerosol in Jiaxing,China during autumn from September 26 to November 30,2013.We investigated temporal and diurnal variations of BC,and its correlations with meteorological parameters and other major pollutants.Results showed that hourly mass concentrations of BC ranged from 0.2 to 22.0 μg/m³,with an average of 5.1 μg/m³.The diurnai variation of BC exhibited a bimodal distribution,with peaks at 07:00 and 18:00.The morning peak was larger than the evening peak.The mass percentages of BC in PM_2.5 and PM₁₀ were 7.1%and 4.8%,respectively.The absorption coefficient of BC was calculated to be 44.4 Mm^-1,which accounted for 11.1%of the total aerosol extinction.BC was mainly emitted from local sources in southwestern Jiaxing where BC concentrations were generally greater than 11 μg/m³ during the measurement period.Correlation analysis indicated that the main sources of BC were motor vehicle exhaust,and domestic and industrial combustion.     

A New Approach to Develop a Standardized Method for Simultaneous Analysis of Astragaloside IV and Formononetin in Radix Astragali by High-Performance Thin-Layer Chromatography

JPC – Journal of Planar Chromatography – Modern TLC - A new high-performance thin-layer chromatographic (HPTLC) method has been developed for the simultaneous estimation of...     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.