THE DESIGNS OF HIGH EFFICIENCY LAUNCHER OF QUASI-OPTICAL MODE CONVERTER FOR HIGH POWER GYROTRONS

A high efficiency launcher of quasi-optical (QO) mode converters for high power gyrotrons have been designed and tested. A helical cut launcher radiates the RF power via its straight cut onto the first phase correcting mirror. The launchers have been optimized for the TE_31.8 mode at 170 GHz and TE_22.6 mode at 110 GHz by numerically optimizing a launcher surface. The helical cut of the launcher has been optimized by taking the taper angle into account. Further more, the amplitude of the surface perturbation have been optimized for improved focusing in order to reduce the diffraction losses at the helical cut. Low power measurement shows a good agreement with the design. High efficiency characteristics of the design have also been calculated on the assumption of frequency downshift due to the thermal expansion of the cavity and stepwise frequency tuning by changing the operating mode. Besides, the possibility of high efficiency launcher for higher mode is discussed, and these results give the prospect to high efficiency long pulse gyrotrons.     

Convex dominates concave: An exclusion principle in discrete-time Kolmogorov systems

We establish an exclusion principle in discrete-time Kolmogorov systems by using average Liapunov functions. The exclusion principle shows that a weakly dominant species with a convex logarithmic growth rate function eliminates species with concave logarithmic growth rate functions. A general result is applied to specific population models. This application gives an improved exclusion principle for the specific population models.

     

Optimal pricing for a heterogeneous portfolio for a given risk factor and convex distance measure

Consider a portfolio containing heterogeneous risks. The premiums of the policyholders might not cover the amount of the payments which an insurance company pays the policyholders. When setting the premium, this risk has to be taken into consideration. On the other hand the premium that the insured pays has to be fair. This fairness is measured by a function of the difference between the risk and the premium paid—we call this function a distance function. For a given small probability of insolvency, we find the premium for each class, such that the distance function is minimized. Next we formulate and solve the dual problem, which is minimizing the insolvency probability under the constraint that the distance function does not exceed a given level. This paper generalizes a previous paper [Zaks, Y., Frostig, E., Levikson, B., 2006. Optimal pricing of a heterogeneous portfolio for a given risk level. Astin Bull. 36 (1), 161–185] where only a square distance function was considered.     

Quotient probabilistic normed spaces and completeness results

We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.     

等效可变孔径远场法测量单模光纤模场半径

本文提出等效远场的可变孔径方法,由测量光纤远场累积分布求得模场半径。并且利用Petermann关于模场半径的新定义,推出了一种对非高斯模场分布也适用的求模场半径的方法。实验表明,这种测量方法简便可靠,在不同的制备端面下,重复测量的标准误差小于0.04μm。     

Mixed Elastico-Plasticity Problems with Partially Unknown Boundaries

In this paper,we study mixed elastico-plasticity problems in which part of the boundary is known,while the other part of the boundary is unknown and is a free boundary.Under certain conditions,this problemcan be transformed into a Riemann-Hilbert boundary value problem for analytic functions and a mixed boundaryvalue problem for complex equations.Using the theory of generalized analytic functions,the solvability of theproblem is discussed.     

四次函数实零点的完全判据和正定条件

本文给出了四次函数实零点的完全判据和正定条件,这一结果在研究多项式系统的奇点分析和分支问题时给出了可以实用的判据．     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Quantum Dot and Antidot Infrared Photodetectors: Iterative Methods for Solving the Laplace Equation in Domains with Involved Geometry

We propose iteration methods for solving the Dirichlet problem in domains with involved geometry. Such problems arise in relation to the problem of optimizing quantum dot and antidot infrared detectors. We estimate the deviation of an approximate solution from the exact solution.     

Sinc-Galerkin method for solving linear sixth-order boundary-value problems

There are few techniques available to numerically solve sixth-order boundary-value problems with two-point boundary conditions. In this paper we show that the Sinc-Galerkin method is a very effective tool in numerically solving such problems. The method is then tested on examples with homogeneous and nonhomogeneous boundary conditions and a comparison with the modified decomposition method is made. It is shown that the Sinc-Galerkin method yields better results.