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

A virtual machine-based invasion detection system for the virtual computing environment

High technology Letters 2006年第4期12卷 379-384页

作者：曾宇 Wang Jie Sun Ninghui Li Jun Nie Hua Research and Development Center for National Intelligence Computing System Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China

Under virtualization idea based on large-scale dismantling and sharing, the implementing of network interconnection of calculation components and storage components by loose coupling, which are tightly coupling in traditional server, achieves computing capacity, storage capacity and service capacity distri- bution according to need in application-level. Under the new server model, the segregation and protection of user space and system space as well as the security monitoring of virtual resources are the important factors of ultimate security guarantee. This article presents a large-scale and expansible distributed invasion detection system of virtual computing environment based on virtual machine. The system supports security monitoring management of global resources and provides uniform view of security attacks under virtual computing environment, thereby protecting the user applications and system security under capacity services domain.

关键词： virtual computing environment oriented virtual machine-based invasion detection system （VIDS） capacity services computing

来源：评论

学校读者我要写书评

暂无评论

NXG05-4: Fast Packet Classification using Group Bit Vector

NXG05-4: Fast Packet Classification using Group Bit Vector

引用

IEEE Globecom 2006

作者： Tong Liu Huawei Li Xiaowei Li Yinhe Han Advanced Test Technology Laboratory Key Laboratory of Computer System anChinesed Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

Packet classification is important in fulfilling the requirements of new services such as policy-based routing in next generation networks. In this paper, we propose a novel bit vector based two-dimensional packet classification algorithm called Group Bit Vector. The key feature of the proposed algorithm is its ability to set the length of the bit vector to perform AND operation (the operation bit vector) regardless of the size of rule databases by effectively aggregating the rules and constructing particular groups of a limited number of members. Moreover, the proposed algorithm avoids the problem of false matches, which may be brought by rules aggregation. Thus, the length of the operation bit vector can be adjusted to be suitable to the width of memories to improve the performance. Experimental results demonstrate the flexibility and effectiveness of the proposed algorithm.

关键词： Classification algorithms Databases Hardware Routing Next generation networking Protocols system testing Computer architecture Electronic mail Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Locality and Parallelism Optimization for Dynamic Programming Algorithm in Bioinformatics

Locality and Parallelism Optimization for Dynamic Programmin...

引用

Supercomputing Conference

作者： Guangming Tan Shengzhong Feng Ninghui Sun Graduate School of Chinese Academy of Sciences China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences China

Dynamic programming has been one of the most efficient approaches to sequence analysis and structure prediction in biology. However, their performance is limited due to the drastic increase in both the number of biological data and variety of the computer architectures. With regard to such predicament, this paper creates excellent algorithms aimed at addressing the challenges of improving memory efficiency and network latency tolerance for nonserial polyadic dynamic programming where the dependences are nonuniform. By relaxing the nonuniform dependences, we proposed a new cache oblivious scheme to enhance its performance on memory hierarchy architectures. Moreover we develop and extend a tiling technique to parallelize this nonserial polyadic dynamic programming using an alternate block-cyclic mapping strategy for balancing the computational and memory load, where an analytical parameterized model is formulated to determine the tile volume size that minimizes the total execution time and an algorithmic transformation is used to schedule the tile to overlap communication with computation to further minimize communication overhead on parallel architectures. The numerical experiments were carried out on several high performance computer systems. The new cache-oblivious dynamic programming algorithm achieve 2-10 speedup and the parallel tiling algorithm with communication-computation overlapping shows a desired potential for fine-grained parallel computing on massively parallel computer systems

关键词： Dynamic programming Heuristic algorithms Bioinformatics Concurrent computing Parallel processing Computer architecture Tiles Sequences Delay Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Content-based 3-D Shape Retrieval for Pervasive computing

Content-based 3-D Shape Retrieval for Pervasive Computing

引用

International Conference on Pervasive computing and Applications (ICPCA)

作者： Dong Xu Hua Li Zongkai Lin Chinese Academy of Sciences China Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Science. lihua@*** Key Laboratory of Intelligent Information Processing Chinese Academy and Sciences China

