检索结果-内蒙古大学图书馆

International Symposium on Parallel Architectures, Algorithms and networks (ISPAN)

作者： Zi Chu Yin-yin Yang Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China Southeast University Nanjing Jiangsu CN Dept. of Comput. Sci. & Eng. Southeast Univ. Nanjing China

Ubicast, an enhanced application-level multicast protocol, is presented in this paper. It is built upon Pastry, a robust and self-organizing peer-to-peer substrate overlay, and leverages its merits of reliable application-level routing and object location. Ubicast is mainly applied to real-time multimedia applications with QoS heterogeneity. It tries to minimize the delay radius of the multicast tree, while meeting different bandwidth requirements. It extends traditional degree-bound model and satisfies nodes' heterogeneous QoS requirements to provide customizable multicast services. Besides, Priority Joining Algorithm based on the concept of potential parents is proposed to limit the number of nodes that a participant needs to probe. The join cost is decreased substantially to guarantee the scalability for a potentially large network topology. Simulation and experimental analysis over large-scale topology confirm the performance improvement of Ubicast which is especially suited for small sized multicast groups.

关键词： Multicast protocols Peer to peer computing network topology Robustness Routing Delay Bandwidth Multicast algorithms Probes Costs

来源：评论

学校读者我要写书评

暂无评论

Dynamic routing based on real-time traffic information in LBS

Dynamic routing based on real-time traffic information in LB...

引用

MIPPR 2005: Geospatial information, Data Mining, and Applications

作者： Zheng, Nianbo Li, Qingquan Song, Ying Research Center of Spatial Information and Network Communication Wuhan University 129 Luoyu Road Wuhan 430079 China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University 129 Luoyu Road Wuhan 430079 China Deparment of Computer and Electronics Science Hubei University of Economics 1 Yanghu Road Wuhan 430205 China

Location based services (LBS) are capturing global spotlights increasingly, in which users tend to pick up navigation service as their favorites. This paper examines the dynamic routing problems based on real-time traffic information in LBS. At first, the overall structure of dynamic navigation system is illustrated, which is composed of four ingredients: traffic data collection, digital road map, static routing and dynamic re-routing. Traffic data collection is the task of traffic information center (TIC), where various sources of data are fused into link travel times that are used as criteria to choose candidates in path determining. Digital road map includes digital road network and historical traffic data, where the topology relationship of road network is elementarily explored and the method to represent statistical traffic data is referred to. Routing with historical traffic data and dynamic re-routing with live traffic data are two main functions of dynamic navigation service. The flow of dynamic re-routing algorithm is exhibited. Lastly, a first-in-first-out (FIFO) time-depend shortest path algorithm is discussed for dynamic routing, which adopts the adaptive A* algorithm based on binary heap priority queue and RB-tree.

关键词： Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

A Mathematical Approach to Disaster Recovery Planning

A Mathematical Approach to Disaster Recovery Planning

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Kun Wang Zhonghai Yin Feng Yuan Lihua Zhou Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an China National Info Security Engineering and Technology Research Center Beijing China

It is crucial for highly security-critical information systems to accurately control the disaster recovery activities. Using optimization theory, we present a disaster recovery planning mathematical model. The model uses mathematical method to express diverse entities in information and disaster recovery system such as applications, facilities, resources, sub disaster recovery plans, budget, etc. It classifies various resources according to their utilization and payment, and identifies the significance of applications and the conflicts among sub disaster recovery plans. Through expressing relationships among applications, facilities, resources and sub plans, this model selects the best set of sub plans. This model has less subjective parameter and can evaluate disaster recovery planning objectively and quantitatively.

关键词： Mathematical model Testing information security information systems Control systems Risk management Technology planning Laboratories computer networks computer science education

来源：评论

学校读者我要写书评

暂无评论

Study of Secure Complicated information System Architecture Model

