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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
610 篇 期刊文献
34 册 图书

馆藏范围

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

日期分布

学科分类号

813 篇 工学
- 595 篇 计算机科学与技术...
- 463 篇 软件工程
- 126 篇 信息与通信工程
- 111 篇 控制科学与工程
- 103 篇 电子科学与技术（可...
- 82 篇 电气工程
- 72 篇 生物医学工程（可授...
- 68 篇 生物工程
- 58 篇 力学（可授工学、理...
- 54 篇 光学工程
- 53 篇 化学工程与技术
- 40 篇 材料科学与工程（可...
- 35 篇 动力工程及工程热...
- 31 篇 机械工程
- 30 篇 土木工程
- 26 篇 仪器科学与技术
- 21 篇 建筑学
669 篇 理学
- 453 篇 数学
- 200 篇 物理学
- 104 篇 统计学（可授理学、...
- 96 篇 系统科学
- 85 篇 生物学
- 59 篇 化学
- 22 篇 地球物理学
181 篇 管理学
- 96 篇 管理科学与工程(可...
- 93 篇 图书情报与档案管...
- 46 篇 工商管理
46 篇 医学
- 42 篇 临床医学
- 34 篇 基础医学(可授医学...
28 篇 法学
- 26 篇 社会学
20 篇 农学
17 篇 经济学
12 篇 教育学
4 篇 军事学
2 篇 文学
2 篇 艺术学

主题

59 篇 computer science
49 篇 scientific compu...
37 篇 computational mo...
30 篇 laboratories
28 篇 visualization
23 篇 scalability
21 篇 data mining
21 篇 data visualizati...
20 篇 artificial intel...
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 篇 scientific compu...
8 篇 institute of sci...
8 篇 department of co...
8 篇 department of sc...
8 篇 department of co...
8 篇 scientific compu...
8 篇 hourani center f...

作者

20 篇 abhinav bhatele
18 篇 zhang jun
17 篇 schulz martin
17 篇 bhatele abhinav
15 篇 oren gal
13 篇 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,326 篇 英文
51 篇 其他
1 篇 西班牙文
1 篇 中文

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

共 1380 条记录，以下是311-320 订阅

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

详细简洁

排序：

Optimization Techniques and Performance Analyses of Two Life science Algorithms for Novel GPU Architectures

Optimization Techniques and Performance Analyses of Two Life...

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： David Dilch Eduard Mehofer Research Group Scientific Computing Faculty of Computer Science University of Technology Vienna Austria

In this paper we evaluate two life science algorithms, namely Needleman-Wunsch sequence alignment and Direct Coulomb Summation, for GPUs. Whereas for Needleman-Wunsch it is difficult to get good performance numbers, Direct Coulomb Summation is particularly suitable for graphics cards. We present several optimization techniques, analyze the theoretical potential of the optimizations with respect to the algorithms, and measure the effect on execution times. We target the recent NVIDIA Fermi architecture to evaluate the performance impacts of novel hardware features like the cache subsystem on optimizing transformations. We compare the execution times of CUDA and OpenCL code versions for Fermi and predecessor models with parallel OpenMP versions executed on the main CPU.

关键词： Graphics processing unit Kernel Optimization Instruction sets Hardware computer architecture Synchronization

来源：评论

学校读者我要写书评

暂无评论

An Ant-Colony-Optimization Based Approach for Determination of Parameter Significance of scientific Workflows

An Ant-Colony-Optimization Based Approach for Determination ...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Fakhri Alam Khan Yuzhang Han Sabri Pllana Peter Brezany Department of Scientific Computing Faculty of Computer Science University of Technology Vienna Vienna Austria

In the process of a scientific experiment a workflow is executed multiple times using various values of the parameters of activities. For real-world workflows that may contain hundreds of activities, each having several parameters, it is practically not feasible to conduct a parameter sensitivity study by simply following a ”brute-force approach” (that is experimental evaluation of all possible cases). We believe that a heuristic-guided approach enables to find a near-optimal solution using a reasonable amount of resources without the need for the evaluation of all possibilities. In this paper we present a novel methodology for determination of parameter significance of scientific workflows that is based on Ant Colony Optimization (ACO). We refer to our methodology, which is a customization of ACO for Parameter Significance determination, as ACO4PS. We use ACO4PS to identify (1) which parameter strongly affects the overall result of the workflow and (2) for which combination of parameter values we obtain the expected result. ACO4PS generates a list of all workflow parameters sorted by significance as well as is capable of generating a subset of significant parameters. We empirically evaluate our methodology using a real-world scientific workflow that deals with the Non-Invasive Glucose Measurement.

关键词： NP-hard problem Ant colony optimization Application software scientific computing computer science Sugar Extraterrestrial measurements Distributed computing Grid computing Roads

来源：评论

学校读者我要写书评

暂无评论

Estimation of Parameters Sensitivity for scientific Workflows

Estimation of Parameters Sensitivity for Scientific Workflow...

引用

International Conference on Parallel Processing Workshops (ICPPW)

作者： Fakhri Alam Khan Yuzhang Han Sabri Pllana Peter Brezany Department of Scientific Computing Faculty of Computer Science University of Technology Vienna Vienna Austria

Usually workflow activities in the scientific domain depend on a collection of parameters. These parameters determine the output of the activity, and consequently the output of the whole workflow. In the scientific domain, workflows have exploratory nature and are used to understand a scientific phenomenon or answer scientific questions. In the process of a scientific experiment a workflow is executed multiple times using various values of the parameters of activities. It is relevant to identify (1) which parameter strongly affects the overall result of the workflow and (2) for which combination of parameter values we obtain the expected result. Foreseeing these issues, in this paper we present our methodology to estimate the significance of all scientific workflow parameters as well as to estimate the most significant parameter to the workflow. The estimation of parameter significance will enable the scientist to fine tune, and optimize his results efficiently. Furthermore, we empirically validate our methodology on Non-Invasive Glucose Measurement workflow and discuss our results. The NIGM workflow uses the neural network model to calculate the glucose level in patient blood. The neural network model has a set of parameters, which affect the result of the workflow significantly. But, unfortunately the impact significance of these parameters is commonly unknown to the user. We present our approach for estimating and quantifying impact significance of neural network parameters.

关键词： Parameter estimation Neural networks Sugar Parallel processing scientific computing computer science Blood Distributed computing Grid computing

来源：评论

学校读者我要写书评

暂无评论

Structural properties of the graph of augmented sparse approximate inverses

Structural properties of the graph of augmented sparse appro...

引用

Symposium on Applied computing

作者： J.D.F. Cosgrove J.C. Diaz Mathematics and Computer Science Cameron University Center for Parallel and Scientific Computing University of Tulsa

Graph-theoretical properties of an adaptive fill-in strategy for the construction of sparse approximate inverses of sparse matrices are discussed. The approximate inverse is based on minimization of the Frobenius norm and lends itself naturally to a parallel implementation. General sparsity can be exploited in a straightforward fashion. Sparse-graph algorithms for the location of fill-in within each column of the approximate inverse preconditioning are described using level sets. Examples illustrating the approach are presented. Properties of the fill-in strategy for regularly structured sparsity patterns are established.< >

关键词： Least squares approximation Sparse matrices Least squares methods Level set Parallel processing Mathematics computer science Iterative methods scientific computing Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

A Service Oriented Approach for Distributed Data Mediation on the Grid

A Service Oriented Approach for Distributed Data Mediation o...

引用

International Conference on Grid and Cooperative computing (GCC)

作者： Martin Koehler Siegfried Benkner Department of Scientific Computing Faculty of Computer Science University of Technology Vienna Vienna Austria

Seamless integrated access to data stored in globally distributed databases has become a major challenge in many scientific disciplines. In this paper, we describe a grid-based service-oriented infrastructure that tackles this challenge through the provisioning of virtual data sources realized by means of distributed data mediation services. Virtual data sources offer to the user a single integrated view of distributed heterogeneous databases and information sources while hiding the details of data location, data formats, and access mechanisms of the underlying physical data sources. Personalized views of data sources, tailor-made for specific usage scenarios, may be offered by different virtual data sources. virtual data sources rely on flexible mediation techniques and utilize distributed query processing to optimize complex data integration scenarios. Distributed data mediation services have been realized on top of standard grid and Web services technologies including OGSA-DAI and OGSA-DQP. The generic data service infrastructure described in this paper is being utilized in the context of the European @neurIST project, which develops an advanced service-oriented grid infrastructure for the management and treatment of multi-factorial diseases. Details of distributed data mediation and query processing are presented in the context of an experimental scenario integrating clinical data bases.

关键词： Mediation Distributed computing Grid computing Diseases scientific computing computer science Distributed databases Query processing Web services Project management

来源：评论

学校读者我要写书评

暂无评论

Accessing and steering the elastic OLAP cloud

Accessing and steering the elastic OLAP cloud

引用

Proceedings of the International Convention MIPRO

作者： Sicen Ye Peng Chen Ivan Janciak Peter Brezany Research Group of Scientific Computing Faculty of Computer Science University of Vienna Vienna Austria

A typical cloud platform provides capability of scalability, elasticity and fault tolerance. Moreover, it is designed to deal with high volumes of data on nearly unlimited number of machines. On-Line Analytical Processing (OLAP), a kernel part of modern decision support systems, allows interactive analysis of multidimensional data of varied granularity. A combination of the Cloud computing and OLAP technologies brings challenges in providing OLAP analysis services in distributed environments. This paper first presents an overview of our on-going research of Elastic OLAP Cloud Platform. Then it introduces our design and implementation of a multi-tier client system, which on one hand interacts with the Elastic OLAP Cloud platform, provides Web based Graphical User Interfaces for administration of virtual OLAP cubes and performing OLAP analysis queries, and on the other hand, interacts with the OGSA-DAI middleware to access heterogeneous data sources and load integrated data into the Elastic OLAP Cloud platform. The communication between the client and the platform is based on our home-grown OLAP Modeling Markup Language (OMML), which is also presented in this paper.

关键词： Servers XML Cloud computing Graphical user interfaces Distributed databases computer architecture

来源：评论

学校读者我要写书评

暂无评论

Approximation and competitive algorithms for single-minded selling problem 1

引用

12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018

作者： Chin, Francis Y. L. Poon, Sheung-Hung Ting, Hing-Fung Xu, Dachuan Yu, Dongxiao Zhang, Yong Department of Computer Science The University of Hong Kong Pok Fu Lam Hong Kong School of Computer Science University of Nottingham Ningbo China Ningbo China Beijing Institute for Scientific and Engineering Computing Beijing University of Technology Beijing China Institute of Intelligent Computing School of Computer Science and Technology Shandong University Qingdao266237 China Research Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis Technology Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China

ISBN: (数字)9783030046187

ISBN: (纸本)9783030046170

The problem of item selling with the objective of maximizing the revenue is studied. Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must carefully assign some amount of bundles to each buyer with respect to the buyer’s accepted price. Each buyer bi is associated with a value function vi(·) such that vi(x) is the accepted unit bundle price bi is willing to pay for x bundles. We show that the single-minded item selling problem is NP-hard. Moreover, we give an O(√k)-approximation algorithm. For the online version, i.e., the buyers come one by one and the decision on each buyer must be made before the arrival of the next buyer, an O(√k · (log h + log k))- competitive algorithm is achieved, where h is the highest unit item price among all buyers. © Springer Nature Switzerland AG 2018.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

A Service-Oriented Grid Environment with On-demand QoS Support

A Service-Oriented Grid Environment with On-demand QoS Suppo...

引用

IEEE World Congress on Services (SERVICES)

作者： Gerhard Engelbrecht Siegfried Benkner Institute of Scientific Computing Faculty of Computer Science University of Technology Vienna Vienna Austria

The evolution of Grid computing technologies over recent years has been dominated by the adoption of a service-oriented paradigm and an increasing use of commercial Web services technologies. Closely linked to this transition are QoS mechanisms such as service level agreements. The work presented in this paper contributes to this evolution by proposing a service-oriented Grid infrastructure with on-demand Quality of Service support. The presented infrastructure is based on standard Web services technologies and enables the provision of compute intensive HPC applications as services in an automated way. The system employs a business-oriented model for Grid computing incorporating dynamic negotiation of service level agreements. The underlying QoS support relies on advance resource-reservation, application-specific resource requirement estimation and according dynamic resource pricing.

关键词： Quality of service Web services Grid computing computer applications Pricing Service oriented architecture Application software scientific computing computer science computer architecture

来源：评论

学校读者我要写书评

暂无评论

Preserving time in large-scale communication traces

Preserving time in large-scale communication traces

引用

22nd ACM International Conference on Supercomputing, ICS'08

作者： Ratn, Prasun Mueller, Frank De Supinski, Bronis R. Schulz, Martin North Carolina State University Department of Computer Science Raleigh NC 27695-7534 United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA 94551 United States

ISBN: (纸本)9781605581583

Analyzing the performance of large-scale scientific applications is becoming increasingly difficult due to the sheer size of performance data gathered. Recent work on scalable communication tracing applies online interprocess compression to address this problem. Yet, analysis of communication traces requires knowledge about time progression that cannot trivially be encoded in a scalable manner during compression. We develop scalable time stamp encoding schemes for communication traces. At the same time, our work contributes novel insights into the scalable representation of time stamped data. We show that our representations capture sufficient information to enable what-if explorations of architectural variations and analysis for path-based timing irregularities while not requiring excessive disk space. We evaluate the ability of several time-stamped compressed MPI trace approaches to enable accurate timed replay of communication events. Our lossless traces are orders of magnitude smaller, if not near constant size, regardless of the number of nodes while preserving timing information suitable for application tuning or assessing requirements of future procurements. Our results prove timepreserving tracing without loss of communication information can scale in the number of nodes and time steps, which is a result without precedent. Copyright 2008 Association for computing Machinery.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

A (Radical) Proposal Addressing the Non-scalability of the Irregular MPI Collective Interfaces

A (Radical) Proposal Addressing the Non-scalability of the I...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Jesper Larsson Traff Department of Scientific Computing Faculty of Computer Science University of Technology Vienna Vienna Austria

In both the regular and the irregular MPI collectives there is a correspondence between the argument lists and certain MPI derived datatypes. As a means to address and alleviate well-known memory and performance scalability problems in the irregular (or vector) collective interface definitions of MPI we propose to push this correspondence to its natural limit, and replace the interfaces of the MPI collectives with a new set of interfaces that specify all data sizes and displacements solely by means of derived datatypes. This reduces the number of collective (communication and reduction) interfaces from 16 to 10 (in the extreme to only 7), significantly generalizes the operations, unifies regular and irregular collective interfaces, makes it possible to decouple certain algorithmic decisions from the collective operation, and moves the interface scalability issue from the collective interfaces to the MPI derived datatypes. To complete the proposal we discuss the memory scalability of the derived datatypes and suggest a number of new datatypes for MPI, some of which may be of independent interest. Finally, we introduce additional, new functionality for scalable construction of datatypes as needed for the new collective interfaces. We give examples throughout of the benefits of this alternative set of collective interfaces. It is argued that an implementation can straightforwardly be undertaken within any reasonable MPI implementation.

关键词： Scalability Proposals Layout Tiles Indexes Semantics Limiting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共138页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：