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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,500 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,573 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,571 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2573 条记录，以下是131-140 订阅

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

详细简洁

排序：

Parameter Servers Placement for distributed Deep Learning in Edge computing 19

Parameter Servers Placement for Distributed Deep Learning in...

引用

19th ieee international symposium on parallel and distributed processing with applications (ieee ISPA)

作者： Yan, Jiaquan Wu, Yalan Wu, Jigang Chen, Long Guangdong Univ Technol Sch Comp Sci & Technol Guangzhou Peoples R China

ISBN: (纸本)9781665435741

the architecture based on global-local parameter servers (PSs) is an appealing framework to accelerate the training of the global model in distributed deep learning. However, the accuracy and training time are influenced by the placement strategy of PSs in distributed deep learning, due to the adopted gradient descent methods and the heterogeneous computation and communication resources. therefore, this paper formulates a novel problem for placement strategy of PSs in the dynamic available storage capacity, with the objective of minimizing the training time of the distributed deep learning under the constraints of the storage capacity and the number of local PSs. then, we prove the NP-hardness of the proposed problem. To solve the problem, a parameter servers placement algorithm, followed by an adjustment algorithm, is proposed in this paper, by continuously making decisions for placement strategy of PSs to decrease the training time of the global model. Simulation results show that, the proposed combined algorithm performs better than existing works for all cases, in terms of the training time of global model. Moreover, the performance of the proposed algorithm is nearly close to that of brute-force approach, in terms of the training time of the global model.

关键词： Edge Computing distributed Deep Learning Parameter Server Placement

来源：评论

学校读者我要写书评

暂无评论

Flexible collective operations for distributed object groups 13th

引用

13th international parallel processing symposium, IPPS 1999 Held in Conjunction with the 10th symposium on parallel and distributed processing, SPDP 1999

作者： Nolte, Jörg GMD FIRST Rudower Chaussee 5 BerlinD-12489 Germany

ISBN: (纸本)3540658319

Collective operations on multiple distributed objects are a powerful means to coordinate parallel computations. In this paper we present an inheritance based approach to implement parallel collective operations on distributed object groups. Object groups are described as reusable application-specific classes that coordinate both operation propagation to group members as well as the global collection (reduction) of the computed results. thus collective operations can be controlled by applications using language-level inheritance mechanisms. Existing group classes as well as global coordination patterns can therefore effectively be reused. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Jobcast - parallel and distributed processing framework Data processing on a cloud style KVS database

Jobcast - Parallel and distributed processing framework Data...

引用

12th ieee/IPSJ international symposium on applications and the Internet (SAINT) / ieee Annual Signature Conference on Computer Software and applications (COMPSAC)

作者： Nakagawa, Ikuo Nagami, Kenichi Intec Inc Adv Technol Res & Dev Inst Tokyo Japan

ISBN: (纸本)9780769547374;9781467320016

In this paper, we propose a new architecture for parallel and distributed processing framework, "Jobcast", which enables data processing on a cloud style KVS database. Nowadays, lots of KVS (as known as Key Value Store) systems exist which achieve high scalability for data spaces among a huge number of computers. Some of KVS implementations use "consistent hash" algorithm to identify the backend data node to store a pair of key and value. Jobcast also uses consistent hash algorithm for a distribution strategy and has a capability to store key and value pairs into huge number of computers as a KVS system. Furthermore, Jobcast also distributes "jobs" into data nodes for parallel and distributed processing. In this paper, we introduce a basic architecture of Jobcast and evaluate a data processing performance for a typical example.

关键词： component parallel and distributed processing cloud database NoSQL KVS

来源：评论

学校读者我要写书评

暂无评论

Robustness Prediction and Evaluation of Divisible Load Scheduling on Computing Systems with Unpredictable Variations 13

Robustness Prediction and Evaluation of Divisible Load Sched...

引用

13th ieee international symposium on parallel and distributed Computing (ISPDC)

作者： Balasubramaniam, Mahadevan Banicescu, Ioana Ciorba, Florina M. Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS 39762 USA Tech Univ Dresden Ctr Informat Serv & High Performance Comp D-01062 Dresden Germany

ISBN: (纸本)9781479959198

