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

Method of car-highway barrier crash accident reconstruction

Zhendong yu Chongji/Journal of Vibration and Shock 2007年第5期26卷 38-40+48页

作者： Shen, Jie Jin, Xian-Long Chen, Jian-Guo High Performance Computing Center Shanghai Jiaotong University Shanghai 200030 China State Key Laboratory of Vibration Shock and Noise Ministry of Justice Shanghai Jiaotong University Shanghai 200030 China Institute of Forensic Sciences Ministry of Justice Shanghai 200063 China

A new method of car-highway barrier crash accident reconstruction is presented based on CRASH3 damage algorithm. Because the stiffness of a barrier is easy to obtain, the stiffness coefficients of a vehicle determined by this method is based on residual crush and the velocity before impact is calculated with change of kinetic energy. Also, a detailed FE model of a typical type of highway guardrail is established. Using this model, the dynamic characteristics of this guardrail under vehicle impact are investigated. It's found that the normal contact force between the vehicle and the barrier can be a linear function of the residual crush in most conditions, but the linear relation for the tangential force can only be satisfied in some conditions. Finally, the above-mentioned method is applied to a real-world accident. Compared with PC-CRASH, this method is proved to be feasible for accident reconstruction.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Coverage and Exposure Paths in Wireless Sensor Networks

引用

Journal of Computer Science & technology 2006年第4期21卷 490-495页

作者：黄刘生徐宏力汪炀吴俊敏李虹 Department of Computer Science and Technology University of Science & Technology of China Hefei 230027 P.R. China Anhui Province-Most Co-Key Laboratory of High Performance Computing and Its Application Hefei 230027 P.R. China

Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage and exposure paths for the sensor networks. This paper presents a fully localized algorithm to solve the worst coverage problem first introduced by Meguerdichian et al. The nodes of the sensor network cooperate to construct the worst coverage path only by the one-hop neighbor＇s information, thus avoiding the massive communication and conserving the energy. The correctness of the proposed algorithm is proved formally under the sensing diminishing model. Moreover, this algorithm can be easily extended to solve the minimal exposure problem with local information as well.

关键词： coverage wireless sensor networks localized algorithm exposure

来源：评论

学校读者我要写书评

暂无评论

Study on Parallel computing

引用

Journal of Computer Science & technology 2006年第5期21卷 665-673页

作者：陈国良孙广中张云泉莫则尧 Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 P.R. China Laboratory of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080 P.R. China Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Beijing 100088 P.R. China

In this paper, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoretical base of parallel computing, parallel programming which is the software support of parallel computing. After that, we also introduce some parallel applications and enabling technologies. We argue that parallel computing research should form an integrated methodology of ＂architecture algorithm programming application＂. Only in this way, parallel computing research becomes continuous development and more realistic.

关键词： parallel computing parallel architecture parallel programming parallel algorithm parallel application

来源：评论

学校读者我要写书评

暂无评论

Parallelization and performance tuning of molecular dynamics code with OpenMP

引用

Journal of Central South University of technology 2006年第3期13卷 260-264页

作者：白树仁冉丽萍鲁奎麟 High Performance Computing Center Hunan University Changsha 410012 China State Key Laboratory of Powder Metallurgy Central South UniversityChangsha 410083China Department of Applied Physics Hunan UniversityChangsha 410082China

An OpenMP approach was proposed to parallelize the sequential molecular dynamics(MD) code on shared memory machines. When a code is converted from the sequential form to the parallel form, data dependence is a main problem. A traditional sequential molecular dynamics code is anatomized to find the data dependence segments in it, and the two different methods, i.e., recover method and backward mapping method were used to eliminate those data dependencies in order to realize the parallelization of this sequential MD code. The performance of the parallelized MD code was analyzed by using some performance analysis tools. The results of the test show that the computing size of this code increases sharply form 1 million atoms before parallelization to 20 million atoms after parallelization, and the wall clock during computing is reduced largely. Some hot-spots in this code are found and optimized by improved algorithm. The efficiency of parallel computing is 30% higher than that of before, and the calculation time is saved and larger scale calculation problems are solved.

