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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

548 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

542 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

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

共 564 条记录，以下是271-280 订阅

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

详细简洁

排序：

Functionally distributed Control Architecture for Robot systems 19

Functionally Distributed Control Architecture for Robot Syst...

引用

19th international conference on Computers and their Applications, CATA 2004

作者： Taira, Tetsuya Yamasaki, Nobuyuki School of Science for Open and Environmental Systems Keio University Kanagawa Yokohama223-8522 Japan

ISBN: (纸本)9781618395511

this paper describes the design and implementation of functionally distributed control architecture for real-time control of robot systems. Robot systems must control several functions in parallel for decision, action, and recognition. In order to fulfill this requirement, we propose the architecture based on parallel/distributed control. the robot system based on this architecture is designed as a parallel/distributed computer, in which each module has different I/O peripherals and executes functionally distributed and coarse-grained tasks in real-time, cooperating with each other. We also evaluate the efficiency of the proposed architecture through the experience in implementing a prototype robot. Copyright © (2004) by the international Society for Computers and their Applications. All rights reserved.

关键词： Real time control

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous distributed parallel programming for coordination in software development

Heterogeneous distributed parallel programming for coordinat...

引用

19th international conference on Advanced Information Networking and Applications, AINA 2005

作者： Chiang, Chia-Chu Department of Computer Science University of Arkansas at Little Rock 2801 South University Ave. Little Rock AR 72204-1099 United States

ISBN: (纸本)0769522491

We are presenting a formal specification-based approach to heterogeneous distributed parallel programming. A specification language is used to describe system behaviors. the specification is then analyzed to create a multiparty interaction interface description describing the properties of the multiparty interactions among processes. Our language mapping approach allows a multiparty interaction interface description automatically created in any target programming language. Developers can then write a program in the target language to include the description for execution. A familiar programming model will be provided to support implicit communication, concurrency, synchronization, and parallelism in systems through an implicit coordination-oriented approach. In other words, developers do not have to explicitly express communication, concurrency, synchronization, and parallelism when they are developing heterogeneous distributed and parallel systems. © 2005 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive and Cost-Optimal parallel Algorithm for the 0-1 Knapsack Problem

Adaptive and Cost-Optimal Parallel Algorithm for the 0-1 Kna...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Li, Kenli Li, Lingxiao Tesfazghi, Teklay Sha, Edwin Hsing-Mean Hunan Univ Coll Comp & Commun Changsha 410082 Hunan Peoples R China Univ Asmara Asmera Eritrea Univ Texas Dallas Dept Comp Sci Dallas TX USA

ISBN: (纸本)9780769543284

the 0-1 knapsack problem is well known to be NP-complete problem. In the past two decades, much effort has been done in order to find techniques that could lead to algorithms with a reasonable running time. this paper proposes a new parallel algorithm for the 0-1 knapsack problem where the optimal merging algorithm is adopted. Based on an EREW PRAM machine with shared memory, the proposed algorithm utilizes O((2(n/4))(1-epsilon)) processors, 0 <= epsilon <= 1, and O(2(n/2)) memory to find a solution for the n-element 0-1 knapsack problem in time O(2(n/4)(2(n/4))(epsilon)). thus the cost of the proposed parallel algorithm is O(2(n/2)), which is both the lowest upper-bound time and without memory conflicts if only quantity of objects is considered in the complexity analysis for the 0-1 knapsack problem. thus it is an improvement result over the past researches.

关键词： parallel computing combinatorial optimization 0-1 knapsack problem divide and conquer EREW PRAM

来源：评论

学校读者我要写书评

暂无评论

Towards Scaling parallel Seismic Raytracing 19

Towards Scaling Parallel Seismic Raytracing

引用

19th IEEE international conference on Computational Science and Engineering, 14th IEEE international conference on Embedded and Ubiquitous computing and 15th international Symposium on distributed computing and Applications to Business, Engineering and Science, CSE-EUC-DCABES 2016

