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

international conference on Control, Automation, Robotics and Vision

作者： Haiyan Wu Lei Lou Chih-Chung Chen Sandra Hirche Kolja Kuhnlenz Institute of Automatic Control Engineering (LSR) Technische Universitat Munchen

ISBN: (纸本)9781424478149

In this paper, a networked visual servo control system with distributed computation is proposed to overcome the low sampling rate problem in vision-based control systems. A real-time image data transmission protocol based on Real-time Transport Protocol (RTP) is developed. The captured images are sent to different processing nodes connected over a communication network and processed in parallel. Thus, a high sampling rate of the visual feedback is achieved under a cloud image processing architecture. The varying image processing delay caused by the varying number of extracted features and the random transmission delay are modeled as a random process with Bernoulli distribution. By using the input-delay approach, the resulted networked visual servo control system is reformulated into a stochastic continuous-time system with time-varying delay. Experiments on two 1-DoF linear motor modules are carried out to validate the proposed approach. A visual servo control system without parallel distributed computation is implemented for comparison. The experimental results demonstrate significant performance improvement by the proposed approach.

关键词： Visual servo control servo control system networks(communications) Binomial Distribution performance boost Continuous time systems Transport delay arithmetic Stochastic Processes Visual Feedback sampling rate Distribute

来源：评论

学校读者我要写书评

暂无评论

Reordering for Better Compressibility: Efficient Spatial Sampling in Wireless Sensor networks

Reordering for Better Compressibility: Efficient Spatial Sam...

引用

IEEE international conference on Sensor networks, Ubiquitous, and Trustworthy computing

作者： Mohammadreza Mahmudimanesh Abdelmajid Khelil Neeraj Suri Technische Universität Darmstadt Darmstadt Germany

Compressed Sensing (CS) is a novel sampling paradigm that tries to take data-compression concepts down to the sampling layer of a sensory system. It states that discrete compressible signals are recoverable from sub-sampled data, when the data vector is acquired by a special linear transform of the original discrete signal vector. distributed sampling problems especially in Wireless Sensor networks (WSN) are good candidates to apply CS and increase sensing efficiency without sacrificing accuracy. In this paper, we discuss how to reorder the samples of a discrete spatial signal vector by defining an alternative permutation of the sensor nodes (SN). Accordingly, we propose a method to enhance CS in WSN through improving signal compressibility by finding a sub-optimal permutation of the SNs. Permutation doesn't involve physical relocation of the SNs. It is a reordering function computed at the sink to gain a more compressible view of the spatial signal. We show that sub-optimal reordering stably maintains a more compressible view of the signal until the state of the environment changes so that another up-to-date reordering has to be computed. Our method can increase signal reconstruction accuracy at the same spatial sampling rate, or recover the state of the operational environment with the same quality at lower spatial sampling rate. Sub-sampling takes place during the interval that our reordered version of the spatial signal remains more compressible than the original signal.

关键词： Sampling methods Wireless sensor networks Discrete cosine transforms Vectors Tin Compressed sensing Fourier transforms Sensor systems Computer networks Pervasive computing

来源：评论

学校读者我要写书评

暂无评论

The Investigation of Cloud-computing-based Image Mining Mechanism in Mobile Communication WEB on Android

The Investigation of Cloud-Computing-based Image Mining Mech...

引用

international conference on Grid and Cooperative computing (GCC)

作者： Gu Cai-dong Lu Kan Wu Jian-ping Fu Ying-li Li Jing-xiang Xiao Chang-shui Si Mao-xin Liu Zhao-bin JiangSu Province Support Software Engineering Research and Development Center for Modern Information Technology Application in Enterprise Suzhou Vocational University Suzhou China Department of Computer Engineering Suzhou Vocational University Suzhou China Suzhou Vocational University Suzhou Jiangsu CN

With the development of 3G network technology, the rapid upgrading of mobile phone hardware, and the refined requirements for mobile phones by mobile phone users, it is essential for mobile phones to be able to promptly and accurately process images. A mobile phone terminal sends the service requests to cloud computer system which then processes the requests and sends the results via 3G network back to the mobile phone terminal. This paper presents a architectural model to realize the image processing system that connects mobile phone with clouding computing through 3G network. The method is to build intra-enterprise server group, distributed database system, and parallel computing system to form a private cloud computing system, which defines ontological semantic tags for images uploaded from mobile phone terminals and stores them in a distributed way (cloud storing), and to design the corresponding search algorithms to help the system to promptly and accurately query the images (cloud computing), and retrieve the appropriate images through sorting matching indexes, weights, and etc.

关键词： Cloud computing Mobile handsets Mobile communication Google Image processing Clouds

来源：评论

学校读者我要写书评

暂无评论

On Communication Determinism in parallel HPC Applications

On Communication Determinism in Parallel HPC Applications

