用Josephson结电子模拟器测量磁通量子2e/h

介绍用Josephson结电子模拟器在政党温度下，模拟测量磁通量子2e/h，用模拟器来研究Josephosn结的特性。该实验可作为普通物理实验中课题设计实验的一个内容。     

Tokamak中自举电流的剖面准直性

利用Harris模型,通过求解等离子体平衡方程,计算俘获粒子份额,分别对常规剪切和中心负剪切下tokamak中的自举电流的大小和剖面准直性进行了计算和分析.自举电流分布与等离子体平衡电流分布之间的剖面准直性可以通过调整等离子体的密度、温度和电流分布参数,以及描述等离子体形状的拉长度k和三角变形因子d来获得.中心负剪切位形有利于自举电流产生,并有好的剖面准直性.通过计算比较,分别在常规剪切位形下和中心负剪切位形下获得了一组优化的等离子体参数,在这组参数下,自举电流有较大的份额和好的剖面准直性 关键词： tokamak 自举电流 剖面准直性     

新疆野生黑加仑与马林果实的营养成分分析

通过对新疆野生黑加仑和野生马林的脂肪油，8种微量元素，17种氨基酸以及维生素C的含量进行测定得出：黑加仑脂肪油含量为17．9％，马林的脂肪油含量为22．3％，其中，黑加仑脂肪油中，r－亚麻酸的含量为19．02％，而马林中，其含量为9．40％，黑加仑中K，Na,Ca,Cu,Zn,Fe的含量比马林中的含量高，而Mn,Mg元素的含量却比马林含量低；马林的维生素C含量为16．22mg/g，黑加仑的含量为108mg/g，黑加仑的氨基酸的总量为1．63％，马林为1．14％。     

Tesla变压器型电子束加速器初步实验

 介绍了一种Tesla变压器型的强流电子束加速器。当变压器初级输入20kV左右的电压时，加速器二极管输出电压500kV，电流9kA，信号脉宽大约50ns，该装置具有结构简单，安装方便，运行可靠等特点。     

Magnetic hysteresis of the magnetoresistance and the critical current density in polycrystalline YBa2Cu3O7−δ–Ag superconductors

A systematic study of the magnetic hysteresis in transport properties of polycrystalline YBa₂Cu₃O_7−δ–Ag compounds has been made based on two kinds of measurements at 77 K and under applied magnetic fields up to 30 mT: critical current density J_c(B_a) and magnetoresistance R(B_a). The R(B_a) curves show a minimum in their decreasing branch occurring at B=B_min which was found to be both the excitation current I_ex and the maximum applied magnetic field B_am dependent. In addition, for a certain value of B_am>5 mT, we have observed that B_min increases with increasing I_ex and reaches a saturation value. The J_c(B_a) curves show a maximum in decreasing applied magnetic fields occurring at B=B_max. We have also found that B_max increases with increasing B_am and reaches a saturation value. The minimum in the R(B_a) and the maximum in J_c(B_a) curves were found to be related to the trapped flux within the grains. All the experimental results are discussed within the context of the flux dynamics and transport mechanisms in these high-T_c materials.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.     

Unusual current‐voltage characteristics of single crystalline and bicrystalline La0.7Ca0.3MnO3 films

The current‐voltage characteristics of single crystalline and bicrystalline La_0.7Ca_0.3MnO₃ films were measured and analyzed. Several epitaxial films, as well as 45° [001]‐tilt grain boundaries, display current‐voltage characteristics which are asymmetric with respect to polarity reversal of the bias current. One epitaxial film has a polarity dependent resistance of ～340kΩ and of ～670kΩ in forward and in reverse direction, respectively.     

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.     

Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.