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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,691 篇 会议
58 册 图书
54 篇 期刊文献

馆藏范围

2,803 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,845 篇 工学
- 1,629 篇 计算机科学与技术...
- 847 篇 软件工程
- 340 篇 电气工程
- 222 篇 电子科学与技术（可...
- 209 篇 信息与通信工程
- 84 篇 控制科学与工程
- 63 篇 光学工程
- 57 篇 机械工程
- 41 篇 仪器科学与技术
- 39 篇 生物医学工程（可授...
- 38 篇 生物工程
- 31 篇 材料科学与工程（可...
- 25 篇 动力工程及工程热...
- 21 篇 化学工程与技术
- 20 篇 建筑学
- 15 篇 土木工程
- 13 篇 力学（可授工学、理...
- 12 篇 交通运输工程
500 篇 理学
- 343 篇 数学
- 113 篇 物理学
- 51 篇 系统科学
- 48 篇 生物学
- 30 篇 统计学（可授理学、...
- 26 篇 化学
173 篇 管理学
- 119 篇 管理科学与工程(可...
- 62 篇 图书情报与档案管...
- 49 篇 工商管理
40 篇 医学
- 30 篇 临床医学
- 14 篇 基础医学(可授医学...
15 篇 法学
- 15 篇 社会学
9 篇 经济学
9 篇 农学
8 篇 文学
2 篇 军事学
1 篇 教育学

主题

360 篇 parallel process...
219 篇 computer archite...
205 篇 graphics process...
146 篇 parallel archite...
135 篇 graphics process...
129 篇 hardware
116 篇 parallel algorit...
112 篇 image processing
98 篇 computational mo...
94 篇 concurrent compu...
87 篇 instruction sets
86 篇 field programmab...
83 篇 algorithm design...
79 篇 multicore proces...
77 篇 signal processin...
76 篇 parallel process...
66 篇 parallel program...
60 篇 gpu
59 篇 throughput
59 篇 kernel

机构

11 篇 natl univ def te...
6 篇 college of compu...
6 篇 school of comput...
6 篇 hosei univ dept ...
6 篇 natl univ def te...
5 篇 univ aizu dept c...
5 篇 carleton univ sc...
5 篇 school of comput...
5 篇 computer science...
5 篇 inria rennes
5 篇 city university ...
4 篇 chinese acad sci...
4 篇 univ michigan ad...
4 篇 institute of com...
4 篇 univ chinese aca...
4 篇 school of comput...
4 篇 univ jaume 1 dep...
4 篇 hainan internati...
4 篇 tech univ cluj n...
4 篇 department of co...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
9 篇 konrad karczewsk...
9 篇 quintana-orti en...
7 篇 dongarra jack
7 篇 kothapalli kisho...
6 篇 hannig frank
6 篇 liu jie
6 篇 su jinshu
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 wyrzykowski roma...
6 篇 thulasiraman par...
5 篇 ito yasuaki
5 篇 jerzy waśniewski
5 篇 wang guojun
5 篇 geyong min
5 篇 wanlei zhou

语言

2,757 篇 英文
21 篇 其他
15 篇 中文
11 篇 俄文
2 篇 乌克兰文
1 篇 西班牙文

检索条件"任意字段=10th International Conference on Algorithms and Architectures for Parallel Processing"

共 2803 条记录，以下是1061-1070 订阅

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

详细简洁

排序：

Evaluation of global synchronization for iterative algebra algorithms on many-core

Evaluation of global synchronization for iterative algebra a...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/Distributed Computing (SNPD)

作者： Ayaz ul Hasan Khan Mayez Al-Mouhamed Lutfi A. Firdaus Department of Computer Engineering College of Computer Science & Engineering Dhahran Saudi Arabia

Massively parallel computing is applied extensively in various scientific and engineering domains. With the growing interest in many-core architectures and due to the lack of explicit support for inter-block synchronization specifically in GPUs, synchronization becomes necessary to minimize inter-block communication time. In this paper, we have proposed two new inter-block synchronization techniques: 1) Relaxed Synchronization, and 2) Block-Query Synchronization. these schemes are used in implementing numerical iterative solvers where computation/communication overlapping is one used optimization to enhance application performance. We have evaluated and analyzed the performance of the proposed synchronization techniques using Jacobi Iterative Solver in comparison to the state of the art inter-block lock-free synchronization techniques. We have achieved about 1-8% performance improvement in terms of execution time over lock-free synchronization depending on the problem size and the number of thread blocks. We have also evaluated the proposed algorithm on GPU and MIC architectures and obtained about 8-26% performance improvement over the barrier synchronization available in OpenMP programming environment depending on the problem size and number of cores used.

