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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

308 篇 会议
129 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

261 篇 工学
- 198 篇 计算机科学与技术...
- 152 篇 软件工程
- 49 篇 信息与通信工程
- 40 篇 控制科学与工程
- 24 篇 生物工程
- 19 篇 电子科学与技术（可...
- 18 篇 机械工程
- 18 篇 电气工程
- 11 篇 动力工程及工程热...
- 9 篇 力学（可授工学、理...
- 8 篇 仪器科学与技术
- 7 篇 农业工程
- 6 篇 土木工程
- 6 篇 化学工程与技术
- 6 篇 网络空间安全
- 5 篇 建筑学
- 5 篇 交通运输工程
- 5 篇 核科学与技术
116 篇 理学
- 71 篇 数学
- 25 篇 物理学
- 24 篇 生物学
- 19 篇 系统科学
- 12 篇 统计学（可授理学、...
- 5 篇 化学
65 篇 管理学
- 43 篇 管理科学与工程(可...
- 24 篇 图书情报与档案管...
- 11 篇 工商管理
9 篇 法学
- 8 篇 社会学
7 篇 农学
- 7 篇 作物学
5 篇 经济学
- 5 篇 应用经济学
3 篇 医学
2 篇 文学
2 篇 军事学
2 篇 艺术学
1 篇 教育学

主题

16 篇 computational mo...
15 篇 deep learning
15 篇 training
14 篇 benchmark testin...
14 篇 algorithm design...
14 篇 cloud computing
13 篇 computer archite...
12 篇 feature extracti...
11 篇 servers
10 篇 scalability
10 篇 clustering algor...
9 篇 task analysis
9 篇 throughput
9 篇 laboratories
9 篇 distributed proc...
9 篇 hardware
9 篇 distributed data...
8 篇 runtime
8 篇 parallel process...
8 篇 fault tolerance

机构

134 篇 science and tech...
51 篇 college of compu...
23 篇 national laborat...
22 篇 science and tech...
16 篇 science and tech...
14 篇 national laborat...
13 篇 school of comput...
12 篇 national key lab...
10 篇 laboratory of di...
9 篇 national laborat...
8 篇 school of comput...
8 篇 national key lab...
7 篇 national univers...
7 篇 department of co...
7 篇 national laborat...
7 篇 college of compu...
7 篇 laboratory of so...
7 篇 college of scien...
6 篇 national laborat...
6 篇 college of compu...

作者

36 篇 liu jie
32 篇 jie liu
19 篇 yijie wang
15 篇 zhigang luo
15 篇 wang yijie
15 篇 peng yuxing
14 篇 qinglin wang
13 篇 naiyang guan
13 篇 zuocheng xing
13 篇 wang huaimin
12 篇 kai lu
11 篇 chen xinhai
11 篇 chunye gong
10 篇 yuxing peng
10 篇 huaimin wang
10 篇 wang qinglin
9 篇 dongsheng li
9 篇 xiaodong wang
9 篇 li dongsheng
9 篇 xuhui huang

语言

412 篇 英文
25 篇 中文
2 篇 其他

检索条件"机构=The Science and Technology on Paraller and Distributed Processing Laboratory"

共 439 条记录，以下是261-270 订阅

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

详细简洁

排序：

Succinct Representations in Collaborative Filtering: A Case Study using Wavelet Tree on 1,000 Cores

Succinct Representations in Collaborative Filtering: A Case ...

引用

IEEE International Conference on Parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Xiangjun Peng Qingfeng Wang Xu Sun Chunye Gong Yaohua Wang User-Centric Computing Group University of Nottingham Ningbo China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate side information in CF design, one needs to go beyond the U-I Matrix. In this paper, we took a case study of Succinct Representations in Collaborative Filtering, rather than using a U-I Matrix. Our key insight is to introduce Succinct Data Structures as a new infrastructure of CF. Towards this, we implemented a User-based K-Nearest-Neighbor CF prototype via Wavelet Tree, by first designing a Accessible Compressed Documents (ACD) to compress U-I data in Wavelet Tree, which is efficient in both storage and runtime. Then, we showed that ACD can be applied to develop an efficient intersection algorithm without decompression, by taking advantage of ACD's characteristics. We evaluated our design on 1,000 cores of Tianhe-II supercomputer, with one of the largest public data set ml-20m. The results showed that our prototype could achieve 3.7 minutes on average to deliver the results.

关键词： Vegetation Collaboration Filtering Data structures Runtime Indexes Time complexity

来源：评论

学校读者我要写书评

暂无评论

FPPB: A Fast and Privacy-Preserving Method Based on the Permissioned Blockchain for Fair Transactions in Sharing Economy

FPPB: A Fast and Privacy-Preserving Method Based on the Perm...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Bin Li Yijie Wang Peichang Shi Huan Chen Li Cheng Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China

Blockchain is a distributed system with efficient transaction recording and has been widely adopted in sharing economy. Although many existing privacy-preserving methods on the blockchain have been proposed, finding a trade-off between keeping speed and preserving privacy of transactions remain challenging. To address this limitation, we propose a novel Fast and Privacy-preserving method based on the Permissioned Blockchain (FPPB) for fair transactions in sharing economy. Without breaking the verifying protocol and bringing additional off-blockchain interactive communication, FPPB protects the privacy and fairness of transactions. Additionally, experiments are implemented in EthereumJ (a Java implementation of the Ethereum protocol) to measure the performance of FPPB. Compared with normal transactions without cryptographic primitives, FPPB only slows down transactions slightly.

关键词： Privacy Cloud computing Encryption Registers Protocols

来源：评论

学校读者我要写书评

暂无评论

IWFR: Exploiting full-duplex in wireless relay networks

IWFR: Exploiting full-duplex in wireless relay networks

引用

International Conference on Information science and technology (ICIST)

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China

Traditional wireless relay networks have large end-to-end time delay and low throughput because of the limit that it can't receive and forward at the same time. In this paper, we proposed IWFR: Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the throughput. At the same time, we designed a new implicit acknowledgement mechanism, which can eliminate the ACK overheads and evidently improve the throughput of the relay. To implement IWFR, we also modified the full-duplex node architecture to make it support for immediate relay. Simulation shows that IWFR shortens the end-to-end time delay by 60% on average and improves the throughput to 240% of the original relay.

关键词： Wireless communication Throughput Delay effects Wireless sensor networks Interference Relay networks (telecommunications)

来源：评论

学校读者我要写书评

暂无评论

ME-TCAM: Memory-Efficient Ternary Content Addressable Memory Based on Multipumping-Enabled LUTRAM on FPGA

ME-TCAM: Memory-Efficient Ternary Content Addressable Memory...

引用

Intelligent Computing and Human-Computer Interaction (ICHCI), International Conference on

作者： Zilin Shi Hui Yang Rulin Liu Jinli Yan Peng Qiao Baosheng Wang College of Computer Science and Technology National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) National University of Defense Technology Changsha China

