Current air quality analytics and monitoring: A review

This review summarizes the different tools and concepts that are commonly applied in air quality monitoring. The monitoring of atmosphere is extremely important as the air quality is an important problem for large communities. Main requirements for analytical devices used for monitoring include a long period of autonomic operation and portability. These instruments, however, are often characterized by poor analytical performance. Monitoring networks are the most common tools used for monitoring, so large-scale monitoring programmes are summarized here. Biomonitoring, as a cheap and convenient alternative to traditional sample collection, is becoming more and more popular, although its main drawback is the lack of standard procedures. Telemonitoring is another approach to air monitoring, which offers some interesting opportunities, such as ease of coverage of large or remote areas, constituting a complementary approach to traditional strategies; however, it requires huge costs.     

80.5 MeV/u碳离子诱发铜靶的放射性剩余产物测量

高能重带电粒子能直接穿透靶原子核外电子层,与原子核发生直接碰撞,发生散裂反应,产生一系列具有放射性的剩余产物核.重带电粒子诱发靶材放射性剩余核与辐射防护和人员安全有着密切联系,当前,大部分剩余核产额主要依靠蒙特卡罗粒子输运程序进行模拟计算,其准确程度亟需通过实验测量进行准确评估.本文利用能量为80.5 MeV/u的(12)^C⁶⁺粒子对薄铜靶开展了辐照实验与伽玛射线测量,结合伽玛谱学分析方法,得出了辐照产生的18种放射性剩余产物的初始活度和产生截面值,并与PHITS模拟结果进行对比.结果表明,PHITS模拟程序对放射性剩余核种类的估计具有较高可靠性,在其绝对产额方面,与实验测量仍具有较大偏差.     

Monte Carlo simulation of electric conductivity for pure and doping fullerene (C60)

In this paper, we have used Monte Carlo (MC) method to simulate and study the temperature and doping effects on the electric conductivity of fullerene (C60). The results show that the band gap has reduced by the doping and the charge carrier transport is facilitated from valence band to conduction band by the temperature where is touched a 300 K. In this case, the conductivity reached a value of $4\times {10}^{-7}\text{S}{\text{cm}}^{-1}$. The electric conductivity of C60 can increase by the triphenylmethane dye crystal violet (CV) alkali metal to reach $4\times {10}^{-3}\text{S}{\text{cm}}^{-1}$ at 303 K. Our results of MC simulation have a good agreement with those extracted from literature [10], [33].     

可变抽样区间的非参数控制图

最近几年一些学者研究了可变抽样区间的质量控制图。Amin等提出了可变抽样区间(VSI)的非参数控制图———符号 (Sign)统计量图〔1〕。本文在此基础上研究位置VSI符号控制图的制定方法 ,并设计离散VSI符号控制图。符号控制图的优点是对非正态总体亦可应用 ,并且不需要过程方差的信息。本文将所设计的VSI符号控制图同固定抽样区间 (FSI)的常规图作比较 ,并举实例说明符号控制图的应用     

Monte Carlo study of interfacial silicon suboxide layers and oxidation kinetics

A simple simulation scheme that simultaneously describes the growth kinetics of SiO₂ films at the nanometer scale and the SiO_x/Si interface dynamics (its extent, and spatial/temporal evolution) is presented. The simulation successfully applies to experimental data in the region above and below 10 nm, reproduces the Deal and Grove linear-parabolic law and the oxide growth rate enhancement in the very thin film regime (the so-called anomalous region). According to the simulation, the oxidation is governed mainly by two processes: (a) the formation of a transition suboxide layer and (b) its subsequent drift towards the silicon bulk. We found that it is the superposition of these two processes that produces the crossover from the anomalous oxidation region behavior to the linear-parabolic law.     

Non-universal critical behaviour of heteronuclear dimers on a square lattice––A Monte Carlo study

Monte Carlo simulation within the grand canonical ensemble, the histogram reweighting technique, and finite size scaling analysis are used to explore the phase behaviour of heteronuclear dimers, composed of A and B type atoms, on a square lattice. We have found that for the models with attractive BB and AB nearest-neighbour energy, u_BB=u_AB=−1, and for non-repulsive energy between AA nearest-neighbour sites, u_AA<0, the system belongs to the universality class of the two-dimensional Ising model. However, when u_AA>0, the system exhibits a non-universal critical behaviour. We have evaluated the dependences of the critical point characteristics on the value of u_AA.     

Approximation of photonuclear interaction cross-sections

Photonuclear interaction cross-sections from the GEANT4 database are approximated for all nuclei and all energies (from the hadron production threshold to about 40 TeV). The approximation methods in the giant-dipole resonance region, nucleon resonance region, and high-energy region are improved with respect to existing approximations. As an application of the approximation for photonuclear cross-sections, an improved method of calculating electronuclear cross-sections is developed. The interaction cross-section of virtual photons with nuclei at high Q² are approximated and a simple algorithm for describing the electronuclear reactions, including high-Q² scattering, is proposed. Received: 22 February 2002 / Accepted: 6 May 2002     

Extremes of deterministic sub‐sampled moving averages with heavy‐tailed innovations

Let {X_k}_k?1 be a strictly stationary time series. For a strictly increasing sampling function g:?→? define Y_k=X_g(k) as the deterministic sub‐sampled time series. In this paper, the extreme value theory of {Y_k} is studied when X_k has representation as a moving average driven by heavy‐tailed innovations. Under mild conditions, convergence results for a sequence of point processes based on {Y_k} are proved and extremal properties of the deterministic sub‐sampled time series are derived. In particular, we obtain the limiting distribution of the maximum and the corresponding extremal index. Copyright © 2003 John Wiley & Sons, Ltd.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Order restricted randomized designs for control versus treatment comparison

We develop a method of randomizing units to treatments that relies on subjective judgement or on possible coarse modeling to produce restrictions on the randomization. The procedure thus fits within the general framework of ranked set sampling. However, instead of selecting a single unit from each set for full measurement, all units within a set are used. The units within a set are assigned to different treatments. Such an assignment translates the positive dependence among units within a set into a reduction in variation of contrasting features of the treatments. A test for treatment versus control comparison, with controlled familywise error rate, is developed along with the associated confidence intervals. The new procedure is shown to be superior to corresponding procedures based on completely randomized or ranked set sample designs. The superiority appears both in asymptotic relative efficiency and in power for finite sample sizes. Importantly, this test does not rely on perfect rankings; rather, the information in the data on the quality of rankings is exploited to maintain the level of the test when rankings are imperfect. The asymptotic relative efficiency of the test is not affected by estimation of the quality of rankings, and the finite sample performance is only mildly affected.