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

13th International Workshop on Combinatorial Image Analysis

作者： Barneva, Reneta P. Brimkov, Valentin E. Kanev, Kamen K. SUNY Coll Fredonia Dept Comp Sci Fredonia NY 14063 USA SUNY Buffalo State Coll Math Dept Buffalo NY 14222 USA Shizuoka Univ Res Inst Elect Hamamatsu Shizuoka 432-8011 Japan

ISBN: (纸本)9783642102080

Since the 80s, when the computer mouse was first invented, point-and-click functionality became widely adopted, in particular, for work with images and GUIs. It would be useful to provide such functionality for printed materials, as well. A direct point-and-click functionality should not require tablet-like devices;but should rather use an embedded marking which defines a coordinate system within the image. An original approach and related technology for direct interface;known as Cluster Pattern Interface (CLUSPI), was proposed [12]. It is based on an unobtrusive layer of the image defining a coordinate system, a camera-based pointing device;and decoding software. CLUSPI. technology was invented and patented by one of the authors of this paper. Here we present the theoretical (mathematical) foundations of the methods developed. We also describe some theoretical challenges and propose solutions to them.

关键词： carpet encoding cluster pattern interface CLUSPI parallel algorithm CRCW-PRAM model

来源：评论

学校读者我要写书评

暂无评论

FPGA-accelerated Design of Motion Estimation for H.264 HDTV

FPGA-accelerated Design of Motion Estimation for H.264 HDTV

引用

2nd International Conference on Information and Computing Science

作者： Wang, Jintao Lu, Rui Qiu, Chu Gao, Pengdong Lu, Yongquan Yu, Wenhua Commun Univ China HPCC Beijing 100024 Peoples R China Electromagnet Commun Lab University Pk PA 16802 USA

ISBN: (纸本)9780769536347

H.264/AVC is a merging popular video coding standard which have new features. A H.264 open source, X264 code set, adopt motion estimation which consists of diamond search, hexagonal search, uneven multi-hexagon search, exhaustive search and hadamard exhaustive search. According to statistic values, the time-consuming of ME operations during HDTV(1920x1080p) encoding is about 60-80 percent within whole H.264 algorithm[1]. Considering the characteristics of FPGAs, flexibility, inherent parallel characteristic and the rapid prototyping, a parallel operation architecture of FPGA-based was designed with a Lattice ECP2M chip. The experiment results which include the time-consuming, the wave forms and the calculation cycles were analyzed with special tools, ispLever 6.1, ModelSim, etc. and the Post-Place & Route layout of a project was shown in the end of this paper. It is concluded that the FPGA chip can deal with HDTV sequences as a co-processor in a video coding system.

关键词： motion estimation FPGA-based co-processor parallel algorithm Pipeline Operation Block

来源：评论

学校读者我要写书评

暂无评论

Abstract state machines capture parallel algorithms: Correction and extension

引用

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2008年第3期9卷 127-158页

作者： Blass, Andreas Gurevich, Yuri Univ Michigan Dept Math Ann Arbor MI 48109 USA Microsoft Res Redmond WA 98052 USA

We consider parallel algorithms working in sequential global time, for example, circuits or parallel random access machines (PRAMs). parallel abstract state machines (parallel ASMs) are such parallel algorithms, and the parallel ASM thesis asserts that every parallel algorithm is behaviorally equivalent to a parallel ASM. In an earlier article, we axiomatized parallel algorithms, proved the ASM thesis, and proved that every parallel ASM satisfies the axioms. It turned out that we were too timid in formulating the axioms;they did not allow a parallel algorithm to create components on the fly. This restriction did not hinder us from proving that the usual parallel models, like circuits or PRAMs or even alternating Turing machines, satisfy the postulates. But it resulted in an error in our attempt to prove that parallel ASMs always satisfy the postulates. To correct the error, we liberalize our axioms and allow on-the-fly creation of new parallel components. We believe that the improved axioms accurately express what parallel algorithms ought to be. We prove the parallel thesis for the new, corrected notion of parallel algorithms, and we check that parallel ASMs satisfy the new axioms.

关键词： algorithms languages theory parallel algorithm abstract state machine ASM thesis postulates for parallel computation parallel programming

来源：评论

学校读者我要写书评

暂无评论

Coarse grained parallel algorithms for graph matching

引用

parallel COMPUTING 2008年第1期34卷 47-62页

作者： Chan, Albert Dehne, Frank Bose, Prosenjit Latzel, Markus Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Fayetteville State Univ Dept Math & Comp Sci Fayetteville NC USA Palomino Syst Inc Toronto ON Canada

