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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,282 篇 会议
47 篇 期刊文献
3 册 图书

馆藏范围

4,332 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,433 篇 工学
- 2,169 篇 计算机科学与技术...
- 1,080 篇 软件工程
- 607 篇 电气工程
- 586 篇 信息与通信工程
- 185 篇 仪器科学与技术
- 138 篇 控制科学与工程
- 120 篇 电子科学与技术（可...
- 64 篇 生物工程
- 59 篇 机械工程
- 43 篇 动力工程及工程热...
- 38 篇 交通运输工程
- 31 篇 生物医学工程（可授...
- 27 篇 安全科学与工程
- 26 篇 网络空间安全
- 24 篇 光学工程
- 23 篇 土木工程
- 22 篇 材料科学与工程（可...
- 20 篇 建筑学
- 19 篇 航空宇航科学与技...
418 篇 理学
- 253 篇 数学
- 86 篇 物理学
- 72 篇 生物学
- 51 篇 系统科学
- 42 篇 统计学（可授理学、...
262 篇 管理学
- 180 篇 管理科学与工程(可...
- 97 篇 图书情报与档案管...
- 66 篇 工商管理
35 篇 医学
- 30 篇 临床医学
33 篇 法学
- 19 篇 社会学
18 篇 经济学
- 18 篇 应用经济学
11 篇 农学
7 篇 教育学
7 篇 文学
2 篇 军事学
1 篇 艺术学

主题

543 篇 parallel process...
259 篇 computer archite...
238 篇 computational mo...
207 篇 distributed comp...
186 篇 concurrent compu...
179 篇 computer network...
164 篇 network topology
157 篇 hardware
157 篇 graphics process...
148 篇 routing
130 篇 bandwidth
123 篇 application soft...
120 篇 neural networks
120 篇 protocols
107 篇 scalability
104 篇 multicore proces...
103 篇 throughput
102 篇 algorithm design...
102 篇 kernel
101 篇 computer science

机构

15 篇 institute of inf...
14 篇 institute of com...
14 篇 science and tech...
13 篇 college of compu...
13 篇 school of cyber ...
13 篇 shandong fundame...
12 篇 school of comput...
10 篇 science and tech...
9 篇 univ chinese aca...
9 篇 university of ch...
9 篇 natl univ def te...
9 篇 natl univ def te...
8 篇 shenyang aerospa...
8 篇 beijing univ pos...
8 篇 nanjing univ aer...
8 篇 beijing universi...
7 篇 shanghai jiao to...
7 篇 college of compu...
7 篇 chinese acad sci...
7 篇 national key lab...

作者

17 篇 bagherzadeh nade...
16 篇 kotenko igor
14 篇 j. duato
12 篇 wang yijie
11 篇 daneshtalab maso...
10 篇 ebrahimi masoume...
10 篇 yijie wang
10 篇 nader bagherzade...
10 篇 igor kotenko
10 篇 lexi xu
9 篇 li dongsheng
9 篇 marco aldinucci
9 篇 matsutani hiroki
8 篇 hiroki matsutani
8 篇 masoumeh ebrahim...
8 篇 plosila juha
8 篇 marco danelutto
8 篇 wang huaimin
7 篇 tenhunen hannu
7 篇 xinzhou cheng

语言

4,273 篇 英文
50 篇 其他
11 篇 中文
1 篇 乌克兰文

检索条件"任意字段=Euromicro Conference on Parallel, Distributed and Network-Based Processing"

共 4332 条记录，以下是1151-1160 订阅

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

详细简洁

排序：

Combining parallel Genetic Algorithms and Machine Learning to improve the research of optimal vaccination protocols 26

Combining Parallel Genetic Algorithms and Machine Learning t...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Pennisi, Marzio Russo, Giulia Pappalardo, Francesco Univ Catania Dept Math & Comp Sci Catania Italy Univ Catania Dept Biomed Sci Catania Italy Univ Catania Dept Drug Sci Catania Italy

ISBN: (纸本)9781538649756

The developing of novel prophylactic and therapeutic vaccine candidates in the field of cancer immunology brought to very promising results against tumors, entitling full protection with reduced amount of the typical side effects of the actual conventional treatments. However, such treatments required a constant, life-long, administration procedure to keep protection. As both the period of protection and the relative number of administrations grow, the problem of finding the best administration protocol, in time and dosage, becomes more and more complex. Such a problem cannot be usually solved in in vivo experiments, as the costs in terms of time, money, and people would be prohibitive. We propose a hybrid approach that integrates machine learning and parallel genetic algorithms to enhance the research in silico of optimal administration protocols for a cancer vaccine. A neural network is used to improve both crossover and mutation operators. Preliminary results suggest that the use of such could bring to better administration protocols using a similar computational effort.

关键词： Genetic algorithms machine learning neural networks agent based models optimal vaccine protocol cancer

来源：评论

学校读者我要写书评

暂无评论

Memory-Aware Genetic Algorithms for Task Mapping on Hard Real-Time networks-on-Chip 26

Memory-Aware Genetic Algorithms for Task Mapping on Hard Rea...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Still, Lloyd Robert Indrusiak, Leandro Soares Univ York Real Time Syst Grp Dept Comp Sci York N Yorkshire England

ISBN: (纸本)9781538649756

The problem of mapping hard real-time tasks onto networks-on-chip has previously been successfully addressed by genetic algorithms. However, none of the existing problem formulations consider memory constraints. State-of-the-art genetic mappers are therefore able to find fully-schedulable mappings which are incompatible with the memory limitations of realistic platforms. In this paper, we extend the problem formulation and devise a memory architecture, in the form of private local memories. We then propose three memory models of increasing complexity and realism, and evaluate the impact these additional constraints pose to the genetic search. We conduct extensive experiments using tasks and communications from a realistic benchmark application, and compare the proposed approach against a state-of-the-art baseline mapper.

关键词： Real-time systems Multi-core processing

来源：评论

学校读者我要写书评

暂无评论

distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social network Analysis 26

Distributed Heuristics for Optimizing Cohesive Groups: A Sup...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Zoppis, Italo Dondi, Riccardo Coppetti, Davide Beltramo, Alessandro Mauri, Giancarlo Univ Milano Bicocca Dept Comp Sci Milan Italy Univ Bergamo Dept Letters Philosophy & Commun Studies Bergamo Italy ITC B Belotti Bergamo Italy

ISBN: (纸本)9781538649756

Social interaction allows to support the disease management by creating online spaces where patients can interact with clinicians, and share experiences with other patients. Therefore, promoting targeted communication in online social spaces is a means to group patients around shared goals, offer emotional support, and finally engage patients in their healthcare decision-making process. In this paper, we approach the argument from a theoretical perspective: we design an optimization problem aimed to encourage the creation of (induced) sub-networks of patients which, being recently diagnosed, wish to deepen the knowledge about their medical treatment with some other similar profiled patients, which have already been followed up by specific (even alternative) care centers. In particular, due to the computational hardness of the proposed problem, we provide approximated solutions based on distributed heuristics (i.e., Genetic Algorithms). Results are given for simulated data using Erdos-Renyi random graphs.

关键词： Social network distributed Heuristic Genetic Algorithm Dense Communities 2-club optimization problem

来源：评论

学校读者我要写书评

暂无评论

Social Auto-Scaling 26

Social Auto-Scaling

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Smith, Peter Gonzalez-Velez, Horacio Caton, Simon Natl Coll Ireland Sch Comp Dublin 1 Ireland

ISBN: (纸本)9781538649756

Today, auto-scaling solutions are still largely reactive and are based on the load measured on existing nodes nearing a threshold or traffic forecast information provided in advance of a scheduled event. Despite these advancements, events which cause a flash flood of web traffic do not always benefit from this approach to auto-scaling because the latency of provisioning new nodes is not sufficient to prevent resource saturation. This paper proposes a novel approach to preemptive compute scaling based on the buzz of specific social network hashtags. We argue that improved scaling latency and service availability can be achieved for web services that receive intermittent as well as unexpected traffic load patterns. By combining social network monitoring, with auto-scaling frameworks, this approach can reduce the operational expense impact of over-and under-provisioning as well as the business costs of the latter. We demonstrate our approach using the AWS application suite, and demonstrate how our approach expedites the auto-scaling strategy for our use case: public transportation web sites.

关键词： Auto-scaling Web Applications Social network Platforms Resource Management Twitter Social Cloud Computing

来源：评论

学校读者我要写书评

暂无评论

Performability Analysis of Mesh-based NoCs Using Markov Reward Model 26

Performability Analysis of Mesh-based NoCs Using Markov Rewa...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Hou, Jie Radetzki, Martin Univ Stuttgart Chair Embedded Syst Stuttgart Germany

ISBN: (纸本)9781538649756

Technology scaling makes it possible to implement systems with hundreds of processing cores, and thousands in the future. The communication in such systems is enabled by networks-on-Chips (NoCs). A downside of technology scaling is the increased susceptibility to failures in NoC resources. Ensuring reliable operation despite such failures degrades NoC performance and may even invalidate the performance benefits expected from scaling. Thus, it is not enough to analyze performance and reliability in isolation, as usually done. Instead, we suggest treating both aspects together using the concept of performability and its analysis with Markov reward models. Our methodology is exemplified for mesh NoCs and transient faults but can be transferred to other topologies and fault models. We investigate how performability develops with scaling towards larger NoCs and explore the limits of scaling by determining the break-even failure rates under which scaling can achieve net performance increase.

关键词： Performability degradable systems Markov models Markov reward models NoCs Mesh

来源：评论

学校读者我要写书评

暂无评论

TMbarrier: Speculative Barriers Using Hardware Transactional Memory 26

TMbarrier: Speculative Barriers Using Hardware Transactional...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Pedrero, Manuel Gutierrez, Eladio Plata, Oscar Univ Malaga Dept Comp Architecture Malaga Spain

ISBN: (纸本)9781538649756

Barrier is a very common synchronization method used in parallel programming. Barriers are used typically to enforce a partial thread execution order, since there may be dependences between code sections before and after the barrier. This work proposes TMbarrier, a new design of a barrier intended to be used in transactional applications. TMbarrier allows threads to continue executing speculatively after the barrier assuming that there are not dependences with safe threads that have not yet reached the barrier. Our design leverages transactional memory (TM) (specifically, the implementation offered by the IBM POWER8 processor) to hold the speculative updates and to detect possible conflicts between speculative and safe threads. Despite the limitations of the best-effort hardware TM implementation present in current processors, experiments show a reduction in wasted time due to synchronization compared to standard barriers.

关键词： Hardware Transactional Memory Speculation IBM POWER8 parallel Computing

来源：评论

学校读者我要写书评

暂无评论

On Sharding Open Blockchains with Smart Contracts 36

On Sharding Open Blockchains with Smart Contracts

引用

IEEE 36th International conference on Data Engineering (ICDE)

作者： Tao, Yuechen Li, Bo Jiang, Jingjie Ng, Hok Chu Wang, Cong Li, Baochun Hong Kong Univ Sci & Technol Hong Kong Peoples R China Huawei Future Network Theory Lab Hong Kong Peoples R China City Univ Hong Kong Hong Kong Peoples R China Univ Toronto Toronto ON Canada

ISBN: (纸本)9781728129037

Current blockchain systems suffer from a number of inherent drawbacks in its scalability, latency, and processing throughput. By enabling parallel confirmations of transactions, sharding has been proposed to mitigate these drawbacks, which usually requires frequent communication among miners through a separate consensus protocol. In this paper, we propose, analyze, and implement a new distributed and dynamic sharding system to substantially improve the throughput of blockchain systems based on smart contracts, while requiring minimum cross-shard communication. Our key observation is that transactions sent by users who only participate in a single smart contract can be validated and confirmed independently without causing double spending. Therefore, the natural formation of a shard is to surround one smart contract to start with. The complication lies in the different sizes of shards being formed, in which a small shard with few transactions tends to generate a large number of empty blocks resulting in a waste of mining power, while a large shard adversely affects parallel confirmations. To overcome this problem, we propose an inter-shard merging algorithm with incentives to encourage small shards to merge with one another and form a larger shard, an intra-shard transaction selection mechanism to encourage miners to select different subsets of transactions for validation, as well as a parameter unification method to further improve these two algorithms to reduce the communication cost and improve system reliability. We analyze our proposed algorithms using the game theoretic approach, and prove that they converge to a Nash Equilibrium. We also present a security analysis on our sharding design, and prove that it resists adversaries who occupy at most 33% of the computation power. We have implemented our designs on go-Ethereum 1.8.0 and evaluated their performance using both real-world blockchain transactions and large-scale simulations. Our results show that throughp

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Structured Grid-based parallel Simulation of a Simple DEM Model on Heterogeneous Systems 26

Structured Grid-based Parallel Simulation of a Simple DEM Mo...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： De Rango, Alessio Napoli, Pietro D'Ambrosio, Donato Spataro, William Di Renzo, Alberto Di Maio, Francesco Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy Univ Calabria Dept Envir & Chem Engn Arcavacata Di Rende Italy

ISBN: (纸本)9781538649756

Here we present different preliminary parallel grid-based implementations of a simple particle system with the purpose to evaluate its performances on multi-and many-core computational devices. The system is modeled by means of the Discrete Element Method and the Extended Cellular Automata formalism, while OpenMP and OpenCL are used for parallelization. In particular, both the 3.1 and 4.5 OpenMP specifications have been considered, the latter also able to run on many-core computational devices like GPUs. The results of a first test simulation performed by considering a cubic domain with about 316,000 particles have shown a clear advantage of OpenCL on the considered Tesla K40 Nvidia GPU, while the OpenMP 3.1 implementation has performed better than the corresponding OpenMP 4.5 on the considered Intel Xeon E5-2650 16-thread CPU.

关键词： Discrete Element Method Cellular Automata OpenMP OpenCL Heterogeneous Computing

来源：评论

学校读者我要写书评

暂无评论

Solving sparse triangular linear systems in modern GPUs: a Synchronization-Free algorithm 26

Solving sparse triangular linear systems in modern GPUs: a S...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Dufrechou, Ernesto Ezzatti, Pablo Univ Republica Inst Computac Montevideo Uruguay

ISBN: (纸本)9781538649756

Sparse triangular linear systems are ubiquitous in a wide range of science and engineering fields, and represent one of the most important building blocks of Sparse Numerical Lineal Algebra methods. For this reason, their parallel solution has been subject of exhaustive study, and efficient implementations of this kernel can be found for almost every hardware platform. However, the strong data dependencies that serialize a great deal of the execution and the load imbalance inherent to the triangular structure poses serious difficulties for its parallel performance, specially in the context of massively-parallel processors such as GPUs. To this day, the most widespread GPU implementation of this kernel is the one distributed in NVIDIA CUSPARSE library, which relies on a preprocessing stage to determine the parallel execution schedule. Although the solution phase is highly efficient, this strategy pays the cost of constant synchronizations with the CPU. In this work, we present a synchronization-free GPU algorithm to solve sparse triangular linear systems for the CSR format. The experimental evaluation shows performance improvements over CUSPARSE and a recently proposed synchronization-free method for the CSC matrix format.

关键词： Sparse triangular linear systems synchronization-free methods graphics processors (GPUs)

来源：评论

学校读者我要写书评

暂无评论

Closed-form Solutions for Dense Matrix-Matrix Multiplication on Heterogeneous Platforms using Divisible Load Analysis 26

Closed-form Solutions for Dense Matrix-Matrix Multiplication...

引用

26th euromicro International conference on parallel, distributed, and network-based processing (PDP)

作者： Barlas, Gerssimos El Hiny, Lamees Amer Univ Sharjah Comp Sci & Engn Dept Coll Engn Sharjah U Arab Emirates

ISBN: (纸本)9781538649756

In this paper we analytically solve the partitioning problem for performing matrix multiplication on a cluster of heterogeneous multicore machines, equipped with an accelerator, typically a GPU. We derive closed-form solutions that not only solve the problem in an exact manner, but they also allow for predictive analysis that can guide system design. Our work allows an optimum partitioning to be calculated in linear time with respect to the number of cores in the system. The static partitioning afforded by our Divisible Load Theory (DLT) based analysis, minimizes communication overhead and improves efficiency. Our work leverages existing optimized Dense Linear Algebra (DLA) libraries, such as cuBLAS and BLAS, which translates to an easy deployment that can readily exploit state-of-the-art tools. A comparison study concludes the paper, highlighting the beneficial effect of our partitioning approach.

关键词： GPU computing dense linear algebra heterogeneous parallel computing hybrid numerical computation divisible load theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共434页 << < 112 113 114 115 116 117 118 119 120 121 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：