Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

A high performance crashworthiness simulation system based on GPU

Crashworthiness simulation system is one of the key computer-aided engineering (CAE) tools for the automobile industry and implies two potential conflicting requirements: accuracy and efficiency. A parallel crashworthiness simulation system based on graphics processing unit (GPU) architecture and the explicit finite element (FE) method is developed in this work. Implementation details with compute unified device architecture (CUDA) are considered. The entire parallel simulation system involves a parallel hierarchy-territory contact-searching algorithm (HITA) and a parallel penalty contact force calculation algorithm. Three basic GPU-based parallel strategies are suggested to meet the natural parallelism of the explicit FE algorithm. Two free GPU-based numerical calculation libraries, cuBLAS and Thrust, are introduced to decrease the difficulty of programming. Furthermore, a mixed array and a thread map to element strategy are proposed to improve the performance of the test pairs searching. The outer loop of the nested loop through the mixed array is unrolled to realize parallel searching. An efficient storage strategy based on data sorting is presented to realize data transfer between different hierarchies with coalesced access during the contact pairs searching. A thread map to element pattern is implemented to calculate the penetrations and the penetration forces; a double float atomic operation is used to scatter contact forces. The simulation results of the three different models based on the Intel Core i7-930 and the NVIDIA GeForce GTX 580 demonstrate the precision and efficiency of this developed parallel crashworthiness simulation system.     

Animations showing Lego manipulative tasks: Three potential moderators of effectiveness

Evidence suggests that transient visual information, such as animations, may be more challenging to learn than static visualizations. However, when a procedural-manipulative task is involved, our evolved embodied cognition seems to reverse this transitory challenge. Hence, for object manipulative tasks, instructional animations may be more suitable than statics. We investigated this argument further by comparing animations with statics using a Lego task shown to university students, by examining three potential moderators of effectiveness: (a) the environment of manipulation (virtual or physical), (b) the quality of visual information (focused or unfocused), and (c) the presence of hands (no hands or with hands). In Experiment 1 we found an advantage of animation over statics, and no differences among the environments. In Experiment 2, we again observed an animation advantage, a small advantage of focused static information compared to unfocused static information, and a positive effect of not showing the hands.     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

一种新的TDRSS扩频调制方式的研究

本文讨论跟踪及数字中继卫星系统（TDRSS）一种新通信体制，即并行MSK扩频系统，发射端采用长短码正交扩频的平衡调制，接收端采用一种简单解扩方式简化了并行MSK信号的解调，同时用短码全“1”引导长码同步的方法大大减小了长码的捕获时间，实验结果证明了良好的伪码同步性能。     

近期河北冶金工业结构调整形势与任务

分析了河北冶金近期行业发展特别关注的几个问题：钢铁生产发展过快；产业结构缺陷，资源供应和环境压力。同时，文章从分析国内外市场形势和国家宏观政策形势入手，提出了河北冶金工业对产品结构调整，工艺装备调整和组织结构调整的必要性，任务和需注意的问题。     

椭圆型偏微分方程的加法Schwarz方法

1.引 言 古典加法Schwarz方法(ASM)对于一般问题收敛很慢,在大多数情况下, ASM只能作为预条件子.另一方面,ASM的并行性能非常好,尤其适合大规模粗粒度并行计算,近年来随着并行机系统及并行计算的兴起,ASM重新受到重视.许多学者研究了怎样提高ASM的收敛速度[1,2,4].他们发现加法Schwarz方法之所以收敛慢是由于在内边界上采用     

热衷于国际标准活动--全球社会标准化机构肩负的任务

根据美国国家标准学会 (ANSI)理事会主席、ISO现任主席OliverR .Smoot在日本东京召开的国际标准化协议会上的讲演整理。