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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是371-380 订阅

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

详细简洁

排序：

HiPerConTracer 3.0: Transport-level Packet Routing Analysis Tool 33

HiPerConTracer 3.0: Transport-level Packet Routing Analysis ...

引用

33rd Euromicro international Conference on parallel, distributed, and Network-Based processing, PDP 2025

作者： Dreibholz, Thomas Mazumdar, Somnath Center for Resilient Networks and Applications Simula Metropolitan Norway Copenhagen Business School Department of Digitalization Denmark

ISBN: (纸本)9798331524937

Network-based applications rely on the underlying network infrastructure to reliably forward packets between nodes. The way packets are forwarded has a significant impact on service quality. Therefore, it is important to gain a better understanding of data packet routes. To obtain detailed information about network paths, continuous and long-term packet analysis is required. To achieve this, we present our open-source framework HiPerConTracer 3.0 for large-scale IP trace analysis. It performs Ping and Traceroute measurements to provide detailed insights into packet routes and packet timing by tracing routes between senders and receivers in public and private networks. Particularly, it runs its own measurements, without need to obtain data, or cooperation from, the underlying network service providers or remote server owners. Our tool supports large-scale data collection, storage, and post-processing stages. It supports easy-to-understand route visualization, round-trip time measurements, and hop counts. A proof-of-concept analysis revealed that packet route lengths can change drastically when traveling through unexpected countries, regions, and network operators. © 2025 ieee.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

A parallel Novelty Search Metaheuristic Applied to a Wildfire Prediction System 36

A Parallel Novelty Search Metaheuristic Applied to a Wildfir...

引用

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

作者： Strappa, Jan Caymes-Scutari, Paola Bianchini, German Consejo Nacl Invest Cient & Tecn CONICET Mendoza Argentina Univ Tecnol Nacl Fac Reg Mendoza Buenos Aires DF Argentina

ISBN: (纸本)9781665497473

Wildfires are a highly prevalent multi-causal environmental phenomenon. The impact of this phenomenon includes human losses, environmental damage and high economic costs. To mitigate these effects, several computer simulation systems have been developed in order to predict fire behavior based on a set of input parameters, also called a scenario (wind speed and direction;temperature;etc.). However, the results of a simulation usually have a high degree of error due to the uncertainty in the values of some variables, because they are not known, or because their measurement may be imprecise, erroneous, or impossible to perform in real time. Previous works have proposed the combination of multiple results in order to reduce this uncertainty. State-of-the-art methods are based on parallel optimization strategies that use a fitness function to guide the search among all possible scenarios. Although these methods have shown improvements in the quality of predictions, they have some limitations related to the algorithms used for the selection of scenarios. To overcome these limitations, in this work we propose to apply the Novelty Search paradigm, which replaces the objective function by a measure of the novelty of the solutions found, which allows the search to continuously generate solutions with behaviors that differ from one another. This approach avoids local optima and may be able to find useful solutions that would be difficult or impossible to find by other algorithms. As with existing methods, this proposal may also be adapted to other propagation models (floods, avalanches or landslides).

关键词： wildfire propagation prediction evolutionary algorithms novelty search uncertainty reduction

来源：评论

学校读者我要写书评

暂无评论

Accuracy vs. Cost in parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices 36

Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Appro...

引用

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

作者： Ernstbrunner, Robert Mayer, Viktoria Gansterer, Wilfried Univ Vienna Fac Comp Sci Vienna Austria

ISBN: (纸本)9781665481069

We study a randomized and a deterministic algorithm for the fixed-precision low-rank approximation problem of large sparse matrices. The Randomized QB Factorization (RandQB_EI) constructs a reduced and dense representation of the originally sparse matrix based on randomization. The representation resulting from the deterministic Truncated LU Factorization with Column and Row Tournament Pivoting (LU_CRTP) is sparse, but fill-in introduced in the factorization process can affect sparsity and performance. We therefore attempt to mitigate fill-in with an incomplete LU_CRTP variant with thresholding (ILUT_CRTP). We analyze this approach and identify potential problems that may arise in practice. We design parallel implementations of RandQB_EI, LU_CRTP and ILUT_CRTP. We experimentally evaluate strong scaling properties for different problems and the runtime required for achieving a given approximation quality. Our results show that LU_CRTP tends to be particularly competitive for low approximation quality. However, when a lot of fill-in occurs, LU_CRTP is outperformed by RandQB_EI especially for higher approximation quality. ILUT_CRTP outperforms both LU_CRTP and RandQB_EI and can achieve speedups up to 40 over LU_CRTP, depending on the amount of fill-in.

