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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

47 篇 会议
3 册 图书

馆藏范围

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

日期分布

学科分类号

41 篇 工学
- 40 篇 计算机科学与技术...
- 36 篇 软件工程
- 2 篇 电气工程
- 2 篇 电子科学与技术（可...
- 2 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 生物工程
- 1 篇 安全科学与工程
6 篇 理学
- 3 篇 数学
- 1 篇 地球物理学
- 1 篇 生物学
- 1 篇 系统科学
2 篇 管理学
- 2 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
1 篇 法学
- 1 篇 社会学

主题

4 篇 parallel computi...
4 篇 gpus
3 篇 graphics process...
2 篇 combinatorial op...
2 篇 graphics process...
2 篇 parallel algorit...
1 篇 distributed opti...
1 篇 computational ma...
1 篇 parallel algorit...
1 篇 adaptive time st...
1 篇 data pipeline
1 篇 multi-objective ...
1 篇 parallel process...
1 篇 parallelization
1 篇 apache spark
1 篇 speculative mult...
1 篇 testing sequence...
1 篇 reusing warps
1 篇 rssi
1 篇 parallelism

机构

3 篇 chinese acad sci...
2 篇 saarland informa...
2 篇 the university o...
2 篇 central south un...
2 篇 univ chinese aca...
2 篇 natl univ def te...
2 篇 university of mu...
2 篇 university of ca...
2 篇 cracow universit...
2 篇 hunan university
1 篇 columbia univers...
1 篇 univ queensland ...
1 篇 univ mostaganem ...
1 篇 school of comput...
1 篇 beijing normal u...
1 篇 inner mongolia u...
1 篇 hangzhou dianzi ...
1 篇 natl comp networ...
1 篇 chongqing univ c...
1 篇 university of ca...

作者

2 篇 koester marcel
2 篇 rabbouch hana
2 篇 zhang lei
2 篇 xiao jian
2 篇 li kenli
2 篇 wang guojun
2 篇 yu ce
2 篇 perez gregorio m...
2 篇 wu guangjun
2 篇 joanna kołodziej
2 篇 zhang bo
2 篇 saadaoui foued
2 篇 wang hao
2 篇 sun tao
2 篇 bellatreche ladj...
2 篇 krueger antonio
2 篇 chen yifeng
2 篇 gross julian
2 篇 hou junteng
2 篇 ji yiming

语言

50 篇 英文

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

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

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

详细简洁

排序：

A Binary Code Sequence Based Tracking Algorithm in Wireless Sensor Networks 19th

A Binary Code Sequence Based Tracking Algorithm in Wireless ...

引用

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

作者： Zhang, Yang Ren, Qianqian Pan, Yu Li, Jinbao Heilongjiang Univ Key Lab Database & Parallel Comp Heilongjiang Pro Harbin Peoples R China Heilongjiang Univ Key Lab Elect Engn Coll Heilongjiang Prov Harbin Peoples R China Heilongjiang Univ Sch Comp Sci & Technol Harbin Peoples R China

ISBN: (纸本)9783030389611;9783030389604

this paper proposes a binary code sequence based tracking algorithm in wireless sensor network. the proposed algorithm can release the influence of sensed data on localization results via building the map between target's occurrence region and a binary code sequence. To solve the ambiguity problem existing in occurrence region determination, the paper further gives a Voronoi diagram based location refinement algorithm. the simulation results show the tracking results under difference trajectories.

关键词： Target localization RSSI Voronoi

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Query processing on a parallel Database Cluster Node 16th

Energy-Aware Query Processing on a Parallel Database Cluster...

引用

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

作者： Roukh, Amine Bellatreche, Ladjel Tziritas, Nikos Ordonez, Carlos Univ Mostaganem Mostaganem Algeria Univ Poitiers LIAS ISAE ENSMA Poitiers France Chinese Acad Sci Shenzhen Peoples R China Univ Houston Houston TX USA

ISBN: (纸本)9783319495835;9783319495828

