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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,917 篇 期刊文献
1,799 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

2,598 篇 工学
- 1,779 篇 计算机科学与技术...
- 1,389 篇 软件工程
- 616 篇 信息与通信工程
- 372 篇 电气工程
- 346 篇 控制科学与工程
- 303 篇 电子科学与技术（可...
- 224 篇 生物工程
- 192 篇 机械工程
- 151 篇 网络空间安全
- 138 篇 光学工程
- 133 篇 生物医学工程（可授...
- 126 篇 仪器科学与技术
- 107 篇 动力工程及工程热...
- 101 篇 安全科学与工程
- 99 篇 交通运输工程
- 70 篇 建筑学
- 64 篇 土木工程
- 64 篇 化学工程与技术
1,268 篇 理学
- 684 篇 数学
- 342 篇 物理学
- 249 篇 生物学
- 221 篇 统计学（可授理学、...
- 147 篇 系统科学
- 66 篇 化学
646 篇 管理学
- 415 篇 管理科学与工程(可...
- 256 篇 图书情报与档案管...
- 156 篇 工商管理
143 篇 法学
- 92 篇 社会学
133 篇 医学
- 117 篇 临床医学
- 98 篇 基础医学(可授医学...
57 篇 经济学
33 篇 军事学
29 篇 农学
26 篇 教育学
14 篇 文学
5 篇 艺术学
1 篇 哲学
1 篇 历史学

主题

87 篇 feature extracti...
69 篇 federated learni...
68 篇 semantics
64 篇 security
62 篇 computational mo...
61 篇 cryptography
59 篇 optimization
58 篇 training
57 篇 deep learning
57 篇 accuracy
54 篇 computer science
54 篇 blockchain
53 篇 laboratories
51 篇 privacy
47 篇 authentication
39 篇 data models
38 篇 servers
37 篇 data mining
37 篇 protocols
37 篇 robustness

机构

147 篇 department of co...
75 篇 key laboratory o...
74 篇 national key lab...
67 篇 school of softwa...
58 篇 shandong provinc...
56 篇 tsinghua nationa...
50 篇 state key labora...
49 篇 department of co...
43 篇 school of comput...
43 篇 hubei province k...
38 篇 state key labora...
36 篇 university of ch...
36 篇 department of co...
35 篇 school of cyber ...
34 篇 shandong provinc...
33 篇 peng cheng labor...
32 篇 department of el...
31 篇 key laboratory f...
30 篇 state key labora...
30 篇 school of cyber ...

作者

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

语言

3,217 篇 英文
407 篇 其他
102 篇 中文
2 篇 德文
2 篇 法文

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

共 3717 条记录，以下是3021-3030 订阅

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

详细简洁

排序：

Boomerang and slide-rotational analysis of the SM3 hash function

Boomerang and slide-rotational analysis of the SM3 hash func...

引用

19th International Conference on Selected Areas in Cryptography, SAC 2012

作者： Kircanski, Aleksandar Shen, Yanzhao Wang, Gaoli Youssef, Amr M. Concordia Institute for Information Systems Engineering Concordia University Montreal QC Canada School of Computer Science and Technology Donghua University Shanghai China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783642359989

SM3 is a hash function, designed by Xiaoyun Wang et al. and published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service system. The design of SM3 builds upon the design of the SHA-2 hash function, but introduces additional strengthening features. In this paper, we present boomerang distinguishers for the SM3 compression function reduced to 32 steps out of 64 steps with complexity 2 14.4, 33 steps with complexity 232.4, 34 steps with complexity 253.1 and 35 steps with complexity 2117.1. Examples of zero-sum quartets for the 32-step and 33-step SM3 compression function are provided. We also point out a slide-rotational property of SM3-XOR, which exists due to the fact that constants used in the steps are not independent. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Threshold secret image sharing

Threshold secret image sharing

引用

15th International Conference on information and Communications security, ICICS 2013

作者： Guo, Teng Liu, Feng Wu, ChuanKun Yang, ChingNung Wang, Wen Ren, YaWei State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China University of Chinese Academy of Sciences Beijing 100190 China Department of Computer Science and Information Engineering National Dong Hwa University Hualien 974 Taiwan School of Information Management Beijing Information Science and Technology University Beijing 100192 China

ISBN: (纸本)9783319027258

A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1/k of the original secret image. Their main technique is by adopting all coefficients of a (k - 1)-degree polynomial to embed the secret pixels. This benefit of small shadow size has drawn many researcher's attention and their technique has been extensively used in the following studies. In this paper, we first show that this technique is neither information theoretic secure nor computational secure. Furthermore, we point out the security defect of previous (k, n)-TSISSs for sharing textual images, and then fix up this security defect by adding an AES encryption process. At last, we prove that this new (k, n)-TSISS is computational secure. © Springer International Publishing 2013.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

Automated classification of protein subcellular location patterns on images of human reproductive tissues

Automated classification of protein subcellular location pat...

引用

3rd Sino-Foreign-Interchange Workshop on Intelligent science and Intelligent Data Engineering, IScIDE 2012

作者： Yang, Fan Xu, Ying-Ying Shen, Hong-Bin Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Shanghai China Key Laboratory of Optic-Electronic and Communication Jiangxi Science and Technology Normal University Nanchang China

ISBN: (纸本)9783642366680

As one of the most significant characteristics of human cell, subcellular localization plays a critical role for understanding specific functions of mammalian proteins. In this study, we developed a novel computational protocol for predicting protein subcellular locations from microscope cell images in human reproductive tissues. Experiments are performed on a benchmark dataset consisting of 7 major subcellular classes in human reproductive tissues collected from Human Protein Atlas database. We first separated protein and DNA staining in the images with both linear and nonnegative matrix factorization separation methods;then we extracted protein multi-view texture features including wavelet haralick and local binary patterns;finally based on the selected important feature subset achieved by feature selection technique, we constructed ensemble classifier based on support vector machines for predictions. Our experimental results show that 84% accuracy can be achieved through current system, and when only considering the most confident classifications, the accuracy can rise to 98%. © Springer-Verlag 2013.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A color digital watermarking in nonsampled contourlet domain using generic algorithm

A color digital watermarking in nonsampled contourlet domain...

引用

5th IEEE International Conference on Intelligent Networking and Collaborative systems, INCoS 2013

作者： Luo, Peng Wei, Ping Liu, Yi-Qun Key Laboratory of Network and Information Security of APF Department of Electronic Technology Engineering University of APF Xi'an 710086 China Laboratory-Center of Computer Department of Information Engineering Engineering University of APF China Xi'an 710086 China Department of Electronic Technology Engineering University of Armed Police Force Xi'an 710086 China

ISBN: (纸本)9780769549880

A novel watermarking approach for copyright protection of color images based on the nonsubsampled contour let transform (NSCT). We employ the genetic algorithm optimization principles and HVS masking technique to obtain high robustness and transparency with respect to the existing algorithms. In our scheme, the embedding factor is controlled locally according to the result of Generic Algorithm (GA) cycle. The simulation results show that the proposed algorithm yields a watermark which is invisible to human eyes and robust to a wide variety of common attacks. © 2013 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Camera calibration and improved computation of fundamental matrix in epipolar geometry

Camera calibration and improved computation of fundamental m...

引用

2013 International Conference on Precision Mechanical Instruments and Measurement technology, ICPMIMT 2013

作者： Duan, Jia Tang, Yuan Yan Zhang, Zhen Chao Guo, Chu Yu Fang, Chi Department of Computer and Information Science University of Macau Macau China Department of Electronic Engineering Tsinghua University State Key Laboratory of Intelligent Technology and Systems Beijing 10084 China

In this paper, firstly we try to look for ways to avoid the camera parameters in order to reconstruct 3D model. We attempt to use the parallel stereo visual system and carry out the mathematical derivation of argumentation. Then we use epipolar geometry to solve this problem. And compare the computation algorithms of fundamental matrix. Then for the algorithm, we propose some improvement to compute the fundament matrix more precisely so that the algorithm is more stable and the robustness is stronger. © 2013 Trans Tech Publications Ltd, Switzerland.

关键词： Stereo vision

来源：评论

学校读者我要写书评

暂无评论

Multi-class character classification with semi-supervised learning based on information entropy

Multi-class character classification with semi-supervised le...

引用

2013 International Conference on Precision Mechanical Instruments and Measurement technology, ICPMIMT 2013

作者： Wang, Xue Wei Tang, Yuan Yan Duan, Jia Peng, Liang Rui Zhang, Zhen Chao Department of Computer and Information Science University of Macau Macau China Department of Electronic Engineering Tsinghua University State Key Laboratory of Intelligent Technology and Systems Beijing 10084 China

Character Classification technology is the key link in OCR system. Most classification methods require abundant marked samples training to get classifier. In the real OCR application, there are so many classes, to label these samples are often waste time and energy, especially for unacquainted language, such as Arabic and Uygur, many characters are difficult to differentiate, so it even needs the help of professional guidance. This paper proposed a novel character classification with semi-supervised learning based on information entropy, introduced discrete event probability estimation theory of information entropy, active to select the optimization character samples, got the new parameters to train the classifier again, choose the most conducive to the classifier performance samples, iteration until the unlabeled samples set is empty. The experiment results show that this method achieves high performance in specific condition. © 2013 Trans Tech Publications Ltd, Switzerland.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

The boomerang attacks on the round-reduced skein-512

The boomerang attacks on the round-reduced skein-512

引用

19th International Conference on Selected Areas in Cryptography, SAC 2012

作者： Yu, Hongbo Chen, Jiazhe Wang, Xiaoyun Department of Computer Science and Technology Tsinghua University Beijing 100084 China Institute for Advanced Study Tsinghua University Beijing 100084 China Key Laboratory of Cryptologic Technology and Information Security Shandong University Ministry of Education China KU Leuven ESAT COSIC and IBBT Belgium

ISBN: (纸本)9783642359989

The hash function Skein is one of the five finalists of the NIST SHA-3 competition. It is based on the block cipher Threefish which only uses three primitive operations: modular addition, rotation and bitwise XOR (ARX). This paper studies the boomerang attacks on Skein-512. Boomerang distinguishers on the compression function reduced to 32 and 36 rounds are proposed, with time complexities 2104.5 and 2454 hash computations respectively. Examples of the distinguishers on 28 and 31 rounds are also given. In addition, the boomerang distinguishers are applicable to the key-recovery attacks on reduced Threefish-512. The time complexities for key-recovery attacks reduced to 32-/33-/34-round are about 2181, 2305 and 2424 encryptions. Because the previous boomerang distinguishers for Threefish-512 are in fact not compatible [14], our attacks are the first valid boomerang attacks for the reduced-round Skein-512. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes

Parallel construction of independent spanning trees and an a...

引用

作者： Cheng, Baolei Fan, Jianxi Jia, Xiaohua Jia, Juncheng School of Computer Science and Technology Soochow University Suzhou 215006 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China Department of Computer Science City University of Hong Kong Tat Chee Avenue Kowloon Hong Kong

Independent spanning trees (ISTs) on networks have applications to increase fault-tolerance, bandwidth, and security. Möbius cubes are a class of the important variants of hypercubes. A recursive algorithm to construct n ISTs on n-dimensional Möbius cube M n was proposed in the literature. However, there exists dependency relationship during the construction of ISTs and the time complexity of the algorithm is as high as O(NlogN), where N=2 n is the number of vertices in M n and n≥2. In this paper, we study the parallel construction and a diagnostic application of ISTs on Möbius cubes. First, based on a circular permutation n-1,n-2,.,0 and the definitions of dimension-backbone walk and dimension-backbone tree, we propose an O(N) parallel algorithm, called PMCIST, to construct n ISTs rooted at an arbitrary vertex on M n . Based on algorithm PMCIST, we further present an O(n) parallel algorithm. Then we provide a parallel diagnostic algorithm with high efficiency to diagnose all the vertices in M n by at most n+1 steps, provided the number of faulty vertices does not exceed n. Finally, we present simulation experiments of ISTs and an application of ISTs in diagnosis on 0-M 4. © 2013 Springer science+Business Media New York.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of regional LS factor computing tool based on GIS and array operation

Design and implementation of regional LS factor computing to...

引用

2013 International Conference on Mechatronics, Applied Mechanics and Energy Engineering, MAMEE 2013

作者： Zhang, Hong Ming Yang, Qin Ke Li, Shu Qin Wang, Mei Li Ying, Ming Lang, Huan Dong, Xue Wen College of Information Engineering Northwest A and F University ShaanXi 712100 China Department of Urbanology and Resource Science Northwest University Shaanxi 710069 China Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an 710071 China

ISBN: (纸本)9783037858325

For over 40 years, the universal soil loss equation (USLE) and its' revised version the revised universal soil loss equation (RUSLE) have been used all over the world for soil mean annual loss per area unit. Because of the watershed erosion models are under developing, many researchers applied the USLE and RUSLE to estimate soil loss in watershed estimations. However, a major limitation is the difficulty in extracting the LS factor. The geographic information system-based (GIS-based) methods which have been developed for estimating the slope length for USLE and RUSLE model also have limitations. A series of ARC/INFO AML program was created that can calculate LS factor for the USLE, however the program need a very long time to run in wide-ranging areas. The flowpath and cumulative cell length-based method (FCL) overcomes this disadvantage but does not consider the following questions: (1) Some original AML program functions are not achieved, so results are different. (2) Using USLE to calculate LS factor that do not adapt to the erosion environment of China. (3) There isn't a friendly graphic user interface. The purpose of this research was to overcome these limitations and extend the FCL method through Integrating CSLE equation. We developed a LS calculation tool (LS-TOOL) in Microsoft'*** environment using C# with a user-friendly interface. Comparing the LS factor calculated with the FCL method and AML method, LS factor values generated by using LS-TOOL method delivers improved results. The LS-TOOL algorithm can automatically calculate slope length, slope steepness, L factor, S factor, and LS factors, providing the results as ASCII files which can be easily used in some GIS software. This study is an important step forward in conducting fast large-scale erosion evaluation. © (2013) Trans Tech Publications, Switzerland.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

TriggerCas: Enabling wireless consrucive collisions

TriggerCas: Enabling wireless consrucive collisions

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Yin Wang Yuan He Dapeng Cheng Yunhao Liu Xiang-yang Li MOE Key Laboratory for Information System Security School of Software TNLIST Tsinghua University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China Key Laboratory of Intelligent Information Processing Universities of Shandong China Department of Computer Science Illinois Institute of Technology USA

Constructive Interference (CI) proposed in the existing work (e.g., A-MAC [1], Glossy [2]) may degrade the packet reception performance in terms of Packet Reception Ratio (PRR) and Received Signal Strength Indication (RSSI). The packet reception performance of a set of nodes transmitting simultaneously might be no better than that of any single node transmitting individually. In this paper, we redefine CI and propose TriggerCast, a practical wireless architecture which ensures concurrent transmissions of an identical packet to interfere constructively rather than to interfere non-destructively. CI potentially allows orders of magnitude reductions in energy consumption and improvements in link quality. Moreover, we for the first time present a theoretical sufficient condition for generating CI with IEEE 802.15.4 radio: concurrent transmissions with an identical packet should be synchronized at chip level. Meanwhile, co-senders participating in concurrent transmissions should be carefully selected, and the starting instants for the concurrent transmissions should be aligned. Based on the sufficient condition, we propose practical techniques to effectively compensate propagation and radio processing delays. TriggerCast has 95 th percentile synchronization errors of at most 250ns. Extensive experiments in practical testbeds reveal that TriggerCast significantly improves PRR (from 5% to 70% with 7 concurrent senders, from 50% to 98.3% with 6 senders) and RSSI (about 6dB with 5 senders).

关键词： Delays Synchronization Signal to noise ratio Receivers Wireless sensor networks IEEE 802.15 Standards

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共372页 << < 299 300 301 302 303 304 305 306 307 308 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：