引用

international conference on Computer Communications and networks (ICCCN)

作者： Franck Cappello Amina Guermouche Marc Snir INRIA-Saclay Île-de-France Orsay France College of Engineering University of Illinois Urbana-Champaign Urbana IL USA LRI INRIA Saclay-Île de France Université Paris Sud Orsay France

Current fault tolerant protocols for high performance computing parallel applications have two major drawbacks: either they require to restart all processes even in the case of only a single process failure or they have a high performance overhead in fault free situation. As a consequence none of existing generic fault tolerant protocols matches needs of HPC applications and surprisingly, there is no fault tolerant protocol dedicated to them. One way to design better fault tolerant protocols for HPC applications is to explore and take advantage of their specific characteristics. In particular we suspect that most of them present some form of determinism in communication patterns. Communication determinism can play an important role in the design of new fault tolerant protocols by reducing their complexity. In this paper, we explore the communication determinism in 27 HPC parallel applications that are representative of production workloads in large scale centers. We show that most of these applications have deterministic or send-deterministic communication patterns.

关键词： Protocols Fault tolerance Fault tolerant systems Computational modeling Benchmark testing Kernel Physics

来源：评论

学校读者我要写书评

暂无评论

A semi-distributed localization protocol for wireless sensor and actor networks

A semi-distributed localization protocol for wireless sensor...

引用

IEEE Annual conference on Pervasive computing and Communications Workshops (PerCom)

作者： Giacomo Ghidini Cristina M. Pinotti Sajal K. Das Center of Research in Wireless Mobility and Networking Department of Computer Science and Engineering University of Technology Arlington USA Department of Computer Science and Mathematics University of Perugia Italy

We consider a wireless sensor and actor network (WSAN) consisting of a large number of tiny, low-cost sensors uniformly and independently distributed in a two-dimensional geographical region around a few powerful entities, called actors. To save energy, the sensors operate according to sleep/awake schedules in an asynchronous manner. In this setting, we propose a semi-distributed, actor-centric localization algorithm which organizes the sensors in the vicinity of each actor by means of a discrete polar coordinate system. Specifically, each sensor is localized when it acquires the corona and sector coordinates of the region it resides in. To accomplish the localization task, each actor first trains a subset of sensors in its vicinity, which in turn train their neighbors. By modeling the deployed sensors as a two-dimensional Poisson point process and applying well-known results from the Coupon Collector's problem and Chernoff bounds, we derive bounds on the sensor density required to localize with high probability all sensors in the actor's vicinity. Finally, we verify the analytical bounds with results from our simulation experiments.

关键词： Wireless sensor networks Wireless application protocol Scheduling Computer science Hardware Power engineering and energy Mathematics Sensor systems Corona Analytical models

来源：评论

学校读者我要写书评

暂无评论

Scalable failure recovery for high-performance data aggregation

Scalable failure recovery for high-performance data aggregat...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Dorian C. Arnold Barton P. Miller Department of Computer Science University of New Mexico Albuquerque NM USA Computer Sciences Department University of Wisconsin Madison WI USA

Many high-performance tools, applications and infrastructures, such as Paradyn, STAT, TAU, Ganglia, SuperMon, Astrolabe, Borealis, and MRNet, use data aggregation to synthesize large data sets and reduce data volumes while retaining relevant information content. Hierarchical or tree-based overlay networks (TBONs) are often used to execute data aggregation operations in a scalable, piecewise fashion. In this paper, we present state compensation, a scalable failure recovery model for high-bandwidth, low-latency TBON computations. By leveraging inherently redundant state information found in many TBON computations, state compensation avoids explicit state replication (for example, process checkpoints and message logging) and incurs no overhead in the absence of failures. Further, when failures do occur, state compensation uses a weak data consistency model and localized protocols that allow processes to recover from failures independently and responsively. Based on a formal specification of our data aggregation model, we have validated state compensation and identified its assumptions and limitations: state compensation requires that data aggregation operations be associative, commutative and idempotent. In this paper, we describe the fundamental state compensation concepts and a prototype implementation integrated into the MRNet TBON infrastructure. Our experiments with this framework suggest that for TBONs supporting up to millions of application processes, state compensation can yield millisecond recovery latencies and inconsequential application perturbation.

关键词： Prototypes Delay Large-scale systems Computer networks Computational modeling Network synthesis Protocols distributed computing Data analysis Synchronization

来源：评论

学校读者我要写书评

暂无评论

An Asymmetric distributed Shared Memory Model for Heterogeneous parallel Systems

引用

ACM SIGPLAN NOTICES 2010年第3期45卷 347-358页

作者： Gelado, Isaac Cabezas, Javier Navarro, Nacho Stone, John E. Patel, Sanjay Hwu, Wen-mei W. Univ Politecn Cataluna E-08028 Barcelona Spain Univ Illinois Chicago IL 60680 USA