Static random access memory (SRAM) on field programmable gate arrays (FPGAs) can be emulated to offer ternary content addressable memory (TCAM) functionality. However, SRAM-based TCAM wastes storage resources. This is due to the limited capacity of the physical addresses in the SRAM unit. This work proposes a LUTRAM-based TACM scheme on the FPGA called Memory-Efficient TCAM (ME-TCAM). METCAM divides SRAM unit into multiple virtual blocks mapping to a portion of the TCAM table to store the more address information of the TCAM table. Operation on SRAM block means that increasing the overall emulated TCAM bits/SRAM. Moreover, ME-TCAM exploits Xilinx primitives to conFigure lookup tables (LUTs) as 32 × 2 lookup table RAMs (LUTRAMs). We implement ME-TCAM using LUTRAM with a size of 512 × 48 and 1024 × 144 on a Virtex-7 FPGA device. Compared with the state-of-the-art research DUR, ME-TCAM achieves at least 2.6 times more memory efficiency.

关键词： Human computer interaction Associative memory Memory management Random access memory Logic gates Table lookup Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Grid and Cooperative Computing - GCC 2004 1

引用

丛书名： Lecture Notes in Computer science

1000年

作者： Hai Jin Yi Pan Nong Xiao Jianhua Sun

ISBN: (数字)9783540302087

ISBN: (纸本)9783540235644

Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computer science and the GCC conference has become one of the premier forums for presentation of new and exciting research in all aspectsofgridandcooperativecomputing. Theprogramcommitteeispleasedtopresent the proceedings of the 3rd International Conference on Grid and Cooperative Comp- ing (GCC2004), which comprises a collection of excellent technical papers, posters, workshops, and keynote speeches. The papers accepted cover a wide range of exciting topics, including resource grid and service grid, information grid and knowledge grid, grid monitoring,managementand organizationtools, grid portal, grid service, Web s- vices and their QoS, service orchestration, grid middleware and toolkits, software glue technologies, grid security, innovative grid applications, advanced resource reservation andscheduling,performanceevaluationandmodeling,computer-supportedcooperative work, P2P computing, automatic computing, and meta-information management. The conference continues to grow and this year a record total of 581 manuscripts (including workshop submissions) were submitted for consideration. Expecting this growth, the size of the program committee was increased from 50 members for GCC 2003 for 70 in GCC 2004. Relevant differences from previous editions of the conf- ence: it is worth mentioning a signi?cant increase in the number of papers submitted by authors from outside China; and the acceptance rate was much lower than for p- vious GCC conferences. From the 427 papers submitted to the main conference, the program committee selected only 96 regular papers for oral presentation and 62 short papers for poster presentation in the program.

关键词： Theory of Computation Computer Communication Networks Operating Systems Software Engineering Information Systems Applications (incl. Internet) Information Storage and Retrieval

来源：评论

学校读者我要写书评

暂无评论

Poster: Segmentation Based Online Performance Problem Diagnosis

Poster: Segmentation Based Online Performance Problem Diagno...

引用

International Conference on Software Engineering (ICSE)

作者： Jingwen Zhou Zhenbang Chen Ji Wang College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781479919352

