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

19th IEEE-Computer-Society Annual Symposium on VLSI (ISVLSI)

作者： Tan, Weihang Wang, Antian Xu, Yunhao Lao, Yingjie Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA Southeast Univ Natl Mobile Commun Res Lab Nanjing Peoples R China

ISBN: (纸本)9781728157757

Polar codes have attracted increasing attention recently due to its low encoding and decoding complexity. Hardware optimization can further improve their implementations to enable real-time applications on resource-constrained devices. This paper presents an area-efficient architecture for Successive Cancellation (SC) polar decoder. Our proposed architecture adapts the optimization techniques from Fast Fourier Transform (FFT), and applies high-level transformation methods including folding, pipelining, and retiming, to reduce the number of Processing Elements (PEs) to only log(2) N for an N-bit code. Additionally, the pre-computation technique is utilized in the PE design to allow decoding 2 bits in parallel. We also propose a customized loop-based shifting register to further reduce the consumption of delay elements. Our experimental results demonstrate that our architecture reduces 98.86% and 77.71% on average in area consumption and area-time product, respectively, when N = 1024, compared to the prior works.

关键词： Polar Codes Successive Cancellation Decoding Multi-Path Delay Commutator Folding pre-computation

来源：评论

学校读者我要写书评

暂无评论

Development of a Database of Radar-shadow Cast by a SAR Satellite Using High Resolution DEM data

Development of a Database of Radar-shadow Cast by a SAR Sate...

引用

International Workshop on Advanced Imaging Technology (IWAIT)

作者： Ide, Makoto Samura, Toshikazu Tadamura, Katsumi Yamaguchi Univ Grad Sch Sci & Technol Innovat 2-16-1 Tokiwa Dai Ube Yamaguchi 7558611 Japan

ISBN: (纸本)9781510638365

Synthetic aperture radar (SAR) aboard a satellite irradiates observation microwave pulse toward the earth and the microwave pulse arriving at the earth's surface scatters every direction. The backward scattering component of it is received on the antenna of the satellite. The satellite SAR allows us to observe the earth during 24 hours without being influenced by the weather because of this observation principle. On the other hand, since the satellite needs to irradiate the earth's surface not vertically downward but obliquely downward with the observation microwave pulse, radar-shadow area, at which the observation microwave pulse does not arrive due to obstruction of the other higher place, appears depending on geographical features. However, since the observation data of the satellite SAR is recorded in order of arrival at the receiver, in other words in order of distance from the emitter, it is quite difficult to extract the radar-shadow area directly from the observation data. Therefore, when we use the satellite SAR image to detect occurrence of a natural disaster, we might carry out useless calculation about a steep valley bottom region which has a higher possibility of occurrence of the land slide. This is because the steep valley bottom region is often included in the radar-shadow area, that is the no-data area. If we can know about the radar-shadow area corresponding to the latest observation data, improvement of the estimation precision of occurrence of a natural disaster by using satellite SAR image can be expected. Furthermore, since the SAR satellite flies on a fixed orbit, the information of the radar-shadow area is suitable to construct its database for permanent use. In this paper, we propose a method for efficiently constructing a database for radar-shadow cast by ALOS-2/PALSAR-2 (a satellite operated by JAXA) by using high resolution (5 meters mesh) DEM data as a pre-process.

关键词： satellite SAR radar-shadow ray casting pre-computation

来源：评论

学校读者我要写书评

暂无评论

A Distributed Coordinate Descent Algorithm for Learning Factorization Machine 24th

A Distributed Coordinate Descent Algorithm for Learning Fact...

引用

24th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD)

作者： Zhao, Kankan Zhang, Jing Zhang, Liangfu Li, Cuiping Chen, Hong Key Lab Data Engn & Knowledge Engn Beijing Peoples R China Renmin Univ China Sch Informat Beijing Peoples R China

ISBN: (纸本)9783030474362;9783030474355

Although much effort has been made to implement Factorization Machine (FM) on distributed frameworks, most of them achieve bad model performance or low efficiency. In this paper, we propose a new distributed block coordinate descent algorithm to learn FM. In addition, a distributed pre-computation mechanism incorporated with an optimized Parameter Server framework is designed to avoid the massive repetitive calculations and further reduce the communication cost. Systematically, we evaluate the proposed distributed algorithm on three different genres of datasets for prediction. The experimental results show that the proposed algorithm achieves significantly better performance (3.8%-6.0% RMSE) than the state-of-the-art baselines, and also achieves a 4.6-12.3x speedup when reaching a comparable performance.

关键词： FM Block coordinate descent Distributed framework pre-computation

来源：评论

学校读者我要写书评

暂无评论

A shuffle to achieve high efficiency through pre-computation and batch verification

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2013年第4期12卷 337-345页

