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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

39 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

32 篇 工学
- 29 篇 计算机科学与技术...
- 25 篇 软件工程
- 3 篇 电气工程
- 3 篇 信息与通信工程
- 2 篇 电子科学与技术（可...
- 1 篇 力学（可授工学、理...
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 控制科学与工程
- 1 篇 水利工程
- 1 篇 农业工程
9 篇 理学
- 8 篇 数学
- 1 篇 物理学
- 1 篇 生物学
5 篇 管理学
- 5 篇 工商管理
- 4 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

4 篇 parallel process...
3 篇 high performance...
3 篇 gpu
2 篇 parallel program...
2 篇 next generation ...
2 篇 scheduling
1 篇 object oriented ...
1 篇 biology computin...
1 篇 parallel algorit...
1 篇 snp
1 篇 information syst...
1 篇 parallelism
1 篇 graph algorithms
1 篇 gromacs
1 篇 programming
1 篇 gpgpu
1 篇 performance opti...
1 篇 phylogeny
1 篇 energy-aware com...
1 篇 hash distributed...

机构

2 篇 hong kong baptis...
1 篇 univ mons dept c...
1 篇 university of he...
1 篇 univ vienna fac ...
1 篇 aalto university...
1 篇 advanced institu...
1 篇 school of iot en...
1 篇 department of co...
1 篇 univ warsaw inte...
1 篇 texas tech univ ...
1 篇 guangdong key la...
1 篇 cardinal stefan ...
1 篇 department of co...
1 篇 esw inesc-id lis...
1 篇 guangdong prov k...
1 篇 technische unive...
1 篇 univ sci & techn...
1 篇 university of al...
1 篇 univ maryland ct...
1 篇 shanghai key lab...

作者

2 篇 guo jianxiong
2 篇 han chin-chuan
1 篇 francisco diaz a...
1 篇 dokulil jiri
1 篇 zhan yanghao
1 篇 garcia ana-barba...
1 篇 ayres daniel l.
1 篇 ortega julio
1 篇 ito yasuaki
1 篇 horng shi-jinn
1 篇 fan wentao
1 篇 santander-jimene...
1 篇 guo yongde
1 篇 bala piotr
1 篇 fryza tomas
1 篇 yan jun
1 篇 seredyński franc...
1 篇 chang yang-lang
1 篇 zhai ruirui
1 篇 zeng gailun

语言

41 篇 英文

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

共 41 条记录，以下是31-40 订阅

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

详细简洁

排序：

algorithms and architectures for parallel processing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Shadi Ibrahim Kim-Kwang Raymond Choo Zheng Yan Witold Pedrycz

ISBN: (数字)9783319654829

ISBN: (纸本)9783319654812

this book constitutes the proceedings of the 17th international conference on algorithms and architectures for parallel processing, ica3pp 2017, held in Helsinki, Finland, in August 2017.;the 25 full papers presented were carefully reviewed and selected from 117 submissions. they cover topics such as parallel and distributed architectures; software systems and programming models; distributed and network-based computing; big data and its applications; parallel and distributed algorithms; applications of parallel and distributed computing; service dependability and security in distributed and parallel systems; service dependability and security in distributed and parallel systems; performance modeling and evaluation.;this volume also includes 41 papers of four workshops, namely: the 4th international Workshop on Data, Text, Web, and Social Network Mining (DTWSM 2017), the 5th international Workshop on parallelism in Bioinformatics (PBio 2017);, the First international Workshop on Distributed Autonomous Computing in Smart City (DACSC 2017), and the Second international Workshop on Ultrascale Computing for Early Researchers (UCER 2017).

关键词： Algorithm Analysis and Problem Complexity Software Engineering Computer Communication Networks Information Systems Applications (incl. Internet)

来源：评论

学校读者我要写书评

暂无评论

Demand-based scheduling priorities for performance optimisation of stream programs on parallel platforms

Demand-based scheduling priorities for performance optimisat...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Nguyen, Vu thien Nga Kirner, Raimund University of Hertfordshire United Kingdom

ISBN: (纸本)9783319038582

this paper introduces a heuristic-based scheduler to optimise the throughput and latency of stream programs with dynamic network structure. the novelty is the utilisation of positive and negative demands of the streamcommunications. It is a centralised approach to provide load balancing for stream programs with dynamic network structures. the approach is designed for shared-memory multi-core platforms. the experiments show that our scheduler performs significantly better than the reference implementation without demand considerations. © Springer international Publishing Switzerland 2013.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Multi-objective parallel machines scheduling for fault-tolerant cloud systems

Multi-objective parallel machines scheduling for fault-toler...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Gasior, Jakub Seredyński, Franciszek Systems Research Institute Polish Academy of Sciences Warsaw Poland Cardinal Stefan Wyszynski University Warsaw Poland

ISBN: (纸本)9783319038582

