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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1111-1120 订阅

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

详细简洁

排序：

A new execution model for improving performance and flexibility of CAPE 26

A new execution model for improving performance and flexibil...

引用

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

作者： Van Long Tran Renault, Eric Xuan Huyen Do Viet Hai Ha Univ Paris Saclay CNRS SAMOVAR Telecom SudParis 9 Rue Charles Fourier F-91011 Evry France Hue Ind Coll Hue Vietnam Hue Univ Coll Sci Hue Vietnam Hue Univ Coll Educ Hue Vietnam

ISBN: (纸本)9781538649756

Checkpointing-Aided parallel Execution (CAPE) is a framework that is based on checkpointing technique and serves to automatically translates and execute OpenMP programs on distributed-memory architectures. Through some comparisons with MPI, CAPE has demonstrated high-performance and the potential for fully compatibility with OpenMP on distributed-memory systems. However, there is still a long way to improve the performance, flexibility, portability and capability. This paper presents the new execution model for CAPE that improves its performance and makes CAPE even more flexible.

关键词： CAPE Checkpointing OpenMP HPC distributed Computing parallel computing

来源：评论

学校读者我要写书评

暂无评论

HTtext: A TextCNN-based pre-silicon detection for hardware Trojans

HTtext: A TextCNN-based pre-silicon detection for hardware T...

引用

IEEE International conference on Big Data and Cloud Computing (BdCloud)

作者： Yi Xu Zhenyi Chen Binhong Huang Ximeng Liu Chen Dong College of Computer and Data Science Fuzhou University Fuzhou China University of South Floride Tampa USA Key Lab of Information Security of Network Systems (Fuzhou University) Fujian Key Laboratory of Network Computing and Intelligent Information Processing (Fuzhou University)

With the advent of the intelligence era, the usage and investment for chips have risen year by year, causing the demand for chip security. Machine learning (ML) analysis has made progress as a pre-silicon hardware Trojan (HT) detection technology. Whereas the performance of existing methods almost relies on the accuracy of multi-feature representation, moreover, it is difficult to extract features manually and easily cause unstable classifier performance (namely uncertainty). In this paper, an automatic feature extraction detecting model is first proposed, named HTtext, which generates simple path sentences from chip netlists and employs TextCNN, a deep learning algorithm, to distinguish HT circuits. The pre-training for TextCNN only uses the automatic single-feature calculation to avoid the uncertainty problem. Additionally, the model can obtain non-repetitive HT component information expression, which satisfies the stable detection performance. To measure the efficiency and balance of the model, the paper proposes the concept of the Stability Efficiency Index (SEI). In the experimental results for the benchmark netlists, not only the average accuracy (ACC) in TextCNN is as high as 99.26%, but also its SEI value ranks first in all comparison classifiers, which proves that the proposed HTtext model has high stability in generality.

关键词： Ports (computers) Semiconductor device measurement Uncertainty Stability criteria Feature extraction Hardware Circuit stability

来源：评论

学校读者我要写书评

暂无评论

Using Dynamic Broadcasts to Improve Task-based Runtime Performances 26th

Using Dynamic Broadcasts to Improve Task-Based Runtime Perfo...

引用

26th International conference on parallel and distributed Computing (Euro-Par)

作者： Denis, Alexandre Jeannot, Emmanuel Swartvagher, Philippe Thibault, Samuel Inria Bordeaux Sud Ouest F-33405 Talence France Univ Bordeaux LaBRI F-33405 Talence France

ISBN: (纸本)9783030576752;9783030576745

Task-based runtimes have emerged in the HPC world to take benefit from the computation power of heterogeneous supercomputers and to achieve scalability. One of the main bottlenecks for scalability is the communication layer. Some task-based algorithms need to send the same data to multiple nodes. To optimize this communication pattern, libraries propose dedicated routines, such as MPI_Bcast. However, MPI_Bcast requirements do not fit well with the constraints of task-based runtime systems: it must be performed simultaneously by all involved nodes, and these must know each other, which is not possible when each node runs a task scheduler not synchronized with others. In this paper, we propose a new approach, called dynamic broadcasts to overcome these constraints. The broadcast communication pattern required by the task-based algorithm is detected automatically, then the broadcasting algorithm relies on active messages and source routing, so that participating nodes do not need to know each other and do not need to synchronize. Receiver receives data the same way as it receives point-to-point communication, without having to know it arrives through a broadcast. We have implemented the algorithm in the STARPU runtime system using the NEWMADELEINE communication library. We performed benchmarks using the CHOLESKY factorization that is known to use broadcasts and observed up to 30% improvement of its total execution time.

