Investigation of odd-parity Rydberg states of Eu I with autoionization detection

Isolated-core-excitation (ICE) scheme and autoionization detection are employed to study the bound Rydberg states of europium atom. The high-lying states with odd parity have been measured using the autoionization detection method with three different excitation paths via 4f⁷6s6p[ ⁸P_5/2], 4f⁷6s6p[ ⁸P_7/2] and 4f⁷6s6p[ ⁸P_9/2] intermediate states, respectively. In this paper the spectra of bound Rydberg states of Eu atom are reported, which cover the energy regions from 36000~cm^-1 to 38250~cm^-1 and from 38900~cm^-1 to 39500 cm^-1. The study provides the information about level energy, the possible J values and relative line intensity as well as the effective principal quantum number n^* for these states. This work not only confirms the previous results of many states, but also discovers 11 new Rydberg states of Eu atom.     

Solving multiobjective,multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

In this paper, we solve instances of the multiobjective multiconstraint (or multidimensional) knapsack problem (MOMCKP) from the literature, with three objective functions and three constraints. We use exact as well as approximate algorithms. The exact algorithm is a properly modified version of the multicriteria branch and bound (MCBB) algorithm, which is further customized by suitable heuristics. Three branching heuristics and a more general purpose composite branching and construction heuristic are devised. Comparison is made to the published results from another exact algorithm, the adaptive ε-constraint method [Laumanns, M., Thiele, L., Zitzler, E., 2006. An efficient, adaptive parameter variation scheme for Metaheuristics based on the epsilon-constraint method. European Journal of Operational Research 169, 932–942], using the same data sets. Furthermore, the same problems are solved using standard multiobjective evolutionary algorithms (MOEA), namely, the SPEA2 and the NSGAII. The results from the exact case show that the branching heuristics greatly improve the performance of the MCBB algorithm, which becomes faster than the adaptive ε -constraint. Regarding the performance of the MOEA algorithms in the specific problems, SPEA2 outperforms NSGAII in the degree of approximation of the Pareto front, as measured by the coverage metric (especially for the largest instance).     

污泥内层和外层胞外聚合物的三维荧光光谱特性研究

运用三维荧光光谱技术对污泥LB-EPS和TB-EPS的荧光特性进行了研究.实验结果表明,在污泥LB-EPS和TB-EPS中都有三个明显的荧光峰,分别为Peak B(λex/λem=270～280 nm/345～360 nm),Peak C(λex/λem=330～340 nm/410～430 am)和Peak D(λex/λem=390 nm/450～470 nm).其中Peak B为类蛋白荧光(Protein-like)、Peak C为可见区类富里酸荧光(Visible fulvic-like)、Peak D为类腐殖酸荧光(Humic-like).从各荧光峰的荧光强度来分析,LB-EPS和TB-EPS中的主要成分都为类蛋白,然后依次为富里酸和腐殖酸.浓度和pH值对污泥LB-EPS和TB-EPS的三维荧光特性都有很大的影响,但影响程度略有区别,表明作为外层的胞外聚合物,LB-EPS表现出与TB-EPS不全相同的化学结构.     

Calculations of D‐wave bound states and resonance states of the screened helium atom using correlated exponential wave functions

We have investigated the effects of screened Coulomb (Yukawa) potentials on the bound ^1,3D states and the doubly excited ^1,3 D^e resonance states of helium atom using highly correlated exponential basis functions. The Density of resonance states are calculated using stabilization method. Highly correlated exponential basis functions are used to consider the correlation effect between the charged particles. A total of 18 resonances (nine each for ¹ D^e and ³ D^e states) below the n = 2 He ⁺ threshold has been calculated. For each spin states, this includes four members in the 2pnp series, three members in the 2snd series, and two members in 2pnf series. The resonance energies and widths for various screening parameters ranging from infinity to a small value for these ^1,3 D^e resonance states are reported along with the bound‐excited 1s3d ^1,3 D state energies. Overall behavior of the spectral profile of 1s3d ¹D state of helium atom due to electron‐electron and electron‐nucleus screening are also presented. Accurate resonance energies and widths are also reported for He in vacuum. © 2009 Wiley Periodicals, Inc. Int J Quantum Chem, 2010     

Finite element modeling of acoustic scattering from an encapsulated microbubble near rigid boundary

This article proposes a finite element model (FEM) for predicting the acoustic scattering from an encapsulated microbubble near rigid boundary. The validity of the model is first examined by comparing the acoustic nonlinear response of a free microbubble with that obtained by the Church model. Then this model is used to investigate the effect of the rigid boundary on acoustic scattering signals from microbubble. The results indicate that the resonance frequency decreases while the oscillation amplitude increases as the microbubble approaches the rigid boundary. In addition, the fundamental component of the acoustic scattering signal is enhanced compared with that of the free microbubble.     

平面滑动型岩质边坡稳定性极限分析上限法

在极限分析理论框架体系的基础上,提出了平面滑动型岩质边坡极限分析上限法。该方法按照外力所做的功率等于内力所消耗的功率,即滑体处于极限状态时两功率相等的条件——虚功率方程,综合考虑作用在岩质边坡上的后缘裂缝静水压力、沿滑面扬压力、重力、水平地震作用力、锚固力等外力,按照强度折减法,推导得出了岩质边坡稳定性评价的极限分析上限解。锦屏一级水电站右岸泄洪洞引渠内侧工程边坡属于典型的多级台阶状岩质高边坡,该边坡岩体结构为层状结构,变形破坏模式为平面滑动。对引渠内侧岩质边坡稳定性分析结果表明,极限分析上限法对平面滑动型岩质边坡有较好的适用性。     

THE EIGENVALUE PERTURBATION BOUND FOR ARBITRARY MATRICES

In this paper we present some new absolute and relative perturbation bounds for theeigenvalue for arbitrary matrices, which improves some recent results. The eigenvalueinclusion region is also discussed.     

A hybrid tabu search/branch & bound approach to solving the generalized assignment problem

A new approach for solving the generalized assignment problem (GAP) is proposed that combines the exact branch & bound approach with the heuristic strategy of tabu search (TS) to produce a hybrid algorithm for solving GAP. The algorithm described uses commercial software to solve sub-problems generated by the TS guiding strategy. The TS approach makes use of the concept of referent domain optimisation and introduces novel add/drop strategies. In addition, the linear programming relaxation of GAP that forms part of the branch & bound approach is itself helpful in suggesting which variables might take binary values. Computational results on benchmark test instances are presented and compared with results obtained by the standard branch & bound approach and also several other heuristic approaches from the literature. The results show the new algorithm performs competitively against the alternatives and is able to find some new best solutions for several benchmark instances.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.     

Projective surfaces with many skew lines

We give an example of a smooth surface of degree that contains pairwise disjoint lines. In particular, our example shows that the degree in Miyaoka's bound is sharp.