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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,949 篇 会议
100 篇 期刊文献
21 册 图书

馆藏范围

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

日期分布

学科分类号

1,973 篇 工学
- 1,899 篇 计算机科学与技术...
- 868 篇 软件工程
- 297 篇 电气工程
- 280 篇 信息与通信工程
- 98 篇 控制科学与工程
- 69 篇 电子科学与技术（可...
- 54 篇 网络空间安全
- 29 篇 机械工程
- 27 篇 动力工程及工程热...
- 19 篇 安全科学与工程
- 16 篇 仪器科学与技术
- 16 篇 建筑学
- 16 篇 交通运输工程
- 16 篇 环境科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 土木工程
- 15 篇 生物工程
- 12 篇 光学工程
- 9 篇 力学（可授工学、理...
- 9 篇 测绘科学与技术
408 篇 理学
- 338 篇 数学
- 53 篇 统计学（可授理学、...
- 44 篇 系统科学
- 31 篇 物理学
- 18 篇 生物学
- 13 篇 化学
357 篇 管理学
- 307 篇 管理科学与工程(可...
- 115 篇 工商管理
- 68 篇 图书情报与档案管...
19 篇 经济学
- 18 篇 应用经济学
8 篇 医学
7 篇 法学
7 篇 农学
5 篇 教育学
3 篇 文学

主题

682 篇 parallel process...
547 篇 distributed proc...
480 篇 application soft...
411 篇 distributed comp...
404 篇 concurrent compu...
305 篇 computational mo...
301 篇 computer archite...
292 篇 computer science
254 篇 hardware
207 篇 parallel program...
186 篇 runtime
180 篇 parallel process...
176 篇 processor schedu...
158 篇 scalability
158 篇 grid computing
155 篇 resource managem...
152 篇 costs
145 篇 libraries
137 篇 high performance...
123 篇 distributed data...

机构

15 篇 school of cyber ...
13 篇 institute of inf...
12 篇 school of comput...
11 篇 school of comput...
11 篇 oak ridge nation...
11 篇 oak ridge natl l...
10 篇 shanghai jiao to...
10 篇 university of ch...
10 篇 mathematics and ...
9 篇 argonne natl lab...
9 篇 department of co...
9 篇 college of compu...
9 篇 college of compu...
8 篇 chinese acad sci...
8 篇 sandia national ...
8 篇 argonne national...
8 篇 department of co...
8 篇 department of co...
8 篇 department of co...
8 篇 tokyo institute ...

作者

14 篇 minyi guo
11 篇 jack dongarra
11 篇 sun xian-he
9 篇 h. casanova
9 篇 wang yijie
9 篇 a. choudhary
8 篇 dongarra jack
8 篇 yijie wang
8 篇 casanova henri
8 篇 david a. bader
7 篇 bader david a.
7 篇 yang laurence t.
7 篇 p. sadayappan
7 篇 antoniu gabriel
7 篇 guo minyi
7 篇 hai jin
7 篇 labarta jesus
7 篇 wolf felix
7 篇 buluc aydin
7 篇 kalé laxmikant v...

语言

4,058 篇 英文
6 篇 其他
6 篇 中文

检索条件"任意字段=International Symposium on Parallel and Distributed Processing with Applications, ISPA"

共 4070 条记录，以下是101-110 订阅

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

详细简洁

排序：

A Novel parallel Image Encryption Scheme Using Chaos 15

A Novel Parallel Image Encryption Scheme Using Chaos

引用

15th IEEE international symposium on parallel and distributed processing with applications (ispa) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Fu, Chong Zhang, Gao-yuan Zhu, Mai Cong, Li-ying Lei, Wei-min Northeastern Univ Sch Comp Sci & Engn Shenyang 110004 Liaoning Peoples R China

ISBN: (纸本)9781538637906

In recent years, chaos-based image cipher has been widely studied and a growing number of schemes based on permutation-substitution architecture have been proposed. To better meet the challenge of real-time secure image communication applications, this paper suggests a new image encryption scheme using a parallel substitution. In the permutation stage, the Arnold cat map is employed to shuffle the pixel positions so as to erase the strong relationship between adjacent pixels. In the substitution stage, the scrambled image is firstly decomposed into eight bit-planes which are then parallelly mixed with keystreams generated by the chaotic logistic map. Theoretically, the parallel substitution strategy runs eight times faster than the serial strategy on an 8-thread processor as the volume of data processed by each substitution unit is 1/8 of that of the input image. Experimental results show that the proposed parallel scheme runs more than five times faster than the serial scheme. Extensive security analysis is carried out with detailed analysis, demonstrating the satisfactory security of the proposed scheme.

关键词： image cipher Arnold cat map parallel substitution bit-plane logistic map

来源：评论

学校读者我要写书评

暂无评论

Formal Modeling and Verification of Scalable Process-aware distributed IoT applications 17

Formal Modeling and Verification of Scalable Process-aware D...

引用

IEEE Int Conf on parallel and distributed processing with applications, Big Data and Cloud Computing, Sustainable Computing and Communications, Social Computing and Networking (ispa/BDCloud/SocialCom/SustainCom)

作者： Jain, Rakesh Klai, Kais Tata, Samir IBM Almaden Res Ctr San Jose CA 95120 USA Univ Paris 13 CNRS UMR 7030 LIPN Villetaneuse France LG Silicon Valley Lab Santa Clara CA USA

ISBN: (纸本)9781728143286

IoT applications are distributed over multiple IoT computing and communicating resources across the network including but not limited to small devices, machines, and public clouds. These IoT applications are composed of clearly separated and communicating fragments that can be modeled as large scale business processes. Process fragments can be unique, deployed in one location such as the cloud. They can also be replicated over multiple locations, such as different rooms in a smart building. Formal modeling and verification of such business processes composed of replicated fragments is a challenging task. In this paper we present a formal approach of modeling and verification of IoT applications that takes into account the scalability and repeatability properties of process-aware IoT applications. We propose a concise way of modeling and a general framework for the verification that simplifies the burden of IoT application modeling and deployment.

关键词： Internet of Things Colored Petri Nets Business Process distributed Deployment Node-RED Formal Method

来源：评论

学校读者我要写书评

暂无评论

PANDA: Population Automatic Neural distributed Algorithm for Deep Leaning 19

PANDA: Population Automatic Neural Distributed Algorithm for...

引用

19th IEEE international symposium on parallel and distributed processing with applications (IEEE ispa)

作者： Wei, Jia Zhang, Xingjun Ji, Zeyu Li, Jingbo Wei, Zheng Xi An Jiao Tong Univ High Peiformance Comp Lab Xian Peoples R China

ISBN: (纸本)9781665435741

Deep neural network models perform very brightly in the field of artificial intelligence, but their success is affected by hyperparameters, and the learning rate schedule is one of the most important hyperparameters, and the search for the learning rate schedule is often time-consuming and computationally resource-intensive. In this paper, we propose a Population Automatic Neural distributed Algorithm (PANDA) based on population joint optimization, which uses distributed data parallel deep neural network training to implement a dynamic learning rate schedule optimization strategy based on the population idea, with almost no loss of test accuracy, PANDA is able to dynamically refine the learning rate schedule during model training instead of following the usual suboptimal strategy. We conducted experiments on typical AlexNet, VGG16, and ResNet18 using the Tianhe-3 supercomputing prototype, and the results show that using PANDA to dynamically update the learning rate greatly reduces the learning rate schedule search time while ensuring close performance with the latest population hyperparameter algorithm, and in our experiments, PANDA lead to at max 123.85x speedup, and the experimental results prove the effectiveness and robustness of PANDA.

关键词： Deep Learning distributed Training Hyperparameter Search Data parallel Population Algorithm Learning Rate Search

来源：评论

学校读者我要写书评

暂无评论

Extend PBFT Protocol with L-DAG 19

Extend PBFT Protocol with L-DAG

引用

19th IEEE international symposium on parallel and distributed processing with applications (IEEE ispa)

作者： Song, Anping Dai, Yi Ji, Ruyi Song, Ziheng Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China Univ Illinois Coll Engn Champaign IL 61820 USA Univ Illinois Coll Engn Urbana IL 61820 USA

ISBN: (纸本)9781665435741

The linear structure of blockchain ensures data security and credibility. But at the same time, it has become the performance bottleneck of the entire system, limiting the growth of the transaction processing rate. The inherent concurrency of directed acyclic graph (DAG) technology solves these problems, but it also brings new problems: blocks total order and ledger consistency. In this paper, we propose a Layer-based DAG (L-DAG) blockchain, which avoids the complex total ordering algorithms by keeping blocks in order between and within layers during the generation process. And we introduce the proportional-integral-derivative (PID) controller to dynamically control the width of layers by using in-degree and out-degree of blocks to achieve the consistency of ledger. We extend Practical Byzantine Fault Tolerance (PBFT) protocol in parallel based on the L-DAG structure and successfully apply it to consortium blockchain scenarios. The L-DAG blockchain structure is implemented through Hyperledger Fabric. Experimental results show that as the number of consensus threads increases, the TPS of L-DAG-based PBFT can grow with near-linear efficiency.

关键词： L-DAG Width control In/Out-degree parallel consensus Proportional-integral-derivative controller

来源：评论

学校读者我要写书评

暂无评论

Task Tree Partition and Subtree Allocation for Heterogeneous Multiprocessors 19

Task Tree Partition and Subtree Allocation for Heterogeneous...

引用

19th IEEE international symposium on parallel and distributed processing with applications (IEEE ispa)

作者： He, Suna Wu, Jigang Wei, Bing Wu, Jiaxin Guangdong Univ Technol Sch Comp Sci & Technol Guangzhou 510006 Peoples R China

ISBN: (纸本)9781665435741

Tree-shaped task graphs become a paradigm to be utilized in distributed platform for various computational domains, such as the electronic structure calculations and the factorization of sparse matrices. However, the scheduling of the tree-shaped task graph has been rarely studied for the more realistic heterogeneous multiprocessor platform (HEMP). This paper proposes an efficient algorithm named Partition-Allocation (PA) for parallel computing on HEMP with limited memory. Algorithm PA consists of two stages: partitioning and allocation. In the partitioning stage, a task tree is split into several subtrees. In the allocation stage, these subtrees are assigned to different processors for execution. Our algorithm PA can reduce makespan by prioritizing subtrees on the critical path, both in the partitioning and in the allocation. Based on randomly generated trees and real-world dataset, experimental results show that the proposed PA is significantly better than the latest work in terms of average makespan. The proposed algorithm can successfully reduce the average makespan by up to 67.01% on real-world dataset, and 52.35% on randomly generated trees.

关键词： parallel computing task scheduling tree partitioning heterogeneous multiprocessor platform critical path

来源：评论

学校读者我要写书评

暂无评论

Optimization of the parallel semi-Lagrangian scheme in the YHGSM based on the adaptive maximum wind speed 19

Optimization of the parallel semi-Lagrangian scheme in the Y...

引用

19th IEEE international symposium on parallel and distributed processing with applications (IEEE ispa)

作者： Liu, Dazheng Wu, Jianping Jiang, Tao Wang, Yingjie Pan, Xiaotian Li, Penglun Natl Univ Def Technol Coll Meteorol & Oceanog Changsha Peoples R China Natl Univ Def Technol Coll Comp Sci & Technol Changsha Peoples R China

ISBN: (纸本)9781665435741

The Yin-He global spectral model (YHGSM), embodies a parallel semi-Lagrangian solver and has two schemes implemented: maximum wind speed scheme and on-demand communication scheme. Maximum wind speed communication adopts a single and fixed data structure, which has a large communication overhead. Although the overhead of on-demand communication is reduced, it is still pretty huge. In this paper, a novel adaptable approach is proposed in which a monthly maximum wind speed is used in the YHGSM. This approach reduces the difference between the actual wind speed and the maximum wind speed used in the model;in turn, the communication overhead in the trajectory computation is further reduced. Experiments show that in the maximum wind speed scheme and on-demand schemes, the communication overheads with the adaptive maximum wind speed are significantly reduced. In addition, in a ten-day forecast with the on-demand communication scheme, the total overhead for the semi-Lagrangian computing and the total parallel execution time are also both reduced, and the reduction ratio increases as the number of nodes increases.

关键词： numerical weather prediction parallel semi-Lagrangian scheme maximum wind speed communication overhead

来源：评论

学校读者我要写书评

暂无评论

distributed Anomaly Detection Algorithm for Spatio-Temporal Trajectories of Vehicles 15

Distributed Anomaly Detection Algorithm for Spatio-Temporal ...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ispa) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Lu, Liping Cheng, Hao Xiong, Shengwu Duan, Pengfei Xiao, Yuan Wuhan Univ Technol Sch Comp Sci & Technol Wuhan 430070 Hubei Peoples R China Wuhan Univ Technol Hubei Key Lab Transportat Internet Things Wuhan 430070 Hubei Peoples R China