作者： Malony, Allen D. Monil, Mohammad Alaul Haque Rasmusen, Craig Huck, Kevin Byrnes, Joseph Toomey, Doug Department of Computer and Information Science University of Oregon EugeneOR97403 United States Department of Physics Performance Research Laboratory University of Oregon EugeneOR97403 United States Department of Geological Sciences University of Oregon EugeneOR97403 United States

ISBN: (纸本)9781509035939

Marine geologists use seismic tomography techniques to determine the 3D geophysical structure of the ocean floor. At the heart of seismic tomography methods is a forward solver used to compute minimum travel times from all locations in a earth model to sensors used in seismic experiments. the Stingray seismic raytracer was originally based on an adaption of Dijkstra's single-source shortest-path algorithm. Unfortunately, the algorithm's inherent sequential nature limits its scalability. Our new parallel Stingray implementations are based on an iterative data parallel algorithm and demonstrates scalable performance in both time and problem size. Results are presented for OpenMP and MPI experiments on seismic models of significantly larger size than Stingray has processed before. © 2016 IEEE.

关键词： Seismology

来源：评论

学校读者我要写书评

暂无评论

Dynamic I/O Reconfiguration for a NFS-based parallel File System

Dynamic I/O Reconfiguration for a NFS-based Parallel File Sy...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Kassick, Rodrigo Boito, Francieli Zanon Navaux, Philippe O. A. Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil

ISBN: (纸本)9780769543284

the large gap between the speed in which data can be processed and the performance of I/O devices makes the shared storage infrastructure of a cluster a great bottleneck. parallel File systems try to smooth such difference by distributing data onto several servers, increasing the system's available bandwidth. However, most implementations use a fixed number of I/O servers, defined during the initialization of the system, and can not add new resources without a complete redistribution of the existing data. With the execution of different applications at the same time, the concurrent access to these resources can aggravate the existing bottleneck, making very hard to define an initial number of servers that satisfies the performance requirements of different applications. this paper presents a reconfiguration mechanism for the dNFSp file system that uses on-line monitoring of application's I/O behavior to detect performance contention and dedicate more I/O resources to applications with higher demands. these extra resources are taken from the available nodes of the cluster, using their I/O devices as a temporary storage. We show that this strategy is capable of increasing the I/O performance in up to 200% for access patterns with short I/O phases and 47% for longer I/O phases.

关键词： distributed File systems parallel I/O File systems IO Servers large clearance ON-LINE MONITORS scratch memory

来源：评论

学校读者我要写书评

暂无评论

CPUs Energy Consumption Reduction for Asynchronous parallel Methods Running over Grids 19

CPUs Energy Consumption Reduction for Asynchronous Parallel ...

引用

作者： Fanfakh, Ahmed Charr, Jean-Claude Couturier, Raphaël Giersch, Arnaud FEMTO-ST Institute University of Franche-Comte IUT de Belfort-Montbeliard 19 avenue du Marechal Juin BP 527 Belfort Cedex90016 France

ISBN: (纸本)9781509035939

this paper presents a new online frequency selecting algorithm for asynchronous parallel methods running over grids. It selects a vector of frequencies that gives the best tradeoff between energy consumption and performance. It also has a very small overhead and works without training and profiling. New energy and performance models are used in this algorithm to predict the execution time and the energy consumption of synchronous, asynchronous and hybrid iterative applications running over grids. the algorithm was evaluated on the Grid'5000 testbed while running a multi-splitting application that solves a 3D problem. the experiments show that applying synchronously the proposed frequency scaling algorithm to the asynchronous version of the application reduces its energy consumption up to 26.93% and speeds it up by 21.48%. Finally, the algorithm was compared to the Energy and Delay Product (EDP) method and it outperformed the latter in the energy reduction and performance trade-off for parallel asynchronous iterative methods. © 2016 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Credibility Enhanced Reputation Mechanism for distributed e-Communities

