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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,767 篇 期刊文献
1,316 篇 会议
20 册 图书

馆藏范围

3,103 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,123 篇 工学
- 1,530 篇 计算机科学与技术...
- 1,200 篇 软件工程
- 461 篇 信息与通信工程
- 295 篇 生物工程
- 280 篇 电气工程
- 262 篇 控制科学与工程
- 240 篇 光学工程
- 220 篇 电子科学与技术（可...
- 214 篇 生物医学工程（可授...
- 111 篇 机械工程
- 104 篇 化学工程与技术
- 100 篇 仪器科学与技术
- 70 篇 材料科学与工程（可...
- 66 篇 网络空间安全
- 58 篇 动力工程及工程热...
1,239 篇 理学
- 523 篇 数学
- 485 篇 物理学
- 324 篇 生物学
- 172 篇 统计学（可授理学、...
- 159 篇 化学
- 87 篇 系统科学
- 56 篇 地球物理学
499 篇 管理学
- 291 篇 管理科学与工程(可...
- 219 篇 图书情报与档案管...
- 118 篇 工商管理
202 篇 医学
- 174 篇 临床医学
- 144 篇 基础医学(可授医学...
- 85 篇 药学(可授医学、理...
- 75 篇 公共卫生与预防医...
86 篇 法学
- 65 篇 社会学
42 篇 农学
39 篇 经济学
31 篇 教育学
10 篇 文学
10 篇 艺术学
3 篇 军事学

主题

82 篇 deep learning
77 篇 semantics
77 篇 feature extracti...
68 篇 machine learning
67 篇 computational mo...
58 篇 training
42 篇 federated learni...
42 篇 accuracy
39 篇 data models
38 篇 deep neural netw...
36 篇 graph neural net...
35 篇 artificial intel...
33 篇 computer science
32 篇 image segmentati...
31 篇 data mining
30 篇 convolution
30 篇 servers
30 篇 predictive model...
29 篇 optimization
28 篇 cloud computing

机构

103 篇 national enginee...
80 篇 school of comput...
51 篇 school of comput...
44 篇 infn sezione di ...
44 篇 north-west unive...
44 篇 université de st...
43 篇 institut univers...
43 篇 tno technical sc...
42 篇 university of ch...
41 篇 department of ph...
41 篇 faculty of scien...
41 篇 departamento de ...
41 篇 department for p...
41 篇 department of ph...
41 篇 yerevan physics ...
41 篇 national centre ...
40 篇 kirchhoff-instit...
40 篇 graduate school ...
40 篇 institute of phy...
39 篇 dipartimento di ...

作者

81 篇 hai jin
77 篇 jin hai
44 篇 chen a.
44 篇 benoit d.m.
44 篇 ferrara g.
44 篇 ardid m.
44 篇 calvo d.
44 篇 eddymaoui a.
41 篇 gagliardini s.
39 篇 gal t.
39 篇 bozza c.
39 篇 díaz a.f.
39 篇 boumaaza j.
38 篇 coleiro a.
38 篇 gozzini s.r.
38 篇 dallier r.
38 篇 benhassi m.
38 篇 boettcher m.
37 篇 enzenhöfer a.
37 篇 celli s.

语言

2,750 篇 英文
317 篇 其他
41 篇 中文
1 篇 日文

检索条件"机构=School of Computer Science and Technology and Hopcroft Center on Computing Science"

共 3103 条记录，以下是3051-3060 订阅

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

详细简洁

排序：

A study of the difference between partial derivative and stochastic neural network sensitivity analysis for applications in supervised pattern classification problems

A study of the difference between partial derivative and sto...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： W.W.Y. Ng D.S. Yeung Xi-Zhao Wang I. Cloete Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China Machine Learnin Center Faculty of Mathematics and Computer Science Hebei University Baoding China School of Information Technology International University Bremen Bruchsal Germany

This work provides a brief development roadmap of the neural network sensitivity analysis, from 1960's to now on. The two main streams of the sensitivity measures: partial derivative and stochastic sensitivity measures are compared. The partial derivative sensitivity (PD-SM) finds the rate of change of the network output with respect to parameter changes, while the stochastic sensitivity (ST-SM) finds the magnitudes of the output perturbations between the original training samples and the perturbed samples, in statistical sense. Their computational complexities are compared. Furthermore, how to evaluate multiple parameters of the neural network with or without correlation are explored too. In addition, the differences of them in the application of supervised pattern classification problems are also discussed. The evaluations are based on three major applications of sensitivity analysis in supervised pattern classification problems: feature selection, sample selection and neural network generalization assessment. ST-SM and PD-SM of the RBFNN are used for investigations.

关键词： Stochastic processes Neural networks Sensitivity analysis Intelligent networks Pattern classification Application software Artificial neural networks computer networks Mathematics computer science

来源：评论

学校读者我要写书评

暂无评论

Evaluating alternative implementations for LDPC decoder check node function

Evaluating alternative implementations for LDPC decoder chec...

引用

IEEE computer Society Annual Symposium on VLSI

作者： T. Theocharides G. Link E. Swankoski N. Vijaykrishnan M.J. Irwin H. Schmit Research Advisory Center of Energy and Electricity Economics North China Electric Power University Beijing China School of Economics and Management China University of Geosciences Wuhan P.R. China Computing and Technology team Nottingham Trent University Nottingham UK Department of Computer Science and Engineering Pennsylvania State University USA

Low density parity checks (LDPC) are a method of error detection and correction that are able to achieve near Shannon-limit channel communication. LDPC decoders involve a series of computations between two units, the check node and the bit node. In this paper we propose the use of an approximation unit to perform the check node operation. Additionally, we propose a ROM based look-up table (LUT) as a function approximation technique, to be used with an LDPC decoder. The paper shows that a ROM based LUT achieves better performance than using a piecewise linear approximation method to approximate the LDPC computation function. Furthermore, this paper shows that the ROM LUT method can gradually take over as the selected function approximation technique for computationally intensive demanding VLSI designs as the technology shifts to the nanometer era.

关键词： Parity check codes Function approximation Table lookup Piecewise linear approximation Read only memory Very large scale integration Sparse matrices Iterative decoding H infinity control Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing algorithms for sequence mining

Dynamic load balancing algorithms for sequence mining

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Chuan-Xiang Ma Qing-Hua Li Zhong Jian Hui Wang National High Performance Computing Center School of Computer Science Huazhong University of Science and Technology China School of Mathematics and Computer Science HuBei University China

ISBN: (纸本)0780378652

Mining sequential patterns in large database is an important problem in data mining research. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient and scalable algorithms. In this paper, we present a new dynamic load algorithm based HPSPM (hash-based parallel algorithm for mining sequential patterns) on shared-nothing environment. Experiments on Dawning 300 cluster system show that this algorithm achieves good speedup and is substantially improved compared to HPSPM.

关键词： Load management Heuristic algorithms Data mining Clustering algorithms Parallel algorithms Databases Partitioning algorithms Itemsets High performance computing computer science

来源：评论

学校读者我要写书评

暂无评论

Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts

Optimal Parallel Algorithm for the Knapsack Problem Without ...

引用

The Fourth International Conference on Parallel and Distributed computing, Applications and Technologies

作者： Kenli LI Qinghua LI Wang-Hui Shengyi JIANG School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China National High Performance Computing Center(Wuhan)

The knapsack problem is very important in cryptosystem and in number *** paper proposes a new parallel algorithm for the knapsack problem where the method of divide and conquer is *** on an EREW-SIMD machine with shared memory,the proposed algorithm utilizes O(2) processors,0≤ε≤1,and O(2) memory to find a solution for the n-element knapsack problem in time O(2(2)).Thus the cost of the proposed parallel algorithm is O(2),which is optimal,and an improved result over the past researches.

关键词： Knapsack problem parallel algorithm optimal algorithm memory conflicts

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel algorithm for the knapsack problem without memory conflicts

Optimal parallel algorithm for the knapsack problem without ...

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Kenli Li Qinghua Li Wang-Hui Shengyi Jiang School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China National High Performance Computing Center Wuhan China

The knapsack problem is very important in cryptosystem and in number theory. We propose a new parallel algorithm for the knapsack problem where the method of divide and conquer is adopted. Basing on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2/sup n/4/)/sup 1-/spl epsiv// processors, 0/spl les//spl epsiv//spl les/1, and O(2/sup n/) memory to find a solution for the n-element knapsack problem in time O(2/sup n/4/ (2/sup n/4/)/sup /spl epsiv//). Thus the cost of the proposed parallel algorithm is O(2/sup n/), which is optimal, and an improved result over the past researches.

关键词： Parallel algorithms Concurrent computing Cost function Algorithm design and analysis Computational modeling computer aided instruction computer science High performance computing Cryptography Read-write memory

来源：评论

学校读者我要写书评

暂无评论

Secure mobile computing

引用

5th International Workshop on Distributed computing, IWDC 2003

作者： Agrawal, Dharma P. Deng, Hongmei Poosarla, Rajani Sanyal, Sugata Center for Distributed and Mobile Computing University of Cincinnati CincinnatiOH45221-0030 United States School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road Mumbai400005 India

ISBN: (纸本)3540207457

As more and more people enjoy the various services brought by mobile computing, it is becoming a global trend in today’s world. At the same time, securing mobile computing has been paid increasing attention. In this article, we discuss the security issues in mobile computing environment. We analyze the security risks confronted by mobile computing and present the existing security mechanisms. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Experiential telepresence: How can telepresence research be guided towards better end user experience?

Experiential telepresence: How can telepresence research be ...

引用

2003 ACM SIGMM Workshop on Experiential Telepresence, ETP '03

作者： Hayes-Roth, Barbara Henderson, Austin Jain, Ramesh Manovich, Lev Welch, Greg Pingali, Gopal Extempo Systems Inc. United States MIT United States Systems Laboratory in the Advanced Concepts and Technology Group of Pitney Bowes United States School of Electrical and Computer Engineering College of Computing Georgia Institute of Technology United States Department of Computer Science and Engineering University of Michigan Ann Arbor MI United States University of California San Diego CA United States Visual Arts Department University of California San Diego CA United States Computer Science Department University of North Carolina Chapel Hill NC United States IEEE Computer Society ACM United States IBM T.J. Watson Research Center 19 Skyline Drive Hawthorne NY 10532 United States

来源：评论

学校读者我要写书评

暂无评论

Two-phase Web site classification based on hidden Markov tree models 03

Two-phase Web site classification based on hidden Markov tre...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： YongHong Tian TieJun Huang Wen Gao Jun Cheng PingBo Kang Graduate School of Chinese Academy of Sciences Research Center for Digital Media Beijing China Digital Media Lab Institute of Computing Technology Chinese Academy and Sciences Beijing China Department of Computer Science Harbin Institute of Technology Harbin China

ISBN: (纸本)9780769519326

With the exponential growth of both the amount and diversity of the information that the Web encompasses, automatic classification of topic-specific Web sites is highly desirable. We propose a novel approach for Web site classification based on the content, structure and context information of Web sites. In our approach, the site structure is represented as a two-layered tree in which each page is modeled as a DOM (document object model) tree and a site tree is used to hierarchically link all pages within the site. Two context models are presented to capture the topic dependences in the site. Then the hidden Markov tree (HMT) model is utilized as the statistical model of the site tree and the DOM tree, and an HMT-based classifier is presented for their classification. Moreover, for reducing the download size of Web sites but still keeping high classification accuracy, an entropy-based approach is introduced to dynamically prune the site trees. On these bases, we employ the two-phase classification system for classifying Web sites through a fine-to-coarse recursion. The experiments show our approach is able to offer high accuracy and efficient process performance.

关键词： Hidden Markov models Classification tree analysis Classification algorithms Context modeling Tree graphs Web pages computer science Electronic mail Bayesian methods Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Which comes first, usability or utility?

Which comes first, usability or utility?

引用

IEEE Conference on Visualization

作者： G. Grinstein A. Kobsa C. Plaisant J.T. Stasko Institute for Visualization and Perception Research University of Massachusetts Lowell Lowell MA University of California School of Information and Computer Science Irvine CA Human Computer Interaction Laboratory University of Maryland College Park MD Georgia Institute of Technology College of Computing/GVU Center Atlanta GA

来源：评论

学校读者我要写书评

暂无评论

Motion capture-driven simulations that hit and react 02

Motion capture-driven simulations that hit and react

引用

ASM SIGGRAPH Symposium on computer Animation

作者： Zordan, V.B. Hodgins, Jessica K. College of Computing and GVU Center Georgia Institute of Technology Atlanta GA United States School of Computer Science Carnegie Mellon University Pittsburgh PA United States

ISBN: (纸本)9781581135732

Controllable, reactive human motion is essential in many video games and training environments. Characters in these applications often perform tasks based on modified motion data, but response to unpredicted events is also important in order to maintain realism. We approach the problem of motion synthesis for interactive, humanlike characters by combining dynamic simulation and human motion capture data. Our control systems use trajectory tracking to follow motion capture data and a balance controller to keep the character upright while modifying sequences from a small motion library to accomplish specified tasks, such as throwing punches or swinging a racket. The system reacts to forces computed from a physical collision model by changing stiffness and damping terms. The freestanding, simulated humans respond automatically to impacts and smoothly return to tracking. We compare the resulting motion with video and recorded human data.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共311页 << < 302 303 304 305 306 307 308 309 310 311 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：