this work addresses the problem of predicting and evaluating the robustness of divisible load scheduling of data parallel workloads (also called arbitrarily divisible workloads) onto high performance parallel and distributed computing systems with unpredictable variations. Divisible load scheduling is based on the divisible load theory (DLT) which offers a linear, deterministic, and tractable model for scheduling arbitrarily divisible workloads. High performance parallel and distributed computing systems operate in an environment characterized by unpredictable variations (or perturbations) such as system load or unexpected resource failures. In this work, we analytically evaluate and empirically determine the robustness of divisible load scheduling algorithms (called DLT algorithms) with respect to variations in processor availability via realistic simulation. the realism arises from modeling the characteristics of two applications from the NAS parallel benchmark suite, as well as from modeling the target system as a 3D torus topology, one of the most widely used interconnection networks. Extending prior related work, we conduct an analytical evaluation as well as a simulation-based study of the robustness of divisible load scheduling for scheduling the two NAS parallel benchmarks, namely, embarrassingly parallel (EP) which is computationally intensive and integer sort (IS) which is communication intensive. the simulation results indicate that the robustness observed via simulation of scheduling the EP benchmark is always within the analytically predicted range, and that the robustness observed via simulation of scheduling the IS benchmark is within the analytically predicted range in the best case, and within 6.56% on average in the worst case.

关键词： Benchmark testing Computational modeling Load modeling Processor scheduling Robustness Runtime Topology load dispatching Benchmark testing Divisible scheduling of multiprocessor Runtime Load modeling Robustness Computational modeling topology distributed computing system BENCHMARKS

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Energy Efficiency of the Memory Subsystem in Multicore Processors 12

Analyzing the Energy Efficiency of the Memory Subsystem in M...

引用

12th ieee international symposium on parallel and distributed processing with applications (ISPA)

作者： Catalan, Sandra Gonzalez-Dominguez, Jorge Mayo, Rafael Quintana-Orti, Enrique S. Univ Jaume 1 Depto Ingn & Ciencia Comp Castellon de La Plana 12071 Spain Johannes Gutenberg Univ Mainz Parallel & Distributed Architectures Grp D-55122 Mainz Germany

ISBN: (纸本)9781479942930

In this paper we analyze the energy overhead incurred when operating with data stored in different levels of the memory subsystem (cache levels and DDR chips) of current multicore architectures. Our approach builds upon servet, a portable framework for the memory characterization of multicore processors, extending this suite with a power-related test that, when applied to a platform equipped with a power measurement mechanism, provides information on the efficiency of memory energy usage. As additional contributions, i) we provide a complete experimental study of the impact that the CPU performance states (also known as P-states) exert on the memory energy efficiency of a collection of recent server-oriented and low-power cores;and ii) we show how this framework carries over to cover also the scalability analysis of the memory energy performance on multicore processors.

关键词： Power efficiency high performance computing profiling and tracing power consumption multicore processors

来源：评论

学校读者我要写书评

暂无评论

Minimizing rental cost for multiple recipe applications in the Cloud 30

Minimizing rental cost for multiple recipe applications in t...

引用

30th ieee international parallel and distributed processing symposium (IPDPS)

作者： Hanna, Fouad Marchal, Loris Nicod, Jean-Marc Philippe, Laurent Rehn-Sonigo, Veronika Sabbah, Hala UFC UBFC CNRS ENSMM UTBM FEMTO ST Inst Besancon France ENS Lyon CNRS INRIA LIP Besancon France

ISBN: (纸本)9781509036820

Clouds are more and more becoming a credible alternative to parallel dedicated resources. the pay-per-use pricing policy however highlights the real cost of computing applications. this new criterion, the cost, must then be assessed when scheduling an application in addition to more traditional ones as the completion time or the execution flow. In this paper, we tackle the problem of optimizing the cost of renting computing instances to execute an application on the cloud while maintaining a desired performance (throughput). the target application is a stream application based on a DAG pattern, i.e., composed of several tasks with dependencies, and instances of the same execution task graph are continuously executed on the instances. We provide some theoretical results on the problem of optimizing the renting cost for a given throughput then propose some heuristics to solve the more complex parts of the problem, and we compare them to optimal solutions found by linear programming.

关键词： Clouds scheduling optimization DAG applications

来源：评论

学校读者我要写书评

暂无评论

Visible Nearest Neighbor Search for Objects Moving on Consecutive Trajectories 15

Visible Nearest Neighbor Search for Objects Moving on Consec...

