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

European conference on Circuit Theory and Design, ECCTD

作者： M. Suárez V.M. Brea D. Cabello F. Pozas-Flores R. Carmona-Galán A. Rodríguez-Vázquez Centro de Investigación en Tecnologías de la Información (CITIUS) University of Santiago de Compostela Santiago de Compostela Spain Instituto de Microelectrónica de Sevilla (IMSE-CNM) CSIC-Universidad de Sevilla Spain

In scale-space filtering signals are represented at several scales, each conveying different details of the original signal. Every new scale is the result of a smoothing operator on a former scale. In image processing, scale-space filtering is widely used in feature extractors as the Scale-Invariant Feature Transform (SIFT) algorithm. RC networks are posed as valid scale-space generators in focal-plane processing. Switched-capacitor networks are another alternative, as different topologies and switching rate offer a great flexibility. This work examines the parallel and the bilinear implementations as two different switched-capacitor network topologies for scale-space filtering. The paper assesses the validity of both topologies as scale-space generators in focal-plane processing through object detection with the SIFT algorithm.

关键词： Capacitors Switches Network topology Switched capacitor networks Kernel Smoothing methods Topology

来源：评论

学校读者我要写书评

暂无评论

Research on Acquisition methods of High-Precision DEM for distributed Hydrological Model

Research on Acquisition Methods of High-Precision DEM for Di...

引用

Computer and Computing Technologies in Agriculture IV——4th IFIP TC 12 conference(CCTA2010) Part III

作者： Li Deng Yong Liang Chengming Zhang School of Information Science and Engineering Shandong Agricultural University

Compared with the traditional lumped hydrological models,distributed hydrological model,considering the effects of the uneven spatial distribution of watershed land surface on the hydrological cycle,has the characteristic of physical *** from overall structure,there are two types of distributed hydrological model,which are runoff and *** establishment of convergence network is on the basis of calculating reservoir routing convergence,at present,converged networks are constructed on the grounds of DEM,the resolution of DEM directly affects the result of convergence network construction,for now,due to confidentiality rules,it is very difficult to obtain high-resolution *** the development of GIS and RS,it is more convenient to acquire data from distributed hydrological model,which has been developing *** is completed by the National Aeronautics and Space Administration(NASA),National image Mapping Agency(NIMA) and the German and Italian space *** current publicly available data resolution is 3 arc seconds(1 /1200 of longitude and latitude),and its length is equivalent to90 *** publication of this data set is an important breakthrough in geographical science and application,which has important application ***,because of the limitations on using radar technology to obtain surface elevation data,there are many problems in the original SRTM DEM data,such as missing more regional data,existing many abnormal points,and so *** article,which takes Xue Ye reservoir area as example,studies the methods of processing SRTM data and obtained high-resolution DEM data of the region.

关键词： DEM Research on Acquisition methods of High-Precision DEM for distributed Hydrological Model

来源：评论

学校读者我要写书评

暂无评论

Energy efficient delay leap routing in multicast using feed back neural networks

Energy efficient delay leap routing in multicast using feed ...

引用

International Symposium on Information Assurance and Security (IAS)

作者： Mohammad Uruj Jaleel Mohammad Asghar Jamil Kashiful Haq College of CS & IS Jazan University Saudi Arabia College of Applied Science Ibri Oman

The Hopfield Neural Network is a parallel, distributed information processing structure consisting of many processing elements connected via weighted connections. The objective function was then expressed as quadratic energy function and the associated weights between neurons were computed using the gradient descent of energy function. This paper reports a development of a Hopfield type neural network model to solve minimum cost delay leap multicast routing problem. The multicast tree is obtained by recursively obtaining the delay leap optimized path from source to various destinations and combining them by union operator. The union operator ensures that a link is appearing only once in the multicast tree. The minimum energy function is obtained with minimization of constrained parameter as per a defined annealing schedule, which increases the probability of visiting lower energy states. Finally, the goal of minimization of objective function (minimum cost delay leap route) is achieved by using mean filed approximation with stochastic annealing process of reducing constrained parameter.

关键词： Delay Routing Hopfield neural networks Energy states Annealing Approximation methods Equations

来源：评论

学校读者我要写书评

暂无评论

A high-performance parallel implementation of the Chambolle algorithm

A high-performance parallel implementation of the Chambolle ...

引用

Design, Automation and Test in Europe conference and Exhibition