ISBN: (纸本)9781538637906

With extensive use of Internet of Vehicle (IoV) technologies in vehicle traffic management, real-time analysis of vehicle behavior trajectories is of great significance to the assessment of traffic conditions and the avoidance of abnormal conditions. This paper presents a solution which can efficiently deal with real-time streaming data of trajectory and excavate temporal and spatial abnormal information. In order to represent the local feature information of the trajectory and solve the problem of large loss of information in the feature point extraction algorithm, a trajectory partitioning strategy based on multi-motion feature and a similarity measure method based on trajectory structure are proposed. And based on the proposed strategy and method, a distributed clustering algorithm is designed for streaming trajectories to improve the efficiency of clustering algorithm. In order to solve the problem of massive calculation of distance and neighborhood density in trajectory anomaly detection algorithm, the data set is pruned by track clustering results, and the efficiency of the algorithm increases the real-time performance of abnormal trajectory detection.

关键词： spatio-temporal trajectory division trajectory similarity measure distributed trajectory clustering

来源：评论

学校读者我要写书评

暂无评论

distributed Fine-Grained Secure Control of Smart Actuators in Internet of Things 15

Distributed Fine-Grained Secure Control of Smart Actuators i...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ispa) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Kouicem, Djamel Eddine Bouabdallah, Abdelmadjid Lakhlef, Hicham Univ Technol Compiegne Sorbonne Univ HEUDIASYC UMR 7253 CNRS CS 60319 F-60203 Compiegne France

