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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,285 篇 会议
362 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

1,198 篇 distributed data...
995 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
778 篇 computer science
693 篇 databases
616 篇 computer archite...
586 篇 application soft...
559 篇 computational mo...
467 篇 parallel process...
369 篇 scalability
351 篇 distributed comp...
345 篇 distributed proc...
333 篇 hardware
325 篇 database systems
293 篇 parallel program...
293 篇 processor schedu...
290 篇 resource managem...
287 篇 costs
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
12 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
10 篇 j. saltz
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop

语言

9,597 篇 英文
63 篇 其他
21 篇 中文

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

共 9681 条记录，以下是891-900 订阅

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

详细简洁

排序：

parallel Algorithm to find Integer k where a given Well-distributed Graph is k-Metric Dimensional 1

引用

3rd international symposium on Signal and Image Processing, ISSIP 2020

作者： Chelladurai, Xavier Kureethara, Joseph Varghese Department of Sciences and Humanities Christ University Bangalore India Department of Mathematics Christ University Bangalore India

ISBN: (数字)9789813369665

ISBN: (纸本)9789813369658

Networks are very important in the world. In signal processing, the towers are modeled as nodes (vertices) and if two towers communicate, then they have an arc (edge) between them or precisely, they are adjacent. The least number of nodes in a network that can uniquely locate every node in the network is known in the network theory as the resolving set of a network. One of the properties that is used in determining the resolving set is the distance between the nodes. Two nodes are at a distance one if there is a single arc can link them whereas the distance between any two random nodes in the network is the least number of distinct arcs that can link them. We propose two algorithms in this paper with the proofs of correctness. The first one is in lines with the BFS that find distance between a designated node to every other node in the network. This algorithm runs in O(log n). The second algorithm is to identify the integer k, such that the given graph is k-metric dimensional. This can be implemented in O(log n) time with O(n2) processors in a CRCW PRAM. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Level parallelization Scheme for distributed HEVC Encoding on Multi-Computer systems 52

Multi-Level Parallelization Scheme for Distributed HEVC Enco...

引用

IEEE international symposium on Circuits and systems (ISCAS)

作者： Ahovainio, Sami Mercat, Alexandre Viitanen, Marko Vanne, Jarno Tampere Univ Comp Sci Tampere Finland

ISBN: (纸本)9781728133201

High Efficiency Video Coding (HEVC) creates the conditions for cost-effective video transmission and storage but its inherent computational complexity calls for efficient parallelization techniques. This paper provides HEVC encoders with a holistic parallelization scheme that exploits parallelism at data, thread, and process levels at the same time. The proposed scheme is implemented in the practical Kvazaar open-source HEVC encoder. It makes Kvazaar exploit parallelism at three levels: 1) Single Instruction Multiple Data (SIMD) optimized coding tools at the data level;2) Wavefront parallel Processing (WPP) and Overlapped Wavefront (OWF) parallelization strategies at the thread level;and 3) distributed slice encoding on multi-computer systems at the process level. Our results show that the proposed process-level parallelization scheme increases the coding speed of Kvazaar by 1.86x on two computers and up to 3.92x on five computers with +0.19% and +0.81% coding losses, respectively. Exploiting all these three parallelism levels on a five-computer setup gives almost a 25x speedup over a non-parallelized single-core implementation.

关键词： High Efficiency Video Coding (HEVC) multi-level parallelization HEVC parallelization strategies distributed HEVC encoding multi-computer systems

来源：评论

学校读者我要写书评

暂无评论

PAISE 2021: Workshop on parallel AI and systems for the Edge

2021 IEEE International Parallel and Distributed Processing ...

引用

2021 IEEE international parallel and distributed Processing symposium Workshops, IPDPSW 2021 - In conjunction with IEEE IPDPS 2021 2021年 842-844页

来源：评论

学校读者我要写书评

暂无评论

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

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.

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

来源：评论

学校读者我要写书评

暂无评论

Keynote Lecture : Towards Robust, Large-scale Concurrent and distributed Programming

Keynote Lecture : Towards Robust, Large-scale Concurrent and...

引用

international symposium on parallel and distributed Computing

作者： Philipp Haller KTH Royal Institute of Technology Stockholm Sweden

Summary form only given, as follows. The complete presentation was not made available for publication as part of the conference proceedings. Software systems must satisfy rapidly increasing demands imposed by emerging applications. For example, new AI applications, such as autonomous driving, require quick responses to an environment that is changing continuously. At the same time, software systems must be fault-tolerant in order to ensure a high degree of availability. As it stands, however, developing these new distributed software systems is extremely challenging even for expert software engineers due to the interplay of concurrency, asynchronicity, and failure of components. The objective of our research is to develop reusable solutions to the above challenges by means of novel programming models and frameworks that can be used to build a wide range of applications. This talk reports on our work on the design, implementation, and foundations of programming models and languages that enable the robust construction of large-scale concurrent and distributed software systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HotQCD on Multi-GPU systems 38

HotQCD on Multi-GPU Systems

引用

38th international symposium on Lattice Field Theory, LATTICE 2021

作者： Altenkort, L. Bollweg, D. Clarke, D.A. Kaczmarek, O. Mazur, L. Schmidt, C. Scior, P. Shu, Hai-Tao Fakultät für Physik Universität Bielefeld Bielefeld Germany Paderborn Center for Parallel Computing Paderborn University Paderborn Germany Physics Department Brookhaven National Laboratory UptonNY United States Institut für Theoretische Physik Universität Regensburg Regensburg Germany

