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.     

分类挖掘技术在高校人事管理中的应用

探讨分类挖掘技术在高校实际工作中的应用方式与应用领域。以高校人事管理为模型，应用数据挖掘中决策树算法，对高校人力资源数据源中的信息进行分析，发现其中有价值的数据模式，寻找其中存在的关系和规则，对高校人才规划提供比较客观的决策支持。     

浅谈亚欧海底光缆S2段远供电源(PFE)及其维护管理

以亚欧海底光缆S2段为例,介绍亚欧海底光缆远供电源(PFE)的供电方式,以及其在正常运行时和故障维修时的维护管理方法。探讨在实际维护中如何贯彻落实及灵活运用系统联合维护文档,总结适合中国国情的远供电源维护经验,确保亚欧海底光缆远供电源安全稳定运行。     

周宁水电站工程项目管理实践

福建周宁水电站工程由闽东水电开发有限公司负责项目管理。该项目严格按照《招投标法》进行工程和设备的招标,进行了多项设计优化,注重工程质量和安全文明生产,积极开展达标投产工作,实现了进度快、质量优、投资省、效益好的管理目标。     

全球3G市场管制政策分析

主要对各国3G许可证与使用技术标准的抽绑政策．各国对2G／3G网络漫游的管制规定。以及3G网络之间共享的种类及实施方式等方面做了详尽的讲解，并进行比较和分析。     

设计管理信息系统的提出及其面临的问题

从管理和设计的两个方面出发，通过对现代企业产品设计管理信息系统的探讨，阐明了设计管理信息系统的概念和结构；并对其实施的条件及面临的困难进行了系统的分析。     

构建高扩展性的县级广电宽带数据网络

提出在县市级广电宽带数据网络的建设过程中,要着眼业务发展,突出高扩展性,构建基于标准、扩展灵活的主干网,实现网络建设的可持续性发展,并结合实际,从核心设备、端口、中继带宽、网络业务4个方面对扩展能力进行了阐述.     

移动网络中的独立式安全管理系统

本文提出一种适用于移动网络的安全管理系统,由于访问网络能够独立地对漫游用户进行认证,所以称该系统为独立式安全管理(ISM).基于ISM设计一种漫游用户的认证协议,通过对协议的比较分析可以看出,相对于其它安全管理系统,ISM的突出优点是安全责任划分清晰、认证效率高.     

DEA评价方法在超稠油生产经营中的应用探讨

超稠油的生产工艺非常复杂，影响油井效益的因素相对较多，因此对油井的评价就要评价各类有限资源投入的利用效果，查明积极因素和消极因素及其对经济指标的影响程度，促进经营管理的改善，寻求有效利用有限人力、物力、财力等资源的途径，实现资源的优化配置。本文通过使用DEA模型可对单井效益进行评价，对单井效益进行排队，对规模效益进行分类，对生产各投入因素进行投影分析，研究弱DEA、非DEA有效的原因，寻求对油井优化成本、提高效益的改进方案。     

Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.