Lepton-number-violating decays of singly-charged Higgs bosons in the type-（Ⅰ＋Ⅱ ） seesaw model

The lepton-number-violating decays of singly-charged Higgs bosons H^± are investigated in the minimal type-（ Ⅰ＋Ⅱ ） seesaw model with one SU（2）L Higgs triplet △ and one heavy Majorana neutrino N1 at the TeV scale. We find that the branching ratios B（H^＋ → 1α^＋υ^-） （for α = e,μ,τ） depend not only on the mass and mixing parameters of three light neutrinos υi （for i = 1, 2, 3） but also on those of N1. Assuming that the mass of N1 lies in the range of 200 GeV to 1 TeV, we figure out the generous interference bands for the contributions of υi and N1 to B（H^＋→ 1α^＋υ^-）. We illustrate some salient features of such interference effects by considering three typical mass patterns of υi, and show that the relevant Majorana CP-violating phases can affect the magnitudes of B（H^＋→ 1α^＋υ^-）） in this parameter region.     

Charmonium results from BES

Using ～ 14 × 10^6 ψ（2S） and ～ 58 × 10^ J/ ψ data collected at BES Ⅱ/BEPC, the branching fraction of ψ（2S）→Ω-Ω^＋ is measured with about 5a statistical significance. The A electric dipole and ∧ decay parameter are studied using the decay J/ψ →∧∧→ ppπ^＋π^-. Using （106±3）× 10^6 ψ（2S） decays collected at BESⅢ/BEPC Ⅱ, we have obtained some interesting physics results. The branching fractions of XcJ→π^0π^0, ηη are measured with precision improved. The mass and width of he（l^1P1） state, together with the branching fractions of Br（ψ（2S） →π^0hc） and Br（hc →γηc） are the first measurements. Surprisingly, the decays of Xc1→φφ, ωω, and ωφ are firstly observed in BESⅢ data.     

Study of lower emittance dedicated synchrotron radiation mode for the BEPCⅡ

In this paper,a dedicated synchrotron radiation （SR） mode for the BEPCⅡ with an emittance of 85 nm has been designed,including the linear lattice,chromaticity correction and dynamic aperture optimization.The emittance of the new mode is about 60% of the previous mode used for routine operation of the BEPCⅡ .The effect of wigglers on the linear lattice was compensated and the total dynamic aperture including the wigglers’ nonlinear effect was estimated.The preliminary commissioning at the end of 2008 and the formal operation with the new mode confirmed its merits.     

High Power THz Undulator Radiation from Linear Accelerator

A 30-MeV femto-second electron linac is built at the Shanghai Institute of Applied Physics, which can produce high power, coherent THz undulator radiation. We report the experimental facility and measurement of the power, frequency spectrum. First experiments show the averaged power at THz to be about 20mW.     

An exact algorithm for solving the bilevel facility interdiction and fortification problem

We present an exact approach for solving the $r$-interdiction median problem with fortification. Our approach consists of solving a greedy heuristic and a set cover problem iteratively that guarantees to find an optimal solution upon termination. The greedy heuristic obtains a feasible solution to the problem, and the set cover problem is solved to verify optimality of the solution and to provide a direction for improvement if not optimal. We demonstrate the performance of the algorithm in a computational study.     

最小最大二点集覆盖问题分析及改进算法设计

本文考虑二中心问题的扩展问题-最小最大二点集覆盖问题。给定两个平面点集P₁和P₂,分别包含m和n个点,求两个圆分别覆盖P₁和P₂,并且要求两圆半径与两圆圆心距三者中的最大值最小。本文主要贡献在于分析半径变化过程中两个点集中心包之间最近距离的变化关系,其中中心包是点集所具有的一个特殊几何结构,所得到的结果改进了Huang等人之前给出的结果,并且通过该结果设计相应算法,所得到的算法复杂性是目前最好的。     

求解无容量设施选址问题的拉格朗日蝙蝠算法

无容量设施选址问题(Uncapacitated Facility Location Problem,UFLP)是一类经典的组合优化问题,被证明是一种NP-hard问题,易于描述却难于求解.首先根据UFLP的数学模型及其具体特征,重新设计了蝙蝠算法的操作算子,给出了求解UFLP的蝙蝠算法.其次构建出三种可行化方法,并将其与求解UFLP的蝙蝠算法和拉格朗日松弛算法相结合,设计了求解该问题的拉格朗日蝙蝠算法.最后通过仿真实例和与其他算法进行比较的方式,验证了该混合算法用来求解UFLP的可行性,是解决离散型问题的一种有效方式.     

无容量限制设施选址问题的降阶回溯算法

无容量限制设施选址问题(uncapacitated facility location problem, UFLP)是经典组合优化中NP-Hard问题之一,在诸多领域具有广泛的应用价值。本文首先研究UFLP的数学性质,并进行了数学证明。运用这些数学性质不仅可以确定某些设施必定开设或者关闭,还可以确定某些连接边是否在服务集中,从而缩小问题的规模,加快求解速度;在此基础上设计出一个新的基于上下界的回溯算法来求解UFLP。最后,通过一个示例进一步阐述该算法的原理,结果表明该算法具有明显的可行性和有效性。     

A branch and cut algorithm for the hierarchical network design problem

The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting the remaining nodes to the path. We optimally solve the problem using an ad hoc branch and cut procedure. Relaxed versions of a base model are solved using an optimization package and, if binary variables have fractional values or if some of the relaxed constraints are violated in the solution, cutting planes are added. Once no more cuts can be added, branch and bound is used. The method for finding valid cutting planes is presented. Finally, we use different available test instances to compare the procedure with the best known published optimal procedure, with good results. In none of the instances we needed to apply branch and bound, but only the cutting planes.     

The rectilinear distance Weber problem in the presence of a probabilistic line barrier

This paper considers the problem of locating a single facility in the presence of a line barrier that occurs randomly on a given horizontal route on the plane. The objective is to locate this new facility such that the sum of the expected rectilinear distances from the facility to the demand points in the presence of the probabilistic barrier is minimized. Some properties of the problem are reported, a solution algorithm is provided with an example problem, and some future extensions to the problem are discussed.