Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.     

基于mobile agent的分布式网络自管理模型

为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题，提出了一种网络自管理模型，从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理；提出了管理定位服务这一关键技术，在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务；采用可伸缩的分布式体系结构，适应了大规模网络的规模可变性等特点；基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。     

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

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

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

动力环境网络监控精细管理

叙述动力环境运行质量分析管理，包括故障管理，性能管理和专题分析管理，以动力环境网络监控细致八微、言之有据的月度分析管理实例展现了其精细管理的效果。     

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

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

多服务组的流媒体安全通信机制

提出了一种基于多服务组的流媒体安全通信机制.现有的方案一般是针对用户只参加一个多播组的通信,很少涉及到一个用户同时参加多个多播组的通信,而且没有提供有效的发送方身份验证机制.本文提出了一种具有发送方身份验证功能的一个用户同时可以参加多个组通信的方案,大大地降低了用户和服务器的存储开销,与传统的密钥树方案相比,用户的存储开销降低为原来的l/lgn(n为组中的用户数目),有良好的可扩展性.另外,本机制实现了可靠的发送方身份验证功能.     

面向应用的无线传感器网络

结合具体的应用环境分析了无线传感器网络发展到第二阶段需要考虑的重点问题；探讨了基于上述应用需求的无线传感器网络的协议栈结构和今后的研究方向。