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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,286 篇 会议
47 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

2,433 篇 工学
- 2,168 篇 计算机科学与技术...
- 1,079 篇 软件工程
- 608 篇 电气工程
- 586 篇 信息与通信工程
- 185 篇 仪器科学与技术
- 138 篇 控制科学与工程
- 119 篇 电子科学与技术（可...
- 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 篇 军事学

主题

545 篇 parallel process...
259 篇 computer archite...
240 篇 computational mo...
207 篇 distributed comp...
186 篇 concurrent compu...
180 篇 computer network...
164 篇 network topology
157 篇 hardware
157 篇 graphics process...
148 篇 routing
131 篇 bandwidth
124 篇 application soft...
120 篇 protocols
119 篇 neural networks
107 篇 scalability
104 篇 throughput
104 篇 multicore proces...
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,092 篇 英文
235 篇 其他
11 篇 中文
1 篇 乌克兰文

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

共 4336 条记录，以下是1161-1170 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Enabling Dynamic and Efficient Data Access Control in Cloud Computing based on Attribute Certificate Management and CP-ABE 26

Enabling Dynamic and Efficient Data Access Control in Cloud ...

引用

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

作者： Fugkeaw, Somchart Sato, Hiroyuki Thai Digital ID Co Ltd Bangkok Thailand Univ Tokyo Dept Elect Engn & Informat Syst Tokyo Japan

ISBN: (纸本)9781538649756

In this paper, we propose an access control model featured with the efficient key update function in data outsourcing environment. Our access control is based on the combination of Ciphertext Policy Attribute-based Encryption (CP-ABE) and Role-based Access Control (RBAC). The proposed scheme aims to improve the attribute and key update management of the original CP-ABE. In our scheme, a user's key is incorporated into the attribute certificate (AC) which will be used to decrypt the ciphertext encrypted with CP-ABE policy. If there is any change (update or revoke) of the attributes appearing in the key, the key in the AC will be updated upon the access request. This significantly reduces the overheads in updating and distributing keys of all users simultaneously compared to the existing CP-ABE based schemes. Finally, we conduct the experiment to evaluate the performance of our proposed scheme to show the efficiency of our proposed scheme.

关键词： access control attribute certificate CP-ABE key update performance

来源：评论

学校读者我要写书评

暂无评论

An Improved One-to-All Broadcasting in Higher Dimensional Eisenstein-Jacobi networks 26

An Improved One-to-All Broadcasting in Higher Dimensional Ei...

引用

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

作者： Hussain, Zaid Kuwait Univ Dept Comp Sci Kuwait Kuwait

ISBN: (纸本)9781538649756

Recently, a higher dimensional Eisenstein-Jacobi (EJ) networks, EJ(alpha)((n)), has been proposed in [22], which is shown that they have better average distance with more number of nodes than a single dimensional EJ networks. Some communication algorithms such as one-to-all and all-to-all communications are well known and used in interconnection networks. In one-to-all communication, a source node sends a message to every other node in the network. Whereas, in all-to-all communication, every node is considered as a source node and sends its message to every other node in the network. In this paper, an improved one-to-all communication algorithm in EJ(alpha)((n)) networks is presented. The paper shows that the proposed algorithm achieves a lower average number of steps to receiving the broadcasted message. In addition, since the links are assumed to be half-duplex, the all-to-all broadcasting algorithm is divided into three phases. The simulation results are discussed and showed that the improved one-to-all algorithm achieves better traffic performance than the well-known one-to-all algorithm and has 2.7% less total number of senders.

关键词： parallel Computing Interconnection network Eisenstein-Jacobi network Broadcast Traffic Distribution One-to-All All-to-All

来源：评论

学校读者我要写书评

暂无评论

Multi-Path Forwarding Strategy for Named Data networking based on Pending Interests and Available Bandwidth

Multi-Path Forwarding Strategy for Named Data Networking Bas...

引用

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

作者： Shanshan Shi Jun Li Bin Han Haibo Wu Yuxiang Ma Qian Dong Hans D. Schotten Computer Network Information Center Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Technische Universität Kaiserslautern Kaiserslautern Germany School of Computer and Information Engineering Henan University Kaifeng China School of electronic information engineering Foshan university Foshan China

Named Data networking (NDN) is a new Internet architecture, and it focuses on the content or name rather than the location or address. One-to-many communication has become the main feature of NDN networks. Therefore, forwarding strategy plays an important role in the content delivery performance enhancement of NDN networks. Most existing schemes tend to consider one or two metrics of different faces, such as round trip time(RTT), pending Interests (PI) and bandwidth (BW). Such single-metric or dual-metric designs usually lower accuracy in characterizing path performance. In addition, the Data packet can carry rich performance information of the path it passes through, which is more powerful than estimating the path performance on the local interface. To this end, we propose a multi-path forwarding strategy named PIBW, considering multiple metrics including PI, available BW, etc. We implement PIBW and conduct performance evaluations based on ndnSIM. Simulation evaluation shows that PIBW outperforms baseline solutions in terms of throughput, link bandwidth utilization and convergence time.

