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

An efficient distributed search solution for federated cloud

DISTRIBUTED AND PARALLEL DATABASES 2017年第3-4期35卷 411-433页

作者： Zhu, Yongqing Xu, Quanqing Shi, Haixiang Samsudin, Juniarto ASTAR Data Storage Inst Singapore Singapore

Federated cloud enables data sharing across different organizations. This paper proposes a distributed search index (DS-index) solution to provide distributed search capability in federated cloud, with the target to support multi-attribute range queries with secondary indexes. DS-index deploys a three-layer architecture with a multi-attribute index overlay, a tree-based P2P network layer, and a federated cloud layer. We present a distributed search algorithm with the three-layer architecture. In order to facilitate distributed search, we propose a dynamic mapping algorithm for DS-index to map between different layers. In addition, a Markov Chain-based cost model is defined to facilitate node selection and mapping. With the dynamic mapping algorithm and cost model, the proposed DS-index solution is more cost-effective than the traditional P2P networks as it can reduce the network cost in terms of index maintenance cost and node selection cost. The experiments demonstrate that, our DS-index solution along with its cost model can save the computation resource and reduce network bandwidth consumption by around 30% comparing to the one without cost model. It can also reduce the number of node splits/merges by around 20% comparing to the state-of-the-art solution.

关键词： Distributed search Federated cloud Secondary index mapping algorithm Cost model Peer-to-peer network

来源：评论

学校读者我要写书评

暂无评论

Memory hierarchy for high-performance and energy-aware reconfigurable systems

引用

IET COMPUTERS AND DIGITAL TECHNIQUES 2007年第5期1卷 565-571页

作者： Ramo, E. P. Resano, J. Mozos, D. Catthoor, F. Univ Complutense Madrid Comp Architecture Dept E-28040 Madrid Spain Katholieke Univ Leuven Dept Elect Engn B-3001 Louvain Belgium IMEC VZW B-3001 Louvain Belgium

Run-time reconfigurable resources present many of the features such as high performance, flexibility and reusability demanded by next generation embedded systems. In addition, many emerging reconfigurable architectures have been optimised for low power. However, carrying out run-time reconfigurations often involves a costly reconfiguration overhead both in execution time and in energy consumption. Only the execution-time overhead was dealt with in the previous work. Here, the approach is significantly extended in order to reduce the reconfiguration energy overhead as well. To this end, a configuration memory hierarchy is proposed, with a shared memory layer consisting of a module optimised for performance combined with a module optimised for energy-efficient accesses. For this hierarchy, the authors have developed a mapping algorithm that decides where to load each configuration in order to achieve significant energy savings without introducing any performance degradation.

关键词： energy-efficient accesses energy savings high-performance reconfigurable systems reconfigurable architectures energy consumption configuration memory hierarchy power aware computing reconfiguration energy overhead run-time reconfigurable resources low power architectures shared memory layer module optimised mapping algorithm reconfiguration overhead embedded systems shared memory systems execution-time overhead energy-aware reconfigurable systems

来源：评论

学校读者我要写书评

暂无评论

Volumeter: 3D human body parameters measurement with a single Kinect

引用

IET COMPUTER VISION 2018年第4期12卷 553-561页

作者： He, Qinzhu Ji, Yijun Zeng, Dan Zhang, Zhijiang Shanghai Univ Key Lab Specialty Fiber Opt & Opt Access Networks 149 Yanchang Rd Shanghai 200072 Peoples R China

3D human body parameters measurement is a challenging task due to two main reasons: (i) it is dicult to reconstruct 3D human model due to flexible deformation of non-rigid body during images capturing process and (ii) there lies a gap between 3D model and body parameters. To address these two issues, a 3D human body parameters measurement system is represented. With the object freely spinning in front of a Kinect, body parameters are calculated. To reduce registration errors caused by body deformation while rotating, a piecewise tracking and mapping algorithm based on KinectFusion framework is proposed. Then model-model iterative closest point and non-rigid constraints are introduced to optimise alignments and disambiguate different surfaces caused by aliasing in the piecewise strategy. Finally, a novel method is presented to measure the volume and perimeter of human body with the truncated signed distance function values of voxels. Extensive experimental results show that the proposed method achieves comparable accuracy to the state of the arts, and the error of volume and perimeter measurements are 2.0 and 5.8%, respectively.

关键词： interactive devices volume measurement image capture object tracking solid modelling voxel truncated signed distance function values human body perimeter measurement human body volume measurement piecewise strategy nonrigid constraints model-model iterative closest point KinectFusion framework mapping algorithm piecewise tracking image capturing process nonrigid body flexible deformation 3D human model single Kinect 3D human body parameters measurement volumeter

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT HEURISTIC SCHEME FOR DYNAMIC REmapping OF PARALLEL COMPUTATIONS

引用

PARALLEL COMPUTING 1993年第6期19卷 621-632页