作者： Peng, Kun Inst Infocomm Res Singapore Singapore

Shuffle is an important anonymous routing protocol, in which a shuffling node (router) re-encrypts and reorders some encrypted messages. It is usually used to build anonymous communication networks. A new shuffle scheme is proposed in this paper. A shuffling node's costly operations can be carried out offline in advance so that its online efficiency is very high. Moreover, any verifier can employ batch verification to efficiently verify validity of the shuffle. As in practical applications of shuffles like e-voting, there are many verifiers including some entities with weak computation capability, and offline pre-computation is a feasible solution for a shuffling node;our proposal is an effective efficiency optimisation mechanism. So our new shuffle design has an advantage in practical efficiency over the existing shuffle schemes. Moreover, its achievement of desired security properties is formally proved only on the base of the most basic computational assumption inevitable in any shuffle. Application of our new shuffle to e-voting is described in the end of this paper to show its importance and applicability in practice.

关键词： Shuffle pre-computation Batch verification

来源：评论

学校读者我要写书评

暂无评论

An Efficient pre-computation Technique for Approximation Distance Query in Road Networks

An Efficient Pre-computation Technique for Approximation Dis...

引用

IEEE 14th International Conference on Mobile Data Management (MDM)

作者： Fu, Qiang Sun, Guangzhong Zhang, Zhong Uniners Sci & Technol China Sch Comp Sci & Technol Hefei Peoples R China

ISBN: (纸本)9781467360685

The problem of computing minimum distance of moving objects in large-scale road networks has caught many researchers' attention in recent years. One of solutions is to reduce the complexity by selecting representative node for each node in graph, in which the mininum distance of two nodes can be obtained by computing the distance between their representative nodes. The distance between any two representative nodes is pre-computed. In this paper we propose an effective algorithm to select and allocate a fixed number of representative nodes in road networks, then analyse the relationship between the size of representative node set and the approximation distance error of node pairs. We evaluate our approach on a real data set. The evaluation result shows the size of representative nodes set affects the approximation distance error of node pairs, and the appropriate choice for size of representative nodes set could improve the performance of pre-computation and make the result more accurate and reliable.

关键词： pre-computation road networks representative nodes set

来源：评论

学校读者我要写书评

暂无评论

BDD based Logic Synthesis and Optimization for Low Power Comparator Circuit 2

BDD based Logic Synthesis and Optimization for Low Power Com...

引用

2nd International Conference on Intelligent Circuits and Systems (ICICS)

作者： Sinha, Sanjeet K. Tripathi, Suman Lata Lovely Profess Univ Sch Elect & Elect Engn Phagwara Punjab India

ISBN: (纸本)9781538664834

Low power can be achieved at various levels in design hierarchy : architecture to algorithm and logic level to device level. However substantial amount of power can be saved if it is targeted early in the design cycle. Logic optimization and synthesis play a significant role in this content. Experimentally it is seen that about 20% to 30% of total power can be saved at the logic level. In this paper BDD based optimization of a 4-bit magnitude comparator circuit considering the output has been presented and found to achieve our objective of power minimization. With BDD and pre-computation strategy a significant improvement can be achieved in terms of power. In pre-computation module the total power consumption comes out to be 24.40 mu W and in BDD it is 13.89 mu W, whereas comparator without any techniques the consumed power comes as 35.33 mu W. So we can conclude that applying a BDD logic synthesis and optimization we can save a substantial amount of power.

关键词： Comparator Magnitude comparator pre-computation Low power & Area

来源：评论

学校读者我要写书评

暂无评论

Brain strain uncertainty due to shape variation in and simplification of head angular velocity profiles

引用

BIOMECHANICS AND MODELING IN MECHANOBIOLOGY 2017年第2期16卷 449-461页

作者： Zhao, Wei Ji, Songbai Worcester Polytech Inst Dept Biomed Engn Worcester MA 01605 USA Dartmouth Coll Thayer Sch Engn Hanover NH 03755 USA

Head angular velocity, instead of acceleration, is more predictive of brain strains. Surprisingly, no study exists that investigates how shape variation in angular velocity profiles affects brain strains, beyond characteristics such as peak magnitude and impulse duration. In this study, we evaluated brain strain uncertainty due to variation in angular velocity profiles and further compared with that resulting from simplifying the profiles into idealized shapes. To do so, we used reconstructed head impacts from American National Football League for shape extraction and simulated head uniaxial coronal rotations from onset to full stop. The velocity profiles were scaled to maintain an identical peak velocity magnitude and duration in order to isolate the shape for investigation. Element-wise peak maximum principal strains from 44 selected impacts were obtained. We found that the shape of angular velocity profile could significantly affect brain strain magnitude (e.g., percentage difference of 4.29-17.89 % in the whole brain relative to the group average, with cumulative strain damage measure (CSDM) uncertainty range of 23.9 %) but not pattern (correlation coefficient of 0.94-0.99). Strain differences resulting from simplifying angular velocity profiles into idealized shapes were largely within the range due to shape variation, in both percentage difference and CSDM (signed difference of 3.91 % on average, with a typical range of 0-6 %). These findings provide important insight into the uncertainty or confidence in the performance of kinematics-based injury metrics. More importantly, they suggest the feasibility to simplify head angular velocity profiles into idealized shapes, at least within the confinements of the profiles evaluated, to enable real-time strain estimation via pre-computation in the future.