Study of Secure Complicated Information System Architecture ...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Kun Wang Ruidan Su Zengxin Li Zhen Cai Lihua Zhou Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an China National Info Security Engineering and Technology Research Center Beijing China

Complicated information system (CIS) contains many inhomogeneous applications which require security, interoperability, extensibility. The paper presents a secure CIS architecture model to conduct the construction or reconstruction of CIS. Using layered method, it divides CIS into modules and reduces system complexity. Web service technology is widely adopted in layers to fulfill interoperability and extensibility. It uses encryption support layer, security protection and reliability support layer to guarantee system security and stability in different aspects. It uses system management layer to make CIS administrable. It suits highly security-critical environment such as government and bank. Been properly simplified, it can be applied to relative simple information system too.

关键词： information systems information security Computational Intelligence Society Communication system security National security Electronic government Operating systems Protocols Communication standards computer security

来源：评论

学校读者我要写书评

暂无评论

A Disaster Recovery System Model in an E-government System

A Disaster Recovery System Model in an E-government System

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Kun Wang Lihua Zhou Zhen Cai Zengxin Li Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an China National Info Security Engineering and Technology Research Center Beijing China

We present a Robust Disaster Recovery System Model (RDRSM) for highly security-critical systems to realize continuous service. Through strengthening safe communication ability, RDRSM guarantees secure and reliable command on disaster recovery. It uses selfsupervision function to monitor the integrality and security of system itself. Through GIS, this model makes disaster recovery system easier to use, manage and maintain. RDRSM possesses features of security, robustness and controllability and can be applied to environments such as e-government and bank. This model successfully conducted the construction of an important e-government disaster recovery system, which verified its feasibility and the significance of its components, such as disaster recovery planning, system supervision and robust communication support.

关键词： Electronic government Robustness Communication system security Stability Disaster management computer networks information security Monitoring Geographic information Systems Protection

来源：评论

学校读者我要写书评

暂无评论

Routing algorithm in heterogeneous overlay multicast networks

引用

Ruan Jian Xue Bao/Journal of Software 2005年第6期16卷 1112-1119页

作者： Wu, Jia-Gao Ye, Xiao-Guo Jiang, Ai-Quan Department of Computer Science and Engineering Southeast University Nanjing 210096 China Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

Due to the difficulties in deployment of IP multicast, the overlay multicast networks (OMN) are being increasingly recognized as a viable alternative to construct a general multicast service infrastructure. To settle the heterogeneity of bandwidth required by real-time multimedia application, the multicast routing problem in heterogeneous OMN is discussed. A new network model of heterogeneous OMN is described by extending the degree-constrained model. Adopting the strategy of layered bandwidth allocation, a heuristic routing algorithm, called layered compact tree (LCT) is proposed to build a minimum delay radius multicast tree in heterogeneous OMN. The properties of LCT are also proved and analyzed in theory. The simulation results show that LCT could reduce both hops and network resource usage of the tree effectively, and keep a little increase in delay radius while the allocated bandwidth decreases.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

Method for building survivable network systems

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2005年第SUPPL.期33卷 2336-2341页

作者： Wang, Chao Ma, Jian-Feng Key Laboratory of Computer Network and Information Security Xidian University Xi'an 710071 China

Survivable network systems have the ability to provide continuous and dependable services in the presence of attacks, failures, or accidents. In this paper, we present a method for building survivable network systems. This method can enhance some important properties such as resistance, recognition and recovery for survivable network systems, thereby effectively improving the survivability of network systems. Furthermore, the presented method enables the survivability of network systems independent of one or several system components, and is of great benefit to the protection of those applications of network systems accordingly.

关键词： computer networks

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED BICLUSTERING ALGORITHM AND ITS APPLICATION TO GENE EXPRESSION SPECTRUM ANALYSIS

引用

Genomics, Proteomics & Bioinformatics 2005年第3期3卷 189-193页

