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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是291-300 订阅

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

详细简洁

排序：

A genetic algorithm for optimization of spatial trusses considering self-weight loads 4

A genetic algorithm for optimization of spatial trusses cons...

引用

4th International Conference on Engineering Optimization, ENGOPT 2014

作者： Lemonge, A.C.C. Hallak, P.H. Fonseca, L.G. Barbosa, H.J.C. Department of Applied and Computational Mechanics Federal University of Juiz de Fora Brazil Department of Computer Science Federal University of Juiz de Fora Brazil LNCC - National Laboratory for Scientific Computing Brazil

ISBN: (纸本)9781138027251

In this paper a genetic algorithm is proposed to solve the weight minimization problem of domes, made up of standard modules considering configuration and sizing design variables. Previous work done by the authors [1] did not consider the geometrically nonlinear behavior of the domes which is included in this paper as well as loads due to the self-weight of the structures during the optimization process. They are important aspects, not to be neglected in this kind of structure. The domes are assembled from standard modules composed by ten members that are grouped into seven distinct profiles. In addition, cardinality constraints are introduced to define alternative member groupings of the standard modules. This type of evolution of the whole structural configuration is an attractive feature because it allows the designer to automate the search for the global configuration of the dome, finding the best number of standard modules simultaneously with the shape and sizing design variables for these modules. Several experiments are performed using a 120-bar dome as test-bed. © 2015 Taylor & Francis Group, London.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Provenance management in Swift

Provenance management in Swift

引用

作者： Gadelha Jr., Luiz M.R. Clifford, Ben Mattoso, Marta Wilde, Michael Foster, Ian Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil National Laboratory for Scientific Computing Brazil Computation Institute University of Chicago United States Mathematics and Computer Science Division Argonne National Laboratory United States

The Swift parallel scripting language allows for the specification, execution and analysis of large-scale computations in parallel and distributed environments. It incorporates a data model for recording and querying provenance information. In this article we describe these capabilities and evaluate the interoperability with other systems through the use of the Open Provenance Model. We describe Swift's provenance data model and compare it to the Open Provenance Model. We also describe and evaluate activities performed within the Third Provenance Challenge, which consisted of implementing a specific scientific workflow, capturing and recording provenance information of its execution, performing provenance queries, and exchanging provenance information with other systems. Finally, we propose improvements to both the Open Provenance Model and Swift's provenance system. © 2011 Elsevier B.V. All rights reserved.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Hydraulic Simulation of Water Supply Networks under Control

Hydraulic Simulation of Water Supply Networks under Control

引用

2005 World Water and Environmental Resources Congress

作者： Deuerlein, J. Cembrowicz, R.G. Dempe, S. Kaiserstr. 12 D-76131 Karlsruhe Institute for Scientific Computing and Optimization Department of Mathematics and Computer Science Technical University Bergakademie Freiberg Leipziger Str. 28 D-09596 Freiberg

ISBN: (纸本)0784407924

The objectives of simulating the hydraulic behavior of a water supply network, being either real or planned, focus upon identifying flow, pressure and velocities, following time variant system's operation or the propagation of water quality in the network, supporting leak detection, verifying the hydraulic impact of different system's elements, guiding gauging and calibration. Existing simulation models represented by available software show different capacities regarding control devices, including pressure control valves, pressure sustaining valves, flow control valves, check valves, speed regulated pumps - operated combined and simultaneously where convergence may not be obtained. Since a rigorous mathematical approach is lacking the system's behavior is presently treated heuristically without guarantee of success. Consequently a new mathematical approach has been derived and is presented here. First, the hydraulic simulation is conceived as optimization of the system's 'Content' and 'Co-Content' functions. Second, regarding flow control devices, Convex Analysis is utilized to allow a generalization of the hydraulic equations of system's elements in the form of subdifferential mappings leading to Kuhn-Tucker conditions, amenable to solution. Third, regarding pressure control devices, the definition of a Nash Equilibrium, according to Game Theory, between the 'Co-Content' and additional minimizing problems, describing the system behavior of the devices, also leads to a solution. Hence, arbitrary flow and pressure controlling devices can now be incorporated in water supply network simulation. Convergence is assured if the system's physics are feasible. The approach has been implemented as part of the water supply network simulation & optimization model KANET. Copyright ASCE 2005.

关键词： Water supply systems

来源：评论

学校读者我要写书评

暂无评论

Virtual machine provisioning, code management, and data movement design for the Fermilab HEPCloud Facility 22

Virtual machine provisioning, code management, and data move...

引用

22nd International Conference on computing in High Energy and Nuclear Physics, CHEP 2016