关键词： Randomized low-rank approximations Deterministic low-rank approximations Randomized QB Factorization Truncated LU Factorization with Tournament Pivoting

来源：评论

学校读者我要写书评

暂无评论

Shared -Memory parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs

Shared -Memory Parallel Edmonds Blossom Algorithm for Maximu...

引用

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

作者： Schwing, Gregory Grosu, Daniel Schwiebert, Loren Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

ISBN: (纸本)9798350364613;9798350364606

The Edmonds Blossom algorithm is implemented here using depth-first search, which is intrinsically serial. By streamlining the code, our serial implementation is consistently three to five times faster than the previously fastest general graph matching code. By extracting parallelism across iterations of the algorithm, with coarse -grain locking, we are able to further reduce the run lime on random regular graphs fourfold and obtain a two-fold reduction of run time on real-world graphs with similar topology. Solving very sparse graphs (average degree less than four) exhibiting comnwnity structure with eight threads led to a slow down of three-fold, but this slow down is replaced by marginal speed up once the average degree is greater than four. We conclude that our parallel coarse -grain locking implementation performs well when extracting parallelism from this augmenting-path-based algorithm and may work well for similar algorithms.

关键词： matching general graphs Edmonds Blossom parallel

来源：评论

学校读者我要写书评

暂无评论

Degree-Aware Kernels for Computing Jaccard Weights on GPUs 36

Degree-Aware Kernels for Computing Jaccard Weights on GPUs

引用

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

作者： Aljundi, Amro Alabsi Akyildiz, Taha Atahan Kaya, Kamer Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

ISBN: (纸本)9781665481069

Graphs provide the ability to extract valuable metrics from the structural properties of the underlying data they represent. One such metric is the Jaccard Weight of an edge, which is the ratio of the number of common neighbors of the edge's endpoints to the union of the endpoints' neighborhood. A naive implementation of Jaccard Weights computation has a complexity that scales with the number of edges in the graph times the square of the maximum degree. Recently, GPU-based parallel algorithms have been proposed for this problem. However, these algorithms cannot overcome the structural variance within a graph, i.e., the sparsity pattern and degree imbalance, which directly translates to unbalanced work distribution across threads. In this work, we propose an optimized GPU-based algorithm with an ML-based work distribution model that mitigates the unbalanced work distribution. Our algorithm is shown to be up to 35x and on average 12x faster than the state of the art in practice while using less memory. In fact, we show that by manually tweaking the load distribution, a state-of-the-art implementation can be 5x faster. In addition, we propose a multi-core, shared-memory algorithm that applies a traditional but effective technique to improve the computation asymptotically and perform comparably to the GPU algorithms. Our code is available at https://***/SU- HPC/Jaccard-ML

关键词： Jaccard Weights parallel graph algorithms GPU work distribution

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Learning in distributed Split Learning Architecture and IoT applications 15

Semi-supervised Learning in Distributed Split Learning Archi...

引用

ieee 15th international symposium on Autonomous Decentralized Systems (ISADS)

作者： Barhoush, Mahdi Ayad, Ahmad Schmeink, Anke Rhein Westfal TH Aachen Chair Informat Theory & Data Analyt Aachen Germany

ISBN: (纸本)9781665464512

