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

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Benjamin Ries Walter Unger Maximilian Odendahl Rainer Leupers Department of Computer Science I Institute for Communication Technologies and Embedded Systems RWTH Aachen University Aachen Germany

In the past memory allocation and communication between processors and memories in current MPSoC's, due to the small design space, was not a big challenge. Through advanced MPSoC's and improving techniques to interface Dynamic RAM (DRAM), allocation of logical data buffers to physical memories is no longer manageable manually. We present a heuristic for the mapping of logical data buffers to physical memories and the routing of data flows. Our heuristic use an approximation scheme to obtain an fractional solution, and randomized rounding. We evaluate our implementation for different values of e using representative data of the Long Term Evolution Standard.

关键词： Approximation methods Routing Resource management Random access memory Approximation algorithms Bandwidth Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

RFA-Cut: Semi-automatic Segmentation of Radiofrequency Ablation Zones with and without Needles via Optimal s-t-Cuts

RFA-Cut: Semi-automatic Segmentation of Radiofrequency Ablat...

引用

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

作者： Jan Egger Harald Busse Philipp Brandmaier Daniel Seider Matthias Gawlitza Steffen Strocka Philip Voglreiter Mark Dokter Michael Hofmann Bernhard Kainz Xiaojun Chen Alexander Hann Pedro Boechat Wei Yu Bernd Freisleben Tuomas Alhonnoro Mika Pollari Michael Moche Dieter Schmalstieg Institute for Computer Graphics and Vision Graz University of Technology Austria Dept. of Diagnostic and Interventional Radiology Leipzig University Hospital Germany Dept. of Computing Imperial College London UK School of Mechanical Engineering Shanghai Jiao Tong University Shanghai China Dept. of Internal Medicine and Gastroenterology Katharinenhospital Stuttgart Germany Distributed Systems Group Philipp University of Marburg Germany School of Science Aalto University Espoo Finland

ISBN: (纸本)9781424492695

In this contribution, we present a semi-automatic segmentation algorithm for radiofrequency ablation (RFA) zones via optimal s-t-cuts. Our interactive graph-based approach builds upon a polyhedron to construct the graph and was specifically designed for computed tomography (CT) acquisitions from patients that had RFA treatments of Hepatocellular Carcinomas (HCC). For evaluation, we used twelve post-interventional CT datasets from the clinical routine and as evaluation metric we utilized the Dice Similarity Coefficient (DSC), which is commonly accepted for judging computer aided medical segmentation tasks. Compared with pure manual slice-by-slice expert segmentations from interventional radiologists, we were able to achieve a DSC of about eighty percent, which is sufficient for our clinical needs. Moreover, our approach was able to handle images containing (DSC=75.9%) and not containing (78.1%) the RFA needles still in place. Additionally, we found no statistically significant difference (p<0.423) between the segmentation results of the subgroups for a Mann-Whitney test. Finally, to the best of our knowledge, this is the first time a segmentation approach for CT scans including the RFA needles is reported and we show why another state-of-the-art segmentation method fails for these cases. Intraoperative scans including an RFA probe are very critical in the clinical practice and need a very careful segmentation and inspection to avoid under-treatment, which may result in tumor recurrence (up to 40%). If the decision can be made during the intervention, an additional ablation can be performed without removing the entire needle. This decreases the patient stress and associated risks and costs of a separate intervention at a later date. Ultimately, the segmented ablation zone containing the RFA needle can be used for a precise ablation simulation as the real needle position is known.

关键词： RFA decreases patient stress

来源：评论

学校读者我要写书评

暂无评论

Concurrent and consistent virtual machine introspection with hardware transactional memory

Concurrent and consistent virtual machine introspection with...

引用

IEEE Symposium on High-Performance computer Architecture

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

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.

关键词： Kernel Monitoring Educational institutions Abstracts Single photon emission computed tomography Virtual machine monitors Continuous wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

ChaosFIRE: An experiment with chaoster, the context-aware collaboration platform for crisis/chaos management

ChaosFIRE: An experiment with chaoster, the context-aware co...

引用

IEEE Annual Conference on Pervasive Computing and Communications Workshops (PerCom)

作者： László Kovács Balázs E. Pataki MTA SZTAKI DSD Department of Distributed Systems Institute for Computer Science and Control Hungarian Academy of Sciences Budapest Hungary

