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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是681-690 订阅

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

详细简洁

排序：

An analysis method for IPv6 firewall policy 21

An analysis method for IPv6 firewall policy

引用

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

作者： Yin, Yi Tateiwa, Yuichiro Wang, Yun Zhang, Guoqiang Katayama, Yoshiaki Takahashi, Naohisa Zhang, Chao School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Computer Science and Engineering Nagoya Institute of Technology Nagoya Japan School of Computer Science and Engineering Southeast University Nanjing China 28th Research Institute of China Electronics Technology Group Corporation Nanjing China

ISBN: (纸本)9781728120584

Firewalls play a vitally important role to network security. Packet filtering in firewall either accepts or denies network packets based upon a set of pre-defined rules called firewall policy. Management of firewall policy is a boring task and is always prone to error. There have been a lot of analysis methods for anomalies detection of IPv4 firewall policy. But, for the reason of enormous address space, these methods either could not be used to deal with IPv6 firewall policy directly, or have low effectiveness. In this work, we propose a method by using a formal method that can analyze the inclusion relations between every two IPv6 firewall rules and detect their anomalies. We have implemented a prototype system to verify our proposed method, experimental results show the effectiveness. © 2019 IEEE.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

A multi-block grids load balancing algorithm with improved block partitioning strategy 21

A multi-block grids load balancing algorithm with improved b...

引用

作者： Xiong, Hantao Li, Kenli Liu, Xu Li, Keqin College of Information Science and Engineering Hunan University Changsha China Institute of Applied Physics and Computational Mathematics Beijing China Department of Computer Science State University of New York New York United States

ISBN: (纸本)9781728120584

In recent years, high performance computing is developing at a very fast speed, with more processors and larger communication bandwidth, bringing more powerful computing capability and a faster communication speed. The numerical simulation in scientific and engineering computing is a vital kind of application in the field of high performance computing. The load balancing efficiency and communication overheads mainly determine the simulation quality and speed. In order to obtain better simulation quality and speed up the execution of simulation programs, all the processors should be as load-balanced as possible, which means that the multi-block grids are mapped to processors as evenly as possible in terms of computational load, and meanwhile, with the minimum communication overheads among all the processors. To address the above problem, we propose a new structured multi-block grids load balancing algorithm, which combines the recursive edge bisection (REB) algorithm and the modified rectangular partitioning method through new optimal computational load interval and computational load lower bound. Firstly, our algorithm processes the original multi-block grids. Improved optimal computational load interval and computational load lower bound are adopted to evaluate a certain block and decide whether the block needs to be partitioned by strategies such as the modified rectangular partitioning and the recursive edge bisection. Secondly, our algorithm maps the processed multi-block grids into processors. Experiments show that our new structured multi-block grids load balancing algorithm can achieve both better load balancing efficiency and relatively lower communication overheads among all the processors. © 2019 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Bandwidth reservation for data transfers through multiple disjoint paths of dynamic HPNs 21

Bandwidth reservation for data transfers through multiple di...

引用

作者： Zuo, Liudong Zhu, Michelle Wu, Chase Hou, Aiqin Cao, Lei Computer Science Department California State University Dominguez Hills Carson CA90747 United States Department of Computer Science Montclair State University Montclair NJ07043 United States School of Information Science and Technology Northwest University Xi'an Shaanxi710127 China

ISBN: (纸本)9781728120584

Bandwidth reservation was initially designed to provide QoS for real-time multimedia applications, and has been widely used since because of its proved high efficiency and effectiveness. It was recently started being used for big data transfers in high-performance networks from the data generation center to remotely located collaborating sites for data storage, mining and analysis. Most existing work on big data transfer using bandwidth reservation service focuses on addressing various data transfer problems on one or two network paths. In this paper, we study three important problems regarding data transfers using bandwidth reservation through multiple (node-and edge-)disjoint paths in dynamic high-performance networks: (i) achieve the earliest completion time for a given data transfer request through multiple variable disjoint paths, (ii) achieve the earliest completion time for a given data transfer request through multiple fixed disjoint paths with fixed bandwidths, and (iii) achieve the minimum number of fixed disjoint paths with fixed bandwidths to finish the given data transfer by its deadline. We prove all of these problems to be NP-complete and then propose one heuristic algorithm for each. We compare the heuristic algorithms with existing scheduling algorithms, and conduct extensive simulations. The simulation results show that our proposed heuristic algorithms have much better overall scheduling performance. © 2019 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Rigel: A framework for openMP performancetuning 21