ISBN: (纸本)9781538637906

Internet of Things is a new emerging technology that promises a new era of Internet through encompassing seamlessly physical and digital worlds in one single intelligent ecosystem. This goal is achieved by interconnecting a large number of smart objects from the physical word such as smartphones, sensors, robots, connected cars, etc., to Internet. Nowadays, with the advent of Internet of Things, we need efficient mechanisms to remotely control IoT smart actuators by users and controllers using smartphones and IoT devices. This arises particularly in industrial Cyber-Physical Systems to supervise industrial processes. However, the complex environment of IoT systems makes this task very difficult to achieve regarding the number of connected objects and their resource limitation. In this paper, we tackle the problem of remote secure control of IoT actuators. We propose a distributed lightweight fine-grained access control based on Attribute Based Encryption mechanism and one way hash chain. We conducted security analysis and formal verification using AVispa. The results demonstrated that our scheme is secure against various attacks. Moreover, the simulation results demonstrated the scalability and the efficiency of our solution, which saves substantially energy consumption and computation costs.

关键词： Secure control Internet of Things Attribute Based Encryption Smart Actuators

来源：评论

学校读者我要写书评

暂无评论

An Immune-based Optimization Algorithm of Multi-tenant Resource Allocation for Geo-distributed Data Centers 15