We present in this paper a security-driven solution for scheduling of N independent jobs on M parallel machines that minimizes three different objectives simultaneously, namely the failure probability, the total completion time of the jobs and their respective tardiness. As this problem is NP-hard in the strong sense, a meta-heuristic method NSGA-II is proposed to solve it. this approach is based on the Pareto dominance relationship, providing no single optimal solution, but a set of solutions which are not dominated by each other. thus, it was necessary to provide decision-making mechanisms selecting the best strategy from the Pareto frontier. the performance of the presented model and the applied GA is verified by a number of numerical experiments. the related results show the effectiveness of the proposed model and GA for small and mediumsized scheduling problems. © Springer international Publishing Switzerland 2013.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A parallel distributed system for gene expression profiling based on clustering ensemble and distributed optimization

A parallel distributed system for gene expression profiling ...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Benmounah, Zakaria Batouche, Mohamed Computer Science Department College of NTIC Constantine University 2 25000 Constantin Algeria

ISBN: (纸本)9783319038582

With the development of microarray technology, it is possible now to study and measure the expression profiles of thousands of genes simultaneously which can lead to identify subgroup of specific disease or extract hidden relationships between genes. One computational method often used to this end is clustering. In this paper, we propose a parallel distributed system for gene expression profiling (PDS-GEF) which provides a useful basis for individualized treatment of a certain disease such as Cancer. the proposed approach is based on two major techniques: the GIM (Generalized Island Model) and clustering ensemble. GIMs are used to generate good quality clusterings which are refined by a consensus function to get a high quality clustering. PDS-GEF system is implemented using Matlab®'s PCT (parallel Computing Toolbox™) which runs on a desktop computer, and tested on 34 different publicly available gene expression data sets. the obtained results compete with and even outperform existing methods. © Springer international Publishing Switzerland 2013.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Layer-based scheduling of parallel tasks for heterogeneous cluster platforms

Layer-based scheduling of parallel tasks for heterogeneous c...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Dümmler, Jörg Rünger, Gudula Technische Universität Chemnitz Department of Computer Science 09107 Chemnitz Germany

ISBN: (纸本)9783319038582

the programming model of parallel tasks is a suitable programming abstraction for parallel applications running on heterogeneous clusters, which are clusters composed of multiple subclusters. In this model, an application is decomposed into parallel tasks, each of which can be executed on an arbitrary number of processors. the advantage of this programming approach is that each task only needs to be implemented for a homogeneous environment while the complete application can still benefit fromthe entire performance of the heterogeneous cluster by a concurrent execution of independent parallel tasks on different subclusters. the execution of such an application on a specific platform is controlled by a schedule that maps each parallel task onto a set of processors. In this article, we propose an algorithm for the scheduling of parallel tasks with precedence constraints on heterogeneous clusters. this algorithm is an extension of a layer-based scheduling approach for homogeneous platforms with an additional phase that assigns the parallel tasks to appropriate subclusters. three different versions of this additional phase are considered. An experimental evaluation, based on simulation results as well as on measurements with different application benchmarks, shows that the proposed scheduling approach outperforms existing scheduling algorithms in most situations. © Springer international Publishing Switzerland 2013.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Sequential and parallelized FPGA implementation of spectrum sensing detector based on Kolmogorov-Smirnov test

Sequential and parallelized FPGA implementation of spectrum ...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Marsalek, Roman Pospisil, Martin Fryza, Tomas Simandl, Martin Department of Radio Electronics Brno University of Technology Czech Republic Technicka 12 Brno Czech Republic TESLA A.s. Podebradska 56/186 Prague 9 - Hloubetin Czech Republic

ISBN: (纸本)9783319038582

this paper deals with the implementation of the spectrum sensing detector based on the Kolmogorov-Smirnov (K-S) statistical test in the FPGA-based software defined radio system. After a brief introduction and the literature survey on the similar up-to-date implementation works, the principle of K-S test is briefly reviewed. the core of the paper describes the principles of two different algorithm implementations in the Xilinx Spartan-3A DSP device. First implementation is straightforward sequential solution, with low requirements on FPGA resources. Afterwards a new parallel solution with simpler structure and faster sensing time is presented. Both approaches have been verified using both the behavioral and the post place and route simulation. the integration of the detector into the complete target software defined radio transceiver - Universal Software Radio Peripheral (USRP N200) is also briefly discussed at the end of the paper. © Springer international Publishing Switzerland 2013.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

On routing algorithms for the DPillar data centre networks 15th

On routing algorithms for the DPillar data centre networks

引用

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

作者： Kiasari, Abbas Eslami Navaridas, Javier Stewart, Iain A. School of Computer Science University of Manchester Oxford Road ManchesterM13 9PL United Kingdom Science Laboratories School of Engineering and Computing Sciences Durham University South Road DurhamDH1 3LE United Kingdom

ISBN: (纸本)9783319271392

