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

Self-adaptive method dealing with the end issue of EMD

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2007年第10期35卷 1944-1948页

作者： Shao, Chen-Xi Wang, Jian Fan, Jin-Feng Yang, Ming Wang, Zi-Cai MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei 230026 China Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Control and Simulation Center Harbin Institute of Technology Harbin 150001 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

The empirical mode decomposition (EMD) developed by Huang etc. of NASA is an advanced method for signal analysis. But there is an involved end issue in the course of getting two envelops of the data using spline interpolation. A self-adaptive method to dealing with the end issue is proposed. Generally, it extends the externa sequence near the ends of the data by the most suited sequence in the inner data. For the chosen inner sequence has the most similarity of tendency with the ends, the data extension is reasonable. After the extension, the spline does not swing at both ends of the data. The result of experiment proved that the method can be used to solve the end issue effectively.

关键词： Signal analysis

来源：评论

学校读者我要写书评

暂无评论

Improved adaptive buffer replacement algorithm used for second level buffer

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2007年第8期44卷 1331-1338页

作者： Sun, Guozhong Yuan, Qingbo Chen, Mingyu Fan, Jianping National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Acad. of Sci. Beijing 100080 China Graduate University Chinese Acad. of Sci. Beijing 100049 China Key Laboratory of Computer System and Architecture Chinese Acad. of Sci. Beijing 100080 China Institute of Computing Technology Chinese Acad. of Sci. Beijing 100080 China

In a cluster or a database server system, the performance of some data intensive applications will be degraded much because of the limited local memory and large amount of interactions with slow disk. In high speed network, utilizing remote memory of other nodes or customized memory server to be as second level buffer can decrease access numbers to disks and benefit application performance. With second level buffer mode, this paper made some improvements for a recently proposed buffer cache replacement algorithm-LIRS, and brings forward an adaptive algorithm-LIRS-A. LIRS-A can adaptively adjust itself according to application characteristic, thus the problem of not suiting for time locality of LIRS is avoided. In TPC-H benchmarks, LIRS-A could improve hit rate over LIRS by 7.2% at most. In a Groupby query with network stream analyzing database, LIRS-A could improve hit rate over LIRS by 31.2% at most. When compared with other algorithms, LIRS-A also show similar or better performance.

关键词： Buffer storage

来源：评论

学校读者我要写书评

暂无评论

3D model retrieval based on polar-radius surface moment invariants

引用

Ruan Jian Xue Bao/Journal of Software 2007年第SUPPL.期18卷 71-76页

作者： Li, Zong-Min Liu, Yu-Jie Li, Hua School of Computer Science and Communication Engineering China University of Petroleum Dongying 257061 China Key Laboratory Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

In this paper, a 3D polar-radius surface moment is proposed, and is used for 3D model retrieval. 3D polar-radius surface moments are new moment invariants based on 3D polar-radius moments including the invariance on shift, rotation and scale transforms. Compared to previous methods to compute such moments, the computational complexity for calculating 3D moments can be decreased considerably. With the help of these moment invariants, the 3D models are distinguished accurately.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Oil spill detection from thermal anomaly using ASTER data in Yinggehai of Hainan, China

Oil spill detection from thermal anomaly using ASTER data in...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Guoyin Cai Jian Wu Yong Xue Wei Wan Xiaoxia Huang School of Geomatics and Urban Information Beijing University of Civil Engineering and Architecture Beijing China Beijing Information Technology College Beijing China Department of Computing London Metropolitan University London UK Institute of Remote Sensing Applications Chinese Academy of Sciences 3State Key Laboratory of Remote Sensing Science Institute of Remote Sensing Applications of Chinese Academy of Sciences and Beijing Normal University Beijing China

The detection of oil spill is very important for the oil exploration. Remote sensing technology is one of the methods to detect the potential oil basin, especially in a large region. High resolution satellite images can be used as an approach of early oil exploration because its visualized, continuous and macroscopical characteristics. In this paper, the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) data were used to detect the possible oil regions in the Yinggehai area of Hainan Province, China from thermal anomaly including sea surface temperature and apparent thermal inertia. By comparing with the drilling materials, our results show that the area with oil spill has a lower temperature and higher thermal inertia values than the surrounding areas. It indicates that our derived sea surface temperature and apparent thermal inertia anomaly just reflect the above mentioned status and the method can be used to detect the potential oil basin.

关键词： Petroleum Ocean temperature Sea surface Remote sensing Space technology Image resolution Satellite broadcasting Data visualization Reflection Radiometry

来源：评论

学校读者我要写书评

暂无评论

Direct clustering algorithm based on generalized information distance

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2007年第4期44卷 674-679页

作者： Ding, Shifei Shi, Zhongzhi Jin, Fengxiang Xia, Shixiong College of Computer Science and Technology China University of Mining and Technology Xuzhou 221008 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China College of Geoinformation Science and Engineering Shandong University of Science and Technology Qingdao 266510 China