关键词： Synchronization Graphics processing units Jacobian matrices Instruction sets Kernel Computer architecture Microwave integrated circuits

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of DMA transfers in WISHBONE interface

Design and implementation of DMA transfers in WISHBONE inter...

引用

international conference on Communications and Networking in China (CHINACOM)

作者： Lei Lei Jun Wu Tong Sun Songlin Cheng Xin Chen College of Electronic and Information Engineering Tongji University Shanghai China

ISBN: (纸本)9781479987962

the Digital Signal Processor (DSP) is a specialized microprocessor, with its architecture optimized for the operational needs of digital signal *** often uses special memory architectures that are able to fetch multiple data and/or instructions at the same *** applying to WISHBONE bus interface it is much easier to connect the cores, and therefore much easier to create a custom System on Chip (SOC) such as the *** order to increase the data transaction from DSP core to WISHBONE Slave module, this paper proposes a special Direct Memory Access (DMA) which supports a three-ports interface of data transaction. this DMA also offers burst mode and the address list mode of data transaction which can speed the data transmission and make it more flexible. In the process of the design and implement, a synchronization of asynchronous clock issue needs to be solved. the final implementations have been done in ASIC. the functionality of the design is synthesized using Design Compiler and placement and routing by IC compiler.

关键词： Digital signal processing Clocks Registers Synchronization Computer architecture Data communication Delays

来源：评论

学校读者我要写书评

暂无评论

Deployment Method of Virtual Machine Cluster Based on Energy Minimization and Graph Cuts theory

Deployment Method of Virtual Machine Cluster Based on Energy...

引用

international conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Zhiping Peng Bo Xu Delong Cui Weiwei Lin XuAn Wang Department of Computer Science and Technology Guangdong University of Petrochemical Technology Maominig China School of Computer Science and Engineering South China University of Technology Guangzhou China Engineering University of Chinese Armed Police Force Xi'an China

ISBN: (纸本)9781467394741

A deployment method had been constructed for virtual machine cluster based on energy minimization and graph cut theory. First, virtual machine cluster was described by energy minimization. Second, deployment of virtual machine cluster was changed into maximum flow minimum cut problem. thirdly, sink and source point was added and activity node was found. Finally, activity tail-nodes were connected and cut formed for virtual machine cluster. Experimental results show that the proposed method can effectively cut virtual machine cluster and select rationally physical host for sub-cluster.

关键词： Virtual machining Minimization Cloud computing Bandwidth Hardware Virtualization Central processing Unit

来源：评论

学校读者我要写书评

暂无评论

引用

international conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Minami Suzuki Shu Li Toshiya Iiba Kosuke Takano Department of Computer and Information Sciences Kanagawa Institute of Technology Atsugi Kanagawa Japan

ISBN: (纸本)9781467394741

Many stores are introducing tools for customer self-service, such as product searches and store navigation. Using mobile devices, such as the customers' smartphones and tablets, services of this kind can be enhanced to allow a customer to obtain product and store information more quickly. In such an environment, a history of customer queries can be stored daily in a database system maintained by the store. To improve customer convenience and sales at a store, it is desirable to extract a customer's potential requests in a store by analyzing the customer's queries. In this study, we present a method of extracting a set of related items from a customer's point of view by analyzing the customer's queries in a store. From experiments using our prototype, we confirm that our proposed method can extract related-item candidates displayed on different shelves.

关键词： Data mining Cloud computing Database systems Layout Data visualization Data processing

来源：评论

学校读者我要写书评

暂无评论

Experimental Results of a Raspberry Pi Based WMN Testbed for Multiple Flows and Distributed Concurrent processing

Experimental Results of a Raspberry Pi Based WMN Testbed for...

引用

international conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Tetsuya Oda Donald Elmazi Taro Ishitaki Admir Barolli Keita Matsuo Leonard Barolli Graduate School of Engineering Fukuoka Institute of Technology (FIT) Higashi-Ku Fukuoka Japan Rr. “Dritan Hoxha” Logos University Tirana Albania Fukuoka Prefectural Fukuoka Technical High School Sawara-Ku Fukuoka Japan Department of Information and Communication Engineering Fukuoka Institute of Technology (FIT) Higashi-Ku Fukuoka Japan

