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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,282 篇 会议
362 篇 期刊文献
15 册 图书
1 篇 学位论文

馆藏范围

9,660 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,567 篇 工学
- 4,176 篇 计算机科学与技术...
- 2,156 篇 软件工程
- 848 篇 电气工程
- 638 篇 信息与通信工程
- 313 篇 控制科学与工程
- 227 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,073 篇 理学
- 862 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 34 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,209 篇 distributed data...
993 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
779 篇 computer science
697 篇 databases
617 篇 computer archite...
586 篇 application soft...
554 篇 computational mo...
463 篇 parallel process...
367 篇 scalability
358 篇 distributed comp...
354 篇 distributed proc...
327 篇 hardware
325 篇 database systems
296 篇 costs
295 篇 processor schedu...
293 篇 parallel program...
291 篇 resource managem...
269 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
13 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 kurt rothermel
10 篇 choudhary a
9 篇 raicu ioan
9 篇 m. takizawa
9 篇 yong chen
9 篇 jack dongarra
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop
9 篇 cameron kirk w.
9 篇 j. saltz

语言

9,621 篇 英文
21 篇 中文
18 篇 其他

检索条件"任意字段=International Symposium on Databases in Parallel and Distributed Systems"

共 9660 条记录，以下是91-100 订阅

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

详细简洁

排序：

Combining Lossy Compression with Multi-level Caching for Data Staging over Network

Combining Lossy Compression with Multi-level Caching for Dat...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Aoyagi, Rei Takahashi, Keichi Shimomura, Yoichi Takizawa, Hiroyuki Tohoku Univ Grad Sch Informat Sci Sendai Miyagi Japan Tohoku Univ Cybersci Ctr Sendai Miyagi Japan

ISBN: (纸本)9798350364613;9798350364606

Researchers conduct post-processing on the simulation results by running an interactive data analysis tool on a High-Performance Computing (HPC) system installed at an HPC center and retrieving the post-processed results. Certain data analysis scenarios require to transfer the simulation results directly from the center. in such scenarios, a portion of the data would usually be streamed over the network to achieve interactivity. However, there still exist two challenges in maintaining interactivity: (1) limited network bandwidth and (2) long network latency. To tackle these challenges, we propose a system to enable interactive array analysis over the network. We employ error-bounded lossy compression to increase the effective network bandwidth. Furthermore, we employ multi-level caching to hide the network latency and combine prefetching to improve the cache hit ratio. The cache replacement and prefetching policies are designed considering the data access pattern of interactive analysis. We compared our proposed system with TileDB, one of the state-of-the-art array databases, by measuring the average latency for various access patterns. Compared to TileDB, the proposed system reduces the average latency by up to 91.6% by allowing 10% of error because the cache hit ratio was improved by more than 40% due to the proper cache replacement and prefetching policy and network transfer time was reduced more than 75% by using lossy compression.

关键词： HPC distributed Computing Data Staging Lossy Compression Interactive Analysis Bandwidth Software Caching

来源：评论

学校读者我要写书评

暂无评论

A distributed Stealth Address Generation Protocol for Threshold Signatures 22

A Distributed Stealth Address Generation Protocol for Thresh...

引用

22nd IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Wang, Yujue Zhong, Lin Du, Jun Zou, Yudi He, Kevin Zhang, Andrew Hangzhou Innovation Institute Beihang University Hangzhou China Sinohope Technology Holdings Limited Hong Kong Bitlayer Labs Ltd Vistra Corporate Service Centre British Virgin Islands

ISBN: (纸本)9798331509712

Stealth addresses protect recipient identity privacy in blockchain systems by allowing a sender to derive a stealth address using the recipient's public key, with the receiver deriving a corresponding one-time private key. In threshold signatures, where distributed recipient entities only hold private key shares and the full private key never appears, this becomes challenging. To address this, we propose a distributed stealth address generation (DSAG) protocol for threshold signatures. In our approach, distributed sender entities derive the stealth address, and distributed recipient entities derive corresponding one-time private key shares using Lagrange interpolation. The correctness of these shares is verified by ensuring that they satisfy the necessary Lagrange interpolation and discrete logarithm relationships. Our protocol avoids bilinear mappings and relies solely on elliptic curve exponentiations, leading to higher efficiency. Experimental tests demonstrate that our scheme instance takes just 4 milliseconds confirming its practicality. © 2024 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Black-Box Stability Analysis Method for Dual parallel Pulse Power Load 14

Black-Box Stability Analysis Method for Dual Parallel Pulse ...

引用

14th IEEE international symposium on Power Electronics for distributed Generation systems, PEDG 2023

作者： Chen, Xu Xu, Jianping Yang, Ping Chen, Zhengge Qi, Jin Tang, Xi Southwest Jiaotong University School of Electrical Engineering Chengdu China