作者： Abdulkadir Akin Ivan Beretta Alessandro Antonio Nacci Vincenzo Rana Marco Domenico Santambrogio David Atienza Embedded Systems Laboratory (ESL) Ecole Polytechnique Fédérale de Lausanne Switzerland Dipartimento di Elettronica e Informazione (DEI) Politecnico di Milano Italy

ISBN: (纸本)9781612842080

The determination of the optical flow is a central problem in image processing, as it allows to describe how an image changes over time by means of a numerical vector field. The estimation of the optical flow is however a very complex problem, which has been faced using many different mathematical approaches. A large body of work has been recently published about variational methods, following the technique for total variation minimization proposed by Chambolle. Still, their hardware implementations do not offer good performance in terms of frames that can be processed per time unit, mainly because of the complex dependency scheme among the data. In this work, we propose a highly parallel and accelerated FPGA implementation of the Chambolle algorithm, which splits the original image into a set of overlapping sub-frames and efficiently exploits the reuse of intermediate results. We validate our hardware on large frames (up to 1024 × 768), and the proposed approach significantly improves state-of-the-art implementations, reaching up to 76× speedups, which enables real-time frame rates even at high resolutions.

关键词： Hardware Arrays Optical imaging Field programmable gate arrays Adaptive optics Estimation Memory management

来源：评论

学校读者我要写书评

暂无评论

An extended registration framework for the triple registration of IBZM SPECT, DATSCAN SPECT and MRI brain images to support the evaluation of brain dopamine receptor scintigraphies

An extended registration framework for the triple registrati...

引用

Annual International conference of the IEEE Engineering in Medicine and Biology Society

作者： Laszlo Papp Norbert Zsoter Peter Bandi Sandor Barna Ulf Luetzen Mediso Medical Imaging Systems Ltd Scanomed Ltd. Medical University of Kiel Department of Nuclear Medicine

ISBN: (纸本)9781424441211

An extended registration model is presented to register medical image triples acquired for brain dopamine receptor scintigraphies. The model operates with rigid and nonlinear transformations in parallel, where all transformation parameters are optimized by one optimization method. The concept of the transformation-sampling-similarity measurement minimizes the memory usage of a real implementation. A partial-fine sampling method is proposed to decrease the processing time of the registration. Real medical data was collected to compare our method with well-known prior ones. The first tests show that the model outperforms the classic registration methods in both speed and accuracy.

关键词： scintigraphy Registration single photon emission computed tomography Dopamine Receptors n [(1 ethyl 2 pyrrolidinyl)methyl] 3 iodo 6 methoxysalicylamide processing time Magnetic resonance imaging of brain Rigid similar measure

来源：评论

学校读者我要写书评

暂无评论

GPGPU acceleration of Cellular Simultaneous Recurrent Networks adapted for maze traversals

GPGPU acceleration of Cellular Simultaneous Recurrent Networ...

引用

International Joint conference on Neural Networks (IJCNN)

作者： Kenneth L. Rice Tarek M. Taha Khan M. Iftekharuddin Keith Anderson Teddy Salan Clemson University Clemson SC USA University of Dayton Dayton OH USA University of Memphis Memphis TN USA

At present, a major initiative in the research community is investigating new ways of processing data that capture the efficiency of the human brain in hardware and software. This has resulted in increased interest and development of bio-inspired computing approaches in software and hardware. One such bio-inspired approach is Cellular Simultaneous Recurrent Networks (CSRNs). CSRNs have been demonstrated to be very useful in solving state transition type problems, such as maze traversals. Although powerful in image processing capabilities, CSRNs have high computational demands with increasing input problem size. In this work, we revisit the maze traversal problem to gain an understanding of the general processing of CSRNs. We use a 2.67 GHz Intel Xeon X5550 processor coupled with an NVIDIA Tesla C2050 general purpose graphical processing unit (GPGPU) to create several novel accelerated CSRN implementations as a means of overcoming the high computational cost. Additionally, we explore the use of decoupled extended Kalman filters in the CSRN training phase and find a significant reduction in runtime with negligible change in accuracy. We find in our results that we can achieve average speedups of 21.73 and 3.55 times for the training and testing phases respectively when compared to optimized C implementations. The main bottleneck in training performance was a matrix inversion computation. Therefore, we utilize several methods to reduce the effects of the matrix inversion computation.

关键词： Training Computer architecture Microprocessors Acceleration parallel processing Runtime Testing

来源：评论

学校读者我要写书评

暂无评论

Performance problems online detection in cloud computing systems via analyzing request execution paths

Performance problems online detection in cloud computing sys...

引用

International conference on Dependable Systems and Networks Workshops (DSN-W)

