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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

379 篇 会议
127 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

321 篇 工学
- 245 篇 计算机科学与技术...
- 181 篇 软件工程
- 64 篇 信息与通信工程
- 36 篇 电子科学与技术（可...
- 34 篇 控制科学与工程
- 24 篇 电气工程
- 20 篇 机械工程
- 18 篇 生物工程
- 15 篇 仪器科学与技术
- 12 篇 动力工程及工程热...
- 8 篇 环境科学与工程（可...
- 7 篇 农业工程
- 6 篇 材料科学与工程（可...
- 6 篇 土木工程
- 6 篇 网络空间安全
- 5 篇 力学（可授工学、理...
- 5 篇 冶金工程
- 4 篇 建筑学
129 篇 理学
- 85 篇 数学
- 27 篇 系统科学
- 19 篇 物理学
- 19 篇 生物学
- 17 篇 统计学（可授理学、...
- 6 篇 化学
85 篇 管理学
- 52 篇 管理科学与工程(可...
- 36 篇 图书情报与档案管...
- 14 篇 工商管理
11 篇 经济学
- 11 篇 应用经济学
10 篇 法学
- 9 篇 社会学
8 篇 农学
- 7 篇 作物学
4 篇 文学
3 篇 军事学
2 篇 医学
1 篇 艺术学

主题

28 篇 computational mo...
18 篇 distributed proc...
17 篇 benchmark testin...
15 篇 concurrent compu...
15 篇 laboratories
14 篇 computer archite...
13 篇 deep learning
13 篇 fault tolerance
13 篇 algorithm design...
13 篇 feature extracti...
13 篇 kernel
12 篇 cloud computing
11 篇 parallel process...
11 篇 application soft...
11 篇 graphics process...
11 篇 servers
10 篇 computer science
10 篇 conferences
10 篇 educational inst...
10 篇 semantics

机构

79 篇 national laborat...
78 篇 science and tech...
52 篇 college of compu...
36 篇 school of comput...
28 篇 national laborat...
22 篇 science and tech...
22 篇 national key lab...
20 篇 national laborat...
16 篇 national laborat...
15 篇 school of comput...
14 篇 national laborat...
12 篇 national key lab...
8 篇 national key lab...
8 篇 national key lab...
7 篇 department of co...
7 篇 college of compu...
7 篇 science and tech...
6 篇 national laborat...
5 篇 school of advanc...
5 篇 xiangjiang lab

作者

20 篇 yijie wang
20 篇 wang yijie
15 篇 zhigang luo
15 篇 peng yuxing
15 篇 wang huaimin
14 篇 ji wang
13 篇 naiyang guan
13 篇 huaimin wang
12 篇 dongsheng li
12 篇 liu jie
12 篇 jie liu
10 篇 yuxing peng
10 篇 wang ji
10 篇 fu yongquan
9 篇 peichang shi
9 篇 guibin wang
9 篇 xuhui huang
9 篇 wang huai-min
9 篇 xu xinhai
9 篇 kai lu

语言

476 篇 英文
26 篇 中文
6 篇 其他

检索条件"机构=National Laboratory for Parallel and Distributed Processing School of Computer Science"

共 508 条记录，以下是291-300 订阅

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

详细简洁

排序：

Skyline query processing on interval uncertain data

Skyline query processing on interval uncertain data

引用

作者： Li, Xiaoyong Wang, Yijie Li, Xiaoling Wang, Guangdong National Lab. for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769546698

Many recent applications involve processing and analyzing uncertain data. Recently, several research efforts have addressed answering skyline queries efficiently on massive uncertain datasets. However, the research lacks methods to compute these queries on uncertain data, where each dimension of the uncertain object is represented as an interval or an exact value. In this paper, we extensively study the problem of skyline query on these interval based uncertain objects, which has never been studied before. We first model the problem of querying the skylines on interval datasets. Typically, we address two efficient algorithms with I/O optimal for the conventional interval skyline queries and constrained interval skyline queries, respectively. Extensive experiments demonstrate the efficiency of all our proposed algorithms. © 2012 IEEE.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

On the feasibility of common-friend measurements for the distributed online social networks

On the feasibility of common-friend measurements for the dis...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed social networks have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose FDist, a distributed common-friend estimation scheme that estimates the number of common-friends between any pair of users without disclosing the friends' information. FDist uses privacy-preserving common-friend measurements to collect a small number of common-friend samples, and uses low-dimensional coordinates to estimate the number of common friends to other users. Simulation results on real-world social networks confirm that FDist is both scalable and accurate. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

BCE: A privacy-preserving common-friend estimation method for distributed online social networks without cryptography

BCE: A privacy-preserving common-friend estimation method fo...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed online social networks (DOSN) have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose BCE (Bloom Filter based Common-Friend Estimation), a scalable and privacy-preserving common-friend estimation scheme that estimates the set of common friends without the need of cryptography techniques. First, BCE denotes each user using the identifiers created by the Peer-to-Peer underlay that are robust against the dictionary attacks. Second, BCE uses a Bloom filter to represent a friend list for scalability. Third, BCE estimates common friends of two users using the intersection of Bloom filters computed by one of their common friends, which ensures the privacy of friend lists against unknown users. Our privacy analysis shows that BCE hides the privacy of each user with a high probability. Simulations over real-world social-network data sets confirms that BCE is both accurate and scalable. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

An efficient packing algorithm for spatial keyword queries

An efficient packing algorithm for spatial keyword queries

引用

6th International Conference on Convergence and Hybrid Information Technology, ICHIT 2012

作者： Pan, Jinkun Li, Dongsheng Li, Liming National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology 410073 Changsha China Shanghai Garrision 200040 Shanghai China

ISBN: (纸本)9783642326448

With the increase of location-based services, Web contents are being geo-tagged, and spatial keyword queries that retrieve objects satisfying both spatial and keyword conditions are gaining in prevalence. Unfortunately, the state-of-the-art packing algorithms only focus on spatial relationship, and they are not fit for the spatial keyword queries. In this paper, we propose a new packing algorithm named KBS which takes both location and keyword information into consideration, thus optimizing R-tree for spatial keyword queries. Experimental results on both real and synthetic datasets show that our method achieves high performance and space utilization. © 2012 Springer-Verlag.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Support efficient and fault-tolerant multicast in bufferless network-on-chip

Support efficient and fault-tolerant multicast in bufferless...

引用

作者： Feng, Chaochao Lu, Zhonghai Jantsch, Axel Zhang, Minxuan Yang, Xianju National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China Department of Electronic Systems Royal Institute of Technology Sweden

SUMMARY In this paper, we propose three Deflection-Routing-based Multicast (DRM) schemes for a bufferless NoC. The DRM scheme without packets replication (DRM-noPR) sends multicast packet through a non deterministic path. The DRM schemes with adaptive packets replication (DRM-PR-src and DRMYR-all) replicate multicast packets at the source or intermediate node according to the destination position and the state of output ports to reduce the average multicast latency. We also provide fault tolerant supporting in these schemes through a reinforcement learning based method to reconfigure the routing table to tolerate permanent faulty links in the network. Simulation results illustrate that the DRM-PR-all scheme achieves 4l6o, 43cc and 37% less latency on average than that of the DRM-noPR scheme and 27cc, 29cc and 2S6o less latency on average than that of the DRM-PR-src scheme under three synthetic traffic patterns respectively. In addition, all three fault tolerant DRM schemes achieve acceptable performance degradation at various link fault rates without any packet lost. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Inducing taxonomy from tags: An agglomerative hierarchical clustering framework

Inducing taxonomy from tags: An agglomerative hierarchical c...

引用

8th International Conference on Advanced Data Mining and Applications, ADMA 2012

作者： Li, Xiang Wang, Huaimin Yin, Gang Wang, Tao Yang, Cheng Yu, Yue Tang, Dengqing National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China College of Mechatronics Engineering and Automation National University of Defense Technology Changsha China

ISBN: (纸本)9783642355264

By amassing 'wisdom of the crowd', social tagging systems draw more and more academic attention in interpreting Internet folk knowledge. In order to uncover their hidden semantics, several researches have attempted to induce an ontology-like taxonomy from tags. As far as we know, these methods all need to compute an overall or relative generality for each tag, which is difficult and error-prone. In this paper, we propose an agglomerative hierarchical clustering framework which relies only on how similar every two tags are. We enhance our framework by integrating it with a topic model to capture thematic correlations among tags. By experimenting on a designated online tagging system, we show that our method can disclose new semantic structures that supplement the output of previous approaches. Finally, we demonstrate the effectiveness of our method with quantitative evaluations. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

A malicious code detection method based on statistical analysis

A malicious code detection method based on statistical analy...

引用

2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2012

作者： Wu, Yunlong Chen, Chen Wang, Huiquan Zhou, Jie Xu, Xinhai National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China School of Computer National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9781467300223

The malicious code detection based on behaviors has proved effective. But there are high false positives and high false negatives when using this method. Because the behaviors are always out-of-order and redundant. To solve these problems, this paper proposes a detection method based on statistical analysis. Firstly, this method uses association rules to sort out the behaviors, and then we can get the integrated and accurate behavior sequences. Secondly, by using the association algorithm we can pick up the signatures of behavior sequences. In addition, this method can detect the signatures to judge the threat based on statistical analysis. Experimental results indicate that it can reduce both the false positives and the false negatives effectively. © 2012 IEEE.

关键词： Statistical methods

来源：评论

学校读者我要写书评

暂无评论

Research on malicious code detection based on least-squares estimation

Research on malicious code detection based on least-squares ...

引用

2012 International Conference on computer science and Electronics Engineering, ICCSEE 2012

作者： Wu, Yunlong Chen, Chen Wang, Huiquan Xu, Xinhai Zhou, Jie National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China School of Computer National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9780769546476

Malicious code detection based on behaviors is the development direction of anti-virus techniques. However, the current detection methods based on this theory expose several problems such as the unclearness of behavior sequence analysis and the high false negatives. For this situation, this paper proposes a malicious code detection method based on least-squares estimation. In this method, it correlates program behaviors with time and subject-object, and then constitutes an accurate and complete behavior sequence. It can provide a preprocessing method for the subsequent detection. In order to improve the accuracy and intelligence of malicious code detection, we introduce the concept of expert subjective degree. By modeling malicious samples based on least-squares estimation we can train the Expert Subjective Degree Vector (ESDV) and simulate experts to judge the threat values of malicious codes. Experiments show that this method is more accurate than the current ways to detect the malicious codes which execute themselves in sub-period and sub-process ways, so it can be used as an effective complement of the current anti-virus software. © 2012 IEEE.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

OONS: An object oriented neuronal simulator

OONS: An object oriented neuronal simulator

引用

2012 International Applied Mechanics, MechatronicsAutomation and System Simulation Meeting, AMMASS 2012

作者： Xu, Shuai Zhang, Baida Su, Yan Dept.of Information Engineering of the Academy of Armored Force Engineering Beijin China National laboratory for Parallel and Distributed Processing School of Computer NUDT China

OONS is a new Object Oriented Neural Simulator. The goal creating it is making the construction of neural model as quickly and easily as possible for the users, and can run in shorter time than other simulators. OONS is written in C++ programming language and using crank-Nicholson implicit integral method to allow for efficient simulations. Because of multi-level package, it is suitable both for beginners and for experts, especially the simulating algorithm researchers. We test OONS by Rallpacks benchmark set, the results show that OONS is higher efficient and more precision. © (2012) Trans Tech Publications, Switzerland.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Cooperative spectrum sharing in relay-trading mode: A fairness view

Cooperative spectrum sharing in relay-trading mode: A fairne...

引用

4th International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC 2012

作者： Liu, Lixia Hu, Gang Xu, Ming Peng, Yuxing National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China Department of Networks Engineering School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769548104

In the relay-trading mode of wireless cognitive radio networks the secondary user (SU) can achieve a promised spectrum access opportunity by relaying for the primary user (PU). How to utilize the exchanged resource efficiently and fairly is an interesting and practical problem. In this paper we proposed a cooperative spectrum sharing strategy (RT-CSS) for the relay-trading mode from the fairness view. The cooperative SUs are gathered in a cooperative sharing group (CSG), and contribution metric (CM) is proposed to measure each CSG member's contribution to CSG as well as benefit from CSG. The adjustment of CM can guarantee the fairness and efficiency of spectrum sharing. The numerical simulation shows that RT-CSS can achieve better performance than the sense-uncooperative mode. © 2012 IEEE.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共51页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：