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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

1,769 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,208 篇 工学
- 1,099 篇 计算机科学与技术...
- 696 篇 软件工程
- 222 篇 信息与通信工程
- 164 篇 电气工程
- 122 篇 电子科学与技术（可...
- 98 篇 控制科学与工程
- 82 篇 生物工程
- 61 篇 动力工程及工程热...
- 49 篇 机械工程
- 46 篇 生物医学工程（可授...
- 32 篇 交通运输工程
- 31 篇 光学工程
- 29 篇 仪器科学与技术
- 25 篇 环境科学与工程（可...
- 24 篇 化学工程与技术
- 21 篇 网络空间安全
- 18 篇 安全科学与工程
- 17 篇 力学（可授工学、理...
498 篇 理学
- 321 篇 数学
- 96 篇 生物学
- 83 篇 系统科学
- 78 篇 物理学
- 72 篇 统计学（可授理学、...
- 34 篇 化学
270 篇 管理学
- 183 篇 管理科学与工程(可...
- 121 篇 图书情报与档案管...
- 116 篇 工商管理
62 篇 医学
- 55 篇 临床医学
36 篇 法学
- 35 篇 社会学
32 篇 经济学
- 32 篇 应用经济学
8 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

198 篇 computer archite...
80 篇 hardware
79 篇 computational mo...
66 篇 high performance...
57 篇 cloud computing
50 篇 grid computing
41 篇 distributed comp...
41 篇 field programmab...
40 篇 bandwidth
37 篇 kernel
37 篇 graphics process...
34 篇 resource managem...
34 篇 computer network...
33 篇 performance eval...
32 篇 throughput
31 篇 computer science
31 篇 application soft...
31 篇 analytical model...
30 篇 program processo...
29 篇 supercomputers

机构

26 篇 college of compu...
19 篇 university of ch...
14 篇 school of comput...
10 篇 college of compu...
9 篇 school of comput...
9 篇 college of compu...
8 篇 school of comput...
7 篇 school of data a...
7 篇 school of comput...
7 篇 institute of com...
6 篇 computer network...
6 篇 tsinghua univers...
6 篇 school of cyber ...
6 篇 changsha univers...
5 篇 university of sc...
5 篇 skl of computer ...
5 篇 computer science...
5 篇 school of comput...
5 篇 hubei province k...
5 篇 zhongguancun lab...

作者

11 篇 duan yucong
7 篇 zhang tao
7 篇 li kenli
7 篇 xu xiaolong
6 篇 wang wei
6 篇 gao guang r.
5 篇 li peng
5 篇 yunquan zhang
5 篇 liu qin
5 篇 wang dong
5 篇 bader david a.
5 篇 liu ruicheng
5 篇 zhang rui
5 篇 wan shouhong
5 篇 wu jigang
5 篇 panda dhabaleswa...
5 篇 zhang jie
5 篇 wang xiaoliang
5 篇 chen long
5 篇 li wei

语言

1,714 篇 英文
51 篇 其他
3 篇 中文
1 篇 波兰文

检索条件"任意字段=21st International Symposium on Computer Architecture and High Performance Computing"

共 1769 条记录，以下是711-720 订阅

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

详细简洁

排序：

The new copy file command parser for NVM devices 21

The new copy file command parser for NVM devices

引用

21st IEEE international Conference on high performance computing and Communications, 17th IEEE international Conference on Smart City and 5th IEEE international Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Cai, Tao Wang, Jie Liu, Peiyao Niu, Dejiao He, Qingjian Liang, Jun School of Computer Science and Communication Engineering Jiangsu University Zhenjiang Zhenjiang China

ISBN: (纸本)9781728120584

NVM devices have the advantages that their read and write speeds are close to DRAM and it can be accessed by byte, then it becomes the hotspot in current research. However, there are many factors that affect the efficiency of NVM devices in current I/O stack such as multi-level cache and several context switch between kernel space and user space. This paper designs a new copy file command parser for NVM devices named NVCP. The structure of NVCP is given firstly. Then, this paper proposed the autonomous replication strategy, and the block address acquisition algorithms of source and destination file. The embedded processor in NVM devices is used to copy the data in itself. The I/O stack can be shortened and the affection of NVM device interface to the efficiency of the copy file command parser can be reduced. Meanwhile, writing amplification can be reduced. Finally, the prototype is implemented based on PMEM and compared with the current copy file command parser on NVM devices, NOVA and PMFS. The results verify that NVCP can reduce 17%-70% time overhead compared with the current copy file command parser and has strong adaptability. © 2019 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Topology-aware event sequence mining for understanding hpc system behavior and detecting anomalies 21

Topology-aware event sequence mining for understanding hpc s...

引用

作者： Li, Zongze Fu, Song Blanchard, Sean Lang, Michael Department of Computer Science and Engineering University of North Texas Denton DentonTX United States HPC-DES Group Computer Computational and Statistical Sciences Division Los Alamos National Laboratory Los AlamosNM United States

ISBN: (纸本)9781728120584

System logs provide invaluable resources for understanding system behavior and detecting anomalies on high performance computing (HPC) systems. As HPC systems continue to grow in both scale and complexity, the sheer volume of system logs and the complex interaction among system components make the traditional manual problem diagnosis and even automated line-by-line log analysis infeasible or ineffective. Sequence mining technologies aim to identify important patterns among a set of objects, which can help us discover regularity among events, detect anomalies, and predict events in HPC environments. The existing sequence mining algorithms are compute-intensive and inefficient to process the overwhelming number of system events which have complex interaction and dependency. In this paper, we present a novel, topology-aware sequence mining method (named TSM) and explore it for event analysis and anomaly detection on production HPC systems. TSM is resource-efficient and capable of producing long and complex event patterns from log messages, which makes TSM suitable for online monitoring and diagnosing of large-scale systems. We evaluate the performance of TSM using system logs collected from a production supercomputer. Experimental results show that TSM is highly efficient in identifying event sequences on single and multiple nodes without any prior knowledge. We apply verification functions and requirements and prove the correctness of the event patterns produced by TSM. © 2019 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Task assignment method in spatial crowdsourcing based on graph search 21

Task assignment method in spatial crowdsourcing based on gra...

引用

作者： Meng, Fanchao Zhang, Shuo Zheng, Xuanchi Sun, Shanxin School of Computer and Technology Harbin Institute of Technology at Weihai Shandong China

ISBN: (纸本)9781728120584

In the research on the urban crowdsourcing distribution service scheduling, one of the keys is the spatial crowdsourcing task assignment. Aiming at the current spatial crowdsourcing lacking of the consideration for the actual road network, a graph-based crowdsourcing task optimization assignment model and its optimization algorithm are proposed, in order to obtain the maximum number of courier assigned tasks at a time. The optimal assigned task and delivery path of the courier are obtained under the condition of satisfying the goal and constraints. In this study, at first the actual geographical location is mapped into a map structure, considering the crowdsourcing task starting location, task target location and the courier location. Then, three graph-based spatial task assignment methods are implemented: the first is to realize the realistic grab strategy, location service-based grab strategy (LSGS);the second is crowdsourcing task assignment algorithm based on the task location (TATL);the third is crowdsourcing task assignment algorithm based on ant colony planning (TAAP). Finally, through the comparison of multiple sets of experiments, the proposed TATL and TAAP algorithms can obtain the distribution path and improve the task assignment efficiency. © 2019 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Address randomization for dynamic memory allocators on the GPU 21

Address randomization for dynamic memory allocators on the G...

引用

作者： Peng, Can Huang, Chenlin Hu, Daokun Bang, Di Sun, Jianhua Chen, Hao Zhong, Xionghu College of Computer Science and Electronic Engineering Hunan University Changsha China School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9781728120584

GPUs have been widely used in multi-user environments such as the cloud due to its rich thread-level parallelism. In such an environment, multiple kernels can execute in parallel. However, it is possible that a kernel leverages buffer overflow to attack other kernels on the same GPU. The limited existing work focuses on the detection of buffer overflows instead of prevention. Address randomization is an effective approach to preventing memory-related attacks on the CPU. However, current GPUs lack similar support to defend the increasing threats of memory overflow. In this paper, we propose an address randomization method for dynamic memory allocation on the GPU. We have implemented and compared different pseudo-random algorithms on the GPU, and integrated the address randomization into an existing allocator. Elaborate discussions are presented to analyze the security of our proposed address randomization. Experimental evaluations show that the overhead incurred by our randomized algorithm is less than 20% on top of existing memory allocators. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Budget constraint roadside units placement for traffic flows monitoring system with reliability in vehicular networks 21

Budget constraint roadside units placement for traffic flows...

引用

作者： Jiang, Peng Li, Peng Zhang, Tao Huang, Weiyi He, Heng Nie, Lei Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

In Traffic Flows Monitoring System (TFMS), the key problem is how to install Roadside Units (RSUs) reliably to monitor traffic flows with the constrained budget. The reliability of Traffic Flows Monitoring System(TFMS) is determined by the number of RSUs each traffic flow pass through, and the RSUs placement number is determined by the budget and the placement strategy. In this paper, we investigate the budget constraint RSUs placement problem for traffic flows monitoring system with reliability in vehicular networks. Given a budget constraint, the problem is how to install RSUs to ensure the reliability of TFMS, that is each traffic flow pass through RSUs as many as possible with the limited budget. We prove that this problem is NP-hard. Then, we propose two greedy algorithms to solve the problem according to the pigeonhole principle. Moreover, approximation ratios of proposed algorithms are given. Finally, we verify the feasibility of proposed algorithms through extensive experiments, and the results show that the proposed algorithms are superior to the other algorithms. © 2019 IEEE.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Multi-objective power optimization for full duplex system based on chebyshev weighting 21

Multi-objective power optimization for full duplex system ba...

引用

作者： Xu, Peng Liu, Guangli Gao, Jing Gu, Peishang College of Electronic and Information Engineering Shenyang Aerospace University China School of Computer and Communication Engineering Northeastern University Qinhuangdao China School of Control Engineering Northeastern University China

ISBN: (纸本)9781728120584

In this paper, a power-saving resource allocation algorithm for wireless communication systems using full-duplex (FD) base station (BS) to simultaneously serve multiple singleantenna half-duplex (HD) uplink and downlink users is investigated. Unlike the conventional interference mitigation approaches, we propose to use correlation rotation (CR) linear precoding to influence common channel interference (CCI) of multiple-input multiple-output (MIMO) downlink channel by use data symbols and channel state information (CSI) knowledge of FD radio BS. A multi-objective optimization problem (MOOP) via the modified weighted Chebyshev method was established to study the two conflicting yet desirable system design objectives, namely, the total downlink transmit power minimization and total uplink transmit power minimization, while guaranteeing the quality of service (QoS) required by all users. And the semi-definite programming relaxation method is used to solve the non-convex MOOP. Simulation results show that compared with the conventional algorithm which regards interference as a harmful factor, the proposed algorithm provides significant power savings. © 2019 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Privstream: Enabling privacy-preserving inferences on IoT data stream at the edge 21

PrivStream: Enabling privacy-preserving inferences on IoT da...

引用

作者： Wang, Dan Ren, Ju Xu, Chugui Liu, Juncheng Wang, Zhibo Zhang, Yaoxue Shen, Xuemin School of Computer Science and Engineering Central South University China School of Cyber Science and Engineering Wuhan University China Department of Electronic and Computer Engineering University of Waterloo Canada

ISBN: (纸本)9781728120584

Differential privacy (DP) has been recognized as a useful technique to achieve the trade-off between privacy guarantee and data utility. However, applying DP on the continuous data stream to protect sensitive inferred information faces two significant challenges. Firstly, directly adding noise into the continuous data stream may significantly reduce the data utility. Secondly, it is difficult to effectively and efficiently sample the data stream since the distribution of the data stream is usually unknown in advance. In this paper, we propose Privstream, a privacy-preserving IoT data stream analytical framework based on edge computing, to address the two challenges. Specifically, Privstream is split into two parts distributed at the IoT device and edge server, respectively. The first part, deployed at the device side, adaptively samples the data stream, leverages a tailored autoencoder to conduct data minimization and obfuscates the learnt features by injecting Laplace noise. The second part, deployed at the edge server side, reconstructs the perturbed features into obfuscated data stream for useful inferences without privacy disclosure. Moreover, we present the implementation details of Privstream on a practical IoT system and theoretically analyze that Privstream can provide provable privacy guarantee. The experimental results based on realistic IoT data stream demonstrate that Privstream can preserve the data utility of useful inferences and mitigate the sensitive inferences simultaneously with efficient system overheads. © 2019 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

HFil: A high accuracy bloom filter 21

HFil: A high accuracy bloom filter

引用

作者： Patgiri, Ripon Department of Computer Science AND Engineering National Institute of Technology Silchar Assam788010 India

ISBN: (纸本)9781728120584

Bloom Filter is a data structure for membership filter that deployed in diverse domains. Bloom Filter is able to reduce on-chip memory consumption on an order of magnitude. Therefore, Bloom Filter has been deployed in Big Data, Networking, Bioinformatics, Cloud computing and IoT. However, there is a critical issue in Bloom Filter, called false positive which reduces accuracy of Bloom Filter. Therefore, in this paper, we present a novel technique, called HFil (high accuracy Filter) to reduce false positive and achieve high accuracy. HFil deploys several 3D Bloom Filters (3DBF) to achieve high accuracy and low false positive. HFil is a multilevel Bloom Filter by deploying multidimensional Bloom Filter. HFil derives nL HFil where n=1,2,3,4,... In our experiment, we show the performance, accuracy, and false positive of 4L HFil, 6L HFil, 8L HFil, 12L HFil, 14L HFil, and 16L HFil. The 4L HFil outperforms all other variants of HFil in terms of performance. On the contrary, 16L HFil has higher accuracy than its lower level HFil. Moreover, 16L HFil has the highest accuracy of 99.99% while the 4L HFil has the lowest accuracy of 98.77%. The asymptotic behavior of the 4L HFil, 6L HFil, 8L HFil, 10L HFil, 12L HFil, 14L HFil and 16L HFil have same which is O(1) for insertion and lookup operation. © 2019 IEEE.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Optimal bandwidth allocation for data transmission in virtual data centers 21

Optimal bandwidth allocation for data transmission in virtua...

引用

作者： Chen, Lisha Kang, Zejian Dai, Weining Zhang, Zhemin Wang, Cheng Li, Jonathan Key Laboratory of Smart City Xiamen University Xiamen Fujian China Department of Computer Science Xiamen University Xiamen Fujian China Department of Information and Communication Engineering Xiamen University Xiamen Fujian China

ISBN: (纸本)9781728120584

In this paper, we propose to use the transmission time of data blocks as the metric to measure the network utilization, and study the bandwidth allocation for multi-path data transmission in virtual data centers. We start with the case that data transmission requires no minimum bandwidth, and formulate the bandwidth allocation problem as two convex optimization problems. In the first problem, the maximum transmission time of all data blocks is minimized under the given data block sizes and link capacities, which is named as the maximum transmission time minimization (MTTM) problem. The second convex optimization problem minimizes the transmission time summation of all data blocks, and the problem is named as the transmission time summation minimization (TTSM) problem. These two problems are then generalized to the case that data transmission has minimum bandwidth requirement, and the corresponding problems are named as general MTTM (G-MTTM) and general TTSM (G-TTSM) problems. By exploring the properties of the G-MTTM problem, we design a fast algorithm for it, named as TTM-based algorithm. Extensive simulation results demonstrate that the G-MTTM and G-TTSM problems can be efficiently solved, and to use transmission time of data blocks as the metric for network utilization measurement and optimization is practical. © 2019 IEEE.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

The study of web service discovery: a clustering and differential evolution algorithm approach 21

The study of web service discovery: a clustering and differe...

引用

作者： Huang, Zhao Zhao, Wei School of Computer Science Shaanxi Normal University Xi'an China

ISBN: (纸本)9781728120584

With the rapid development of the Internet, the number of web services has a significant increase, providing various types of online services available today. However, finding the target web service in a quick and accurate method to meet the needs of users is becoming the major problem of the service discovery. In this study, we proposed a new method of web service discovery, which is based on the clustering and differential evolution algorithm. To carry out our study, firstly, we clustered the service set and identified the most similar class to narrow down the searching scope by calculating the semantic similarity between each class and the query. Second, the similarities of each service in the target class to the query are calculated by using different measurement methods, including Cosine similarity, Euclidean distance, Manhattan distance, Chebyshev distance and Bray Curtis distance. These results are used as the input of the differential evolution algorithm for our iterative simulation. Our findings show that compared with the traditional methods, our proposed approach that integrates the benefits of the clustering and differential evolution algorithm has a lower error, and is more consistent with the users' requirements. More importantly, relevant web services can be retrieved more efficiently and accurately. © 2019 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 68 69 70 71 72 73 74 75 76 77 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：