关键词： system analysis molecular dynamics parallel computing performance tuning OpenMP

来源：评论

学校读者我要写书评

暂无评论

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 - IEEE International Magnetics Conference

作者： Deng, Y. Wang, F. Zhou, K. Wu, S. Center for Grid Computing Cambridge-Cranfteld High Performance Computing Facilities Cranfield University Campus Bedfordshire MK430AL United Kingdom Key Laboratory of Data Storage System Ministry of Education Huazhong University of Science and Technology Wuhan 430074 China

No abstract available

ISBN: (纸本)1424414792

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Group key Management in Grid Environment

Group Key Management in Grid Environment

引用

International Multi-Symposiums on Computer and Computational Sciences (IMSCCS)

作者： Zhi-Dong Shen Xiao-Ping Wu Yu-Hua Wang Wen-Ling Peng Huan-Guo Zhang School of Computer Wuhan University of China Wuhan China Key Laboratory of High-Performance Computing Technology Jiangxi China

Grid manages resources and services distributed across multiple control domains. Grid computing provides people the way to share large mount of distributed resources and services that belong to different local domain. It also makes security problems more complicate, such as in the grid group communication. In this paper, we analyze security requirements of grid environment, especially for the secure group communication. We discuss the group key management for group communication and propose the scheme to implement the flexible secure group key management in grid environment. The algorithm and protocol are presented according to different conditions, and their characteristics are analyzed

关键词： Environmental management Grid computing Communication system security Resource management technology management Distributed control Algorithm design and analysis Computer architecture Distributed computing Laboratories

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Privacy-Preserving Quantitative Association Rules Mining

An Algorithm for Privacy-Preserving Quantitative Association...

引用

IEEE International Symposium on Dependable, Autonomic and Secure computing (DASC)

作者： Weiwei Jing Liusheng Huang Yonglong Luo Weijiang Xu Yifei Yao MOST Co-Key Laboratory of High Performance Computing and Its Application University of Science and Technology Hefei Anhui China

When data mining occurs on distributed data, privacy of parties becomes great concerns. This paper considers the problem of mining quantitative association rules without revealing the private information of parties who compute jointly and share distributed data. The issue is an area of privacy preserving data mining (PPDM) research. Some researchers have considered the case of mining Boolean association rules; however, this method cannot be easily applied to quantitative rules mining. A new secure set union algorithm is proposed in this paper, which unifies the input sets of parties without revealing any element's owner and has lower time cost than existing algorithms. The new algorithm takes the advantages of both in privacy-preserving Boolean association rules mining and in privacy-preserving quantitative association mining. This paper also presents an algorithm for privacy-preserving quantitative association rules mining over horizontally portioned data, based on CF tree and secure sum algorithm. Besides, the analysis of the correctness, the security and the complexity of our algorithms are provided

关键词： Association rules Data mining Partitioning algorithms Data privacy Distributed computing Algorithm design and analysis Laboratories high performance computing Costs Data security

来源：评论

学校读者我要写书评

暂无评论

Structural Pattern Analysis for Texture Synthesis

Structural Pattern Analysis for Texture Synthesis

引用

International Multi-Symposiums on Computer and Computational Sciences (IMSCCS)

作者： Yizhe Li Guoliang Chen Qilong Zheng Department of Computer Science and Technology Anhui Province-MOST Co-Key Laboratory of High Performance Computing and Its Application University of Science and Technology Anhui China

Sample based texture synthesis allows the generation of arbitrarily sized textures based on a small sample image. One main drawback of the technique is that a new pixel or patch is selected only considering local information in the generated texture. Thus structural error can't assure to be avoided for structural textures. To accelerate texture synthesis process and to avoid structural mismatch in the output picture, we present in this paper a structural pattern analysis (SPA) algorithm and a texture synthesis method using the algorithm. The pattern analysis tool also quantizes the texture randomness in macro scope view. It can be used in other applications such as automatic texture classification and quality evaluation of synthesized texture. We illustrate our result with some examples

关键词： Pattern analysis Application software Pattern recognition Acceleration Image processing Computer graphics Image analysis Large-scale systems Computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

New Java memory model L-JMM

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：