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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16 篇 会议
2 册 图书

馆藏范围

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

日期分布

学科分类号

14 篇 工学
- 14 篇 计算机科学与技术...
- 14 篇 软件工程

主题

2 篇 computational ma...
2 篇 operating system...
2 篇 computer systems...
2 篇 algorithm analys...
1 篇 parallel process...
1 篇 parallelization
1 篇 testing sequence...
1 篇 rssi
1 篇 multiple gpus
1 篇 target localizat...
1 篇 mpi
1 篇 parallel softwar...
1 篇 fits
1 篇 fast
1 篇 colored petri ne...
1 篇 genome compressi...
1 篇 distributed trai...
1 篇 bsp
1 篇 graphics process...
1 篇 trust evaluation

机构

2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
1 篇 inner mongolia u...
1 篇 saarland informa...
1 篇 jiangsu hpc & in...
1 篇 lipn
1 篇 no arizona univ ...
1 篇 shanghai key lab...
1 篇 nanjing ctr hpc ...
1 篇 heilongjiang uni...
1 篇 east china norma...
1 篇 nanjing univ pos...
1 篇 imt atlantique l...
1 篇 heilongjiang uni...
1 篇 tianjin univ col...
1 篇 microsoft corp o...
1 篇 anhui univ sch c...
1 篇 nanjing inst ind...
1 篇 chongqing univ p...

作者

2 篇 laurence t. yang
2 篇 sheng wen
2 篇 albert zomaya
1 篇 liu shangdong
1 篇 bareche imene
1 篇 koester marcel
1 篇 zhong wenjie
1 篇 zhang zhaoning
1 篇 xiao jian
1 篇 xu yan
1 篇 pan yu
1 篇 yao haichang
1 篇 zhu xing
1 篇 li dongsheng
1 篇 yu ce
1 篇 wang bei
1 篇 guo xin
1 篇 philippe jolan
1 篇 ji yimu
1 篇 wan xiaoyun

语言

18 篇 英文

检索条件"任意字段=19th International Conference on Algorithms andArchitectures for Parallel Processing, ICA3PP 2019"

共 18 条记录，以下是1-10 订阅

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

详细简洁

排序：

19th international conference on algorithms and Architectures for parallel processing, ica3pp 2019

19th International Conference on Algorithms and Architecture...

引用

19th international conference on algorithms andarchitectures for parallel processing, ica3pp 2019

ISBN: (纸本)9783030389604

the proceedings contain 102 papers. the special focus in this conference is on algorithms and Architectures for parallel processing. the topics include: Utility-Based Location Distribution Reverse Auction Incentive Mechanism for Mobile Crowd Sensing Network;safeguarding Against Active Routing Attack via Online Learning;reliability Aware Cost Optimization for Memory Constrained Cloud Workflows;null Model and Community Structure in Heterogeneous Networks;an Asynchronous Algorithm to Reduce the Number of Data Exchanges;two-Stage Clustering Hot Event Detection Model for Micro-blog on Spark;mobility-Aware Workflow Offloading and Scheduling Strategy for Mobile Edge Computing;HSpp: Load-Balanced and Low-Latency File Partition and Placement Strategy on Distributed Heterogeneous Storage with Erasure Coding;adaptive Clustering for Outlier Identification in High-Dimensional Data;Improving the parallelism of CESM on GPU;penguin Search Aware Proactive Application Placement;a Data Uploading Strategy in Vehicular Ad-hoc Networks Targeted on Dynamic Topology: Clustering and Cooperation;Cloud Server Load Turning Point Prediction Based on Feature Enhanced Multi-task LSTM;Neuron Fault Tolerance Capability Based Computation Reuse in DNNs;reliability Enhancement of Neural Networks via Neuron-Level Vulnerability Quantization;A Fault Detection Algorithm for Cloud Computing Using QPSO-Based Weighted One-Class Support Vector Machine;paraMoC: A parallel Model Checker for Pushdown Systems;FastDRC: Fast and Scalable Genome Compression Based on Distributed and parallel processing;a parallel Approach to Advantage Actor Critic in Deep Reinforcement Learning;Blockchain-PUF-Based Secure Authentication Protocol for Internet of things;parallel Approach to Sliding Window Sums;selective Velocity Distributed Indexing for Continuously Moving Objects Model;a New Bitcoin Address Association Method Using a Two-Level Learner Model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