Credibility Enhanced Reputation Mechanism for Distributed e-...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Koutrouli, Eleni Tsalgatidou, Aphrodite Univ Athens Dept Informat & Telecommun Athens 15784 Greece

ISBN: (纸本)9780769543284

P2P communities are online communities of entities which offer services to each other without a central administration. Community members that need a specific service have to choose the transaction partner which they believe that will provide them with a required service of the expected quality;thus, they need mechanisms to support trust decisions regarding who they will transact with. P2P reputation systems provide trust mechanisms for P2P communities. Due to their decentralized and social nature, they are vulnerable to various types of attacks which distort their credibility and effectiveness. In our paper we first identify the credibility factors of a P2P reputation system. then we describe a dynamic reputation mechanism for P2P communities, which integrates some of these credibility factors and which can be used as part of a comprehensive reputation system enhancing its robustness against some types of attacks. Simulation results show the effectiveness of our mechanism in relation to other reputation mechanisms which do not integrate such factors.

关键词： component P2P reputation systems reputation attacks reputation metric e-community credibility P2P systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Development of Efficient Role-based Sensor Network Applications with Excel Spreadsheets

Development of Efficient Role-based Sensor Network Applicati...

引用

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

作者： Boelmann, Christopher Weis, Torben Univ Duisburg Essen Distributed Syst Grp Duisburg Germany

ISBN: (纸本)9781479920815

Natural scientists use large scale sensor networks for gathering and analyzing environmental data. However, the implementation work requires expert programmers. the problem is complicated by limited battery lifetime, processing power and memory capacity of the nodes, because this requires a low-level programming language. Since scientists are used to analyzing data with spreadsheets, researchers have studied the possibility of applying spreadsheet-based programming to sensor networks. the approaches so far either require a central server to execute the spreadsheet, or they execute a spreadsheet run-time on each node. the first approach causes higher communication cost since all data has to be routed to the central server and the second one causes computational overhead, because evaluating a spreadsheet is slower than executing handcrafted NesC-code. Hence, we present a spreadsheet driven tool-chain that can create efficient NesC-code and allows for simulation in the spreadsheet itself. the nodes have to recompute the spreadsheet formulas upon new data. However, we can avoid a large fraction of this recomputation by applying several optimization strategies during code generation. In our example scenario, sensor nodes compute the variance across a series of sensor readings. We can show that the optimizations save 65% CPU cycles and the code size decreases by 12% when compared to non-optimized execution of the spreadsheet. thus, our approach can deliver an easy way of developing sensor network programs while yielding very efficient code.

关键词： Spreadsheet Programming Designing Sensor Networks Computation Optimization

来源：评论

学校读者我要写书评

暂无评论

In-Memory parallel computing for Partial Wave Analysis 19

In-Memory Parallel Computing for Partial Wave Analysis

引用

19th international Workshop on Advanced computing and Analysis Techniques in Physics Research (ACAT)

作者： Wei, Zhanchen Huang, Qiulan Sun, Gongxing Liu, Xiaoyu Inst High Energy Phys 19B Yuquan Rd Beijing 100049 Peoples R China Univ Chinese Acad Sci 19A Yuquan Rd Beijing 100049 Peoples R China

the traditional partial wave analysis (PWA) algorithm is designed to process data serially which requires a large amount of memory that may exceed the memory capacity of one single node to store runtime data. It is quite necessary to parallelize this algorithm in a distributed data computing framework to improve its performance. Within an existing production-level Hadoop cluster, we implement PWA algorithm on top of Spark to process data storing on low-level storage system HDFS. But in this case, sharing data through HDFS or internal data communication mechanism of Spark is extremely inefficient. In order to solve this problem, this paper presents an in-memory parallel computing method for PWA algorithm. With this system, we can easily share runtime data in parallel algorithms. We can ensure complete data locality to keep compatibility with the traditional data input/output way and cache most repeatedly used data in memory to improve the performance, owe to the data management mechanism of Alluxio.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：