In the era of big data, new learning techniques are emerging to solve the difficulties of data collection, storage, scalability, and privacy. To overcome these challenges, we propose a distributed learning system that merges the hybrid edge-cloud split-learning architecture with the semi-supervised learning scheme. The proposed system based on three semi-supervised learning algorithms (FixMatch, Virtual Adversarial Training, and MeanTeacher) is compared to the supervised learning scheme and trained on different datasets and data distributions (IID and non-IID) and with a variable number of clients. The new system could efficiently utilize the local unlabeled samples on the client side and gave a performance encouragement that exceeds 30% in most cases even with small percentage of labelled data. Additionally, certain Split-SSL algorithms showed performance that was on par with or occasionally even better than more resource-intensive algorithms, although requiring less processing power and convergence time.

关键词： Algorithm Comparison Big Data distributed Learning Semi-supervised learning Split Learning

来源：评论

学校读者我要写书评

暂无评论

PINT: parallel INTerval-Based Race Detector 36

PINT: Parallel INTerval-Based Race Detector

引用

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

作者： Xu, Yifan Zhou, Anchengcheng Agrawal, Kunal Lee, I-Ting Angelina Washington Univ St Louis MO 63110 USA

ISBN: (纸本)9781665481069

A race detector for task-parallel code typically consists of two main components- a reachability analysis component that checks whether two instructions are logically in parallel and an access history component that keeps track of memory locations accessed by previous instructions. Race detectors from prior work typically utilize a hashmap to maintain the access history, which provides asymptotically optimal overhead per operation but can incur significant overhead in practice, since the detector needs to insert into and query the hashmap for every memory access. An exception is STINT by Xu et al., which race detects task-parallel code by coalescing memory accesses into intervals, or continuous memory locations accessed within a sequence of instructions without any parallel construct. STINT utilizes a treap to manage access history that allows for insertions and queries of non-overlapping intervals. While a treap incurs higher asymptotic overhead per operation, this strategy works well in practice as the race detector performs operation on the access history with much lower frequency compared to the strategy that utilizes a hashmap. STINT only executes task-parallel code sequentially, however, due to the unique design of their treap that ensures no overlapping intervals exist in the tree. parallelizing STINT efficiently is non-trivial, as it would require a concurrent treap that ensures no overlapping interval, which is challenging to design and likely incurs high synchronization overhead. This work proposes PINT, a race detector that, like STINT, race detects task-parallel code at the interval granularity and utilizes the same treap design to maintain access history. PINT executes the computation in parallel, however, while keeping the parallelization / synchronization overhead low. A key insight is that, PINT separates out operations needed for race detection into the core part (e.g., reachability maintenance) and the access history part. Doing so allows PINT to p

关键词： distributed processing Codes Detectors Maintenance engineering History Synchronization Task analysis

来源：评论

学校读者我要写书评

暂无评论

The Universal Gossip Fighter 36

The Universal Gossip Fighter

引用

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

作者： Gorbunova, Anastasiia Guerraoui, Rachid Kermarrec, Anne-Marie Kucherenko, Anastasiia Pinot, Rafael Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781665481069

The notion of adversary is a staple of distributed computing. An adversary typically models "hostile" assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attacker that can hack machines. So far, the goal of distributed computing researchers has mainly been to develop a distributed algorithm that can face a given adversary, the abstraction characterizing worst-case scenarios. This paper initiates the study of the somehow opposite approach. Given a distributed algorithm, the adversary is the abstraction we seek to implement. More specifically, we consider the problem of controlling the spread of messages in a large-scale system, conveying the practical motivation of limiting the dissemination of fake news or viruses. Essentially, we assume a general class of gossip protocols, called all-to-all gossip protocols, and devise a practical method to hinder the dissemination. We present the Universal Gossip Fighter (UGF). Just like classical adversaries in distributed computing, UGF can observe the status of a dissemination and decide to stop some processes or delay some messages. The originality of UGF lies in the fact that it is universal, i.e., it applies to any all-to-all gossip protocol. We show that any gossip protocol attacked by UGF ends up exhibiting a quadratic message complexity (in the total number of processes) if it achieves sublinear time of dissemination. We also show that if a gossip protocol aims to achieve a message complexity ff times smaller than quadratic, then the time complexity rises exponentially in relation to ff. We convey the practical relevance of our theoretical findings by implementing UGF and conducting a set of empirical experiments that confirm some of our results.

