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

Developing Vision-based and Cooperative Vehicular embedded systems for Enhancing Road Monitoring Services

Procedia computer science 2015年 52卷 389-395页

作者： K. Hammoudi H. Benhabiles M. Kasraoui N. Ajam F. Dornaika K. Radhakrishnan K. Bandi Q. Cai S. Liu Research Institute on Embedded Electronic Systems (IRSEEM EA4353 Normandie Université) IIS Group St-Etienne-du-Rouvray France ESIGELEC School of Engineering Department of ICT (φMS Students) St-Etienne-du-Rouvray France Department of Computer Science and Artificial Intelligence University of the Basque Country San Sebastián Spain IKERBASQUE Basque Foundation for Science Bilbao Spain

This paper presents a generic processing architecture as well as tools and approaches for supporting road monitoring services. More precisely, a small-scale simulator is presented for experimenting the design and the implementation of vision-based vehicular embedded systems in indoor environments, i.e. a test bench for embedded system laboratories. This simulator employs embedded electronic systems, sensors as well as hybrid communication and computational technologies. In particular, these technologies are exploited in order to produce our cooperative and real-time embedded system for enhancing road monitoring services. This type of simulator can be used for developing a variety of innovative road monitoring services based on the detection of dynamical points of interest. Notably, a system has been implemented in the case of a simulated road service to aid police agency for the recognition of wanted individuals and stolen vehicles. Experimental results show the potential of the simulator for fostering the development of a next generation of vehicular embedded system as well as for the emergence of participatory road services.

关键词： sensor networks cooperative monitoring vision-based recognition systems vehicular embedded systems.

来源：评论

学校读者我要写书评

暂无评论

NoC-based fault-tolerant cache design in chip multiprocessors

NoC-based fault-tolerant cache design in chip multiprocessor...

引用

作者： Banaiyanmofrad, Abbas Girão, Gustavo Dutt, Nikil Center for Embedded Computer Systems School of Information and Computer Science University of California Irvine IrvineCA92617 United States Federal University of Rio Grande Do Sul Institute of Informatics Porto Alegre Brazil Center for Embedded Computer Systems School of Information and Computer Science University of Calfornia Irvine IrvineCA92697 United States

Advances in technology scaling increasingly make emerging Chip MultiProcessor (CMP) platforms more susceptible to failures that cause various reliability challenges. In such platforms, error-prone on-chip memories (caches) continue to dominate the chip area. Also, Network-on-Chip (NoC) fabrics are increasingly used to manage the scalability of these architectures. We present a novel solution for efficient implementation of fault-tolerant design of Last-Level Cache (LLC) in CMP architectures. The proposed approach leverages the interconnection network fabric to protect the LLC cache banks against permanent faults in an efficient and scalable way. During an LLC access to a faulty block, the network detects and corrects the faults, returning the fault-free data to the requesting core. Leveraging the NoC interconnection fabric, designers can implement any cache fault-tolerant scheme in an efficient, modular, and scalable manner for emerging multicore/manycore platforms. We propose four different policies for implementing a remapping-based fault-tolerant scheme leveraging the NoC fabric in different settings. The proposed policies enable design trade-offs between NoC traffic (packets sent through the network) and the intrinsic parallelism of these communication mechanisms, allowing designers to tune the system based on design constraints. We perform an extensive design space exploration on NoC benchmarks to demonstrate the usability and efficacy of our approach. In addition, we perform sensitivity analysis to observe the behavior of various policies in reaction to improvements in the NoC architecture. The overheads of leveraging the NoC fabric are minimal: on an 8-core, 16-cache-bank CMP we demonstrate reliable access to LLCs with additional overheads of less than 3% in area and less than 7% in power. © 2014 ACM.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Comparison of static and dynamic resource allocations for massively multiplayer online games on unreliable resources

Comparison of static and dynamic resource allocations for ma...

引用

Lecture Notes in computer science

作者： Prodan, Radu Iosup, Alexandru Bologa, Cristian Institute of Computer Science University of Innsbruck Austria Parallel and Distributed Systems Delft University of Technology Netherlands Babeş-Bolyai University Cluj-Napoca Romania

ISBN: (纸本)9783319143248

We investigate the use of a new Massively Multiplayer Online Gaming (MMOG) ecosystem consisting of end-users, game providers, game operators, and Cloud resource providers, for autonomous, selfadaptive hosting and operation of MMOGs on unreliable resources. For this purpose, we developed an MMOG simulator compliant with our MMOG ecosystem in which we inject traces collected from a real-world MMOG and resource characteristics from 16 Cloud providers. Using our simulator, we study the impact on the involved actors by considering different resource availability levels, and highlight the advantages of dynamic resource allocation over the static overprovisioning with respect to two types of metrics: QoS offered to the clients and financial profit of game providers and operators. © Springer International Publishing Switzerland 2014.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

HSkip+: A self-stabilizing overlay network for nodes with heterogeneous bandwidths 14

HSkip+: A self-stabilizing overlay network for nodes with he...

