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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,547 篇 会议
83 篇 期刊文献
15 册 图书

馆藏范围

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

日期分布

学科分类号

2,559 篇 工学
- 2,365 篇 计算机科学与技术...
- 1,163 篇 软件工程
- 494 篇 电气工程
- 407 篇 信息与通信工程
- 212 篇 电子科学与技术（可...
- 212 篇 控制科学与工程
- 98 篇 网络空间安全
- 80 篇 动力工程及工程热...
- 80 篇 生物工程
- 68 篇 光学工程
- 65 篇 机械工程
- 56 篇 生物医学工程（可授...
- 36 篇 建筑学
- 30 篇 化学工程与技术
- 29 篇 环境科学与工程（可...
614 篇 理学
- 375 篇 数学
- 144 篇 物理学
- 93 篇 生物学
- 74 篇 系统科学
- 69 篇 统计学（可授理学、...
465 篇 管理学
- 346 篇 管理科学与工程(可...
- 134 篇 图书情报与档案管...
- 129 篇 工商管理
- 65 篇 公共管理
111 篇 法学
- 103 篇 社会学
104 篇 医学
- 73 篇 公共卫生与预防医...
- 31 篇 临床医学
- 29 篇 基础医学(可授医学...
65 篇 文学
- 65 篇 新闻传播学
39 篇 经济学
- 38 篇 应用经济学
17 篇 教育学
10 篇 农学
1 篇 艺术学

主题

1,194 篇 computer archite...
426 篇 hardware
344 篇 high performance...
295 篇 computational mo...
255 篇 concurrent compu...
236 篇 application soft...
214 篇 computer science
205 篇 parallel process...
179 篇 distributed comp...
178 篇 costs
171 篇 delay
170 篇 grid computing
168 篇 bandwidth
164 篇 field programmab...
154 篇 resource managem...
153 篇 cloud computing
144 篇 computer network...
142 篇 throughput
129 篇 processor schedu...
125 篇 scalability

机构

22 篇 institute of com...
16 篇 graphic era deem...
14 篇 chitkara univers...
13 篇 university of ch...
11 篇 college of compu...
10 篇 school of comput...
10 篇 computer science...
9 篇 georgia inst tec...
9 篇 computer systems...
9 篇 intel corp santa...
8 篇 department of co...
8 篇 department of el...
8 篇 ibm thomas j. wa...
8 篇 barcelona superc...
8 篇 mathematics and ...
8 篇 quantum universi...
8 篇 中国电子科技集团...
8 篇 mathematics and ...
8 篇 key laboratory o...
8 篇 univ fed rio gra...

作者

14 篇 navaux philippe ...
10 篇 satvik vats
9 篇 vats satvik
9 篇 i. foster
9 篇 d.k. panda
8 篇 dhabaleswar k. p...
8 篇 dongarra jack
8 篇 loh gabriel h.
8 篇 guedes dorgival
8 篇 viktor k. prasan...
8 篇 prasanna viktor ...
8 篇 mutlu onur
7 篇 shiva mehta
7 篇 borin edson
7 篇 chong frederic t...
7 篇 torrellas josep
7 篇 kim nam sung
7 篇 li chao
7 篇 zhou huiyang
7 篇 ferreira renato

语言

4,523 篇 英文
100 篇 其他
20 篇 中文
3 篇 葡萄牙文
1 篇 法文

检索条件"任意字段=15th Symposium on Computer Architecture and High Performance Computing"

共 4645 条记录，以下是331-340 订阅

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

详细简洁

排序：

Image Quality Transfer of Diffusion MRI Guided By high-Resolution Structural MRI 15th

Image Quality Transfer of Diffusion MRI Guided By High-Reso...

引用

15th International Workshop on Computational Diffusion MRI, CDMRI 2024, held in conjunction with 27th International Conference on Medical Image computing and computer-Assisted Intervention, MICCAI 2024

作者： Cicimen, Alp G. Tregidgo, Henry F. J. Figini, Matteo Messaritaki, Eirini B. McNabb, Carolyn Palombo, Marco Evans, C. John Cercignani, Mara Jones, Derek K. C. Alexander, Daniel Centre for Medical Image Computing University College London London United Kingdom Cardiff University Brain Research Imaging Centre Cardiff University Cardiff United Kingdom

ISBN: (纸本)9783031869198

Prior work on the Image Quality Transfer on Diffusion MRI (dMRI) has shown significant improvement over traditional interpolation methods. However, the difficulty in obtaining ultra-high resolution Diffusion MRI scans poses a problem in training neural networks to obtain high-resolution dMRI scans. Here we hypothesise that the inclusion of structural MRI images, which can be acquired at much higher resolutions, can be used as a guide to obtaining a more accurate high-resolution dMRI output. To test our hypothesis, we have constructed a novel framework that incorporates structural MRI scans together with dMRI to obtain high-resolution dMRI scans. We set up tests which evaluate the validity of our claim through various configurations and compare the performance of our approach against a unimodal approach. Our results show that the inclusion of structural MRI scans do lead to an improvement in high-resolution image prediction when T1w data is incorporated into the model input. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

high-Quality I/O Bandwidth Prediction with Minimal Data via Transfer Learning Workflow

High-Quality I/O Bandwidth Prediction with Minimal Data via ...

引用

International symposium on computer architecture and high performance computing (SBAC-PAD)

作者： Dmytro Povaliaiev Radita Liem Julian Kunkel Jay Lofstead Philip Carns Chair of High Performance Computing IT Center RWTH Aachen University Aachen Germany Georg-August Universität Göttingen/GWDG Göttingen Germany Sandia National Laboratory Albuquerque USA Argonne National Laboratory Lemont USA

ISBN: (数字)9798350356168

ISBN: (纸本)9798350356175

Providing a high-quality performance prediction has the potential to enhance various aspects of a cluster, such as devising scheduling and provisioning policies, guiding procurement decisions, suggesting candidate applications for tuning, and identifying probable scaling and porting challenges. Creating such a prediction for the I/O metrics is still challenging, however, due to the intricate interplay of multiple cluster components, making this an ideal case for machine learning. Nevertheless, achieving the required accuracy level with machine learning calls for a substantial amount of high-quality data, which is often a difficult challenge for most HPC clusters. In this work we explore the use of transfer learning to predict the applications’ I/O bandwidth based on a public dataset. As a result, our experiment can provide an I/O bandwidth prediction for a different cluster comparable to the current state-of-the-art result while employing 100 times less data than needed to construct the base model. Furthermore, we evaluate potential future improvements of the proposed workflow.

关键词： Procurement Measurement high performance computing Computational modeling Transfer learning Bandwidth computer architecture Predictive models Data models Tuning

来源：评论

学校读者我要写书评

暂无评论

MRHS multigrid solver for Wilson-clover fermions 39

MRHS multigrid solver for Wilson-clover fermions

引用

39th International symposium on Lattice Field theory, LATTICE 2022

作者： Richtmann, Daniel Meyer, Nils Wettig, Tilo Department of Physics University of Regensburg Regensburg93040 Germany

We describe our implementation of a multigrid solver for Wilson-clover fermions, which increases parallelism by solving for multiple right-hand sides (MRHS) simultaneously. the solver is based on Grid and thus runs on all computing architectures supported by the Grid framework. We present detailed benchmarks of the relevant kernels, such as hopping and clover term on the various multigrid levels, intergrid operators, and reductions. the benchmarks were performed on the JUWELS Booster system at Jülich Supercomputing Centre, which is based on Nvidia A100 GPUs. For example, solving a 243 × 128 lattice on 16 GPUs, the overall speedup obtained solely from MRHS is about 10x. © 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).

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

To Protect or Not To Protect: Probability-Aware Selective Protection for Sparse Iterative Solvers

To Protect or Not To Protect: Probability-Aware Selective Pr...

引用

International symposium on computer architecture and high performance computing (SBAC-PAD)

作者： Daniel Ryley Johnson Hongyang Sun Joshua Dennis Booth Padma Raghavan University of Kansas Lawrence KS USA University of Alabama in Huntsville Huntsville AL USA Vanderbilt University Nashville TN USA

ISBN: (数字)9798350356168

ISBN: (纸本)9798350356175

With the increasing scale of high-performance computing (HPC) systems, transient bit-flip errors are now more likely than ever, posing a threat to long-running scientific applications. A substantial portion of these applications involve simulation of partial differential equations (PDEs), modeling physical processes over discretized spatial and temporal domains, with some requiring solving sparse linear systems of equations. While these applications are often paired with system-level application-agnostic resilience techniques, such as checkpointing and replication, using these techniques imposes significant overhead. In this work, we present a probability-aware framework that produces low-overhead selective protection schemes for the widely used Preconditioned Conjugate Gradient (PCG) method, whose performance can heavily degrade due to error propagation through the sparse matrix-vector multiplication (SpMV) operation. through the use of a straightforward mathematical model and an optimized machine learning model, our selective protection schemes incorporate error probability to protect only certain crucial operations. An experimental evaluation using 15 matrices from the SuiteSparse Matrix Collection demonstrates that our protection schemes effectively reduce resilience overheads, outperforming two baseline and two existing protection schemes across all error probabilities.

关键词： Linear systems Error probability high performance computing Partial differential equations Machine learning Mathematical models Sparse matrices Protection Transient analysis Resilience

来源：评论

学校读者我要写书评

暂无评论

ISCA 2022 - Proceedings of the 49th Annual International symposium on computer architecture

ISCA 2022 - Proceedings of the 49th Annual International Sym...

引用

49th IEEE/ACM International symposium on computer architecture, ISCA 2022

ISBN: (纸本)9781450386104

the proceedings contain 73 papers. the topics discussed include: free atomics: hardware atomic operations without fences;securing GPU via region-based bounds checking;EQC : ensembled quantum computing for variational quantum algorithms;axiomatic hardware-software contracts for security;PPMLAC: high performance chipset architecture for secure multi-party computation;INSPIRE: in-storage private information retrieval via protocol and architecture co-design;NDMiner: accelerating graph pattern mining using near data processing;SoftVN: efficient memory protection via software-provided version numbers;CraterLake: a hardware accelerator for efficient unbounded computation on encrypted data;there’s always a bigger fish: a clarifying analysis of a machine-learning-assisted side-channel attack;and gearbox: a case for supporting accumulation dispatching and hybrid partitioning in PIM-based accelerators.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Data Optimizer for Region-Aware Self-describing Files in Scientific computing 15

A Data Optimizer for Region-Aware Self-describing Files in S...

引用

15th Annual ACM symposium on Cloud computing, SoCC 2024

作者： Song, Yanjie Wu, Tianyuan Li, Yuanhao Li, Guancheng Liu, Yuchen Yin, Shu Xue, Wei Wang, Junchao School of Info. Sci. and Tech. ShanghaiTech University Shanghai China Dept. of Computer Sci. and Tech. Tsinghua University Beijing China China Meteorological Administration Basin Heavy Rainfall Key Lab Hubei Key Lab for HV. Rain Mtrg. and WRNG. Hubei Wuhan China

ISBN: (纸本)9798400712869

Acquiring data from scientific simulations for analytical purposes is inherently challenging due to the complex and irregularly shaped regions within which the data resides, particularly when using self-describing data formats. the process of region-based data distillation becomes even more arduous when employing persistent memory or parallel file systems. To tackle this challenge, we introduce RASTER (Region-Aware Self-describing daTa optimizER), a lightweight middleware designed for region-aware data preprocessing. RASTER dynamically reorganizes data into variable groups based on regional identifiers during runtime, thereby eliminating the need for sequential searches to locate the required data. We have developed a prototype of RASTER and successfully integrated it into three distinct computing environments: a single-node server equipped with Intel® Optane™ DC persistent memory, the Huawei® OceanStor cloud storage platform, and the Sunway TaihuLight supercomputer. We then conducted a thorough evaluation of the RASTER prototype on the latter two platforms using a real-world scientific application, CESM (Community Earth System Model). Our experimental results demonstrate that RASTER enhances data acquisition performance by up to 2.83× and achieves a 2.36× speedup over conventional netCDF and the state-of-the-art ADIOS2. Additionally, RASTER significantly reduces memory usage by up to 400%, showcasing its scalability potential. © 2024 Owner/Author.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Efficient Voltage-Controlled Oscillator architecture for high-Frequency Applications

Efficient Voltage-Controlled Oscillator Architecture for Hig...

引用

International Conference on computing and Networking Technology (ICCNT)

作者： Aisha Vatsh Department of Electronics and Communication Engineering National Institute of Technology Delhi Delhi India

ISBN: (数字)9798350370249

ISBN: (纸本)9798350370270

this paper presents a comprehensive comparative analysis of five established voltage-controlled oscillator (VCO) architectures alongside a novel design. Utilizing a 90nm CMOS process in Cadence Virtuoso, the architectures are rigorously evaluated via simulation across key performance metrics including oscillation frequency, tuning range, power consumption, and phase noise. Our findings reveal significant trade-offs between these metrics, highlighting two architectures with superior phase noise and tuning range performance alongside moderate power dissipation. this analysis offers valuable insights for VCO designers seeking optimal architectures tailored to specific application needs and identifies avenues for further optimization to meet evolving wireless standards.

关键词： Phase noise Measurement Wireless communication Radio frequency Voltage-controlled oscillators computer architecture Voltage Tuning Optimization Standards

来源：评论

学校读者我要写书评

暂无评论

A Study of the Locality of Persistence-Based Queries and Its Implications for the Efficiency of Localized Data Structures 15

A Study of the Locality of Persistence-Based Queries and Its...

引用

IEEE 15th Pacific Visualization symposium (PacificVis)

作者： Klacansky, Pavol Gyulassy, Attila Bremer, Peer-Timo Pascucci, Valerio Univ Utah SCI Inst Salt Lake City UT 84112 USA LLNL Livermore CA USA

ISBN: (纸本)9781665423359

Scientific datasets are often analyzed and visualized using iso-surfaces. the connected components at or above the isovalue defining these isosurfaces are called superlevel-set components. the vertex set of these superlevel-set components can be used to compute local statistics, such as mean temperature or histogram per component, or to segment the data. However, in datasets produced by acquisition devices or simulations, noise induces many spurious components that clutter the visualization and analysis results. Many of these spurious components would disappear if the data values were slightly adjusted. the notion of persistence captures the stability of a component with respect to function value changes, and so we are interested in computing persistence quickly. Locality of computation is critical for parallel scalability, minimization of communication in a distributed environment, or an out-of-core processing. the recently introduced merge forest attained high performance by exploiting locality, thereby avoiding communication until needed to resolve a feature query. We extend the merge forest to support persistence-based queries and study the locality of these queries by evaluating the traversals of regions of data during a query. We confirm that the majority of evaluated datasets have the property that the noise is mostly local, and thus can be efficiently eliminated without performing a global analysis. Finally, we compare the query running times with those of a triplet merge tree because a triplet merge tree answers all proposed queries in constant time and can be constructed from a merge tree in linear time.

关键词： Human-centered computing-Visualization-Visualization application domains-Scientific visualization

来源：评论

学校读者我要写书评

暂无评论

Barycentre Averaging for the Move-Split-Merge Time Series Distance Measure 15

Barycentre Averaging for the Move-Split-Merge Time Series Di...

引用

15th International Conference on Knowledge Discovery and Information Retrieval, KDIR 2023 as part of the 15th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, IC3K 2023

作者： Holder, Christopher Guijo-Rubio, David Bagnall, Anthony School of Computing Sciences University of East Anglia Norwich United Kingdom Department of Computer Science and Numerical Analysis University of Córdoba Córdoba Spain School of Electronics and Computer Science University of Southampton Southampton United Kingdom

ISBN: (纸本)9789897586712

Distance functions play a core role in many time series machine learning algorithms for tasks such as clustering, classification and regression. Time series often require bespoke distance functions because small offsets in time can lead to large distances between series that are conceptually similar. Elastic distances compensate for misalignment by creating a path through a cost matrix by warping and/or editing time series. Time series are most commonly clustered with partitional algorithms such as k-means and k-medoids using elastic distance measures such as Dynamic Time Warping (DTW). the distance is used to assign cases to the closest cluster representative. k-means requires the averaging of time series to find these representative centroids. If DTW is used to assign membership, but the arithmetic mean is used to find centroids, k-means performance degrades significantly. An averaging technique specific to DTW, called DTW Barycentre Averaging (DBA), overcomes the averaging problem however, can only be used with DTW. As such alternative distance functions such as Move-Split-Merge (MSM) are forced to use the arithmetic mean to compute new centroids and suffer similar degraded performance as k-means-DTW without DBA. To address this we propose a averaging method for MSM distance, MSM Barycentre Averaging (MBA) and show that when used to find centroids it significantly improves MSM based k-means and is better than commonly used alternatives. Copyright © 2023 by SCITEPRESS - Science and Technology Publications, Lda. Under CC license (CC BY-NC-ND 4.0)

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

BRIM: Bistable Resistively-Coupled Ising Machine 27

BRIM: Bistable Resistively-Coupled Ising Machine

引用

27th IEEE International symposium on high-performance computer architecture (HPCA)

作者： Afoakwa, Richard Zhang, Yiqiao Vengalam, Uday Kumar Reddy Ignjatovic, Zeljko Huang, Michael Univ Rochester Dept Elect & Comp Engn Rochester NY 14627 USA

ISBN: (纸本)9781665422352

Physical Ising machines rely on nature to guide a dynamical system towards an optimal state which can be read out as a heuristical solution to a combinatorial optimization problem. Such designs that use nature as a computing mechanism can lead to higher performance and/or lower operation costs. Quantum annealers are a prominent example of such efforts. However, existing Ising machines are generally bulky and energy intensive. Such disadvantages may be acceptable if these designs provide some significant intrinsic advantages at a much larger scale in the future, which remains to be seen. But for now, integrated electronic designs of Ising machines allow more immediate applications. We propose one such design that uses bistable nodes, coupled with programmable and variable strengths. the design is fully CMOS compatible for on-chip applications and demonstrates competitive solution quality and significantly superior execution time and energy.

关键词： Ising machine optimization CMOS accelerators nature-based computing quantum annealing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共465页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：