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

9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012

作者： Wang, Lin Fernández Anta, Antonio Zhang, Fa Hou, Chenying Liu, Zhiyong Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Institute IMDEA Networks Spain China State Key Lab. for Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9783642299513

Energy consumption is an important issue in the design and use of networks. In this paper, we explore energy savings in networks via a rate adaptation model. This model can be represented by a cost-minimization network routing problem with discrete cost functions. We formulate this problem as an integer program, which is proved to be NP-hard. Then a constant approximation algorithm is developed. In our proposed method, we first transform the program into a continuous-cost network routing problem, and then we approximate the optimal solution by a two-step rounding process. We show by analysis that, for uniform demands, our method provides a constant approximation for the uniform network routing problem with discrete costs. A bicriteria network routing problem is also developed so that a trade-off can be made between energy consumption and network delay. Analytical results for this latter model are also presented. © 2012 Springer-Verlag.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Hunting Trojan Horses

Hunting Trojan Horses

引用

ASID'06: 1st Workshop on Architectural and System Support for Improving Software Dependability

作者： Moffie, Micha Cheng, Winnie Kaeli, David Zhao, Qin Computer Architecture Research Laboratory Northeastern University Boston MA 02115 United States Computer Science and Artificial Intelligence Lab. Massachusetts Institute of Technology Cambridge MA 02139 United States Singapore-MIT Alliance National University of Singapore Singapore 117576 Singapore

ISBN: (纸本)1595935762

HTH (Hunting Trojan Horses) is a security framework developed for detecting difficult types of intrusions. HTH is intended as a complement to anti-virus software in that it targets unknown and zero-day Trojan Horses and Backdoors. In order to accurately identify these types of attacks HTH utilizes runtime information available during execution. The information collected includes fine-grained information flow, program execution flow and resources *** this paper we present Harrier, an Application Security Monitor at the heart of our HTH framework. Harrier is an efficient run-time monitor that dynamically collects execution-related data. Harrier is capable of collecting information across different abstraction levels including architectural, system and library APIs. To date, Harrier is 3-4 times faster than comparable information flow tracking *** the collected information, Harrier allows for accurate identification of abnormal program behavior. Preliminary results show a good detection rate with a low rate of false positives. Copyright 2006 ACM.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Real-time signal processing in a collision avoidance radar system using parallel computing 7th

Real-time signal processing in a collision avoidance radar s...

引用

7th International Conference on High-Performance Computing and Networking, HPCN Europe 1999

作者： Reijns, G.L. Van Gemund, A.J.C. Schier, J. Dept. of Information Technology and Systems Lab. of Computer Architecture and Digital Technique Delft University of Technology Netherlands Inst. of Information Theory and Automation Czech Academy of Sciences Czechia Int. Research Inst. for Telecom-transmission and Radar Delft University of Technology Netherlands

ISBN: (纸本)3540658211

COLARADO (an acronym for collision avoidance radar able to distinguish obstacles) is a system for use in the control of autonomously driven vehicles, having static radar antennas. By combining the echos, resulting from 2 continuously emitting transmitters and 3 receivers, it is possible to compute the locations of obstacles in 3 dimensions. The main problem is to separate the real obstacles from ghosts amongst noise and clutter, up to a distance of 12.8 m. This paper discusses the signal processing algorithms as well as the related real-time parallel computer hardware and system software. © Springer-Verlag Berlin Heidelberg 1999.

关键词： computer hardware

来源：评论

学校读者我要写书评

暂无评论

Sensations on the body: Varying duration, overlap, ratios and placement on dynamic vibrotactile patterns 18

Sensations on the body: Varying duration, overlap, ratios an...

引用

19th International Conference on Human-computer Interaction, Interaccion 2018

作者： Morrison, Ann Manresa-Yee, Cristina Jensen, Walther Digital Life Lab. University of Southern Queensland Toowoomba Australia Computer Science and Mathematics Science Department University of Balearic Islands Palma Spain Department of Architecture Design and Media Technology Aalborg University Denmark

ISBN: (纸本)9781450364911

