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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

179 篇 会议
112 篇 期刊文献
3 册 图书

馆藏范围

294 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

158 篇 工学
- 99 篇 计算机科学与技术...
- 64 篇 软件工程
- 26 篇 电气工程
- 25 篇 控制科学与工程
- 22 篇 电子科学与技术（可...
- 22 篇 信息与通信工程
- 13 篇 土木工程
- 12 篇 机械工程
- 11 篇 动力工程及工程热...
- 10 篇 仪器科学与技术
- 9 篇 船舶与海洋工程
- 7 篇 材料科学与工程（可...
- 6 篇 光学工程
- 6 篇 化学工程与技术
- 6 篇 交通运输工程
- 6 篇 网络空间安全
- 5 篇 生物医学工程（可授...
- 5 篇 生物工程
93 篇 理学
- 38 篇 数学
- 28 篇 物理学
- 13 篇 系统科学
- 12 篇 生物学
- 10 篇 统计学（可授理学、...
- 9 篇 海洋科学
- 6 篇 化学
30 篇 管理学
- 21 篇 管理科学与工程(可...
- 10 篇 工商管理
- 10 篇 图书情报与档案管...
12 篇 医学
- 10 篇 临床医学
- 8 篇 基础医学(可授医学...
5 篇 农学
3 篇 经济学
3 篇 法学
3 篇 教育学
2 篇 军事学
1 篇 哲学
1 篇 文学
1 篇 历史学
1 篇 艺术学

主题

34 篇 computer archite...
21 篇 hardware
13 篇 laboratories
10 篇 wireless sensor ...
9 篇 protocols
9 篇 delay
8 篇 registers
8 篇 computational mo...
7 篇 runtime
7 篇 application soft...
7 篇 energy consumpti...
6 篇 ray tracing
6 篇 bandwidth
6 篇 resource managem...
6 篇 analytical model...
6 篇 field programmab...
5 篇 memory managemen...
5 篇 processor schedu...
5 篇 program processo...
5 篇 real-time system...

机构

7 篇 state key labora...
6 篇 key laboratory o...
6 篇 shanghai researc...
6 篇 state key labora...
6 篇 information syst...
6 篇 computer archite...
5 篇 university of ch...
5 篇 department of co...
4 篇 lawrence berkele...
4 篇 national researc...
4 篇 pennsylvania sta...
4 篇 university of il...
4 篇 department of co...
4 篇 graduate univers...
4 篇 department of el...
3 篇 school of comput...
3 篇 dept. of compute...
3 篇 key laboratory o...
3 篇 embedded systems...
3 篇 advanced compute...

作者

15 篇 jung myoungsoo
9 篇 zhang jie
9 篇 myoungsoo jung
9 篇 kwon miryeong
7 篇 yusheng ji
6 篇 david atienza
6 篇 alexandre s. ner...
6 篇 baohua zhao
6 篇 nadia nedjah
5 篇 yu gu
5 篇 johansson karl h...
5 篇 yinhe han
5 篇 lech jozwiak
5 篇 miryeong kwon
5 篇 parisini thomas
4 篇 jie li
4 篇 xu gehui
4 篇 koh sungjoon
4 篇 hong yiguang
4 篇 chen guanpu

语言

284 篇 英文
6 篇 其他
4 篇 中文

检索条件"机构=Computer Systems Architecture Laboratory"

共 294 条记录，以下是121-130 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Couture: Tailoring STT-MRAM for persistent main memory 4

Couture: Tailoring STT-MRAM for persistent main memory

引用

4th Workshop on Interactions of NVM/Flash with Operating systems and Workloads, INFLOW 2016, co-located with OSDI 2016

作者： Shihab, Mustafa M. Zhang, Jie Gao, Shuwen Callenes-Sloan, Joseph Jung, Myoungsoo University of Texas Dallas United States Intel Corporation School of Integrated Technology Yonsei Institute Convergence Technology Yonsei University Computer Architecture Memory Systems Laboratory Korea Republic of

Modern computer systems rely extensively on dynamic random-access memory (DRAM) to bridge the performance gap between on-chip cache and secondary storage. However, continuous process scaling has exposed DRAM to high off-state leakage and excessive power consumption from frequent refresh operations. Spin-transfer torque magnetoresistive RAM (STT-MRAM) is a plausible replacement for DRAM, given its high endurance and near-zero leakage. However, conventional STT-MRAM cannot directly substitute DRAM due to its large cell space area and the high latency and energy costs for writes. In this work, we present Couture – a main memory design using tailored STT-MRAM that can offer a storage density comparable to DRAM and high performance with low-power consumption. In addition, we propose an intelligent data scrubbing method (iScrub) to ensure data integrity with minimum overhead. Our evaluation results show that, equipped with the iScrub policy, our proposed Couture can achieve up to 23% performance improvement, while consuming 18% less energy, on average, compared to a contemporary DRAM. © INFLOW 2016 - 4th Workshop on Interactions of NVM/Flash with Operating systems and Workloads, co-located with OSDI 2016. All rights reserved.

关键词： MRAM devices

来源：评论

学校读者我要写书评

暂无评论

New Collaborative Intrusion Detection architecture Based on Multi Agent systems

引用

通讯和计算机（中英文版） 2016年第1期13卷 1-10页

作者： Mohssine EL AJJOURI Siham BENHADOU Hicham MEDROMI Systems Architecture Team Laboratory of Computer System and Renewable Energy University Hassan H Casablanca ENSEMCasablanca 20200 Morocco

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Runtimes in Action: An Introspective Framework for a Next Gen Runtime

Asynchronous Runtimes in Action: An Introspective Framework ...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Joshua Suetterlein Joshua Landwehr Andrés Márquez Joseph B. Manzano Guang R. Gao The Computer Architecture and Parallel Systems Laboratory University of Delaware Newark Delaware Pacific Northwest National Laboratory Richland Washington

ISBN: (纸本)9781509036837

One of the most critical challenges that new highperformance systems face is the lack of system software supportfor these large scale systems. Investment on system stack componentsis essential in the development, debugging and optimizationof the new emerging programming models. These emergingmodels have the promise to better utilize the vast hardwareresources available in current and future systems. To aid in thedevelopment of applications and new system stacks, runtimes, asinstances of their respective execution models, need to producefacilities to introspect their inner workings and allow an indepthattribution of performance bottlenecks and computationalpatterns. In other words, the runtime systems need to reducetheir opacity to observers so that users of a novel programexecution model can adapt their designs to fit the intended modelusage, regardless of the layer that they are working on. Thisdesign/development loop (akin to co-design) enables synergisticopportunities across the entire computational stack. This paper presents the design and implementation of a simple"gray" box performance attribution harness running inside a finegrain runtime system: the Open Community Runtime (OCR). We showcase what such a framework can indicate regarding theruntime behavior while running at scale. To this end, we havedesigned a set of synthetic scenarios aimed to test the runtime attheir best and worst cases. We present an analysis of the mostimportant runtime features, properties and idiosyncrasies thatwill affect the development of new runtime features, algorithmicselection, and application development.

关键词： Runtime Optical character recognition software Instruction sets Computational modeling Adaptation models Message systems Protocols

来源：评论

学校读者我要写书评

暂无评论

A report on the first international workshop on research methods in animal-computer interaction

A report on the first international workshop on research met...

引用

2017 ACM SIGCHI Conference on Human Factors in Computing systems, CHI EA 2017

作者： Zamansky, Anna Roshier, Amanda Mancini, Clara Collins, Emily C. Hall, Carol Grillaert, Katie Morrison, Ann North, Steve Wirman, Hanna Information Systems Department University of Haifa Israel School of Veterinary Medicine and Science University of Nottingham United Kingdom Animal-Computer Interaction Lab Open University Milton Keynes United Kingdom Sheffield Robotics University of Sheffield United Kingdom School of Animal Rural and Environmental Sciences Nottingham Trent University United Kingdom Messerli Research Institute University of Veterinary Medicine Medical University of Vienna University of Vienna Austria Department of Architecture Design and Media Technology Aalborg University Denmark Mixed Reality Laboratory University of Nottingham United Kingdom School of Design Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781450346566

Animal-computer Interaction (ACI) is a new and quickly developing discipline, which is closely related to HCI and is making reference to some of its theoretical frameworks and research methodologies. The first edition of the Workshop on Research Methods in ACI (RM4ACI) was co-located with the Third International Conference on Animal-computer Interaction, which took place in Milton-Keynes, UK in November 2016. This paper presents an overview of the workshop, including insights from discussions on some of the challenges faced by the ACI community as it works to develop ACI as a discipline, and on important opportunities for cross-fertilization between HCI and ACI that the HCI community could consider. Copyright © 2017 by the Association for Computing Machinery, Inc. (ACM).

关键词： Animals

来源：评论

学校读者我要写书评

暂无评论

Codelet Scheduling by Genetic Algorithm

Codelet Scheduling by Genetic Algorithm

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Songwen Pei Jinkai Wang Wenyang Cui Linhua Jiang Tongsheng Geng Jean-Luc Gaudiot Stéphane Zuckerman Shanghai Key Lab of Modern Optical Systems University of Shanghai for Science and Technology Shanghai China Parallel Systems and Computer Architecture Lab University of California Irvine CA USA Computer Architecture & Parallel Systems Laboratory University of Delaware Newark DE

ISBN: (纸本)9781509032068

Codelet model is a fine-grained, event-driven hybrid parallel model inspired by dataflow, whose performance depends on the scheduling policy. How to design optimal codelet scheduling policy based on the features of tasks is important to the codelet-based system performance. In this paper, we propose an adaptive codelet scheduling policy by combing "pure" genetic algorithm for tasks with complex dependencies. It is verified that the policy is effective based on bunches of experimental results.

关键词： Computational modeling Schedules Genetic algorithms Scheduling Runtime Optimal scheduling Sociology

来源：评论

学校读者我要写书评

暂无评论

Dynamic topologies for particle swarms 7

Dynamic topologies for particle swarms

引用

7th International Joint Conference on Computational Intelligence, IJCCI 2015

作者： Fernandes, Carlos M. Laredo, J.L.J. Merelo, J.J. Cotta, C. Rosa, A.C. LARSyS: Laboratory for Robotics and Systems in Engineering and Science University of Lisbon Lisbon Portugal Department of Architecture and Computer Technology University of Granada Granada Spain Departamento de Lenguages y Ciencias de la Computación University of Malaga Malaga Spain

ISBN: (纸本)9783662535240

The Particle Swarm Optimization (PSO) algorithm is a population-based metaheuristics in which the individuals communicate through decentralized networks. The network can be of many forms but traditionally its structure is predetermined and remains fixed during the search. This paper investigates an alternative approach. The particles are positioned on a 2-dimensional grid of nodes. During the run, they move through the network according to simple rules, while interacting with each other using signs that they leave on the nodes. The links between the particles – and consequently the information flow – are then defined at each time step by the position of the particle on the grid. As a result, each particle’s set of neighbors and connectivity degree varies during the search progress. The particles can move randomly or instead track signs left by other particles on the grid. In this paper, after a formal description of the general model, two different strategies (random and sign-based) are tested and compared to standard topologies on unimodal and multimodal functions, including a rotated and a shifted function with noise from the CEC benchmark. The experiments demonstrate that the dynamics provided by the proposed structure results in a more consistent and stable performance throughout the test set. The working mechanisms of the model are simple and easy to implement. © Springer-Verlag Berlin Heidelberg 2016.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Software-based dynamic reliability management for GPU applications

Software-based dynamic reliability management for GPU applic...

引用

Annual International Symposium on Reliability Physics

作者： Si Li Vilas Sridharan Sudhanva Gurumurthi Sudhakar Yalamanchili Computer Architecture Systems Laboratory Georgia Institute of Technology Advanced Micro Devices Inc Santa Clara CA US

ISBN: (纸本)9781467391382

In this paper we propose a framework for dynamic reliability management (DRM) for GPU applications based on the idea of plug-n-play software-based reliability enhancement (SRE). The approach entails first assessing the vulnerability of GPU kernels to soft errors in program visible structures. This assessment is performed on a low level intermediate program representation rather than the application source. Second, this assessment guides selective injection of code implementing SRE techniques to protect the most vulnerable data. Code injection occurs transparently at runtime using a just-in-time (JIT) compiler. Thus, reliability enhancement is selective, transparent, on-demand, and customizable. This flexible, automated software-based DRM framework can provide an adaptable, cost-effective approach to scaling reliability of large systems. We present the results of a proof of concept implementation on NVIDIA GPUs demonstrating the ability to traverse a range of performance reliability tradeoffs.

关键词： Reliability Graphics processing units Registers Kernel computer architecture Transient analysis

来源：评论

学校读者我要写书评

暂无评论

Approximation-aware rewriting of AIGs for error tolerant applications

Approximation-aware rewriting of AIGs for error tolerant app...

引用

IEEE International Conference on computer-Aided Design

作者： Arun Chandrasekharan Mathias Soeken Daniel Große Rolf Drechsler Group of Computer Architecture University of Bremen Germany EPFL Inteorated Systems Laboratory Switzerland Universitat Bremen Bremen Bremen DE Cyber Physical Systems DFKI GmbH Bremen Germany

Approximation circuits offer superior performance (speed and area) compared to traditional circuits at the cost of computational accuracy. The accuracy of the results in approximation circuits is evaluated based on several error metrics such as worst-case error, bit-flip error, or error-rate. Several applications have varied requirements in error metrics, i.e., all the error criteria have to be met together at a time, or in combinations. Nevertheless, all applications benefit from improved delay and area. An automated synthesis approach with formal guarantees on error metrics is very helpful in generating circuits that meet these criteria. Furthermore, each of these metrics are independent quantities (value of one metric does not correlate with the other), and automated synthesis can discover opportunities to trade off one or more of the relaxed metrics with a strict requirement on the other, resulting in better performance. In this paper, we present an automatic synthesis approach using And-Inverter Graphs (AIGs) based rewriting that not only improves the performance but also guarantees the bounds of approximation errors introduced. Our synthesis approach is evaluated on a wide range of designs and standard benchmark circuits to show the usefulness and applicability. In particular, we show that our synthesis results are even comparable with the optimization achieved with hand crafted adhoc approximation circuits such as approximation adders in a case study on image compression.

关键词： Approximation algorithms Delays Adders Logic gates Approximation error Boolean functions

来源：评论

学校读者我要写书评

暂无评论

An Estimate of the Complexity of the Section Finding Problem on Algebraic Surfaces

An Estimate of the Complexity of the Section Finding Problem...

引用

International Symposium on Computing and Networking (CANDAR)

作者： Shinya Okumura Koichiro Akiyama Tsuyoshi Takagi Information Security Laboratory Institute of Systems Information Technologies and Nanotechnologies Fukuoka Japan Computer Architecture & Security Systems Laboratory Toshiba Corporation R&D Center Kawasaki Japan Institute of Mathematics for Industry Kyushu University Fukuoka Japan

ISBN: (纸本)9781509026562

Researching post-quantum cryptography has been an important task in cryptography. The section finding problem on algebraic surfaces (AS-SFP) is considered to be intractable also after building quantum computers. Thus AS-SFP is used as a basis of the security of the Algebraic Surface Cryptosystem (ASC), which is a candidate of post-quantum cryptosystems, and it is important for designing parameters which make ASC secure to estimate the complexity of AS-SFP. Solving AS-SFP is reduced to solving certain multivariate equation systems (section equation systems) of high degrees, and one can solve such equation systems by using the Grobner basis technique. Although estimating the complexity of computing a Grobner basis associated with an equation system is difficult in general, it becomes easy if the equation system is semi-regular. In this paper, we experimentally estimate the complexity of AS-SFP. From our experimental results, although we see that section equation systems do not become semi-regular in most cases for small parameters, we can infer parameters closely related to the difficulty of computing Grobner bases associated with section equation systems. According to our inference, we estimate the complexity of AS-SFP and parameters which make ASC 128-bit security against the attack by the Grobner basis technique. We also consider a brute-force attack against AS-SFP and conjecture that the brute-force attack is more efficient than the attack by the Grobner basis technique. Finally, we estimate parameters and sizes of public keys such that ASC has 128-bit security against the brute-force attack. Its size (876 bits) is much smaller than sizes of public keys in other efficient candidates of PQC.

关键词： Complexity theory Elliptic curve cryptography Quantum computing computers

来源：评论

学校读者我要写书评

暂无评论

Enhancing Nanosatellite Dependability Through Autonomous Chip-Level Debug Capabilities

Enhancing Nanosatellite Dependability Through Autonomous Chi...

引用

ARCS 2016;29th International Conference on architecture of Computing systems

作者： Christian M. Fuchs Nikolaus Dafinger Martin Langer Carsten Trinitis Chair of Space Systems Engineering Faculty of Aerospace Engineering Computer Engineering Laboratory Delft University of Technology Institute for Astronautics Technical University Munich Chair for Computer Architecture and Organization Technical University Munich

Modern embedded technology enables a high level of compute performance at the cost of little energy. Hence, miniaturized satellite development has begun to rely upon conventional application processor architectures an... 详细信息

关键词： satellite development nano satellites chip level Storage capacity debugger Job Performance Field programmable gate arrays embedded technology Processor architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共30页 << < 9 10 11 12 13 14 15 16 17 18 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：