19th international conference on algorithms and Architectures for parallel processing, ica3pp 2019

19th International Conference on Algorithms and Architecture...

引用

19th international conference on algorithms andarchitectures for parallel processing, ica3pp 2019

ISBN: (纸本)9783030389901

the proceedings contain 102 papers. the special focus in this conference is on algorithms and Architectures for parallel processing. the topics include: A New Robust and Reversible Watermarking Technique Based on Erasure Code;exit-Less Hypercall: Asynchronous System Calls in Virtualized Processes;automatic Optimization of Python Skeletal parallel Programs;impromptu Rendezvous Based Multi-threaded Algorithm for Shortest Lagrangian Path Problem on Road Networks;FANG: Fast and Efficient Successor-State Generation for Heuristic Optimization on GPUs;DETER: Streaming Graph Partitioning via Combined Degree and Cluster Information;which Node Properties Identify the Propagation Source in Networks?;t/t-Diagnosability of BCube Network;strark-H: A Strategy for Spatial Data Storage to Improve Query Efficiency Based on Spark;SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning;multitask Assignment Algorithm Based on Decision Tree in Spatial Crowdsourcing Environment;TIMOM: A Novel Time Influence Multi-objective Optimization Cloud Data Storage Model for Business Process Management;RTEF-pp: A Robust Trust Evaluation Framework with Privacy Protection for Cloud Services Providers;a Privacy-Preserving Access Control Scheme with Verifiable and Outsourcing Capabilities in Fog-Cloud Computing;utility-Aware Edge Server Deployment in Mobile Edge Computing;predicting Hard Drive Failures for Cloud Storage Systems;Efficient Pattern Matching on CPU-GPU Heterogeneous Systems;improving Performance of Batch Point-to-Point Communications by Active Contention Reduction through Congestion-Avoiding Message Scheduling;an Open Identity Authentication Scheme Based on Blockchain;RBAC-GL: A Role-Based Access Control Gasless Architecture of Consortium Blockchain;flexible Data Flow Architecture for Embedded Hardware Accelerators;developing Patrol Strategies for the Cooperative Opportunistic Criminals.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel Approach to Sliding Window Sums 19th

Parallel Approach to Sliding Window Sums

引用

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

作者： Snytsar, Roman Turakhia, Yatish Microsoft Corp One Microsoft Way Redmond WA 98052 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9783030389611;9783030389604

Sliding window sums are widely used for string indexing, hashing, time series analysis and machine learning. New vector algorithms which utilize the advanced vector extension (AVX) instructions available on modern processors, or the parallel compute units on GPUs and FPGAs, would provide a significant performance boost. We develop a generic vectorized sliding sum algorithm with speedup for window size w and number of processors P is O(P/w) for a generic sliding sum. For a sum with commutative operator the speedup is improved to O(P/log(w)). Implementing the algorithm for the bioinformatics application of minimizer based k-mer table generation using AVX instructions, we obtain a speedup of over 5x.

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

A Framework for Designing Autonomous parallel Data Warehouses 19th

A Framework for Designing Autonomous Parallel Data Warehouse...

引用

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

作者： Benkrid, Soumia Bellatreche, Ladjel Ecole Natl Super Informat ESI Algiers Algeria LIAS ISAE ENSMA Poitiers France

ISBN: (纸本)9783030389611;9783030389604

parallel data platforms are recognized as a key solution for processing analytical queries running on extremely large data warehouses (DWs). Deploying a DW on such platforms requires efficient data partitioning and allocation techniques. Most of these techniques assume a priori knowledge of workload. To deal with their evolution, reactive strategies are mainly used. the BI 2.0 requirements have put large batch and ad-hoc user queries at the center. Consequently, reactive-based solutions for deploying a DW in parallel platforms are not sufficient. Autonomous computing has emerged as a paradigm that allows digital objects managing themselves in accordance with high-level guidance by the means of proactive approaches. Being inspired by this paradigm, we propose in this paper, a proactive approach based on a query clustering model to deploying a DW over a parallel platform. the query clustering triggers partitioning and allocation processes by considering only evolved query groups. Intensive experiments were conducted to show the efficiency of our proposal.

关键词： Partitioning Allocation Common sub-expressions Utility maximization Autonomous system Workload clustering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：