parallel graph algorithm design is a very well studied topic. Many results have been presented for the PRAM model. However, these algorithms are inherently fine grained and experiments show that PRAM algorithms do often not achieve the expected speedup on real machines because of large message overheads. In this paper, we present coarse grained parallel graph algorithms with small message overheads that solve the following standard graph problems related to graph matching: finding maximum matchings in convex bipartite graphs, and finding maximum weight matchings in trees. To our knowledge, these are the first efficient parallel algorithms for these problems that are designed for standard commercial parallel machines such as off-the-shelf processor clusters. (c) 2007 Elsevier B.V. All rights reserved.

关键词： graph matching parallel algorithm coarse grained parallel computing convex bipartite graph unrooted tree

来源：评论

学校读者我要写书评

暂无评论

Distributed energy-efficient solutions for area coverage problems in wireless sensor networks

Distributed energy-efficient solutions for area coverage pro...

引用

作者： Vu, Chinh Trung Georgia State University

学位级别：Ph.D.

Wireless sensor networks (WSNs) have recently attracted a great deal of attention due to their numerous attractive applications in many different fields. Sensors and WSNs possess a number of special characteristics that make them very promising in a wide range of applications, but they also put on them lots of constraints that make issues in sensor network particularly challenging. These issues may include topology control, routing, coverage, security, data management and many others. Among them, coverage problem is one of the most fundamental ones for which a WSN has to watch over the environment such as a forest (area coverage) or set of subjects such as collection of precious renaissance paintings (target of point coverage) in order for the network to be able to collect environment parameters, and maybe further monitor the environment. In this dissertation, we highly focus on the area coverage problem. With no assumption of sensors’ locations (i.e., the sensor network is randomly deployed), we only consider distributed and parallel scheduling methods with the ultimate objective of maximizing network lifetime. Additionally, the proposed solutions (including algorithms, a scheme, and a framework) have to be energy-efficient. Generally, we investigate numerous generalizations and variants of the basic coverage problem. Those problems of interest include k-coverage, composite event detection, partial coverage, and coverage for adjustable sensing range network. Various proposed algorithms. In addition, a scheme and a framework are also suggested to solve those problems. The scheme, which is designed for emergency alarming applications, specifies the guidelines for data and communication patterns that significantly reduce the energy consumption and guarantee very low notification delay. For partial coverage problem, we propose a universal framework (consisting of four strategies) which can take almost any complete-coverage algorithm as an input to generate an algorithm

关键词： k-Coverage Energy-efficiency Wireless Sensor Network Adjustable Sensing Range WSN Coverage Problem Localized and Distributed algorithm Connectivity parallel algorithm Fault-Tolerance Partial Coverage Composite Event Detection Robustness

来源：评论

学校读者我要写书评

暂无评论

parallel VQ compression using PNN algorithm for PC Grid system

引用

TELECOMMUNICATION SYSTEMS 2008年第1-3期37卷 127-135页

作者： Wakatani, Akiyoshi Konan Univ Fac Sci & Engn Higashinada Ku Kobe Hyogo 6588501 Japan

PC Grid is a promising platform to achieve a high performance computing with less construction cost. A kind of parameter sweep applications (PSA) can be efficiently carried out on the PC Grid, but there exist parallel applications are not suitable for it. We focus on PNN (Pairwise Nearest Neighbor) codebook generation algorithm for the VQ compression algorithm and propose a parallel version of the PNN algorithm suitable for the PC Grid, called "One-step Grid PNN", as well as "multi-step Grid PNN", which reduces the computation complexity on a master computer. The Grid PNN is a modified version of the PNN algorithm that creates a different codebook than the original PNN does, thus the quality of a codebook created by using the Grid PNN may be worse than that of a codebook by the original PNN. However, our experimental results show that the quality of the codebook is almost same as that of the original one. We also confirm the effectiveness of the one-step and multi-step Grid PNN by the evaluation of the computational complexity of the algorithm and experiments executed on a PC cluster system.

关键词： Grid computing parallel algorithm data compression codebook generation

来源：评论

学校读者我要写书评

暂无评论

PCR algorithm for parallel computing the solution of the general restricted linear equations

引用

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2008年第1-2期27卷 125-136页

作者： Yu, Yaoming Shanghai Normal Univ Coll Educ Shanghai 200234 Peoples R China

In this paper we present a parallel algorithm for parallel computing the solution of the general restricted linear equations Ax = b, x is an element of T, where T is a subspace of C-n and b is an element of AT. By this algorithm the solution x = A(T, S)((2))b is obtained in n(log(2)m + log(2)(n - s + 1) + 7) + log(2)m + 1 steps with P = mn processors when m >= 2(n-1) and with P = 2n(n - 1) processors otherwise.

