数字移动通信中的多址方式分析

文中较系统地论述了数字移动通信中的几种多址方式,并对它们的主要性能进行了分析比较,得出了一些有益的结论。     

一种计算卷积码自由距离的快速算法

本文给出了一种计算卷积码自由距离的快速算法,该算法把遗传算法与模拟退火有机结合并根据随机概率来控制算法的运行,避免了优化迟钝与盲目现象,提出了该算法的收敛质量和速度,模拟结果表明：与已有算法相比,本算法具有更好可靠性,有效性和稳定性。     

Low Temperature Behavior of a Two-Dimensional Quantum Antiferromagnet

We analyze the two-dimensional antiferromagnet with a quantum disordered ground state and a gap to bosonic excitations with finite spin. The zero temperature (T = 0) quantum phase transition is studied, and the finite temperature effects are also considered in the low temperature approximation of the Renormalization Group Method. The violation of the universality expected for d = 2 system has been shown to be logarithmic for T = 0 and T 0. We showed that chemical potential and the ground state energy depends on the interaction parameters at T = 0 and T 0. but this dependence is logarithmic.     

Symbolic dynamics of a chaotic neuron model

Chaotic neurons change their internal state according to a bimodal map, and when they communicate with other neurons their internal state is transformed into one of two separate outputs, firing or resting. We address and investigate the topological entropy of the two-valued output of the chaotic neuron from two different viewpoints: the dependence upon the parameters of the neurons, and the relationship to their threshold. From the former viewpoint, we clarify the mechanism that changes the shift space corresponding to the time series of the neuronal output. From the latter viewpoint, we examine the effect of small fluctuations on the threshold of the chaotic neuron. This work was presented in part at the 7th International Symposium on Artificial Life and Robotics, Oita, Japan, January 16–18, 2002     

A parallel algorithm for generating chain code of objects in binary images

This paper addresses parallel execution of chain code generation on a linear array architecture. The contours in the proposed algorithm are viewed as a set of edges (or contour segments) that can be traced by a top-down contour tracing method to generate the chain codes for the outer and inner object contours. A parallel algorithm that contains the chain code generating rules and operations needed is also described, and the algorithm is mapped onto a one-dimensional systolic array containing processing elements (PEs) to devise this architecture. The architecture extracts the contours of objects and quickly generates the corresponding chain codes after the image data in all rows are inputted in a linear fashion. The total processing time for generating the chain codes in an N×N image is O(3N). By doing so, the real-time requirement is fulfilled and its execution time is independent of the image content. In addition, a partition method is developed to process an image when the parallel architecture has a fixed number of PEs; say two or more. The total execution time for an N×N image by employing a fixed number of PEs is N(N+1)/M+2(M−1), when M is the fixed number of PEs.     

美国ANSI/AISC SSPEC-2002《钢结构建筑抗震设计规定》介绍(1)

20 0 2年 1月 31日 ,美国钢结构协会 (AISC)和AISC规范委员会正式批准发布《钢结构建筑抗震设计规定》。在此 ,重点介绍该“规定”中“钢结构建筑”部分的第 1、3～ 7各个章节的主要内容 ,包括“规定”适用的范围、荷载、材料及节点连接等 ,对有关内容做了必要的说明。其他章节内容将在后续介绍中与读者共飨。     

Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page

Consider a set of n advertisements (hereafter called ads) A ={A₁,...,A_n} competing to be placed in a planning horizon which is divided into N time intervals called slots. An ad A _i is specified by its size s _i and frequency w _i. The size s _i represents the amount of space the ad occupies in a slot. Ad A _i is said to be scheduled if exactly w _i copies of A _i are placed in the slots subject to the restriction that a slot contains at most one copy of an ad. In this paper, we consider two problems. The MINSPACE problem minimizes the maximum fullness among all slots in a feasible schedule where the fullness of a slot is the sum of the sizes of ads assigned to the slot. For the MAXSPACE problem, in addition, we are given a common maximum fullness S for all slots. The total size of the ads placed in a slot cannot exceed S. The objective is to find a feasible schedule of ads such that the total occupied slot space is maximized. We examine the complexity status of both problems and provide heuristics with performance guarantees.     

基于GF(qN)上秩距离码的校验矩阵的验证方案

J.Stern(1996)在“公钥验证的一个新范例”中基于GF（2）上纠错码的校验矩阵提出了一验证方案。该文基于GF（q^N)(q为素数）上秩距离码的校验矩阵提出了一新的验证方案,将J.Stern的方案中对秘密数据s的重量限制改为对s秩的限制;证明了在随机预方模型中给出的协议是零知识交互证明,并显示出通过参数的适当选取,此方案比J.Stern的方案更安全。     

空时编码及其在第3代移动通信中的应用

近年来,为了提高无线频谱的利用率,一些学者提出了一种结合分集发送、调制和编码的空时码.文中分别介绍了空时格栅编码和空时分组编码的编译码方法,并介绍了目前空时分组编码在第3代移动通信中的应用.     

平面广告图形设计中的悖谬

广告中悖谬思维并不是对逻辑的背叛,也不是反对思维的既定秩序,而是使受众从相反的方面来认识广告中最为本质的东西,从思维的对立面去寻找新的创意方法,打破固有的思维定式,这也是对广告创作思维逻辑性的发展与完善。