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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,982 篇 电气工程
- 1,383 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 535 篇 控制科学与工程
- 228 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 61 篇 安全科学与工程
1,973 篇 理学
- 1,505 篇 数学
- 245 篇 物理学
- 203 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,463 篇 管理学
- 1,205 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

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

共 16627 条记录，以下是261-270 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Unleash the Power for Tensor: A Hybrid Malware Detection System Using Ensemble Classifiers 15

Unleash the Power for Tensor: A Hybrid Malware Detection Sys...

引用

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

作者： Hou, Jieqiong Xue, Minhui Qian, Haifeng East China Normal Univ Shanghai Peoples R China

ISBN: (纸本)9781538637906

The extensive growth of smartphones has spawned the propagation of malicious applications. Due to the increasing use of polymorphic malware, detection is becoming more difficult. To this end, ensemble learning has been proposed to improve accuracy in malware detection, without severely sacrificing time complexity. In this paper, we propose a hybrid detection system, TFBOOST, which incorporates the tensor filter algorithm into boosting ensemble generalization architecture, in order to improve detection efficacy. TFBOOST uses a static analysis to extract features and a level-by-level boosting structure with re-sampling process to diversify base learners. Experimental results show that TFBOOST generally outperforms state-of-the-art ensemble algorithms with higher detection precision and lower false positive rates. Finally, we visually interpret the high-level results of TFBOOST and conjecture that repackaged malware is the mainstay of potential malware.

关键词： TFBOOST Malware detection Tensor decomposition Boosting generalization Ensemble learning

来源：评论

学校读者我要写书评

暂无评论

Memory-Disaggregated In-Memory Object Store Framework for Big Data applications 36

Memory-Disaggregated In-Memory Object Store Framework for Bi...

引用

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

作者： Abrahamse, Robin Hadnagy, Akos Al-Ars, Zaid Delft Univ Technol Accelerated Big Data Syst Delft Netherlands

ISBN: (纸本)9781665497473

The concept of memory disaggregation has recently been gaining traction in research. With memory disaggregation, data center compute nodes can directly access memory on adjacent nodes and are therefore able to overcome local memory restrictions, introducing a new data management paradigm for distributed computing. This paper proposes and demonstrates a memory disaggregated in-memory object store framework for big data applications by leveraging the newly introduced ThymesisFlow memory disaggregation system. The framework extends the functionality of the pre-existing Apache Arrow Plasma object store framework to distributed systems by enabling clients to easily and efficiently produce and consume data objects across multiple compute nodes. This allows big data applications to increasingly leverage parallel processing at reduced development costs. In addition, the paper includes latency and throughput measurements that indicate only a modest performance penalty is incurred for remote disaggregated memory access as opposed to local (similar to 6.5 vs similar to 5.75 GiB/s). The results can be used to guide the design of future systems that leverage memory disaggregation as well as the newly presented framework. This work is open-source and publicly accessible at https://***/10.5281/zenodo.6368998.

关键词： Memory Disaggregation Apache Arrow Plasma ThymesisFlow

来源：评论

学校读者我要写书评

暂无评论

Modeling of applications and hardware to explore task mapping and scheduling strategies on a heterogeneous micro-server system 31

Modeling of applications and hardware to explore task mappin...

引用

31st ieee international parallel and distributed processing symposium Workshops (IPDPS)

作者： Zaourar, Lilia Aba, Massinissa Ait Briand, David Philippe, Jean-Marc CEA LIST Comp & Design Environm Lab F-91191 Gif Sur Yvette France

ISBN: (纸本)9780769561493

