Yb3+掺杂KY(WO4)2激光晶体生长、结构与光谱分析

采用顶部籽晶提拉法(TSSG)生长出Yb:KY(WO₄)₂(Yb:KYW)激光晶体.对预烧后的原料及晶体进行了XRD分析，结果表明，分别在920℃和600℃预烧8h后的熔质和助熔剂基本上形成一相，抑止了实验中的挥发问题；所生长的晶体为β-Yb:KYW，计算其晶格常数为a=1.063nm，b=1.034nm，c=0.755nm，β=130.75°.测得不同厚度样品的吸收光谱，结果表明样品在933nm和981nm有较强的吸收峰，计算出主峰981nm的吸收截面σ关键词： Yb:KYW TSSG法 晶体结构 光谱参数     

Angle theorems for the Lagrangian mean curvature flow

We prove that symplectic maps between Riemann surfaces L, M of constant, nonpositive and equal curvature converge to minimal symplectic maps, if the Lagrangian angle for the corresponding Lagrangian submanifold in the cross product space satisfies . If one considers a 4-dimensional K?hler-Einstein manifold of nonpositive scalar curvature that admits two complex structures J, K which commute and assumes that is a compact oriented Lagrangian submanifold w.r.t. J such that the K?hler form w.r.t.K restricted to L is positive and , then L converges under the mean curvature flow to a minimal Lagrangian submanifold which is calibrated w.r.t. . Received: 11 April 2001 / Published online: 29 April 2002     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

A nilpotent Roth theorem

Let T and S be invertible measure preserving transformations of a probability measure space (X, ℬ, μ). We prove that if the group generated by T and S is nilpotent, then exists in L ²-norm for any u, v∈L ^∞(X, ℬ, μ). We also show that for A∈ℬ with μ(A)>0 one has . By the way of contrast, we bring examples showing that if measure preserving transformations T, S generate a solvable group, then (i) the above limits do not have to exist; (ii) the double recurrence property fails, that is, for some A∈ℬ, μ(A)>0, one may have μ(A∩T _-n A∩S ^{- n} A)=0 for all n∈ℕ. Finally, we show that when T and S generate a nilpotent group of class ≤c, in L ²(X) for all u, v∈L ^∞(X) if and only if T×S is ergodic on X×X and the group generated by T ^-1 S, T ^-2 S ²,..., T ^-c S ^c acts ergodically on X. Oblatum 19-V-2000 & 5-VII-2001?Published online: 12 October 2001     

On a conjecture of Cox and Katz

This note shows that a certain toric quotient of the quintic Calabi-Yau threefold in provides a counterexample to a recent conjecture of Cox and Katz concerning nef cones of toric hypersurfaces. Received: 8 February 2001; in final form: 17 September 2001 / Published online: 1 February 2002     

Sharp estimates in terms of moduli of smoothness for compound cubature rules

Summary In 1980 Dahmen-DeVore-Scherer introduced a modulus of continuity which turns out to reflect invariance properties of compound cubature rules effectively. Accordingly, sharp error bounds are derived, the existence of relevant counterexamples being a consequence of a quantitative resonance principle, established previously.     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.