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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,230 篇 会议
3,119 篇 期刊文献
83 册 图书

馆藏范围

6,432 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,980 篇 工学
- 2,802 篇 计算机科学与技术...
- 2,188 篇 软件工程
- 774 篇 信息与通信工程
- 513 篇 光学工程
- 496 篇 生物工程
- 439 篇 生物医学工程（可授...
- 438 篇 控制科学与工程
- 428 篇 电气工程
- 396 篇 电子科学与技术（可...
- 195 篇 机械工程
- 165 篇 化学工程与技术
- 160 篇 仪器科学与技术
- 138 篇 材料科学与工程（可...
- 129 篇 动力工程及工程热...
- 108 篇 力学（可授工学、理...
- 108 篇 土木工程
2,528 篇 理学
- 1,194 篇 数学
- 1,079 篇 物理学
- 572 篇 生物学
- 371 篇 统计学（可授理学、...
- 277 篇 化学
- 211 篇 系统科学
930 篇 管理学
- 514 篇 管理科学与工程(可...
- 423 篇 图书情报与档案管...
- 269 篇 工商管理
468 篇 医学
- 406 篇 临床医学
- 318 篇 基础医学(可授医学...
- 198 篇 药学(可授医学、理...
- 146 篇 公共卫生与预防医...
148 篇 法学
- 129 篇 社会学
95 篇 经济学
88 篇 农学
69 篇 教育学
17 篇 文学
11 篇 军事学
11 篇 艺术学
1 篇 哲学

主题

276 篇 computer science
134 篇 computational mo...
128 篇 machine learning
118 篇 deep learning
89 篇 visualization
86 篇 application soft...
80 篇 semantics
78 篇 feature extracti...
76 篇 artificial intel...
75 篇 hardware
75 篇 accuracy
74 篇 high performance...
72 篇 training
71 篇 computer archite...
67 篇 distributed comp...
66 篇 data mining
62 篇 costs
56 篇 algorithm design...
56 篇 computer network...
55 篇 image segmentati...

机构

57 篇 center on fronti...
45 篇 infn sezione di ...
45 篇 north-west unive...
45 篇 institut univers...
43 篇 national centre ...
43 篇 tno technical sc...
43 篇 université de st...
42 篇 department of co...
40 篇 department of ph...
40 篇 faculty of scien...
40 篇 departamento de ...
40 篇 department for p...
40 篇 department of ph...
40 篇 yerevan physics ...
39 篇 dipartimento di ...
39 篇 kirchhoff-instit...
39 篇 nikhef national ...
39 篇 university of jo...
38 篇 department of ph...
38 篇 department of ph...

作者

45 篇 chen a.
45 篇 benoit d.m.
45 篇 ferrara g.
45 篇 ardid m.
45 篇 calvo d.
45 篇 eddymaoui a.
43 篇 gagliardini s.
43 篇 gal t.
43 篇 bozza c.
43 篇 díaz a.f.
42 篇 boumaaza j.
41 篇 kulikovskiy v.
41 篇 coleiro a.
41 篇 benhassi m.
40 篇 gozzini s.r.
40 篇 dallier r.
40 篇 boettcher m.
40 篇 enzenhöfer a.
40 篇 celli s.
40 篇 carretero v.

语言

5,539 篇 英文
864 篇 其他
30 篇 中文
2 篇 日文
1 篇 德文
1 篇 斯洛文尼亚文

检索条件"机构=Center For Visual Computing and Department of Computer Science"

共 6432 条记录，以下是4791-4800 订阅

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

详细简洁

排序：

A White-Box Empirical Study of P2P-VoD Systems: Several Unconventional New Findings

A White-Box Empirical Study of P2P-VoD Systems: Several Unco...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Tieying Zhang Zhenhua Li Huawei Shen Yan Huang Xueqi Cheng Institute of Computing Technology Chinese Academy and Sciences China Department of Computer Science and Technology Peking University China Tencent Research Center China

P2P-VoD systems have gained tremendous popularity in recent years. While existing research is mostly based on theoretical or conventional assumptions, it is particularly valuable to understand and examine how these assumptions work in realistic environments, so as to set up a solid foundation for mechanism design and optimization possibilities. In this paper, we present a comprehensive measurement study of CoolFish, a real-world P2P-VoD system. Our measurement provides several new findings which are different from the traditional assumptions or observations: the access pattern does not match Poisson distribution; session time does not have positive correlation with movie popularity; jump frequency does not have a negative correlation with movie popularity as assumed in previous studies. We analyze the reasons for these results and provide suggestions for the further study of P2P-VoD services.

关键词： Motion pictures Servers Stress Correlation Time measurement Exponential distribution Frequency measurement

来源：评论

学校读者我要写书评

暂无评论

BLSTM Neural Network Based Word Retrieval for Hindi Documents

BLSTM Neural Network Based Word Retrieval for Hindi Document...

引用

International Conference on Document Analysis and Recognition

作者： Raman Jain Volkmar Frinken C.V. Jawahar R. Manmatha International Institute of Information Technology Hyderabad Center for Visual Information Technology Hyderabad India Institute of Computer Science and Applied Mathematics University of Bern Bern Switzerland Department of Computer Science University of Massachusetts Amherst MA USA

Retrieval from Hindi document image collections is a challenging task. This is partly due to the complexity of the script, which has more than 800 unique ligatures. In addition, segmentation and recognition of individual characters often becomes difficult due to the writing style as well as degradations in the print. For these reasons, robust OCRs are non existent for Hindi. Therefore, Hindi document repositories are not amenable to indexing and retrieval. In this paper, we propose a scheme for retrieving relevant Hindi documents in response to a query word. This approach uses BLSTM neural networks. Designed to take contextual information into account, these networks can handle word images that can not be robustly segmented into individual characters. By zoning the Hindi words, we simplify the problem and obtain high retrieval rates. Our simplification suits the retrieval problem, while it does not apply to recognition. Our scalable retrieval scheme avoids explicit recognition of characters. An experimental evaluation on a dataset of word images gathered from two complete books demonstrates good accuracy even in the presence of printing variations and degradations. The performance is compared with baseline methods.

关键词： Vectors Training Optical character recognition software Robustness Neural networks Character recognition Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Design and Evaluation of Network Topology-/Speed- Aware Broadcast Algorithms for InfiniBand Clusters

Design and Evaluation of Network Topology-/Speed- Aware Broa...

引用

IEEE International Conference on Cluster computing

作者： H. Subramoni K. Kandalla J. Vienne S. Sur B. Barth K. Tomko R. Mclay K. Schulz D.K. Panda Department of Computer Science and Engineering Ohio State University USA Texas Advanced Computing Center University of Texas at Austin USA Ohio Supercomputing Center Columbus OH USA

It is an established fact that the network topology can have an impact on the performance of scientific parallel applications. However, little work has been done to design an easy to use solution inside a communication library supporting a parallel programming model where the complexities of making the application performance network topology agnostic is hidden from the end user. Similarly, the rapid improvements in networking technology and speed are resulting in many commodity clusters becoming heterogeneous, with respect to networking speed. For example, switches and adapters belonging to different generations (SDR - 8 Gbps, DDR - 16 Gbps and QDR - 36 Gbps speeds in InfiniBand) are integrated into a single system. This leads to an additional challenge to make the communication library aware of the performance implications of heterogeneous link speeds. Accordingly, the communication library can perform optimizations taking link speed into account. In this paper, we propose a framework to automatically detect the topology and speed of an InfiniBand network and make it available to users through an easy to use interface. We also make design changes inside the MPI library to dynamically query this topology detection service and to form a topology model of the underlying network. We have redesigned the broadcast algorithm to take into account this network topology information and dynamically adapt the communication pattern to best fit the characteristics of the underlying network. To the best of our knowledge, this is the first such work for InfiniBand clusters. Our experimental results show that, for large homogeneous systems and large message sizes, we get up to 14% improvement in the latency of the broadcast operation using our proposed network topology-aware scheme over the default scheme at the micro-benchmark level. At the application level, the proposed framework delivers up to 8% improvement in total application run-time especially as job size scales up. The p

关键词： Network topology Topology Clustering algorithms Delay Libraries Algorithm design and analysis computer architecture

来源：评论

学校读者我要写书评

暂无评论

Smoothness in noise reduction of chaotic time series

Smoothness in noise reduction of chaotic time series

引用

2011 International Conference on computers, Communications, Control and Automation

作者： Chenxi Shao Jiangong Ji Jingyuan Shao Lipeng Xiao Department of Computer Science and Technology University of Science and Technology of China Department of Modern Physics and Nonlinear Science Center University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Information center Jianghuai Automobile Co.Ltd.

Noise is an omnipresent phenomenon. It obscures the real behavior of dynamical system. Lots of methods are proposed to remove the noise contaminating time series. However, almost all the methods consider the noise reduction in the phase space and often sharp points are kept. Different with these methods, this paper proposes a method directly on the time series itself, considering the gauss noise feature and the smoothness of the real data, uses curve-fitting way to eliminate the sharp points. The numeral results verify the effectiveness of our method.

关键词： smoothness,noise reduction,curve-fitting,Local-Geometric-Projection

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Simple Causal Message Logging for Large-Scale Fault Tolerant HPC Systems

Evaluation of Simple Causal Message Logging for Large-Scale ...

引用

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

作者： Esteban Meneses Greg Bronevetsky Laxmikant V. Kale Department of Computer Science University of Illinois Urbana IL USA Center of Applied Scientific Computing Lawrence Livemore National Laboratory Livermore CA USA

The era of petascale computing brought machines with hundreds of thousands of processors. The next generation of exascale supercomputers will make available clusters with millions of processors. In those machines, mean time between failures will range from a few minutes to few tens of minutes, making the crash of a processor the common case, instead of a rarity. Parallel applications running on those large machines will need to simultaneously survive crashes and maintain high productivity. To achieve that, fault tolerance techniques will have to go beyond checkpoint/restart, which requires all processors to roll back in case of a failure. Incorporating some form of message logging will provide a framework where only a subset of processors are rolled back after a crash. In this paper, we discuss why a simple causal message logging protocol seems a promising alternative to provide fault tolerance in large supercomputers. As opposed to pessimistic message logging, it has low latency overhead, especially in collective communication operations. Besides, it saves messages when more than one thread is running per processor. Finally, we demonstrate that a simple causal message logging protocol has a faster recovery and a low performance penalty when compared to checkpoint/restart. Running NAS Parallel Benchmarks (CG, MG, BT and DT) on 1024 processors, simple causal message logging has a latency overhead below 5%.

关键词： Program processors Protocols computer crashes Fault tolerance Fault tolerant systems Supercomputers Receivers

来源：评论

学校读者我要写书评

暂无评论

The power efficiency of GPUs in multi nodes environment with molecular dynamics

The power efficiency of GPUs in multi nodes environment with...

引用

2011 International Conference on Parallel Processing Workshops, ICPPW 2011

作者： Udagawa, Takuro Sekijima, Masakazu Department of Computer Science Tokyo Institute of Technology 2-12-1-I7-5 Ookayama Meguro-ku Tokyo Japan Global Scientific Information and Computing Center Tokyo Institute of Technology 2-12-1-I7-5 Ookayama Meguro-ku Tokyo Japan

ISBN: (纸本)9780769545110

Energy efficient systems are highly demanded as the power consumption in HPC region increase. The use of GPUs has attracted attention as a possible solution to these problems because of their parallel performance and power efficiency. However, it is uncertain how much improvement can be obtained by applying GPUs to applications. In this study, we developed a molecular dynamics simulation program for CPU parallel and GPU parallel, and executed it on our computer cluster. Then we compared the performance of CPUs and GPUs. We obtained the result that the GPUs were about 10 times faster and 5 times more power efficient than the CPUs. © 2011 IEEE.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

computing parametric alignment of RNA structures:visualization and practice

Computing parametric alignment of RNA structures:visualizati...

引用

2011 International Conference on Future computer sciences and Application（ICFCSA 2011）

作者： Wangsen Feng Bei Zhang Lusheng Wang Key Laboratory of Network and Software Security Assurance of Ministry of Education Computing Center Beijing University Department of Computer Science City University of Hong Kong

Alignment of RNA structures is very important in biological *** to pair-wise sequence alignment,there is often disagreement about how to weight matches,mismatches,indels and gaps when comparing two RNA ***,we develop a visual tool for computing parametric alignment of two RNA *** this tool,users can see explicitly and completely the effect of parameter choices on the optimal alignments of RNA *** software is available for academic use（ http://***/wang/software/Para RNA/）.

关键词： parametric alignment,RNA structures

来源：评论

学校读者我要写书评

暂无评论

Energy Aware Dynamic Resource Consolidation Algorithm for Virtualized Service centers Based on Reinforcement Learning

Energy Aware Dynamic Resource Consolidation Algorithm for Vi...

引用

International Symposium on Parallel and Distributed computing

作者： Tudor Cioara Ionut Anghel Ioan Salomie Georgiana Copil Daniel Moldovan Alexander Kipp Computer Science Department Technical University of Cluj-Napoca Cluj-Napoca Romania High Performance Computing Center (HLRS University of Stuttgart Stuttgart Germany

In this paper we propose an energy aware dynamic consolidation algorithm for virtualized service centers based on reinforcement learning. The energy awareness is enacted by using the Energy Aware Context Model (EACM) to programmatically represent the current service center context situation by means of ontologies. We have defined the EACM model entropy metric for evaluating the service center greenness level. If the entropy value is above a predefined threshold, the service center is not in a green state. As a consequence, consolidation or dynamic power management actions are selected by means of reinforcement learning and executed to bring back the service center in an energy efficient state. The results are promising showing that the proposed energy aware consolidation algorithm decreases the energy consumption with about 26% from the total energy consumption of a service center.

关键词： Servers Context Heuristic algorithms Learning Entropy Energy efficiency Context modeling

来源：评论

学校读者我要写书评

暂无评论

A comparative study among different kernel functions in flexible naïve Bayesian classification

A comparative study among different kernel functions in flex...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： James N. K. Liu Yu-Lin He Xi-Zhao Wang Yan-Xing Hu Department of computing Hong Kong Polytechnic University Hong Kong China Machine Learning Center Faculty of Mathematics and Computer Science Hebei University Baoding China

When determining the class of the unknown example by using naïve Bayesian classifier, we need to estimate the class conditional probabilities for the continuous attributes. In flexible Bayesian classifier, the Gaussian kernel function is frequently used for classification task under the framework of Parzen window method. In this paper, the other six kernel functions (uniform, triangular, epanechnikov, biweight, triweight and cosine) are introduced in the flexible naïve Bayesian. The performances of these seven kernels are compared in 30 UCI datasets. The experimental comparisons are carried out according to the following three aspects: the classification accuracy, ranking performance and the class probability estimation. The latter two are measured by the area under the ROC curve (AUC) and the conditional log likelihood (CLL). The related kernels are compared via two-tailed t-test with a 95 percent confidence level and the Friedman's test using the 0.05 critical level. The experimental results show that the most commonly used Gaussian kernel can not achieve the best classification accuracy and AUC. However, on the CLL, the Gaussian kernel is statistically significantly better than the other six kernels. Finally, the corresponding analyses are given based on the experimental results.

关键词： Kernel Accuracy Bayesian methods Breast cancer Machine learning Estimation Heart

来源：评论

学校读者我要写书评

暂无评论

Towards Optimal Resource Provisioning for Running MapReduce Programs in Public Clouds

Towards Optimal Resource Provisioning for Running MapReduce ...

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Fengguang Tian Keke Chen Ohio Center of Excellence in Knowledge-enabled Computing (Kno.e.sis) Department of Computer Science and Engineering Wright State University Dayton OH USA

Running MapReduce programs in the public cloud introduces the important problem: how to optimize resource provisioning to minimize the financial charge for a specific job? In this paper, we study the whole process of MapReduce processing and build up a cost function that explicitly models the relationship between the amount of input data, the available system resources (Map and Reduce slots), and the complexity of the Reduce function for the target MapReduce job. The model parameters can be learned from test runs with a small number of nodes. Based on this cost model, we can solve a number of decision problems, such as the optimal amount of resources that can minimize the financial cost with a time deadline or minimize the time under certain financial budget. Experimental results show that this cost model performs well on tested MapReduce programs.

关键词： Complexity theory Cloud computing Optimization Data models Analytical models Mathematical model Programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 476 477 478 479 480 481 482 483 484 485 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：