Summary form only given. ChaosFIRE is an experiment project to evaluate the performance and usability of peer-to-peer mobile technologies as an alternative mean to central service based solutions to collect and distribute sensor information in an urban area. The Project runs under the 1st Open Call of Fed4FIRE IP under FP7 and is based on the technology developed in the Chaoster project of MTA SZTAKI DSD. Chaoster is a DTN-PSN (Delay Tolerant Networking - Pocket Switched Network) based adaptive, context-aware collaboration platform supporting emergent interoperability for crisis/chaos management. DTN-PSN communication layer of Chaoster is used in this experiment together with the ChaosONE simulator, for the evaluation of DTN communication protocols. This talk will present the Chaoster platform, the target use cases of the solution and the aims and results of the ChaosFIRE experiment.

关键词： Chaotic communication Collaboration computer science Peer-to-peer computing Mobile communication Interoperability

来源：评论

学校读者我要写书评

暂无评论

Demonstration abstract: An 8×8 mm2 Bluetooth Low Energy wireless motion-sensing platform

Demonstration abstract: An 8×8 mm2 Bluetooth Low Energy wir...

引用

International Symposium on Information Processing in Sensor Networks (IPSN)

作者： Tong Kun Lai Anping Wang Chun-Min Chang Hua-Min Tseng Kailing Huang Jo-Ping Li Wen-Chan Shih Pai H. Chou Department of Computer Science National Tsing Hua University Taiwan Institute of Information Science Academia Sinica Taiwan Center for Embedded Computer Systems University of California Irvine USA

This demo presents the world's smallest wireless motion-sensing platform based on Bluetooth 4.0 Low Energy (BLE) Technology. It is merely 8×8 mm 2 in area but is complete with a user-programmable microcontroller and integrated RF, a digital triaxial accelerometer with programmable threshold detection, and a real-time clock and calendar chip, and a magnetic sensor/switch. This system has been used in a number of applications, including a proximity tag, a pedometer, an air mouse with gesture recognition, and a BLE-to-IR remote controller.

关键词： Accelerometers Wireless sensor networks Mice Universal Serial Bus Bluetooth Radio frequency Switches

来源：评论

学校读者我要写书评

暂无评论

Computational Offloading or Data Binding? Bridging the Cloud Infrastructure to the Proximity of the Mobile User

Computational Offloading or Data Binding? Bridging the Cloud...

引用

IEEE International Conference on Mobile Cloud Computing, Services, and Engineering

作者： Huber Flores Satish Narayana Srirama Rajkumar Buyya University of Tartu Institute of Computer Science Mobile Cloud Lab University of Melbourne Department of Computing and Information Systems Cloud Computing and Distributed Systems Laboratory (CLOUDS)

ISBN: (纸本)9781479944248

Mobile and cloud computing are converging as the prominent technologies that are leading the change to the post personal computing (PC) era. Computational offloading and data binding are the core techniques that foster to elastically augment the capabilities of low-power devices, such as smartphones. Mobile applications may be bonded to cloud resources by following a task delegation or code offloading criteria. In a delegation model, a handset can utilize the cloud in a service-oriented manner to delegate asynchronously a resource-intensive mobile task by direct invocation of the service. In contrast, in an offloading model, a mobile application is partitioned and analyzed so that the most computational expensive operations at code level can be identified and offloaded to a remote cloud-based surrogate. We compared in this paper, the mobile cloud computing models for offloading and delegation. We utilized our own frameworks for computational offloading and data binding in the analysis. While in principle, offloading and delegation are viable methods to augment the capabilities of the mobile devices with cloud power, they enrich the mobile applications from different perspectives at diverse computational scales.

关键词： Mobile Cloud Computing Access Models Code Offloading Task Delegation Middleware Mobile Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Computing infrastructure for big data processing

引用

Frontiers of computer science 2013年第2期7卷 165-170页

作者： Ling LIU Distributed Data Intensive Systems Lab School of Computer Science Georgia Institute of TechnologyUSA Atlanta 30332

