算子点态遍历定理

本文证明了关于Ｌ^P（１≤Ｐ≤∞）空间中线性算子与非线性算子的几个点态遍历定理，还推广了Ｙｏｓｉｄａ与ＫａＫｕｔａｎｉ关于拟紧算子的一致遍历定理。     

Robust stabilization of uncertain linear dynamical systems with time-varying delay

In this paper, the problem of the robust stabilization for a class of uncertain linear dynamical systems with time-varying delay is considered. By making use of an algebraic Riccati equation, we derive some sufficient conditions for robust stability of time-varying delay dynamical systems with unstructured or structured uncertainties. In our approach, the only restriction on the delay functionh(t) is the knowledge of its upper boundh ^–. Some analytical methods are employed to investigate these stability conditions. Since these conditions are independent of the delay, our results are also applicable to systems with perturbed time delay. Finally, a numerical example is given to illustrate the use of the sufficient conditions developed in this paper.     

奇异线性模型的估计效率

在本文中，我们对奇异线性模型提出并解决参数的可估线性函数的估计效率问题。讨论了估计效率与Ｈｏｔｅｌｌｉｎｇ广义相关系数的关系，给出了估计效率的上、下界以及达到上、下界的条件。     

相关攻击与相关免疫函数

本文首先介绍了如何采用ＤＣ攻击法对一类流密码体制进行相关攻击，从而说明在密码学中有必要研究相关免疫（ＣＩ）函数。在综述了域Ｆ２上相关免疫（ＣＩ）函数的研究进展的同时，给出了ＣＩ函数在一般有限域上的特性和构造，并进一步研究有限环Ｚ／（ｍ）时的情景，本文详尽描述了ＣＩ函数的五种充要条件。最后提出了几个值得研究的未解决的问题。     

The linear complementarity problem as a separable bilinear program

The nonmonotone linear complementarity problem (LCP) is formulated as a bilinear program with separable constraints and an objective function that minimizes a natural error residual for the LCP. A linear-programming-based algorithm applied to the bilinear program terminates in a finite number of steps at a solution or stationary point of the problem. The bilinear algorithm solved 80 consecutive cases of the LCP formulation of the knapsack feasibility problem ranging in size between 10 and 3000, with almost constant average number of major iterations equal to four.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grants CCR-9322479 and CDA-9024618.     

A technique for speeding up the solution of the Lagrangean dual

We propose techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization and nonlinear programming problems. Our techniques find the optimal solution value and the optimal dual multipliers of the LP relaxation and the Lagrangean dual in polynomial time using as a subroutine either the Ellipsoid algorithm or the recent algorithm of Vaidya. Moreover, in problems of a certain structure our techniques find not only the optimal solution value, but the solution as well. Our techniques lead to significant improvements in the theoretical running time compared with previously known methods (interior point methods, Ellipsoid algorithm, Vaidya's algorithm). We use our method to the solution of the LP relaxation and the Langrangean dual of several classical combinatorial problems, like the traveling salesman problem, the vehicle routing problem, the Steiner tree problem, thek-connected problem, multicommodity flows, network design problems, network flow problems with side constraints, facility location problems,K-polymatroid intersection, multiple item capacitated lot sizing problem, and stochastic programming. In all these problems our techniques significantly improve the theoretical running time and yield the fastest way to solve them.     

ICF驱动器光束定位误差估计

 本文利用加权和法，将ICF物理实验对靶点的定位需求分配到各个组件对靶点的需求。运用等概率和不等概率方法，将组件对靶点的需求分配到各元件对靶点的需求。通过光学元件运动量与靶点光束定位之间的关系，确定各个元件定位误差估计值，并将其值作为光学元件定位误差变化范围，在此范围内进行上千条光线追迹法，根据正态分布区间估计法进行检验与修正，最后给出一组具有可行性的光学元件定位误差估计参考表。     

Stochastic regression model with heteroscedastic disturbance

This paper discusses some properties of stochastic regression model with continuous form of heteroscedastic disturbance. The strong consistency and asymptotic normality of a generalized weighted least squares estimate will be investigated under certain conditions on the stochastic regressors and errors. More, the linear hypothesis testing problem also be discussed and an example to be demonstrated to reestablish the results of Cheng and Chang (1990, Tech. Report, National Tsing Hua University).Supported by the National Science Council Grant No. 810208M763 at National Tsing Hua University.     

Constrained Kantorovich inequalities and relative efficiency of least squares

This paper establishes a type of Kantorovich inequality subject to some constraints and obtains some lower bounds for the relative efficiency of the least squares. These lower bounds can be much sharper than that obtained by using the unconstrained Kantorovich inequality. Multivariate extensions of the results are also obtained. Some interesting examples are presented.     

Synthesis and thermal behavior of phenylethynyl‐terminated linear and hyperbranched polyphenylquinoxalines

A phenylquinoxaline (PQ) AB monomer mixture was treated with monofunctional and difunctional end‐capping agents and with and without a coupling agent to afford phenylethynyl‐terminated linear PQ oligomers. The resulting PQ oligomers were soluble in common organic solvents and had intrinsic viscosities (IVs) of 0.21–0.30 dL/g. The glass‐transition temperature (T_g) of the diphenylethynyl‐end‐capped PQ oligomer on both sides increased the most, from 215 °C (before curing) to 251 °C (after curing). The PQ AB₂ monomer, which acted as both a coupling agent and a monomer for the hyperbranched polymer, was treated with an AB monomer and end‐capping agents to afford phenylethynyl‐terminated hyperbranched polyphenylquinoxalines (PPQs). They were also soluble in common organic solvents, had IVs of 1.00–1.65 dL/g and T_g's of 251–253 °C, and underwent exothermic cure with maxima around 412–442 °C. The T_g's of the cured hyperbranched PPQs ranged from 258 to 261 °C, depending on the number of phenylethynyl groups on the surface. After further curing, they displayed a T_g of 316 °C in one sample and turned into a fully crosslinked network. The dynamic melt viscosities of a linear oligomer (IV = 0.21 dL/g), a hyperbranched sample (IV = 1.00 dL/g), and a linear reference PPQ (IV = 1.29 dL/g) were compared with respect to the processing temperature. The PQ oligomer and hyperbranched PPQ had low melt viscosities. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 6318–6330, 2004