3D models are a new kind of cross-media resource which can be frequently seen in the network. Since the amount of them is very huge now, content-based retrieval can help to recognize a certain object or retrieve similar ones from the giant database. This paper presents a new method for deriving 3D moment invariants and uses them as shape descriptors for the representation of 3D models. They are insensitive to surface noise and can be used in pervasive environment conveniently. We also illustrate how to build up experimental system and simulate 3D shape retrieval in wireless environment

关键词： Shape Content based retrieval Pervasive computing Information retrieval Humans Internet Application software Laboratories Intelligent networks Computer networks

来源：评论

学校读者我要写书评

暂无评论

A Tamper-resistance key Pre-distribution Scheme for Wireless Sensor Networks

A Tamper-resistance Key Pre-distribution Scheme for Wireless...

引用

International Conference on Grid and Cooperative computing Workshops (GCCW)

作者： Lei Xie Hongsong Zhu Yongjun Xu Yuefei Zhu Institute of Information Engineering Information and Engineering University Zhengzhou China Advanced Test Technology Laboratory Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences Beijing China

Wireless sensor network (WSN), which is integrated with many technologies such as sensor, embedded computing, wireless communication and distributed information processing etc., is becoming an important branch of ubiquitous computing research. WSN is composed of a large number of distributed sensor nodes, so to ensure the sensor nodes dependable is essential to security of whole network. By introducing a lightweight tamper-resistance design based on security co-processor into sensor nodes, this paper loosens up the security assumptions of WSN, and redefines the objectives of WSN security. Based on such secure infrastructure, the paper also proposes a concise and effective key pre-distribution scheme, in which each node needs to send only one cluster key announcement message and cluster key net can be set up within neighborhood

关键词： Wireless sensor networks Pervasive computing Ubiquitous computing Information security Computer networks Computer architecture Sensor arrays Design engineering Laboratories Embedded computing

来源：评论

学校读者我要写书评

暂无评论

Cache based feedback grid scheduling approach

引用

Ruan Jian Xue Bao/Journal of Software 2006年第11期17卷 2314-2323页

作者： Yuan, Ping-Peng Cao, Wen-Zhi Kuang, Ping Service Computing Technology and System Key Laboratory Wuhan 430074 China Cluster and Grid Computing Key Laboratory of Hubei Province Wuhan 430074 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Grid scheduling which aims at improving resource utilization and grid application performance is a key concern in grid. Currently, much research can be found about grid scheduling and some algorithms on it were proposed. However, since grid resources are autonomic, distributed and their status change over time, those scheduling algorithms did not fit for the cases well. In this paper, a cache based feedback grid scheduling (CBFS) approach is presented to capture the dynamics and impact of simultaneously co-allocated tasks in a grid. In this approach, grid scheduler utilizes recent resource performance data, such as recent task submitting time and execution time of task which are kept in cache and a feedback approach to engineer load balancing across multiple grid resources. After comparing this dynamic grid scheduling approach with previous research, it is found that CBFS is more generous than other scheduling approaches. Experimental results demonstrate that this approach diminishes latency and contributes to the overall grid load balancing, which significantly improves resource utilization and response time of tasks.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

A profile-based protein sequence alignment algorithm for a domain clustering database

A profile-based protein sequence alignment algorithm for a d...

引用

IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology (CIBCB)

作者： Lin Xu Fa Zhang Zhiyong Liu Graduate School of Chinese Academy of Sciences China Key Laboratory of Computer System and architecture Institute of Computing Technology Chinese Academy and Sciences China National Natural Science Foundation China

Aiming at the two main shortcomings in Homology Modeling, we have designed and established a domain clustering database. Searching the database is a fundamental work for it. However, current alignment algorithms are mainly based on the sequences, ignoring the structure conservation in domain. This paper proposed a profile-based alignment which considers the structure information into the profile, based on the character of our domain database. We designed an experiment within the database. The results show that both the quality and sensitivity of our scheme are better than pure Smith-Waterman and sequence-based profile algorithms. We strongly believe that this work can help to improve the protein structure prediction

关键词： Protein sequence Clustering algorithms Databases Sequences Heuristic algorithms Laboratories Computer architecture Algorithm design and analysis Computational efficiency Acceleration

来源：评论