In the last few years, we have been seeing a significant increase in research about the energy efficiency of hardware and software components in both centralized and parallel platforms. In data centers, DBMSs are one of the major energy consumers, in which, a large amount of data is queried by complex queries running daily. Having green nodes is a pre-condition to design an energy-aware parallel database cluster. Generally, the most existing DBMSs focus on high-performance during query optimization phase, while usually ignoring the energy consumption of the queries. In this paper, we propose a methodology, supported by a tool called EnerQuery, that makes nodes of parallel database clusters saving energy when optimizing queries. To show its effectiveness, we implement our proposal on the top of PostgreSQL DBMS query optimizer. A mathematical cost model based on a machine learning technique is defined and used to estimate the energy consumption of SQL queries.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

parallel Software Testing Sequence Generation Method Target at Full Covering Tested Behaviors 19th

Parallel Software Testing Sequence Generation Method Target ...

引用

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

作者： Sun, Tao Wan, Xiaoyun Zhong, Wenjie Guo, Xin Zhang, Ting Inner Mongolia Univ Coll Comp Sci Hohhot 100021 Inner Mongolia Peoples R China

ISBN: (纸本)9783030389611;9783030389604

parallel software system testing is very difficult because the number of states expands sharply caused by parallel behaviors. In this paper, a testing sequence generation method is proposed, target at full covering tested behaviors and related behaviors over all execution paths. Because of state spaces of parallel software systems are often large, this paper focuses on the state space subgraph, contained all firing of tested and related behaviors, of system model. Firstly, the software system is modeled with Colored Petri Net (CPN), called system model (SM), and every tested behavior or related behavior is modeled also with CPN, called Behavior Model Unit (BMU). then, the method proposes mapping operation, intersection operation, and so on to finally realize the generation of test sequence. Practices show that this method is efficient, which could achieve full coverage.

关键词： parallel software Testing sequence generation Full covering Tested behaviors Colored Petri Net (CPN)

来源：评论

学校读者我要写书评

暂无评论

A parallel Approach to Advantage Actor Critic in Deep Reinforcement Learning 19th

A Parallel Approach to Advantage Actor Critic in Deep Reinfo...

引用

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

作者： Zhu, Xing Du, Yunfei Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou Peoples R China

ISBN: (纸本)9783030389611;9783030389604

Deep Reinforcement learning (DRL) algorithms recently still take a long time to train models in many applications. parallelization has the potential to improve the efficiency of DRL algorithms. In this paper, we propose an parallel approach (ParaA2C) for the popular Actor-Critic (AC) algorithms in DRL, to accelerate the training process. Our work considers the parallelization of the basic advantage actor critic (Serial-A2C) in AC algorithms. Specifically, we use multiple actor-learners to mitigate the strong correlation of data and the instability of updating, and finally reduce the training time. Note that we assign each actor-learner MPI process to a CPU core, in order to prevent resource contention between MPI processes, and make our ParaA2C approach more scalable. We demonstrate the effectiveness of ParaA2C by performing on Arcade Learning Environment (ALE) platform. Notably, our ParaA2C approach takes less than 10 min to train in some commonly used Atari games when using 512 CPU cores.

关键词： Deep reinforcement learning Advantage actor critic parallelization MPI Scalable

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Algorithm for Optimal DAG Structure Search on parallel Computer with Torus Network 16th

Efficient Parallel Algorithm for Optimal DAG Structure Searc...

引用

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

作者： Honda, Hirokazu Tamada, Yoshinori Suda, Reiji Univ Tokyo Grad Sch Informat Sci & Technol Tokyo 1138656 Japan

ISBN: (纸本)9783319495835;9783319495828

the optimal directed acyclic graph search problem constitutes searching for a DAG with a minimum score, where the score of a DAG is defined on its structure. this problem is known to be NP-hard, and the state-of-the-art algorithm requires exponential time and space. It is thus not feasible to solve large instances using a single processor. Some parallel algorithms have therefore been developed to solve larger instances. A recently proposed parallel algorithm can solve an instance of 33 vertices, and this is the largest solved size reported thus far. In the study presented in this paper, we developed a novel parallel algorithm designed specifically to operate on a parallel computer with a torus network. Our algorithm crucially exploits the torus network structure, thereby obtaining good scalability. through computational experiments, we confirmed that a run of our proposed method using up to 20,736 cores showed a parallelization efficiency of 0.94 as compared to a 1296-core run. Finally, we successfully computed an optimal DAG structure for an instance of 36 vertices, which is the largest solved size reported in the literature.

