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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,282 篇 会议
47 篇 期刊文献
3 册 图书

馆藏范围

4,332 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,433 篇 工学
- 2,169 篇 计算机科学与技术...
- 1,080 篇 软件工程
- 607 篇 电气工程
- 586 篇 信息与通信工程
- 185 篇 仪器科学与技术
- 138 篇 控制科学与工程
- 120 篇 电子科学与技术（可...
- 64 篇 生物工程
- 59 篇 机械工程
- 43 篇 动力工程及工程热...
- 38 篇 交通运输工程
- 31 篇 生物医学工程（可授...
- 27 篇 安全科学与工程
- 26 篇 网络空间安全
- 24 篇 光学工程
- 23 篇 土木工程
- 22 篇 材料科学与工程（可...
- 20 篇 建筑学
- 19 篇 航空宇航科学与技...
418 篇 理学
- 253 篇 数学
- 86 篇 物理学
- 72 篇 生物学
- 51 篇 系统科学
- 42 篇 统计学（可授理学、...
262 篇 管理学
- 180 篇 管理科学与工程(可...
- 97 篇 图书情报与档案管...
- 66 篇 工商管理
35 篇 医学
- 30 篇 临床医学
33 篇 法学
- 19 篇 社会学
18 篇 经济学
- 18 篇 应用经济学
11 篇 农学
7 篇 教育学
7 篇 文学
2 篇 军事学
1 篇 艺术学

主题

543 篇 parallel process...
259 篇 computer archite...
238 篇 computational mo...
207 篇 distributed comp...
186 篇 concurrent compu...
179 篇 computer network...
164 篇 network topology
157 篇 hardware
157 篇 graphics process...
148 篇 routing
130 篇 bandwidth
123 篇 application soft...
120 篇 neural networks
120 篇 protocols
107 篇 scalability
104 篇 multicore proces...
103 篇 throughput
102 篇 algorithm design...
102 篇 kernel
101 篇 computer science

机构

15 篇 institute of inf...
14 篇 institute of com...
14 篇 science and tech...
13 篇 college of compu...
13 篇 school of cyber ...
13 篇 shandong fundame...
12 篇 school of comput...
10 篇 science and tech...
9 篇 univ chinese aca...
9 篇 university of ch...
9 篇 natl univ def te...
9 篇 natl univ def te...
8 篇 shenyang aerospa...
8 篇 beijing univ pos...
8 篇 nanjing univ aer...
8 篇 beijing universi...
7 篇 shanghai jiao to...
7 篇 college of compu...
7 篇 chinese acad sci...
7 篇 national key lab...

作者

17 篇 bagherzadeh nade...
16 篇 kotenko igor
14 篇 j. duato
12 篇 wang yijie
11 篇 daneshtalab maso...
10 篇 ebrahimi masoume...
10 篇 yijie wang
10 篇 nader bagherzade...
10 篇 igor kotenko
10 篇 lexi xu
9 篇 li dongsheng
9 篇 marco aldinucci
9 篇 matsutani hiroki
8 篇 hiroki matsutani
8 篇 masoumeh ebrahim...
8 篇 plosila juha
8 篇 marco danelutto
8 篇 wang huaimin
7 篇 tenhunen hannu
7 篇 xinzhou cheng

语言

4,273 篇 英文
50 篇 其他
11 篇 中文
1 篇 乌克兰文

检索条件"任意字段=Euromicro Conference on Parallel, Distributed and Network-Based Processing"

共 4332 条记录，以下是801-810 订阅

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

详细简洁

排序：

PrioRAT: Criticality-Driven Prioritization Inside the On-Chip Memory Hierarchy 27th

PrioRAT: Criticality-Driven Prioritization Inside the On-Chi...

引用

27th International European conference on parallel and distributed Computing (Euro-Par)

作者： Dimic, Vladimir Moreto, Miquel Casas, Marc Valero, Mateo Barcelona Supercomp Ctr BSC Barcelona Spain Univ Politecn Catalunya UPC Barcelona Spain

ISBN: (纸本)9783030856656;9783030856649

The ever-increasing gap between the processor and main memory speeds requires careful utilization of the limited memory link. This is additionally emphasized for the case of memory-bound applications. Prioritization of memory requests in the memory controller is one of the approaches to improve performance of such codes. However, current designs do not consider high-level information about parallel applications. In this paper, we propose a holistic approach to this problem, where the runtime system-level knowledge is made available in hardware. Processor exploits this information to better prioritize memory requests, while introducing negligible hardware cost. Our design is based on the notion of critical path in the execution of a parallel code. The critical tasks are accelerated by prioritizing their memory requests within the on-chip memory hierarchy. As a result, we reduce the critical path and improve the overall performance up to 1.19 x compared to the baseline systems.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Cooperative Charging Algorithm based on K-mean++ Clustering for WRSN 19

Cooperative Charging Algorithm Based on K-mean++ Clustering ...

引用

19th IEEE International Symposium on parallel and distributed processing with Applications, 11th IEEE International conference on Big Data and Cloud Computing, 14th IEEE International conference on Social Computing and networking and 11th IEEE International conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2021

作者： Zeng, Ying Wang, Minghua Fan, Bo University of South China School of Electrical Engineering Hengyang China University of South China School of Electrical Engineering Hunan Province Key Laboratory For Ultra-Fast Micro/Nano Technology and Advanced Laser Manufacture Hengyang China

ISBN: (纸本)9781665435741

Wireless Rechargeable Sensor network(WRSN) is a system that uses wireless charging devices to supply energy to sensors in Wireless Sensor network(WSN). Using mobile wireless charging equipment, the charging efficiency of WSN will be improved. However, how to properly allocate mobile charging devices and plan routes for them has become a problem. In order to reduce the number of dead nodes in WSN, in this paper, we propose a collaborative charging algorithm based on k-mean++ clustering(KCCA). The algorithm uses k-mean++ to cluster WRSN, and uses a large charging vehicle with unlimited energy and multiple small charging vehicles with limited energy to charge the nodes and collect data in each cluster. The shortest charging time is modeled as a linear programming problem, and the charging path in the cluster is obtained by finding the optimal solution. The simulation results show that, compared with other proposed algorithms, KCCA can better reduce the number of dead nodes and the moving distance of wireless charging car. © 2021 IEEE.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Raw Ultrasound-based Phonetic Segments Classification Via Mask Modeling

Raw Ultrasound-Based Phonetic Segments Classification Via Ma...

引用

International conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Kang You Bo Liu Kele Xu Yunsheng Xiong Qisheng Xu Ming Feng Tamás Gábor Csapó Boqing Zhu Tongji University Shanghai China National University of Defense Technology Changsha China National Key Lab of Parallel and Distributed Processing Changsha China Budapest University of Technology and Economics Budapest Hungary

Ultrasound tongue imaging is widely used in clinical linguistics and phonetics. Recently, deep neural networks, especially convolutional neural networks, have been widely used in the interpretation and analysis of ultrasound tongue images (UTI). Despite achieving satisfactory performance, deep models rely on a large amount of manually labeled data, which is often difficult to obtain in practical settings. To address this issue, this paper focuses on how to utilize a large amount of unlabeled UTI data to improve the performance of UTI classification task. Specifically, we explore self-supervised learning with masking modeling strategy. By predicting the masked part, our pre-trained model enables the neural network to infer contextual information. Then, we fine-tune the pre-trained model with a small amount of labeled data. Compared with the previous competing algorithms, our method can improve the classification accuracy by an average of 13.33% in four different scenarios.

关键词： Ultrasonic imaging Tongue Neural networks Signal processing algorithms Imaging Self-supervised learning Phonetics

来源：评论

学校读者我要写书评

暂无评论

Trustworthy distributed Deep Neural network Training in an Edge Device network

Trustworthy Distributed Deep Neural Network Training in an E...

引用

IEEE International conference on Big Data

作者： Sudipta Saha Shubha Haiying Shen Department of Computer Science University of Virginia USA

ISBN: (纸本)9781665480468

With the increased usage of edge devices having local computation capabilities, deep neural network (DNN) training in a network of edge devices becomes promising. Several recent works have proposed fully edge-based distributed training systems for situations when the communication to cloud is unstable or intermittent. However, such distributed systems become vulnerable when there are untrusted devices that launch data and model poisoning attacks during training, deteriorating the accuracy of the DNN model. To handle this challenge, we propose a Trustworthy distributed system for Machine learning training in an edge device network (TrustMe). TrustMe realizes both data and model parallelisms. It detects the untrusted devices producing illegitimate outputs. Next, it reassigns the training tasks of the untrusted devices to other trusted devices in such a way that the reassignment and the training that is restarted after the reassignment require minimal time. Our container-based emulation and real device experiments demonstrate that TrustMe achieves up to 12% higher accuracy and 45% less training time compared to existing methods in the presence of untrusted devices.

关键词： Training Deep learning Image edge detection Neural networks Emulation distributed databases parallel processing

来源：评论

学校读者我要写书评

暂无评论

High-Order Faithful Interpretation Methods for Tensor-based CNNs

High-Order Faithful Interpretation Methods for Tensor-Based ...

引用

IEEE International conference on Big Data and Cloud Computing (BdCloud)

作者： Pengxu Chen Huazhong Liu Hanning Zhang Jihong Ding Yunfan Zhang Dehua Chen School of Comp. Sci. & Tech Hainan University Haikou China Innovation Research Institute China Unicom (Hainan) Haikou China School of Comp. Sci. & Tech Donghua University Shanghai China

Tensor-based Convolution Neural networks (CNNs) have achieved remarkable success in realizing multi-modal classification while mining the hidden relationships of big data. Nevertheless, these models exhibit high performance but low interpretability due to the numerous intricate and abstract internal network structures. Therefore, this paper focuses on exploring interpretation methods suitable for tensor-based CNN models. Concretely, this paper first presents a general interpretation method called high-order class activation mapping (HO-CAM), which leverages the internal structure of tensor-based CNN with global average pooling (GAP) and generate explanations by highlighting attention regions of prediction result. Then, to apply this high-order interpretation method to tensor-based CNNs with any structures, two advanced interpretation methods, namely high-order gradient-weighted class activation mapping (HOGCAM) and high-order layer class activation mapping (HOLCAM), are proposed by utilizing gradient information with two different weighting strategies. Experimental results demonstrate that HO-CAM performs best in explaining the last layer of specific tensor-based CNNs with GAP, HOG-CAM removes the reliance on GAP and is applicable to any forms of tensor-based CNNs, and HOL-CAM exhibits better interpretation performance than HOG-CAM across arbitrary layers of any models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HCPipe: Hidden Computation Pipeline Model parallelism for Large-scale DCNN Model Training

HCPipe: Hidden Computation Pipeline Model Parallelism for La...

引用

International conference on Computer Engineering and Applications (ICCEA)

作者： Bin Liu Yongyao Ma Zhonghao Zhang Zeyu Ji Guoqiang Hu Yijie Chen College of Information Engineering Northwest A&F University Yangling China Network and Educational Technology Center Northwest A&F University Yangling China

ISBN: (数字)9798350386776

ISBN: (纸本)9798350386783

The complexity of Deep Convolutional Neural networks (DCNNs) with big datasets significantly prolongs the time of model training. Pipeline Model parallelism (PMP) is a commonly used method in distributed training for shortening model time. However, traditional PMP methods struggle to maximize hidden computational, resulting in significant idle time. This paper introduces an innovative method, HCPipe, which employs a hidden computation method to overlap computation times further, effectively reducing idle time in pipeline training. The effectiveness of this method is firstly theoretically demonstrated. Subsequently, a model partitioning method based on dynamic programming is designed, aimed at rapidly dividing the model. To evaluate the performance of HCPipe, using the ImageNet dataset extensive experiments were conducted with ResNet and VGG models on a 4-GPU server. The experimental results indicate that the proposed HCPipe achieves significant performance improvements. Compared to GPipe, DAPPLE, and GEMS, the average throughput for the VGG series is increased by 13.3%, 4.6%, and 128%, respectively, while the average throughput for the ResNet series is increased by 27.8%, 14.4%, and 157%, respectively.

关键词： Training Computational modeling Pipelines Graphics processing units parallel processing Throughput Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

RSU-Aided Authentication for VANET based on Consortium Blockchain 27

RSU-Aided Authentication for VANET Based on Consortium Block...

引用

27th IEEE International conference on parallel and distributed Systems, ICPADS 2021

作者： Wang, Simeng Chen, Xing Tong, Fei Zhang, Yujian Southeast University Jiangsu Nanjing China Purple Mountain Laboratories Jiangsu Nanjing China

ISBN: (纸本)9781665408783

Vehicle Ad-hoc network (VANET) faces a large number of potential threats due to its openness and complexity. Identity authentication is the basis for resisting various attacks. Common approaches usually employ public key infrastructure, identity-based signature and cryptography-based algorithms, which either bring high computation and storage costs, have certificate issuance, revocation, and management problems, or exist centralization problems. In this paper, we propose an identity authentication scheme for VANET based on consortium blockchain, in which vehicle or Road-Side Unit (RSU) authenticity is verified by on-chain transactions instead of certificates in other blockchain schemes. To the end, a new data structure based on unspent transaction output is introduced to initiate a set of online operations. Furthermore, we put forward an RSU-aided scheme, in which only one additional step, namely fillToken operation, is required to reduce the communication delay of authentication after a vehicle first joins an RSU group through a series of online operations. We implement the proposed scheme in the Hyperledger Fabric platform and conduct security and performance analysis, which shows the effectiveness of our scheme. © 2021 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Chebyshev Polynomial Codes: Task Entanglement-based Coding for distributed Matrix Multiplication 38

Chebyshev Polynomial Codes: Task Entanglement-based Coding f...

引用

International conference on Machine Learning (ICML)

作者： Hong, Sangwoo Yang, Heecheol Yoon, Youngseok Cho, Taehyun Lee, Jungwoo Seoul Natl Univ Dept Elect & Comp Engn Commun & Machine Learning Lab Seoul 08826 South Korea Chungnam Natl Univ Div Comp Convergence Daejeon 34134 South Korea

ISBN: (纸本)9781713845065

distributed computing has been a prominent solution to efficiently process massive datasets in parallel. However, the existence of stragglers is one of the major concerns that slows down the overall speed of distributed computing. To deal with this problem, we consider a distributed matrix multiplication scenario where a master assigns multiple tasks to each worker to exploit stragglers' computing ability (which is typically wasted in conventional distributed computing). We propose Chebyshev polynomial codes, which can achieve order-wise improvement in encoding complexity at the master and communication load in distributed matrix multiplication using task entanglement. The key idea of task entanglement is to reduce the number of encoded matrices for multiple tasks assigned to each worker by intertwining encoded matrices. We experimentally demonstrate that, in cloud environments, Chebyshev polynomial codes can provide significant reduction in overall processing time in distributed computing for matrix multiplication, which is a key computational component in modern deep learning.

关键词： Chebyshev polynomials

来源：评论

学校读者我要写书评

暂无评论

Stream parallelism on the LZSS Data Compression Application for Multi-Cores with GPUs 27

Stream Parallelism on the LZSS Data Compression Application ...

引用

27th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Stein, Charles Michael Griebler, Dalvan Danelutto, Marco Fernandes, Luiz Gustavo Tres de Maio Fac SETREM LARCC Tres De Maio Brazil Pontifical Catholic Univ Rio Grande Sul PUCRS Sch Technol Porto Alegre RS Brazil Univ Pisa UNIPI Dept Comp Sci Pisa Italy

ISBN: (纸本)9781728116440

GPUs have been used to accelerate different data parallel applications. The challenge consists in using GPUs to accelerate stream processing applications. Our goal is to investigate and evaluate whether stream parallel applications may benefit from parallel execution on both CPU and GPU cores. In this paper, we introduce new parallel algorithms for the Lempel-Ziv-Storer-Szymanski (LZSS) data compression application. We implemented the algorithms targeting both CPUs and GPUs. GPUs have been used with CUDA and OpenCL to exploit inner algorithm data parallelism. Outer stream parallelism has been exploited using CPU cores through SPar. The parallel implementation of LZSS achieved 135 fold speedup using a multi-core CPU and two GPUs. We also observed speedups in applications where we were not expecting to get it using the same combine data-stream parallel exploitation techniques.

关键词： Graphics processing units Microsoft Windows Data compression Libraries parallel algorithms Acceleration

来源：评论

学校读者我要写书评

暂无评论

parallel Searching on Biological networks 27

Parallel Searching on Biological Networks

引用

27th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Bombieri, Nicola Bonnici, Vincenzo Giugno, Rosalba Univ Verona Dipartimento Informat Strata Grazie 15 I-37134 Verona Italy

ISBN: (纸本)9781728116440

Software applications for biological networks analysis rely on graphs to model the structure interactions. A great part of them requires searching for subgraphs in a target graph or in collections of graphs. Even though very efficient algorithms have been defined to solve such a subgraph isomorphisms problem, the complexity of current real biological networks make their sequential execution time prohibitive. On the other hand, parallel architectures, from multi-core to many-core, have become pervasive to deal with the problem of the data size. Nevertheless, the sequential nature of the graph searching algorithms makes their implementation for parallel architectures very challenging. This paper presents three different parallel solutions for the graph searching problem. The first two target the exact search for multi-core CPUs and many-core GPUs, respectively. The third one targets the approximate search for GPUs, which handles node, edge, and node label mismatches. The paper shows how different techniques have been developed in all the solutions to reduce the search space complexity. The paper shows the performance of the proposed solutions on representative biological networks containing antiviral chemical compounds and protein interactions networks.

关键词： Biology Search problems Complexity theory Graphics processing units Indexes Topology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共434页 << < 77 78 79 80 81 82 83 84 85 86 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：