花丝内插物强化竖直管内凝结换热的实验研究

1前言大空隙率多孔体管内插物-绕花丝内插物，被认为是强化管内凝结换热的最有效途径之一[1]．但以往的研究，由于实验雷诺数范围较小，蒸汽速度较低，要正确全面评价其性能尚显不够。本文在原有工作的基础上，进一步完善了实验系统，改进了测试手段，扩大了实验雷诺数范围，并测试了其阻力性能，对花丝内插物强化管内凝结换热进行了较深入全面的实验研究，以全面评价花丝内插物对管内凝结换热的强化效果。2实验系统本文实验系统如图1所示。实验段是一个竖直套管冷凝器，如图2所示．本试验研究蒸汽完全凝结时的传热。凝结水流量采用容积法计…     

Marginal electron density and density-difference functions

Summary For visual analysis of the density reorganization and distortion, the one-dimensional cut (x, y ₀,z ₀) and the two-dimensional cut (x, y, z ₀) of the three-dimensional electron density difference function (x, y, z) are frequently employed. However, these cut functions do not satisfy any sum rules in contrast to the original difference function (x, y, z). To avoid this difficulty, the use of the marginal electron density functions _x (x) and _xy (x, y) and their difference functions _x (x) and _xy (x, y) is proposed. The marginal densities are condensation of the three-dimensional density onto a particular plane or line of our interest, and they satisfy the sum rule (i.e., the conservation of the number of electrons) exactly. Some basic properties of the marginal electron density are clarified for typical diatomic molecular orbitals. An illustrative application is given for the bonding and antibonding processes in the H₂ system.     

Effect of atmospheric parameters on fine particulate concentration in suburban Shanghai

A study was conducted on the effect of atmospheric parameters,including temperature,wind speed,and relative humidity,on fine particulate mass concentrations measured in Jiading District of Shanghai,China, during the period from January 2009 to January 2010.A sensitivity analysis was applied to investigate the interaction between atmospheric parameters and particulate mass concentration.The experiment revealed that the concentration of particulates increased with particle size from 0.1 to 1.0μm,and decreased with the increase of particle size from 1.0 to 2.5μm.The effects of atmospheric parameters on fine mass concentrations were significantly particle size-dependent.The PM_1.0-2.5 may come from the size increase of smaller particulates after moisture absorption.And the variation of concentrations of PM_0.1-1.0 was mainly attributed to the accumulation of PM_0.1.The ventilation index and dilution index were calculated on the basis of data collected in December 2009.A correlation analysis indicated that there was a significant relation between these two indexes and the particulate concentration by examining the three particle size ranges,0.0-0.1,0.1-1.0,and 1.0-2.5μm.The Spearman correlation coefficients that related the ventilation index to the concentration for the three particle size ranges were -0.45,-0.56 and -0.47, respectively,while the coefficients that related the dilution index to the concentration were -0.36,-0.42 and -0.45,respectively.     

Marginal filtering in large state spaces

Recognising everyday activities including information about the context requires to handle large state spaces. The usage of wearable sensors like six degree of freedom accelerometers increases complexity even more. Common approaches are unable to maintain an accurate belief state within such complex domains. We show how marginal filtering can overcome limitations of standard particle filtering and efficiently infer the context of actions. Symbolic models of human behaviour are used to recognise activities in two different settings with different state space sizes. Based on these scenarios we compare the marginal filter to the standard particle filter. An evaluation shows that the marginal filter performs comparably in small state spaces but outperforms the particle filter in large state spaces.     

Resource augmentation for online bounded space bin packing

We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1.We present a complete solution to this problem: For every bin size b1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ρ(b). Moreover, we prove that no online bounded space algorithm can perform better than ρ(b) in the worst case.     

On a Problem of Karpilovsky

Let G be a finite elementary group. Let ⁿ (G) denote the nth power of the augmentation ideal (G) of the integral group ring G. In this paper, we give an explicit basis of the quotient group Q_n(G) = ⁿ(G)/ⁿ⁺¹ (G) and compute the order of Qⁿ (G).2000 Mathematics Subject Classification: 16S34, 20C05     

Stability Relationships Among the Gibbs Sampler and its Subchains

The use of Gibbs samplers driven by improper posteriors has been a controversial issue in the statistics literature over the last few years. It has recently been demonstrated that it is possible to make valid statistical inferences through such Gibbs samplers. Furthermore, theoretical and empirical evidence has been given to support the idea that there are actually computational advantages to using these nonpositive recurrent Markov chains rather than more standard positive recurrent chains. These results provide motivation for a general study of the behavior of the Gibbs Markov chain when it is not positive recurrent. This article concerns stability relationships among the two-variable Gibbs sampler and its subchains. We show that these three Markov chains always share the same stability; that is, they are either all positive recurrent, all null recurrent, or all transient. In addition, we establish general results concerning the ways in which positive recurrent Markov chains can arise from null recurrent and transient Gibbs chains. Six examples of varying complexity are used to illustrate the results.     

Covering symmetric semi-monotone functions

We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-monotone function is NP-complete if all the values of the function are in {0,1} and we provide a minimax theorem if all the values of the function are different from 1. Our problem is equivalent to the node to area augmentation problem. Our contribution is to provide a significantly simpler and shorter proof.     

几类非Abel群之增广商群的结构

记ZG为有限群G的整群环,△n(G)为增广理想△(G)的n次幂,Qn(G)=△"(G)/△n 1(G)为G的增广商群.本文考虑了二面体群D2tk(k 奇)和m次对称群Sm,证明了Qn(D2tk)为秩不超过2t 1的基本2-群以及Qn(Sm)≌Z2.