Comparison of stimulated-emission-pumping fluorescence dip spectrometry and conventional fluorescence spectrometry in application to supersonic jet spectrometry

Summary A supersonic jet spectrum of 9,10-dichloroanthracene is measured by stimulated-emission-pumping fluorescence dip spectrometry and conventional fluorescence spectrometry. The performance obtained is compared for these spectrometric methods, providing same information concerned with the energy level of the ground state. The former is more preferential for measurement of a high-resolution spectrum, since the spectral resolution is determined by the linewidth of the dumping laser. On the other hand, the latter is more preferential for measurement with better sensitivity at the expense of the spectral resolution, since the fluorescence throughput can be improved by increasing the slit width of the monochromator.Dedicated to Professor Dr. Wilhelm Fresenius on the occasion of his 80th birthday     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

凸域内单叶函数的导数

设函数f（w）为凸区域D内的单叶解析函数,对于2≤n≤8和所有w∈D,本文得到估计式|f（n）（w）/f＇（w）|的精确上界.这个结果推广了一些已知的结论.     

激光等离子体2660紫外探针及干涉系统

成功地在六路高功率Nd玻璃激光装置上建立了2660紫外激光探针和适合紫外波段的Normaski干涉仪,首次将可见波长的连续激光应用于紫外干涉仪中靶成像调整和光路准直。利用该紫外光干涉仪,在铜柱状靶(φ500μm)上测量了厚等离子体中高达0.6n。的电子密度。     

Measurement of the Seperation between Atoms beyond Diffraction Limit

We propose a scheme to obtain the distance of two identical atoms placed inside the standing wave field by monitoring the collective resonance fluorescence spectrum emitted by the two particles. We find three different parameter ranges, depending on the distance of the atoms as compared to the transition wavelength. For large interparticle distances, dipole-dipole coupling is negligible, and the main system evolution arises from the interaction with the standing wave field. In the small-distance limit, the dynamics is dominated by the dipole-dipole interaction. Finally, in the intermediate region, a rich interplay of the various couplings arises, which however is lifted for strong driving laser fields. The present measurement procedure allows us to distinguish the three cases. In each of the cases, we show how to determine the distance of the two particles and their respective positions relative to the nodes of the standing wave field with fractional-wavelength precision.     

Attractors and Dimensions for Discretizations of a Dissipative Zakharov Equations

Abstract In this paper, a dissipative Zakharov equations are discretized by difference method.We make priorestimates for the algebric system of equations. It is proved that for each mesh size,there exist attractors forthe discretized system.The bounds of the Hausdorff dimensions of the discrete attractors are obtained,and thevarious bounds are dependent of the mesh sizes.     

Structural evolution in amorphous silicon and germanium thin films.

The structural evolution in amorphous silicon and germanium thin films has been investigated by high-resolution transmission electron microscopy (HRTEM) in conjunction with autocorrelation function (ACF) analysis. The results established that the structure of as-deposited semiconductor films is of a high density of nanocrystallites embedded in the amorphous matrix. In addition, from ACF analysis, the structure of a-Ge is more ordered than that of a-Si. The density of embedded nanocrystallites in amorphous films was found to diminish with annealing temperature first, then to increase. The conclusions also corroborate well with the results of diminished medium-range order in annealed amorphous films determined previously by a variable coherence microscopy method.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.