关键词： parallel algorithm Generalized inverse A(T,S)((2)) General restricted linear equations Time complexity

来源：评论

学校读者我要写书评

暂无评论

RESEARCH OF parallel PROCESS MANAGEMENT MODEL BASED ON PARITY DICHOTOMY METHOD TO SLOVE TRIGANGULAR SYSTEM

RESEARCH OF PARALLEL PROCESS MANAGEMENT MODEL BASED ON PARIT...

引用

2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)

作者： CHUN-FENG LIU AI-MIN YANG YA-MIAN PENG School of Management Hebei University of Technology Tianjin 300130 China College of Science Hebe College of Science Hebei Ploytechnic University Tangshan 063009 China

With the object of realizing the direct solution to the triangular system, and in accordance with the associated chain for first order parallel linear recurrence method, this paper derives the associated chain for 8 order triangular system, then constructs the relative associated chain for common system of equations based on the parity dichotomy method and designs the correlative parallel algorithm. In regards to the designed parallel algorithm, it is analyzed in two aspects, which are the theoretical derivation of the parallel speed-up ratio and efficiency for the algorithm and then the verification for it through the number experiment By the analysis, we can see the algorithm has the characters of less communication time and better calculating efficiency, which testifies that the parallel algorithm is practically effective in solving the triangular system.

关键词： Associated chain Parity dichotomy method parallel algorithm Speed-up ratio Efficiency

来源：评论

学校读者我要写书评

暂无评论

A parallel BRANCH-AND-PRICE algorithm FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND SIMULTANEOUS DELIVERY AND PICK-UP

引用

38th International Conference on Computers and Industrial Engineering

作者： Li, Chen Long, Lei Chen, Qiushuang Hua, Yanning Nankai Univ Coll Informat Tech Sci Dept Automat Tianjin Peoples R China

ISBN: (纸本)9787121074370

Vehicle routing problem with time windows and simultaneous delivery and pick-up (VRPTWSDP) is a variation of the capacitated vehicle routing problem, where goods are delivered from the depot to the customers, while additional goods are brought back to the depot from the customers simultaneously within customer-specified time windows. One important characteristic of this problem is that the vehicle load is a mix of pick-up and delivery loads. By using the Dantzig-Wolfe decomposition, a set partitioning (SP) model for VRPTWSDP is proposed. According to SP model, a parallel branch-and-price algorithm (parallel B&P) is developed, which is implemented in a master-slave structure. An elementary shortest path problem with capacity and time window resource constraints is formulated as a pricing sub-problem, and solved by heuristics and bounded bi-directional dynamic. programming procedure. A branching strategy based on time is introduced, and compared with branching on arcs. The comparative results carried out on benchmark instances indicate that the former decreases the number of nodes explored successfully. Extensive computational results reveal that parallel B&P has linear speedup ratio, and is effective to solve VRPTWSDP.

关键词： vehicle routing problem parallel algorithm simultaneous delivery and pick-up time windows branch-and-price

来源：评论

学校读者我要写书评

暂无评论

A new parallel spatial query algorithm for distributed spatial databases

A new parallel spatial query algorithm for distributed spati...

引用

7th International Conference on Machine Learning and Cybernetics

作者： Wei, Hong-Jun Wei, Zu-Kuan Yin, Qian Univ Elect Sci & Technol China Sch Engn & Comp Sci Chengdu 610054 Peoples R China Beijing Normal Univ Coll Informat Sci & Technol Beijing 100875 Peoples R China

ISBN: (纸本)9781424420957

The balance of data and the utilization of resources are essential to distributed spatial database system. The paper presents an efficient parallel spatial query algorithm which takes seriously the organization of spatial data into account. The algorithm adopts a balanced spatial data partitioning strategy for distributed spatial databases. According to the characteristics of data partitioning, it builds a packing R-tree as its index. The strategy also considers the problem of computing distribution. By replicating index to every site, each site can access different entry in the same index node at the same time. Based on the organization of spatial data, the algorithm can simultaneously execute query operation at different site in both filtration phase and refinery phase. So it obviously improves spatial query performances. In order to solve multiple paths search problem caused by R-tree index, the algorithm brings in globe stack to buffer temporary index nodes. It settles the difficult problem flexibly in distributed spatial databases. For simplicity, the paper discusses the parallel algorithm in 2-dimensional space. Through the experiments conducting on many real datasets, it shows better performance in various spatial query operations.

关键词： distributed spatial database spatial query R-tree globe stack parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：