作者： Haibo Mi Huaimin Wang Gang Yin Hua Cai Qi Zhou Tingtao Sun National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Computing Platform Alibaba Cloud Computing Company Hangzhou China

It is quite a headache for developers to online detect performance problems in large-scale cloud computing systems. The behavior and the hidden connections among the huge amount of runtime request execution paths in cloud computing systems usually contain useful information for performance problem detection. In this paper, we propose an approach to rapidly diagnose the source of performance degradation in large-scale non-stop cloud computing systems. The approach first groups the user requests into categories with a fast clustering algorithm; then applies the principal components analysis to extract the primary methods; finally compares the normal and abnormal behaviors of the primary methods to localize the main cause of performance problems. We conduct extensive experiments over a real-world enterprise system providing services for the public. The results show that our approach can locate the prime causes of performance problems accurately and efficiently.

关键词： Cloud computing Principal component analysis Instruments Degradation Servers Data mining Accuracy

来源：评论

学校读者我要写书评

暂无评论

Power Optimization for GPU Programs Based on Software Prefetching

Power Optimization for GPU Programs Based on Software Prefet...

引用

IEEE International conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yisong Lin Tao Tang Guibin Wang Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense and Technology Changsha China

GPUs render higher computing unit density than contemporary CPUs and thus exhibit much higher power consumption despite its higher power efficiency. The power consumption has become an important issue that impacts CPU's applications, thereby necessitating the low power optimization technology for GPUs. Software prefetching is an efficient way to alleviate the memory wall problem which overlaps the computing and memory access latencies. However, software prefetching will cause some power overhead because it increases the number and density of the instructions. Thus, we should consider the balance between the performance income and the power overhead when applying the optimization. To address this problem, in this paper we first analyze the multi-thread execution model of GPU and validate the potential space of software prefetching optimization. Then we give the software prefetching method for GPU programs to improve the performance. Aiming at two different objects: energy optimization under performance constraint and performance optimization under power constraint, we discuss the optimization methods based on software prefetching and dynamic voltage scaling technologies. The experimental results show that our method can efficiently optimize the energy consumption (performance) under the performance (power) constraint.

关键词： Prefetching Graphics processing unit Optimization Power demand Registers

来源：评论

学校读者我要写书评

暂无评论

Scheduling in mapreduce-like systems for fast completion time

Scheduling in mapreduce-like systems for fast completion tim...

引用

IEEE Annual Joint conference: INFOCOM, IEEE Computer and Communications Societies

作者： Hyunseok Chang Murali Kodialam Ramana Rao Kompella T. V. Lakshman Myungjin Lee Sarit Mukherjee Bell Laboratories USA Purdue University USA

ISBN: (纸本)9781424499199

Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important programming model for these environments. Since today's data centers run many MapReduce jobs in parallel, it is important to find a good scheduling algorithm that can optimize the completion times of these jobs. While several recent papers focused on optimizing the scheduler, there exists very little theoretical understanding of the scheduling problem in the context of MapReduce. In this paper, we seek to address this problem by first presenting a simplified abstraction of the MapReduce scheduling problem, and then formulate the scheduling problem as an optimization *** devise various online and offline algorithms to arrive at a good ordering of jobs to minimize the overall job completion times. Since optimal solutions are hard to compute (NP-hard), we propose approximation algorithms that work within a factor of 3 of the optimal. Using simulations, we also compare our online algorithm with standard scheduling strategies such as FIFO, Shortest Job First and show that our algorithm consistently outperforms these across different job distributions.

关键词： Program processors Approximation algorithms Optimal scheduling Processor scheduling Equations Approximation methods Optimized production technology

来源：评论

学校读者我要写书评

暂无评论

Exploring parallel capabilities of an innovative numerical method for recovering image velocity vectors field

引用

MATHEMATICAL AND COMPUTER MODELLING 2010年第3-4期51卷 138-143页

作者： Francomano, E. Macaluso, C. Tortorici, A. Toscano, E. Univ Palermo Dipartimento Ingn Informat I-90128 Palermo Italy

In this paper an efficient method devoted to estimate the velocity vectors field is investigated. The method is based on a quasi-interpolant operator and involves a large amount of computation. The operations characterizing the computational scheme are ideal for parallel processing because they are local, regular and repetitive. Therefore, the spatial parallelism of the process is studied to rapidly proceed in the computation on distributed multiprocessor systems. The process has shown to be synchoronous, with good task balancing and requiring a small amount of data transfer. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： image velocity vectors field Quasi-interpolant operator B-spline functions distributed multiprocessor systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：