作者： CHOUDHARY, AN NARAHARI, B KRISHNAMURTI, R GEORGE WASHINGTON UNIV DEPT ELECT ENGN & COMP SCIWASHINGTONDC 20052 SYRACUSE UNIV DEPT ELECT & COMP ENGNSYRACUSENY 13244 SIMON FRASER UNIV SCH COMP SCIBURNABY V5A 1S6BCCANADA

In applications where a sequence of different tasks is to be performed, the computational load of a task varies dynamically and can become severely imbalanced between successive tasks. These dynamic changes in the load suggest that a remapping of the load must be performed before the next task in the sequence is executed. A remapping scheme must: (1) estimate load measures for each task and dynamically compute load distribution, then (2) compute a remapping and (3) remap the load according to the mapping generated in (2). This paper presents an experimental analysis of a heuristic remapping scheme applied to a motion estimation system in computer vision, and implemented on an Intel iPSC/2 machine. We discuss a fast heuristic mapping algorithm to compute the remapping that compares favorably with the slower optimal algorithm. Our experiments show that the heuristic remapping scheme results in significant performance gains, of over 3 times improvement in speedup, while incurring low overheads.

关键词： mapping algorithm COMPUTATION LOAD DISTRIBUTED MEMORY SYSTEM DYNAMIC REmapping SCHEME INTEL IPSC EXPERIMENTAL RESULTS

来源：评论

学校读者我要写书评

暂无评论

An Efficient Application mapping Approach for the Co-Optimization of Reliability, Energy, and Performance in Reconfigurable NoC Architectures

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2015年第8期34卷 1264-1277页

作者： Wu, Chen Deng, Chenchen Liu, Leibo Han, Jie Chen, Jiqiang Yin, Shouyi Wei, Shaojun Tsinghua Univ Inst Microelect Beijing 100084 Peoples R China Tsinghua Univ Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G2V4 Canada

In this paper, an efficient application mapping approach is proposed for the co-optimization of reliability, communication energy, and performance (CoREP) in network-on-chip (NoC)-based reconfigurable architectures. A cost model for the CoREP is developed to evaluate the overall cost of a mapping. In this model, communication energy and latency (as a measure of performance) are first considered in energy latency product (ELP), and then ELP is co-optimized with reliability by a weight parameter that defines the optimization priority. Both transient and intermittent errors in NoC are modeled in CoREP. Based on CoREP, a mapping approach, referred to as priority and ratio oriented branch and bound (PRBB), is proposed to derive the best mapping by enumerating all the candidate mappings organized in a search tree. Two techniques, branch node priority recognition and partial cost ratio utilization, are adopted to improve the search efficiency. Experimental results show that the proposed approach achieves significant improvements in reliability, energy, and performance. Compared with the state-of-the-art methods in the same scope, the proposed approach has the following distinctive advantages: 1) CoREP is highly flexible to address various NoC topologies and routing algorithms while others are limited to some specific topologies and/or routing algorithms;2) general quantitative evaluation for reliability, energy, and performance are made, respectively, before being integrated into unified cost model in general context while other similar models only touch upon two of them;and 3) CoREP-based PRBB attains a competitive processing speed, which is faster than other mapping approaches.

关键词： Energy latency mapping algorithm network-on-chip (NoC) reliability

来源：评论

学校读者我要写书评

暂无评论

A Flexible Energy- and Reliability-Aware Application mapping for NoC-Based Reconfigurable Architectures

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2015年第11期23卷 2566-2580页

作者： Liu, Leibo Wu, Chen Deng, Chenchen Yin, Shouyi Wu, Qinghua Han, Jie Wei, Shaojun Tsinghua Univ Inst Microelect Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2V4 Canada

This paper proposes a flexible energy- and reliability-aware application mapping approach for network-on-chip (NoC)-based reconfigurable architecture. A parameterized cost model is first developed by combining energy and reliability with a weight parameter that defines the optimization priority. Using this model, the overall mapping cost could be evaluated. Subsequently, a mapping method using branch and bound with a partial cost ratio is employed to find the best mapping by enumerating all the possible patterns organized in a search tree. To improve the search efficiency, nonoptimal mappings are discarded at early stages using the partial cost ratio. Using the proposed approach, applications can be mapped onto most NoC topologies and running with various routing algorithms when considering both energy and reliability. Other state-of-the-art works have also done substantial research for the same topic but only limited to a specific topology or routing algorithm. Even for the same topology and routing algorithm, the proposed approach still shows considerable advantages in many aspects. Experiments show that this approach gains not only significant reduction in energy but also improvement in reliability. It also outperforms other approaches in throughput and latency with competitive run time.

关键词： Energy mapping algorithm network on chip (NoC) reconfigurable hardware reliability

来源：评论

学校读者我要写书评

暂无评论

GTFS bus stop mapping to the OSM network

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2020年 110卷 393-406页

作者： Vuurstaek, Jan Cich, Glenn Knapen, Luk Ectors, Wim Yasar, Ansar-Ul-Haque Bellemans, Tom Janssens, Davy Hasselt Univ Transportat Res Inst IMOB Agoralaan B-3590 Diepenbeek Belgium