Heterogeneous computing combines general purpose CPUs with accelerators to efficiently execute both sequential control-intensive and data-parallel phases of applications. Existing programming models for heterogeneous computing rely on programmers to explicitly manage data transfers between the CPU system memory and accelerator memory. This paper presents a new programming model for heterogeneous computing, called Asymmetric distributed Shared Memory (ADSM), that maintains a shared logical memory space for CPUs to access objects in the accelerator physical memory but not vice versa. The asymmetry allows light-weight implementations that avoid common pitfalls of symmetrical distributed shared memory systems. ADSM allows programmers to assign data objects to performance critical methods. When a method is selected for accelerator execution, its associated data objects are allocated within the shared logical memory space, which is hosted in the accelerator physical memory and transparently accessible by the methods executed on CPUs. We argue that ADSM reduces programming efforts for heterogeneous computing systems and enhances application portability. We present a software implementation of ADSM, called GMAC, on top of CUDA in a GNU/Linux environment. We show that applications written in ADSM and running on top of GMAC achieve performance comparable to their counterparts using programmer-managed data transfers. This paper presents the GMAC system and evaluates different design choices. We further suggest additional architectural support that will likely allow GMAC to achieve higher application performance than the current CUDA model.

关键词： Design Experimentation Performance Heterogeneous Systems Data-centric Programming Models Asymmetric distributed Shared Memory

来源：评论

学校读者我要写书评

暂无评论

Analysis of computing Resource Allocation for Replicated Processes in P2P-MPI

Analysis of Computing Resource Allocation for Replicated Pro...

引用

WRI international conference on Communications and Mobile computing, CMC

作者： Qiuming Luo Panpan Zhang Wentao Dong Nat. HPC Center (Shenzhen) SZU Shenzhen China Coll. of Inf. Eng. SZU Shenzhen China Coll. of Comput. Sci. & Software Eng. SZU Shenzhen China

ISBN: (纸本)9781424463275;9780769539898

In this paper, we explore the computing resources, or nodes, allocation for replicated processes in P2P-MPI. It uses the communication latency between the root node and other computing nodes to rank all nodes into a list, and selects the nodes which have shorter latency to root node to perform the computing task. The analyses and experiment shows that allocation scheme was far from optimized. If the latency and bandwidth between nodes which have communication during the computing was considered, a more effective allocation could be obtained. The analyses show that selecting the optimized allocation is an NP-hard problem with some difference from traditional parallel task allocation or scheduling. An alternative allocation scheme is proposed, and some opening problems are discussed.

关键词： Resource management Delay Computer networks High performance computing Educational institutions Computer science Software engineering Fault tolerance Message passing Cities and towns

来源：评论

学校读者我要写书评

暂无评论

distributed switched code (DiSC): A distributed rateless code for broadcast in ad-hoc wireless networks 10

Distributed switched code (DiSC): A distributed rateless cod...

引用

6th international Wireless Communications and Mobile computing conference, IWCMC 2010

作者： Kadi, Nour Al Agha, Khaldoun LRI CNRS Université Paris 11 Orsay France

ISBN: (纸本)9781450300629

We propose a novel distributed coding scheme for broadcast over ad-hoc wireless networks. In this scheme, all nodes perform coding using a simple rateless code over the previously received, generated, or decoded symbols. Rather than waiting for a full block of encoded packets to be received before intermediate nodes could decode and resend coded packets, we design a new degree distribution that enables the intermediate nodes to start decoding even when small number of encoded packets are received. Thus, we decrease the delay introduced at the intermediate nodes because of decoding and then re-encoding. The main advantage of using a kind of rateless code for encoding instead of using a random linear combination of the previously received packets is to reduce significantly the encoding and decoding complexities. We provide a performance evaluation using a simulation to demonstrate the efficiency of our code in term of reducing the number of transmissions and increasing the delivery ratio.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Mobile healthcare information management utilizing Cloud computing and Android OS

Mobile healthcare information management utilizing Cloud Com...

引用

Annual international conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Charalampos Doukas Thomas Pliakas Ilias Maglogiannis University of Aegean Samos Greece COO Converged Core Nokia Siemens Networks Inc. Athens Greece University of Central Greece Lamia Greece

Cloud computing provides functionality for managing information data in a distributed, ubiquitous and pervasive manner supporting several platforms, systems and applications. This work presents the implementation of a mobile system that enables electronic healthcare data storage, update and retrieval using Cloud computing. The mobile application is developed using Google's Android operating system and provides management of patient health records and medical images (supporting DICOM format and JPEG2000 coding). The developed system has been evaluated using the Amazon's S3 cloud service. This article summarizes the implementation details and presents initial results of the system in practice.

关键词： Biomedical imaging Medical information systems Mobile communication Cloud computing Image coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：