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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A robust content-based image retrieval system using multiple features representations

A robust content-based image retrieval system using multiple...

引用

2005 IEEE Networking, Sensing and Control, ICNSC2005

作者： Tahoun, Mohamed A. Nagaty, Khaled A. El-Arief, Taha I. A-Megeed, Mohammed Computer Science Dep. Faculty of Computers and Informatics Suez Canal University Egypt Computer Science Dep. Faculty of Computer and Information Science Ain Shams University Egypt Scientific Computing Dep. Faculty of Computer and Information Science Ain Shams University Egypt

The similarity measurements and the representation of the visual features are two important issues in Content-Based Image Retrieval (CBIR). In this paper, we compared between the combination of wavelet-based representations of the texture feature and the color feature with and without using the color layout feature. To represent the color information, we used Global Color Histogram (GCH) beside the color layout feature and with respect to the texture information, we used Haar and Daubechies wavelets. Based on some commonly used Euclidean and Non-Euclidean similarity measures, we tested different categories of images and measured the retrieval accuracy when combining such techniques. The experiments showed that the combination of GCH and 2-D Haar wavelet transform using the cosine distance gives good results while the best results obtained when adding the color layout feature to this combination by using the Euclidean distance. The results reflected the importance of using the spatial information beside the color feature itself and the importance of choosing good similarity distance measurements. © 2005 IEEE.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

A robust alignment-based personal recognition using center inner Knuckle prints 8

A robust alignment-based personal recognition using center i...

引用

8th International Conference on Intelligent computing and Information Systems, ICICIS 2017

作者： Sadik, Mona A. Al-Berry, Maryam N. Roushdy, Mohamed Computer Science Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt Scientific Computing Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

ISBN: (纸本)9772371723

Biometrie based identification systems have beer widely used due to their reliability. Inner Knuckle Print images contain unique and reliable features for human identification. fr this paper, we propose a personal identification method using the Center Inner Knuckle Prints. The proposed method uses the Neighboring Direction Indicator features along with a perfect alignment and enhancement preprocessing steps that boost the performance compared to state-of-the-art methods. The performance of different feature extraction methods has been investigated using Sfax-Miracle Database, which is composed of low resolution hand images captured by a contactless capture in a free environment to test the effect of alignment and enhancement The effect of prints' fusion at the score level has also been investigated for a multimodal identification system. The result show that the proposed method outperforms state-of-the-are methods considering both Equal Error Rate and Best Identification Rate. © 2017 IEEE.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

A survey on the finger knuckle prints biometrie 8

A survey on the finger knuckle prints biometrie

引用

8th International Conference on Intelligent computing and Information Systems, ICICIS 2017

ISBN: (纸本)9772371723

Biometrie security systems are now highly explored by many researchers for their high accuracy levels. These systems were recorded to be more reliable than traditional security systems that use typed passwords. Some biometric prints have been explored to be used in security systems. These prints include face, iris, voice, palm, finger print, knuckles print, handwriting, speech and keystroke. In this paper, a recent review is performed on the recognition algorithms used with knuckle prints which are formed at the joints either on the finger back surface or on the finger inner surface. The algorithms are classified and a comparison is presented between the performances of different recognition methods. The comparison includes using these methods on a single print and on multiple prints fused together, and whether the prints have been acquired using a contact or contactless device. The paper also presents a list of available datasets that can be used for performance evaluation. © 2017 IEEE.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

Extracting logical structure and identifying stragglers in parallel execution traces 14

Extracting logical structure and identifying stragglers in p...

引用

2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014

作者： Isaacs, Katherine E. Gamblin, Todd Bhatele, Abhinav Bremer, Peer-Timo Schulz, Martin Hamann, Bernd Department of Computer Science University of California Davis United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9781450326568

We introduce a new approach to automatically extract an idealized logical structure from a parallel execution trace. We use this structure to define intuitive metrics such as the lateness of a process involved in a parallel execution. By analyzing and illustrating traces in terms of logical steps, we leverage a developer's understanding of the happened-before relations in a parallel program. This technique can uncover dependency chains, elucidate communication patterns, and highlight sources and propagation of delays, all of which may be obscured in a traditional trace visualization.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Boundary determination for trivariate solids 7

Boundary determination for trivariate solids

引用

7th Pacific Conference on computer Graphics and Applications, Pacific Graphics 1999

作者： Joy, Kenneth I. Duchaineau, Mark A. Computer Science Department University of California Davis United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)0769502938

The trivariate tensor-product B-spline solid is a direct extension of the B-spline patch and has been shown to be useful in the creation and visualization of free-form geometric solids. Visualizing these solid objects requires the determination of the boundary surface of the solid, which is a combination of parametric and implicit surfaces. This paper presents a method that determines the implicit boundary surface by examination of the Jacobian determinant of the defining B-spline function. Using an approximation to this determinant, the domain space is adaptively subdivided until a mesh can be determined such that the boundary surface is close to linear in the cells of the mesh. A variation of the marching cubes algorithm is then used to draw the surface. Interval approximation techniques are used to approximate the Jacobian determinant and to approximate the Jacobian determinant gradient for use in the adaptive subdivision methods. This technique can be used to create free-form solid objects, useful in geometric modeling applications. © 1999 IEEE.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Data allocation based on XML query patterns to reduce power consumption

Data allocation based on XML query patterns to reduce power ...

引用

9th IEEE Int. Conf. on Dependable, Autonomic and Secure Comput., DASC 2011, incl. 9th Int. Conf. on Pervasive Intelligence and computing, PICom 2011, 9th Int. Symp. on Embedded computing, EmbeddedCom 2011, 1st Int. Conf. on Cloud and Green Comput.CGC

