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

Parallel algorithm of CCD image matching based on statistical shape models

Guangdianzi Jiguang/Journal of Optoelectronics Laser 2012年第6期23卷 1196-1200页

作者： Wang, Ri-Wei Wen, Xian-Bin Zhang, Hua Liu, Feng-Lian Zou, Yong-Liao Zheng, Yong-Chun Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China National Astronomical Observatories Chinese Academy of Sciences Beijing 100012 China

Fast CCD image matching is a key technology to achieve lunar three-dimensional reconstruction in China's lunar exploration project. In this paper, according to some available researches, a parallel CCD image matching algorithm based on statistical model has been presented and implemented. In the algorithm, we study the load balancing problem for CCD image matching at first, and then we establish tasks decomposition method, which uses image data division. At last, we build a task scheduling strategy for CCD image matching algorithm, which not noly reduces the communication consumption, but also achieves better load balancing. Experiments show that the parallel matching algorithm for CCD image has good speedup and scalability. The algorithm is suitable for the ultra-large-scale CCD image matching.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Computation pattern driven reuse of manual optimizations for GPGPUs

Computation pattern driven reuse of manual optimizations for...

引用

2011 12th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2011

作者： Xu, Shixiong Han, Dongni Chen, Li Key Laboratory of Computer System and Architecture Institute of Computing Technology University of Chinese Beijing China

ISBN: (纸本)9780769545646

The wide application of General Purpose Graphic Processing Units (GPGPUs) results in large manual efforts on porting and optimizing algorithms on them. However, most existing automatic ways of generating GPGPU code fail to conduct optimization strategies regarding a specific computation and to reuse constantly evolving manual optimizations. In this paper, we present a computation pattern driven approach for computation-specific GPGPU code generation and optimization, which in turn reuses manual optimizations to a certain extent. We suggest language extensions to OpenMP, high-level data structure attributes, in order to assist the process of computation pattern matching and to help give users intuitive performance tuning parameters in the view of data structure attributes. We illustrate the feasibility of this approach through three important computation dwarfs, which are dense matrix, sparse matrix, and structured mesh computation in scientific computing. We also build a prototype OpenMP-to-CUDA translator that consists of computation pattern recognition and code template instantiation. The experimental results demonstrate the performance benefits of computation pattern driven method. To our best knowledge, it is the first work on reusing manual optimizations for GPGPUs with computation pattern driven approach. © 2011 IEEE.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Dynamic Walking of AIBO with Hopf Oscillators

引用

Chinese Journal of Mechanical Engineering 2011年第4期24卷 612-617页

作者： ZHANG Jiaqi TOMIZUKA Masayoshi CHEN Qijun LIU Chengju College of Electronic Information and Engineering Tongji University Shanghai 201804 China College of Electronic Information andEngineering Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

More and more biological evidences have been found that neural networks in the spinal cord, referred to as ＂central pattern generators＂（CPGs）, govern locomotion. CPGs are capable of producing rhythmic movements, such as swimming, flying, and walking, even when isolated from the brain and sensory inputs. If we could build up any models that have similar functions as CPGs, it will be much easier to design better locomotion for robots. In this paper, a self-training environment is designed and through genetic algorithm （GA）, walking trajectories for every foot of AIBO are generated at first. With this acquired walking pattern, AIBO gets its fastest locomotion speed. Then, this walking pattern is taken as a reference to build CPGs with Hopf oscillators. By changing corresponding parameters, the frequencies and the amplitudes of CPGs＇ outputs can be adjusted online. The limit cycle behavior of Hopf oscillators ensures the online adjustment and the walking stability against perturbation as well. This property suggests a strong adaptive capacity to real environments for robots. At last, simulations are carried on in Webots and verify the proposed method.

关键词： central pattern generators（CPGs） Hopf Oscillators walking control AIBO Webots

来源：评论

学校读者我要写书评

暂无评论

Quantized robust H-two filtering for Markovian jump linear systems over networks with nonaccessible mode information

引用

控制理论与应用（英文版） 2011年第4期9卷 505-512页

作者： Tao LIU Qijun CHEN Hao ZHANG Iko MIYAZAWA Department of Electronics and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai 201804 China Department of Machine Control Technology Kanagawa Industrial Technology Center Kanagawa 243-0435 Japan

This paper is concerned with the problems of H-two filtering for discrete-time Markovian jump linear systems subject to logarithmic quantization. We assume that only the output of the system is available, and therefore the mode information is nonaccessible. In this paper, a mode-independent quantized H-two filter is designed such that filter error system is stochastically stable. To this end, sufficient conditions for the existence of an upper bound of H-two norm are presented in terms of linear matrix inequalities. Considering uncertainty of system matrices, a robust H-two filter is designed. The proposed method is also applicable to cover the case where the transition probability matrix is not exactly known but belongs to a given polytope. Finally, numerical examples are provided to demonstrate the effectiveness of the proposed approach.

关键词： Markovian jump linear systems Quantized robust H-two filter Mode independent Sector bound approach Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

Discussion on the assessment strategy of action recognition algorithms

引用

Guangdianzi Jiguang/Journal of Optoelectronics Laser 2012年第6期23卷 1166-1172页

作者： Gao, Zan Zhang, Hua Cai, An-Ni Key Laboratory of Computer Vision and System of Tianjin and Ministry of Education Tianjin University of Technology Tianjin 300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300384 China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing 100876 China

