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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

GPU-PSO : parallel Particle Swarm Optimization approaches on Graphical Processing Unit for Constraint Reasoning: Case of Max-CSPs 19th

GPU-PSO : Parallel Particle Swarm Optimization approaches on...

引用

19th international conference on Knowledge Based and Intelligent Information and Engineering systems (KES)

作者： Dali, Narjess Bouamama, Sadok Univ Manouba Natl Sch Comp Sci COSMOS Lab Manouba Tunisia

Constraint Satisfaction Problems (CSPs) occur now in different domains. Several methods are used to solve them. In particular, Particle Swarm Optimization (PSO) allows to solve efficiently CSPs by significantly reducing the calculation time to explore the search space of solutions. However, this metaheuristic is excessively costing when facing large instances. In this paper we address the Maximal Constraint Satisfaction Problems (Max-CSPs). We introduce a new resolution approach that allows solving efficiently the Max-CSPs even with large instances. Our purpose is to implement a PSO based method by using the GPU architecture as a parallel computing framework. In particular, we focus on the implementation of two parallel novel approaches. the first one is a parallel GPU-PSO for Max-CSPs (GPU-PSO) and the second one is a GPU distributed PSO for Max-CSPs (GPU-DPSO). Our experimental results show the efficiency of the two proposed approaches and their ability to exploit GPU architecture. (C) 2015 the Authors. Published by Elsevier B.V.

关键词： particle swarm optimization Maximal Constraint satisfaction problems GPU-computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Load Balancing for Data-parallel Applications on Network-on-Chip enabled Multi-Processor Platform

Load Balancing for Data-Parallel Applications on Network-on-...

引用

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

作者： Yang, Jungsook Chun, Chuny Bagherzadeh, Nader Lee, Seung Eun Univ Calif Irvine Elect Engn & Comp Sci Irvine CA 92697 USA Seoul Natl Univ Technol Elect & Informat Engn Seoul South Korea

ISBN: (纸本)9780769543284

As the computation cost increases to meet the design requirements for computation-intensive applications on todays systems, the pressure to develop high performance parallel processors on a chip will increase. Network-on-Chip (NoC) techniques that interconnect multiple processing elements with routers are the solution for reducing computation time and power consumption by parallel processing on a chip. the shared communication platform is also essential to meet the scalability and complexity challenges for System-on-Chip (SoC). However not many parallel applications have been studied for such an architecture and workload characterizations have not been researched to benefit the architecture design optimization. In this paper, we study multiple data-parallel applications on a multicore NoC architecture with distributed memory space. We introduce an efficient runtime workload distribution algorithm that balances workloads of parallel processors and apply for selected embedded applications. Using our cycle accurate multicore simulator, we simulated our NoC-enabled multicore architecture model and executed data-parallel applications on various number of processing elements using the proposed runtime load balancing algorithm and analyzed performance and communication overheads.

关键词： load balancing network-on-chip parallel processing

来源：评论

学校读者我要写书评

暂无评论

Topic 8: distributed systems and Algorithms (Introduction)

Topic 8: Distributed Systems and Algorithms (Introduction)

引用

19th international conference on Euro-Par

作者： Mostefaoui, Achour Polze, Andreas Baquero, Carlos Ezhilchelvan, Paul Lundberg, Lars Université de Nantes France Hasso Plattner Institute University of Potsdam Germany INESC TEC Universidade do Minho Portugal University of Newcastle United Kingdom Blekinge Institute of Technology Karlskrona Sweden

ISBN: (纸本)9783642400476

distributed computing is becoming more and more led by technological and application advances. Many works consider new computing models compared to the classical closed model with a fixed number of participants and strong hypothesis on communication and structuration. Indeed, it is hard to imagine some application or computational activity and process that falls outside distributed computing. Internet and the web (e.g. social networks, clouds) are becoming the main application field for distributed computing. In addition to the classical challenges that developers have to face (asynchrony and failures) they have to deal with load balancing, malicious and selfish behaviors, mobility, heterogeneity and the dynamic nature of participating processes.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel architecture of median filter

Efficient parallel architecture of median filter

引用

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

作者： Medhat, R. Faheem, H.M. Khaleefa, M.E. Computer Systems Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

ISBN: (纸本)9780889868205

Many attempts have been made to optimize the median filter from the software and hardware approach. An architectural design of hardware capable of performing real-time median filtering is presented. the architecture uses the histogram approach to calculate the median, while optimizing the sliding window method to reuse all its calculations. Data is output row by row and every input pixel is processed only once. the design is independent of window size or image size, and supports adding more processing elements to support wider images. the control unit design is minimized to enable self-adjustment of plug-and-play processing elements. the architecture is implemented in VHDL and synthesized to a Virtex-2 Pro FPGA. the architecture's performance as well as operation is compared to previous work.

关键词： Electric filters

来源：评论

学校读者我要写书评

暂无评论

Reliability for network swapping systems that support migration of remotely swapped pages

Reliability for network swapping systems that support migrat...

引用

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

作者： Newhall, Tia Mitchell, Benjamin Rosse, Julian Swarthmore College Swarthmore PA United States

Network swapping systems allow individual cluster nodes with over-committed memory to use the idle memory of remote nodes as their backing store, and to swap their pages over the network. As the number of nodes in a cluster increases, it becomes more likely that a node will fail or become unreachable, making it important that such a system provide reliability support. Without reliability, a single node crash can affect programs running on other cluster nodes by losing remotely swapped page data that was stored on the crashed node. Our network swapping system, Nswap, has design features that complicate reliability: swapped pages can migrate from one node to another in response to changes in a node's local memory needs. As a result, reliability schemes that rely on fixed placement of page and reliability data are not applicable to our system. Our reliability solutions solve the unique challenge of providing reliability to network swapping systems that both support dynamic changes to the size of remote RAM swap space and support migration of remotely swapped page data. Results show that even though our Mirroring reliability scheme adds time and space overhead to Nswap, it still outperforms swapping to disk by a factor of up to 8.2. Our dynamic Parity scheme will provide reliability with minimal time and space overhead.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient update of ghost regions using active messages

Efficient update of ghost regions using active messages

引用

19th international conference on High Performance computing (HiPC)

作者： Milthorpe, Josh Rendell, Alistair P. Australian Natl Univ Res Sch Comp Sci Canberra ACT Australia

ISBN: (纸本)9781467323703;9781467323727

the use of ghost regions is a common feature of many distributed grid applications. A ghost region holds local read-only copies of remotely-held boundary data which are exchanged and cached many times over the course of a computation. X10 is a modern parallel programming language intended to support productive development of distributed applications. X10 supports the "active message" paradigm, which combines data transfer and computation in one-sided communications. A central feature of X10 is the distributed array, which distributes array data across multiple places, providing standard read and write operations as well as powerful high-level operations. We used active messages to implement ghost region updates for X10 distributed arrays using two different update algorithms. Our implementation exploits multiple levels of parallelism and avoids global synchronization;it also supports split-phase ghost updates, which allows for overlapping computation and communication. We compare the performance of these algorithms on two platforms: an Intel x86-64 cluster over QDR InfiniBand, and a Blue Gene/P system, using both stand-alone benchmarks and an example computational chemistry application code. Our results suggest that on a dynamically threaded architecture, a ghost region update using only pairwise synchronization exhibits superior scaling to an update that uses global collective synchronization.

关键词： parallel programming models Partitioned Global Address Space (PGAS) X10 language active messages structured grids distributed arrays ghost regions lattice Boltzmann method Smooth Particle Mesh Ewald method

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：