关键词： Traumatic brain injury Head impact Head angular motion Brain strains pre-computation

来源：评论

学校读者我要写书评

暂无评论

Approximate Query Processing: No Silver Bullet 17

Approximate Query Processing: No Silver Bullet

引用

ACM International Conference on Management of Data

作者： Chaudhuri, Surajit Ding, Bolin Kandula, Srikanth Microsoft Res Redmond WA 98052 USA

In this paper, we reflect on the state of the art of Approximate Query Processing. Although much technical progress has been made in this area of research, we are yet to see its impact on products and services. We dis... 详细信息

ISBN: (纸本)9781450341974

关键词： sampling query processing error guarantee query optimization pre-computation big data approximate query processing transformation rules olap

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of a pre-computed Brain Response Atlas in Dummy Head Impacts

引用

ANNALS OF BIOMEDICAL ENGINEERING 2017年第10期45卷 2437-2450页

作者： Zhao, Wei Kuo, Calvin Wu, Lyndia Camarillo, David B. Ji, Songbai Worcester Polytech Inst Dept Biomed Engn 60 Prescott St Worcester MA 01506 USA Stanford Univ Dept Mech Engn Stanford CA 94305 USA Stanford Univ Dept Bioengn Stanford CA 94305 USA Dartmouth Coll Thayer Sch Engn Hanover NH 03755 USA

A pre-computed brain response atlas (pcBRA) may have the potential to accelerate the investigation of the biomechanical mechanisms of traumatic brain injury on a large-scale. In this study, we further enhance the technique and evaluate its performance using six degree-of-freedom angular velocity profiles from dummy head impacts. Using the pcBRA to simplify profiles into acceleration-only shapes, sufficiently accurate strain estimates were obtained for impacts with a major dominating velocity peak. However, they were largely under-estimated when substantial deceleration occurred that reversed the direction of the angular velocity. For these impacts, estimation accuracy was substantially improved with a biphasic profile simplification (average correlation coefficient and linear regression slope of 0.92 +/- 0.03 and 0.95 +/- 0.07 for biphasic shapes, respectively, vs. 0.80 +/- 0.06 and 0.80 +/- 0.08 for acceleration-only shapes). Peak maximum principal strain (E > (p)) and cumulative strain damage measure (CSDM) from the estimated strains consistently correlated stronger than kinematic metrics with respect to the baseline E > (p) and CSDM from the directly simulated responses, regardless of the brain region, and by a large margin (e.g., correlation of 0.93 vs. 0.75 compared to Brain Injury Criterion (BrIC) for E > (p) in the whole-brain, and 0.91 vs. 0.47 compared to BrIC for CSDM in the corpus callosum). These findings further support the pre-computation technique for accurate, real-time strain estimation, which could be important to accelerate model-based brain injury studies in the future.

关键词： Traumatic brain injury Concussion Contact sports pre-computation Finite element model Worcester head injury model

来源：评论

学校读者我要写书评

暂无评论

An Efficient List Successive Cancellation Decoder for Polar Codes

引用

JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE 2016年第5期16卷 550-556页

作者： Piao, Zheyan Kim, Chan-Mi Chung, Jin-Gyun Chonbuk Natl Univ Dept Elect Engn Jeonju Jeollabuk Do South Korea

Polar codes are one of the most favorable capacity-achieving codes due to their simple structure and low decoding complexity. However, because of the disappointing decoding performance realized using conventional successive cancellation (SC) decoders, polar codes cannot be used directly in practical applications. In contrast to conventional SC decoders, list SC (SCL) decoders with large list sizes (e.g. 32) achieve performances very close to those of maximum-likelihood (ML) decoders. In SCL decoders with large list sizes, however, hardware increase is a severe problem because an SCL decoder with list size L consists of L copies of an SC decoder. In this paper, we present a low-area SCL decoder architecture that applies the proposed merged processing elementsharing (MPES) algorithm. A merged processing element (MPE) is the basic processing unit in SC decoders, and the required number of MPEs is L(N-1) in conventional SCL decoders. Using the proposed algorithm reduces the number of MPEs by about 70% compared with conventional SCL decoders when the list size is larger than 32.

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：