Prior research revealed that people have strong responses to various vibrotactile patterns acting on the trunk of the body. Moreover, they experienced patterns on the back and around the waist more positively compared to those on the front or mid-front of the body. In this study, we use a vibrotactile vest designed according to Traditional Chinese principles to identify the effect of individual factors in the patterns. We examined variations of duration, overlap, placement and repetition. Our research questions are: 'What influenced peoples' perception of the sensations?' 'How can we design for the wearer with specific sensations in mind?' As an example, we found using actuators with the same placement but varying the ratio between duration and overlap gave wearers' opposing perceived effects. One ratio was perceived as calming/feel good (0.5), another as activating (>0.5), another again as annoying ( © 2018 Association for Computing Machinery.

关键词： Wearable computers

来源：评论

学校读者我要写书评

暂无评论

PHP: Power hungry pattern generation at higher abstraction level

PHP: Power hungry pattern generation at higher abstraction l...

引用

East-West Design & Test Symposium (EWDTS)

作者： Rohini Gulve Anshu Goel Virendra Singh Computer Architecture and Dependable Systems Lab Electrical Engineering Indian Institute of Technology Bombay India

The Performance, area, and power are most essential factors to be considered and optimize at every step in the design cycle. Design engineers often need to learn about these factors in order make right decisions on design strategies. Power analysis at lower levels of abstraction can provide more accurate analysis than higher levels. Worst case power can be estimated through high activity pattern generation. However, generation of such power hungry patterns (PHP) become challenging as the number of modules or design components increases. This process can be accelerated at higher abstraction levels by utilizing the available information. In this paper, we generate PHP by at higher abstraction level with significant speed up. A genetic algorithm is implemented to find out the global maximum power of designs. An experiment indicates that the process implemented is much faster and it finds about 10 % more power demanding PHP than random samples generated.

关键词： Mathematical model Genetic algorithms Integrated circuit modeling Logic gates Power demand Optimization Libraries

来源：评论

学校读者我要写书评

暂无评论

A Review on Current and Old SCADA Networks Applied to Water Distribution Systems 1

A Review on Current and Old SCADA Networks Applied to Water ...

引用

1st International Conference of Intelligent Computing and Engineering, ICOICE 2019

作者： Franco, Daniel Jose Muhammed, Abdullah Bin Subramaniam, Shamala K. Abdullah, Azizol Silva, Rui Miguel Akram, Omar Khasro University Putra Malaysia Department of Communication Technology and Network Serdang Malaysia Lab Ubinet Computer Security and Cybercrime Polytechnic Institute of Beja Department of Engineering Beja Portugal University Putra Malaysia Department of Architecture Serdang Malaysia

ISBN: (纸本)9781728144870

Water is probably the oldest factor receiving attention from the population, since the beginning of the human race. The evolution of water supply systems is directly related to the urban growth of the cities and their geographical location. This study focuses on SCADA (Supervisory Control And Data Acquisition) systems used to control and managing water distribution systems all around the world, highlighting their components and deeply approaching SCADA networks and communication protocols. Based on the need of protection and security on SCADA networks, this study aims to provide a review of the existing literature, through the case study of water distribution systems, identifying the different components of a SCADA system, as well as its communication architectures and protocols and some known attacks, to design a framework on current and old SCADA networks. Results show that SCADA systems are not just applied to water distribution and water waste systems, but also to many other industrial automated systems that control on crucial systems. The security of such systems is yet weak and faces many vulnerabilities and threats, where security mechanisms must be applied. For this purpose, the study of SCADA networks and communications is considered a crucial point for the correct development of security tools. © 2019 IEEE.

关键词： SCADA systems

来源：评论

学校读者我要写书评

暂无评论

Minimax regret 1-sink location problem in dynamic path networks

引用

Theoretical computer Science 2015年 588卷 24-36页

作者： Higashikawa, Yuya Augustine, John Cheng, Siu-Wing Golin, Mordecai J. Katoh, Naoki Ni, Guanqun Su, Bing Xu, Yinfeng Department of Architecture and Architectural Engineering Kyoto University Japan Department of Computer Science and Engineering Indian Institute of Technology Madras India Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Business School Sichuan University Chengdu610065 China School of Economics and Management Xi'an Technological University Xi'an710032 China School of Management Xi'an Jiaotong University Xi'an710049 China State Key Lab for Manufacturing Systems Engineering Xi'an710049 China

This paper considers the minimax regret 1-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths and uniform edge capacity, and each vertex supply which is nonnegative value is unknown but only the interval of supply is known. A particular assignment of supply to each vertex is called a scenario. Under any scenario, the cost of a sink location is defined as the minimum time to complete the evacuation for all supplies (evacuees), and the regret of a sink location x is defined as the cost of x minus the cost of the optimal sink location. Then, the problem is to find a point as a sink such that the maximum regret for all possible scenarios is minimized. We propose an O(nlog n) time algorithm for the minimax regret 1-sink location problem in dynamic path networks with uniform capacity, where n is the number of vertices in the network. © 2014 Elsevier B.V.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Sub-sentence division for tree-based machine translation

Sub-sentence division for tree-based machine translation

引用

Joint Conference of the 47th Annual Meeting of the Association for Computational Linguistics and 4th International Joint Conference on Natural Language Processing of the AFNLP, ACL-IJCNLP 2009

作者： Xiong, Hao Xu, Wenwen Mi, Haitao Liu, Yang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Key Lab. of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

ISBN: (纸本)9781617382581

Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsing accuracy usually goes down dramatically with the increase of sentence length, translating long sentences often takes long time and only produces degenerate translations. We propose a new method named subsentence division that reduces the decoding time and improves the translation quality for tree-based translation. Our approach divides long sentences into several sub-sentences by exploiting tree structures. Large-scale experiments on the NIST 2008 Chinese-to-English test set show that our approach achieves an absolute improvement of 1.1 BLEU points over the baseline system in 50% less time. © 2009 ACL and AFNLP.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Towards efficient content discovery in NDN with enhanced component-based bloom filters 21

Towards efficient content discovery in NDN with enhanced com...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Zhang, Cuiping Wang, Yunmin School of Electronic and Computer Engineering Peking University China Shenzhen Key Lab of Information Theory and Future Network Architecture Future Network PKU Lab of National Major Research Infrastructure PKU Institute of Big Data Technology Shenzhen Engineering Lab of Converged Networking Technology Huawei and PKU Jointly Engineering Lab of Future Network Based on SDN Shenzhen Graduate School Peking University China

ISBN: (纸本)9781728120584

Variable-length hierarchical names of Named data networking (NDN) content bring about intuitive issues for both content routing and large-scale forwarding. Bloom filters can accelerate hash-based NDN content discovery with a false positive probability. In this paper, we propose ECBF, a component-based bloom filter scheme to enhance the reliability of bloom filters. We exploit the hierarchical characteristics of NDN content names and store them into different bloom filters in a component-based way, and then we present a correlation validation policy to check whether the names exist. Finally, we introduce an ECBF-based content discovery scheme BCD. ECBF and the correlation validation value are stored in a fast on-chip memory, and cryptographic check values of content names and related information are respectively stored in an off-chip memory of intermediate routers. This design not only improves the effectiveness of content discovery, but also reduces the additional memory throughput. We experimentally demonstrate that BCD can provide a more than twice reduction of false probability compared with the primary bloom filter methods. Besides, BCD can economize about 40% memory consumption. © 2019 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

A Case of Precision-Tunable STT-RAM Memory Design for Approximate Neural Network

A Case of Precision-Tunable STT-RAM Memory Design for Approx...

引用

IEEE International Symposium on Circuits and Systems

作者： Ying Wang Lili Song Yinhe Han Yuanqing Cheng Huawei Li Xiaowei Li State Key Lab of Computer Architecture Institute of Computing technology Chinese Academy of Sciences Beihang University

ISBN: (纸本)9781479983926

Multi-level STT-RAM cell is able to boost the memory density at the expense of read/write reliability. However, the induced data integrity issue in STT-RAM memory can be effectively masked by a wide spectrum of applications with intrinsic forgiveness, which belong to the specific domain such as multimedia, synthesis and mining. In this work, we leverage the reconfigurable capability of MLC STT-RAM to provide variable-precision data storage for popular machine learning architectures. The targeted STT-RAM memory design is able to transform between multiple work modes and adaptable to meet the varying quality constraint of approximate applications. Particularly, we demonstrate the concept of precision-tunable STT-RAM memory with the emerging Convolution Neural Network accelerators and elaborate on the data mapping policy in STT-RAM memory to achieve the best energy-efficiency.

关键词： STT-RAM Machine Learning Neural Network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：