We present SIMULATeQCD, HotQCD's software for performing lattice QCD calculations on GPUs. Started in late 2017 and intended as a full replacement of the previous single GPU lattice QCD code used by the HotQCD collaboration, our software has been developed into an extensive framework for lattice QCD calculations distributed on multiple GPUs over many compute nodes. The code is built on C++, CUDA, and MPI and leverages modern C++ language features to provide high-level data structures, objects, and algorithms that allow users to express lattice QCD calculations in an intuitive way without sacrificing performance. Implemented algorithms range from gradient flow, correlator measurements, and mixed precision conjugate gradient solvers all the way to full HISQ gauge field configuration generation using RHMC. After successful deployment in large-scale computing projects, we want to share the result of our efforts with the lattice QCD community by making it publicly available. In these proceedings, we will present some of the key features of our code, demonstrate its ease of use, and show benchmarks of performance critical kernels on state-of-the-art supercomputers. © Copyright owned by the author(s) under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 international License (CC BY-NC-ND 4.0)

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Research on Bank Personal Credit Evaluation Based on Decision Tree Model

Research on Bank Personal Credit Evaluation Based on Decisio...

引用

Information Science, parallel and distributed systems (ISPDS), international Conference on

作者： JunHao Zhao Guizhou University Changsha China

ISBN: (纸本)9781665417396

With the rapid development and globalization of the economy, this article investigates the effectiveness of decision tree model for banks’ decision making in granting personal credit loans, unlike the previous traditional bank credit analysis model. By collecting user data of lenders and analyzing it through decision tree model, this paper finds that decision tree model can effectively process user information and analyze it, thus increasing prediction accuracy and reducing risk, and finally helping banks to make decisions.

关键词： Analytical models Information science Globalization Focusing distributed databases Predictive models Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel real-time simulation on commodity hardware with reusable power system models 21

Parallel real-time simulation on commodity hardware with reu...

引用

Proceedings of the 2021 IEEE/ACM 25th international symposium on distributed Simulation and Real Time Applications

作者： Raphael Eidenbenz Carsten Franke Mats Larsson Alexandru Moga Thanikesavan Sivanthi Hitachi ABB Power Grids Research Switzerland Munich University of Applied Sciences Germany Hitachi ABB Power Grids Switzerland ABB Corporate Research Switzerland

ISBN: (纸本)9781665433266

This paper proposes a real-time power system simulation framework that is capable of simulating steady state and electromechanical transients of power systems, with sub-millisecond time resolution. The framework can integrate power system component models packed as reusable Functional Mockup Units (FMUs) to flexibly create power system simulations without the need to recreate new models for different power systems. The integration of individual components is based on a novel model decomposition method, which enables the FMU reuse in different system contexts, as well as a parallel simulation execution onto multi-core machines. Furthermore, the paper proposes methods to optimize the allocation of components to cores and shows that the framework can simulate a medium voltage distributed electrical grid of about 20 components in real-time on a commodity multi-core machine.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Communication and Energy Efficient Edge Intelligence

Communication and Energy Efficient Edge Intelligence

引用

IEEE/ACM international symposium on Big Data Computing (BDC)

作者： Sabtain Ahmad Institute of Information Systems Engineering Vienna University of Technology Vienna Austria

Driven by the rapid advances in Artificial Intelligence of Things (AIoT), billions of mobile and IoT devices are connected to the internet, generating huge quantities of data at the network edge. Meanwhile, traditional analytics approaches such as cloud computing and centralized AI are unable to manage these massively distributed heterogeneous data primarily because 1) moving a tremendous amount of data across the network poses severe challenges to network capacity 2) cloud-based analytics can result in prohibitively high transmission delays 3) transporting data containing private information over the network poses serious concerns for the privacy and may not even be possible due to regulations like GDPR. Accelerated by the success of AI and IoT technologies, there is an urgent need to push AI to the network edge to tap the full potential of big data.

关键词： Cloud computing Data privacy distributed databases Big Data Regulation Energy efficiency Delays

来源：评论

学校读者我要写书评

暂无评论

Least Squares on GPUs in Multiple Double Precision

Least Squares on GPUs in Multiple Double Precision

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Jan Verschelde Department of Mathematics Statistics and Computer Science University of Illinois at Chicago Chicago IL

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

This paper describes the application of the code generated by the CAMPARY software to accelerate the solving of linear systems in the least squares sense on Graphics Processing Units (GPUs), in double double, quad double, and octo double precision. The goal is to use accelerators to offset the cost overhead caused by multiple double precision arithmetic. For the blocked Householder Q R and the back substitution, of interest are those dimensions at which teraflop performance is attained. The other interesting question is the cost overhead factor that appears each time the precision is doubled. Experimental results are reported on five different NVIDIA GPUs, with a particular focus on the P100 and the V100, both capable of teraflop performance. Thanks to the high Compute to Global Memory Access (CGMA) ratios of multiple double arithmetic, teraflop performance is already attained running the double double QR on 1,024-by-1,024 matrices, both on the P100 and the V100. For the back substitution, the dimension of the upper triangular system must be as high as 17,920 to reach one teraflops on the V100, in quad double precision, and then taking only the times spent by the kernels into account. The lower performance of the back substitution in small dimensions does not prevent teraflop performance of the solver at dimension 1,024, as the time for the Q R decomposition dominates. In doubling the precision from double double to quad dou-ble and from quad double to octo double, the observed cost overhead factors are lower than the factors predicted by the arithmetical operation counts. This observation correlates with the increased performance for increased precision, which can again be explained by the high CGMA ratios.

关键词： Linear systems distributed processing Costs Instruction sets Conferences Graphics processing units Software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 86 87 88 89 90 91 92 93 94 95 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：