学校读者我要写书评

暂无评论

A method to integrate, assess and characterize the protein-protein interactions

A method to integrate, assess and characterize the protein-p...

引用

IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology (CIBCB)

作者： Fa Zhang Lin Xu Jingchun Chen Zhiyong Liu Bo Yuan Key Laboratory of Computer System and architecture the Institute of Computing Technology Chinese Academy and Sciences China Graduate School Chinese Academy and Sciences China Department of Biomedical Informatics Ohio State Uinversity USA National Natural Science Foundation China

Recently, large-scale protein-protein interactions were recovered using the similar two-hybrid system for the model systems. This information allows us to investigate the protein interaction network from a systematic point of view. However, experimentally determined interactions are susceptible to errors. A previous assessment estimated that only ~10% of the interactions can be supported by more than one independent experiment, and about half of the interactions may be false positives. These false positives might unnecessarily link unrelated proteins, resulting in huge apparent interaction clusters, which complicate elucidation for the biological importance of these interactions. Address this problem, we present an approach to integrate, assess and characterize all available protein-protein interactions in model organisms yeast and fly. We first integrate all available protein-protein interaction databases of yeast and fly, and merge all the datasets. We then use machine learning techniques to score the reliability for each interaction, and to rigorously validate the scoring scheme of yeast protein-protein interactions from different aspects. Our results show that this scoring scheme provides a good basis for selecting reliable protein-protein interaction dataset

关键词： Proteins Fungi Databases Electronics packaging Machine learning Genetics Laboratories Biomedical computing Computer architecture Biomedical informatics

来源：评论

学校读者我要写书评

暂无评论

Storage management mechanism for a scalable streaming media system

引用

WSEAS Transactions on Computers 2006年第4期5卷 746-752页

作者： Deng, Yuhui Wang, Frank Feng, Dan Helian, Na Milward, Dave Thompson, Steve Center for Grid Computing Cambridge-Cranfield High Performance Computing Facilities Cranfield University Campus Bedfordshire MK43 0AL United Kingdom Key Laboratory of Data Storage System Ministry of Education Huazhong University of Science and Technology Wuhan 430074 China London Metropolitan University London United Kingdom Xyratex United Kingdom

Streaming media is pervasive on the Internet now and continues to grow rapidly. A large scale streaming media system may demand thousands of disks to satisfy both the bandwidth and storage capacity requirements imposed by thousands of concurrent clients. While performance has long been the focus of large scale storage systems research, manageability has become the dominant criterion in evaluating storage solutions, as the cost of storage management outweighs the cost of the storage devices themselves by a factor of three to eight. This paper designs and implements a highly reliable and available distributed media data oriented innovative Storage Management Mechanism (SMM) in a scalable streaming media system. All heterogeneous storage resources across the system are aggregated as a single logical view which strikes a good balance between a distributed data storage and centralized storage management. The centralized SMM dramatically simplifies the storage administration as the size and complexity of the streaming media system grows. Fault tolerance and dynamic load balance at the disk level and system level are achieved to provide high reliability and availability due to the SMM.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Virtual Storage Image Implementation in a SAN system to Improve Storage Capacity, Fault Tolerance and Bandwidth

Virtual Storage Image Implementation in a SAN System to Impr...

引用

Intermag 2006 (INTERMAG 2006), vol.2

作者： Y. Deng F. Wang K. Zhou S. Wu Center for Grid Computing Cambridge-Cranfield High Performance Computing Facility Cranfield Bedfordshire UK Key Laboratory of Data Storage System Ministry of Education School of Computer Huazhong University of Science and Technology Wuhan China

With a SAN (Storage Area Network), large-capacity storage can be shared among multiple hosts at high speed. The potential market for SAN is enormous, but the technology won't become ubiquitous overnight. The complex administration is indicated by many researches as a key barrier to adopt SAN solutions. This paper designs and implements a virtual storage image (VSI) that aggregates storage space located on heterogeneous storage nodes (see Fig.1)in a Fibre Channel point-to-point (FC-P2P) SAN.

关键词： Image storage Storage area networks Fault tolerant systems Bandwidth File systems Space technology Aggregates Linux Fault tolerance Load management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：