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

2011 International Conference for High Performance Computing, networking, Storage and Analysis, SC11

作者： Wang, Long Jia, Weile Chi, Xuebin Wu, Yue Gao, Weiguo Wang, Lin-Wang Supercomputing Center of Computer Network Information Center Chinese Academy of Sciences No. 4 South 4th Street ZhongGuanCun Beijing China School of Mathematical Sciences Fudan University 220 Handan Road Shanghai 200433 China MOE Key Laboratory of Computational Physical Sciences School of Mathematical Sciences Fudan University 220 Handan Road Shanghai 200433 China Lawrence Berkeley National Laboratory Material Science Division Mail stop 50F One Cyclotron Road Berkeley CA 94720 United States

ISBN: (纸本)9781450307710

In this work, we present our implementation of the density functional theory (DFT) plane wave pseudopotential (PWP) calculations on GPU clusters. This GPU version is developed based on a CPU DFT-PWP code: PEtot, which can calculate up to a thousand atoms on thousands of processors. Our test indicates that the GPU version can have a ∼10 times speed-up over the CPU version. A detail analysis of the speed-up and the scaling on the number of CPU/GPU computing units‡ (up to 256) are presented. The success of our speed-up relies on the adoption a hybrid reciprocal-space and band-index parallelization scheme. As far as we know, this is the first GPU DFT-PWP code scalable to large number of CPU/GPU computing units. We also outlined the future work, and what is needed to further increase the computational speed by another factor of 10. Copyright 2011 ACM.

关键词： Density functional theory

来源：评论

学校读者我要写书评

暂无评论

Based on Ajax technology's online time functional analysis and implementation

Based on Ajax technology's online time functional analysis a...

引用

International Conference on computer Science and Service System (CSSS)

作者： Lei Xia Shujun Zhang School of computer and information technology Beijing key laboratory of advanced information science and network technology Beijing Jiaotong University Beijing China

ISBN: (纸本)9781424497621

With the continuous development of Internet technology and Page Content's Diversity form, Traditional page model Shows its drawbacks. Ajax technology can transfer important information between client and Server-side, that increases the speed of transmission and make the page responds more timely. This technology is widely used in online examination system's design. Text starts from Ajax technology, and that compares with traditional page model, finally, examination timing function is analyzed, and design implementation.

关键词： information technology XML Internet computers Java System analysis and design Educational institutions

来源：评论

学校读者我要写书评

暂无评论

The Evolutionary Dynamics of Apomixis in Ferns: A Case Study from Polystichoid Ferns

引用

Journal of Botany 2012年第1期2012卷

作者： Hong-Mei Liu Robert J. Dyer Zhi-You Guo Zhen Meng Jian-Hui Li Harald Schneider Key Laboratory of Southern Subtropical Plant Diversity Fairylake Botanical Garden Shenzhen & Chinese Academy of Sciences Shenzhen 518004 China Department of Life Sciences Natural History Museum London SW7 5BD UK Research Group in Biodiversity Genomics and Environmental Sciences Imperial College London Silwood Park Campus Ascot Berkshire SL5 7PY UK Department of Biological Sciences Qiannan Normal College for Nationalities Duyun 558000 China Computer Network Information Center Chinese Academy of Sciences Beijing 100190 *** State Key Laboratory of Systematic and Evolutionary Botany Institute of Botany Chinese Academy of Sciences Beijing 100093 ***

The disparate distribution of apomixis between the major plant lineages is arguably one of the most paradoxical phenomena in plant evolution. Ferns are particularly interesting for addressing this issue because apomixis is more frequent than in any other group of plants. Here, we use a phylogenetic framework to explore some aspects of the evolution of apomixis in ferns and in particular in the polystichoid ferns. Our findings indicate that apomixis evolved several times independently in three different clades of polystichoid ferns. A lineage-wide perspective across ferns indicates a correlation between apomixis and the species richness of lineages; however BiSSE tests did not recover evidence for a correlation of apomixis and diversification rates. Instead, evidence was recovered supporting an association between the establishment of apomixis and reticulate evolution, especially in the establishment of triploid hybrids. Diversification time estimates supported the hypothesis of short living apomictic lineages and indicated a link between the establishment of apomixis and the strengthening of the monsoons caused by the lifting of the Qinghai-Tibetan plateau. In general our results supported the hypothesis for the rare establishment of apomictic lineages, high extinction risks, and low speciation rates.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A key management scheme for multicast based on layer 2 control

A key management scheme for multicast based on layer 2 contr...

引用

10th IEEE International Conference on computer and information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Cao, Zheng Yin, Pengpeng Lu, Zhengjun School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network Technology Jiangsu Province Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing 210096 China

ISBN: (纸本)9780769541082

This paper presents a key management scheme for multicast based on layer 2 control, which includes multicast authentication, secure multicast forwarding tree management, key distribution when users are initialized and periodical key updating. This scheme offers a set of methods for key distribution and updating with MLD snooping mechanism and MLD report filtering on access switches. This method reduces the complexity of the key updating problem when members leave the group by layer 2 control and guarantees the efficiency and security of key management. Compared with other schemes, this scheme performs better on computation cost and communication cost than them and has acceptable storage cost. © 2010 IEEE.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Multi-User Private keyword Search for Cloud Computing

Multi-User Private Keyword Search for Cloud Computing

引用

IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Yanjiang Yang Haibing Lu Jian Weng Institute for Infocomm Research Singapore Department of Operations Management and Information Systems The Leavey School of Business Santa Clara University USA State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China Department of Computer Science and Emergency Technology Research Center of Risk Department of Computer Science and Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China

Enterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities.

关键词： Encryption Indexes keyword search Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A robust and secure overlay storage scheme based on erasure coding

A robust and secure overlay storage scheme based on erasure ...

引用

5th International Conference on Pervasive Computing and Applications, ICPCA10

作者： Li, Chuanyou Wang, Yun School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration Nanjing 210096 China

ISBN: (纸本)9781424491421

Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection, encoded strips are stored and dual distinct hash functions are deployed to construct hash chains to protect location information for encoded strips. Simulation results show that with different percentage of malicious peers, by adjusting encoding parameters, the scheme is available to provide durable data storage service. ©2010 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

SOA-based method for cooperative tasks distribution in large-scale optimization environments

SOA-based method for cooperative tasks distribution in large...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Cui, Qiuxiang Zhu, Xia Zhang, Yi Li, Xiaoping School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781424467631

In this paper, operators are encapsulated by services in algorithms for large-scale optimization problems and the services are deployed in distributed systems. Response time is an important factor for the performance of cooperative services. The message parse time is analyzed. Initial service accessing time is the main overhead for service calling. To decrease both the initial time and the response time, SBP (Service Buffering Pool based Scheduling Algorithm) is proposed by integrating a resource pool with a cache. Appropriate number of computing resources can be determined for large-scale optimization problems after analyzing the influence of the number of computing resources on algorithms. The proposed algorithm is compared with a centralized algorithm and a distributed algorithm without cache. Experimental results show that the proposed algorithm has a lower overhead than the other two algorithms. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Digital image hiding arithmetic based on hermite chaotic neural networks

引用

ICIC Express Letters, Part B: Applications 2011年第1期2卷 165-170页

作者： Zou, Ajin Luo, Yixiang Xie, Dongqing Peng, Lingxi Information College Guangdong Ocean University No. 40 East Jiefang Road Xiashan District Zhanjiang 524088 China School of Computer Science Educational Software Guangzhou University No. 230 Wai Huan Xi Road Guangzhou 510006 China Network and Data Security Key Laboratory of Sichuan Province Chengdu 611731 China

An image hidden information algorithm inspired by chaotic neural networks, referred as DiaHao, is presented. The secret information of digital image is XOR en- crypted by chaotic stream cipher sequence that is generated from Hermite chaotic neural networks, and then the chaotic digital watermark is generated;finally, the encryption matrix is embedded to the carrier image. In this way, unauthorized users can not perceive the presence of digital watermarking from the image appearance, which will avoid their illegal attention attacks. These will achieve the secret transfer of confidential information and the purpose of covert communication. The decryption is carried out by the inverse encryption matrix's extraction of hidden watermark information, and then the XOR operation will be done to get the original image. Both the theoretical analysis and simulation experiments show the method's security and invisibility. Furthermore, the algorithm is simple and feasible. © 2011 ISSN 2185-2766.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Large scale plane wave pseudopotential density functional theory calculations on GPU clusters

Large scale plane wave pseudopotential density functional th...

引用

Supercomputing Conference

作者： Long Wang Yue Wu Weile Jia Weiguo Gao Xuebin Chi Lin-Wang Wang Supercomputing Center of Computer Network Information Center Chinese Academy of Sciences Beijing China School of Mathematical Sciences Fudan University Shanghai China MOE Key Laboratory of Computational Physical Sciences School of Mathematical Sciences Fudan University Shanghai China Material Science Division Lawrence Berkeley National Laboratory Berkeley CA USA

In this work, we present our implementation of the density functional theory (DFT) plane wave pseudopotential (PWP) calculations on GPU clusters. This GPU version is developed based on a CPU DFT-PWP code: PEtot, which can calculate up to a thousand atoms on thousands of processors. Our test indicates that the GPU version can have a ~10 times speed-up over the CPU version. A detail analysis of the speed-up and the scaling on the number of CPU/GPU computing units (up to 256) are presented. The success of our speed-up relies on the adoption a hybrid reciprocal-space and band-index parallelization scheme. As far as we know, this is the first GPU DFT-PWP code scalable to large number of CPU/GPU computing units. We also outlined the future work, and what is needed to further increase the computational speed by another factor of 10.

关键词： Graphics processing unit Wave functions Discrete Fourier transforms Vectors Indexes Mathematical model

来源：评论

学校读者我要写书评

暂无评论

A load adaptive IEEE 802.11e EDCA backoff scheme with enhanced service differentiation

A load adaptive IEEE 802.11e EDCA backoff scheme with enhanc...

引用

2010 IEEE 12th International Conference on Communication Technology, ICCT'2010

作者： Dong, Yongqiang Wang, Yun Xia, Qin School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing 210096 China

ISBN: (纸本)9781424468690

In view of the disadvantages of IEEE 802.11e EDCA in QoS guarantee and collision avoidance, an enhanced EDCA scheme called SD-AEDCA is presented which dynamically adjusts two EDCA parameters, namely contention window (CW) and backoff time counter (BC), according to channel load conditions and QoS requirements of network services. SD-AEDCA makes improvements to EDCA backoff scheme from post-backoff, upon-collision and post-transmission phases respectively by differentiating real-time and non real-time frames. Specifically, frozen rate is calculated to estimate the channel load conditions during EDCA backoff process and then used to guide CW and BC adjustment. And the waiting time is explored deliberately to satisfy the transmission latency requirements of real-time frames. Simulation results show that SD-AEDCA improves network throughput by reducing transmission collisions and provides more satisfactory QoS to real-time services at heavy load conditions. © 2010 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：