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.     

网格资源管理系统模型研究

网格资源管理系统是网格计算系统的重要组成部分。文章分析了网格资源管理系统的功能需求，具体论述了该模型的原型系统，最后介绍了相关研究工作。     

可信计算与可信网络

论文对主流的可信计算技术——TCPA和NGSCB进行了分析,并对可信计算平台(TCP)进行了研究,对基于可信计算的可信网络的三个基本属性进行了分析和研究,最后介绍了可信网络的发展现状。     

人工智能的原理及应用

介绍了人工智能的发展，并对改进的神经网络专家系统的优越性做了介绍，指出了神经网络专家系统广阔的应用前景及实现。     

对印制电路板环境冲击评估的研究

随着印制电路板产业飞速发展,其引发的环境问题日益受到广泛的关注。然而长期以来如何有效地进行环境冲击评估是业内研究的重点和难点。而本文采用了一种智能的简化分析方法来进行全面的环境冲击评估,以提高评估的经济效益和准确度,并希望能为决策者提供一个可供参考的环境冲击评估的理念和方法。     

用Delphi实现快速删除TList的批连续结点算法的探讨

在编制遥测数据处理软件的过程中，面对大量的测试数据，经常需要编写高效率的数据过滤器。本文讨论了一种通过采用跨单元、跨类访问Delphi类的私有域的方法实现快速删除TList批连续结点的新算法，并通过测试结果得到验证。     

制造业企业竞争情报系统建设浅析

讨论了制造业企业信息化进程中包含竞争情报系统的必要性。论述了该类企业竞争情报系统的内涵及功能特征。较详细地介绍了相应系统常用外部数据资源内容及各自应用特点;此外本文还简要地说明了该类系统现有开发支持工具软件、开发关键步骤等内容。     

智能机理与软计算

随着计算机科学技术,特别是人工智能及其它相关学科的发展,关于人脑智能机理的研究引起越来越多的注意。与此同时、出现了关于软计算的研究.旨在研制出高机器智商系统(High Maehine Intelli-gene。Qt,,:sen:、产tom)[,〕。本文将初步探索智能机理与软计算两者间的关系以及把它们结合起来解决问题的可能性和途径。     

关于后张预应力混凝土结构优化设计的几个问题

结合UP软件编程实践，本文对后张预应力混凝土结构计算程序中引入优化功能的意义进行了论述，提出了预应力筋与普通钢筋之间的最优搭配关系，优化原点概念及相关影响因素，列出了优化计算程序所应涉及的基本计算内容，并对当前后张预应力混凝土结构设计中的一些观点提出了不同意见。