ISBN: (纸本)9798350328233

The impedance of power source of the microgrid cannot be regarded as infinite, thus it may cause stability problems, especially when the load is a pulse power load. The black box method can not be well applied to pulse power load. To address this issue, a black-box stability analysis method for system with parallel pulse loads is proposed in this paper. Based on the stability condition of the system with single load, the stability condition of the system with parallel load is derived. Finally, 3-D fitting Bode plot are given to analyze the stability of the system with parallel load. Simulations results are given to verify the analysis results. © 2023 IEEE.

关键词： Bode diagrams

来源：评论

学校读者我要写书评

暂无评论

Essentials of parallel Graph Analytics 36

Essentials of Parallel Graph Analytics

引用

36th IEEE international parallel and distributed Processing symposium (IEEE IPDPS)

作者： Osama, Muhammad Porumbescu, Serban D. Owens, John D. Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781665497473

We identify the graph data structure, frontiers, operators, an iterative loop structure, and convergence conditions as essential components of graph analytics systems based on the native-graph approach. Using these essential components, we propose an abstraction that captures all the significant programming models within graph analytics, such as bulksynchronous, asynchronous, shared-memory, message-passing, and push vs. pull traversals. Finally, we demonstrate the power of our abstraction with an elegant modern C++ implementation of single-source shortest path and its required components.

关键词： parallel graph analytics graph traversal algorithms

来源：评论

学校读者我要写书评

暂无评论

The Logarithmic Random Bidding for the parallel Roulette Wheel Selection with Precise Probabilities

The Logarithmic Random Bidding for the Parallel Roulette Whe...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Nakano, Koji Hiroshima Univ Grad Sch Adv Sci & Engn Kagamiyama 1-4-1 Higashihiroshima 7398527 Japan

ISBN: (纸本)9798350364613;9798350364606

The roulette wheel selection is a critical process in heuristic algorithms, enabling the probabilistic choice of items based on assigned fitness values. It selects an item with a probability proportional to its fitness value. This technique is commonly employed in ant-colony algorithms to randomly determine the next city to visit when solving the traveling salesman problem. Our study focuses on parallel algorithms designed to select one of multiple processors, each associated with fitness values, using random wheel selection. We propose a novel approach called logarithmic random bidding, which achieves an expected runtime logarithmic to the number of processors with non-zero fitness values, using the CRCW-PRAM model with a shared memory of constant size. Notably, the logarithmic random bidding technique demonstrates efficient performance, particularly in scenarios where only a few processors are assigned non-zero fitness values.

关键词： roulette wheel selection fitness proportionate selection ant colony optimization traveling salesman problem parallel heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

In-Memory Indexed Caching for distributed Data Processing 36

In-Memory Indexed Caching for Distributed Data Processing

引用

36th IEEE international parallel and distributed Processing symposium (IEEE IPDPS)

作者： Uta, Alexandru Ghit, Bogdan Dave, Ankur Rellermeyer, Jan Boncz, Peter Leiden Univ LIACS Leiden Netherlands Databricks San Francisco CA USA Univ Calif Berkeley Berkeley CA USA Delft Univ Technol Delft Netherlands CWI Amsterdam Netherlands

ISBN: (纸本)9781665481069

Powerful abstractions such as dataframes are only as efficient as their underlying runtime system. The de-facto distributed data processing framework, Apache Spark, is poorly suited for the modern cloud-based data-science workloads due to its outdated assumptions: static datasets analyzed using coarse-grained transformations. In this paper, we introduce the Indexed DataFrame, an in-memory cache that supports a dataframe abstraction which incorporates indexing capabilities to support fast lookup and join operations. Moreover, it supports appends with multi-version concurrency control. We implement the Indexed DataFrame as a lightweight, standalone library which can be integrated with minimum effort in existing Spark programs. We analyze the performance of the Indexed DataFrame in cluster and cloud deployments with real-world datasets and benchmarks using both Apache Spark and Databricks Runtime. In our evaluation, we show that the Indexed DataFrame significantly speeds-up query execution when compared to a nonindexed dataframe, incurring modest memory overhead.

关键词： distributed processing Runtime Data analysis Cluster computing Relational databases Libraries Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Shared-Memory parallel Dynamic Louvain Algorithm for Community Detection

Shared-Memory Parallel Dynamic Louvain Algorithm for Communi...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Sahu, Subhajit Kothapalli, Kishore Banerjee, Dip Sankar Int Inst Informat Technol Hyderabad Hyderabad 500032 India Indian Inst Tehnol Jodhpur Surpura Bypass Rd Karwar 342030 Rajasthan India

ISBN: (纸本)9798350364613;9798350364606

