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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,932 篇 期刊文献
1,766 篇 会议
1 册 图书

馆藏范围

3,699 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,617 篇 工学
- 1,795 篇 计算机科学与技术...
- 1,391 篇 软件工程
- 620 篇 信息与通信工程
- 375 篇 电气工程
- 361 篇 控制科学与工程
- 309 篇 电子科学与技术（可...
- 225 篇 生物工程
- 193 篇 机械工程
- 152 篇 网络空间安全
- 147 篇 光学工程
- 135 篇 生物医学工程（可授...
- 123 篇 仪器科学与技术
- 108 篇 动力工程及工程热...
- 101 篇 安全科学与工程
- 98 篇 交通运输工程
- 69 篇 建筑学
- 65 篇 化学工程与技术
- 64 篇 土木工程
1,279 篇 理学
- 688 篇 数学
- 342 篇 物理学
- 251 篇 生物学
- 221 篇 统计学（可授理学、...
- 147 篇 系统科学
- 68 篇 化学
646 篇 管理学
- 414 篇 管理科学与工程(可...
- 257 篇 图书情报与档案管...
- 151 篇 工商管理
143 篇 法学
- 92 篇 社会学
135 篇 医学
- 119 篇 临床医学
- 98 篇 基础医学(可授医学...
57 篇 经济学
33 篇 军事学
31 篇 农学
25 篇 教育学
14 篇 文学
4 篇 艺术学
1 篇 哲学
1 篇 历史学

主题

75 篇 feature extracti...
65 篇 semantics
59 篇 security
59 篇 cryptography
57 篇 training
56 篇 deep learning
54 篇 computer science
54 篇 blockchain
53 篇 laboratories
53 篇 optimization
52 篇 computational mo...
49 篇 federated learni...
47 篇 privacy
45 篇 authentication
39 篇 accuracy
36 篇 servers
35 篇 information secu...
34 篇 protocols
33 篇 computer archite...
33 篇 data models

机构

148 篇 department of co...
74 篇 national key lab...
66 篇 school of softwa...
58 篇 tsinghua nationa...
50 篇 state key labora...
49 篇 department of co...
48 篇 key laboratory o...
43 篇 hubei province k...
42 篇 school of comput...
39 篇 state key labora...
38 篇 university of ch...
35 篇 department of co...
35 篇 school of cyber ...
34 篇 shandong provinc...
34 篇 shandong provinc...
32 篇 department of el...
32 篇 peng cheng labor...
31 篇 school of cyber ...
30 篇 state key labora...
30 篇 key laboratory f...

作者

32 篇 han zhu
29 篇 niyato dusit
20 篇 wang wei
20 篇 cao xiaochun
18 篇 yang yang
18 篇 zhao jinjing
18 篇 ai bo
18 篇 kuang xiaohui
17 篇 hu shengshan
16 篇 yunhao liu
16 篇 jin hai
15 篇 hai jin
14 篇 ding yong
14 篇 zhang leo yu
14 篇 wang bin
14 篇 chang chin-chen
13 篇 wu yuan
13 篇 ming gu
13 篇 guangwen yang
13 篇 wang jianmin

语言

3,342 篇 英文
257 篇 其他
107 篇 中文
1 篇 德文
1 篇 法文

检索条件"机构=Computer Science and Technology Department Key Laboratory of Information System Security"

共 3699 条记录，以下是3491-3500 订阅

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

详细简洁

排序：

A clustering protocol based on the probability fading strategy in WSNs

A clustering protocol based on the probability fading strate...

引用

2009 International Conference on information Engineering and computer science, ICIECS 2009

作者： Zheng, Gengsheng Hu, Zhengbing Hubei Province Key Laboratory of Intelligent Robot School of Computer Science and Engineering Wuhan Institute of Technology Wuhan 430073 China Department of Information Technology Huazhong Normal University Wuhan 430079 China

ISBN: (纸本)9781424449941

In WSNs, energy efficiency are considered as the key issues in designing routing protocol. This paper proposes a clustering protocol F-LEACH based on the probability fading strategy. It makes further improvement over LEACH, which gives a better performance on energy consumption and system lifetime. In F-LEACH, nodes are preassigned different clusterhead probability values for cluster-head election in terms of their corresponding distances to the base station (BS). BS can carry out the assignment task. Nodes far from BS get little probability while nodes near BS get great probability. Then nodes elect cluster-heads using their different probability in a self-organizing manner. As a result, less cluster-heads appear in the area far from BS while the total number of cluster-heads is still keep optimal. This help saving the energy consumption by reducing long distance transmission from distant cluster-heads to BS. Simulation results show that F-LEACH performs better than LEACH in terms of energy consumption and system lifetime. ©2009 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Solid texture synthesis using Position Histogram Matching

Solid texture synthesis using Position Histogram Matching

引用

IEEE International Conference on computer-Aided Design and computer Graphics

作者： Jiating Chen Bin Wang Department of Computer Science and Technology Tsinghua University Beijing China Ministry of Education Key Laboratory of Information System Security Beijing China School of Software Tsinghua University Beijing China Tsinghua National Laboratory for Information Science and Technology Beijing China

In the past, several approaches have been proposed to produce high quality solid textures. Unfortunately, they often suffer from several synthesis artifacts, such as color blurry, bad texture structures, introducing aberrant voxel colors and so on. In this paper, we present a novel algorithm for synthesizing high quality solid textures from 2D exemplars. We adopt an optimization framework with the k-coherence search and the discrete solver for solid texture synthesis. The texture optimization approach is integrated with a new kind of histogram matching, position histogram matching, which effectively causes the global statistics of the synthesized solid textures to match those of the exemplars. Experimental results show that our synthesized results do not suffer from color blurry, and most texture structures are preserved well, outperforming the previous solid texture synthesis algorithms in terms of the synthesis quality.

关键词： Histograms Solid modeling Surface texture Educational technology Laboratories Principal component analysis Software quality computer science information systems computer security

来源：评论

学校读者我要写书评

暂无评论

Extended PEG Algorithm for High Rate LDPC Codes

Extended PEG Algorithm for High Rate LDPC Codes

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Zhiheng Zhou Xiangxue Li Dong Zheng Kefei Chen Jianhua Li Department of Computer Science and Engineering Shanghai Jiaotong University China School of Information Security Engineering Shanghai Key Laboratory of Information Security Management and Technology Research Shanghai Jiaotong University China

Progressive edge-growth (PEG) algorithm is a good candidate to generate tanner graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing low-density parity-check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.

关键词： Parity check codes Decoding information security Signal to noise ratio Distributed processing Application software computer science information management technology management Engineering management

来源：评论

学校读者我要写书评

暂无评论

Reusable Set Constructions Using Randomized Dissolvent Templates for Biometric security

Reusable Set Constructions Using Randomized Dissolvent Templ...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Jinyang Shi Kwok-yan Lam Ming Gu Husheng Li Key Laboratory of Information System Security Ministry of Education Tsinghua National Laboratory of Information Science & Technology Tsinghua University Beijing China Department of EECS University of Tennessee Knoxville TN USA

The emerging biometric cryptography has gained significant interests for key management and privacy protection, but the previously proposed schemes using set metrics for fingerprints may either be too weak to offer enough security or suffer from the performance limitations. In this paper, a new fuzzy cryptographic technique without use of chaff data, Randomized Dissolvent Template (RDT), is proposed for biometric set modalities. The proposed technique is designed to dissolve the enrolled biometric set into a random secret resource, so as to construct robust secured templates by exploiting at least two resources of randomness. In this way, when one fingerprint is used for multiple applications, each time the additional information leakage by secured templates will not exceed the new introduced random information, so RDT is reusable. We thus provide two novel RDT-based constructions in practice: Fuzzy Reconciler using set difference threshold and Fuzzy Dissolver using set intersection threshold. security analysis proves the new constructions have enough computational complexity for the required security properties, and implementations on FVC2002DB fingerprint database show that the proposed schemes can bring about better accuracy performance over current Fuzzy Vault and Fuzzy Extractor, thus are more promising for biometric-based security applications.

关键词： Biometrics Data security Fingerprint recognition Fuzzy sets Cryptography information security Privacy Protection Robustness Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Model Checking Needham-Schroeder security Protocol Based on Temporal Logic of Knowledge

Model Checking Needham-Schroeder Security Protocol Based on ...

引用

International Conference on Networks security, Wireless Communications and Trusted Computing, NSWCTC

作者： Xiangyu Luo Yan Chen Ming Gu Lijun Wu School of Software Key Laboratory of Security for Information System of Ministry of Education Tsinghua University Beijing China Department of Computer Science Guilin University of Electronic Technology Guilin China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781424442232

Formal verification approaches can guarantee the correctness of security protocols. In this paper we take the well-known Needham-Schroeder public-key authentication protocol as an example, to show how we can apply the symbolic model checker for multiagent systems MCTK, which is developed by us, to the verification of security protocols. One temporal epistemic property is checked successfully both in the original version and the Lowe's revised version of the Needham-Schroeder protocol. The experimental result shows that our method is an effective way to the verification of security protocol.

关键词： Logic computer security Cryptographic protocols Communication system security information security Electronic mail Authentication Multiagent systems Cryptography computer networks

来源：评论

学校读者我要写书评

暂无评论

Task Scheduling for Heterogeneous Computing Based on Bayesian Optimization Algorithm

Task Scheduling for Heterogeneous Computing Based on Bayesia...

引用

International Conference on Computational Intelligence and security

作者： Jiadong Yang Hua Xu Peifa Jia State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory of Information Science and Technology Department of Computer Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9781424454112

Efficient task scheduling, as a crucial step to achieve high performance for multiprocessor platform, remains one of the challenge problems despite of numerous studies. This paper presents a novel scheduling algorithm based on Bayesian optimization algorithm (BOA) for heterogeneous computing environment. In the proposed algorithm, BOA constructs and updates Bayesian network according to the task graph of scheduling problems to find the optimal solution assigning tasks to different processors, and the execution sequence of tasks on the same processor is set by the heuristic used in the list scheduling approach. The proposed algorithm is sufficiently evaluated and compared with the related approaches by means of the empirical studies on benchmark applications. The experimental results confirm that the proposed algorithm is able to deliver more efficient schedules. Further experiments also indicate that the proposed algorithm maintains almost the same performance with different parameter settings.

关键词： Processor scheduling Bayesian methods Scheduling algorithm Computational intelligence Laboratories Clustering algorithms computer security information security National security High performance computing

来源：评论

学校读者我要写书评

暂无评论

New birthday attacks on some MACs based on block ciphers

引用

29th Annual International Cryptology Conference, CRYPTO 2009

作者： Yuan, Zheng Wang, Wei Jia, Keting Xu, Guangwu Wang, Xiaoyun Institute for Advanced Study Tsinghua University Beijing 100084 China Beijing University of Posts and Telecommunications Beijing 100876 China Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Jinan 250100 China Department of Electrical Engineering and Computer Science University of Wisconsin Milwaukee WI United States

ISBN: (纸本)3642033555

This paper develops several new techniques of cryptanalyzing MACs based on block ciphers, and is divided into two parts. The first part presents new distinguishers of the MAC construction Alred and its specific instance Alpha-MAC based on AES. For the Alred construction, we first describe a general distinguishing attack which leads to a forgery attack directly with the complexity of the birthday attack. A 2-round collision differential path of Alpha-MAC is adopted to construct a new distinguisher with about 2 65.5 chosen messages and 265.5 queries. One of the most important results is to use this new distinguisher to recover the internal state, which is an equivalent subkey of Alpha-MAC. Moreover, our distinguisher on Alred construction can be applied to the MACs based on CBC and CFB encryption modes. The second part describes the first impossible differential attack on MACs-Pelican, MT-MAC-AES and PC-MAC-AES. Using the birthday attack, enough message pairs that produce the inner near-collision with some specific differences are detected, then the impossible differential attack on 4-round AES to the above mentioned MACs is performed. For Pelican, our attack recovers its internal state, which is an equivalent subkey. For MT-MAC-AES, the attack turns out to be a subkey recovery attack directly. The complexity of the two attacks is 285.5 chosen messages and 285.5 queries. For PC-MAC-AES, we recover its 256-bit key with 285.5 chosen messages and 2128 queries. © 2009 Springer.

关键词： Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

Localizing Loads Execution in a Data Cache Distributed Processor Architecture

Localizing Loads Execution in a Data Cache Distributed Proce...

引用

International Association of computer science and information technology - Spring Conference, IACSITSC

作者： Ruiling Dou Hong An Rui Guo Wenting Han Ming Cong Yongqing Ren Department of Computer Science and Technology University of Science and Technology Hefei China Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

To scale with the on-chip wire delay, the inside of a processor will further be partitioned into more small banks. As the amount of data cache bank scales, the load routing latency will contribute a considerable portion to program executing time. In a tiled processor like T-Flex, we observed that the average load routing latency (hit in data cache) can be largely reduced (by 72.1%) when data is perfectly placed in where the load issues. To reduce the long routing latency of critical loads, we give out a solution for localizing load execution at issuing side in this paper. However, this method will induce overhead of data copies and extra communications to maintain coherence and memory order. We explore the design space for localizing data access, with special respect to maximizing benefits at expense of relatively small overhead. We observed the access frequency and load store behaviors for different copies vary largely, with large amount of successive load accesses concentrating on small amount of data blocks. Our experiments show that with special replication and data copy invalidation strategies, copying overhead will be controlled while maintaining considerable performance profits.

关键词： Delay Tiles computer architecture Routing Processor scheduling computer science Springs Wire Space exploration Art

来源：评论

学校读者我要写书评

暂无评论

Performance and Power Efficiency Analysis of the Symmetric Cryptograph on Two Stream Processor Architectures

Performance and Power Efficiency Analysis of the Symmetric C...

引用

International Conference on Intelligent information Hiding and Multimedia Signal Processing (IIHMSP)

作者： Guang Xu Hong An Gu Liu Ping Yao Mu Xu Wenting Han Xiaoqiang Li Xiurui Hao Department of Computer Science and Technology University of Science and Technology Hefei China Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

Multimedia and some scientific applications have achieved good performance on the stream processor architecture by employing the stream programming model. In order to find out the way to accelerate the symmetric cryptograph on stream processor, we implement and analyze cryptograph algorithms on different stream processors in this paper. Four cipher algorithms including RC5, AES, TWOFISH and 3DES in ECB model are implemented on three platforms, which are stream processor SPI Storm SP16-G160, NVIDIA GeForce 9800GTX, Intel Core2 dual-core processor E7300. The difference of architecture between two stream processors and the character of programming model are described. When we compare throughput rate of these applications, 9800GTX is shown with 4-30x performance improvement over E7300, SP16 achieves the highest power efficiency and obtains 15-20x increase over E7300 in Gops/Watt.

关键词： Performance analysis Cryptography Streaming media computer architecture Acceleration Signal processing algorithms Storms Multimedia systems High performance computing Hardware

来源：评论

学校读者我要写书评

暂无评论

Real-Time Rendering of Translucent Objects with Variable Sizes

Real-Time Rendering of Translucent Objects with Variable Siz...

引用

11th IEEE International Conference on computer-Aided Design and computer Graphics(第11届IEEE国际计算机辅助设计与图形学学术会议 IEEE CAD/GRAPHICS 2009)

作者： Chunhui Yao Bin Wang School of Software Tsinghua University Beijing China 100084 Department of Computer Science and Technology Tsinghua University Beijing China 100084 Key Laboratory for Information System Security Ministry of Education Beijing China 100084 Tsinghua

We present a novel technique for real-timely rendering translucent objects. Our technique is mainly based on translucent shadow maps with a new adaptive sampling strategy. In this sampling strategy, the hierarchy levels and positions for sampling are selected according to the size of target object. By our optimization, less storage in the texture is required than that in previous methods. Compared with previous methods, our technique provide a way to choose the proper sampling pattern and is applicable for a wider range of object sizes. With the implementation on GPU, the presented technique is able to render translucent objects in animated scenes where lights and material parameters vary real-timely without any lengthy preprocessing.

关键词： Rendering (computer graphics) Mobile computing Testing Graphics Cranes Control systems computer architecture Helium Virtual reality computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共370页 << < 346 347 348 349 350 351 352 353 354 355 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：