ISBN: (纸本)9781467383165

Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers, because of their potential use in several fields such as collaborative computing and communications. Considering mobility of the terminals, routing is a key process for operation of WMNs. In this paper, we present the implementation of a testbed for WMNs. We analyze the performance of Optimized Link State Routing (OLSR) protocol and parallel distributed processing in an indoor scenario. For evaluation we considered hop count, delay, jitter and processing time metrics. the experimental results show that the nodes in the testbed were communicating smoothly. the processing time for node 1 is smaller than other nodes.

关键词： Ad hoc networks Routing Wireless sensor networks Wireless communication Delays Network topology

来源：评论

学校读者我要写书评

暂无评论

A Data-Oriented Method for Scheduling Dependent Tasks on High-Density Multi-GPU Systems

A Data-Oriented Method for Scheduling Dependent Tasks on Hig...

引用

IEEE international conference on High Performance Computing and Communications (HPCC)

作者： Peng Zhang Yuxiang Gao Meikang Qiu Biomedical Engineering Department Stony Brook University Stony Brook NY United States Cluster Solution Department Cray Inc. San Jose CA United States Computer Science Department Pace University New York NY United States

ISBN: (纸本)9781479989386

the rapidly-changing computer architectures, though improving the performance of computers, have been challenging the programming environments for efficiently harnessing the potential of novel architectures. In this area, though the high-density multi-GPU architecture enabled unparalleled performance advantage of dense GPUs in a single server, it has increased the difficulty for scheduling diversified and dependent tasks. We therefore propose a data-oriented method for scheduling dependent tasks for this architecture while providing its implementation. In our method, we model a parallel program as a collection of data-dependent tasks for which data dependencies are managed by an expressive matrix. Accordingly, we develop a hierarchical scheduler infrastructure for our model. In this, a top scheduler is built for querying the data-dependency matrix; three downstream schedulers for queuing computation tasks that are exclusively assigned to processor, accelerator or either; and a multitude of bottom schedulers each for providing a processing element with assigned tasks. We experiment our scheduler for examples of Strassen matrix multiplication and Cholesky matrix inversion algorithms on a computer that has 8 Tesla K40 GPUs. the results show that our method is capable of offering the efficient task parallelism while fulfilling the complex task dependencies. When advanced task-oriented schedulers have been widely designed for distributed systems, a lightweight data-driven scheduler could be an alternative and handy approach that can handle the dependent yet diversified tasks of data-intensive applications for the novel high-density multi-accelerator system.

关键词： Computer architecture Processor scheduling Computers Symmetric matrices Partitioning algorithms Runtime Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

A novel search engine-based method for discovering command and control server 15th

A novel search engine-based method for discovering command a...

引用

15th international conference on algorithms and architectures for parallel processing, ICA3PP 2015

作者： Guo, Xiaojun Cheng, Guang Pan, Wubin Dinhtu, Truong Liang, Yixin School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing211189 China School of Information Engineering Xizang Minzu University Xianyang712082 China XiZang Key Laboratory of Optical Information Processing and Visualization Technology Xizang Minzu University Xianyang712082 China

ISBN: (纸本)9783319271361

To solve the problem of getting command and control (C&C) server address covertly for malware of Botnet or advanced persistent threats, we propose a novel C&C-server address discovery scheme via search engine. this scheme is com-posed of five modules. the botmaster uses publish module to issue C&C-server IPs in diaries of several free blogs on Internet firstly. then these diaries could be indexed by search engine (SE). When the infected terminal becomes a bot, it uses keyword production module to produce search keyword and submits some or all these keywords to SEs to obtain the search engine result pages (SERPs). For items in SERPs, the bot uses filtering algorithm to remove noise items and leave valid items whose abstract contain C&C-server IPs. Lastly the bot utilizes extraction and conversion module to extract these C&C-server IPs and translates them into binary format. the experimental results show that our proposed scheme is fully able to discover and obtain C&C-server IPs via various search engines. Furthermore, if we set proper threshold value for SE, it can extract C&C-server IPs accurately and efficiently. © Springer international Publishing Switzerland 2015.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic algorithm for privacy and cost aware scheduling of data intensive workflow in cloud 1

引用

15th international conference on algorithms and architectures for parallel processing, ICA3PP 2015

