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

pre-computed Region Guardian Sets Based Reverse kNN Queries

DATA SCIENCE AND ENGINEERING 2016年第4期1卷 242-251页

作者： Song, Wei Qin, Jianbin Cheema, Muhammad Aamir Wang, Wei Univ New South Wales Sch Comp Sci & Engn Sydney NSW Australia Monash Univ Clayton Sch Informat Technol Fac Informat Technol Melbourne Vic Australia

Given a set of objects and a query q, a point p is q's Reverse k Nearest Neighbour (RkNN) if q is one of p's k-closest objects. RkNN queries have received significant research attention in the past few years. However, we realize that the state-of-the-art algorithm, SLICE, accesses many objects that do not contribute to its RkNN results when running the filtering phase, which deteriorates the query performance. In this paper, we propose a novel RkNN algorithm with pre-computation by partitioning the data space into disjoint rectangular regions and constructing the guardian set for each region R. We guarantee that, for each q that lies in R, its RkNN results are only affected by the objects in R's guardian set. The advantage of this approach is that the results of a query q is an element of R can be computed by using SLICE on only the objects in its guardian set instead of using the whole dataset. Besides, we raise two new useful variants of RkNN and propose algorithms. Our comprehensive experimental study on synthetic and real the proposed approaches are the most efficient algorithms for RkNN and its variants.

关键词： RkNN Variants pre-computation Guardian Set SLICE

来源：评论

学校读者我要写书评

暂无评论

Power Efficient Architecture of pre-computation Based Content Addressable Memory

Power Efficient Architecture of Pre-computation Based Conten...

引用

International Conference on Computer Communication and Informatics

作者： S. Jeeva S. Bharathi C. N. Marimuthu Department of ECE M.Kumarasamy College of Engineering

ISBN: (纸本)9781457715808;9781457715839

Content-addressable memory (CAM) is frequently used in applications, such as lookup tables, data bases, associative computing and networking that require high-speed searches in order to improve the performance. By using parallel comparison search time is reduced but power consumption is raised. In this paper we proposed Banked architecture which will reduce most of the dissipated power with negligible hardware complexity. In this PB-CAM architecture most of the work is carried out by parameter extractor and hence total work of this Banked architecture is reduced that saves energy during searching operation. Once the work operation is selected, search is done locally so that remaining banks will be disabled which saves power. In our experiment we used Xilinx to estimate the power consumption. Compared with the ones count PB-CAM system the experimental result shows that our proposed approach can achieve on average 30% of power reduction.

关键词： CAM Power reduction pre-computation

来源：评论

学校读者我要写书评

暂无评论

A pre-computed Brain Response Atlas for Instantaneous Strain Estimation in Contact Sports

引用

ANNALS OF BIOMEDICAL ENGINEERING 2015年第8期43卷 1877-1895页

作者： Ji, Songbai Zhao, Wei Dartmouth Coll Thayer Sch Engn Hanover NH 03755 USA Geisel Sch Med Dartmouth Dept Surg & Orthopaed Surg Hanover NH 03755 USA

Finite element models of the human head play an important role in investigating the mechanisms of traumatic brain injury, including sports concussion. A critical limitation, however, is that they incur a substantial computational cost to simulate even a single impact. Therefore, current simulation schemes significantly hamper brain injury studies based on model-estimated tissue-level responses. In this study, we present a pre-computed brain response atlas (pcBRA) to substantially increase the simulation efficiency in estimating brain strains using isolated rotational acceleration impulses parameterized with four independent variables (peak magnitude and duration, and rotational axis azimuth and elevation angles) with values determined from on-field measurements. Using randomly generated testing datasets, the partially established pcBRA achieved a 100% success rate in interpolation based on element-wise differences in accumulated peak strain () according to a "double-10%" criterion or average regional in generic regions and the corpus callosum. A similar performance was maintained in extrapolation. The pcBRA performance was further successfully validated against directly simulated responses from two independently measured typical real-world rotational profiles. The computational cost to estimate element-wise whole-brain or regional was 6 s and < 0.01 s, respectively, vs. 50 min directly simulating a 40 ms impulse. These findings suggest the pcBRA could substantially increase the throughput in impact simulation without significant loss of accuracy from the estimation itself and, thus, its potential to accelerate the exploration of the mechanisms of sports concussion in general. If successful, the pcBRA may also become a diagnostic adjunct in conjunction with sensors that measure head impact kinematics on the field to objectively monitor and identify tissue-level brain trauma in real-time for "return-to-play" decision-making on the sideline.

关键词： Traumatic brain injury Sports concussion Rotational acceleration pre-computation Dartmouth Head Injury Model

来源：评论

学校读者我要写书评

暂无评论

Design of an Intelligent DMA System Architecture with Data pre-processing

Design of an Intelligent DMA System Architecture with Data P...

引用

2016 2nd International Conference on Advances in Mechanical Engineering and Industrial Informatics(AMEII 2016)

作者： Pengyi Wu Zhaolin Li Institute of Microelectronics Tsinghua University Research Institute of Information Technology Tsinghua University

ISBN: (纸本)9781510823808

DMA is often used to transfer data between different kinds of memory-mapped slave *** is a common peripheral component for *** order to make full use of the time during the reading and writing,this paper proposed an intelligent *** with the traditional DMA,a newly designed operational unit is added to the RAM-based architecture and the parameter RAM(PRAM) is improved to suits the whole DMA *** supports floating-point computation and the interface is designed based on the AMBA bus protocol *** algorithm has been used to evaluate the proposed design.

关键词： DSP DMA PRAM Floating-point computation pre-computation

来源：评论

学校读者我要写书评

暂无评论

Verifiable computation of Large Polynomials 6th

