Generalization of the Gram-Charlier/Edgeworth Series and Application to Time-Frequency Analysis

We derive a general equation relating probability densities and as special cases we the obtain Gram-Charlier and Edgeworth series. This allows us to generalize these methods and clarify a number of issues pertaining to both probability theory and time-frequency analysis. In particular we show how the Gram-Charlier and Edgeworth series are related to the kernel method of time-frequency analysis. The approach allows us to construct densities that satisfy given constraints such as joint moments or conditional moments. Also, we show that the kernel has to be signal dependent and that to obtain a proper distribution it should be the ratio of two characteristic functions.     

Stabilization of inter-area and/or oscillatory modes in large-scale power system by voltage impedance power system (VIPS) apparatus based on decentralized control scheme

New technologies such as power electronics have made it possible to change continuously the impedance of a power system not only to control power flow but also to enhance stability. A power system incorporating a variable impedance apparatus such as a variable series capacitor (VSrC) and high-speed phase shifter (HSPS) is called VIPS (Variable Impedance Power System) by the authors. This paper proposes a novel control method of VIPS apparatus such as VSrC and HSPS installed at an interconnecting point for stabilizing inter-area unstable and/or oscillatory modes. The proposed design method of the control system is a kind of hierarchical decentralized control method of a large-scale power system based on a Lyapunov function. Under the proposed control scheme, each subsystem can be stabilized independently by local controllers such as AVR, speed governor and PSS, and then the whole interconnected system can be stabilized by VIPS apparatus taking into account interactions between subsystems. The effectiveness and robustness of the VIPS apparatus control are shown by numerical examples with model systems including a large-scale power system.     

核素心室造影舒张早期功能测定对冠心病估价

用平衡法核素心室造影自动左心室功能测定法检查了２３例正常人、３７例无心肌梗塞（ＣＡＤ－ＮＭＩ）和１４例有心肌梗塞（ＣＡＤ－ＭＩ）冠心病人左心室功能。结果表明，ＰＦＲ反映心肌缺血改变比其他心功能参数敏感。ＣＡＤ－ＮＭＩ组与正常对照组比较，ＰＦＲ的灵敏度为９４．５９％，Ｐ〈０．００１，其他参数的灵敏度依次为ＴＰＦＲ５４．０５％，Ｐ〈０．０１；ＰＥＲ５４．０５，Ｐ〈０．０１；ＴＰＥＲ４９．９５％，Ｐ〈０     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

脉冲化学沉积非晶态Ni—P合金原子分布函数研究

采用Ｘ射线衍射分析技术，研究了脉冲化学镀非晶态Ｎｉ－Ｐ合金的原子分布和函数，得出其短程有序原子集团的尺度为０．７５４ｎｍ，约为熔体激冷法获得的非晶态Ｎｉ－Ｐ合金短程有序畴的１／２。并利用脉冲化学沉积非晶态合金的微机制择这一结果进行了解释。     

Nonlinear adaptive algorithms for equalisation in mobile satellite communications

This paper considers the equalisation problem in Quadrature Phase-Shift Keying (QPSK) modulated signals which have been distorted by the passage through a transmission channel. The channel is modelled as a Rician fading channel to simulate the behaviour of the transmission channel in the mobile satellite context. The equalisation is treated as the generalisation of the channel behaviour, and some algorithms with the structure of an artificial neural network using the Multilayer Perceptron, Volterra Series and Radial Basis Function are described. Results for the BER performance of typical transversal equalisers, with Square-Root Kalman adaptation algorithm, and algorithms with artificial neural network structure are also reported and evaluated. Improved performance is exhibited by the artificial neural network approaches.     

An exploration of the problems of using function points mark II

Abstract. This paper examines critically the function point analysis mark II (FPA mark II) method of measuring the functionality of information systems. Although the focus of the paper is on FPA mark II as devised by Symons, both this and the Albrecht method, from which the FPA mark II was developed, are briefly discussed. The published attempts to validate FPA mark II are reviewed and then the problems encountered by the author in applying the approach are described. The final part of the paper is concerned with the fit between SSADM and FPA mark II.     

聚醚酰亚胺热焓松弛的分子量依赖关系

采用ＤＳＣ对不同分子量的聚醚酰亚胺的等温及动态热焓松弛行为进行了研究，并以ＫＷＷ方程对实验数据进行了非线性拟合。结果表明，分子量对热焓松弛的影响是由高分子端基引起自由体积的差异所致。不同分子量的聚醚酰亚胺分子具有不同数量的端基，淬冷时端基数目的差异将产生不同数量的过剩自由体积，从而影响松弛热焓及松弛速率、低分子量的聚醚酰亚胺松弛相对较快，且起始热焓高，松弛的表观活化能亦较小。     

SMS——智能网的业务管理系统

本文叙述了智能网的业务管理系统所实现的３种功能：业务管理功能，网络管理功能和业务管理访问功能，还介绍了业务管理和网络管理之间的关系，ＳＭＳ的集中式和分布式两种体系结构及业务管理功能的设计方法和进一步研究方向。     

A process oriented semantics of the PRAM-language FORK

The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.

In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model.