作者： Timm, S. Cooper, G. Fuess, S. Garzoglio, G. Holzman, B. Kennedy, R. Grassano, D. Tiradani, A. Krishnamurthy, R. Vinayagam, S. Raicu, I. Wu, H. Ren, S. Noh, S.-Y. Scientific Computing Division Fermilab BataviaIL60563 United States Computer Science Dept. Illinois Institute of Technology ChicagoIL60616 United States Korea Institute of Science and Technology Information Daejeon Korea Republic of

The Fermilab HEPCloud Facility Project has as its goal to extend the current Fermilab facility interface to provide transparent access to disparate resources including commercial and community clouds, grid federations, and HPC centers. This facility enables experiments to perform the full spectrum of computing tasks, including data-intensive simulation and reconstruction. We have evaluated the use of the commercial cloud to provide elasticity to respond to peaks of demand without overprovisioning local resources. Full scale data-intensive workflows have been successfully completed on Amazon Web Services for two High Energy Physics Experiments, CMS and NOνA, at the scale of 58000 simultaneous cores. This paper describes the significant improvements that were made to the virtual machine provisioning system, code caching system, and data movement system to accomplish this work. The virtual image provisioning and contextualization service was extended to multiple AWS regions, and to support experiment-specific data configurations. A prototype Decision Engine was written to determine the optimal availability zone and instance type to run on, minimizing cost and job interruptions. We have deployed a scalable on-demand caching service to deliver code and database information to jobs running on the commercial cloud. It uses the frontiersquid server and CERN VM File System (CVMFS) clients on EC2 instances and utilizes various services provided by AWS to build the infrastructure (stack). We discuss the architecture and load testing benchmarks on the squid servers. We also describe various approaches that were evaluated to transport experimental data to and from the cloud, and the optimal solutions that were used for the bulk of the data transport. Finally, we summarize lessons learned from this scale test, and our future plans to expand and improve the Fermilab HEP Cloud Facility. © Published under licence by IOP Publishing Ltd.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Techniques for specifying bug patterns

Techniques for specifying bug patterns

引用

2007 ACM International Symposium on Software Testing and Analysis, ISSTA'07 and PADTAD-V Workshop

作者： Quinlan, Daniel J. Vuduc, Richard W. Misherghi, Ghassan Center for Applied Scientific Computing Lawrence Livermore National Laboratory 7000 East Avenue Livermore CA United States Department of Computer Science University of California Davis Davis CA United States

ISBN: (纸本)159593748X

We present our on-going work to develop techniques for specifying source code signatures of bug patterns. Specifically, we discuss two approaches. The first approach directly analyzes a program in the intermediate representation (IR) of the ROSE compiler infrastructure using ROSE's API. The second analyzes the program using the bddbddb system of Lam, Whaley, et al.. In this approach, we store the IR produced by ROSE as a relational database, express patterns as declarative inference rules on relations in the language Datalog, and bddbddb implements the Datalog programs using binary decision diagram (BDD) techniques. Both approaches readily apply to large-scale applications, since ROSE provides full type analysis, control flow, and other available analysis information. In this paper, we primarily consider bug patterns expressed with respect to the structure of the source code or the control flow, or both. More complex techniques to specify patterns that are functions of data flow properties may be addressed by either of the above approaches, but are not directly treated here. Our Datalog-based work includes explicit support for expressing patterns on the use of the Message Passing Interface (MPI) in parallel distributed memory programs. We show examples of this on-going work as well. Copyright 2007 ACM.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes Promising 24

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wu, Chun-Feng Chang, Yuan-Hao Yang, Ming-Chang Kuo, Tei-Wei Department of Computer Science National Yang Ming Chiao Tung University Taiwan Institue of Information Science Academia Sinica Taiwan Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Department of Computer Science and Information Engineering National Taiwan University Taiwan High Performance and Scientific Computing Center National Taiwan University Taiwan Delta Electronics Taiwan

ISBN: (纸本)9798400706011

The advent of Ultra-Low-Latency storage devices has narrowed the performance gap between storage and CPU in computing platforms, facilitating synchronous I/O adoption. Yet, this approach introduces substantial busy waiting time and underutilizes computing units. To address this, we propose a light-weighted Idle-Time-Stealing (ITS) design. This involves a self-improving thread conducting prefetching for high-priority processes during synchronous I/O, and an I/O-waiting process continuing subsequent instruction executions when justifiable. Another thread, the self-sacrificing thread, proactively switches low-priority process I/O requests from synchronous to asynchronous mode, prioritizing high-priority executions. Experimental results demonstrate the effectiveness of our ITS design in reducing CPU idle time. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

Weighted locality-sensitive scheduling for mitigating noise on multi-core clusters

Weighted locality-sensitive scheduling for mitigating noise ...

引用

18th International Conference on High Performance computing, HiPC 2011

