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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

268 篇 会议
18 册 图书
6 篇 期刊文献

馆藏范围

292 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

231 篇 工学
- 224 篇 计算机科学与技术...
- 159 篇 软件工程
- 29 篇 信息与通信工程
- 23 篇 电气工程
- 13 篇 电子科学与技术（可...
- 12 篇 控制科学与工程
- 7 篇 生物工程
- 4 篇 机械工程
- 4 篇 冶金工程
- 4 篇 生物医学工程（可授...
- 3 篇 农业工程
- 2 篇 力学（可授工学、理...
- 2 篇 仪器科学与技术
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 1 篇 光学工程
68 篇 理学
- 56 篇 数学
- 8 篇 生物学
- 6 篇 系统科学
- 4 篇 物理学
- 3 篇 统计学（可授理学、...
- 2 篇 地球物理学
- 1 篇 化学
- 1 篇 大气科学
22 篇 管理学
- 15 篇 管理科学与工程(可...
- 11 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 法学
- 4 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

14 篇 parallel computi...
12 篇 algorithm analys...
10 篇 parallel program...
10 篇 parallel algorit...
9 篇 software enginee...
9 篇 computer communi...
7 篇 parallel algorit...
7 篇 parallel process...
7 篇 gpu
6 篇 parallel process...
6 篇 high performance...
5 篇 scalability
5 篇 information syst...
5 篇 mapreduce
5 篇 artificial intel...
5 篇 distributed comp...
4 篇 parallel archite...
4 篇 matrix algebra
4 篇 combinatorial op...
4 篇 management of co...

机构

7 篇 natl univ def te...
5 篇 city university ...
4 篇 chinese acad sci...
4 篇 hainan internati...
4 篇 natl univ def te...
3 篇 seecs university...
3 篇 department of co...
3 篇 key laboratory o...
3 篇 school of inform...
3 篇 peking univ eecs...
3 篇 laboratory of di...
2 篇 advanced institu...
2 篇 college of compu...
2 篇 computer network...
2 篇 saarland informa...
2 篇 guangdong key la...
2 篇 icar-cnr and uni...
2 篇 guangdong prov k...
2 篇 heilongjiang uni...
2 篇 department of co...

作者

5 篇 wang guojun
5 篇 wanlei zhou
5 篇 liu jie
4 篇 yang xiang
4 篇 su jinshu
4 篇 nakano koji
4 篇 michael hobbs
4 篇 gao yutong
4 篇 liu xuan
4 篇 huang zhen
4 篇 wang qinglin
4 篇 wang xiaofeng
4 篇 ivan stojmenovic
4 篇 chen yifeng
4 篇 albert zomaya
4 篇 zomaya albert
3 篇 chen peixin
3 篇 zhang lei
3 篇 li kenli
3 篇 li dongsheng

语言

290 篇 英文
2 篇 中文

检索条件"任意字段=6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP"

共 292 条记录，以下是41-50 订阅

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

详细简洁

排序：

parallel Implementation of Number-theoretic Transform on GPU Clusters 24th

Parallel Implementation of Number-Theoretic Transform on G...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Takahashi, Daisuke Center for Computational Sciences University of Tsukuba 1-1-1 Tennodai Ibaraki Tsukuba305-8577 Japan

ISBN: (纸本)9789819615414

In this paper, we propose a parallel implementation of the number-theoretic transform (NTT) on GPU clusters. the butterfly operation of the NTT can be performed using modular addition, subtraction, and multiplication. We show that the four-step fast Fourier transform algorithm can be applied to the NTT. We parallelized the four-step NTT using MPI and OpenACC on GPU clusters. We achieved a performance of over 745 giga-operations per second on 32 nodes of a GPU cluster equipped with NVIDIA H100 PCIe GPUs for a 235-point NTT with a modulus of 63 bits. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Towards Information Sharing Beetle Antennae Search Optimization 24th

Towards Information Sharing Beetle Antennae Search Optimizat...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Liu, Xuan Wang, Chenyan Liu, Wenjian Zhang, Lefeng Liu, Xianggan Gao, Yutong Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance of MOE Minzu University of China Beijing China Hainan International College of Minzu University of China Li’an International Education Innovation pilot Zone Hainan China City University of Macau China Natural Language Processing and Knowledge Graph Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9789819615278

the study of bioinformatics-based evolutionary computation has long been of significant interest within the scientific community. Beetle antennae search algorithm is widely used because of its lightweight, however, it lacks information sharing due to individual iteration in the algorithm. In this paper, we propose an innovative pheromone-based beetle antennae search algorithm, which evolves from a single iterative individual in BAS algorithm to multiple parallel iterative individuals and incorporates the pheromone sharing mechanism found in ant colony optimization algorithm. Applying the pheromone-based beetle antennae search algorithm to the virtual machine placement problem in cloud computing, we find that pheromone sharing mechanism allows the PB-BAS algorithm to exhibit superior optimization capabilities and effectively avoids convergence to local optimal. To verify the performance of the algorithm, we select other alternative algorithms and conduct a large number of comparative experiments under different experimental setups, the experimental results show the effectiveness and efficiency of our algorithm. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Data Poisoning Attack Against Reinforcement Learning from Human Feedback in Robot Control Tasks 24th

Data Poisoning Attack Against Reinforcement Learning from H...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Zhou, Zihui Gao, Yutong Qi, Minfeng Wuhan430074 China Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance Ministry of Education Minzu University of China Beijing100081 China Hainan International College of Minzu University of China Li’an International Education Innovation pilot Zone Hainan572499 China City University of Macau 999078 China

ISBN: (纸本)9789819615247

Reinforcement Learning from Human Feedback (RLHF) technology provides a method for agents to learn human preferences and perform actions that satisfy human desires. this technology was originally used to complete robot control tasks in situations where it was difficult to design a reward function. However, in the process of collecting human feedback, malicious human annotators may launch attacks on RLHF, posing a significant challenge to the technology. Previous research has mostly focused on studying the harm caused by different attacks on RLHF in fine-tuning large language models (LLMs). However, our study is focused on the field of robot control. We designed two data poisoning attacks against human feedback datasets and implemented our attacks in three different offline reinforcement learning (RL) environments. the experimental results show that RLHF is vulnerable to data poisoning attacks in robot control tasks. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

PEbfs: Implement High-Performance Breadth-First Search on PEZY-SC3s 24th

PEbfs: Implement High-Performance Breadth-First Search on P...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Guo, Weihao Wang, Qinglin Liu, Xiaodong Peng, Muchun Yang, Shun Liang, Yaling Shi, Yongzhen Cao, Ligang Liu, Jie Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology Changsha410073 China Engineering Research Center for National Fundamental Software National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789819615506

the breadth-first search (BFS) algorithm is a fundamental algorithm in graph theory, and it’s parallelization can significantly improve performance. therefore, there have been numerous efforts to leverage the powerful parallel computing capabilities of hardware like GPGPU to implement high-performance BFS algorithms. However, the energy efficiency is relatively low due to the high power consumption of the platforms on which the algorithm is adapted to. To deal with these challenges, this paper introduces PEbfs that is a high-performance BFS algorithm based on the PEZY-SC3s efficient processor. We integrated three search algorithms, two algorithm optimization strategies, and a directional optimization scheme into PEbfs. through multiple evaluations of the performance of PEbfs on the public SNAP dataset, the results demonstrate that the average energy efficiency ratio of PEbfs is higher than that of Enterprise and Tigr, the two most advanced implementations on Nvidia’s GPGPU: It achieves 3.08× the average energy efficiency ratio of Enterprise and 4.53× that of Tigr. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Federated Learning and parallel Prompt Scheduling Strategies for Large Language Models 24th

Federated Learning and Parallel Prompt Scheduling Strategie...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Lv, Guangtong Gu, Bruce Jia, Xiaocong Gao, Longxiang Qu, Youyang Cui, Lei Jinan China Shandong Provincial Key Laboratory of Computer Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9789819615278

Large language models have garnered significant attention and are widely utilized across different fields due to their impressive performance. However, centralized training of these models can pose privacy risks like data leakage, hindering their application and advancement. As a decentralized learning paradigm, Federated Learning(FL) can effectively address data security in large language models and has specific application scenarios. In addition, the fine-tuning process of large language models also incurs significant communication expenses and leads to the loss of computational resources. the utilization of prompt tuning in federated learning is anticipated to decrease training costs, accelerate the training process, and enhance model performance. In this paper, we propose ‘FedLLM-ppS’ to explore a novel approach for large language models within federated learning. this method address data security concerns associated with large language models while enhancing performance and efficiency. Experiments based on several datasets for various Natural Language processing(NLP) tasks demonstrate superior performance and efficiency compared to baseline methods. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Hybridization of One- and Two-Point Bandits Convex Optimization in Non-stationary Environments 24th

Hybridization of One- and Two-Point Bandits Convex Optimiz...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Zeng, Gailun Guo, Jianxiong Advanced Institute of Natural Sciences Beijing Normal University Zhuhai China Hong Kong Baptist University Hong Kong Guangdong Key Lab of AI and Multi-modal Data Processing Department of Computer Science BNU-HKBU United International College Zhuhai China

ISBN: (纸本)9789819615278

Bandit Convex Optimization (BCO) is an imperative analysis framework when dealing with sequential decision-making problems. Considering to balance the computational cost and bounds of regrets, in this paper, we propose a hybridized algorithm of one- and two-point bandit convex models in non-stationary environments and use a more general performance measure dynamic regret, which records the cumulative difference between function loss and a feasible comparator sequence during the time horizon T. the path length of a comparator sequence PT reveals the non-stationarity of environments. Our proposed algorithm builds an upper bound of dynamic regret O((1+PT)1/2[β(λT)1/2+((1-λ)T)3/4]), where the parameter λ can dynamically adjust the bound guarantee to balance the computational cost in real applications. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Comparators (optical)

来源：评论

学校读者我要写书评

暂无评论

MARO: Enabling Full MPI Automatic Refactoring in DSL-Based Programming Framework 24th

MARO: Enabling Full MPI Automatic Refactoring in DSL-Based ...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Lei, Tong Chen, Zongjing Che, Yonggang Xu, Chuanfu Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789819615445

Currently, the landscape of computer hardware architecture presents the characteristics of heterogeneity and diversity, prompting widespread attention to cross-platform portable parallel programming techniques. Most existing portable programming approaches adopt the "MPI+X" strategy, focusing mainly on node-level "X" parallelism, while inter-node parallelization still relies on manual MPI programming. OP2 is a domain-specific language-based portable parallel programming framework for unstructured mesh applications that supports the automatic generation of MPI parallel code. However, programmers must manually write pre-processing code during code refactoring, such as handling the mapping relationship between global and process-local variables and the initial distribution of process-local data. In this paper, we propose MARO (MPI Automatic Refactoring for OP2), an automatic refactoring method for generating pre-processing code targeting MPI code generation within the OP2 programming framework for unstructured mesh applications. this method automatically generates the pre-processing code required for MPI parallelism through the source-to-source translator, enabling OP2 to generate MPI parallel code without requiring users to write MPI-related code manually. We compare the automatically refactored OP2 applications using the proposed method with those manually refactored to validate its effectiveness. the proposed method enhances OP2’s automatic parallel code generation capability, enabling it to achieve fully automatic MPI parallelization. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

A Mini-model can Make Machine Unlearning Better 24th

A Mini-model can Make Machine Unlearning Better

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Zhao, Mingkang Yu, Weng Zhu, Congcong China University of Geosciences Wuhan China Ministry of Education Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance School of Information Engineering Beijing China Hainan International College of Minzu University of China Li’an International Education Innovation pilot Zone Hainan572499 China City University of Macau 999078 China

ISBN: (纸本)9789819615247

In recent years, with the development of machine learning, plenty of personal data have been utilized in the training process of the models which incurs severe privacy leakage in the field. Current regulations mandate the removal of private user information from both databases and machine learning models upon specific deletion requests. While wiping data records from memory storage is a straightforward task, eliminating the influence of specific data samples from an already-trained model is challenging. Numerous studies in machine unlearning focus on mitigating the impact of target data by adjusting model parameters in deep learning. However, existing methods for data removal in deep learning often fall short of meeting real-world practicality. the intricacies of deep neural networks make unlearning in deep learning a less expedient process than retraining from scratch. For example, some methods require a ton of matrix calculations or even more complicated computations, and some algorithms need a lot of space, which ends up hindering their effectiveness in real-world applications. Accordingly, we’ve come up with a more practical solution. Our method just needs a small part of the validation dataset to pre-train a mini-model to update the parameters of the target model quickly. With this assistant model, we can quickly and accurately unlearn target classes and items. We prove that our proposed method is highly effective in unlearning tasks with not very large amounts of data. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Dynamic Offloading Control for Waste Sorting Based on Deep Q-Network 24th

Dynamic Offloading Control for Waste Sorting Based on Deep...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Wang, Jing Wang, Xiaoyang Guo, Jianxiong Tang, Zhiqing Ding, Xingjian Wang, Tian Advanced Institute of Natural Sciences Beijing Normal University Zhuhai China Guangdong Key Lab of AI and Multi-modal Data Processing Department of Computer Science BNU-HKBU United International College Zhuhai China Faculty of Information Technology Beijing University of Technology Beijing China

ISBN: (纸本)9789819615278

With the increasing concern for environmental protection and resource optimization, efficient waste sorting has become a serious challenge today. In this paper, we propose a new offloading control problem that aims to solve waste sorting in wireless bin communication networks. Due to limited computational power, bins belonging to embedded devices rely on simple classification models with varying accuracy. In this scenario, consider a network of intelligent bins, each acting as an independent agent capable of deciding to offload an image to the edge server with a more accurate but resource-intensive model when the local classification is deemed inaccurate. thus, Our goal is to find a lightweight online offloading policy that can achieve the best possible sorting accuracy while balancing transmission traffic. the method utilizes a Deep Q-network algorithm that enables each intelligent bin to make image-processing decisions autonomously. In the experiment, we validate the effectiveness of improving the performance of waste classification compared with existing flow control methods. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Distributed Resource Allocation Intelligent Waste Management Waste Sorting Wireless Communication Network

来源：评论

学校读者我要写书评

暂无评论

Dynamic Privacy Protection with Large Language Model in Social Networks 24th

Dynamic Privacy Protection with Large Language Model in So...

引用

24th international conference on algorithms and architectures for parallel processing, ica3pp 2024

作者： Xie, Yizhe Zhu, Congcong Zhang, Xinyue Hu, Xiangyu Liu, Xuan School of Data Science City University of Macau Macau China Hainan International College Minzu University of China Hainan China School of Information Engineering Minzu University of China Beijing China School of Information and Software Engineering University of Electronic Science and Technology of China Sichuan China

ISBN: (纸本)9789819615445

In contemporary social networks, dynamic privacy protection remains a pivotal yet challenging endeavor due to the intricate and evolving nature of information exchange. Traditional privacy models, predominantly static, falter in effectively safeguarding privacy amidst the complex interplay of continuously changing network interactions and structures. Addressing these deficiencies, this study introduces a novel dynamic privacy protection system anchored by large language model (LLM). Leveraging the natural language processing prowess of LLM, this system excels in real-time, context-sensitive analysis and protection of textual data within vast and variable social networks. By integrating closed-loop control theory, the system adeptly balances robust privacy safeguards with the requisite fluidity of information exchange. Experimental validations on large network datasets illustrate the system’s adeptness in balancing privacy leaks and information distortion through intelligent adaptations to privacy thresholds and strategic noise injection. the outcomes highlight the system’s utility in enhancing data security and operational efficiency, promising significant implications for future applications in broader domains such as mobile computing and IoT. this study not only propels forward the capabilities of dynamic privacy protection mechanisms but also sets a foundational architecture for subsequent innovations in privacy-sensitive, data-intensive environments. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：