抽象空间中非线性算子方程变号解的存在性研究

利用Banach空间中的锥理论和不动点定理讨论了非线性算子方程变号解的存在性,给出了E_u_0空间下非线性算子方程变号解至少有一个变号解、一个正解和一个负解的条件,并讨论了仅通过一个上解条件得出非线性算子方程变号解的存在性定理.     

磁绝缘传输线阻抗变化对空间电子流的影响

介绍了磁绝缘传输线的阻抗大小、传输电压及电流大小对其产生的空间电子流大小及阴极电子鞘层厚度的影响。运用CHIPIC软件建立四层圆盘锥形磁绝缘传输线A层的近似化三维模型进行模拟,对比理论计算值与模拟值,并与相关文献的二维模拟结果进行对照,验证三维模拟的正确性。最后,模拟研究了圆盘锥形磁绝缘传输线阴阳极之间的间距变化对传输效率的影响。     

Conformationally Selective Synthesis of Mononitrocalix[4]arene in Cone or Partial Cone

Nitro‐substituted calixarenes in a cone and a partial cone conformation were prepared selectively using distinct synthetic routes. The selective nitration of tris‐ or penta‐substituted phenols of calix[4]arene or calix[6]arene provided mononitrocalix[n ]arenes (n  =  4, 6). Subsequent addition of ethylene glycol (EG) moieties to mononitrocalix[4]arene provided tetraEGylcalix[4]arene in locked partial cone conformation. By an alternative route – initial addition of EG moieties to the non‐derivatized calix[4]arene followed by the uncontrolled nitration – provided mononitro‐ and dinitro‐tetraEGylcalix[4]arenes locked in the cone conformation. These nitrocalix[4]arenes with locked cone or partial cone conformation are useful building blocks for further assembly of supramolecular systems, especially in the area of material sciences.     

Analytical chemistry and the cone penetrometer: In situ chemical characterization of the subsurface

The development of novel microanalytical techniques forin situ chemical characterization of the terrestrial subsurface environment has grown significantly over the last decade, particularly those instruments that are interfaced to the cone penetrometer. Cone penetrometer testing (CPT) has emerged as an effective means to introduce samplers and probes forin situ analysis of contaminants in soil and groundwater matrices. A variety ofin situ chemical samplers for CPT have been developed that can be driven into the subsurface to collect soil gas, groundwater, or soil samples at depth, thus providing a means of determining the vertical and horizontal extent of contamination. Cone penetrometer testing is also being explored as a means to deliverin situ subsurface sensor probes, including probes based on laser-induced fluorescence, Raman, and infrared spectroscopies for organics; on laser-induced breakdown and X-ray fluorescence spectroscopies for heavy metals; and on passive gamma-ray spectroscopy for radionuclides. The range of analytical technologies used in CPT for the determination of organic and inorganic species in the subsurface is described.     

Quantum-classical correspondence for motion on a plane with deficit angle

A particle constrained to move on a cone and bound to its tip by harmonic oscillator and Coulomb-Kepler potentials is considered both in the classical as well as in the quantum formulations. The SU(2) coherent states are formally derived for the former model and used for showing some relations between closed classical orbits and quantum probability densities. Similar relations are shown for the Coulomb-Kepler problem. In both cases a perfect localization of the densities on the classical solutions is obtained even for low values of quantum numbers.     

Path-following interior point algorithms for the Cartesian <Emphasis Type="Italic">P</Emphasis><Subscript>*</Subscript>(κ)-LCP over symmetric cones

In this paper, we establish a theoretical framework of path-following interior point algorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P _*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P _*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms. This work was supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)     

A NEW FIXED POINT THEOREM FOR CONE MAPS AND ITS APPLICATIONS

1IntroductionLetEbearealBanachspace.AnonemptyconvexclosedsetPCEiscalledaconeinEifitsatisfiesthefollowingtwoconditionsf(i)xEP,A20impliesAxEP,(n)xEP,--xEPimpliesx=0.AconePiscalledsolidifitcontainsinteriorpoints,i.e.,P/gi.TheconePinEdefinesapartialorderingx5…     

Positive solutions for three-point boundary value problems with dependence on the first order derivative

A new fixed point theorem in a cone is applied to obtain the existence of at least one positive solution for the second order three-point boundary value problem

     

Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems

We study a processing system comprised of parallel queues, whose individual service rates are specified by a global service mode (configuration). The issue is how to switch the system between various possible service modes, so as to maximize its throughput and maintain stability under the most workload-intensive input traffic traces (arrival processes). Stability preserves the job inflow–outflow balance at each queue on the traffic traces. Two key families of service policies are shown to maximize throughput, under the mild condition that traffic traces have long-term average workload rates. In the first family of cone policies, the service mode is chosen based on the system backlog state belonging to a corresponding cone. Two distinct policy classes of that nature are investigated, MaxProduct and FastEmpty. In the second family of batch policies (BatchAdapt), jobs are collectively scheduled over adaptively chosen horizons, according to an asymptotically optimal, robust schedule. The issues of nonpreemptive job processing and non-negligible switching times between service modes are addressed. The analysis is extended to cover feed-forward networks of such processing systems/nodes. The approach taken unifies and generalizes prior studies, by developing a general trace-based modeling framework (sample-path approach) for addressing the queueing stability problem. It treats the queueing structure as a deterministic dynamical system and analyzes directly its evolution trajectories. It does not require any probabilistic superstructure, which is typically used in previous approaches. Probability can be superposed later to address finer performance questions (e.g., delay). The throughput maximization problem is seen to be primarily of structural nature. The developed methodology appears to have broader applicability to other queueing systems.     

Additive stable solutions on perfect cones of cooperative games

Closed kernel systems of the coalition matrix turn out to correspond to cones of games on which the core correspondence is additive and on which the related barycentric solution is additive, stable and continuous. Different perfect cones corresponding to closed kernel systems are described. Received: December 2001/Revised: July 2002 RID="*" ID="*"  This note contains the new results, which were presented by the first author in an invited lecture at the XIV Italian Meeting on Game Theory and Applications in Ischia, July 2001. The lecture was dedicated to Irinel Dragan on the occasion of his seventieth birthday.