一类连续模糊动态系统控制方法在Furuta摆中的应用

为了研究Furuta摆在倒立点附近的稳定控制问题，采用基于T-S模糊模型的一类连续模糊动态系统控制方法，首次进行Furuta摆的模糊状态空间建模，并采用模糊切换的思想，设计了Furuta摆在倒立点附近的稳定控制器，进而分析了系统稳定性。与已有的方法相比，该方法的优点是稳定区域大、调节时间短。数字仿真结果验证了方法的有效性。     

非线性互补问题的一种全局收敛的显式光滑Newton方法

本针对Po函数非线性互补问题，给出了一种显式光滑Newton方法，该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程，并在适当的假设条件下，证明了算法的全局收敛性。     

电路过渡过程的计算机辅助分析

电路过渡过程所列方程是微分方程，本文中采用的是方框图模型分析法，即将微分方程的复杂示解分解成最基本的加（减）、乘（除）、积分（微分）、增益等运算，采用VB设计用户界面产进行计算，并给出了一算例。     

ON A PAIR OF NON-ISOMETRIC ISOSPECTRAL DOMAINS WITH FRACTAL BOUNDARIES AND THE WEYL-BERRY CONJECTURE

ＯＮＡＰＡＩＲＯＦＮＯＮＩＳＯＭＥＴＲＩＣＩＳＯＳＰＥＣＴＲＡＬＤＯＭＡＩＮＳＷＩＴＨＦＲＡＣＴＡＬＢＯＵＮＤＡＲＩＥＳＡＮＤＴＨＥＷＥＹＬＢＥＲＲＹＣＯＮＪＥＣＴＵＲＥＳＬＥＥＭＡＮ，Ｂ．Ｄ．ＣＨＥＮＨＵＡＭａｎｕｓｃｒｉｐｔｒｅｃ...     

The number of powers of 2 in a representation of large even integers II

It is proved that for any integerk≥ 54 000, there isN _k >0 depending onk only such that every even integer ≥N _k is a sum of two odd prime numbers andk powers of 2. Project partially supported by RGC Research Grant (No.HKU 7122/97P) and Post-Doctoral Fellowship of the University of Hong Kong.     

声光效应拉曼-内斯方程矩阵级数解法及声光调制器优化设计

提出一种求解正常声光相互作用拉曼 内斯 (Raman Nath)方程的矩阵级数解法 ,该解法直观方便且具有普遍性。计算结果表明 ,对Q =4 1π ,Bragg衍射的效率只有 97 5 % ;对非对称入射 ,以往的Raman Nath近似解误差较大 ;指出提高Bragg衍射效率的有效途径在于提高声光频率比并给出计算声光器件最优长度的计算公式。     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

Surfaces of Constant Mean Curvature Bounded by Two Planar Curves

In this paper we study constant mean curvature compact surfaces with two Jordan curves in parallel planes as boundary and we investigate the point at which the surface inherits the symmetries of its boundary.     

A semi-analytical numerical method for time-dependent radiative transfer problems in slab geometry with coherent isotropic scattering

We describe a semi-analytical numerical method for coherent isotropic scattering time-dependent radiative transfer problems in slab geometry. This numerical method is based on a combination of two classes of numerical methods: the spectral methods and the Laplace transform (LTS_N) methods applied to the radiative transfer equation in the discrete ordinates (S_N) formulation. The basic idea is to use the essence of the spectral methods and expand the intensity of radiation in a truncated series of Laguerre polynomials in the time variable and then solve recursively the resulting set of “time-independent” S_N problems by using the LTS_N method. We show some numerical experiments for a typical model problem.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.