作者： Jiang, Xuehua Watanabe, Yousuke Yokota, Haruo Department of Computer Science Tokyo Institute of Technology Tokyo Japan Global Scientific Information and Computing Center Tokyo Institute of Technology Tokyo Japan

ISBN: (纸本)9780769546124

The amount of electrical power consumed in data centers is increasing, so reducing power consumption is an important issue for cloud computing. An effective approach to reducing power consumption is suitable data allocation in data storage. Previous studies of this approach were mainly based on data-access frequency to decide the allocation of data. We propose a data allocation method based on query-pattern analysis. Because many Internet applications use the XML format to transfer and store data, we study XML queries here. Fortunately, a tree structure in XML is useful to distinguish the chunk of information to be accessed by a query. Our proposed algorithm, XARrP, an XML data Allocation algorithm for Reducing Power consumption, treats queries in XPath format with special symbols and attributes. XARP is separated into four steps: XPath processing, class mining, association, and data allocation. The XPath process retrieves multiple XML classes from query logs, even though some of them may not be expressed exactly. The class mining process analyzes query patterns to discover frequent classes. Infrequent classes are separated into several class sets in the association process. Finally, the frequent classes and the infrequent class sets are stored in different disks to reduce power consumption. Assuming no special hardware but disk drives spinning down after a specific time period, evaluation results show that power consumption is reduced by 32.5% compared with applying a naive striping method and reduced by 10.8% when compared with a method applying a previous XML cache algorithm. The performance expressed as number of transactions processed per unit of power of the proposed method is 2.5 times better than that of striping. © 2011 IEEE.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

Event-driven simulation of power electronics in the complementarity systems framework

Event-driven simulation of power electronics in the compleme...

引用

2012 IEEE 13th Workshop on Control and Modeling for Power Electronics, COMPEL 2012

作者： Tant, Jeroen Driesen, Johan Michiels, Wim Research Group ELECTA KU Leuven Leuven Belgium Department of Computer Science Scientific Computing Research Group KU Leuven Leuven Belgium

ISBN: (纸本)9781424493739

A new event-driven method is proposed for the numerical simulation of power electronic circuits with ideal switches and diodes, and their accompanying control systems. The power electronic circuit is modeled as a complementarity system and the control system is modeled separately. It is shown that the diode state determination problem can be formulated as a complementarity problem. Discontinuous jumps in the state variables are allowed after a switching event. The method is applied to two examples and the numerical accuracy with respect to the step size is compared with time-stepping methods. The importance of the event localization accuracy is discussed. © 2012 IEEE.

关键词： Control systems

来源：评论

学校读者我要写书评

暂无评论

Fast Symmetric Eigenvalue Decomposition via WY Representation on Tensor Core 23

Fast Symmetric Eigenvalue Decomposition via WY Representatio...

引用

28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023

作者： Zhang, Shaoshuai Shah, Ruchi Ootomo, Hiroyuki Yokota, Rio Wu, Panruo Department of Computer Science University of Houston TX United States Global Scientific Information and Computing Center Tokyo Institute of Technology Tokyo Japan

ISBN: (纸本)9798400700156

Symmetric eigenvalue decomposition (EVD) is a fundamental analytic and numerical tool used in many scientific areas. The state-of-the-art algorithm in terms of performance is typically the two-stage tridiagonalization method. The first stage in the two-stage tridiagonalization is called successive band reduction (SBR), which reduces a symmetric matrix to a band form, and its computational cost usually dominates. When Tensor Core (specialized matrix computational accelerator) is used to accelerate the expensive EVD, the conventional ZY-representation-based method results in suboptimal performance due to unfavorable shapes of the matrix computations. In this paper, we propose a new method that uses WY representation instead of ZY representation (see Section 3.2 for details), which can provide a better combination of locality and parallelism so as to perform better on Tensor Cores. Experimentally, the proposed method can bring up to 3.7x speedup in SBR and 2.3x in the entire EVD compared to state-of-the-art implementations. © 2023 ACM.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Extracting logical structure and identifying stragglers in parallel execution traces

Extracting logical structure and identifying stragglers in p...

引用

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Lock-free GaussSieve for linear speedups in parallel high performance SVP calculation 26

Lock-free GaussSieve for linear speedups in parallel high pe...

引用

26th International Symposium on computer Architecture and High Performance computing, SBAC-PAD 2014

作者： Mariano, Artur Timnat, Shahar Bischof, Christian Institute for Scientific Computing Technische Universität Darmstadt Darmstadt Germany Department of Computer Science Technion - Israel Institute of Technology Haifa Israel

ISBN: (纸本)9781479969043

Lattice-based cryptography became a hot-topic in the past years because it seems to be quantum immune, i.e., resistant to attacks operated with quantum computers. The security of lattice-based cryptosystems is determined by the hardness of certain lattice problems, such as the Shortest Vector Problem (SVP). Thus, it is of prime importance to study how efficiently SVP-solvers can be implemented. This paper presents a parallel shared-memory implementation of the GaussSieve algorithm, a well known SVP-solver. Our implementation achieves almost linear and linear speedups with up to 64 cores, depending on the tested scenario, and delivers better sequential performance than any other disclosed GaussSieve implementation. In this paper, we show that it is possible to implement a highly scalable version of GaussSieve on multi-core CPU-chips. The key features of our implementation are a lock-free singly linked list, and hand-tuned, vectorized code. Additionally, we propose an algorithmic optimization that leads to faster convergence. © 2014 IEEE.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：