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

Solving traveling salesman problems by genetic algorithms

自然科学进展（英文版） 2003年第2期13卷 135-141页

作者： LIANG Yanchun GE Hongwei Zhou Chunguang LEE Heow Pueh LIN Wuzhong LIM Siak Piang LEE Kwok Hong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Institute of High Performance Computing Singapore 117528 Singapore College of Mathematics Science Jilin University Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Department of Mechanical Engineering National University of Singapore Singapore 119260 Singapore

The gene section ordering on solving traveling salesman problems is analyzed by numerical experiments. Some improved crossover operations are presented. Several combinations of genetic operations are examined and the functions of these operations are analyzed. The essentiality of the ordering of the gene section and the significance of the evolutionary inversion operation are discussed. Some results and conclusions are obtained and given, which provide useful information for the implementation of the genetic operations for solving the traveling salesman problem.

关键词： genetic algorithms traveling salesman problem gene section evolutionary inversion genetic operations

来源：评论

学校读者我要写书评

暂无评论

Implementation of a dynamic adjustment mechanism with efficient replica selection in data grid environments 06

Implementation of a dynamic adjustment mechanism with effici...

引用

2006 ACM Symposium on Applied computing

作者： Yang, Chao-Tung Yang, I.-Hsien Chen, Chun-Hsiang Wang, Shih-Yu High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan

ISBN: (纸本)1595931082

The co-allocation architecture was developed in order to enable parallel downloading of datasets from multiple servers. Several co-allocation strategies have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the final block, makes it important to reduce differences in finishing time among replica servers. In this paper, we propose a dynamic coallocation scheme, namely Recursive-Adjustment Co-Allocation scheme, to improve the performance of data transfer in Data Grids. Our approach reduces the idle time spent waiting for the slowest server and decreases data transfer completion time. We also provide an effective scheme for reducing the cost of reassembling data blocks. Copyright 2006 ACM.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Path problems in temporal graphs 40th

Path problems in temporal graphs

引用

Proceedings of the 40th International Conference on Very Large Data Bases, VLDB 2014

作者： Wu, Huanhuan Cheng, James Huang, Silu Ke, Yiping Lu, Yi Xu, Yanyan Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Institute of High Performance Computing Singapore

Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient or even flawed in a temporal graph, as the temporal information determines the order of activities along any path. In this paper, we show the shortcomings of classic shortest path in a temporal graph, and study various concepts of "shortest" path for temporal graphs. computing these temporal paths is challenging as subpaths of a "shortest" path may not be "shortest" in a temporal graph. We investigate properties of the temporal paths and propose efficient algorithms to compute them. We tested our algorithms on real world temporal graphs to verify their efficiency, and also show that temporal paths are essential for studying temporal graphs by comparing shortest paths in normal static graphs. © 2014 VLDB Endowment.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

An e-learning platform based on grid architecture

An e-learning platform based on grid architecture

引用

作者： Yang, Chao-Tung Ho, Hsin-Chuan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 407 Taiwan Department of Computer Science and Information Engineering Tunghai University Lizen High School Taichung Taiwan

The overall popularity of the Internet has helped e-learning become a hot method for learning in recent years. Over the Internet, learners can freely absorb new knowledge without restrictions on time or place. Many companies have adopted e-learning to train their employees. An e-learning system can make an enterprise more competitive by increasing the knowledge of its employees. E-learning has been shown to have impressive potential in e-commerce. At present, most e-learning environment architectures use single computers or servers as their structural foundations. As soon as their work loads increase, their software and hardware must be updated or renewed. This is a big burden on organizations that lack sufficient funds. Thus, in this study we employ a kind of Grid computing technology, called the "Data Grid" to integrate idle computer resources in enterprises into e-learning platforms, thus eliminating the need to purchase costly high-level servers and other equipment.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Self-consistent simulation of quantum dot flash memory device with SiO 2 and HfO2 dielectrics

引用

International Journal of Nanoscience 2005年第2期4卷 171-178页

作者： Chong, Chee Ching Zhou, Kai Hong Bai, Ping Li, Er. Ping Samudra, Ganesh S. Institute of High Performance Computing Singapore Science Park II 1 Science Park Road Singapore 117528 Department of Electrical and Computer Engineering National University of Singapore 10 Kent Ridge Crescent Singapore 119260

Flash memory structure in which a silicon quantum dot embedded in the gate dielectric region between the channel and the control gate is considered. A self-consistent simulation for such memory devices is performed and aims to understand the relationship between the device structure and the meaningful quantities, as required for an efficient device operation. In this study, both the traditional SiO2 and HfO2 high-k dielectrics are being explored, and their results are compared and contrasted. In particular, the superiority of HfO2 over the SiO2 is demonstrated through various interlocking investigations on the relationships between the tunneling current, dielectric thickness, barrier height, programming and retention times. © World Scientific Publishing Company.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