Rigel: A framework for openMP performancetuning

引用

作者： Amarasinghe Baragamage, Piyumi Rameshka Senanayake, Pasindu Kannangara, Thulana Seneviratne, Praveen Jayasena, Sanath Patabandi, Tharindu Rusira Hall, Mary Dept of Computer Science AND Engineering University of Moratuwa Katubedda Sri Lanka School of Computing University of Utah Salt Lake CityUT United States

ISBN: (纸本)9781728120584

OpenMP allows developers to harness the power of shared memory multiprocessing in C and C++ applications, but the performance gained with OpenMP is highly sensitive to the underlying hardware, making performance portability across different hardware architectures fragile. For example, in mapping a parallel for loop to hardware, OpenMP 4 offers commands for exploiting vector instructions (simd directives) and automatic GPU offloading (target directives), as well as schedule directives for CPU load balancing. These benefits come with a cost. A developer has to be well aware of the architecture details, and the application, and must iteratively tune to determine the best combination of pragma directives delivering higher performance for the given target architecture. Hence in this paper we introduce Rigel, a framework that automates these decisions to arrive at optimized OpenMP annotated code. Given a code segment with inherent parallelism, our framework uses separate machine learning classification models to predict the anticipated benefit of each optimization. Both Vector Classification and GPU Offloading Classification models perform with average accuracies of 83%. Succeeding the classification process, code segments are optimized accordingly. Our results show that GPU offloading optimization lead to an average speedup of 8x over default non-optimized CPU parallel execution (pragma omp parallel for) and average Vector optimization speedup is 6x compared to LLVM Clang 4.0 auto-vectorization. Furthermore Scheduling mechanism selection process results in overall accuracy of 90%. © 2019 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Seeded-BTM: Enabling biterm topic model with seeds for product aspect mining 21

Seeded-BTM: Enabling biterm topic model with seeds for produ...

引用

作者： Li, Ning Chow, Chi-Yin Zhang, Jia-Dong Department of Computer Science University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781728120584

One of the most challenging problems in aspect level-analysis of product reviews is aspect mining (or aspect extraction), which aims to extract and categorize the terms that describe aspects of the product. In recent years, as topic models like LDA can perform extraction and clustering in one step, most unsupervised and semi-supervised statistical models are LDA-based. These models often treat each short sentence from the review as the training unit. However, LDA is proposed for normal documents without considering the sparse word frequency of short texts, which makes LDA perform poorly on short texts. Instead of using LDA, this paper proposes a Seeded Biterm Topic Model (Seeded-BTM) that models the co-occurred word pairs (i.e., biterms) rather than sentences or whole reviews. And by using seed sets, the model enables unsupervised BTM to discover aspect topics that under the user guidance. Experimental results on real-world product reviews from a number of domains show that Seeded-BTM can find more human conformable product aspects and outperforms the state-of-the-art models. © 2019 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Wear-leveling aware data allocation for chip multiprocessors with non-volatile memory 21

Wear-leveling aware data allocation for chip multiprocessors...

引用

作者： Xiao, Zheng Wang, Bangyong Du, Jiayi Wang, Chao College of Information Science and Engineering Hunan University Changsha China College of Computer and Information Engineering Central South University of Forestry and Technology Changsha China

ISBN: (纸本)9781728120584

Non-Volatile Memory (NVM) has many advantages that provide new choice for embedded storage systems. However, the NVM has a limited number of writes and the overhead of write operation is greater than read operation. In order to overcome these drawbacks, it is necessary to reduce the read and write overhead of the NVM and make the NVM wear-leveling. In this paper, we use Iterational Optimal Data Allocation (IODA) algorithm to achieve the global minimum read and write overhead data allocation, and then, we propose Greedy and Global Balance Optimization Allocation (GBOA) algorithm to allocate NVM data into blocks to achieve NVM wear-leveling at the software-level. Experimental results show that the lifetime of NVM based on the Greedy algorithm is improved by 37.96% and the GBOA is improved by 49.52% compared to the Random algorithm on average, while we can obtain the global minimum read and write overhead. © 2019 IEEE.

关键词： Wear of materials

来源：评论

学校读者我要写书评

暂无评论

Word image representation based on sequence to sequence model with attention mechanism for out-of-vocabulary keyword spotting 21

Word image representation based on sequence to sequence mode...

引用

作者： Wei, Hongxi Kang, Yanke Zhang, Hui School of Computer Science Inner Mongolia University Hohhot China Provincial Key Laboratory of Mongolian Information Processing Technology Hohhot China

