数据通信中常用的安全加密技术

基于对称密钥加密、公开密钥加密以及安全单向散列函数等基本安全技术和算法,数据通信通常采用以下几种安全加密技术来解决其应用中遇到的安全问题:采用数字信封技术保证数据的传输安全;采用数字签名和双重数字签名技术进行身份认证并同时保证数据的完整性、完成防抵赖;采用口令字技术或公开密钥技术进行身份认证.     

The dual bases for the Bézier-Said-Wang type generalized Ball polynomial bases and their applications

A unifying representation for the existing generalized Ball bases and the Bernstein bases are given. Then the dual bases for the Bézier-Said-Wang type generalized bases (BSWGB for short) are presented. The Marsden identity and the mutual transformation formulas between Bézier curve and Bézier-Said-Wang type generalized curve (BSWGB curve) are also given. These results are very useful for the applications of BSWGB curves and their popularization in CAGD. Numerical examples are also given to show the effectiveness of our methods.     

Obtaining the dividends-penalty identities by interpretation

The dividends-penalty identity is a relation between three functions: the discounted penalty function without dividends, the discounted penalty function if a barrier dividend strategy is applied, and the expected discounted dividends until ruin. The classical model of risk theory is modified in that the deterministic premiums are replaced by a compound Poisson process with exponential jumps. In this model, the dividends-penalty identity is new and can be derived by interpretation. Then the dividends-penalty identity in the classical model is obtained as a limit.     

一个新的高维向量Lie代数及其应用

构造了一个新的8维向量Lie代数,通过适当设计等谱问题,利用屠格式和扩展的迹恒等式得到了AKNS族的可积耦合及Hamilton结构.     

An efficient contention resolution algorithm for input queuing atm cross-connect switches

This paper describes an efficient contention resolution algorithm and its distributed implementation for large capacity input queuing cross-connect switches, which will establish virtual paths in future broadband ATM networks. The algorithm dynamically allocates sending time to cells held in input queues when no contention is indicated in the designated output ports. An expression for the mean delay and the cell loss probability for random traffic are derived through an approximate analysis. Input cells are served on a first-come, first-served basis as conventional contention resolution algorithms whose throughput saturates at 58 per cent because of head of line blocking in input queues. The proposed algorithm achieves a maximum throughput of 76 per cent.     

虚拟机在课程实验中应用综述

高校教育中对实际操作能力要求越来越高,但现实情况是由于受到设备和资金方面的制约很多课程的实验教学达不到课程要求。利用虚拟机可以解决实验中设备不足的局面,完成教学要求。     

Embedded design based virtual instrument program for positron beam automation

Automation of positron beam experiment with a single chip embedded design using a programmable system on chip (PSoC) which provides easy interfacing of the high-voltage DC power supply is reported. Virtual Instrument (VI) control program written in Visual Basic 6.0 ensures the following functions (i) adjusting of sample high voltage by interacting with the programmed PSoC hardware, (ii) control of personal computer (PC) based multi channel analyzer (MCA) card for energy spectroscopy, (iii) analysis of the obtained spectrum to extract the relevant line shape parameters, (iv) plotting of relevant parameters and (v) saving the file in the appropriate format. The present study highlights the hardware features of the PSoC hardware module as well as the control of MCA and other units through programming in Visual Basic.     

Schur Q-polynomials, multiple hypergeometric series and enumeration of marked shifted tableaux

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic hypergeometric series, and as determinants and pfaffians of continuous q-ultraspherical or continuous q-Jacobi polynomials. As special cases, we obtain simple closed formulas for staircase-type partitions.     

On the Analysis of the Virtual Waiting Time in Open Queueing Networks

The model of an open queueing network in heavy traffic has been developed. These models are mathematical models of computer networks in heavy traffic. A limit theorem has been presented for the virtual waiting time of a customer in heavy traffic in open queueing networks. Finally, we present an application of the theorem—a reliability model from computer network practice.     

A note on a paper “A regularization method for the proximal point algorithm”

In this note, a small gap is corrected in the proof of H.K. Xu [Theorem 3.3, A regularization method for the proximal point algorithm, J. Glob. Optim. 36, 115–125 (2006)], and some strict restriction is removed also.