关键词： Optimal DAG structure Optimal bayesian network structure parallel algorithm Distributed algorithm Torus network

来源：评论

学校读者我要写书评

暂无评论

Automatic Optimization of Python Skeletal parallel Programs 19th

Automatic Optimization of Python Skeletal Parallel Programs

引用

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

作者： Loulergue, Frederic Philippe, Jolan No Arizona Univ Sch Informat Comp & Cyber Syst Flagstaff AZ 86011 USA IMT Atlantique LS2N INRIA UBL Nantes France

ISBN: (纸本)9783030389918;9783030389901

Skeletal parallelism is a model of parallelism where parallel constructs are provided to the programmer as usual patterns of parallel algorithms. High-level skeleton libraries often offer a global view of programs instead of the common Single Program Multiple Data view in parallel programming. A program is written as a sequential program but operates on parallel data structures. Most of the time, skeletons on a parallel data structure have counterparts on a sequential data structure. For example, the map function that applies a given function to all the elements of a sequential collection (e.g., a list) has a map skeleton counterpart that applies a sequential function to all the elements of a distributed collection. Two of the challenges a programmer faces when using a skeleton library that provides a wide variety of skeletons are: which are the skeletons to use, and how to compose them? these design decisions may have a large impact on the performance of the parallel programs. However, skeletons, especially when they do not mutate the data structure they operate on, but are rather implemented as pure functions, possess algebraic properties that allow to transform compositions of skeletons into more efficient compositions of skeletons. In this paper, we present such an automatic transformation framework for the Python skeleton library PySke and evaluate it on several example applications.

关键词： Algorithmic skeletons Program transformation Python

来源：评论

学校读者我要写书评

暂无评论

FANG: Fast and Efficient Successor-State Generation for Heuristic Optimization on GPUs 19th

FANG: Fast and Efficient Successor-State Generation for Heur...

引用

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

作者： Koester, Marcel Gross, Julian Krueger, Antonio Saarland Informat Campus Campus D3-2 D-66123 Saarbrucken Germany

ISBN: (纸本)9783030389918;9783030389901

Many optimization problems (especially nonsmooth ones) are typically solved by genetic, evolutionary, or metaheuristic-based algorithms. However, these genetic approaches and other related papers typically assume the existence of a neighborhood or successor-state function N(x), where x is a candidate state. the implementation of such a function can become arbitrarily complex in the field of combinatorial optimization. Many N(x) functions for a huge variety of different domainspecific problems have been developed in the past to solve this general problem. However, it has always been a great challenge to port or realize these functions on a massively-parallel architecture like a Graphics processing Unit (GPU). We present a GPU-based method called FANG that implements a generic and reusable N(x) for arbitrary domains in the field of combinatorial optimization. It can be customized to satisfy domainspecific requirements and leverages the underlying hardware in a fast and efficient way by construction. Moreover, our method has a high scalability with respect to the number of input states and the complexity of a single state. Measurements show significant performance improvements compared to traditional exploration approaches leveraging the CPU on our evaluation scenarios.

关键词： Heuristic search Combinatorial optimization Successor-state generation Neighborhood exploration Massively-parallel processing Graphics processing units GPUs

来源：评论

学校读者我要写书评

暂无评论

ParaMoC: A parallel Model Checker for Pushdown Systems 19th

ParaMoC: A Parallel Model Checker for Pushdown Systems

引用

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

作者： Wei, Hansheng Ye, Xin Shi, Jianqi Huang, Yanhong East China Normal Univ Natl Trusted Embedded Software Engn Technol Res C Shanghai Peoples R China Res Ctr Hardware Software Codesign Technol & Applicat Eng Shanghai Peoples R China Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China LIPN Paris France Paris Univ 7 Paris France

ISBN: (纸本)9783030389611;9783030389604