ISBN: (纸本)9781728120584

To realize keyword spotting by means of query-by-example, learning efficient representation for word images is an essential issue. However, the amount of vocabulary at the training stage is often far less than the complete vocabulary of a certain language in various learning based representation approaches. Thus, unseen vocabularies might be taken as query keywords which may not exist in training set. Therefore, out-of-vocabulary (OOV) is frequently occurred in keyword spotting. In this paper, a sequence to sequence model with attention mechanism has been proposed to generate representation vectors of word images for solving the problem of OOV. After that, similarities can be calculated between each word image and a given query keyword image on their representation vectors. And then, a ranking list can be formed in descending order of the similarities for a collection of word images. Experimental results demonstrate that the proposed representation approach can be competent for the task of OOV keyword spotting and outperforms various baseline and state-of-the-art methods. © 2019 IEEE.

关键词： Image representation

来源：评论

学校读者我要写书评

暂无评论

ACWB: Access-characteristic write buffer management scheme for flash memory 21

ACWB: Access-characteristic write buffer management scheme f...

引用

作者： Zhu, Lei Liu, Yan Zhang, Zaimei Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Changsha Hunan410082 China School of Economics and Management Changsha University of Science and Technology Changsha Hunan410076 China

ISBN: (纸本)9781728120584

Compared with traditional hard disk drives (HDD), solid state drives (SDD) have distinct characteristics, such as efficient continuous access and random reading capability. Using of SSD is greatly limited due to the out-of-place update and endurance problem. Many flash-aware buffer schemes have been proposed to reduce write and erase operations. However, a good buffer management scheme should reduce the effects of random writes and suit access patterns. In this paper, we propose an access characteristic write buffer management scheme (ACWB) on flash memory that integrates write buffer and cost regulation based on access characteristic. Experimental results show that ACWB increases the response time by 35%, reduces erase times by 25%, and improves the hit ratio by 27% on the average compared with current flash-aware write buffer schemes. © 2019 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of GPU accelerated active storage in FastDFS 21

Design and implementation of GPU accelerated active storage ...

引用

作者： He, Zaihong Kuang, Jishun Tan, Yanjie Liu, Wenjie Sheng, Bin College of Computer Science and Electronic Engineering Hunan University Changsha China

ISBN: (纸本)9781728120584

With the rapid increase of the data, the network bandwidth of the distributed storage system should be full utilized. Existing distributed storage models have higher network delay which leads to less efficiency in data-intensive services. Therefore, we propose a GPU-accelerated Active storage (GAS) model for distributed file systems and implement it on FastDFS. GAS decreases the data transfer by executing the data clustering and filtering operations on storage nodes, and promotes the computing capacity of the storage server by calling GPU. For ensuring the active storage service commands be transmitted correctly, a communication protocol, called active storage communication protocol (ASCP) is designed. The experimental results show that, compared with traditional storage (TS) and active storage (AS), GAS reduces the execution time of SUM by up to 73.9% and 2.7%, lower the run time of AES by up to 91.9% and 70.3%, and shortens the time consumed of Mean-filter to 59.5% and 59.0% respectively. © 2019 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel high utility sequential pattern mining algorithm 21

An efficient parallel high utility sequential pattern mining...

引用

作者： Zhang, Chunkai Zu, Yiwen School of Computer Science and Technology Harbin Institute of Technology Shenzhen HIT Campus Shenzhen University Town Xili Shenzhen China

ISBN: (纸本)9781728120584

high utility sequential pattern mining (HUSPM) is an emerging research topic in pattern mining. Aiming at this problem, many efficient algorithms have been proposed in recent years. However, most of them are serial algorithms, which assume that the entire database (and the data structures) can completely fit into memory. Thus, two conspicuous drawbacks attract our attention. Firstly, in the big data era, it is hard to put the large scale database completely into the memory. Secondly, the serial algorithms are unable to process the real-time data quickly. To address these shortcomings, in this paper, we propose an efficient distributed algorithm for HUSPM. The proposed algorithm takes the advantages of multiple machines and multi-core processer, so it can quickly compete the mining task. The major contributions are summarized as follows. First, we propose an algorithm based on the SLst strategy to partition the original database. Second, we propose a multi-threading algorithm for HUSPM. Finally, based on the two points, an efficient distributed algorithm, named PHUSP, is proposed. Our experiments show the proposed algorithm is much faster than the state-of-the-art algorithms. © 2019 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 65 66 67 68 69 70 71 72 73 74 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：