关键词： Task-based runtime systems Communications Collective Broadcast

来源：评论

学校读者我要写书评

暂无评论

A Decentrlized Trading Model based on Public Blockchain with Regulatable Bi-Tierred Identities

A Decentrlized Trading Model Based on Public Blockchain with...

引用

IEEE International conference on Big Data and Cloud Computing (BdCloud)

作者： Hongbo Li Tao Xie Jin Xie National University of Defense Technology NUDT Changsha China Peking University Beijing China

Traditional network trading platforms process transactions and store data on their centralized servers. Usually, users deem them as the third parties worth to be trusted, while exploitations and leaks of user privacy never cease. Emerging cryptocurrency systems based on blockchains provide a P2P trading model in a decentralized way, avoiding many problems inherent in traditional centralized platforms. However, the intrinsic anonymity makes it hard to trace identities and regulate the blockchain system when something goes wrong with the transactions, always causing financial losses to *** this paper, we propose a blockchain trading prototype based on a traceable two-tier identity structure, which combines a personal CA-based identity with anonymous addresses to enable appealings without centrally keeping transaction data, hence protecting privacy and regulating transactions simultaneously. We develop an off-chain transaction confirmation protocol and build an on-chain regulatory agency based on smart contracts. The separation of the on-chain part from the off-chain part makes it suitable to be deployed in many cryptocurrency system that supports smart contracts. Experiments show that all the transaction data can be stored by users themselves and the regulatory agency still works independently. A security analysis on the supervision smart contract is also made. We recommend this model to be an alternate to the traditional centralized electronic business, if privacy preserving and regulations are both considered.

关键词： Privacy Data privacy Smart contracts Prototypes Regulation Blockchains Cryptocurrency

来源：评论

学校读者我要写书评

暂无评论

Improving availability in distributed tuple spaces via sharing abstractions and replication strategies 26

Improving availability in distributed tuple spaces via shari...

引用

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

作者： Buravlev, Vitaly De Nicola, Rocco Lafuente, Alberto Lluch Mezzina, Claudio Antares IMT Sch Adv Studies Lucca Lucca Italy Tech Univ Denmark Lyngby Denmark

ISBN: (纸本)9781538649756

Data availability is a key aspect of modern distributed systems. We discuss an extension of coordination languages based on tuple spaces with programming abstractions for sharing data and guaranteeing availability with different consistency guarantees. Data can be spread over the system according to user-specified replica placement strategies and user-specified consistency requirements. The framework takes care then of low-level management of the replicas, so that the programmer can just focus on the business logic of the application. We advocate that the proposed programming primitives are beneficial for data-oriented applications where different kinds of data may have different needs in terms of availability and consistency.

关键词： tuple space dynamic replication data consistency network

来源：评论

学校读者我要写书评

暂无评论

Geo-distributed BigData processing for Maximizing Profit in Federated clouds environment 26

Geo-distributed BigData Processing for Maximizing Profit in ...

引用

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

作者： Gouasmi, Thouraya Louati, Wajdi Kacem, Ahmed Hadj Univ Sfax ReDCAD Lab Sfax Tunisia

ISBN: (纸本)9781538649756

Managing and processing BigData in geo-distributed datacenters gain much attention in recent years. Despite the increasing attention on this topic, most efforts have been focused on user-centric solutions, and unfortunately much less on the difficulties encountered by Cloud providers to improve their profits. Highly efficient framework for geo-distributed BigData processing in cloud federation environment is a crucial solution to maximize profit of the cloud providers. The objective of this paper is to maximize the profit for cloud providers by minimizing costs and penalty. This work proposes to transfer compute (computations) to geo-distributed data and outsourcing only the desired data to idles resources of federated clouds in order to minimize job costs;and proposes a jobs reordering dynamic approach to minimize the penalties costs. The performance evaluation proves that our proposed algorithm can maximize profit, reduce the MapReduce jobs costs and improve utilization of clusters resources.

关键词： Federated clouds Geo-distributed MapReduce Profit Maximizing

来源：评论

学校读者我要写书评

暂无评论

Memory-aware tree partitioning on homogeneous platforms 26

Memory-aware tree partitioning on homogeneous platforms

引用

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

作者： Gou, Changjiang Benoit, Anne Marchal, Loris Ecole Normale Super Lyon Lab LIP Lyon France ECNU Shanghai Peoples R China