Community detection refers to the identification of coherent partitions in networks. In this poster, we present a parallel dynamic Louvain algorithm that finds conummities in rapidly evolving graphs. Given a batch update of edge deletions or insertions, our algorithm identifies an approximate set of affected vertices in the graph with minimal overhead and updates the community membership of each vertex. This process repeats until convergence. Our approach achieves a mean speedup of 7.3 x, compared to our parallel and optimized implementation of Delta-screening combined with Louvain, a recently proposed stateof-the-art approach.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Communication-Computation Overlapping for parallel Multigrid Methods

Communication-Computation Overlapping for Parallel Multigrid...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Nakajima, Kengo Univ Tokyo Informat Technol Ctr RIKEN R CCS Tokyo Japan

ISBN: (纸本)9798350364613;9798350364606

Preconditioned iterative methods based on the Krylov subspace technique are widely employed in various scientific and technical computing. When utilizing large-scale parallel computing systems, the communication overhead tends to increase with the growth in the number of nodes, making its reduction a crucial challenge. In parallel finite element methods (FEM) and finite volume methods (FVM), halo communication and computation overlapping (CC-Overlapping) are commonly employed, often in conjunction with the dynamic loop scheduling feature of OpenMP. This approach has been primarily applied to sparse matrix-vector products (SpMV) and explicit solvers. Previous studies by the author have proposed reordering techniques for applying CC-Overlapping to processes involving global data dependencies, such as the Conjugate Gradient method preconditioned by Incomplete Cholesky Factorization (ICCG). Successful implementations on massively parallel supercomputers demonstrated high parallel performance, but the application of CC-Overlapping was limited to SpMV. In the present work, the author proposes a method to apply CC-Overlapping to the forward and backward substitutions of the IC(0) smoother of the parallel Conjugate Gradient method preconditioned by Multigrid (MGCG). Using up to 4,096 nodes on Wisteria/EMEC-01 (Odyssey) with A64FX, performance improvement of approximately 40+% was achieved compared to the original implementation, while improvement was 20+% on 1,024 nodes of Oakbridge-CX system with Intel Xeon CPU's.

关键词： parallel Computing Iterative Solvers Multigrid Manycore Communication-Computation Overlapping

来源：评论

学校读者我要写书评

暂无评论

A Scalable parallel Partition Tridiagonal Solver for Many-Core and Low B/F Processors 36

A Scalable Parallel Partition Tridiagonal Solver for Many-Co...

引用

36th IEEE international parallel and distributed Processing symposium (IEEE IPDPS)

作者： Mitsuda, Tatsuya Ono, Kenji Kyushu Univ Grad Sch Fukuoka Japan Kyushu Univ Fac Informat Sci & Elect Engn Fukuoka Japan Kyushu Univ Res Inst Informat & Technol Fukuoka Japan

ISBN: (纸本)9781665497473

Tridiagonal systems are among the most fundamental computations in science, engineering, and mathematics, and one solver used in such systems is Tree Partitioning Reduction (TPR), which is a divide-and-conquer method that solves large-scale linear equations by dividing them and then computing the parts in parallel within different local memory threads. Herein, we propose an improved TPR algorithm that has a parallel cyclic reduction flavor, with which we reduced the number of algorithm steps by approximately half while simultaneously increasing arithmetic intensity and cache reusability. A performance evaluation conducted on an Intel Skylake-SP microprocessor showed a high hit ratio for the L1 cache and that our solver was as much as 31 times faster on 32 threads for 262144 equations. In the case of a Nvidia Tesla P100 GPU, our method processed 10 MRow/s more than TPR and cuSPARSE.

关键词： Tridiagonal system GPU parallel computing Multi/many-core

来源：评论

学校读者我要写书评

暂无评论

parallel Optimization for Robotics: An Undergraduate Introduction to GPU parallel Programming and Numerical Optimization Research

Parallel Optimization for Robotics: An Undergraduate Introdu...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Plancher, Brian Columbia Univ Barnard Coll New York NY 10027 USA

ISBN: (纸本)9798350364613;9798350364606

While parallel programming, particularly on graphics processing units (GPUs), and numerical optimization hold immense potential to tackle real-world computational challenges across disciplines, their inherent complexity and technical demands often act as daunting barriers to entry. This, unfortunately, limits accessibility and diversity within these crucial areas of computer science. To combat this challenge and ignite excitement among undergraduate learners, we developed an application-driven course, harnessing robotics as a lens to demystify the intricacies of these topics making them tangible and engaging. Our course's prerequisites are limited to the required undergraduate introductory core curriculum, opening doors for a wider range of students. Our course also features a large final-project component to connect theoretical learning to applied practice. In our first offering of the course we attracted 27 students without prior experience in these topics and found that an overwhelming majority of the students fell that they learned both technical and soft skills such that they felt prepared for future study in these fields.

关键词： CS Education GPU Programming Numerical Optimization parallel Computing Robotics Undergraduate Education

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：