An Immune-based Optimization Algorithm of Multi-tenant Resou...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ispa) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Song, Yazhen Peng, Jun Liu, Weirong Zhang, Xiaoyong Gu, Xin Yu, Wentao Cent S Univ Sch Informat Sci & Engn Changsha Hunan Peoples R China Cent South Univ Forestry & Technol Coll Comp & Informat Engn Changsha Hunan Peoples R China Hunan Engn Lab Rail Vehicles Braking Technol Changsha Hunan Peoples R China

ISBN: (纸本)9781538637906

In recent years, the global data center industry has entered a large-scale planning and construction stage, bringing huge power consumption and high operating costs. In this paper, a multi-tenant resource allocation optimization model for geo-distributed data centers is proposed to reduce the energy consumption and operating costs of cloud providers. Firstly, the resource allocation model is constructed by considering the heterogeneous electricity prices of geo-distributed data centers. Then an immune-based algorithm is proposed to solve the allocation optimization problem with variable users' demand. The biological immune system is a highly parallel, distributed, self-adaptive and self-organizing system with a strong ability to learn, recognize, and memory. It searches for the optimal resource allocation scheme with low computational complexity. Extensive simulations driven by large-scale parallel Workloads Archive demonstrate the feasibility and performance of our immune-based optimization algorithm.

关键词： Multi-tenant geo-distributed data centers electricity price heterogeneity immune algorithm

来源：评论

学校读者我要写书评

暂无评论

Graph-based Quantum parallel Teleportation in Quantum Wireless Multi-hop Networks 15

Graph-based Quantum Parallel Teleportation in Quantum Wirele...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ispa) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Qi, Huamei Xiao, Tailong Guo, Ying Cent S Univ Informat Sci & Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781538637906

Motivated by multi-particle entanglement, we propose a multi-party quantum parallel teleportation scheme in quantum wireless multi-hop networks (QWMNs) investigated with four-vertex graph-based entanglement. We show an arbitrary single-qubit quantum teleportation with graph state between directly connected two-party and an arbitrary two-qubit quantum teleportation based on four-vertex graph state followed by the multi-parity quantum teleportation based on four-vertex graph state where source node do not need share any entangled pairs with destination node but via intermediate nodes' quantum swapping to finish the teleportation. Source node and intermediate nodes conduct von Neumann measurement and transmit their classical outcomes to the destination node independently in a parallel manner. Then destination node applies appropriate unitary operation to recover the source quantum state according to the received outcomes. This graph-based scheme extends the entanglement pattern in quantum teleportation, provides a perfect multi-party teleportation model. The proposed scheme improves the constructing flexibility of the network and reduces the communication delay, which has a wide application in quantum route selection.

关键词： Quantum teleportation Four-vertex graph state Quantum multi-hop communication

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共407页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：