ISBN: (纸本)9781538649756

Scientific applications are commonly modeled as the processing of directed acyclic graphs of tasks, and for some of them, the graph takes the special form of a rooted tree. This tree expresses both the computational dependencies between tasks and their storage requirements. The problem of scheduling/traversing such a tree on a single processor to minimize its memory footprint has already been widely studied. Hence, we move to parallel processing and study how to partition the tree for a homogeneous multiprocessor platform, where each processor is equipped with its own memory. We formally state the problem of partitioning the tree into subtrees such that each subtree can be processed on a single processor and the total resulting processing time is minimized. We prove that the problem is NP-complete, and we design polynomial-time heuristics to address it. An extensive set of simulations demonstrates the usefulness of these heuristics. © 2018 IEEE.

关键词： memory aware parallel processing tree partitioning

来源：评论

学校读者我要写书评

暂无评论

An Event-based Architecture for Cross-Breed Multi-population Bio-inspired Optimization Algorithms 1

引用

23rd European International conference on the Applications of Evolutionary Computation (EvoApplications) Held as Part of EvoStar conference

作者： Minguela, Erick Garcia-Valdez, J. Mario Guervos, Juan Julian Merelo Inst Tecnol Tijuana Tijuana BC Mexico Univ Granada Granada Spain

ISBN: (数字)9783030437220

ISBN: (纸本)9783030437213;9783030437220

Multi-population methods can combine multiple algorithms, with different parameters, interacting with each other at the same time. For instance, a genetic algorithm could find a promising global solution that is not optimal while another algorithm, more suitable for a local search, finds the global optimum. This approach has been followed extensively in recent years, with success. Moreover, there is a need for frameworks, architectures, and implementation models that can allow researchers the development of new parallel, asynchronous, heterogeneous, and parameter-free algorithms in a scalable way. In this work, we present an event-driven architecture, designed to distribute the processing of population-based algorithms asynchronously. The search algorithm uses a multi-population approach, creating multiple populations with different parameters of execution, allowing the implementation of multiple algorithms. In this work, we cross-breed Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO). Experiments show that the framework allows the combined algorithms outperform, with a high probability, single-algorithm versions. The framework we provide also has few parameters to tune since single-algorithm parameters are selected randomly;in general, this will boost the diversity of every algorithm by itself.

关键词： Multi-population Asynchronous Sub-population Serverless distributed Cross-breed multi-population

来源：评论

学校读者我要写书评

暂无评论

parallelization of security event correlation based on accounting of event type links 26

Parallelization of security event correlation based on accou...

引用

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

作者： Kotenko, Igor Fedorchenko, Andrey Saenko, Igor Kushnerevich, Alexey Russian Acad Sci SPIIRAS St Petersburg Inst Informat & Automat St Petersburg Russia ITMO Univ St Petersburg Natl Res Univ Informat Technol Mech St Petersburg Russia

ISBN: (纸本)9781538649756

The paper proposes a novel approach to parallel data processing for solving security event correlation problems based on Big Data technologies. Different security event correlation methods and problems, as well as big data technologies applicable for security monitoring are considered. The main attention is paid to the problems of identifying the links between security event types and assessing the dependence of the link strength on event distribution in time. Implementation of correlation problem solutions on the Spark platform is described, and the results of experimental assessment of security event correlation processes are given.

关键词： security event correlation Pearson correlation coefficient SIEM system Big Data parallel data processing

来源：评论

学校读者我要写书评

暂无评论

O-TF and O-FTF, Optical Fault-Tolerant DCNs 26

O-TF and O-FTF, Optical Fault-Tolerant DCNs

引用

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

作者： Abadi, Saeedeh Akbari Rokn Koohi, Somayyeh Sharif Univ Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781538649756

Performance of a data center is a function of three features;bandwidth, latency, and reliability. By adopting optical technology in data center network, bandwidth increment, in addition to reduction of transmission latency and power consumption, is achieved. Unfortunately, fault tolerance of the optical networks has raised less attention so far. So in this paper, we propose a fault-tolerant, scalable, and high-performance optical architecture built upon previously proposed O-TF network, with the goal of redundancy optimization and reducing the minimum number of wavelength channels required for non-blocking functionality of the network. Moreover, reducing network diameter, in O-FTF network compared to O-TF and Wavecube networks, has led to higher network performance at the presence of network failures.

关键词： Optical interconnection network Data Center fault-tolerant non-blocking high-performance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共434页 << < 108 109 110 111 112 113 114 115 116 117 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：