Verifiable Computation of Large Polynomials

引用

6th International Conference on Trustworthy Systems (INTRUST)

作者： Hong, Jiaqi Xu, Haixia Li, Peili Chinese Acad Sci Inst Informassurance Beijing Peoples R China Chinese Acad Sci Commun Secur Res Ctr Beijing Peoples R China Chinese Acad Sci Grad Univ Beijing Peoples R China

ISBN: (纸本)9783319279985;9783319279978

Due to the proliferation of powerful cloud service, verifiable computation, which makes a computationally weak client perform intensive computations possible through outsourcing tasks to a powerful server, is attracting increasing attention. The correctness of the returned result should be verified as the server may be not trusted. In this paper, we present a verifiable computation protocol on large polynomials, which can be publicly verified by any parties in the network. Compared with verifiable computation protocol presented by Backes et al., which is on quadratic, multi-variable polynomials, our verifiable computation protocol is on high degree, multi-variable polynomials and publicly verifiable.

关键词： Verifiable computation Amortized pre-computation Public verification

来源：评论

学校读者我要写书评

暂无评论

Design of low area list successive cancellation decoder for polar codes 12

Design of low area list successive cancellation decoder for ...

引用

International Society Design Conference

作者： Piao, Zheyan Chung, Jin-Gyun Chonbuk Natl Univ Div Elect Engn Jeonju South Korea

ISBN: (纸本)9781467393089

Polar codes are the first constructive and provable capacity-achieving codes. Compared to conventional successive cancellation (SC) decoders, SCL (list SC) decoders have performances very close to those of the maximum-likelihood (ML) decoders. In SCL decoders with large list size, however, the hardware increase is a severe problem since an SCL decoder with list size L consists of L copies of SC decoders. In this paper, a low area SCL decoder architecture is proposed. It is shown that the proposed SCL decoder can reduce about 70% merged processing elements compared with conventional SCL decoders when the list size is larger than 32.

关键词： polar codes list SC decoder pre-computation low area

来源：评论

学校读者我要写书评

暂无评论

Multi-tiers Route Design Coordinating QoS-specific K Shortest Paths over Optical Network

Multi-tiers Route Design Coordinating QoS-specific K Shortes...

引用

IEEE International Conference on Communications (ICC)

作者： Tode, Hideki Takada, Masashi Tanigawa, Yosuke Osaka Prefecture Univ Dept Comp Sci & Intelligent Syst Naka Ku 1-1 Gakuen Cho Sakai Osaka 5998531 Japan

ISBN: (纸本)9781467363051

In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' <= K) routes pre-computed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.

关键词： K shortest paths Multi-tiers route design pre-computation Multiple QoS

来源：评论

学校读者我要写书评

暂无评论

High Speed Low Energy CAM Design using Reordered Overlapping

High Speed Low Energy CAM Design using Reordered Overlapping

引用

IEEE International Conference on Engineering and Technology (ICETECH)

作者： Sowmya, P. Vanitha, K. KS Rangasamy Coll Technol Dept Elect & Commun Engn Namakkal India

ISBN: (纸本)9781479918546

In this paper, a reordered search mechanism is introduced for high-speed low-power content-addressable memories (CAMs). Only by searching a few bits of a search word the mismatches can be occured. So to reduce the power consumption, search word circuit is partitioned into two sections that are searched sequentially. Searching will be faster if the last few bits is compared other than the rest of the bits. Each word circuit has a local control signal which controls the circuit. This allows the circuits to be operated in the required phase which greatly reduces the cycle time.

关键词： reordering NAND-type CAM pre-computation

来源：评论

学校读者我要写书评

暂无评论

Multi-tiers Route Design Coordinating QoS-specific K Shortest Paths over Optical Network

Multi-tiers Route Design Coordinating QoS-specific K Shortes...

引用

International Conference on Communication Workshop

作者： Hideki Tode Masashi Takada Yosuke Tanigawa Dept. of Computer Science and Intelligent Systems Osaka Prefecture University Naka-ku Sakai Osaka Japan

In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' < K) routes pre-computed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.

关键词： K shortest paths Multi-tiers route design pre-computation Multiple QoS

来源：评论

学校读者我要写书评

暂无评论

A Hybrid End-to-End QoS Path computation Algorithm for PCE-Based Multi-Domain Networks

引用

JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT 2014年第4期22卷 682-708页

作者： Frikha, Ahmed Lahoud, Samer Cousin, Bernard Univ Rennes 1 IRISA F-35042 Rennes France

Inter-domain quality of service (QoS) routing is a challenging problem for today's Internet. This problem requires the computation of paths that cross multiple domains and meet different QoS constraints. In addition, the used computation methods must meet the constraints of confidentiality and autonomy imposed by the domains of different operators. Path computation element (PCE)-based architecture offers a promising solution for inter-domain QoS routing. It ensures the computation of end-to-end QoS paths while preserving the confidentiality and the autonomy of the domains. In this paper, we propose a novel hybrid end-to-end QoS path computation algorithm, named HID-MCP, for PCE-based networks. HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Moreover, it integrates a crankback mechanism for improving path computation results in a single domain or in multiple domains based on the PCE architecture. Detailed analyses are provided to assess the performance of our algorithm in terms of success rate and computational complexity. The simulation results show that our algorithm has an acceptance rate of the requests very close to the optimal solution;precisely, the difference is lower than 1 % in a realistic network. Moreover, HID-MCP has a low computational complexity. Besides, our solution relies on the PCE architecture to overcome the limitations related to inter-domain routing such as domain autonomy and confidentiality.

关键词： Inter-domain QoS routing Path computation element (PCE) Crankback mechanism pre-computation On-demand computation Look-ahead information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：