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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

108 篇 会议
13 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

85 篇 工学
- 83 篇 计算机科学与技术...
- 53 篇 软件工程
- 8 篇 电子科学与技术（可...
- 6 篇 信息与通信工程
- 4 篇 力学（可授工学、理...
- 4 篇 电气工程
- 4 篇 农业工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 石油与天然气工程
- 1 篇 核科学与技术
51 篇 理学
- 51 篇 数学
- 8 篇 统计学（可授理学、...
- 3 篇 物理学
- 2 篇 系统科学
11 篇 管理学
- 7 篇 管理科学与工程(可...
- 6 篇 工商管理
- 4 篇 图书情报与档案管...
4 篇 农学
- 4 篇 作物学
1 篇 经济学
- 1 篇 应用经济学

主题

20 篇 parallel archite...
17 篇 parallel algorit...
15 篇 programming
15 篇 parallel process...
8 篇 computer archite...
8 篇 parallel program...
7 篇 parallel process...
5 篇 approximation al...
5 篇 hardware
4 篇 computational mo...
4 篇 graphics process...
3 篇 performance
3 篇 routing
3 篇 computer systems...
3 篇 memory managemen...
3 篇 algorithm design...
3 篇 parallel computi...
3 篇 field programmab...
3 篇 scheduling
3 篇 data models

机构

4 篇 carnegie mellon ...
2 篇 harvard univ div...
2 篇 bar ilan univ de...
2 篇 paderborn univ p...
2 篇 school of comput...
2 篇 mit comp sci & a...
2 篇 school of comput...
2 篇 suny stony brook...
1 篇 instutut d'elect...
1 篇 univ wroclaw ins...
1 篇 faculty of compu...
1 篇 inesc-id isel ip...
1 篇 dipartimento di ...
1 篇 ens rennes renne...
1 篇 ecole cent paris
1 篇 soochow univ sch...
1 篇 department of co...
1 篇 state key lab of...
1 篇 cinvestav tamaul...
1 篇 dept. of electro...

作者

4 篇 blelloch guy e.
4 篇 tangwongsan kana...
2 篇 ballard grey
2 篇 holtz olga
2 篇 varman peter j.
2 篇 jianxi fan
2 篇 anon
2 篇 jigang wu
2 篇 hasenplaugh will...
2 篇 bender ma
2 篇 schardl tao b.
2 篇 schwartz oded
2 篇 simhadri harsha ...
2 篇 kaler tim
2 篇 lipshitz benjami...
2 篇 klein st
2 篇 leiserson charle...
2 篇 rabin mo
2 篇 vishkin uzi
2 篇 demmel james

语言

120 篇 英文
2 篇 其他

检索条件"任意字段=12th ACM Symposium on Parallel Algorithms and Architectures"

共 122 条记录，以下是1-10 订阅

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

详细简洁

排序：

2021 12th International symposium on parallel architectures, algorithms and Programming, PAAP 2021

2021 12th International Symposium on Parallel Architectures,...

引用

12th International symposium on parallel architectures, algorithms and Programming, PAAP 2021

ISBN: (纸本)9781665496391

the proceedings contain 36 papers. the topics discussed include: accelerating a lossy compression method with fine-grained parallelism on a GPU;a parallel algorithm to construct node-independent spanning trees on the line graph of locally twisted cube;FEAS: a faster event-driven accelerator supporting inhibitory spiking neural network;efficient distributed parallel aligning reads and reference genome with many repetitive subsequences using compact De Bruijn graph;efficient algorithm for home care scheduling with budget constraint;optimizations of a linear matrix solver in a composite simulation for a vector computer;a GA-based energy aware virtual machine placement algorithm for cloud data centers;joint optimization of path planning and task assignment for space robot;infectious disease dynamics model considering suspected population;on the adoption of metaheuristics for solving 0–1 knapsack problems;ternary optical computer: an overview and recent developments;and path integral Monte Carlo quantum annealing-based clustering and routes optimization of clustered UAV network.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: From Describing algorithms to Describing architectures 24

Optimisation and Evaluation of Breadth First Search with one...

引用

12th International Workshop on OpenCL and SYCL, IWOCL 2024

作者： Olgu, Kaan Kenter, Tobias Nunez-Yanez, Jose McIntosh-Smith, Simon School of Electrical & Electronics Engineering University of Bristol United Kingdom Paderborn Center for Parallel Computing Department of Computer Science Paderborn University Germany Dept. Electrical Engineering Linkoping University Sweden

ISBN: (纸本)9798400717901

FPGAs are often used in scientific fields to process graph algorithms due to their energy efficiency, reconfigurability, and fine-grained parallelism. However, these algorithms face challenges in memory access patterns, scalability, and programmability. the SYCL2020 implementation in the Intel oneAPI toolchain supports FPGA targets alongside SYCL2020 features like modern C++ with a single-source offloading to improve programmability. this study analysed the Breadth-First Search algorithm on Stratix 10 FPGA with the Intel oneAPI toolchain. the implementation was done in two phases. At first, we applied the typical optimisations proposed in the official guidelines alongside an automatic cache to achieve proper pipelining and improve random memory accesses performance. However, limitations occurred with fine-grained parallelism, and it was competitive only to some related work that utilised hardware-description languages or established high-level synthesis tools. For the second phase, we added bit-level representations of data in memory, banking in on-chip memory, and fine-grained control over parallel data streams. the second implementation was generally superior or on par with all compared designs, outperforming other works in 10 out of 15 tested datasets, including various synthetic RMAT and real-world datasets, with a peak performance of 1021 MTEPS. © 2024 Owner/Author.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

GPU-Based parallel Path Planning for Mobile Robot Navigation in Dynamic Environments 23

GPU-Based Parallel Path Planning for Mobile Robot Navigation...

引用

12th International symposium on Information and Communication Technology, SOICT 2023

作者： Tran thi Cam, Giang Do, Duc Manh Do, Quoc Huy Huynh, thi thanh Binh Dinh, thi Ha Ly Hanoi University of Science and Technology Ha Noi Viet Nam

ISBN: (纸本)9798400708916

In our modern, ever-evolving, and intricately interconnected world, the task of planning optimal paths for mobile robots has emerged as a challenge. this challenge arises from our surroundings' growing dynamism and complexity, characterized by the continual variation of obstacles and environmental conditions. this paper proposes a new approach called the parallel Kinematic Rapidly Exploring Random Tree (PK-RRT) algorithm for mobile robot path planning in dynamic environments. Our PK-RRT algorithm incorporates kinematic constraints when the robot moves on the RRT tree to ensure that the paths generated are feasible and smooth. It also applies the multi-threading technique in which multiple threads work in parallel to speed up the path generation process and improve its convergence. We conducted a comprehensive performance comparison with two existing algorithms, namely Bidirectional Rapidly Exploring Random Tree (Bi-RRT) and Quadratic Rapidly Exploring Random Tree (Quad-RRT). the results show that our PK-RRT algorithm reduces the computation time by 30%, improves the computational efficiency by 40%, and increases the stability by 50% compared to the existing algorithms. © 2023 acm.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed parallel Aligning Reads and Reference Genome with Many Repetitive Subsequences Using Compact de Bruijn Graph 12

Efficient Distributed Parallel Aligning Reads and Reference ...

引用

12th International symposium on parallel architectures, algorithms and Programming (PAAP)

作者： Li, Yao Zhong, Cheng Chen, Danyang Zhang, Jinxiong Yin, Mengxiao Guangxi Univ Sch Comp Elect & Informat Nanning Peoples R China Guangxi Univ Key Lab Parallel Distributed Comp Technol Nanning Peoples R China

ISBN: (纸本)9781665496391

A large number of reads generated by the next generation sequencing platform will contain many repetitive subsequences. Effective localizing and identifying genomic regions containing repetitive subsequences will contribute to the subsequent genomic data analysis. To accelerate the alignment between large-scale short reads and reference genome with many repetitive subsequences, this paper develops a compact de Bruijn graph based short-read alignment algorithm on distributed parallel computing platform. the algorithm uses resilient distributed data sets (RDDS) to perform calculations in memory, and executes the broadcast method to distribute short reads and reference genome to the computing nodes to reduce the data communication time on the cluster system, and the number of RDD partitions is set to optimize the performance of parallel aligning algorithm. Experimental results on real datasets show that compared with the compact de Bruijn graph based sequential short-read alignment algorithm, our implemented distributed parallel alignment algorithm achieves good acceleration on the premise of obtaining the same correct alignment percentage as a whole, and compared with existing distributed parallel alignment algorithms, the implemented parallel algorithm can more quickly complete the alignment between large-scale short reads and reference genome with highly repetitive subsequences.

关键词： read alignment highly repetitive subsequences compact de Bruijn graph Hash indexing distributed parallel computing

来源：评论

学校读者我要写书评

暂无评论

A parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube 12

A Parallel Algorithm to Construct Node-Independent Spanning ...

引用

12th International symposium on parallel architectures, algorithms and Programming (PAAP)

作者： Pan, Zhiyong Cheng, Baolei Fan, Jianxi Zhang, Huanwen Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China

ISBN: (纸本)9781665496391

An interconnection network can be abstracted into a graph, and the basic mathematical research in the graph can provide a good reference for the research in the practical application. the study of node-independent spanning trees (node-ISTs) in a graph has received extensive attention because of their application in reliable communication, fault-tolerant broadcasting and secure message distribution, and has achieved remarkable results on many special networks. But there are few results in the line graph of them. As one of the typical variations of hypercube, locally twisted cube has many excellent properties, whose line graph has all the advantages of locally twisted cube. So it makes sense to do some research on the line graph of locally twisted cube. In this paper, we propose a parallel algorithm to construct 2n -2 node-ISTs rooted at node [u,N(u, 2)], where u is an arbitrary node on locally twisted cube and n >= 1. And the correctness of our algorithm is proved.

关键词： Locally twisted cube Line graph parallel algorithm Node-independent spanning trees

来源：评论

学校读者我要写书评

暂无评论

Research Progress and Clinical Application of Radiomics

Research Progress and Clinical Application of Radiomics

引用

International symposium on parallel architectures, algorithms and Programming (PAAP)

作者： Ying Liu Jingyu Liu Fan Zhang School of computer and Information Engineering Henan University Kaifeng China

ISBN: (纸本)9781665496407

Radiomics is an important artificial intelligence auxiliary means that can help clinicians get more accurate information and reference basis from patient images. It extracts massive features of lesions from patient images and combines them with clinical, pathological and other data to build models for diagnosis, evaluation and prognosis of related diseases, so as to assist doctors to make more accurate clinical decisions. Radiomics has achieved many remarkable results in the clinical field, which shows that radiomics has great clinical application potential. this paper mainly introduces the related concepts, specific analysis process, clinical application and research progress of radiomics in recent years, analyzes the limitations of current radiomics, and finally looks forward to the future development direction of radiomics.

关键词： Pathology Medical services Programming Feature extraction Data models parallel architectures Lesions

来源：评论

学校读者我要写书评

暂无评论

On the adoption of Metaheuristics for Solving 0–1 Knapsack Problems

On the adoption of Metaheuristics for Solving 0–1 Knapsack ...

引用

International symposium on parallel architectures, algorithms and Programming (PAAP)

作者： Yang Qiu Haomiao Li Xiao Wang Omar Dib Wenzhou-Kean University Wenzhou CHINA

ISBN: (纸本)9781665496407

0-1 knapsack problem is a classical Non-deterministic Polynomial Hard (NP-Hard) problem in combinatorial optimization. It has a wide range of applications in real life, such as the distribution of goods in logistics companies, capital calculation, storage, and distribution, etc. this paper studies the adoption of three meta-heuristic approaches for solving the 0–1 knapsack problem. A novel quantum-inspired Tabu Search (QTS) that combines a classical Tabu Search (TS) and Quantum-inspired Evolutionary Algorithm (QEA), Ant Colony swarm intelligence Algorithm (ACO), and Genetic Algorithm (GA) with augmented fitness function. Based on empirical analysis of computer simulations and comparative demonstrations, we show that applying such metaheuristic results in high efficiency in terms of the quality of obtained solutions, computational time, and robustness when dealing with the underlying 0–1 knapsack optimization problem.

关键词： NP-hard problem Metaheuristics Qubit Programming Robustness parallel architectures Time complexity

来源：评论

学校读者我要写书评

暂无评论

Research and Application of Knowledge Graph Technology for Intelligent Question Answering

Research and Application of Knowledge Graph Technology for I...

引用

International symposium on parallel architectures, algorithms and Programming (PAAP)

作者： Chengrong Lin Shaofan Chen Xiaoran Yang Caimao Li Cong Qu Qiuhong Chen Hainan University Haikou Hainan China Hefei University of Technology Hefei Anhui China

ISBN: (纸本)9781665496407

With the development and application of artificial intelligence technology, knowledge graph gradually becomes one of the key technologies. To solve the data sparsity problem of knowledge graph and improve the efficiency of knowledge graph completion, a knowledge representation model (ISTransE) was proposed, which combined the importance information of entities and relationship strength characteristics. We combine the BERT model and knowledge graph to study the key technology of Q&A, complete the relevant design of an intelligent Q&A system. And realize the intelligent Q&A system of automobiles based on the BERT entity recognition module, question relationship extraction module, answer retrieval module and construct the domain knowledge graph module. And the system is tested by corresponding experiments for Q&A. the test results show that this system can accurately answer the user's car-related knowledge.

关键词： Analytical models Bit error rate Knowledge representation Programming Data models Cognition parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed parallel Aligning Reads and Reference Genome with Many Repetitive Subsequences Using Compact de Bruijn Graph

Efficient Distributed Parallel Aligning Reads and Reference ...

引用

International symposium on parallel architectures, algorithms and Programming (PAAP)

作者： Yao Li Cheng Zhong Danyang Chen Jinxiong Zhang Mengxiao Yin Key Laboratory of Parallel School of Computer Electronics and Information Distributed Computing Technology in Guangxi Universities Guangxi University Nanning China

ISBN: (纸本)9781665496407

关键词： Sequential analysis Genomics Clustering algorithms Distributed databases Programming Partitioning algorithms parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Home Care Scheduling with Budget Constraint

Efficient Algorithm for Home Care Scheduling with Budget Con...

引用

International symposium on parallel architectures, algorithms and Programming (PAAP)

作者： Xinxuan Huang Jigang Wu Tonglai Liu Jinyao Huang School of Computer Science and Technology Guangdong University of Technology Guangzhou China College of Information Science and Technology Zhongkai University of Agriculture and Engineering Guangzhou China

ISBN: (纸本)9781665496407

Effective caregiver routing and scheduling methods can improve the service quality of home care and reduce operating costs. How to enable patients to obtain cost-effective home care services within a certain budget is a key issue. Few existing works take into account the patient's budget in home health care issues. therefore, we propose a new home care problem to minimize the route cost, which includes the weighted sum of total economic benefits, the dissatisfaction of patients and the travel time of caregivers, so as to ensure that caregivers can have satisfactory income and patients can obtain cost-effective services. A genetic algorithm (ARGA) customized with one crossover operation and six mutation operations is designed to solve this problem. Experimental results show that the algorithm ARGA can effectively reduce the route cost by 59.3%, 14.3% and 10.7% respectively, compared with the baselines BA, GA and TS.

关键词： Costs Medical services Programming Search problems Routing Scheduling parallel architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：