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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

检索条件"任意字段=18th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 660 条记录，以下是311-320 订阅

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

详细简洁

排序：

parallel implementation of local similarity search for unstructured text using prefix filtering 18

Parallel implementation of local similarity search for unstr...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2017

作者： Agrawal, Manu Manchanda, Kartik Soni, Ribhav Lal, Anurag Chowdary, Ravindranath Varanasi221005 India

ISBN: (纸本)9781538631515

Identifying partially duplicated text segments among documents is an important research problem with applications in plagiarism detection and near-duplicate web page detection. We investigate the problem of local similarity search for finding partially replicated text, focusing on its parallel implementation. Our aim is to find text windows that are approximately similar in two documents, using a filter verification framework. We present various parallel approaches to the problem, of which input data partitioning along with the reduction of individual index maps was found to be most suitable. We analyzed the effect of varying similarity threshold and number of processes on speedup, and also performed cost analysis. Experimental results show that the proposed method achieves up to 13x speedup on a 24-core processor. © 2017 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

An adaptive multi-agent approach for distributed alarm correlation and fault identification

An adaptive multi-agent approach for distributed alarm corre...

引用

9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Mohamed, Abduljalil A. Basir, Otman Department of Systems Design Engineering University of Waterloo Waterloo ON Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada

ISBN: (纸本)9780889868205

Network fault management systems rely heavily on observed alarms to identify the root causes of network failures. Due to the increasing complexity of modern computer networks, the information carried by these alarms may in fact be vague, imprecise, and inconsistent. thus, these alarms often possess different diagnostic capabilities and should not be treated equally. In this paper, we propose a new distributed alarm correlation approach that effectively tackles the aforementioned data deficiencies. According to the proposed approach, the managed network is first divided into a disjoint set of management domains and each domain is assigned an intelligent agent. Within the framework of Dempster-Shafer evidence theory, the intelligent agent perceives each network entity in its domain as a source of information. As such, alarms emitted by these entities are expected to exhibit different information qualities and are assigned different weights accordingly. Based on their weights, the observed alarms are then correlated by their respective agent into a single local fuzzy composite alarm. Since local composite alarms constitute only partial views of the managed network, they are correlated, by a higher management entity, into a global alarm that accurately reflects a comprehensive view of the managed network.

关键词： Alarm systems

来源：评论

学校读者我要写书评

暂无评论

A GPU-based fast solution for Riesz space fractional reaction-diffusion equation 18

A GPU-based fast solution for Riesz space fractional reactio...

引用

18th international conference on Network-Based Information systems (NBiS)

作者： Wang, Qinglin Liu, Jie Gong, Chunye Zhang, Yang Xing, Zuocheng Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China Sci & Technol Space Phys Lab Beijing 10076 Peoples R China Natl Univ Def Technol Coll Aerosp Sci & Engn Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781479999422

the fast numerical solutions of Riesz fractional equation have computational cost of O(NMlogM), where M, N are the number of grid points and time steps. In this paper, we present a GPU-based fast solution for Riesz space fractional equation. the GPU-based fast solution, which is based on the fast method using FFT and implemented with CUDA programming model, consists of parallel FFT, vector vector addition and vector-vector multiplication on GPU. the experimental results show that the GPU-based fast solution compares well with the exact solution. Compared to the known parallel fast solution on 8-core Intel E5-2670 CPU, the overall performance speedup on NVIDIA GTX650 GPU reaches 2.12 times and that on NVIDIA K20C GPU achieves 10.93 times.

关键词： parallel computing GPU fractional differential equation FFT fast solution

来源：评论

学校读者我要写书评

暂无评论

Topic 5: parallel and distributed Data Management

引用

18th international conference on Euro-Par parallel Processing

作者： Talia, Domenico Delis, Alex Dutta, Haimonti Zaslavsky, Arkady Topic Committee United States

ISBN: (纸本)9783642328206

the ever-increasing data volumes used to empower contemporary data-intensive applications as well as aggregations of computing systems call for novel approaches and efficient techniques in the management of geographically dispersed data. Despite recent advances, Internet-scale requirements for both applications and underlying systems require effective provisioning, staging,manipulation, continuous maintenance and monitoring of data hosted in multiple, pre-existing autonomous, distributed and often heterogeneous systems. Evidently, the notions of parallelism and concurrent execution at all levels remain key elements in attaining scalability and effective management for nearly-all modern data-intensive applications. Moreover, as underlying computing environments get transformed through the introduction of novel infrastructures, enhanced capacities and extended functionalities, new solutions are sought to cope with these changes.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Estimation of Maximum Allowable Time-Delay Bound for System Stability of Network Controlled parallel DC/DC Buck Converters

Estimation of Maximum Allowable Time-Delay Bound for System ...

引用

18th international conference on Automation and computing (ICAC) - Integration of Design and Engineering

作者： Khalil, Ashraf Wang, Jihong Univ Birmingham Sch Elect Elect & Comp Engn Birmingham W Midlands England Univ Warwick Sch Engn Coventry W Midlands England

ISBN: (纸本)9781908549006

