A family of lower- and higher-order transversal linearization techniques in non-linear stochastic engineering dynamics

Sample pathwise numerical integration of noise-driven engineering dynamical systems cannot generally be performed beyond a limited level of accuracy, especially when the noise processes are modelled using (filtered) white noises. Recently, a locally transversal linearization (LTL) strategy has been proposed by the author (Proc Roy Soc London A 2001; 457 :539–566) for direct integration of deterministic and stochastic non-linear dynamical systems. The present effort is focussed on a host of extensions along with detailed theoretical error analyses of the linearization approach, especially as applied to problems in non-linear stochastic engineering dynamics. Thus, to begin with, estimates of local and global error orders in the basic LTL scheme are obtained separately for the displacement and velocity vectors when the system is driven either by a set of additive noises or by an arbitrary combination of (independently evolving) additive and multiplicative noises. Following this, a new family of higher-order LTL schemes is proposed in order to improve upon the basic LTL method and the associated error orders are established. A stepwise implementation of the lower- and higher-order versions of the LTL method, along with certain computational aspects, is also outlined. The proposed schemes are numerically illustrated, to a limited extent, for a single degree-of-freedom (SDOF) and a two degree-of-freedom (TDOF) non-linear engineering systems under additive and/or multiplicative white noise excitations. Copyright © 2004 John Wiley & Sons, Ltd.     

Implicit–Explicit Schemes for BGK Kinetic Equations

In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be constructed with this technique. The methods proposed are based on an explicit–implicit time discretization. In particular the convective terms are treated explicitly, while the source terms are implicit. In this fashion even problems with infinite stiffness can be integrated with relatively large time steps. The conservation properties of the schemes are investigated. Numerical results are shown for schemes of order 1, 2 and 5 in space, and up to third-order accurate in time.     

Coordinating production and distribution of jobs with bundling operations

We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries.     

中国的三种非同步轨道卫星移动通信系统星座方案

本文介绍基于我国的三种非同步轨道卫星移动通信系统星座方案：低、中轨系统各有２４和１８颗星，轨道高度分别为１３２６和８０３５ｋｍ，两系统各以５°和３０°的仰角对我国的覆盖率为９９．７８％和９９．９６％；椭圆轨道系统１２颗星，近、远地点分别为４２７和２９０６ｋｍ，以７°和１５°仰角对我国北纬２０°以上地区覆盖率分别为９７．９０％和８９．６１％，若增加４颗中轨卫星，以１５°仰角对我国的覆盖率为９９．９９％。     

Lower bounds on the information rate of secret sharing schemes with homogeneous access structure

We present some new lower bounds on the optimal information rate and on the optimal average information rate of secret sharing schemes with homogeneous access structure. These bounds are found by using some covering constructions and a new parameter, the k-degree of a participant, that is introduced in this paper. Our bounds improve the previous ones in almost all cases.     

Experience with Applying Formal Methods to Protocol Specification and System Architecture

In the last three years or so we at Enterprise Platforms Group at Intel Corporation have been applying formal methods to various problems that arose during the process of defining platform architectures for Intel's processor families. In this paper we give an overview of some of the problems we have worked on, the results we have obtained, and the lessons we have learned. The last topic is addressed mainly from the perspective of platform architects.     

非AWGN环境下调制类型自动识别

在非AWGN环境下，针对CW，AM，FM，OOK，PSK，QPSK，16QAM，FSK，MSK，SSB十种混合调制信号，对调制类型特征提取方法和自动识别算法进行了分析、综合、设计和计算机仿真。提出了梯层电平分析方法、频率瞬时信号分析、剔除载波的归一化能量分析、平方后信号的频谱分析、四次方后的信号频谱分析等方法。当SNR=10dB时，计算机仿真结果是正确识别率不低于95％，自动识别的平均处理时间为不超过10s。     

Onr-partition designs in hamming spaces

The concept of the combinatorial matrix of an unrestricted code and the notion of anr-partition design admitted by a code are introduced and discussed in detail. The theory includes a characterization of completely regular codes, and a combinatorial interpretation of the fact that the distinct rows of the distance distribution matrix of a code are linearly independent. In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined system of linear equations; this is an efficient technique provided the number of classes in the partition is relatively small.     

On the number of broadcast schemes in networks

Broadcasting is the process of spreading one piece of information among a group of individuals connected by an interconnection network. In this paper we give exact lower and upper bounds for the number of broadcast schemes in arbitrary networks. Also, we give the exact value for complete bipartite graphs and an upper bound for regular networks. Based on the counting method we describe a new random algorithm for broadcasting in networks.     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.