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

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2006年第4期43卷 738-743页

作者： Wu, Junmin Chen, Guoliang Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Co-Key Laboratory of High Performance Computing and Application University of Science and Technology of China Hefei 230027 China

Java memory model (JMM) is an important topic in Java language and Java virtual machine (JVM) design. But the memory model in Java specification can't guarantee the safely running of Java multithread code. It needs memory coherence, which imposes constraints that prohibit JVM implementation optimization. To fix the problem of Java memory model in Java specification, a new Java memory model, L-JMM, is proposed, which is based on location consistency. This model extends the location consistency to adapt the features of Java technology. It also defines the rule of Java multithread memory operation, including ordinary variable rule, volatile variable rule, final variable rule and synchronization rule. It is proved that this memory model has the same property as location consistency. It can guarantee the correctness for Java multithread code. It can also improve the performance of Java virtual machine. Finally, the simulation of this memory model in the simulator MMS verifies that the new model boasts a better performance than the Java specification memory model does.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Ejected particle cluster detection algorithm and its application

引用

Jisuan Wuli/Chinese Journal of Computational Physics 2006年第4期23卷 441-446页

作者： Zhang, Ying Chen, Qi-Feng Cao, Xiao-Lin Cai, Ling-Cang Chen, Dong-Quan Lu, Tie-Cheng Key Laboratory of Radiation Physics and Technology Department of Physics Sichuan University Chengdu 610064 China Laboratory for Shock Wave and Detonation Physics Research Institute of Fluid Physics Mianyang 621900 China State Key Laboratory of Computational Physics High Performance Computing Center Institute of Applied Physics and Computational Mathematics Beijing 100088 China

Based on the cluster multiple labeling technique, a novel cluster detection algorithm is presented as an analysis subroutine in two-and three-dimensional molecular dynamic simulations of ejecta that take place as a planar shock wave encounters a free metal surface. The algorithm is described, tested, and used to detect cluster distribution of ejecta from copper and aluminum under a shock loading. The information obtained about the size, distribution, evolution of the cluster is helpful in the understanding of ejection.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Electronic voting scheme

引用

Ruan Jian Xue Bao/Journal of Software 2005年第10期16卷 1805-1810页

作者： Li, Yan-Jiang Ma, Chuan-Gui Huang, Liu-Sheng Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Department of Applied Mathematics PLA Information Engineering University Zhengzhou 450002 China Anhui Province-MOST Co-Key Laboratory of High Performance Computing and Application Hefei 230027 China

A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exists adaptive adversaries, this scheme can guard the ballot's producing, encrypting, transmitting, decrypting and final tallying in spite of the adversaries's attack, so the scheme guarantees robustness. In this paper, the verifiability of the voters' qualification and talliers' identification will be solved by a dynamic multi-secret sharing scheme without invoking more zero knowledge proof to maintain privacy, universal verifiability, and anonymity of ballots. It holds more communication efficiency and more security than the proposed schemes in early time.

关键词： Electronic communities

来源：评论

学校读者我要写书评

暂无评论

Solving constrained traveling salesman problems by genetic algorithms

引用

自然科学进展(英文版) 2004年第7期14卷 631-637页

作者： WU Chunguo LIANG Yanchun LEE Heowpueh LU Chun LIN Wuzhong College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education of China Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore

Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches based on modified genetic algorithms (GA) for solving these constrained TSPs are presented. Numerical experiments demonstrate that the algorithm for the open route TSP shows its advantages when the open route is required, the algorithm for the end-fixed TSP can deal with route optimization with constraint of fixed ends effectively, and the algorithm for the path-constraint could benefit the traffic problems where some cities cannot be visited from each other.

关键词： constrained traveling salesman problem genetic algorithm Hamiltonian path open route fixed end

来源：评论

学校读者我要写书评

暂无评论

Study on optimization of agent initial positions in land combat simulation

引用

自然科学进展(英文版) 2004年第3期14卷 257-261页

作者： WU Chunguo LIANG Yanchun LEE Heow Pueh LU Chun Yang Xiaowei College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore Department of Applied Mathematics South China University of Technology Guangzhou 510640 China Centre for ACES Department of Mechanical Engineering National University of Singapore 119260 Singapore

