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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,837 篇 会议
1,571 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

2,283 篇 工学
- 1,671 篇 计算机科学与技术...
- 1,305 篇 软件工程
- 612 篇 信息与通信工程
- 297 篇 电气工程
- 249 篇 电子科学与技术（可...
- 230 篇 控制科学与工程
- 222 篇 生物工程
- 154 篇 机械工程
- 129 篇 网络空间安全
- 110 篇 仪器科学与技术
- 109 篇 光学工程
- 105 篇 生物医学工程（可授...
- 83 篇 化学工程与技术
- 77 篇 动力工程及工程热...
- 75 篇 交通运输工程
- 59 篇 安全科学与工程
- 54 篇 建筑学
1,073 篇 理学
- 634 篇 数学
- 244 篇 生物学
- 228 篇 物理学
- 196 篇 统计学（可授理学、...
- 91 篇 化学
- 91 篇 系统科学
672 篇 管理学
- 389 篇 管理科学与工程(可...
- 310 篇 图书情报与档案管...
- 142 篇 工商管理
106 篇 法学
- 71 篇 社会学
83 篇 医学
- 68 篇 临床医学
- 59 篇 基础医学(可授医学...
58 篇 经济学
- 58 篇 应用经济学
38 篇 农学
23 篇 军事学
11 篇 文学
10 篇 教育学
9 篇 艺术学

主题

138 篇 feature extracti...
123 篇 semantics
95 篇 accuracy
79 篇 computational mo...
77 篇 training
65 篇 data models
64 篇 deep learning
62 篇 federated learni...
49 篇 protocols
48 篇 clustering algor...
47 篇 data mining
45 篇 cryptography
44 篇 neural networks
44 篇 visualization
44 篇 privacy
43 篇 security
43 篇 robustness
42 篇 adaptation model...
41 篇 optimization
41 篇 predictive model...

机构

221 篇 key laboratory o...
202 篇 shandong provinc...
166 篇 school of comput...
80 篇 key laboratory o...
65 篇 college of compu...
64 篇 computer network...
59 篇 college of infor...
57 篇 key laboratory o...
55 篇 college of mathe...
50 篇 shandong fundame...
47 篇 beijing key labo...
46 篇 shandong enginee...
45 篇 key laboratory o...
43 篇 institute of inf...
42 篇 school of cyber ...
41 篇 the key laborato...
40 篇 school of comput...
37 篇 university of ch...
37 篇 shandong provinc...
36 篇 key laboratory o...

作者

46 篇 zhao yao
41 篇 ren jiadong
36 篇 zhou deyu
29 篇 zhang min-ling
27 篇 yang yang
27 篇 min-ling zhang
26 篇 cong runmin
24 篇 guo wenzhong
21 篇 xiaoming wu
20 篇 zhang zhenrong
20 篇 guo kun
20 篇 guang cheng
19 篇 geng xin
19 篇 wang yun
19 篇 du bo
18 篇 xia chunhe
17 篇 xiaoping li
17 篇 liu ximeng
16 篇 di xiaoqiang
16 篇 he yulan

语言

3,089 篇 英文
187 篇 其他
147 篇 中文

检索条件"机构=Key Laboratory for Computer Network and Information Integration"

共 3408 条记录，以下是3231-3240 订阅

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

详细简洁

排序：

The Short Share Secret Sharing Agreement with Matrix Factorization

The Short Share Secret Sharing Agreement with Matrix Factori...

引用

International Conference on information Engineering and computer Science (ICIECS)

作者： XiaoYuan Yang Zhen Liu Key Laboratory of computer Network & Information Security of Engineering Institute of the Armed Police Xi'an Shanxi China

ISBN: (纸本)9781424449934

To make up the limitation of traditional secret sharing schemes that the length of secret can not be extremely great, we use the theory of Jordan matrix factorization and combine with the formulary of Lagrange putting forward an algorithm of (r, n) threshold secret sharing with short share and high efficiency. The length of secret share that each participator needs to conserve has no relation with the length of the secret. So our scheme has a very high space, computation and communication efficiency. It has a very important application when the secret is a big privacy file, a big message transmitting in an insecurity channel, a secret data base shared by several participant or magnanimity data in distributed storage.

关键词： Cryptography Switches Laboratories computer networks information security Lagrangian functions Application software Data privacy Partitioning algorithms Layout

来源：评论

学校读者我要写书评

暂无评论

The Security Matrix Factorization Agreement with Two Parties

The Security Matrix Factorization Agreement with Two Parties

引用

International Conference on Computational Intelligence and Security

作者： XiaoYan Yang Zhen Liu Key Laboratory of computer Network & Information Security of Engineering Institute of the Armed Police Xi'an Shanxi China

In the confidential computing issues of scientific computing, the confidential computing of matrix factorization is still no fruit home and abroad. This paper using Data perturbation assumption and Oblivious Transfer 1 out of k protocol, successfully construct confidential computing protocols of matrix general factorization and QR factorization. On the model of semi-honest, it can meet the confidentiality. At the same time, the method of this protocol is also suitable for confidential computing of matrix other factorizations.

关键词： Protocols Scientific computing information security computer networks Equations Home computing Eigenvalues and eigenfunctions computer security Laboratories Data security

来源：评论

学校读者我要写书评

暂无评论

Access model of web users based on multi-chains hidden Markov models

Access model of web users based on multi-chains hidden Marko...

引用

作者： Zheng, Kangfeng Yang, Yixian Wang, Xiujuan Guo, Shize Key Laboratory of Network and Information Attack and Defence Technology MOE Beijing University of Posts and Telecommunications Beijing China College of Computer Sciences Beijing University of Technology Beijing China No. 54 Research Institute of the General Staff PLA Beijing China

ISBN: (纸本)9780769540276

How to distinguish abnormal access from normal ones is the key problem in Distribution Denial of service(DDoS) attack detection. This research aims at finding out the major difference between the abnormal access and the normal ones in application layer. To this end , the paper conducts modeling on Web users' access behaviors based on hidden Markov model(HMM) with multiple chains and puts forward a method to identify abnormal access. Tests on simulation data indicate that this model can undo Web users access to a certain degree and discern the abnormal access well. © 2010 IEEE.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

A static method for detection of information theft malware

A static method for detection of information theft malware

引用

2nd International Symposium on Electronic Commerce and Security, ISECS 2009

作者： Li, JiaJing Wei, Tao Zou, Wei Mao, Jian Key Laboratory of Network and Software Security Assurance Ministry of Education Peking University Beijing 100871 China Institute of Computer Science and Technology Peking University Beijing 100871 China Department of Electronic and Information Engineering BeiHang University Beijing 10083 China

ISBN: (纸本)9780769536439

Existing techniques based on behavior semantics for information theft malware detection have the main shortcomings of low path coverage and disability of finding hidden malicious behaviors. In this paper we propose a static method for the detection of information theft malware to overcome these shortcomings. It is particularly efficienct for inter-procedure taint analysis, and it is suitable for complicated malware detection, such as Trojan and Bot. Its static style makes it able to find hidden malicious behaviors. We also present an implementation of our method that works on x86 executables and a set of experimental studies validate its good efficiency and effectiveness. © 2009 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Efficient Mining of Strong Negative Association Rules in Multi-Database

Efficient Mining of Strong Negative Association Rules in Mul...

引用

International Conference on Computational Intelligence and Software Engineering (CiSE)

作者： Hong Li Xuegang Hu Key Laboratory of Network and Intelligent Information Processing Department of Computer Science and Tchnology Hefei University Hefei China School of Computer & Information Hefei University of technology Hefei China

Strong negative association rules can reveal irrelevances hidden between frequent itemsets. Existing research has made significant efforts in discovering both positive and negative association rules from single database. This paper presents an efficient method for mining strong negative association rules in multi-database. The method produces some strong negative relational patterns (a kind of infrequent itemsets) by pruning and scanning constructed multi-database frequent pattern tree, and extracts strong negative association rules according to the proposed correlation model. The experimental results show the effectiveness and efficiency of the proposed algorithm.

关键词： Data mining Association rules Itemsets Transaction databases Decision making Laboratories Intelligent networks information processing computer science Relational databases

来源：评论

学校读者我要写书评

暂无评论

A novel mining Method of Global Negative Association Rules in Multi-Database

A novel mining Method of Global Negative Association Rules i...

引用

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)

作者： Hong Li Yijun Shen Xuegang Hu Key Laboratory of Network and Intelligent Information Processing Department of Computer Science and Technology Hefei University of Technology Hefei China School of Computer & Information Hefei University of technology Hefei China

ISBN: (纸本)9781424447374;9781424447541

Mining negative association rules in multi-database has attracted more and more attention. Most existing research focuses on unifying all negative rules discovered from different single databases into a single view. This paper presents a novel method for mining global negative association rules in multi-database. This method produces some infrequent itemsets of potential interest by scanning constructed multi-database frequent pattern tree, and extracts negative association rules of interest according to the proposed correlation model from multi-database. Experimental results show the effectiveness and efficiency of the proposed algorithm.

关键词： Data mining Association rules Itemsets Transaction databases Application software Laboratories Intelligent networks information processing computer science Tires

来源：评论

学校读者我要写书评

暂无评论

Improvement of MODIS 8-day LAI/FPAR product with temporal filters to generate high quality time-series product

Improvement of MODIS 8-day LAI/FPAR product with temporal fi...

引用

2009 Joint Urban Remote Sensing Event

作者： Huifang, Zhang Runhe, Shi Honglin, Zhong Peiqing, Qu Juan, Sun Wenpeng, Lin Su, Li Key Lab. of Geographic Information Science Ministry of Education East China Normal University Shanghai China Key Laboratory of Ecosystem Network Observation and Modeling IGSNRR CAS Beijing China Key Lab. of Urban Ecology and Environment Restoration Shanghai Normal University Shanghai China Computer College Beijing Technology and Business University Beijing China

ISBN: (纸本)9781424434619

Numerous studies have reported that the timeseries terrestrial parameters such as the Normalized Difference Vegetation Index (NDVI), Leaf Area of Index (LAI), Fraction of Absorbed Photosynthetic Active Radiation (FPAR), derived from NOAA/AVHRR, SPOT/VEGETATION, TERRA or AQUA/MODIS, have played significant roles in researching the global environment, terrestrial ecosystems and related ecological researches. However, the remotely sensed signals are interfered severely by atmospheric conditions especially clouds and such noises exists in the time-series products as well. Therefore, to obtain a high quality time-series of terrestrial parameter is a necessary step before further studies. At present several methods have been applied to reduce the noise to construct a fine time-series of NDVI, but few studies concerning the other key terrestrial parameters, such as LAI, FPAR etc. In this paper, after comparing general methods in literatures, we designed a new method based on the Savitzky-Golay filter, which was applied to improve the quality of MODIS 8-Day LAI/FPAR Product to generate timeseries of LAI and FPAR with high quality. Our validation results indicate that more smooth and realistic time-series curves of LAI/FPAR can be obtained by using this new method, which exemplify the dynamic change of forests, crop or plants and key input parameters in modeling the complex land surface processing. ©2009 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

A New Routing Scheme Based on Greedy Tree in Delay Tolerant networks

A New Routing Scheme Based on Greedy Tree in Delay Tolerant ...

引用

IEEE International Symposium on computer network and Multimedia Technology, CNMT

作者： Haizheng Yu Jianfeng Ma Hong Bian Key Laboratory of Computer Network and Information Security Xidian University Xi'an China School of Maths-physics and Information Sciences Xinjiang Normal University Urumqi China

Delay tolerant networking (DTN) is a new store-and-forward architecture and protocol suite for the networks which is intermittent connectivity. Depending on the nodes ability of store and forward, the messages are delivered to their destination with the proper choice of routing protocol by nodes' mobility. In order to successful delivery, many routing protocols use multiply copies methods. Although the messages are transferred to the destination, the redundant of messages copies increase much. These routing protocols are not appropriate for energyconstrained and bandwidth-constrained applications such as the wireless networks. In many resource-constrained mobile wireless DTN networks, single copy routing schemes should be used suitably. This paper presents a new routing scheme of single-copy based on the DTN connectivity graph and the corresponding greedy tree. The nodes choose the next intermediate node to transmit the message by comparing the location of nodes in the greedy tree. We show that delivery ratio is increased significantly by using our scheme in the single-copy routing.

关键词： Disruption tolerant networking Tree graphs Routing protocols Laboratories computer networks information security Wireless networks Delay effects computer architecture network topology

来源：评论

学校读者我要写书评

暂无评论

An efficient mesh simplification algorithm

An efficient mesh simplification algorithm

引用

作者： Wang, Hailing Yin, Guisheng Zhang, Jing Wang, Decai Wang, Jian National Defence Key Laboratory of Autonomous Underwater Vehicle Technology Harbin Engineering University Harbin Heilongjiang 150001 China College of Computer Science and Technology Harbin Engineering University Harbin Heilongjiang 150001 China Network and Information Center Harbin Engineering University Harbin Heilongjiang 150001 China

ISBN: (纸本)9780769540276

This paper presents a new mesh simplification algorithm based on edge collapse, it combines surface curvature and quadric error metric, the position of a new vertex for edge collapse depends on multiple-weighted approach. The new algorithm can improve simplification rationality in procedure and preserve important features after simplification. In an addition, we do some experiments with comparing different simplified models, the results show that the new algorithm not only maintains the overall appearance for models, but also obtains better effectiveness. © 2010 IEEE.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Generating the semantic containers for the query interfaces of deep web

Generating the semantic containers for the query interfaces ...

引用

International Conference on Management and Service Science, MASS 2009

作者： Hao, Liang Wanli, Zuo Jian, Chen Yunge, Mao College of Computer Science and Technology Jilin University Changchun 130012 China Department of Information Changchun Taxation College Changchun 130117 China Key Laboratory of Symbol Computation Knowledge Engineering of the Ministry of Education Changchun 130012 China Network Center of Changchun Taxation College Changchun 130117 China

ISBN: (纸本)9781424446391

With the myriad emergence of the online Web Database, the Web is divided into a two layers information platform which is composed of Surface Web and Deep Web. The huge information hidden in the Deep Web is higher in the quality than the Surface Web. This interests the researchers of the traditional Database community. In order to adapt the Web community, the idea of information fusion is further transformed. However, the nature of the Web is great different from the Database in structure, principle and function. Query reformulation is one of the technical challenges. The only accessible method to get the information in the Deep Web is through the query interfaces provided by the Website of Deep Web. There are many semantic restrictions between the attributes in the query interface. Some attributes are co-occurred and the others are exclusive sometimes. To generate a valid query, we have to reconcile the key attributes and their semantic relations. To address the problem, a method based on the HTML codes is presented in this paper. Different kinds of semantic containers can be got through analyzing the codes of the query interface. The experiment is carried out on the famous Dataset of Deep Web to show the feasibility of the method. ©2009 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共341页 << < 320 321 322 323 324 325 326 327 328 329 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：