With computing systems undergone a fundamen- tal transformation from single-processor devices at the turn of the century to the ubiquitous and networked devices and the warehouse-scale computing via the cloud, the parallelism has become ubiquitous at many levels. At micro level, par- allelisms are being explored from the underlying circuits, to pipelining and instruction level parallelism on multi-cores or many cores on a chip as well as in a machine. From macro level, parallelisms are being promoted from multiple ma- chines on a rack, many racks in a data center, to the glob- ally shared infrastructure of the Internet. With the push of big data, we are entering a new era of parallel computing driven by novel and ground breaking research innovation on elas- tic parallelism and scalability. In this paper, we will give an overview of computing infrastructure for big data processing, focusing on architectural, storage and networking challenges of supporting big data paper. We will briefly discuss emerging computing infrastructure and technologies that are promising for improving data parallelism, task parallelism and encour- aging vertical and horizontal computation parallelism.

关键词： big data cloud computing data analytics elas-tic scalability heterogeneous computing GPU PCM bigdata processing

来源：评论

学校读者我要写书评

暂无评论

Imprecise Computation Over the Cloud

Imprecise Computation Over the Cloud

引用

IEEE International Conference on Mobile Cloud Computing, Services, and Engineering

作者： Chi-Sheng SHIH Joen CHEN Yu-Hsin WANG Norman CHANG Embedded Systems and Wireless Networking Lab Graduate Institute of Networking and Multimedia Department of Computer Science and Information Engineering National Taiwan University

ISBN: (纸本)9781479944248

The number and variety of applications for mobile devices continue to grow. However, the resources on mobile devices including computation and storage do not keep pace with the growth. How to incorporate the computation capacity on cloud servers into mobile computing has been desired and challenge issues to resolve. In this work, we design a flexible computation framework to take advantage the heterogeneous computation capacity on cloud servers, which are CPUs and GPGPUs, to meet the computation demands of ever growing mobile applications. The computation framework extends OpenCL framework to link remote processors with local mobile applications. The framework is flexible in the sense that the computation can be stopped at any time and gains results, which is called imprecise computation in real-time computing literature. The framework has been evaluated against OpenCL benchmark and physical computation engine for gaming. The results show that the framework supports OpenCL benchmark, RODINIA, without modifying the codes with few exceptions. The imprecise computation model allows the cloud servers to support more mobile clients without sacrificing their QoS requirements. The experiment results also show that IO intensive applications do not perform well when the network capacity is insufficient or unreliable.

关键词： OpenCL GPGPU Heterogeneous computing Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Replication-Based Fault-Tolerance for Large-Scale Graph Processing

Replication-Based Fault-Tolerance for Large-Scale Graph Proc...

引用

International Conference on Dependable systems and Networks (DSN)

作者： Peng Wang Kaiyuan Zhang Rong Chen Haibo Chen Haibing Guan Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Department of Computer Science Shanghai Jiao Tong University

The increasing algorithm complexity and dataset sizes necessitate the use of networked machines for many graph-parallel algorithms, which also makes fault tolerance a must due to the increasing scale of machines. Unfortunately, existing large-scale graph-parallel systems usually adopt a distributed checkpoint mechanism for fault tolerance, which incurs not only notable performance overhead but also lengthy recovery time. This paper observes that the vertex replicas created for distributed graph computation can be naturally extended for fast in-memory recovery of graph states. This paper proposes Imitator, a new fault tolerance mechanism, that supports cheaply maintenance of vertex states by replicating vertex states to their replicas during normal message exchanges, and provides fast in-memory reconstruction of failed vertices from replicas in other machines. Imitator has been implemented by extending Hama, a popular open-source clone of Pregel. Evaluation shows that Imitator incurs negligible performance overhead (less than 5% for all cases) and can recover from failures of more than one million of vertices with less than 3.4 seconds.

关键词： Fault tolerance Fault tolerant systems computer crashes Checkpointing Synchronization Clustering algorithms Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Formal model of certificate omission schemes in VANET

Formal model of certificate omission schemes in VANET

引用

IEEE Vehicular Networking Conference (VNC)

作者： Michael Feiri Jonathan Petit Frank Kargl Services Cybersecurity and Safety University of Twente The Netherlands Department of Computer Science University College Cork Ireland Institute of Distributed Systems University of Ulm Germany

The benefits of certificate omission schemes in VANET have been so far proven by simulation. However, the research community is lacking of a formal model that would allow implementers and policy makers to select the optimal parameters for such schemes. In this paper, we lay the foundations of the formal model for certificate omission schemes in VANET. We apply the model to `No Omission' and `Periodic Omission', which validates the previous simulation and formulates the optimal parameters for these schemes.

关键词： Communication channels Vehicles Vehicular ad hoc networks Conferences Packet loss Receivers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：