关键词： distributed Computing Gossip Protocols Adaptive Adversaries

来源：评论

学校读者我要写书评

暂无评论

A parallel Workflow for Polar Sea-Ice Classification using Auto-labeling of Sentinel-2 Imagery

A Parallel Workflow for Polar Sea-Ice Classification using A...

引用

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

作者： Iqrah, Jurdana Masuma Wang, Wei Xie, Hongjie Prasad, Sushil K. Univ Texas San Antonio Dept Comp Sci San Antonio TX 78249 USA Univ Texas San Antonio Dept Earth & Planetary Sci San Antonio TX USA

ISBN: (纸本)9798350364613;9798350364606

The observation of the advancing and retreating pattern of polar sea ice cover stands as a vital indicator of global warming. This research aims to develop a robust, effective, and scalable system for classifying polar sea ice as thick/snow-covered, young/thin, or open water using Sentinel-2 (S2) images. Since the 52 satellite is actively capturing high-resolution imagery over the earth's surface, there are lots of images that need to be classified. One major obstacle is the absence of labeled 52 training data (images) to act as the ground truth. We demonstrate a scalable and accurate method for segmenting and automatically labeling S2 images using carefully determined color thresholds. We employ a parallel workflow using PySpark to scale and achieve 9-fold data loading and 16-fold map-reduce speedup on auto-labeling S2 images based on thin cloud and shadow filtered color-based segmentation to generate label data. The auto-labeled data generated from this process are then employed to train a U-Net machine learning model, resulting in good classification accuracy. As training the U-Net classification model is computationally heavy and time-consuming, we distribute the U-Net model training to scale it over 8 GPLJs using the Horovod framework over a DGX cluster with a 7.2 lx speedup without affecting the accuracy of the model. Using the Antarctic's Ross Sea region as an example, the U-Net model trained on autolabeled data achieves a classification accuracy of 98.97% for auto-labeled training datasets when the thin clouds and shadows from the S2 images are filtered out.

关键词： Polar Sea Ice Sentinel-2 Sea Ice Classification Auto-labeling parallel processing distributed Deep Learning Synchronous Data parallel

来源：评论

学校读者我要写书评

暂无评论

Accelerating Deep Learning based Identification of Chromatin Accessibility from noisy ATAC-seq Data 36

Accelerating Deep Learning based Identification of Chromatin...

引用

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

作者： Chaudhary, Narendra Misra, Sanchit Kalamkar, Dhiraj Heinecke, Alexander Georganas, Evangelos Ziv, Barukh Adelman, Menachem Kaul, Bharat Intel Parallel Comp Lab Bangalore Karnataka India Intel Corp Parallel Comp Lab Santa Clara CA USA Intel Corp Haifa Israel

ISBN: (纸本)9781665497473

Identifying accessible chromatin regions is a fundamental problem in epigenomics with ATAC-seq being a commonly used assay. Exponential rise in ATAC-seq experiments has made it critical to accelerate processing of ATAC-seq data that can have a low signal-to-noise ratio for various reasons including low coverage or low cell count. To denoise and identify accessible chromatin regions from noisy ATAC-seq data, use of deep learning on 1D data - using large filter sizes, long tensor widths, and/or dilation - has recently been proposed. Convolutions over 1D data consume a majority of the runtime in these methods. However, existing implementations of the 1D convolution layer for CPUs and GPUs fail to efficiently use the underlying architecture especially in the case of large filter sizes, long tensor widths, and dilation. Here, we present ways to accelerate the end-toend training performance of these deep learning based methods. We evaluate our approach on the recently released AtacWorks toolkit using modern CPUs. Compared to AtacWorks running on an Nvidia DGX-1 box with 8 V100 GPUs, we get up to 2.27 x speedup using just 16 CPU sockets. To achieve this, we build an efficient 1D dilated convolution layer and demonstrate reduced precision (BFloatl6) training and nearly linear scaling from 1 to 16 sockets.

关键词： chromatin accessibility ATAC-seq single cell analysis deep learning 1D convolutions architecture-aware optimizations SIMD BF16

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：