Many of todays important applications of our everyday lives, e.g. weather forecast, design of plane and car shapes, medical analysis or even search engine queries depend on massively-parallel computer programs that are executed in data centers hosting thousands of computers. A large amount of electrical energy is used to power them, and it is of primary importance to compute more efficiently to sustain the increasing demand of computing power while keeping energy consumption reasonable. One promising research path in this domain is heterogeneous systems. The rationale for that is that at least parts of applications execute more efficiently depending on the computing resource (processors, accelerators, etc.). Nevertheless, the exploitation of these heterogeneous platforms raises new challenges in terms of application management optimization on available computing resources. The aim of our work is to determine effective algorithms to exploit these heterogeneous platforms by finding the best mapping and scheduling of an application to optimize the execution time and energy consumption with respect to various constraints. To achieve this goal, there is a need of a detailed modeling of the applications and the underlying hardware to be able to find realistic solutions. In this paper, we propose such as model, provide two implementations with state-of-the-art tools and preliminary mapping and scheduling numerical results.

关键词： heterogeneous computing resource management mapping scheduling energy consumption

来源：评论

学校读者我要写书评

暂无评论

parallel local search for the Costas Array Problem

Parallel local search for the Costas Array Problem

引用

26th ieee international parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Diaz, Daniel Richoux, Florian Caniou, Yves Codognet, Philippe Abreu, Salvador Univ Paris 01 F-75231 Paris 05 France Univ Tokyo Tokyo Japan Nat Inst Inf NII Japanese French Lab Inf JFLI Tokyo Japan Univ Evora CENTRIA FCT Evora Portugal

ISBN: (纸本)9780769546766

The Costas Array Problem is a highly combinatorial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implementations, while the parallel version shows nearly linear speedups up to 8,192 cores.

关键词： constraint solving Costas array implementation local search metaheuristics parallelism

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Aware Conceptual Framework for Coordination 15

A Privacy-Aware Conceptual Framework for Coordination

引用

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

作者： Elahi, Haroon Wang, Guojun Zhang, Wei Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9781538637906

Enterprise architects and information system designers need to understand and manage workflows, data flows, and social interactions to design tools and systems for well-coordinated organizational operations. However, the organizational-nature has drastically transformed over the recent years due to wide-scale use of new computing technologies. Disintegrated structures, large quantities of frequently-generated data, and dubious system and interaction boundaries are some of the obvious identifiers of a modern enterprise, where poorly designed coordination can lead to serious privacy risks. Old coordination modeling frameworks do not set well for the new organizational settings, and a need for alternative models and frameworks has been felt. In this paper, we propose a privacy-aware conceptual framework for understanding coordination by identifying and mapping work, data, and interaction patterns in organizational environments. These propositions intend to help practitioners in developing an updated understanding of the coordination that serves privacy needs, as well.

关键词： Coordination Computer Supported Cooperative Work Information System Design Privacy distributed Environments

来源：评论

学校读者我要写书评

暂无评论

Virtual Machine Migration Scheme Based on Score Matrix in Data Centers 15

Virtual Machine Migration Scheme Based on Score Matrix in Da...

引用

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

作者： Yin, Luxiu Luo, Juan Zhang, Song Yang, Zhangwei Hunan Univ Coll Comp Sci & Elect Engn Changsha Hunan Peoples R China Pingxiang Univ Pingxiang Jiangxi Peoples R China

ISBN: (纸本)9781538637906

Virtual Machine Migration (VMM) is a key technology in data centers. Due to the uncertainty of applications in resource allocation, the imbalance of resource utilization is badly poor. In this paper, an Auto-regression Moving Average model is proposed to predict the resource requirement of a certain virtual machine, while the resource utilization rate of the physical machine is analyzed. Since the existing VMM scheme basically follows one by one migration, which makes the migration be unable to achieve the global optimum and save more energy, the paper introduces migrated cost matrix, and recommends a set of migrations with the best performance from a global point of view to carry out the migration, and improves the "three-step" method in the traditional migrated scheme to achieve energy efficiency. Simulation experiments show that the proposed scheme in the paper can effectively reduce the energy consumption, and can improve the quality of service in a certain degree.