Currently, the performance problems of software systems gets more and more attentions. Among various diagnosis methods based on system traces, principal component analysis (PCA) based methods are widely used due to the high accuracy of the diagnosis results and requiring no specific domain knowledge. However, according to our experiments, we have validated several shortcomings existed in PCA-based methods, including requiring traces with a same call sequence, inefficiency when the traces are long, and missing performance problems. To cope with these issues, we introduce a segmentation based online diagnosis method in this poster.

关键词： Principal component analysis Software systems Accuracy Measurement Monitoring Computer architecture Conferences

来源：评论

学校读者我要写书评

暂无评论

Synchronization Error Detection of MPI Programs by Symbolic Execution

Synchronization Error Detection of MPI Programs by Symbolic ...

引用

Asia-Pacific Conference on Software Engineering

作者： Xianjin Fu Zhenbang Chen Chun Huang Wei Dong Ji Wang College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781479974276

Asynchrony based overlapping of computation and communication is commonly used in MPI applications. However, this overlapping introduces synchronization errors frequently in asynchronous MPI programming. In this paper, we propose a symbolic execution based method for detecting input-related synchronization errors. The path space of an MPI program is systematically explored, and the related operations of the synchronization errors in the program are checked specifically. In addition, two optimizations are proposed to improve the efficiency. We have implemented our method as a prototype tool based on the symbolic executor Cloud9. The results of the extensive experiments indicate the effectiveness of our method.

关键词： Synchronization Data communication Libraries Optimization Buffer storage Prototypes Schedules

来源：评论

学校读者我要写书评

暂无评论

IDOpenFlow: An OpenFlow switch to support identifier-locator split communication

IDOpenFlow: An OpenFlow switch to support identifier-locator...

引用

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Yannan Yang Yaping Liu Zhihong Liu School of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781467386456

The traditional identifier locator split network has many issues such as inflexibility, hard to innovate and difficult to deploy. SDN (Software Defined Network) provides a new direction for designing flexible identifier locator split network. The recent identifier locator split network based on SDN use the OpenFlow switch directly via rewritting the address, which lacks the scalability and utilizes locator address ineffectively. An OpenFlow switch named IDOpenFlow is proposed to support the communication based on identifier. IDOpenFlow switch provides the communication mechanism via encapsulating the packets, which has good scalability and utilizing locator address effectively. IDOpenFlow switch encapsulates and decapsulates packets according flow entries which are installed by SDN controller. Moreover, the prototype system shows that IDOpenFlow effectively supports the communication for both the fixed node and the mobile node. With respect to the issues of software forwarding performance, a high-performance IDOpenFlow switch based on Intel DPDK (which is named A-IDOpenFlow) is proposed. The results of Ixia test tool show that: 1) for packets more than 128 bytes, A-IDOpenFlow switch supports the communication based on identifier at rate of 10Gbit/s; 2) for small packet of 64 bytes, the rate of A-IDOpenFlow is 7.25 times faster than the rate of IDOpenFlow.

关键词： Switches Protocols Software Routing Servers Scalability

来源：评论

学校读者我要写书评

暂无评论

Deep Learning for Social Network Information Cascade Analysis: a survey

Deep Learning for Social Network Information Cascade Analysi...

引用

IEEE International Conference on Data science in Cyberspace (DSC)

作者： Liqun Gao Bin Zhou Yan Jia Hongkui Tu Ye Wang Chenguang Chen Haiyang Wang Hongwu Zhuang College of Computer National University of Defense Technology ChangSha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology ChangSha China

The following topics are dealt with: learning (artificial intelligence); text analysis; natural language processing; pattern classification; graph theory; data mining; security of data; social networking (online); fea...

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195599

关键词：

来源：评论

学校读者我要写书评

暂无评论

A low-latency fine-grained dynamic shared cache management scheme for chip multi-processor

A low-latency fine-grained dynamic shared cache management s...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Jinbo Xu Weixia Xu Zhengbin Pang College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

In order to utilize the shared last-level cache (LLC) in chip multi-processors (CMP) more efficiently, the partitioning of LLC resources among all cores should have the characteristics of low-latency for access, fine granularity for migration and simple hardware complexity for implementation. This paper proposes a dynamic LLC management scheme to achieve these goals. The proposed scheme migrates cache resources among different cores at the granularity of cache blocks, instead of ways. The quantity of victim cache blocks that each victim core can migrate to other target cores are related to an eviction probability, which are calculated according to the performance goal. Then the victim cache blocks for a target core is chosen from the nearest victim core who has non-zero eviction probability by introducing innovate E-Table structure in CMP. The eviction probabilities are updated periodically. With the help of E-Tables, the proposal achieves low-latency accesses by always keeping the required cache blocks near to the target cores. And fine granularity is guaranteed by maintaining an eviction probability for each core. In addition, only little additional hardware changes to traditional cache structure is required. Simulation results suggest significant performance improvements from 6.8% to 22.7% over related works.

关键词： Hardware Resource management Probability distribution Proposals Complexity theory Simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：