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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

478 篇 会议
178 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

426 篇 工学
- 322 篇 计算机科学与技术...
- 233 篇 软件工程
- 78 篇 信息与通信工程
- 51 篇 电子科学与技术（可...
- 43 篇 控制科学与工程
- 32 篇 生物工程
- 29 篇 机械工程
- 27 篇 电气工程
- 20 篇 仪器科学与技术
- 15 篇 动力工程及工程热...
- 11 篇 材料科学与工程（可...
- 9 篇 环境科学与工程（可...
- 9 篇 网络空间安全
- 8 篇 土木工程
- 7 篇 农业工程
- 6 篇 力学（可授工学、理...
- 6 篇 建筑学
- 6 篇 化学工程与技术
165 篇 理学
- 103 篇 数学
- 33 篇 生物学
- 30 篇 系统科学
- 25 篇 物理学
- 24 篇 统计学（可授理学、...
- 10 篇 化学
113 篇 管理学
- 75 篇 管理科学与工程(可...
- 42 篇 图书情报与档案管...
- 21 篇 工商管理
14 篇 法学
- 12 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
8 篇 农学
- 7 篇 作物学
4 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 医学
1 篇 艺术学

主题

32 篇 computational mo...
24 篇 concurrent compu...
21 篇 distributed proc...
20 篇 fault tolerance
20 篇 benchmark testin...
18 篇 laboratories
16 篇 application soft...
15 篇 algorithm design...
15 篇 feature extracti...
15 篇 kernel
15 篇 distributed comp...
14 篇 computer archite...
14 篇 servers
14 篇 cloud computing
14 篇 training
13 篇 parallel process...
13 篇 deep learning
13 篇 protocols
13 篇 hardware
13 篇 delay

机构

94 篇 college of compu...
81 篇 national laborat...
78 篇 science and tech...
45 篇 national laborat...
39 篇 school of comput...
31 篇 national laborat...
22 篇 science and tech...
22 篇 national key lab...
19 篇 national key lab...
18 篇 national laborat...
16 篇 national laborat...
15 篇 school of comput...
14 篇 national laborat...
12 篇 national key lab...
11 篇 national laborat...
10 篇 national key lab...
9 篇 national laborat...
8 篇 national key lab...
7 篇 department of co...
7 篇 national laborat...

作者

26 篇 wang huaimin
24 篇 wang yijie
21 篇 dongsheng li
21 篇 yijie wang
20 篇 zhigang luo
20 篇 huaimin wang
18 篇 peng yuxing
17 篇 naiyang guan
17 篇 ji wang
15 篇 li dongsheng
14 篇 yuxing peng
14 篇 wang ji
14 篇 ding bo
14 篇 yin gang
12 篇 xiang zhang
12 篇 liu jie
12 篇 jie liu
11 篇 jia jia
11 篇 wang huai-min
10 篇 xuejun yang

语言

617 篇 英文
40 篇 中文
1 篇 其他

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

共 658 条记录，以下是201-210 订阅

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

详细简洁

排序：

An irregular cutting based distributed mapping algorithm for DVE systems

An irregular cutting based distributed mapping algorithm for...

引用

2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications, PACIIA 2009

作者： Zhang, Wei Zhou, Hangjun Peng, Yuxing Li, Sikun Xi, Min National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Department of Computer Science Xi'an Jiaotong University Xi'an 710049 China

ISBN: (纸本)9781424446070

distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world integrity, the virtual environment should be divided into several parts and mapped to multiple servers, which are located in geographically different places. Many centralized algorithms based on regular cutting method are proposed to solve this problem. However, the dynamic property of clients and distributed property of the system make the existing algorithms unable to undertake it. In this paper, we propose a metric to measure the cutting quality and design a distributed mapping algorithm based on an irregular cutting. Simulation results show that our algorithm greatly decreases the costs of DVE systems for migration of clients and effectively improves the satisfaction degree of users. ©2009 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Reducing repair traffic in P2P backup systems: Exact regenerating codes on hierarchical codes

Reducing repair traffic in P2P backup systems: Exact regener...

引用

作者： Huang, Zhen Biersack, Ernst Peng, Yuxing Department of Computer National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan 410073 China Eurecom Sophia Antipolis France

Peer to peer backup systems store data on "unreliable" peers that can leave the system at any moment. In this case, the only way to assure durability of the data is to add redundancy using either replication or erasure codes. Erasure codes are able to provide the same reliability as replication requiring much less storage space. Erasure coding breaks the data into blocks that are encoded and then stored on different nodes. However, when storage nodes permanently abandon the system, new redundant blocks must be created, which is referred to as repair. For "classical" erasure codes, generating a new block requires the transmission of k blocks over the network, resulting in a high repair traffic. Recently, two new classes of erasure codes, Regenerating Codes and Hierarchical Codes, have been proposed that significantly reduce the repair traffic. Regenerating Codes reduce the amount of data uploaded by each peer involved in the repair, while Hierarchical Codes reduce the number of nodes participating in the repair. In this article we propose to combine these two codes to devise a new class of erasure codes called ER-Hierarchical Codes that combine the advantages of both. © 2011 ACM.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

RScam: Cloud-based anti-malware via reversible sketch 11th

RScam: Cloud-based anti-malware via reversible sketch

引用

11th International Conference Security and Privacy in Communication Networks, SecureComm 2015

作者： Sun, Hao Wang, Xiaofeng Su, Jinshu Chen, Peixin College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9783319288642

Cybercrime caused by malware becomes a persistent and damaging threat which makes the trusted security solution urgently demanded, especially for resource-constrained ends. The existing industry and academic approaches provide available anti-malware systems based on different perspectives. However, it is hard to achieve high performance detection and data privacy protection simultaneously. This paper proposes a cloud-based anti-malware system, called RScam, which provides fast and trusted security service for the resource-constrained ends. In RScam, we present suspicious bucket filtering, a novel signature-based detection mechanism based on the reversible sketch structure, which provides retrospective and accurate orientations of malicious signature fragments. Then we design a lightweight client which utilizes the digest of signature fragments to sharply reduce detection range. Finally, we design balanced interaction mechanism, which transmits sketch coordinates of suspicious file fragments and transformation of malicious signature fragments between the client and cloud server to protect data privacy and reduce traffic volume. We evaluate the performance of RScam with campus suspicious traffic and normal files. The results demonstrate validity and veracity of the proposed mechanism. Our system can outperform other existing systems with less time and traffic consumption. © Institute for computer Sciences, Social Informatics and Telecommunications Engineering 2015.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

MilKBQA: A Complex Knowledge Base Question Answering Dataset on Chinese Military Field 6

MilKBQA: A Complex Knowledge Base Question Answering Dataset...

引用

6th IEEE International Conference on Data Science in Cyberspace, DSC 2021

作者： Xu, Pike Li, Tiejun Huang, Zhen Guo, Min He, Jiezhong Sun, Ding Institute Of Computer National University Of Defense Technology Changsha China National University Of Defense Technology Laboratory Of Parallel And Distributed Processing Changsha China School Of Computer National University Of Defense Technology Changsha China

ISBN: (纸本)9781665418157

Facts in military field tend to involve elements of time, space, quantity, status, and so on. Existing methods of representing knowledge in the form of triples fail to adequately express these facts, and also cause obstacles to knowledge storage and updating. Furthermore, question answering on these facts introduces new complexity dimension, which are complicated to be supported by existing corpus. Thus, we construct a Chinese knowledge base for military field covering entities and events centric knowledge, referred as MilKB. It consists of 965 entities and 3,017 facts. Moreover, we classify the natural questions into 26 types and construct a complex question answering dataset derived from MilKB, referred as MilKBQA. It consists of 2,829 question-answer pairs, in which 600 are event-centric ones. Experiments with three recent strong baseline models demonstrate that MilKBQA requires further research. © 2021 IEEE.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

CloudDPI: Cloud-based privacy-preserving deep packet inspection via reversible sketch 1

引用

9th International Symposium on Cyberspace Safety and Security, CSS 2017

作者： Li, Jie Su, Jinshu Wang, Xiaofeng Sun, Hao Chen, Shuhui School of Computer National University of Defense Technology Changsha Hunan410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha Hunan410073 China

ISBN: (数字)9783319694719

ISBN: (纸本)9783319694702

Hardware-based middleboxes are ubiquitous in computer networks, which usually incur high deployment and management expenses. A recently arsing trend aims to address those problems by outsourcing the functions of traditional hardware-based middleboxes to high volume servers in a cloud. This technology is promising but still faces a few challenges. First, the widely adopted data encryption techniques contradict with payload inspection needs of some middleboxes such as DPI and IDS devices. Second, the inspection rules of middleboxes may be commercial properties, thus the middlebox providers want to keep their rules confidential under third-party cloud environments, and this creates hindrances for the cloud to perform outsourced middlebox functions. Third, performance of the outsourced middlebox is an inevitable issue that needs deliberate consideration. In this paper, we propose a cloud-based DPI middlebox implementation which performs payload inspection over encrypted traffic while preserving the privacy of both communication data and inspection rules. Our design employs a modified reversible sketch structure which is used for efficient error-free membership testing, and we utilize unkeyed one-way hash functions instead of complex cryptographic protocols to achieve the privacy preservation requirements. CloudDPI supports a wide range of real-world inspection rules, we conduct evaluations on ClamAV rule set and the experiment results demonstrate the effectiveness of our proposal. © 2017, Springer International Publishing AG.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Character feature learning for named entity recognition

Character feature learning for named entity recognition

引用

作者： Zeng, Ping Tan, Qingping Zhang, Haoyu Meng, Xiankai Zhang, Zhuo Xu, Jianjun Lei, Yan College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing Changsha China School of Software Engineering Chongqing University Chongqing China

The deep neural named entity recognition model automatically learns and extracts the features of entities and solves the problem of the traditional model relying heavily on complex feature engineering and obscure professional knowledge. This issue has become a hot topic in recent years. Existing deep neural models only involve simple character learning and extraction methods, which limit their capability. To further explore the performance of deep neural models, we propose two character feature learning models based on convolution neural network and long short-term memory network. These two models consider the local semantic and position features of word characters. Experiments conducted on the CoNLL-2003 dataset show that the proposed models outperform traditional ones and demonstrate excellent performance. © Copyright 2018 The Institute of Electronics Information and Communication Engineers.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Tree-structured bloom filters for joint optimization of false positive probability and transmission bandwidth

Tree-structured bloom filters for joint optimization of fals...

引用

ACM SIGMETRICS International Conference on Measurement and Modeling of computer Systems, SIGMETRICS 2015

作者： Fu, Yongquan Biersack, Ernst Science and Technology Laboratory of Parallel and Distributed Processing School of Computer National Univ. of Defense Technology China Www.e-biersack.eu France

ISBN: (纸本)9781450334860

Bloom filters are frequently used to perform set queries that test the existence of some items. However, Bloom filters face a dilemma: the transmission bandwidth and the accuracy cannot be optimized simultaneously. This dilemma is particularly severe for transmitting Bloom filters to remote nodes when the network bandwidth is limited. We propose a novel Bloom filter BloomTree that consists of a tree-structured organization of smaller Bloom filters, each one using a set of independent hash functions. BloomTree spreads items across levels that are compressed to reduce the transmission bandwidth need. We investigate in detail under which conditions BloomTree performs better than the compressed Bloom filter and the standard Bloom filter. © Copyright 2015 ACM.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

A high efficient in-place transposition scheme for multidimensional arrays

A high efficient in-place transposition scheme for multidime...

引用

3rd International Conference on Information and Computing, ICIC 2010

作者： Yuan, Jie Wu, Jian-Ping Wang, Zheng-Hua National Lab. of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer Science National University of Defense Changsha China

ISBN: (纸本)9780769540474

This paper presents a in-place cycle-reducing method for multidimensional arrays transposition in local memory to reduce the memory R/W operations. The resulting method can significantly reduce the number of subcycles (also called following-cycles) and that of memory operations for square arrays. Taking square array 256 by 256 for example, the number of subcycles used by current available best algorithm can be reduced from 32894 to only 574, using our new method, and the memory operation number can be reduced by about 32.58%, from 98430 to 66366. Taking advantage of this new method, the elapsed time can be reduced as a result. The number of cycles and operations can also be reduced for 2D rectangle arrays with 2m rows and 2n column stored in column-major, especially n=2m, even though the improvement is not as significant as that for square arrays. The improved 2D in-place algorithm has been extended to 3D arrays, and some theoretic and numerical results are also provided. Furthermore, we develop a new in-place 3D arrays transposition algorithm. This algorithm is very important for a deep research for multidimensional arrays. Experimental results show that our algorithm can improve efficiency significantly, compared to some other 3D array transposition schemes. © 2010 IEEE.

关键词： Multidimensional array Memory operation Cycle-reducing Transposition In-place transposition Transposition arrays three-dimensional array Local Memory MULTIDIMENSIONAL

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Model transformation based verification of Web services composition

引用

4th International Conference on Grid and Cooperative Computing - GCC 2005

作者： Yang, YanPing Tan, QingPing Xiao, Yong School of Computer Science National University of Defense Technology Changsha 410073 China National Lab. of Parallel Distributed Processing Changsha 410073 China

ISBN: (纸本)3540305106

Current Web services composition proposals, such as BPEL, BPSS, BPMN and WSCI, provide notations for describing the control and message flows in Web service collaborations. However, such proposals remain at the descriptive level, without providing any kind of mechanisms or tool support for verifying the composition specified in the proposed notations. In this paper, we present to analyze and verify Web services composition by using CP-nets. CP-nets combine the strengths of Petri nets with the expressive power of high-level programming and have sound mathematical semantics. These services composition proposals can be transformed by model transformation rules into CP-nets, which can be used to analyze the performance and to investigate behavioral properties by CP-nets specialized tools. © Springer-Verlag Berlin Heidelberg 2005.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：