关键词： Energy Efficient Forecast Migrated Cost Matrix Virtual Machine Migration

来源：评论

学校读者我要写书评

暂无评论

Optimization of Virtual Resources Provisioning for Cloud applications to cope with Traffic Burst 15

Optimization of Virtual Resources Provisioning for Cloud App...

引用

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

作者： Yang, Lei Feng, Ying Li, Kenli Hunan Univ Coll Informat Sci & Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781538637906

In order to ensure Web application QoS and remain low cost for the provider simultaneously in Web traffic burst scenario, workload prediction and corresponding provisioning mechanism are investigated in this paper. At first, a virtual resource provisioning architecture is designed based on workload prediction under cloud hosting environment. Then, combined with the existing Moving Average (MA) model and Support Vector Regression (SVR) model, we propose an integrated workload prediction model named LOF-MASVR through using Local Outlier Factor (LOF) algorithm. With the application of this prediction model, a dynamic mechanism of resource provisioning is proposed by introducing an adaptive coefficient. Experiments using real Web workload demonstrate that LOF-MASVR model can reduce Service Level Agreement (SLA) violation number in peak periods around 70%, in comparison with existing prediction models. According to resource provisioning experiments on CloudSim platform, the proposed dynamic provisioning policy can effectively reduce the risk of SLA violation, which simultaneously ensures the virtual resource utilization.

关键词： Cloud applications QoS Traffic Burst Scenario Workload Prediction Virtual Resource Provisioning SVR MA LOF

来源：评论

学校读者我要写书评

暂无评论

Compiler-Enhanced Incremental Checkpointing for OpenMP applications

Compiler-Enhanced Incremental Checkpointing for OpenMP Appli...

引用

23rd ieee international parallel and distributed processing symposium

作者： Bronevetsky, Greg Marques, Daniel Pingali, Keshav McKee, Sally Rugina, Radu Lawrence Livermore Natl Lab Livermore CA 94550 USA Ballista Secur New York NY 10005 USA Univ Texas Austin Austin TX 78712 USA Chalmers Univ Technol S-41258 Gothenburg Sweden VMWare Palo Alto CA 94304 USA

ISBN: (纸本)9781424437511

As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety of causes. Checkpointing is a popular technique for tolerating such failures, enabling applications to periodically save their state and restart computation after a failure. Although a many automated system-level checkpointing solutions are currently available to HPC users, manual application-level checkpointing remains more popular due to its superior performance. This paper improves performance of automated checkpointing via a compiler analysis for incremental checkpointing. This analysis, which works with both sequential and OpenMP applications, reduces checkpoint sizes by as much as 80% and enables asynchronous checkpointing.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Controlling the Memory Subscription of distributed applications with a Task-Based Runtime System 30

Controlling the Memory Subscription of Distributed Applicati...

引用

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

作者： Sergent, Marc Goudin, David Thibault, Samuel Aumage, Olivier Inria Bordeaux Talence France CEA CESTA Le Barp France Univ Bordeaux Talence France

ISBN: (纸本)9781509036820

The ever-increasing supercomputer architectural complexity emphasizes the need for high-level parallel programming paradigms. Among such paradigms, task-based programming manages to abstract away much of the architecture complexity while efficiently meeting the performance challenge, even at large scale. Dynamic run-time systems are typically used to execute task-based applications, to schedule computation resource usage and memory allocations. While computation scheduling has been well studied, the dynamic management of memory resource subscription inside such run-times has however been little explored. This paper studies the cooperation between a task-based distributed application code and a run-time system engine to control the memory subscription levels throughout the execution. We show that the task paradigm allows to control the memory footprint of the application by throttling the task submission flow rate, striking a compromise between the performance benefits of anticipative task submission and the resulting memory consumption. We illustrate the benefits of our contribution on a compressed dense linear algebra distributed application.

关键词： memory control task-based run-time systems compressed linear algebra distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：