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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

633 篇 会议
375 篇 期刊文献
2 册 图书

馆藏范围

1,010 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

688 篇 工学
- 506 篇 计算机科学与技术...
- 306 篇 软件工程
- 117 篇 电子科学与技术（可...
- 101 篇 信息与通信工程
- 78 篇 控制科学与工程
- 56 篇 电气工程
- 54 篇 机械工程
- 48 篇 动力工程及工程热...
- 46 篇 生物工程
- 23 篇 光学工程
- 23 篇 化学工程与技术
- 23 篇 生物医学工程（可授...
- 20 篇 材料科学与工程（可...
- 18 篇 建筑学
- 17 篇 网络空间安全
- 16 篇 仪器科学与技术
- 15 篇 交通运输工程
- 15 篇 环境科学与工程（可...
- 14 篇 土木工程
253 篇 理学
- 139 篇 数学
- 52 篇 生物学
- 45 篇 物理学
- 41 篇 系统科学
- 30 篇 统计学（可授理学、...
- 27 篇 化学
146 篇 管理学
- 119 篇 管理科学与工程(可...
- 38 篇 工商管理
- 32 篇 图书情报与档案管...
27 篇 医学
- 24 篇 临床医学
- 21 篇 基础医学(可授医学...
11 篇 经济学
7 篇 法学
7 篇 农学
2 篇 教育学
2 篇 军事学
1 篇 文学
1 篇 艺术学

主题

73 篇 computer archite...
38 篇 laboratories
35 篇 hardware
33 篇 delay
30 篇 circuit faults
26 篇 computational mo...
24 篇 bandwidth
21 篇 costs
20 篇 circuit testing
20 篇 protocols
20 篇 clocks
19 篇 throughput
19 篇 wireless sensor ...
19 篇 training
18 篇 optimization
18 篇 microprocessors
17 篇 benchmarking
16 篇 routing
16 篇 deep learning
16 篇 fault tolerance

机构

272 篇 state key labora...
164 篇 university of ch...
94 篇 key laboratory o...
82 篇 key laboratory o...
55 篇 institute of com...
41 篇 graduate univers...
33 篇 chinese academy ...
31 篇 key laboratory o...
27 篇 national enginee...
26 篇 state key labora...
24 篇 graduate univers...
22 篇 key laboratory o...
19 篇 school of comput...
19 篇 loongson technol...
19 篇 state key labora...
17 篇 chinese academy ...
17 篇 department of el...
16 篇 key laboratory o...
15 篇 school of comput...
15 篇 graduate school ...

作者

89 篇 xiaowei li
48 篇 li xiaowei
43 篇 huawei li
33 篇 yu hu
33 篇 yinhe han
30 篇 zhou mengchu
29 篇 wang lei
29 篇 zhan jianfeng
27 篇 fan dongrui
25 篇 hu yu
24 篇 dongrui fan
24 篇 li huawei
24 篇 sun ninghui
22 篇 tan guangming
22 篇 chen mingyu
22 篇 ye xiaochun
21 篇 gao wanling
19 篇 shen linlin
18 篇 han yinhe
17 篇 zhang lei

语言

929 篇 英文
61 篇 中文
22 篇 其他

检索条件"机构=Key Laboratory of Computer System and Architecture Institute of Computing Technology"

共 1010 条记录，以下是781-790 订阅

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

详细简洁

排序：

Fast path selection for testing of small delay defects considering path correlations

Fast path selection for testing of small delay defects consi...

引用

28th IEEE VLSI Test Symposium, VTS10

作者： He, Zijian Lv, Tao Li, Huawei Li, Xiaowei Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of the Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424466481

Statistical timing models have been proposed to describe delay variations in very deep sub-micro process technologies, which have increasingly significant influence on circuit performance. Under a statistical timing model, testing of a path can detect potential delay failures caused by different small delay defects. Due to path correlations, the potential delay failures captured by two different paths overlap between each other more or less. It is difficult to find a given number of paths that can capture most potential delay failures. In this paper, the path selection problem is converted to a minimal space intersection problem, and a greedy path selection heuristics is proposed, the key point of which is to calculate the probability that the paths in a specified path set all meet the delay constraint. Statistical timing analysis technologies and heuristics are used in the calculation. Experimental results show that the proposed approach is time-efficient and achieves a higher probability of capturing delay failures in comparison with conventional path selection approaches. ©2010 IEEE.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

GVE: Godson-T verification engine for many-core architecture rapid prototyping and debugging

GVE: Godson-T verification engine for many-core architecture...

引用

2010 International Conference on Field-Programmable technology, FPT'10

作者： Lei, Zhengmeng Zhang, Lunkai Song, Fenglong Tang, Shibin Fan, Dongrui Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424489817

In this paper, we present a Godson-T Verification Engine (GVE) to rapidly prototype and debug our Godson-T many-core processor design. GVE adopts the state-of-the-art hardware platform which contains 6 Xilinx Virtex-5 LX330 FPGAs, thus permitting us to map our many-core processor and peripheral devices into it. Besides the hardware, our toolkit Godson-T Studio provides the compiler, program loader, debugger and monitor to fulfil the purpose of developing, profiling and debugging, while the accuracy loss problem is settled by our novel techniques: Check-point and ILA-Check, presented in this paper. To our experience, GVE greatly reduces the verification cycle due to its high execution speed, for example, it finishes thousands of testcases in an hour, where the software-based approach takes few days to run. And by the help of the checkpoint framework, we can easily locate the faults. Because of these features, GVE makes a great contribution to the 16-tile Godson-T tape-out Project. © 2010 IEEE.

关键词： Verification

来源：评论

学校读者我要写书评

暂无评论

On Selection of Testable Paths with Specified Lengths for Faster-Than-At-Speed Testing

On Selection of Testable Paths with Specified Lengths for Fa...

引用

2010 19th IEEE Asian Test Symposium(第19届IEEE亚洲测试技术学术会议 ATS 2010)

作者： Xiang Fu Xiaowei Li Huawei Li Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade

Faster than at-speed testing provides an effective way to detect small delay defects (SDDs). It requires test patterns to be delicately classified into groups according to the delay of sensitized paths. Each group of patterns is applied at certain frequency. In this paper, we propose to generate tests for faster than at-speed testing using path delay fault (PDF) model and single path sensitization criterion. An effective path selection and grouping method is introduced, which could quickly and accurately identify paths whose delay falls into a given delay span. Several techniques are used to improve the efficiency of the testable path selection procedure. Experimental results on ISCAS'89 benchmark circuits show that the proposed method could achieve high transition fault coverage and high test quality of SDDs with low CPU time.

关键词： faster-than at-speed testing testable path selection small delay defect

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for Finding a Universal Set of Testable Long Paths

An Efficient Algorithm for Finding a Universal Set of Testab...

引用

2010 19th IEEE Asian Test Symposium(第19届IEEE亚洲测试技术学术会议 ATS 2010)

作者： Zijian He Tao Lv Xiaowei Li Huawei Li Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academ Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academ

In this paper, we focus on generation of a universal path candidate set V that contains testable long paths for delay testing. Some strategies are presented to speed up the depth first search procedure of U generation, targeting the reduction of sensitization criteria checking times. Experimental results illustrate that our approach achieves an 8X speedup on average in comparison with the traditional depth first search approach.

关键词： delay testing testable long paths

来源：评论

学校读者我要写书评

暂无评论

Software-Based Self-Testing of Processors Using Expanded Instructions

Software-Based Self-Testing of Processors Using Expanded Ins...

引用

2010 19th IEEE Asian Test Symposium(第19届IEEE亚洲测试技术学术会议 ATS 2010)

作者： Ying Zhang Xiaowei Li Huawei Li Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade

In this paper, an automatic test instruction generation (ATIG) technique using expanded instructions is presented for software-based selftesting (SBST) of processors. First, mappings between expanded instructions and signals are obtained through data mining, and they are used to impose value ranges of expanded instructions on component signals and generate instruction-level constraints. Second, virtual circuits are established based on the instruction-level constraints, and test patterns are generated for the constrained components. Third, test patterns are translated into test instructions according to the values of controlling signals and constraints for their mappings to instructions, and an SBST program is produced after assembling the test instructions. Experimental results on the Parwan processor show that the proposed ATIG technique can achieve 94.8％ stuck-at fault coverage, which is close to that of the full-scan test generation method. In addition, it can cut down 57％ test volume of the previous random pattern generation based SBST technique, while the test time reduces to one thirteenth of the previous SBST technique.

关键词： Software-Based Self-Test Automatic Test Instruction Generation Instruction-Level Constraint On-Line Test

来源：评论

学校读者我要写书评

暂无评论

On-the-fly Reduction of Stimuli for Functional Verification

On-the-fly Reduction of Stimuli for Functional Verification

引用

2010 19th IEEE Asian Test Symposium(第19届IEEE亚洲测试技术学术会议 ATS 2010)

作者： Qi Guo Weiwu Hu Tianshi Chen Haihua Shen Yunji Chen Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade

As a primary method for functional verification of microprocessors, simulation-based verification has received extensive studies over the last decade. Most investigations have been dedicated to the generation of stimuli (test cases), while relatively few has focused on explicitly reducing the redundant stimuli among the generated ones. In this paper, we propose an on-the-fly approach for reducing the stimuli redundancy based on machine learning techniques, which can learn from new knowledge in every cycle of simulation-based verification. Our approach can be easily embedded in traditional framework of simulation-based functional verification, and the experiments on an industrial microprocessor have validated that the approach is effective and efficient.

关键词： Functional Verification Stimuli Reduction Redundancy Online Learning Godson-2

来源：评论

学校读者我要写书评

暂无评论

Testable critical path selection considering process variation

Testable critical path selection considering process variati...

引用

作者： Fu, Xiang Li, Huawei Li, Xiaowei Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academic of Science Beijing 100190 China Graduate University of Chinese Academic of Sciences Beijing 100039 China

Critical path selection is very important in delay testing. Critical paths found by conventional static timing analysis (STA) tools are inadequate to represent the real timing of the circuit, since neither the testability of paths nor the statistical variation of cell delays caused by process variation is considered. This paper proposed a novel path selection method considering process variation. The circuit is firstly simplified by eliminating non-critical edges under statistical timing model, and then divided into sub-circuits, while each sub-circuit has only one prime input (PI) and one prime output (PO). Critical paths are selected only in critical sub-circuits. The concept of partially critical edges (PCEs) and completely critical edges (CCEs) are introduced to speed up the path selection procedure. Two path selection strategies are also presented to search for a testable critical path set to cover all the critical edges. The experimental results showed that the proposed circuit division approach is efficient in path number reduction, and PCEs and CCEs play an important role as a guideline during path selection. Copyright © 2010 The institute of Electronics.

关键词： Delay circuits

来源：评论

学校读者我要写书评

暂无评论

Outlier detection for learning-based optimizing compiler

Outlier detection for learning-based optimizing compiler

引用

International Conference on Frontier of computer Science and technology

作者： Long, Shun Zhu, Weiheng Department Ofcomputer Science JiNan University Guangzhou China Key-Laboratory Ofcomputer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9780769541396

Modern compilers use machine learning to find from their prior experience useful heuristics for new programs encountered in order to accelerate the optimization process. However, prior experience might not be applicable for outlier programs with unfamiliar code features. This paper presents a Reverse K-nearest neighbor (RKNN) algorithm based approach for outlier detection. The compiler can therefore launch a search within an optimization space when outlier programs are encountered, or directly apply its experience to non-outliers. Preliminary experimental results demonstrate the effectiveness of the approach. © 2010 IEEE.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

VMGuard: An integrity monitoring system for management virtual machines

VMGuard: An integrity monitoring system for management virtu...

引用

16th IEEE International Conference on Parallel and Distributed systems, ICPADS 2010

作者： Fang, Haifeng Zhao, Yiqiang Zang, Hongyong Huang, H. Howie Song, Ying Sun, Yuzhong Liu, Zhiyong Graduate University of Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China George Washington University WA United States

ISBN: (纸本)9780769543079

A cloud computing provider can dynamically allocate virtual machines (VM) based on the needs of the customers, while maintaining the privileged access to the Management Virtual Machine that directly manages the hardware and supports the guest VMs. The customers must trust the cloud providers to protect the confidentiality and integrity of their applications and data. However, as the VMs from different customers are running on the same host, an attack to the management virtual machine will easily lead to the compromise of the guest VMs. Therefore, it is critical for a cloud computing system to ensure the trustworthiness of management VMs. To this end, we propose VMGuard, an integrity monitoring and detecting system for management virtual machines in a distributed environment. VMGuard utilizes a special VM, Guard Domain, which runs on each physical node to monitor the co-resident management VMs. The integrity measurements collected by the Guard Domains are sent to the VMGuard server for safe store and independent analysis. The experimental evaluation of a Xen-based prototype shows that VMGuard can quickly detect the root kit attacks while the performance overhead is low. © 2010 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Formula-Oriented Compositional Minimization in Model Checking

Formula-Oriented Compositional Minimization in Model Checkin...

引用

2010 19th IEEE Asian Test Symposium(第19届IEEE亚洲测试技术学术会议 ATS 2010)

作者： Bowen Chen Haihua Shen Wenhui Zhang Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijin

This paper presents a new approach to reduce finite state machines with respect to a CTL formula to alleviate state explosion problem. Reduction is achieved by removing parts useless to the formula of original machines. The main contribution of this paper is to exploit relations among subformulas of the CTL formula so as to gain more reduction, as well as to extend traditional pruning method, which handles only existential formulas, to handle universal formulas. Based on this kind of reduction, verification of a large system, which usually consists of several components, can be done by evaluating properties on a reduced version of the system, which is built by composing components of the system one by one while doing reduction after each composition. Experimental results show the effectiveness of the approach. Especially when a property is written in a more detailed way, that is to describe the system part by part, the approach has a great potential.

关键词： Formula-Oriented Compositional Minimization CTL Model Checking Formal Verification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共101页 << < 75 76 77 78 79 80 81 82 83 84 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：