Due to budget constraints public transportation (PT) can no longer be deployed in regions where it attracts insufficient customers. Novel techniques such as demand-responsive collective transportation (DRT) are evaluated to cut costs. This requires detailed simulations that are able to predict travel demand and include trip execution. Simulating facilities acting as feeder services to time-table based PT services requires detailed and accurate information about the PT infrastructure on a network. However, there are no public data sources that combine network and PT infrastructure data with the preferred level of detail. This led to the development of a new bus stop mapping technique that combines the OpenStreetMap (OSM) and General Transit Feed Specification (GTFS) open data sources, which are maintained independently. Merging the data into a single database requires alignment. Developing bus stop mapping algorithms is challenging due to (i) inaccurate location data, (ii) inconsistent data sources and (iii) the vastly interconnected PT network and services. Due to the inaccuracy in the GTFS stop locations and in the OSM network, pure geometric considerations might lead to multiple candidate solutions to map a stop to the network. The new technique handles all GTFS trips at once and operates under the assumption that PT operators minimize the total distance driven to complete all trips. (C) 2018 Elsevier B.V. All rights reserved.

关键词： OpenStreetMap (OSM) General Transit Feed Specification (GTFS) Micro-simulation Public transport mapping algorithm

来源：评论

学校读者我要写书评

暂无评论

Bulk segregation analysis in the NGS era: a review of its teenage years

引用

PLANT JOURNAL 2022年第6期109卷 1355-1374页

作者： Li, Zhiqiang Xu, Yuhui Adsen Biotechnol Co Ltd Urumqi 830022 Peoples R China

Bulk segregation analysis (BSA) utilizes a strategy of pooling individuals with extreme phenotypes to conduct economical and rapidly linked marker screening or quantitative trait locus (QTL) mapping. With the development of next-generation sequencing (NGS) technology in the past 10 years, BSA methods and technical systems have been gradually developed and improved. At the same time, the ever-decreasing costs of sequencing accelerate NGS-based BSA application in different species, including eukaryotic yeast, grain crops, economic crops, horticultural crops, trees, aquatic animals, and insects. This paper provides a landscape of BSA methods and reviews the BSA development process in the past decade, including the sequencing method for BSA, different populations, different mapping algorithms, associated region threshold determination, and factors affecting BSA mapping. Finally, we summarize related strategies in QTL fine mapping combining BSA.

关键词： population bulk segregation analysis (BSA) next-generation sequencing (NGS) bulked segregant RNA-seq (BSR-seq) mapping algorithm threshold fine mapping

来源：评论

学校读者我要写书评

暂无评论

Collaborative Attributes and Resources for Single-Stage Virtual Network mapping in Network Virtualization

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2020年第1期22卷 61-71页

作者： Cao, Haotong Zhu, Hongbo Yang, Longxiang Nanjing Univ Posts & Telecommun Jiangsu Key Lab Wireless Commun Nanjing 210003 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Jiangsu Peoples R China

Virtual network embedding (VNE) is the virtualized node and link resources allocation problem in network virtualization environment, aiming at achieving the simultaneous optimal node and link mapping assignment per VN. Currently, a large number of mapping algorithms for VNE exist in the academia. Existing algorithms mostly focus on mapping each virtual network (VN) in two ordered stages: First virtual node mapping stage and second virtual link mapping stage, leading to non-optimal VN mapping assignment. Though multiple one-stage algorithms exist, adopting either optimization theory or graph theory, they usually involve much more VN assignment calculation time. Hence, these one-stage algorithms are not suitable for dynamic network scenario. Not to mention practical VNE application. Based on the background and our gained research results, we propose another heuristic mapping algorithm VNE-ARS, completing all nodes and links per VN in one single embedding stage. Each VN embedding assignment can be completed in polynomial time, using our VNE-ARS. Main network attributes and resources are collaborated, serving as the mapping criterion of our VNE-ARS. In order to highlight our VNE-ARS strength, we conduct the evaluation experiments. We compare our VNE-ARS algorithm against existing mapping algorithms.

关键词： Heuristic algorithm mapping algorithm network attributes one single stage two ordered stages virtual network embedding

来源：评论

学校读者我要写书评

暂无评论

Tool path-based deposition planning in fused deposition processes

引用

JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING-TRANSACTIONS OF THE ASME 2002年第2期124卷 462-472页

作者： Han, WB Jafari, MA Danforth, SC Safari, A Rutgers State Univ Dept Ind & Syst Engn Piscataway NJ 08854 USA Rutgers State Univ Dept Ceram & Mat Engn Piscataway NJ 08854 USA

The fabrication of a functional part requires very high layer quality in the Fused Deposition (FD) processes. The constant deposition flow rate currently used in FD technology cannot meet this requirement, due to the varying geometries of the layers. To achieve a high quality functional part, an overfill and underfill analysis is conducted. A deposition planning approach is proposed, which is based on a grouping and mapping algorithm. Two piezoelectric test parts have been built to demonstrate the effectiveness and feasibility of the proposed approach.

关键词： .varying high quality grouping proposed approach layer quality Fused Deposition functional part FD processes deposition flow FD technology ll analysis deposition planning approach mapping algorithm part strength

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：