A Least Squares Approach to Escalator Algorithms for Adaptive Filtering

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

个性化公开密钥系统的设计

论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。     

欧洲主要电信运营商专线资费的演变

欧洲主要电信运营商所处国度的经济和人口布局情况不同，竞争环境也有差别，在专线资费方面的做法也有许多不同之处。考虑到地区之间竞争的差异。目前多数国家都取消了地区交叉补贴的做法，但还有一部分国家仍然坚持统一费率。在资费方面的基本促销手段为接合同年限和用户的支出额打折。从2000年到2003年资费演变的基本情况是；接入费扣2Mbit／s以下较低速率的专线租费保持平稳略有下降，较高速率专线的租费则有较大的下调幅虚。     

基于主体外部轮廓的照片分割算法

在实际应用中常常需要将人像从照片的背景中有效地分割出来，通常的做法是通过提取照片中人像各部分特征来实现分割，其缺陷是计算复杂度较大，分割效果受各种干扰因素影响很大。现提出了一种基于主体外部轮廓信息的照片分割算法，通过梯度锐化、边缘保护、临近像素点相似度比较来确定图像的边界，该算法对于具有相对均匀背景的照片具有较高的计算效率。     

微带型Wilkinson功分器设计与实现

小型低功耗器件是射频电路设计的研究热点,而微带技术具有小型化低功耗的优点,为此在介绍微带型Wilkin-son功分器工作原理的基础上,使用基于矩量法的ADS软件设计、仿真和优化计算相关数据参数,并制作了一个微带功分器实例,最后对加工的样品进行实测,获得与仿真值吻合较好的预期结果。     

利用框架理论对信号进行重建

在Hilbert空间中讨论了框架的一些重要的性质,定义了一个框架算子,并讨论了该算子的性质。根据实际问题构造了一框架,使信号在此框架下的投影正好为非均匀采样值。给出了一种框架界的估计方法和重建原信号的迭代算法,最后,用仿真验证了此算法的有效性。     

基于DOCSIS标准的HFC数据加密算法的分析

基于DOCSIS标准的增强型基线保密性接口（BPI＋）采用56bit DES加密分组数据，采用二密钥三重DES加密通信量加密密钥。这种多重加密技术的应用为HFC网络的数据传输提供了相当于或更好于专线级的网络安全与加密性能。     

一种有效的优化的多载波通信系统的功率分配算法

本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法，该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法，能够较快的收敛到最佳的功率点。同时，易于用硬件和软件实现。     

有耗传输线的TLM模型法

本文从传输线理论出发，介绍了一种解决传输线问题的新方法－－TLM法。