Scheduling Algorithms for Packet-Oriented MAC Protocols in Wireless Multimedia Systems

Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD.     

CDMA系统的网络优化

CDMA技术已经成为下一代移动通信的主流技术，CDMA网络的建设也初具规模。移动网络的优化则是实际运营过程中的一个重要环节。文中试图反映CDMA网络优化的一般原理，阐述了CDMA网络优化时需要考虑的几个主要问题，介绍了优化时需要调整的一些关键参数。     

Capacity Efficiency and Restorability of Path Protection and Rerouting in WDM Networks Subject to Dual Failures

Resilient optical networks are predominately designed to protect against single failures of fiber links. But in larger networks, operators also see dual failures. As the capacity was planned for single failures, disconnections can occur by dual failures even if enough topological connectivity is provided. In our approach the design of the network minimizes the average loss caused by dual failures, while single failures are still fully survived. High dual failure restorability is the primary aim, capacity is optimized in a second step. For WDM networks with full wavelength conversion, we formulate mixed integer linear programming models for dedicated path protection, shared (backup) path protection, and path rerouting with and without stub-release. For larger problem instances in path rerouting, we propose two heuristics. Computational results indicate that the connectivity is of much more importance for high restorability values than the overall protection capacity. Shared protection has similar restorability levels as dedicated protection while the capacity is comparable to rerouting. Rerouting surpasses the protection mechanisms in restorability and comes close to 100% dual failure survivability. Compared to single failure planning, both shared path protection and rerouting need significantly more capacity in dual failure planning.     

重复压裂气井产能模拟研究

由于重复压裂气井原有裂缝的失效程度难以评价。导致重复压裂气井的产能预测常常有很大的误差。为此，根据重复压裂气井的压前产量和舍水率，拟合了原有裂缝的有效率，在考虑新裂缝和原有裂缝共同作用的情况下，建立了气、水两相平面二维的裂缝-油藏数学模型，通过对模型的数值求解，对重复压裂气井进行了产能评价。研究表明，在考虑新、老裂缝共同作用下的产能评价方法，能更为准确地预测重复压裂后的生产动态情况，对压裂时机的确定、压后经济效益的预测都具有重要的指导意义。     

数字电视的条件接收系统

数字电视的兴起使人们能够欣赏到高质量的电视节目,伴随数字电视的成熟,条件接收系统(CAS)得到很好的发展。主要介绍数字电视条件接收系统相关技术的发展、基本功能、安全机制、工作原理及其安全性要求。     

创建互联网业务价值链

为促进互联网的良性发展,要使设备制造商、电信运营商、虚拟运营商/集团用户、内容提供商和最终用户构成一条互联网业务价值链,价值链的创建对互联网接入设备提出了更高的要求,华为公司的Quid-wayTMA8010Expert多业务综合接入平台可构建宽带城域网分组语音解决方案、可平滑演进为下一代网络中的媒体网关、提供窄带价值链、提供唯一号码业务以及实现多业务综合接入。     

一种实现最佳用户检测的非线性优化神经网络

本文提出并讨论了实现码分多址（CDMA）系统上最佳多用户检测（MUD）的一种神经网络方法。该方法通过将最佳多用户检测视为非线性优化组合问题，利用神经网络能有效求解非线性优化问题的优势，导出了一种非线性优化神经网络来实现最佳多用户检测，理论分析和计算机模拟表明，所提出的神经网络具有可实时应用的动态性能和较传统方法优越得多的误码率性能和抗多址干扰的性能。     

UHF频段卫星移动通信系统若干问题的探讨

本文根据我国陆海空移动用户的需求与特点，借鉴国外经验，提出了建设ＵＨＦ频段卫星移动通信系统的建议；对照已建成的Ｃ波段卫星固定通信系统，分析了其优缺点；最后深入探讨了应用中的若干技术问题。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

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

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