作者： Hua Qu Liu-Pu Wang Yan-Chun Liang Chun-Guo Wu College of Software Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China Guangzhou Institute of China Telecom Guangzhou 510630 China College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China Key Laboratory of Information Science and Engineering of the Ministry of Railway/Key Laboratory of Advanced Information Science and Network Technology of Beijing Beijing Jiaotong University Beijing 100044 China.

Cheng and Church algorithm is an important approach in biclustering algorithms. In this paper, the process of the extended space in the second stage of Cheng and Church algorithm is improved and the selections of two important parameters are discussed. The results of the improved algorithm used in the gene expression spectrum analysis show that, compared with Cheng and Church algorithm, the quality of clustering results is enhanced obviously, the mining expression models are better, and the data possess a strong consistency with fluctuation on the condition while the computational time does not increase significantly.

关键词： biclustering algorithm gene expression pedigree analysis Cheng and Church algorithm

来源：评论

学校读者我要写书评

暂无评论

Authenticated public-key encryption based on elliptic curve

Authenticated public-key encryption based on elliptic curve

引用

International Conference on Embedded Software and Systems

作者： Yiliang Han Xiaoyuan Yang Yupu Hu Key Laboratory of Network and Information Security A.P.FDepartment of Electronic Technology Engineering College of A. P. F Xi'an China College of Computer Science Xidian University Xi'an China

An efficient scheme so called authenticated public key encryption that performs signature and encryption simultaneously is designed. The scheme is the first scheme that based on the standardized signature algorithm ECDSA and achieves both privacy and authenticity in the method of ECDLP which is the most practical cryptographic primitive in the future. The scheme saves 78%-82% computation costs in all. It also saves 14% storage costs for current security parameters and 9% storage costs for high level security in average. The saving is significant potentially, especially in power restricted applications such as embedded systems and mobile computing. Arguments show that the scheme is secure at present. Compared with RFC1421 and existed results, the scheme for multiple users also discussed.

关键词： Public key Elliptic curves Secure storage Costs Power system security Privacy Public key cryptography Elliptic curve cryptography Computational efficiency Embedded system

来源：评论

学校读者我要写书评

暂无评论

Improving the quality of 3D-QSAR by using flexible-ligand receptor models

Improving the quality of 3D-QSAR by using flexible-ligand re...

引用

作者： Pei, Jianfeng Chen, Hao Liu, Zhenming Han, Xiaofeng Wang, Qi Shen, Bin Zhou, Jiaju Lai, Luhua State Key Laboratory for Structural Chemistry of Stable and Unstable Species College of Chemistry and Molecular Engineering Peking University Beijing 100871 China Center for Theoretical Biology Peking University Beijing 100871 China Computer Network Information Center Chinese Academy of Sciences Beijing 100080 China Institute of Process Engineering Chinese Academy of Sciences Beijing 100080 China College of Chemistry and Molecular Engineering Peking University Beijing 100871 China

To address the problems associated with molecular conformations and alignments in the 3D-QSAR studies, we have developed the Flexible Ligand - Atomic Receptor Model (FLARM) 2.0 method. The FLARM 2.0 method has three unique features as compared to other pseudoreceptor model methods: (1) the training ligands are flexibly optimized inside the receptors to achieve minimal docking energies;(2) the receptor atoms are spatially moveable in the process of genetic evolving in order to avoid improper initial receptor shapes;and (3) void receptor sites are specially favored in order to obtain open receptor models that allow large gaps. Advantages of an open model include less noise information, a smaller risk of overfitting, and ease of locating the key interaction sites. The latter two features, inherited from the previous FLARM 1.0 method, can improve the predictive ability of the 3D-QSAR models, while the first feature is newly implemented to relieve the uncertainty caused by improper conformation and alignment. Three FLARM 2.0 case studies were performed, and the results show that FLARM 2.0 models are highly predictive and robust. FLARM 2.0 pseudoreceptor models can correspond well with the pharmacophore models and/or the binding sites of the real protein receptors. © 2005 American Chemical Society.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：