关键词： Performance evaluation Adaptive systems Simulation Estimation Bandwidth Throughput Real-time systems

来源：评论

学校读者我要写书评

暂无评论

The multi-layer graph based technique for proactive automatic response against cyber attacks 26

The multi-layer graph based technique for proactive automati...

引用

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

作者： Doynikova, Elena Kotenko, Igor Russian Acad Sci SPIIRAS St Petersburg Inst Informat & Automat Lab Comp Secur Problems St Petersburg Russia ITMO Univ Int Lab Cyber Phys Secur St Petersburg Natl Res Univ Informat Technol Mech St Petersburg Russia

ISBN: (纸本)9781538649756

The paper evolves an approach for proactive automatic cyber security incident response. The approach is based on usage of data from open sources, analytical modeling and a hierarchical integrated set of heterogeneous security metrics. The paper outlines the features of the analytical models that are crucial for countermeasure selection. It determines a set of security metrics for countermeasure selection. The algorithms that implement the suggested multi layer countermeasure selection technique are specified. Introduction of the layers allows getting the result at any time with the maximum accuracy depending on the available data. The experiments that demonstrate the efficiency of the suggested technique are outlined.

关键词： response against cyber attacks countermeasures security metrics attack graph service dependency graph security incidents

来源：评论

学校读者我要写书评

暂无评论

Multi-path Routing Deployment Method based on SRv6

Multi-path Routing Deployment Method Based on SRv6

引用

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

作者： Lihua Song Yuzhu Jin Pengyu Wang Dongchao Ma Wenlong Chen Laizhong Cui College of Information Science North China University of Technology Beijing China College of Information Engineering Capital Normal University Beijing China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

The deployment of Software Defined Wide Area network (SD-WAN) architecture cannot be accomplished overnight. It is a good attempt to combine Segment Routing (SR) with the existing routing protocol. Multi-path routing can better meet the diverse needs of users. However, deploying multi-path routing will increase the number of Forwarding Information Base (FIB). This paper proposes takes two-Dimensional routing (TD) some strategies. Firstly, to address the increase of FIB in actual deployment, we propose a method for deploying TD routing in combination with SRv6 (TDSR), which can disperse FIB in some entry routers. Secondly, to address the bandwidth waste caused by the segment lists in the SRv6 header, we propose a compression algorithm (HCMD), based on the comparison of the Shortest Path First (SPF) and SRv6 path. Thirdly, we optimize the algorithm under various scenarios. The experimental results show that TDSR can reduce the number of TD Routing Information Base (RIB) by 69%, and the average compression rate of HCMD can reach 70%. Moreover, HCMD can also be combined with various existing compression methods to comprehensively improve the effect.

关键词： Wide area networks Computer architecture Bandwidth Routing Software Routing protocols Ribs

来源：评论

学校读者我要写书评

暂无评论

Coupled Self-Exciting Process for Information Diffusion Prediction

Coupled Self-Exciting Process for Information Diffusion Pred...

引用

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

作者： Yuyang Liu Yuxiang Ma Junruo Gao Zefang Zhao Jun Li Computer Network Information Center Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Computer and Information Engineering Henan University Kaifeng China

The forwarding behavior of each individual at microscopic level determines the final morphology of macroscopic cascades. Fully grasping the inner relationship between forwarding events is essential for understanding the intrinsic diffusion mechanisms, which has proven to offer decisive references in many applications, e.g., viral marketing and innovation diffusion. Conventional approaches generally constrain the occurrence of forwarding events to a specific priori based on expert experience. However, excessive parameterization will limit the learning ability of these models. As a typical stochastic process that can characterize the mutual excitation phenomenon, the Hawkes process merely assumes that the influence between users must satisfy the mode of "excitation first, then decay". In this paper, we propose the Coupled Self-Exciting Process (CoSEP) to achieve a generalized stochastic process for information diffusion prediction. Concretely, we design a coupling strategy based on the shifted Bi-LSTM, which simultaneously considers the instantaneous excitation generated by history and the subsequent evolution while modeling the change of intensity function corresponding to each participant. Extensive experiments on real-world datasets, Sina Weibo and Open Academic Graph 2.0, demonstrate that the proposed CoSEP significantly outperforms state-of-the-art approaches, suggesting the effectiveness of the coupled self-exciting process for social applications.

关键词： Couplings Technological innovation Microscopy Time series analysis Stochastic processes Morphology Grasping

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：