作者： Chen, Congyang Liu, Jianxun Wen, Yiping Chen, Jinjun Zhou, Dong Key Laboratory of Knowledge Processing and Networked Manufacture Hunan University of Science and Technology Xiangtan411100 China College of Computer Science and Engineering Hunan University of Science and Technology Xiangtan411100 China University of Technology Sydney UltimoNSW2070 Australia

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In the context of cloud computing and big data, the data of all walks of life has been obtained conveniently. Some information of users in the business process is in need of protection with the popularity of workflow applications, which will greatly affect the scheduling of workflow. Meanwhile, the amount of data is usually very large in workflow, the data privacy protection in workflow has also become an important research problem. In this paper, in order to satisfy the requirement of data privacy protection from user and minimize the total scheduling cost in workflow scheduling, we proposed a privacy and cost aware method based on genetic algorithm for data intensive workflow applications which takes into account computation cost, data transmission cost and data storage cost in cloud to solve this problem on finding the best scheduling solution. the proposed algorithm uses the summation of upward and downward rank values for prioritizing workflow tasks, then merges it to make an optimal initial population to obtain a good solution quickly. Besides, a series of operations like selection, crossover and mutation have been used to optimize the scheduling. In the workflow task scheduling, we assign the datacenter for tasks needing privacy protection, which data of these tasks cannot be moved or copied to other datacenter. Finally, we demonstrate the potential of proposed algorithm for optimizing economic cost with user privacy protection requirement. the experimental results show that proposed algorithm can help improve the scheduling and save the time and cost by an average of 3. 6% and 15. 6% respectively. © Springer international Publishing Switzerland 2015.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Extracting Compact Sets of Features for Question Classification in Cognitive Systems: A Comparative Study

Extracting Compact Sets of Features for Question Classificat...

引用

international conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Marco Pota Angela Fuggi Massimo Esposito Giuseppe De Pietro Institute for High Performance Computing and Networking (ICAR) National Research Council of Italy (CNR) Napoli Italy Institute for High Performance Computing and Networking (ICAR) National Research Council of Italy (CNR) Naples Italy

ISBN: (纸本)9781467394741

Question Classification is one of the key tasks of Cognitive Systems based on the Question Answering paradigm. It aims at identifying the type of the possible answer for a question expressed in natural language. Machine learning techniques are typically employed for this task, and exploit a high number of features extracted from labelled questions of benchmark training sets in order to achieve good classification results. However, the high dimensionality of the feature space often limits the possibility of applying more efficient classification approaches, due to high training costs. In this work, more compact sets of lexical and syntactic features are proposed to distinguish question classes. In particular, the widely used unigrams are substituted with a smaller number of features, extracted by modifying typical Natural Language processing procedures for question analysis. the accuracy values gained on a benchmark dataset by using these different sets of features are compared among them and with the state-of-the-art, taking into account the required complexity at the same time. the new sets of extracted features show a good trade-off between accuracy and complexity.

关键词： Feature extraction Taxonomy Syntactics Aspirin Support vector machines Natural language processing Semantics

来源：评论

学校读者我要写书评

暂无评论

Accelerating text-based plagiarism detection using GPUs

Accelerating text-based plagiarism detection using GPUs

引用

international conference on Industrial and Information Systems, ICIIS

作者： MAC Jiffriya MAC Akmal Jahan Hasindu Gamaarachchi Roshan G. Ragel Post Graduate Institute of Science University of Peradeniya Peradeniya Sri Lanka Department of Computer Engineering University of Peradeniya Peradeniya Sri Lanka

Plagiarism is known as an unauthorized use of other's contents in writing and ideas in thinking without proper acknowledgment. there are several tools implemented for text-based plagiarism detection using various methods and techniques. However, these tools become inefficient while handling a large number of datasets due to the process of plagiarism detection which comprises of a lot of computational tasks and large memory requirement. therefore, when we deal with a large number of datasets, there should be a way to accelerate the process by applying acceleration techniques to optimize the plagiarism detection. In response to this, we have developed a parallel algorithm using Compute Unified Device Architecture (CUDA) and tested it on a Graphics processing Unit (GPU) platform. An equivalent algorithm is run on CPU platform as well. From the comparison of the results, CPU shows better performance when the number and the size of the documents are small. Meantime, GPU is an effective and efficient platform when handling a large number of documents and high in data size due to the increase in the amount of parallelism. It was found out that for our dataset, the performance of the algorithm on the GPU platform is approximately 6x faster than CPU. thus, introducing GPU based optimization algorithm to the plagiarism detection gives a real solution while handling a large number of data for inter-document plagiarism detection.

关键词： Acceleration Instruction sets Phased arrays Graphics processing units Kernel parallel processing Yttrium

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共281页 << < 103 104 105 106 107 108 109 110 111 112 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：