the current trend in distributed energy system control is moving toward implementing quasi-decentralized control strategy where the control signals are exchanged over shared dedicated control or communication networks which reduces the complexity in the wiring and enhances the reliability. Transmitting control signals through shared networks induces time delays and data losses which may destabilize the system. So it is important to identify what the maximum allowable delay bound (MADB) can be tolerant with respect to system stability. the paper proposes a new method for estimating the allowable time delay under which the system stability can be maintained. the proposed method is originated from analyzing the network controlled parallel DC/DC Buck converters. the influences of the system parameters and controllers on the boundary of the MADB are studied. Simulation using Matlab SimPowerSystem Toolbox is performed to verify the stability bound determined by the MADB. the results are compared with the methods previously reported in the literature and the new method is proved to be simpler in estimation procedures and easier in applications to practical systems.

关键词： networked control system time delay maximum allowable delay bound parallel DC/DC Buck converters stability

来源：评论

学校读者我要写书评

暂无评论

Cross entropy based module allocation for distributed systems

Cross entropy based module allocation for distributed system...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Widell, Niklas Nyberg, Christian Department of Communication Systems Lund University Box 118 SE-22100 Lund Sweden

In the module allocation problem a collection of software modules are to be assigned to physical processing nodes, subject to execution and communication cost. the cost of an allocation is a function of the execution costs and the communication costs for any pair of modules allocated to distinct processors. the module allocation problem has been well studied and is known to be NP-complete except for certain communication configurations. To solve the problem, several heuristics have been proposed. this paper discusses an alternative approach to solving the module allocation problem by applying a stochastic optimization method called the Cross Entropy (CE) Method. the CE Method is a state-of-the-art stochastic method for solving combinatorial and multi-extremal continuous optimization problems. the CE method uses a distribution with parameter v to generate sample allocation. the generated samples are then used to update v according to sample quality. this process is repeated until the distribution converges to a possibly optimal allocation. the results in this paper indicate that the CE method can successfully be applied to the module allocation problem and efficiently generate high quality solutions. Also, the CE method allows the use of non-standard objective functions that are used to find allocations that have multiple conflicting objectives.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Energy-Efficient Sorting on a Many-Core Processor Array

Fine-Grained Energy-Efficient Sorting on a Many-Core Process...

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Stillmaker, Aaron Stillmaker, Lucas Baas, Bevan Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

ISBN: (纸本)9781467345651;9780769549033

Data centers require significant and growing amounts of power to operate, and with increasing numbers of data centers worldwide, power consumption for enterprise workloads is a significant concern. Sorting is a key computational kernel in large database systems, and the development of energy efficient sorting capabilities would therefore significantly reduce data center power usage. We propose highly parallel sorting algorithms and mappings using a modular design for a fine-grained many-core system that greatly decreases the amount of energy consumed to perform sorts of arbitrarily large data sets. the memory, computational, and nearest-neighbor inter-processor communication hardware of the many-core processor array require relatively small die area. We present the design and implementation of several sorting variants that perform the first phase of an external sort. they are built using program kernels operating on independent processors in a many-core array with 256 bytes of data memory and fewer than 128 instructions per processor. the algorithms employed are simple and the vast majority of processors contain identical programs. Compared to a quicksort implementation on an Intel Core 2 Duo T9600 the highest throughput design achieves up to 27x higher throughput per chip area, and the most energy efficient sort yields a 330x reduction in energy dissipated per sorted block. Compared to a radix sort implementation on a GPU, the highest throughput design achieves up to 22x higher throughput per chip area, and the most energy efficient sort yields a 750x reduction in energy dissipated per sorted block.

关键词： parallel processing external sorting streaming sorting fine-grained many-core processor array modular programing

来源：评论

学校读者我要写书评

暂无评论

Transactional memory execution for parallel multithread programming without lock

Transactional memory execution for parallel multithread prog...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

作者： Xiaoqi, Yang Qilong, Zheng Guoliang, Chen Shujuan, Liu Jun, Luan National High Performance Computing Center at Hefei Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China

ISBN: (纸本)0769530494

With the increasing popularity of shared-memory programming model, especially at the advent of multicore processors, applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Traditionally locks are used to enforce data dependence and timing constraints between the various threads. However locks are errorprone, and often leading to unwanted race conditions, priority inversion, or deadlock. therefore, recent waves of research projects are exploring transaction memory systems as an alternative synchronization mechanism to locks. this paper presents a software transactional memory execution model for parallel multithread programming without lock. © 2007 IEEE.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

parallel Processing - 18th international conference, Euro-Par 2012, Proceedings

引用

18th international conference on parallel Processing, Euro-Par 2012

ISBN: (纸本)9783642328190

the proceedings contain 76 papers. the topics discussed include: selfish distributed optimization;tulipse: a visualization framework for user-guided parallelization;pattern-independent detection of manual collectives in MPI programs;a type-based approach to separating protocol from application logic: a case study in hybrid computer programming;energy consumption modeling for hybrid computing;HPC file systems in wide area networks: understanding the performance of luster over wan;understanding I/O performance using I/O skeletal applications;CRAW/P: a workload partition method for the efficient parallel simulation of manycores;job scheduling using successive linear programming approximations of a sparse model;speed scaling on parallel processors with migration;dynamic distributed scheduling algorithm for state space search;and using load information in work-stealing on distributed systems with non-uniform communication latencies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Welcome Message from the conference Chair - PDCS 2006

Proceedings of the IASTED International Conference on Parall...

引用

Proceedings of the iasted international conference on parallel and distributed computing and systems 2006年

作者： Zheng, S.Q.

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：