In this paper a novel direct clustering algorithm based on generalized information distance (GID) is put forward. Firstly, based on information theory, a basic concept of measure of diversity is given and an inequality about measure of diversity is proved. Based on this inequality, a concept of increment of diversity is discussed and a defined. Secondly, by analyzing distance measure, two new concepts of generalized information distance (GID) and improved generalized information distance (IGID) are proposed, and a new direct clustering algorithm based on GID and IGID is designed. Finally this algorithm is applied to soil fertility data processing, and compared with hierarchical clustering algorithm (HCA). The results of simulation application show that the algorithm presented here is feasible and effective. Because of simplicity of algorithm and robustness. It provides a new research approach for studies of pattern recognition theory.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Quick multi-objective evolutionary algorithm based on dominating tree

引用

Ruan Jian Xue Bao/Journal of Software 2007年第3期18卷 505-516页

作者： Shi, Chuan Li, Qing-Yong Shi, Zhong-Zhi Key Laboratory of Intelligent Information Process Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Graduate School Chinese Academy of Sciences Beijing 100049 China School of Computer and Information Technology Beijing Jiaotong University Beijing 100044 China

To solve the time-consuming problem of the fitness assignment in the multi-objective evolutionary algorithm, this paper proposes a novel fitness assignment-dominating tree. The dominating tree preserves the necessary relationships among individuals, contains the density information implicitly, and reduces the comparisons among individuals distinctly. In addition, a smart eliminating strategy based on the dominating tree maintains the diversity of the population without extra expenses. A new multi-objective evolutionary algorithm based on dominating tree is proposed on these innovations. By examining three performance metrics on six test problems, the new algorithm is found to be competitive with SPEA2 and NSGA-II in terms of converging to the true Pareto front and maintaining the diversity of the population, moreover, it is much faster than other two algorithms.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Parallel Error Detection for Leading Zero Anticipation

引用

Journal of computer Science & technology 2006年第6期21卷 901-906页

作者：张戈胡伟武齐子初 Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China Graduate University of the Chinese Academy of Sciences Beijing 100039 P.R. China

The algorithm and its implementation of the leading zero anticipation （LZA） are very vital for the performance of a high-speed floating-point adder in today＇s state of art microprocessor design. Unfortunately, in predicting ＂shift amount＂ by a conventional LZA design, the result could be off by one position. This paper presents a novel parallel error detection algorithm for a general-case LZA. The proposed approach enables parallel execution of conventional LZA and its error detection, so that the error-indicatlon signal can be generated earlier in the stage of normalization, thus reducing the critical path and improving overall performance. The circuit implementation of this algorithm also shows its advantages of area and power compared with other previous work.

关键词： computer arithmetic floating-point addition leading zero anticipation

来源：评论

学校读者我要写书评

暂无评论

Locality and parallelism optimization for dynamic programming algorithm in bioinformatics

Locality and parallelism optimization for dynamic programmin...

引用

2006 ACM/IEEE Conference on Supercomputing, SC'06

作者： Tan, Guangming Feng, Shengzhong Sun, Ninghui Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Graduate School Chinese Academy of Sciences

ISBN: (纸本)0769527000

Dynamic programming has been one of the most efficient approaches to sequence analysis and structure prediction in biology. However, their performance is limited due to the drastic increase in both the number of biological data and variety of the computer architectures. With regard to such predicament, this paper creates excellent algorithms aimed at addressing the challenges of improving memory efficiency and network latency tolerance for nonserial polyadic dynamic programming where the dependences are nonuniform. By relaxing the nonuniform dependences, we proposed a new cache oblivious scheme to enhance its performance on memory hierarchy architectures. Moreover we develop and extend a tiling technique to parallelize this nonserial polyadic dynamic programming using an alternate block-cyclic mapping strategy for balancing the computational and memory load, where an analytical parameterized model is formulated to determine the tile volume size that minimizes the total execution time and an algorithmic transformation is used to schedule the tile to overlap communication with computation to further minimize communication overhead on parallel architectures. The numerical experiments were carried out on several high performance computer systems. The new cache-oblivious dynamic programming algorithm achieve 2-10 speedup and the parallel tiling algorithm with communication-computation overlapping shows a desired potential for fine-grained parallel computing on massively parallel computer systems. © 2006 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A multi-criteria programming model for intelligent tutoring planning

引用

10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006

作者： Ruihong, Shi Peng, Lu Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Graduate School Chinese Academy of Sciences China College of Computer Science and Technology Beijing Institute of Technology China

ISBN: (纸本)3540465359

This paper proposed a practical approach to personalized tutoring planning by exploiting existing tutoring resources (e.g., a book, a courseware). More exactly, it does not build an instructional course from scratch - from the domain curriculum, as most Intelligent Tutoring Systems (ITS) do. Instead, information in the curriculum model is used as metadata, together with other metadata, to describe tutoring resources. Given a learning requirement (learning objectives and/or constraints), it finds out the most appropriate tutoring resource(s) and proposes a proper learning sequence of them. Based on the proposed fuzzy instructional model and learner model, the tutoring planning problem is defined as a multi-criteria programming (MCP) model. © Springer-Verlag Berlin Heidelberg 2006.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：