引用

14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014

作者： Feldotto, Matthias Scheideler, Christian Graffi, Kalman Heinz Nixdorf Institute Department of Computer Science University of Paderborn Germany Theory of Distributed Systems Group Department of Computer Science University of Paderborn Germany Technology of Social Networks Group Department of Computer Science University of Düsseldorf Germany

ISBN: (纸本)9781479962013

In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [1] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates. © 2014 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Design, implementation and simulation of an experimental processing architecture for enhancing real-time video services by combining VANET, cloud computing system and onboard navigation system

Design, implementation and simulation of an experimental pro...

引用

International Conference on Pervasive and embedded Computing and Communication systems (PECCS)

作者： K. Hammoudi N. Ajam M. Kasraoui F. Dornaika K. Radhakrishnan K. Bandi Q. Cai S. Liu Research Institute on Embedded Electronic Systems (IRSEEM) IIS Group St-Etienne-du-Rouvray France Department of Computer Science and Artificial Intelligence University of the Basque Country San Sebastián Spain ESIGELEC School of Engineering Department of ICT(∗MS Students) St-Etienne-du-Rouvray France

ISBN: (纸本)9781467384063

In this paper, we propose a design for novel and experimental cloud computing systems. The proposed system aims at enhancing computational, communicational and annalistic capabilities of road navigation services by merging several independent technologies, namely vision-based embedded navigation systems, prominent Cloud Computing systems (CCSs) and Vehicular Ad-hoc NETwork (VANET). This work presents our initial investigations by describing the design of a global generic system. The designed system has been experimented with various scenarios of video-based road services. Moreover, the associated architecture has been implemented on a small-scale simulator of an in-vehicle embedded system. The implemented architecture has been experimented in the case of a simulated road service to aid the police agency. The goal of this service is to recognize and track searched individuals and vehicles in a real-time monitoring system remotely connected to moving cars. The presented work demonstrates the potential of our system for efficiently enhancing and diversifying real-time video services in road environments.

关键词： Cloud computing Vehicles Roads Vehicular ad hoc networks Real-time systems Streaming media computer architecture

来源：评论

学校读者我要写书评

暂无评论

Computation and communication efficient graph processing with distributed immutable view 14

Computation and communication efficient graph processing wit...

引用

23rd ACM Symposium on High-Performance Parallel and distributed Computing, HPDC 2014

作者： Chen, Rong Ding, Xin Wang, Peng Chen, Haibo Zang, Binyu Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450327480

Cyclops is a new vertex-oriented graph-parallel framework for writing distributed graph analytics. Unlike existing distributed graph computation models, Cyclops retains simplicity and computation-efficiency by synchronously computing over a distributed immutable view, which grants a vertex with read-only access to all its neighboring vertices. The view is provided via readonly replication of vertices for edges spanning machines during a graph cut. Cyclops follows a centralized computation model by assigning a master vertex to update and propagate the value to its replicas unidirectionally in each iteration, which can significantly reduce messages and avoid contention on replicas. Being aware of the pervasively available multicore-based clusters, Cyclops is further extended with a hierarchical processing model, which aggregates messages and replicas in a single multicore machine and transparently decomposes each worker into multiple threads ondemand for different stages of computation. We have implemented Cyclops based on an open-source Pregel clone called Hama. Our evaluation using a set of graph algorithms on an in-house multicore cluster shows that Cyclops outperforms Hama from 2.06X to 8.69X and 5.95X to 23.04X using hash-based and Metis partition algorithms accordingly, due to the elimination of contention on messages and hierarchical optimization for the multicore-based clusters. Cyclops (written in Java) also has comparable performance with PowerGraph (written in C++) despite the language difference, due to the significantly lower number of messages and avoided contention. Copyright © 2014 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Bipartite-oriented distributed graph partitioning for big learning 14

Bipartite-oriented distributed graph partitioning for big le...

引用

5th ACM Asia-Pacific Workshop on systems, APSYS 2014

作者： Chen, Rong Shi, Jiaxin Zang, Binyu Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450330244

Many machine learning and data mining (MLDM) problems like recommendation, topic modeling and medical diagnosis can be modeled as computing on bipartite graphs. However, most distributed graph-parallel systems are oblivious to the unique characteristics in such graphs and existing online graph partitioning algorithms usually causes excessive replication of vertices as well as significant pressure on network communication. This article identifies the challenges and opportunities of partitioning bipartite graphs for distributed MLDM processing and proposes BiGraph, a set of bipartite-oriented graph partitioning algorithms. BiGraph leverages observations such as the skewed distribution of vertices, discriminated computation load and imbalanced data sizes between the two subsets of vertices to derive a set of optimal graph partition algorithms that result in minimal vertex replication and network communication. BiGraph has been implemented on PowerGraph and is shown to have a performance boost up to 17.75X (from 1.38X) for four typical MLDM algorithms, due to reducing up to 62% vertex replication, and up to 96% network traffic. © 2014 ACM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Concurrent and consistent virtual machine introspection with hardware transactional memory