作者： Kale, Vivek Bhatele, Abhinav Gropp, William D. Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL 61801 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)9781457719516

Recent studies have shown that operating system (OS) interference, popularly called OS noise can be a significant problem as we scale to a large number of processors. One solution for mitigating noise is to turn off certain OS services on the machine. However, this is typically infeasible because full-scale OS services may be required for some applications. Furthermore, it is not a choice that an end user can make. Thus, we need an application-level solution. Building upon previous work that demonstrated the utility of within-node light-weight load balancing, we discuss the technique of weighted micro-scheduling and provide insights based on experimentation for two different machines with very different noise signatures. Through careful enumeration of the search space of scheduler parameters, we allow our weighted micro-scheduler to be dynamic, adaptive and tunable for a specific application running on a specific architecture. By doing this, we show how we can enable running scientific applications efficiently on a very large number of processors, even in the presence of noise. © 2011 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of data types for classification of deep web sources

Automatic generation of data types for classification of dee...

引用

Second International Workshop on Data Integration in the Life sciences, DILS 2005

作者： Ngu, Anne H.H. Buttler, David Critchlow, Terence Department of Computer Science Texas State University San Marcos TX 78666 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)3540279679

A Service Class Description (SCD) is an effective meta-data based approach for discovering Deep Web sources whose data exhibit some regular patterns. However, it is tedious and error prone to create an SCD description manually. Moreover, a manually created SCD is not adaptive to the frequent changes of Web sources. It requires its creator to identify all the possible input and output types of a service a priori. In many domains, it is impossible to exhaustively list all the possible input and output data types of a source in advance. In this paper, we describe machine learning approaches for automatic generation of the data types of an SCD. We propose two different approaches for learning data types of a class of Web sources. The Brute-Force Learner is able to generate data types that can achieve high recall, but with low precision. The Clustering-based Learner generates data types that have a high precision rate, but with a lower recall rate. We demonstrate the feasibility of these two learning-based solutions for automatic generation of data types for citation Web sources and presented a quantitative evaluation of these two solutions. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

A method for contactless palm ROI extraction 11

A method for contactless palm ROI extraction

引用

11th International Conference on computer Engineering and Systems, ICCES 2016

作者： ElSayed, Ahmed S. Ebeid, Hala M. Roushdy, Mohamed Fayed, Zaki T. Computer Science Dept. Faculty of Computers and Information Sciences Ain Shams University Cairo Egypt Scientific Computing Department Faculty of Computers and Information Sciences Ain Shams University Cairo Egypt

ISBN: (纸本)9781509032679

Palmprint can be extracted from a hand using a low-cost webcam in a contactless manner. Using a webcam makes the enrollment process fast and convenient for users. Being contactless solve the hygiene issue and avoid copying the latent prints from sensor's surface. However, a number of challenges arise in such environment;geometric transformations, the existence of finger rings, hand accessories, and other false objects. This paper proposes a palm ROI extraction method that is robust to these challenges. The method is based on blob analysis, morphological and geometrical operations without a need to pre-Train or parameter adjustment. It's tested on three available hand databases that cover these challenges;namely, Sfax, IITD and PolyU 3D/2D. The palm ROI is considered to be wrongly extracted if it contains part of the background. The method achieves an extraction error of 0%, 0.27% and 0.26% for the three DBs, respectively. Applying a massive rotation and scaling tests leads to a minor increase in the extraction errors by 0.24%, 0.35% and 0.84% for the three DBs, respectively. © 2016 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Avoiding hot-spots on two-level direct networks

Avoiding hot-spots on two-level direct networks

引用

2011 International Conference for High Performance computing, Networking, Storage and Analysis, SC11

作者： Bhatele, Abhinav Jain, Nikhil Gropp, William D. Kale, Laxmikant V. Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA 94551 United States Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL 61801 United States

ISBN: (纸本)9781450307710

A low-diameter, fast interconnection network is going to be a prerequisite for building exascale machines. A two-level direct network has been proposed by several groups as a scalable design for future machines. IBM's PERCS topology and the dragonfly network discussed in the DARPA exascale hardware study are examples of this design. The presence of multiple levels in this design leads to hot-spots on a few links when processes are grouped together at the lowest level to minimize total communication volume. This is especially true for communication graphs with a small number of neighbors per task. Routing and mapping choices can impact the communication performance of parallel applications running on a machine with a two-level direct topology. This paper explores intelligent topology aware mappings of different communication patterns to the physical topology to identify cases that minimize link utilization. We also analyze the trade-offs between using direct and indirect routing with different mappings. We use simulations to study communication and overall performance of applications since there are no installations of two-level direct networks yet. This study raises interesting issues regarding the choice of job scheduling, routing and mapping for future machines. Copyright 2011 ACM.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：