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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

268 篇 会议
18 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

231 篇 工学
- 224 篇 计算机科学与技术...
- 159 篇 软件工程
- 29 篇 信息与通信工程
- 23 篇 电气工程
- 13 篇 电子科学与技术（可...
- 12 篇 控制科学与工程
- 7 篇 生物工程
- 4 篇 机械工程
- 4 篇 冶金工程
- 4 篇 生物医学工程（可授...
- 3 篇 农业工程
- 2 篇 力学（可授工学、理...
- 2 篇 仪器科学与技术
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 1 篇 光学工程
68 篇 理学
- 56 篇 数学
- 8 篇 生物学
- 6 篇 系统科学
- 4 篇 物理学
- 3 篇 统计学（可授理学、...
- 2 篇 地球物理学
- 1 篇 化学
- 1 篇 大气科学
22 篇 管理学
- 15 篇 管理科学与工程(可...
- 11 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 法学
- 4 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

14 篇 parallel computi...
12 篇 algorithm analys...
10 篇 parallel program...
10 篇 parallel algorit...
9 篇 software enginee...
9 篇 computer communi...
7 篇 parallel algorit...
7 篇 parallel process...
7 篇 gpu
6 篇 parallel process...
6 篇 high performance...
5 篇 scalability
5 篇 information syst...
5 篇 mapreduce
5 篇 artificial intel...
5 篇 distributed comp...
4 篇 parallel archite...
4 篇 matrix algebra
4 篇 combinatorial op...
4 篇 management of co...

机构

7 篇 natl univ def te...
5 篇 city university ...
4 篇 chinese acad sci...
4 篇 hainan internati...
4 篇 natl univ def te...
3 篇 seecs university...
3 篇 department of co...
3 篇 key laboratory o...
3 篇 school of inform...
3 篇 peking univ eecs...
3 篇 laboratory of di...
2 篇 advanced institu...
2 篇 college of compu...
2 篇 computer network...
2 篇 saarland informa...
2 篇 guangdong key la...
2 篇 icar-cnr and uni...
2 篇 guangdong prov k...
2 篇 heilongjiang uni...
2 篇 department of co...

作者

5 篇 wang guojun
5 篇 wanlei zhou
5 篇 liu jie
4 篇 yang xiang
4 篇 su jinshu
4 篇 nakano koji
4 篇 michael hobbs
4 篇 gao yutong
4 篇 liu xuan
4 篇 huang zhen
4 篇 wang qinglin
4 篇 wang xiaofeng
4 篇 ivan stojmenovic
4 篇 chen yifeng
4 篇 albert zomaya
4 篇 zomaya albert
3 篇 chen peixin
3 篇 zhang lei
3 篇 li kenli
3 篇 li dongsheng

语言

290 篇 英文
2 篇 中文

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

共 292 条记录，以下是131-140 订阅

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

详细简洁

排序：

New Multi-objectives Scheduling Strategies in Docker SwarmKit 18th

New Multi-objectives Scheduling Strategies in Docker SwarmKi...

引用

18th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Menouer, Tarek Cerin, Christophe Leclercq, Etienne Univ Paris 13 Sorbonne Paris Cite LIPN CNRS UMR 7030 F-93430 Villetaneuse France

ISBN: (纸本)9783030050573;9783030050566

this paper presents new multi-objectives scheduling strategies implemented in Docker SwarmKit. Docker SwarmKit is a container toolkit for orchestrating distributed systems at any scale. Currently, Docker SwarmKit has one scheduling strategy called Spread. Spread is based only on one objective to select from a set of cloud nodes, one node to execute a container. However, the containers submitted by users to be scheduled in Docker SwarmKit are configured according to multi-objectives criteria, as the number of CPUs and the memory size. To better address the multi-objectives configuration problem of containers, we introduce the concept and the implementation of new multi-objectives scheduling strategies adapted for Cloud Computing environments and implemented in Docker SwarmKit. the principle of our multi-objectives strategies consist to select a node which has a good compromise between multi-objectives criteria to execute a container. the proposed scheduling strategies are based on a combinaison of PROMEthEE and Kung multi-objectives decision algorithms in order to place containers. the implementation in Docker SwarmKit and experiments of our new strategies demonstrate the potential of our approach under different scenarios.

关键词： Systems software Scheduling and resource management Container technology Cloud computing Application of parallel and distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Automated parallel Simulation of Heart Electrical Activity Using Finite Element Method 16th

Automated Parallel Simulation of Heart Electrical Activity U...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Sozykin, Andrey Epanchintsev, Timofei Zverev, Vladimir Khamzin, Svyatoslav Bersenev, Aleksandr Krasovskii Inst Math & Mech Ekaterinburg Russia Inst Immunol & Physiol UrB RAS Ekaterinburg Russia Ural Fed Univ Ekaterinburg Russia

ISBN: (纸本)9783319499567;9783319499550

In this paper we present an approach to the parallel simulation of the heart electrical activity using the finite element method with the help of the FEniCS automated scientific computing framework. FEniCS allows scientific software development using the near-mathematical notation and provides automatic parallelization on MPI clusters. We implemented the ten Tusscher-Panfilov (TP06) cell model of cardiac electrical activity. the scalability testing of the implementation was performed using up to 240 CPU cores and the 95 times speedup was achieved. We evaluated various combinations of the Krylov parallel linear solvers and the preconditioners available in FEniCS. the best performance was provided by the conjugate gradient method and the biconjugate gradient stabilized method solvers with the successive over-relaxation preconditioner. Since the FEniCS-based implementation of TP06 model uses notation close to the mathematical one, it can be utilized by computational mathematicians, biophysicists, and other researchers without extensive parallel computing skills.

关键词： Heart simulation Finite element method Scalability Krylov subspace methods FEniCS parallel computing

来源：评论

学校读者我要写书评

暂无评论

On a parallel Algorithm for the Determination of Multiple Optimal Solutions for the LCSS Problem 16th

On a Parallel Algorithm for the Determination of Multiple Op...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Ben Mabrouk, Bchira Hasni, Hamadi Mahjoub, Zaher Univ Tunis El Manar Fac Sci Tunis Univ CampusManar 2 Tunis 2092 Tunisia Higher Sch Technol & Comp Sci Charguia 2 Tunis 2035 Tunisia

ISBN: (纸本)9783319495835;9783319495828

For particular real world combinatorial optimization problems e.g. the longest common subsequence problem (LCSSP) from Bioinformatics, determining multiple optimal solutions (DMOS) is quite useful for experts. However, for large size problems, this may be too time consuming, thus the resort to parallel computing. We address here the parallelization of an algorithm for DMOS for the LCSSP. Considering the dynamic programming algorithm solving it, we derive a generic algorithm for DMOS (A-DMOS). Since the latter is a non perfect DO-loop nest, we adopt a three-step approach. the first consists in transforming the A-DMOS into a perfect nest. the second consists in choosing the granularity and the third carries out a dependency analysis in order to determine the type of each loop i.e. either parallel or serial. the practical performances of our approach are evaluated through experimentations achieved on input benchmarks and random DNA sequences and targeting a parallel multicore machine.

关键词： Bioinformatics Combinatorial optimization problem Dependency analysis Dynamic programming Longest common subsequence Loop nest Multiple optimal solutions Multicore machine parallelization Polyhedral algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel processing algorithms for the Vehicle Routing Problem and Its Variants: A Literature Review with a Look into the Future 20th

Parallel Processing Algorithms for the Vehicle Routing Probl...

引用

20th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Rabbouch, Bochra Rabbouch, Hana Saadaoui, Foued Zone Industrielle Manzel Hayet LEONI Wiring Syst Monastir 5033 Tunisia Univ Monastir Fac Sci Lab LR18ES15 Algebre Theorie Nombres & Anal Nonli Monastir 5019 Tunisia King Abdulaziz Univ Fac Sci Dept Stat POB 80203 Jeddah 21589 Saudi Arabia

ISBN: (纸本)9783030602451;9783030602444

Vehicle Routing Problems (VRPs) are well-know combinatorial optimization problems used to design an optimal route for a fleet of vehicles to service a set of customers under a number of constraints. Due to their NP-hard complexity, a number of purely computational techniques have been proposed in recent years in order to solve them. Among these techniques, nature-inspired algorithms have proven their effectiveness in terms of accuracy and convergence speed. Some of these methods are also designed in such a way to decompose the basic problem into a number of sub-problems which are subsequently solved in parallel computing environments. It is therefore the purpose of this paper to review the fresh corpus of the literature dealing with the main approaches proposed over the past few years to solve combinatorial optimization problems in general and, in particular, the VRP and its different variants. Bibliometric and review studies are conducted with a special attention paid to metaheuristic strategies involving procedures with parallel architectures. the obtained results show an expansion of the use of parallel algorithms for solving various VRPs. Nevertheless, the regression in the number of citations in this framework proves that the interest of the research community has declined somewhat in recent years. this decline may be explained by the lack of rigorous mathematical results and practical interfaces under famous calculation softwares.

关键词： Combinatorial optimization Vehicle Routing Problem Metaheuristics Nature-inspired algorithms parallel computing

来源：评论

学校读者我要写书评

暂无评论

Dynamic Data Race Detection for Correlated Variables

Dynamic Data Race Detection for Correlated Variables

引用

11th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Jannesari, Ali Westphal-Furuya, Markus Tichy, Walter F. Karlsruhe Inst Technol Inst Program Struct & Data Org D-76131 Karlsruhe Germany

ISBN: (纸本)9783642246494

In parallel programs concurrency bugs are often caused by unsynchronized accesses to shared memory locations, which are called data races. In order to support programmers in writing correct parallel programs, it is therefore highly desired to have tools on hand that automatically detect such data races. Today, most of these tools only consider unsynchronized read and write operations on a single memory location. Concurrency bugs that involve multiple accesses on a set of correlated variables may be completely missed. Tools may overwhelm programmers with data races on various memory locations, without noticing that the locations are correlated. In this paper, we propose a novel approach to data race detection that automatically infers sets of correlated variables and logical operations by analyzing data and control dependencies. For data race detection itself, we combine a modified version of the lockset algorithm with happens-before analysis providing the first hybrid, dynamic race detector for correlated variables. We implemented our approach on top of the Valgrind, a framework for dynamic binary instrumentation. Our evaluation confirmed that we can catch data races missed by existing detectors and provide additional information for correct bug fixing.

关键词： data race detection parallel programs dynamic analysis correlated variables

来源：评论

学校读者我要写书评

暂无评论

thread Mapping and parallel Optimization for MIC Heterogeneous parallel Systems

Thread Mapping and Parallel Optimization for MIC Heterogeneo...

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Ju, Tao Zhu, Zhengdong Wang, Yinfeng Li, Liang Dong, Xiaoshe Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Shenzhen Inst Informat Technol Shenzhen 518172 Peoples R China

ISBN: (纸本)9783319111940;9783319111933

there is no dedicated thread mapping method for Many Integrated Core (MIC) heterogeneous system in the traditional multithread programming model. the unreasonable thread mapping will lead the promising computing power of MIC coprocessor not to be fully exploited. In order to fully exploit the computing potential of MIC coprocessor, this paper discussed effective multi threads mapping strategies through comparing the computing performance and analyzing the performance differences between various mapping methods. Meanwhile, for the further exploiting the high computing power of MIC heterogeneous system, the specific program porting and performance optimization strategies were explored by using the k-means application program. Experimental results show that the proposed mapping and parallel optimization strategies are effective, which can be guide the programmer to port and optimize applications effectively to MIC heterogeneous parallel system.

关键词： Computing power

来源：评论

学校读者我要写书评

暂无评论

On the Use of Binary Trees for DNA Hydroxymethylation Analysis 17th

On the Use of Binary Trees for DNA Hydroxymethylation Analys...

引用

17th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Gonzalez, Cesar Perez, Mariano Orduna, Juan M. Chaves, Javier Garcia, Ana-Barbara Univ Valencia Dept Informat Avda Univ S-N Valencia 46100 Spain CIBERDEM Carlos III Hlth Inst INCLIVA Hlth Res Inst Avda Menendez Pelayo 4 Accesorio Valencia 46010 Spain

ISBN: (纸本)9783319654829;9783319654812

DNA methylation (mC) and hydroxymethylation (hmC) can have a significant effect on normal human development, health and disease status. Hydroxymethylation studies require specific treatment of DNA, as well as software tools for their analysis. In this paper, we propose a parallel software tool for analyzing the DNA hydroxymethylation data obtained by TAB-seq. the software is based on the use of binary trees for searching the different occurrences of methylation and hydroxymethylation in DNA samples. the binary trees allow to efficiently store and access the information about the methylation of each methylated/hydroxymethylated cytosines in the samples. Evaluation results shows that the performance of the application is only limited by the computer input/output bandwidth, even for the case of very long samples.

关键词： High performance computing DNA hydroxymethylation parallel pipeline

来源：评论

学校读者我要写书评

暂无评论

Efficient loop partitioning for parallel codes of irregular scientific computations 5

Efficient loop partitioning for parallel codes of irregular ...

引用

5th international conference on algorithms and architectures for parallel processing, ica3pp 2002

作者： Guo, Minyi Li, Li Chang, Weng-Long Dept. of Computer Software University of Aizu Aizu-Wakamatsu City Fukushima965-8580 Japan Dept. of Info. Management Southern Taiwan University of Technology Tainan710 Taiwan

ISBN: (纸本)0769515126

In most distributed memory computations, node programs are executed on processors according to the owner computes rule. However, the owner computes rule is not best suited for irregular application codes. In irregular application codes, use of indirection in accessing left hand side array makes it difficult to partition loop iterations, and using indirection in accessing right hand side elements may reduce total communication by using heuristics other than the owner computes rule. In this paper we propose a communication cost reduction computes rule for irregular loop partitioning, called least communication computes rule. We partition a loop iteration to a processor on which minimal communication cost is ensured when executing that iteration. After all iterations are partitioned into various processors, we give a global vs local data transformation rule, indirection array remapping and communication optimization methods. the experimental results show that, in most cases, our approaches achieved better performance than other loop partitioning rules. © 2002 IEEE.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms of parallel Skyline Join over Data Streams 18th

Efficient Algorithms of Parallel Skyline Join over Data Stre...

引用

18th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Zhang, Jinchao Gu, JingZi Cheng, Shuai Li, Bo Wang, Weiping Meng, Dan Chinese Acad Sci Inst Informat Engn Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China

ISBN: (纸本)9783030050511;9783030050504

the issue of finding skyline tuples over multiple relations, more commonly known as the skyline join problem, has been well studied in scenarios in which the data is static. Most recently, it has become a new trend that performing skyline queries on data streams, where tuples arrive or expire in a continuous approach. A few algorithms have been proposed for computing skylines on two data streams. However, those literatures did not consider the inherent parallelism, or employ serial algorithms to solve the skyline query problem, which cannot leverage the multi-core processors. Based on this motivation, in this paper, we address the problem of parallel computing for skyline join over multiple data streams. We developed a Novel Iterative framework based on the existing work and study the inherent parallelism of the Novel Iterative framework. then we propose two parallel skyline join algorithms over sliding windows, NP-SWJ and IP-SWJ. To the best of our knowledge, this is the first paper that addresses parallel computing of skyline join over multiple data streams. Extensive experimental evaluations on real and synthetic data sets show that the algorithms proposed in this paper provide large gains over the state-of-the-art serial algorithm of skyline join over data streams.

关键词： Skyline join Sliding window Data stream parallel computing

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Identity-Based Signature from Composite Order Bilinear Groups 15th

A Hierarchical Identity-Based Signature from Composite Order...

引用

15th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Chen, Peixin Wang, Xiaofeng Su, Jinshu Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9783319271613;9783319271606

Cloud storage has become one of the integral parts of online life. However, the cloud storage brings in new kinds of data security issues as well. Authentication framework for both users and services provides an efficient solution to the security and privacy problems of the cloud storage. In this paper we propose a Hierarchical Identity-Based Signature (HIBS) scheme using composite order bilinear groups. We present the methodology of dual system signature to prove that our scheme is secure against existential forgery on adaptively chosen message and identity attack under standard model. Our HIBS scheme shares the same system parameters with the hierarchical identity-based encryption (LW-HIBE) scheme by Lewko and Waters, and it is as efficient as the LW-HIBE. Combining our signature scheme with the LW-HIBE scheme yields a complete solution of an identity-based public key system, which can be utilized to build an authentication framework for cloud storage.

关键词： Hierarchical identity-based signature Dual system encryption Composite order group Bilinear map Cloud storage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：