the DPillar data centre networks were introduced as an attractive topology for server-centric data centre networks and have recently received considerable attention. In this paper, we first derive analytically, and validate experimentally, the average hop count and the aggregate bottleneck throughput of the DPillar networks with a focus on single-path routing algorithms and the all-to-all traffic pattern. We use these models to explore the design space of the DPillar networks as a case study. In addition, we discuss the limitations of the original routing algorithms, showing that they do not benefit from the rich connectivity provided by the DPillar network and consequently do not tolerate link failures very well. To overcome these limitations we propose a collection of routing algorithms which keep the simplicity of the original but enable a more effective utilisation of the network. We empirically evaluate our proposed routing algorithms and we find that they outperform the original algorithms as regards network throughput (∼ 2x), average hop count (∼ 5% − 10%), load balance and fault tolerance. © Springer international Publishing Switzerland 2015.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Character of graph analysis workloads and recommended solutions on future parallel systems

Character of graph analysis workloads and recommended soluti...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Tanabe, Noboru Tomimori, Sonoko Takata, Masami Joe, Kazuki Toshiba Research and Development Center Kawasaki Kanagawa 212-8582 Japan Nara Women's University Nara Nara 630-8506 Japan

ISBN: (纸本)9783319038582

Graph500 is a benchmark suite for big data analysis. Matrices used for Graph500 inherit the properties of graph analysis such as breadth first search for SNS and PageRank for web searching engine. Especially power saving is very important for its execution on future massively parallel processors and clouds. the spatial locality of sparse matrices used for Graph500 and its behaviors on cache memory are investigated. the experimental results show the spatial locality of sparse matrices used for Graph500 is very low. It is very difficult to solve the problem by just software approach because of the huge size and the randomness of their accesses. therefore, we recommend hardwired scatter/gather functions at memory side. they improve the processing speed in an order of magnitude. For achieving both of low power and high throughput of random access, we recommend implementing hardwired scatter/gather functions on logic-base in Hybrid Memory Cube (HMC). We also describe brief considerations of the power saving in the case of low cache hit rate application such as graph500. For example, when the hit rate is 15%, the power saving ratio of memory access is about 30-fold. © Springer international Publishing Switzerland 2013.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of dense optical flow computation on many-core processor 1

引用

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

作者： Chen, Wenjie Yu, Jin Zhang, Weihua Jiang, Linhua Zhang, Guanhua Chai, Zhilei MoE Engineering Research Center for Software/Hardware Co-design Technology and Application East China Normal University Shanghai200061 China School of IoT Engineering Jiangnan University Wuxi214122 China Parallel Processing Institute Fudan University Shanghai200433 China Shanghai Key Lab of Modern Optical Systems University of Shanghai for Science and Technology Shanghai200093 China

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

Computation of optical flow is a fundamental step in computer vision applications. However, due to its high complexity, it is difficult to compute a high-accuracy optical flow field in real time. this paper proposes a parallel computing approach for fast computation of high-accuracy optical flow field. It is specially designed for Tilera, a typical many-core processor with 36 tiles. By efficiently exploiting the advantages of the mesh architecture of Tilera, and by appropriately handling the parallelism inherent in the optical flow computation, the proposed implemention is able to significantly reduce the computation time while keep a low power consumption. Experiment shows that, for a 640×480 image, the computation time is only 0. 80 seconds per frame. It is 2. 56 times faster than on a typical CPU i3-3240 (3. 4GHz), and the power consumption as less as 1/6. Experimental results also show that the proposed parallel approach is highly scalable for variable requirements on computation speeds and power consumptions, since it can flexibly selects a proper number of computing cores. © Springer international Publishing Switzerland 2015.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An agent-based framework for simulating and analysing attacks on cyber physical systems 15th

An agent-based framework for simulating and analysing attack...

引用

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

作者： Adepu, Sridhar Mathur, Aditya Gunda, Jagadeesh Djokic, Sasa Singapore University of Technology and Design Singapore City487372 Singapore Institute for Energy Systems University of Edinburgh EdinburghEH9 3JL United Kingdom

ISBN: (纸本)9783319271361

An agent-based framework is presented to model and analyze physical and cyber attacks on Cyber Physical Systems (CPS). In the first phase of a two phase procedure in the framework, a CPS is modelled using State Condition Graphs (SCGs) representing the structural relations among the cyber and physical components. In the second phase, SCGs are partitioned into separate groups, referred to as agents, based on their functional dependency. Each agent is associated with a sensor and an actuator set. the actuator set is further divided into two subsets: active actuator and passive subsets that, respectively, directly or indirectly participate in controlling the environment. Interactions among different agents can be created by assigning an aggregate function to each agent with sensor and actuator sets as the domain of the function and status of the environment as its codomain. A case study was conducted on a segment of a 6-stage Secure Water Treatment (SWaT) system to demonstrate the applicability of the framework. the study reveals promising features of the framework to analyze the steady state response of the system following both cyber and physical attacks. © Springer international Publishing Switzerland 2015.

关键词： Cyber Physical System

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：