The Analysis and Improving of the Microwave Exciter in the Lower Hybrid Wave System

When we carry out lower hybrid wave heating and current driving plasma experiment at tokamak, we need mega-watt order of microwave power. The microwave signal at frequency of 2450 MHz is generated by a microwave exciter. According to the experiment＇s demands, the microwave exciter must provide output power of 1.5～ 2. 5 W with stabilized frequency and amplitude tobe used as the klystron input. Being amplified by the klystron, the microwave signal is transmitted through the transmitting system to the antenna and is emitted into the HL-2A tokamak. So we can see that the microwave exciter＇s function is very important to the lower hybrid wave heating and current driving plasma experiment.     

On fixed point and almost fixed point problems of lower semicontinuous type multivalued mappings

In the present paper, some new almost fixed point theorems and fixed point theorems for lower semicontinuous type multivalued mappings are obtained in metrizable H-spaces.     

四阶非线性边值问题解的存在性与上下解方法

该文讨论四阶常微分方程边值问题u^(4)(t)=f(t,u,u″), t∈［0,1］,u(0)=u(1)=u″(0)=u″(1)=0解的存在性, 其中f(t,u,v):［0,1］×R×R→R为Carathéodory函数. 在不限制f关于u,v的增长阶, 不假定f关于u,v的单调性的一般情形下, 用上下解方法获得了解的存在性结果,并讨论了单调迭代求解的有效性.     

Orbitals that minimize the variance

A MCSCF-method for minimization of the variance yielding an optimal basisset of variance minimizing orbitals in analogy to Löwdin's natural orbitals for minimal energy is developed.     

Needle Variations and Almost Lower Semicontinuous Differential Inclusions

It is shown that the construction of needle variations can be carried out for almost lower semicontinuous differential inclusions rather than for the case of ordinary single-valued continuously differentiable vector fields usually considered in the literature. The construction leads to needle variations whose flows are in general set-valued but still have good differentiability properties. The variations are constructed by using single-valued selections that are not necessarily continuous with respect to the state variable, but have instead a much weaker 'integral continuity' property, somewhat more general that the 'directional continuity' considered in previous work by A. Cambini and S. Querci, A. Pucci, and A. Bressan. The existence of many such selections is proved by slightly adapting an argument due to Bressan, extending it from the lower semicontinuous to the almost lower semicontinuous case, and strengthening it to yield not only directional continuity at all points but also full continuity at a specified point.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|r_j|L_max which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.     

A lower bound on the performance of the quadratic discriminant function

The quadratic discriminant function is often used to separate two classes of points in a multidimensional space. When the two classes are normally distributed, this results in the optimum separation. In some cases however, the assumption of normality is a poor one and the classification error is increased. The current paper derives an upper bound for the classification error due to a quadratic decision surface. The bound is strict when the class means and covariances and the quadratic discriminant surface satisfy certain specified symmetry conditions.