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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

736 篇 会议
617 篇 期刊文献
34 册 图书

馆藏范围

1,387 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

817 篇 工学
- 597 篇 计算机科学与技术...
- 463 篇 软件工程
- 129 篇 信息与通信工程
- 111 篇 控制科学与工程
- 104 篇 电子科学与技术（可...
- 83 篇 电气工程
- 72 篇 生物医学工程（可授...
- 68 篇 生物工程
- 57 篇 力学（可授工学、理...
- 54 篇 光学工程
- 54 篇 化学工程与技术
- 42 篇 材料科学与工程（可...
- 35 篇 动力工程及工程热...
- 31 篇 机械工程
- 30 篇 土木工程
- 26 篇 仪器科学与技术
- 20 篇 建筑学
671 篇 理学
- 453 篇 数学
- 200 篇 物理学
- 104 篇 统计学（可授理学、...
- 96 篇 系统科学
- 86 篇 生物学
- 60 篇 化学
- 22 篇 地球物理学
183 篇 管理学
- 97 篇 管理科学与工程(可...
- 92 篇 图书情报与档案管...
- 45 篇 工商管理
48 篇 医学
- 43 篇 临床医学
- 34 篇 基础医学(可授医学...
28 篇 法学
- 26 篇 社会学
21 篇 农学
16 篇 经济学
12 篇 教育学
4 篇 军事学
2 篇 文学
2 篇 艺术学

主题

59 篇 computer science
49 篇 scientific compu...
37 篇 computational mo...
30 篇 laboratories
28 篇 visualization
23 篇 scalability
21 篇 data mining
21 篇 artificial intel...
21 篇 data visualizati...
19 篇 application soft...
19 篇 topology
18 篇 computer archite...
18 篇 machine learning
17 篇 hardware
16 篇 concurrent compu...
15 篇 libraries
15 篇 supercomputers
15 篇 graphics process...
15 篇 distributed comp...
14 篇 runtime

机构

20 篇 center for appli...
19 篇 center for appli...
18 篇 global scientifi...
15 篇 center for appli...
15 篇 center for appli...
13 篇 center for appli...
13 篇 center for appli...
12 篇 department of co...
11 篇 laboratory for h...
10 篇 center for appli...
10 篇 center for appli...
10 篇 israel atomic en...
9 篇 department of co...
9 篇 center for scien...
9 篇 scientific compu...
8 篇 institute of sci...
8 篇 department of co...
8 篇 department of sc...
8 篇 department of co...
8 篇 scientific compu...

作者

20 篇 abhinav bhatele
18 篇 zhang jun
17 篇 schulz martin
17 篇 bhatele abhinav
15 篇 oren gal
14 篇 li yiming
12 篇 liu ya-feng
12 篇 joohwan chun
11 篇 martin schulz
11 篇 de supinski bron...
11 篇 yokota haruo
10 篇 pant millie
9 篇 brezany peter
9 篇 tei-wei kuo
9 篇 h. yokota
9 篇 gamblin todd
9 篇 laxmikant v. kal...
9 篇 snášel václav
8 篇 nikhil jain
8 篇 yuan-hao chang

语言

1,332 篇 英文
52 篇 其他
1 篇 西班牙文
1 篇 中文

检索条件"机构=Scientific Computing in Computer Science"

共 1387 条记录，以下是351-360 订阅

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

详细简洁

排序：

ML-based Modeling to Predict I/O Performance on Different Storage Sub-systems 31

ML-based Modeling to Predict I/O Performance on Different St...

引用

31st Annual IEEE International Conference on High Performance computing, Data, and Analytics, HiPC 2024

作者： Xu, Yiheng Sivaraman, Pranav Devarajan, Hariharan Mohror, Kathryn Bhatele, Abhinav Palantir Technologies Inc. Denver United States Department of Computer Science University of Maryland College Park United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore United States

ISBN: (纸本)9798331509095

Parallel applications can spend a significant amount of time performing I/O on large-scale supercomputers. Fast near-compute storage accelerators called burst buffers can reduce the time a processor spends performing I/O and mitigate I/O bottlenecks. However, determining if a given application could be accelerated using burst buffers is not straightforward even for storage experts. The relationship between an application’s I/O characteristics (such as I/O volume, processes involved, etc.) and the best storage sub-system for it can be complicated. As a result, adapting parallel applications to use burst buffers efficiently is a trial-and-error process. In this work, we present a Python-based tool called PrismIO that enables programmatic analysis of I/O traces. Using PrismIO, we identify performance bottlenecks when using burst buffers and parallel file systems, and explain why certain I/O patterns perform poorly. Further, we use machine learning to model the relationship between I/O characteristics and file system selections. We use IOR, an I/O benchmark to gather performance data for training the machine learning model. Our model can predict the better performing storage system for unseen IOR scenarios with an accuracy of 94.47% and for four real applications with an accuracy of 95.86%. © 2024 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Debates with small transparent quantum verifiers

Debates with small transparent quantum verifiers

引用

18th International Conference on Developments in Language Theory, DLT 2014

作者： YakaryIlmaz, Abuzer Say, A. C. Cem Demirci, H. Gökalp Faculty of Computing University of Latvia Raina bulv. 19 Riga LV-1586 Latvia National Laboratory for Scientific Computing Petrópolis RJ 25651-075 Brazil Department of Computer Engineering Boǧaziçi University Bebek 34342 Istanbul Turkey Department of Computer Science University of Chicago Chicago IL 60637 United States

ISBN: (纸本)9783319096971

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most NP to the collection of all Turing-decidable languages (recursive languages). When the verifier is further constrained to make the correct decision with probability 1, the corresponding class goes up from the regular languages up to at least E. © 2014 Springer International Publishing Switzerland.

关键词： Finite automata

来源：评论

学校读者我要写书评

暂无评论

Ensuring numerical quality in grid computing

Ensuring numerical quality in grid computing

引用

International Symposium on High Performance Distributed computing

作者： A. Frommer M. Husken Applied Computer Science and Scientific Computing Bergische Universität Gesamthochschule Wuppertal Wuppertal Germany

We propose an approach which gives the user valuable information on the various platforms avail able in a grid in order to assess the numerical quality of an algorithm run on each of these platforms. In this manner, the user is provided with at least very strong hints whether a program performs reliably in a grid before actually executing it. Our approach extends IeeeCC754 by two "grid-enabled" modes: The first mode calculates a "numerical checksum" on a specific grid host and executes the job only if the check sum is identical to a locally generated one. The second mode provides the user with information on the reliability and IEEE 754-conformity of the underlying floating-point implementation of various platforms. In addition, it can help to find a set of compiler options to optimize the application's performance while retaining numerical stability

关键词： Grid computing Testing Application software Floating-point arithmetic Hardware Software libraries computer science scientific computing Programming Software standards

来源：评论

学校读者我要写书评

暂无评论

A mixed Weisfeiler-Lehman graph kernel 10

A mixed Weisfeiler-Lehman graph kernel

引用

10th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2015

作者： Xu, Lixiang Xie, Jin Wang, Xiaofeng Luo, Bin School of Computer Science and Technology Anhui University Hefei Anhui230601 China Department of Mathmatics & Physics Hefei University Hefei Anhui230601 China Department of Computer Science and Technology Hefei University Hefei Anhui230601 China Institute of Scientific Computing Hefei University Hefei Anhui230601 China

ISBN: (纸本)9783319182230

Using concepts from the Weisfeiler-Lehman (WL) test of isomorphism, we propose a mixed WL graph kernel (MWLGK) framework based on a family of efficient WL graph kernels for constructing mixed graph kernel. This family of kernels can be defined based on the WL sequence of graphs. We apply the MWLGK framework on WL graph sequence taking into account the structural information which was overlooked. Our MWLGK is competitive with or outperforms the corresponding single WL graph kernel on several classification benchmark data sets. © Springer International Publishing Switzerland 2015.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

A Spatio-temporal Model for the Population Dynamics of Pyrodinium Bahamense var. Compressum with a Nutrient Source and Wind Effects

A Spatio-temporal Model for the Population Dynamics of Pyrod...

引用

Asia International Conference on Modeling & Simulation

作者： Diego Manansala Remb Talastasin Wilson Tan Adrian Roy Valdez Scientific Computing Laboratory Department of Computer Science College of Engineering University of Philippines Diliman Philippines

The dinoflagellate Pyrodinium bahamense var. compressum has been known to be the major cause of harmful algal blooms or H.A.B. recurring in Manila Bay and other bodies of water in the Philippines. This paper proposes a framework for modeling the growth and spread of an algal bloom population over a hypothetical geographic area. The model is comprised of a networked system of nodes where each node contains an instantiation of a system of difference equations describing the population dynamics of the different life cycle stages of the dinoflagellate.

关键词： Mathematical model Difference equations Computational modeling Reactive power Dispersion Geospatial analysis

来源：评论

学校读者我要写书评

暂无评论

DeepFake Detection System using Deep Learning

DeepFake Detection System using Deep Learning

引用

IEEE International Conference on Intelligent computing and Information Systems (ICICIS)

作者： Omar Ahmed Sameh Fekry Abdullah Metwally Abdelrahman Abdelwahid Dina Khattab Amer Abdulelmagid Radwa Hossieny Scientific Computing Department Faculty of Computer and Information Science Ain Shams University Cairo Egypt

Due to the growing usage of DeepFake technology to produce fake photos and videos, the problem of DeepFake identification has become a serious concern in recent years. With the use of this technology, fake material that is difficult to tell apart from real content may be produced. Therefore, the development of accurate DeepFake detection algorithms is essential to identify and prevent the spread of manipulated content. However, current publicly available DeepFake detection datasets suffer from a lack of diversity, with only a few actors appearing in multiple videos. This results in an oversampled training dataset, leading to model overfitting and inadequate performance when tested on new data. The overfitting problem can cause deep neural networks to focus more on facial features than on specific traits of DeepFake content, thereby reducing the model's ability to generalize. To address this issue and broaden the training dataset's variety, we suggest applying data augmentation methods like Face Cutout and Random Erase. The Face Cutout technique randomly removes a rectangular area of an image containing the face, while the Random Erase technique randomly removes a rectangular area of the image. These techniques introduce variations in the images, making it more challenging for the model to overfit and focus on specific traits of DeepFake content. We evaluated our approach using several models and achieved significant accuracy improvements using the EfficientnetV2B0 model and Random Erase augmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Speech compression with cosine and wavelet packet near-best bases

Speech compression with cosine and wavelet packet near-best ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： C. Taswell Scientific Computing and Computational Mathematics Department of Computer Science University of Stanford Stanford CA USA

Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithms for selecting near-best bases were compared with optimizing algorithms for best bases in these adaptive tree-structured transforms. Experiments were performed on several hundred seconds of speech spoken by both male and female speakers from all dialect regions of the TIMIT corpus. Near-best bases provided rate-distortion performance effectively as good as that of best bases but without the additional computational penalty. Cosine packet bases outperformed wavelet packet bases.

关键词： Wavelet packets Wavelet transforms Cost function scientific computing Mathematics computer science Speech coding Wavelet domain Rate-distortion Additives

来源：评论

学校读者我要写书评

暂无评论

A fully implicit method for lattice boltzmann equations

A fully implicit method for lattice boltzmann equations

引用

作者： Huang, Jizu Yang, Chao Cai, Xiao-Chuan Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Institute of Software Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Computer Science Beijing100190 China Department of Computer Science University of Colorado Boulder BoulderCO80309 United States

Existing approaches for solving the lattice Boltzmann equations with finite difference methods are explicit and semi-implicit;both have certain stability constraints on the time step size. In this work, a fully implicit second-order finite difference scheme is developed. We focus on a parallel, highly scalable, Newton-Krylov-RAS algorithm for the solution of a large sparse nonlinear system of equations arising at each time step. Here, RAS is a restricted additive Schwarz preconditioner based on a first-order spatial discretization. We show numerically that by using the fully implicit method the time step size is no longer constrained by the CFL condition, and the Newton-Krylov- RAS algorithm is scalable on a supercomputer with more than ten thousand processors. Moreover, to calculate the steady state solution we investigate an adaptive time stepping strategy. The total compute time required by the implicit method with adaptive time stepping is much smaller than that of an explicit method for several test cases. © 2015 Society for Industrial and Applied Mathematics.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

The generic graph component library 99

The generic graph component library

引用

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

作者： Lie-Quan Lee Jeremy G. Siek Andrew Lumsdaine Laboratory for Scientific Computing Department of Computer Science and Engineering University of Notre Dame Notre Dame IN

ISBN: (纸本)9781581132380

In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Standard Template Library (STL), the graph algorithms in GGCL do not depend on the particular data structures upon which they operate, meaning a single algorithm can operate on arbitrary concrete representations of graphs. To attain this type of flexibility for graph data structures, which are more complicated than the containers in STL, we introduce several concepts to form the generic interface between the algorithms and the data structures, namely, Vertex, Edge, Visitor, and Decorator. We describe the principal abstractions comprising the GGCL, the algorithms and data structures that it provides, and provide examples that demonstrate the use of GGCL to implement some common graph algorithms. Performance results are presented which demonstrate that the use of novel lightweight implementation techniques and static polymorphism in GGCL results in code which is significantly more efficient than similar libraries written using the object-oriented paradigm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multiscale Adaptive Correlation Method for Ultrasound Speckle Image Velocimetry

Multiscale Adaptive Correlation Method for Ultrasound Speckl...

引用

IEEE International Ultrasonics Symposium

作者： Ecaterina Bodnariuc Christoph Schnorr Interdisciplinary Center for Scientific Computing (IWR) Department of Mathematics and Computer Science Heidelberg University Germany

In this paper, we introduce and evaluate a multiscale correlation-based image velocimetry approach to the estimation of in-plane displacements of ultrasound speckles. The method replaces the conventional rectangular interrogation window by a smooth Gaussian weight function and locally adapts its shape and orientation to estimated velocities by evaluating a corresponding criterion. Furthermore, displacements are continuously refined which improves the sub-pixel accuracy of the computed velocities. Experimental results are reported that we obtained by applying the method to the SA-VFI challenge datasets.

关键词： Microsoft Windows Ultrasonic imaging Speckle Correlation Shape Media Image color analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：