Towards a performance-portable fft library for heterogeneous computing 14

Towards a performance-portable fft library for heterogeneous...

引用

11th ACM International Conference on computing Frontiers, CF 2014

作者： Del Mundo, Carlo Feng, Wu-Chun NSF Center for High-Performance Reconfigurable Computing Department of Electrical and Computer Engineering United States Department of Computer Science Blacksburg VA United States

ISBN: (纸本)9781450328708

The fast Fourier transform (FFT), a spectral method that computes the discrete Fourier transform and its inverse, per-vades many applications in digital signal processing, such as imaging, tomography, and software-dened radio. Its impor-tance has caused the research community to expend signi-cant resources to accelerate the FFT, of which FFTW is the most prominent example. With the emergence of the graph-ics processing unit (GPU) as a massively parallel computing device for high performance, we seek to identify architecture-aware optimizations across two different generations of high-end AMD and NVIDIA GPUs, namely the AMD Radeon HD 6970 and HD 7970 and the NVIDIA Tesla C2075 and K20c, respectively, to accelerate FFT performance. Despite architectural differences across GPU generations and vendors, we identify the following optimizations, when applied individually and in isolation of one another, as be-ing the most effective in accelerating FFT performance: (1) register preloading, (2) transposition via local memory, and (3) 8-or 16-byte vector access and scalar arithmetic. We then demonstrate the effcacy of combining individual opti-mizations together and nd that the most effective combi-nation of optimizations across all architectures encompasses register preloading, transposition via local memory, and use of constant memory. Our study suggests that FFT per-formance on GPUs is primarily limited by global memory data transfer. Overall, our optimizations deliver speed-ups as high as 31.5 over a baseline GPU implementation and 9.1 over a multithreaded FFTW CPU implementation with AVX vector extensions. © is held by the owner/authors.

关键词： Digital radio

来源：评论

学校读者我要写书评

暂无评论

PaaS: A revolution for information technology platforms

PaaS: A revolution for information technology platforms

引用

2010 International Conference on Educational and Network Technology, ICENT 2010

作者： Lv, Chengtong Li, Qing Lei, Zhou Peng, Junjie Zhang, Wu Wang, Tingting Department of Computer Engineering and Science Shanghai University Shanghai China High Performance Computing Center Shanghai University Shanghai China

ISBN: (纸本)9781424476619

Cloud computing has been extremely tropical in the past few years. Both academic and industrial people have shown great interest in this area. Platform as a Service, which is the core application of cloud computing technologies, has got much attention as well. In this article, from the basic concept of PaaS, we analyze the basic characteristics of PaaS, and describe the current research status. Also we've discussed the future trends of Information Technology platforms. Then, we conclude the models of application developing based on PaaS. Finally, we've brought out the key technologies when realizing a PaaS platform. © 2010 IEEE.

关键词： Platform as a Service (PaaS)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Design and Development of a GPU-accelerated Radar Simulator for Space Debris Monitoring 21

The Design and Development of a GPU-accelerated Radar Simula...

引用

5th high performance computing and Cluster Technologies Conference, HPCCT 2021

作者： Martin, Mogamat Yaaseen Winberg, Simon Lucas Gaffar, Mohammed Yunus Abdul Macleod, David Department of Electrical Engineering University of Cape Town South Africa Advanced Computer Engineering Lab Centre for High Performance Computing South Africa

ISBN: (纸本)9781450390132

The problem of space debris represents a major topic of concern in astronomy as the threat of space junk continues to grow, and the accuracy of its tracking is greatly restricted by the insufficiency and limitations of current surveillance sensors. This article presents the development of an open-source, high-performance, signal-level radar simulator to assist in modelling the detection and tracking of space debris from terrestrial radar stations, including multistatic installations where the transmitter and receiver may be separated by many kilometers. This tool is expected to aid astronomers and researchers in space situational awareness, supporting the modelling of radar interactions in this context and simulation-based exploration of radar designs for space surveillance. It makes use of an accelerated orbit propagation technique with measured two-line element datasets being used to define space debris objects. The software has been named the Space Object Astrodynamics and Radar Simulator - or SOARS - and both the transmitted and received signals generated by the application have been shown to agree with theoretical expectations. Additionally, SOARS is presently undergoing continued development, extension and optimization for heterogeneous computing platforms, enabling the use of the NVIDIA® Compute Unified Device Architecture (CUDA) interface. Results have demonstrated promising speed-ups in simulation runtimes when using the CUDA version of the application over the original sequential version, even on lower-end graphics processors. It is anticipated that the developed application will be used for the design and testing of radar sensors for space situational awareness applications, as well as for use in research, teaching and training environments. © 2021 ACM.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：