Concurrent and consistent virtual machine introspection with...

引用

20th IEEE International Symposium on High Performance computer Architecture, HPCA 2014

作者： Liu, Yutao Xia, Yubin Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781479930975

Virtual machine introspection, which provides tamperresistant, high-fidelity 'out of the box' monitoring of virtual machines, has many prominent security applications including VM-based intrusion detection, malware analysis and memory forensic analysis. However, prior approaches are either intrusive in stopping the world to avoid race conditions between introspection tools and the guest VM, or providing no guarantee of getting a consistent state of the guest VM. Further, there is currently no effective means for timely examining the VM states in question. In this paper, we propose a novel approach, called TxIntro, which retrofits hardware transactional memory (HTM) for concurrent, timely and consistent introspection of guest VMs. Specifically, TxIntro leverages the strong atomicity of HTM to actively monitor updates to critical kernel data structures. Then TxIntro can mount introspection to timely detect malicious tampering. To avoid fetching inconsistent kernel states for introspection, TxIntro uses HTM to add related synchronization states into the read set of the monitoring core and thus can easily detect potential inflight concurrent kernel updates. We have implemented and evaluated TxIntro based on Xen VMM on a commodity Intel Haswell machine that provides restricted transactional memory (RTM) support. To demonstrate the effectiveness of TxIntro, we implemented a set of kernel rootkit detectors using TxIntro. Evaluation results show that TxIntro is effective in detecting these rootkits, and is efficient in adding negligible performance overhead. © 2014 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Inside risks: Keys under doormats

引用

Communications of the ACM 2015年第10期58卷 24-26页

作者： Abelson, Harold Anderson, Ross Bellovin, Steven M. Benaloh, Josh Blaze, Matt Diffie, Whitfield Gilmore, John Green, Matthew Landau, Susan Neumann, Peter G. Rivest, Ronald L. Schiller, Jeffrey I. Schneier, Bruce Specter, Michael A. Weitzner, Daniel J. MIT Creative Commons Free Software Foundation United States University of Cambridge United Kingdom Computer Science Columbia University United States Microsoft Research United States University of Pennsylvania Distributed Systems Lab. United States Internet-Scale Communications United States Sun Microsystems Cygnus Solutions Electronic Frontier Foundation Cypherpunks Internet's alt newsgroups United States Johns Hopkins University Information Security Institute United States Worcester Polytechnic Institute United States Computer Science Lab SRI International ACM Risks Forum United States MIT Institute RSA Security and Verisign United States Internet Engineering Steering Group United States Berkman Center for Internet and Society Harvard Law School Resilient Systems Inc United States MIT Computer Science and Artificial Intelligence Lab MIT Cybersecurity and Internet Policy Research Initiative United States

The complexity of today's Internet environment means new law enforcement requirements are likely to introduce unanticipated security flaws. Political and law enforcement leaders in the U.S. and the U.K. have called for Internet systems to be redesigned to ensure government access to information even encrypted information. There are three general problems. First, providing exceptional access to communications would force a U-turn from the best practices now being deployed to make the Internet more secure. These practices include forward secrecy, where decryption keys are deleted immediately after use, so that stealing the encryption key used by a communications server would not compromise earlier or later communications. Second, building in exceptional access would substantially increase system complexity. Third, exceptional access would create concentrated targets that could attract bad actors. Moreover, law enforcement's stated need for rapid access to data would make it impractical to store keys offline or split keys among multiple key holders, as security engineers would normally do with extremely high-value credentials.

关键词： Law enforcement

来源：评论

学校读者我要写书评

暂无评论

Density estimation with adaptive sparse grids for large data sets 14

Density estimation with adaptive sparse grids for large data...

引用

14th SIAM International Conference on Data Mining, SDM 2014

作者： Peherstorfer, Benjamin Pflüger, Dirk Bungartz, Hans-Joachim Aerospace Computational Design Laboratory AeroAstro Massachusetts Institute of Technology United States Simulation of Large Systems Group Institute for Parallel and Distributed Systems University of Stuttgart Germany Scientific Computing Group Department of Computer Science Technische Universität München Germany

ISBN: (纸本)9781510811515

Nonparametric density estimation is a fundamental problem of statistics and data mining. Even though kernel density estimation is the most widely used method, its performance highly depends on the choice of the kernel bandwidth, and it can become computationally expensive for large data sets. WTe present an adaptive sparse-grid-based density estimation method which discretizes the estimated density function on basis functions centered at grid points rather than on kernels centered at the data points. Thus, the costs of evaluating the estimated density function are independent from the number of data points. We give details on how to estimate density functions on sparse grids and develop a cross validation technique for the parameter selection. We show numerical results to confirm that our sparse-grid-based method is well-suited for large data sets, and, finally, employ our method for the classification of astronomical objects to demonstrate that it is competitive to current kernel-based density estimation approaches with respect to classification accuracy and runtime. Copyright © SIAM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：