引用

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

作者： Luo, Xinyuan Chen, Ke Pang, Guifeng Shou, Lidan Chen, Gang Zhejiang Univ Coll Comp Sci Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781538637906

A visible nearest neighbor (VNN) query returns the k nearest objects that are visible to a query point, which is used to support various applications such as route planning, target monitoring, and antenna placement. However, with the proliferation of wireless communications and advances in positioning technology for mobile equipments, efficiently searching for VNN among moving objects are required. While most previous work on VNN query focused on static objects, in this paper, we treats the objects as moving consecutively when indexing them, and study the visible nearest neighbor query for moving objects (MVNN). Assuming that the objects are represented as trajectories given by linear functions of time, we propose a scheme which indexes the moving objects by time-parameterized R-tree (TPR-tree) and obstacles by R-tree. the paper offers four heuristics for visibility and space pruning. New algorithms, Post-pruning and United-pruning, are developed for efficiently solving MVNN queries with all four heuristics. the effectiveness and efficiency of our solutions are verified by extensive experiments over synthetic datasets on real road network.

关键词： Nearest neighbor search Moving objects Visibility

来源：评论

学校读者我要写书评

暂无评论

Reducing Time and/or Memory Consumption of the SOG construction in a parallel Context 16

Reducing Time and/or Memory Consumption of The SOG construct...

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Ouni, Hiba Klai, Kais Abid, Chiheb Ameur Zouari, Belhassen Univ Tunis El Manar Fac Sci Tunis Tunis 2092 Tunisia Univ Paris 13 CNRS UMR 7030 LIPNSorbonne Paris Cite Villetaneuse France Univ Carthage Higher Sch Commun Tunis Mediatron Lab Tunis Tunisia

ISBN: (纸本)9781728111414

An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Such a graph is a condensed representation of the state space that is obtained by taking advantage of symbolic representation of the nodes. Each node, called aggregate, represents a set of explicit states and is encoded using Multi-valued decision diagrams. In a previous work, we have shown that parallel and distributed approaches can improve drastically the performances of the SOG computation regarding a sequential construction. In this paper, we go a step forward in improving the SOG construction process by reducing, on the fly, the size of its aggregates. We propose a Multi-valued decision diagrams (MDDs) based algorithm to determine a single representative for each strongly connected component in every aggregate allowing to remove from memory a consequent number of states which are no more necessary for the construction process. Two parallel approaches for the building of an SOG are proposed using such an optimization. the first approach is based on a shared memory architecture, while the second is based on a distributed memory one. the results of our preliminary experiments show that, in first case, the canonization allows to obtain more compact SOG (in terms of memory consumption) while increasing the computation time. However, for the distributed memory based approach, the canonization allows to reduce the size of exchanged messages and therefore reducing communication time.

关键词： Canonization distributed Model Checking parallel Model checking

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2020 ieee international symposium on parallel and distributed processing with applications, 2020 ieee international Conference on Big Data and Cloud Computing, 2020 ieee international symposium on Social Computing and Networking and 2020 ieee international Conference on Sustainable Computing and Communications, ISPA-BDCloud-SocialCom-SustainCom 2020

Proceedings - 2020 IEEE International Symposium on Parallel ...

引用

18th ieee international symposium on parallel and distributed processing with applications, 10th ieee international Conference on Big Data and Cloud Computing, 13th ieee international symposium on Social Computing and Networking and 10th ieee international Conference on Sustainable Computing and Communications, ISPA-BDCloud-SocialCom-SustainCom 2020

ISBN: (纸本)9781665414852

the proceedings contain 202 papers. the topics discussed include: multi-relational graph convolutional networks for skeleton-based action recognition;identifying the right person in social networks with double metaphone codes;a novel strong cache consistency mechanism in ICN based on role division and lease model;demystifying the largest live game streaming platform via black-box measurement;framework-agnostic optimization of repeated skewed joins at massive scale;remote procedure call optimization of big data systems based on data awareness;MCSEC: secure coded matrix multiplication scheme for edge computing with minimum communication cost;low-rate DoS attack detection based on WPD-EE algorithm;user identity linkage across location-based social networks with spatio-temporal check-in patterns;optimizing 3-D placement of multiple UAVs based on Taguchiâ€™s method;and feature envy detection based on Bi-LSTM with self-attention mechanism.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：