Action recognition is a hot research topic, but the performance assessment strategies of algorithms have not had an accepted practice. In this paper, we adopt spatio-temporal features and support vector machine (SVM) model as our action recognition algorithm, and then well assess the effect of different assessment strategies on our action recognition algorithm in widely used public dataset KTH. Experimental results show that when different cross-experimental methods are employed, the performance fluctuation of algorithms reaches 10.5%. And when different division methods for KTH datasets are used, the performance fluctuation of algorithms gets 11.87%. Thus, according to conclusions in this paper, we can find the real difference among existing algorithms, and supply the reference for designing reasonable assessment strategy.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Modeling and Analyzing the Reliability and Cost of service Composition in the IoT: A Probabilistic Approach

Modeling and Analyzing the Reliability and Cost of Service C...

引用

IEEE International Conference on Web services (ICWS)

作者： Lixing Li Zhi Jin Ge Li Liwei Zheng Qiang Wei Academy of Mathematics and System Science Chinese Academy of Sciences Beijing P. R. China Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of Education Beijing P.R. China School of Computing Science Beijing Information Science & Technology University Beijing P.R. China

Recently, many efforts have been devoted to explore the integration of Internet of Things (IoT) and service-Oriented computing (SOC). These works allow the real-world devices to provide their functionality as web services. However, two important issues, unreliable service providing and resource constraints, make the modeling and analysis of service composition in IoT a big challenge. In this paper, we propose a probabilistic approach to formally describe and analyze the reliability and cost-related properties of the service composition in IoT. First, a service composition in IoT is modeled as a finite state machine (FSM) which focuses on the functional part. Then, we extend this FSM model to a Markov Decision Process (MDP), which can specify the reliability of service operations. Furthermore, we extend MDP with cost structure, which can represent the different service quality attributes for each operation, such as energy consumption, communication cost, etc. The desirable quality properties of the service composition are specified by a probabilistic extension of temporal logic PCTL. We adopt a well-established probabilistic model checker PRISM to verify and analyze those properties of our service composition models.

关键词： Business Reliability Fires Probabilistic logic Analytical models Web services system-on-a-chip

来源：评论

学校读者我要写书评

暂无评论

Identity-Based key-Insulated Proxy Signature Without Random Oracles

引用

Journal of Shanghai Jiaotong university(Science) 2011年第5期16卷 557-566页

作者：陈剑洪龙宇陈克非王永涛 Department of Computer Science and Engineering Shanghai Jiaotong University School of Computer Engineering Huaiyin Institute of Technology Shanghai Key Laboratory of Scalable Computing and System Shanghai Jiaotong University

In an identity based proxy signature (IBPS) scheme, a designated proxy signer can generate the signature on behalf of an original signer. Traditional IBPS schemes normally rely on the assumption that private keys are kept perfectly secure. However, due to viruses, worms or other break-ins allowed by operating-system holes, key exposure seems inevitable. To minimize the damage caused by key exposure in IBPS, we propose an identity-based key-insulated proxy signature (IBKIPS) scheme in the standard model, i.e. without random oracles.

关键词： key-insulated proxy signature identity-based standard model

来源：评论

学校读者我要写书评

暂无评论

Research on association rule algorithm based on distributed and weighted FP-growth

Research on association rule algorithm based on distributed ...

引用

作者： Wang, Huaibin Liu, Yuanchao Wang, Chundong Key Laboratory of Computer Vision and System Tianjin University of Technology China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China

ISBN: (纸本)9783642259883

In this paper a distributed weight mining algorithm is proposed based on FP-growth. As an important part of network fault management, the association rule takes effect on eliminating redundant alarms and preventing alarm storm. In traditional association rules the importance of each item is seen as equivalent during mining which is not realistic. By considering the different weights of the items, the AHP approach is introduced in the paper. Without any candidate generation process FP-growth performs well in mining alarm records. The distributed architecture of master and slave site can effectively reduced the complexity of the algorithm. The experimental results and comparison with other algorithms prove the validity of this proposed algorithm and good performance of decreasing the run-time. © Springer-Verlag Berlin Heidelberg 2011.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

New methodologies for parallel architecture

New methodologies for parallel architecture

引用

作者： Fan, Dong-Rui Li, Xiao-Wei Li, Guo-Jie Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Moore's law continues to grant computer architects ever more transistors in the foreseeable future, and para-llelism is the key to continued performance scaling in modern microprocessors. In this paper, the achievements in our research project, which is supported by the National Basic Research 973 Program of China, on parallel architecture, are systematically presented. The innovative approaches and techniques to solve the significant problems in parallel architecture design are summarized, including architecture level optimization, compiler and language-supported technologies, reliability, power-performance efficient design, test and verification challenges, and platform building. Two prototype chips, a multi-heavy-core Godson-3 and a many-light-core Godson-T, are described to demonstrate the highly scalable and reconfigurable parallel architecture designs. We also present some of our achievements appearing in ISCA, MICRO, ISSCC, HPCA, PLDI, PACT, IJCAI, Hot Chips, DATE, IEEE Trans. VLSI, IEEE Micro, IEEE Trans. Computers, etc. © 2011 Springer Science+Business Media, LLC & Science Press, China.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A framework towards task-based query in personal dataspace

A framework towards task-based query in personal dataspace

引用

7th International Conference on Semantics, Knowledge, and Grids, SKG 2011

作者： Li, Yukun Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology 300384 Tianjin China

ISBN: (纸本)9780769545158

With increment of personal data amount, how to allow users to efficiently re-find personal data items becomes an important research issue. According to general experience of persons, task is taken as a popular way to classify personal dataset, and is often taken as a factor to re-access expected items. In this paper, we propose a framework called TaskSpace to help users re-find expected data items based on user task, and present conceptual model of TaskSpace, framework for implementing a task-based system, methods to identify task relationships and interface for users to perform task-based query. TaskSpace framework provides users an alternative way to re-find personal information, and illustrates some interesting research issues. © 2011 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：