Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

WCDMA的MBMS技术

主要介绍了基于WCDMA的MBMS技术,给出了其网络架构和技术难点,并对其应用给无线网络带来的影响作了一定深度的探讨。     

数字图像合成技术综述

数字图像合成一直是图像处理中的研究热点,在图片编辑,平面设计,电影特效等领域有着广泛的应用。从原图像中准确地提取目标物体并将其无缝地合成到新背景下是图像合成的基本目标。按所使用的关键技术分类,现有的数字图像合成技术可分为基于α分量的图像合成,基于梯度场的图像合成和基于多分辨率模型的图像合成。首先详述了3类方法中的典型算法,并从合成质量、鲁棒性、运算效率等方面进行分析比较,然后对新的图像合成应用方式进行了扩展介绍,最后总结了现有图像合成方法的普遍局限性,并探讨了图像合成今后面临的挑战和发展方向。     

基于组播通信的交通通信网络研究

研究交通通信网络,提高网络的吞吐量和数据传输效率。针对传统的单播组网中通信发送者需要多次复制相同的数据包以满足多个接受者同时提出的数据请求,随着数据请求的增多使得发送者的通信负担加重,造成网络拥塞、吞吐量不高的问题。为了解决上述难题,提出基于组播通信的交通通信网络的组网方法。采用Mesh结构构建交通通信网络的组播模型,使得网络节点之间建立有线或无线的连接,然后利用网络编码算法实现网络间的通信,使得源点只需发送一次就可向多个终点成功传输相同的数据。实验表明,组网方法能够有效解决数据请求过多时网络吞吐量不高的问题,同时提高了数据传输的效率,取得了满意的结果。     

精英克隆局部搜索的多目标动态环境经济调度差分进化算法

为有效解决复杂多目标动态环境经济调度问题,提出一种基于精英克隆局部搜索的多目标动态环境经济调度差分进化算法。以传统的差分进化(differential evolution, DE)算法为框架,为了提高DE算法的开采和探索能力,增设精英群的克隆和突变机制,采用动态选择方式确定精英群,有效增强算法的全局搜索能力。数值试验以IEEE-30的10机、15机系统为测试实例,并将提出的算法与三种代表性算法比较。结果表明,新算法所获的Pareto前沿具有较好的收敛性和延展性,可为电力系统调度人员提供更灵活的决策方案。     

真核表达质粒pcDNA3.1(+)-Vasostatin的构建及其在293T细胞中的表达

目的构建真核表达质粒pcDNA3.1(+)-Vasostatin并检测其在真核细胞内的表达水平。方法将带有信号肽的Vasostatin基因片段克隆至pcDNA3.1(+)真核表达载体上,经酶切鉴定及测序分析证明构建成功后,以脂质体介导法转染293T细胞,通过Westernblot法,检测其在293T细胞内的表达水平。结果所构建的真核表达质粒pcDNA3.1(+)-Va-sostatin转染293T细胞后,在其裂解的上清液中,检测到目的基因的表达。结论已成功构建了pcDNA3.1(+)-Vasostatin表达载体,并在真核细胞中表达了目的蛋白。     

刺桐胰蛋白酶抑制剂突变体在大肠杆菌中表达及在tPA纯化中的应用

目的构建刺桐胰蛋白酶抑制剂突变体(rserETI)原核表达载体,制备表达产物,用于tPA的纯化。方法设计合成rserETI编码序列DNA片段,以PCR法扩增出全长编码区序列,经酶切后克隆至pET9a表达载体,转化大肠杆菌JM109DE3,以IPTG诱导表达。表达产物经变性、复性、QFF层析纯化后,测定其活性,并与溴化氰活化的Sepharose偶联合成亲和层析柱,纯化rtPA。结果rserETI的表达量约占大肠杆菌菌体总蛋白的30%,复性率为80%,经QFF层析纯化后,蛋白浓度为1.58mg/ml,SDS-PAGE检测显示无杂蛋白污染,纯度大于95%,对rtPA突变体的抑制比活性为4×104IU/mg。偶联合成的rserETI-Sepharose亲和层析柱能特异性地纯化rtPA,rtPA突变体纯度达96%,比活性为5.07×105IU/mg。结论已成功构建了rserETI原核表达载体,并在大肠杆菌中高效表达,制备的表达产物可用于rtPA的纯化。     

基于Agent的移动组播算法的优化

随着科学技术的飞速发展,作为网络信息领导者的移动通信在日常生活工作中的应用也越来越广泛,但是移动通信在应用中也会遇到很多问题,比如移动网络切换延迟现象较为普遍,组播包的丢包率比较高等等.本文针对于以上问题,分析了多种组播协议,提出了新型的基于Agent的移动组播算法,此算法可以有效地改进切换延迟和丢包率等问题.     

重组人成骨蛋白-1基因在大肠杆菌中的克隆和非诱导表达

目的　研究重组人成骨蛋白 -1(rhOP -1)在大肠杆菌中的克隆和非诱导表达。方法　利用RT -PCR技术 ,从正常胎儿肾组织总cDNA中扩增得到rhOP- 1成熟肽基因片段 ,再将rhOP- 1成熟肽基因克隆于原核融合表达载体pGEX- 4T- 2中 ,构建表达质粒pCCBC- OP- 1,并转化到大肠杆菌JM10 9(DE3)中 ,在发酵过程中不添加任何诱导剂。表达产物经SDS -PAGE分析。结果　扩增的目的基因序列与文献报道一致。表达的目的蛋白相对分子质量为 14 0 0 0 ,表达量达到菌体蛋白的 4 0 %。结论　克隆了人OP -1成熟肽基因 ,并实现了rhOP- 1的非诱导高效表达。     

基于量子克隆的二面体群隐含子群问题量子算法的研究

基于最短向量问题的格公钥密码体制是典型的抗量子计算密码体制。格的唯一最短向量问题可转化为二面体群的隐含子群问题。有效地求解二面体群的隐含子群问题可攻破基于格的唯一最短向量问题的公钥密码体制。Kuperberg提出了二面体群隐含子群问题的半指数级量子算法。通过研究Kuperberg量子算法,利用概率量子克隆,文中提出了二面体群隐含子群问题的多项式时间量子算法。