Model checking on Pushdown Systems (PDSs) has been extensively used to deal with numerous practical problems. However, the existing model checkers for pushdown systems are executed on the central processing unit (CPU), the performance is hampered by the computing power of the CPU. Compared with the CPU, the graphics processing unit (GPU) has more processing cores, which are suitable and efficient for parallel computing. therefore, it is very attractive to accelerate model checking of PDSs on the GPU. In this paper, we present a new parallel model checker, named ParaMoC, to speed up the performance of model checking problems for pushdown systems (PDSs). Moreover, we focus on how to use Graphics processing Units (GPUs) to accelerate the reachability verification and the LTL model checking of PDSs. the ParaMoC running on a state-of-the-art GPU can be 100 times faster than the traditional PDS model checker.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

RTEF-pp: A Robust Trust Evaluation Framework with Privacy Protection for Cloud Services Providers 19th

RTEF-PP: A Robust Trust Evaluation Framework with Privacy Pr...

引用

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

作者： Zhong, Hong Zou, JianZhong Cui, Jie Xu, Yan Anhui Univ Sch Comp Sci & Technol Hefei 230039 Peoples R China Anhui Engn Lab IoT Secur Technol Hefei 230039 Peoples R China

ISBN: (纸本)9783030389918;9783030389901

the trust problem of Cloud Services Providers (CSPs) has become one of the most challenging issues for cloud computing. To build trust between Cloud Clients (CCs) and CSPs, a large number of trust evaluation frameworks have been proposed. Most of these trust evaluation frameworks collect and process evidence data such as the feedback and the preferences from CCs. However, evidence data may reveal the CCs' privacy. So far there are very few trust frameworks study on the privacy protection of CCs. In addition, when the number of malicious CCs' feedback increases, the accuracy of existing frameworks is greatly reduced. this paper proposes a robust trust evaluation framework RTEF-pp, which uses differential privacy to protect CCs' privacy. Furthermore, RTEF-pp uses the Euclidean distances between the monitored QoS values and CCs' feedback to detect malicious CCs' feedback ratings, and is not affected by the number of malicious CCs' feedback rating. Experimental results show that RTEF-pp is reliable and will not be affected by the number of malicious CCs' feedback rating.

关键词： Cloud computing Trust evaluation Robust Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Distributed and parallel Ensemble Classification for Big Data Based on Kullback-Leibler Random Sample Partition 20th

Distributed and Parallel Ensemble Classification for Big Dat...

引用

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

作者： Wei, Chenghao Zhang, Jiyong Valiullin, Timur Cao, Weipeng Wang, Qiang Long, Hao Shenzhen Univ Big Data Inst Coll Comp Sci & Software Engn Shenzhen 518000 Peoples R China Hangzhou Dianzi Univ Sch Automat Hangzhou 311305 Peoples R China Southern Univ Sci & Technol SUSTech Acad Adv Interdisciplinary Studies Shenzhen 518055 Peoples R China

ISBN: (纸本)9783030602451;9783030602444

In this article, we use a Kullback-Leibler random sample partition data model to generate a set of disjoint data blocks, where each block is a good representation of the entire data set. Every random sample partition (RSP) block has a sample distribution function similar to the entire data set. To obtain the statistical measure between them, Kernel Density Estimation (KDE) with a dual-tree recursion data structure is firstly applied to fast estimate the probability density of each block. then, based on the Kullback-Leibler (KL) divergence measure, we can obtain the statistical similarity between a randomly selected RSP data block and other RSP data blocks. We rank the RSP data blocks according to their divergence values in descending order and choose the first ten for an ensemble classification learning. the classification models are established in parallel for the selected RSP data blocks and the final ensemble classification model is obtained by the weighted voting ensemble strategy. the experiments were conducted by building XGboost model based on those ten blocks in parallel, and we incrementally ensemble them according to their KL values. the testing classification results show that our method can increase the generalization capability of the ensemble classification model. It could reduce the model building time in parallel computation environment by using less than 15% of the entire data, which could also solve the memory constraints of big data analysis.

关键词： Big data analysis Approximate computing Random sample partition Ensemble classification parallel distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：