采用区内C／I平衡的多区峰窝CDMA系统下行链路的性能

本文对采用区内Ｃ／Ｉ平衡的多区蜂窝ＣＤＭＡ系统下行链路的性能进行分析，给出两种区内Ｃ／Ｉ平衡算法并比较它们的性能，考虑呈对数正态分布的阴影和Ｒ＾－４规律的路径损失的综合影响，采用与传统不同的小区平均中断概率来评价系统的性能。     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Sequential Decoding of Convolutional Codes for Rayleigh Fading Channels

The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50×50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

VRPTW的扰动恢复及其TABU SEARCH算法

本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.     

Affine-scaling for linear programs with free variables

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.     

采用多元化的教学手段,提高物理人才的综合素质——南开大学物理学基础科学人才培养基地建设经验介绍

介绍了南开大学国家物理学基础科学研究人才培养基地在十多年的建设中,通过多元化的教学手段提高学生的学习自主性,通过加强科研训练提高物理人才综合素质的经验和取得的成果.     

一个可切实服务于运营商的移动无线因特网

本文在简单介绍了移动IP及其路由优化，无线局域网（WLAN）和GPRS的基础上，提出了一个新的利用移动IP来融合WLAN和GPRS的移动无线因特网的网络结构，详细论述了其多连接的路由过程，平滑垂直切换，AAA，并做了简要的性能分析。     

移动通信系统中有效的身份认证方案和支付协议

文中给出了一个基于公钥密码的有效的身份认证和密钥交换协议，该协议可以实现通信双方的相互认证，产生的会话密钥对通信双方是公正的，且会话密钥的产生不需要其他第三方的参与，协议的结构简单，执行效率高：在此协议基础上设计了一个适用于移动通信系统的小额支付协议。     

IPv6与欧洲

在推进IPv6的问题上,亚洲表现的最为积极,这是因为亚洲各国承受着巨大的IP地址方面的压力。欧洲虽然在这方面没有这样大的压力,但在互联网方面一直落后于美国,这是欧洲所不甘心的。因此,欧洲在推进IPv6方面也做了许多工作。欧洲推进IPv6的基本策略是先移动,后固定,并实施了一系列的行动计划和项目。欧洲面临的挑战主要是已经部署了数量巨大的网元、操作系统与软件应用必须予以更新、互通或取代,需要仔细规划和大量投资。