The use of computational-intelligence-based techniques in the optimization of agent initial positions in land combat simulations is studied. A novel method for the reduction of support vectors in the support vector machine (SVM) is presented. The optimization on the width of the Gaussian kernel function and the combination of the SVM with the radial basis function neural network are performed in the proposed method. Simulation results show that the proposed method can improve the running efficiency drastically compared with that using the traditional SVM with the same precision. We also summarize and present some experiences and trends in the study on the optimization problem in land combat simulation.

关键词： multi-agent support vector machine radial basis function genetic algorithm regression

来源：评论

学校读者我要写书评

暂无评论

A modified integer-coding genetic algorithm for job shop scheduling problem

A modified integer-coding genetic algorithm for job shop sch...

引用

8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004

作者： Wu, Chunguo Xiang, Wei Liang, Yanchun Lee, Heow Pueh Zhou, Chunguang College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun130012 China Institute of High Performance Computing Singapore117528 Singapore

ISBN: (纸本)3540228179

An operation template is proposed in this paper for describing the mapping between operations and a subset of natural numbers. With such operation template, a job shop scheduling problem (JSSP) can be transformed into a traveling salesman problem (TSP), hence the integer-coding genetic algorithm for TSP can be easily applied and modified. A decoding strategy, called virtual job shop, is proposed to evaluate the fitness of the individual in GA population. The integration of the operation template and virtual job shop makes the existing integer-coding GA possible for solving an extension of a classical job shop scheduling problem. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A hybrid algorithm for combining forecasting based on AFTER-PSO

A hybrid algorithm for combining forecasting based on AFTER-...

引用

8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004: Trends in Artificial Intelligence

作者： Feng, Xiaoyue Liang, Yanchun Sun, Yanfeng Lee, Heow Pueh Zhou, Chunguang Wang, Yan Key Laboratory of Symbol Computation and Knowledge Engineering Juin University Ministry of Education Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore

ISBN: (纸本)3540228179

A novel hybrid algorithm based on the AFTER (Aggregated forecast through exponential re-weighting) and the modified particle swarm optimization (PSO) is proposed. The combining weights in the hybrid algorithm are trained by the modified PSO. The linear constraints are added in the PSO to ensure that the sum of the combining weights is equal to one. Simulated results on the prediction of the stocks data show the effectiveness of the hybrid algorithm. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

A new scalable parallel method for molecular dynamics based on cell-block data structure

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3358卷 757-764页

作者： Cao, Xiaolin Mo, Zeyao High Performance Computing Center State Key Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics P. O. Box 8009 100088 Bei-Jing China

A scalable parallel algorithm especially for large-scale three dimensional simulations with seriously non-uniform particles distributions is presented. In particular, based on cell-block data structures, this algorithm uses Hilbert space filling curve to convert three-dimensional domain decomposition for load distribution across processors into one-dimensional load balancing problems for which measurement-based multilevel averaging weights(MAW) method can be applied successfully. Against inverse space-filling partitioning(ISP), MAW redistributes blocks by monitoring change of total load in each processor. Numerical experimental results have shown that MAW is superior to ISP in rendering balanced load for large-scale multi-medium MD simulation in high temperature and high pressure physics. Excellent scalability was demonstrated, with a speedup larger than 200 with 240 processors of one MPP. The largest run with 1.1×109 particles on 500 processors took 80 seconds per time step. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

A new scalable parallel method for molecular dynamics based on cell-block data structure 04

引用

Proceedings of the Second international conference on Parallel and Distributed Processing and Applications

作者： Xiaolin Cao Zeyao Mo High Performance Computing Center State Key Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Bei-Jing P. R. China

ISBN: (纸本)9783540241287

A scalable parallel algorithm especially for large-scale three dimensional simulations with seriously non-uniform particles distributions is presented. In particular, based on cell-block data structures, this algorithm uses Hilbert space filling curve to convert three-dimensional domain decomposition for load distribution across processors into one-dimensional load balancing problems for which measurement-based multilevel averaging weights(MAW) method can be applied successfully. Against inverse space-filling partitioning(ISP), MAW redistributes blocks by monitoring change of total load in each processor. Numerical experimental results have shown that MAW is superior to ISP in rendering balanced load for large-scale multi-medium MD simulation in high temperature and high pressure physics. Excellent scalability was demonstrated, with a speedup larger than 200 with 240 processors of one MPP. The largest run with 1.1 × 109 particles on 500 processors took 80 seconds per time step.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：