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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,918 篇 会议
230 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

11,324 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

6,681 篇 工学
- 6,110 篇 计算机科学与技术...
- 2,915 篇 软件工程
- 1,181 篇 电气工程
- 1,069 篇 信息与通信工程
- 482 篇 电子科学与技术（可...
- 358 篇 控制科学与工程
- 176 篇 仪器科学与技术
- 152 篇 机械工程
- 117 篇 动力工程及工程热...
- 113 篇 生物医学工程（可授...
- 101 篇 生物工程
- 87 篇 光学工程
- 87 篇 建筑学
- 69 篇 土木工程
- 68 篇 网络空间安全
- 65 篇 化学工程与技术
- 63 篇 材料科学与工程（可...
- 58 篇 安全科学与工程
1,468 篇 理学
- 976 篇 数学
- 311 篇 物理学
- 156 篇 系统科学
- 140 篇 统计学（可授理学、...
- 136 篇 生物学
- 83 篇 化学
898 篇 管理学
- 648 篇 管理科学与工程(可...
- 307 篇 图书情报与档案管...
- 290 篇 工商管理
145 篇 医学
- 120 篇 临床医学
- 62 篇 基础医学(可授医学...
62 篇 经济学
- 62 篇 应用经济学
56 篇 法学
34 篇 农学
26 篇 教育学
18 篇 文学
11 篇 军事学

主题

1,464 篇 parallel process...
584 篇 computer archite...
555 篇 distributed comp...
534 篇 application soft...
531 篇 computational mo...
528 篇 concurrent compu...
342 篇 hardware
319 篇 graphics process...
309 篇 scalability
308 篇 parallel program...
306 篇 graphics process...
304 篇 computer science
285 篇 runtime
263 篇 big data
262 篇 optimization
250 篇 parallel process...
226 篇 throughput
225 篇 processor schedu...
214 篇 resource managem...
209 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
17 篇 school of comput...
17 篇 institute of com...
16 篇 school of comput...
15 篇 college of compu...
15 篇 georgia inst tec...
15 篇 barcelona superc...
15 篇 intel corporatio...
14 篇 school of comput...
14 篇 chinese acad sci...
14 篇 department of co...
13 篇 tsinghua univ de...
13 篇 ibm thomas j. wa...
13 篇 cent s univ sch ...
13 篇 college of compu...
13 篇 ohio state univ ...

作者

21 篇 jack dongarra
16 篇 badia rosa m.
16 篇 liu jie
15 篇 wang guojun
15 篇 yijie wang
15 篇 a. choudhary
14 篇 anon
14 篇 kurt rothermel
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
12 篇 fahringer thomas
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fernandes luiz g...
11 篇 guangwen yang

语言

11,155 篇 英文
135 篇 其他
36 篇 中文
2 篇 俄文
2 篇 土耳其文
1 篇 德文

检索条件"任意字段=International Conference on Parallel and Distributed Processing Techniques and Applications"

共 11324 条记录，以下是4101-4110 订阅

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

详细简洁

排序：

Labelwalking nonnegative matrix factorization 40

Labelwalking nonnegative matrix factorization

引用

40th IEEE international conference on Acoustics, Speech, and Signal processing, ICASSP 2015

作者： Lan, Long Guan, Naiyang Zhang, Xiang Huang, Xuhui Luo, Zhigang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781467369978

Semi-supervised learning (SSL) utilizes plenty of unlabeled examples to boost the performance of learning from limited labeled examples. Due to its great discriminant power, SSL has been widely applied to various real-world tasks such as information retrieval, pattern recognition, and speech separa- tion. Label propagation (LP) is a popular SSL method which propagates labels through the dataset along high density areas defined by unlabeled examples, LP assumes nearby examples should share the same label, thus, it unavoidably pushes the labels to the wrong examples, especially when different la- beled examples are not strictly separated. Seed K-means uses labeled examples to initialize class centers, and avoid getting stuck in poor local optima comparing to traditional K-means, however the hard constraint of each example's membership makes Seed K-means failed in many real world applications. This paper proposes a novel label walking nonnegative matrix factorization method (LWNMF) to handle labeled examples in SSL based on the framework of NMF. LWNMF decomposes the whole dataset into the product of a basis matrix and a coefficient matrix, and to travel labels to unlabeled examples, LWNMF regards the class indicators of labeled examples as their coefficients and iteratively updates both basis matrix and coefficients of unlabeled examples. Since LWNMF learns comprehensive class centroids, labels iteratively walk to unlabeled examples through these significant centroids. © 2015 IEEE.

关键词： K-means Label propagation Nonnegative matrix factorization Semisupervised learning

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2015 30th IEEE/ACM international conference on Automated Software Engineering Workshops, ASEW 2015

Proceedings - 2015 30th IEEE/ACM International Conference on...

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops, ASEW 2015

ISBN: (纸本)9781467397759

The proceedings contain 22 papers. The topics discussed include: extending manual GUI testing beyond defects by building mental models of software behavior;software development analytics: experiences and the way forward;a conceptual framework for the comparison of fully automated GUI testing techniques;testing approach for mobile applications through reverse engineering of UI patterns;data mining methods and cost estimation models;empirical analysis on parallel tasks in crowdsourcing software development;analytics for software project management - where are we and where do we go?;a method to evaluate estimates produced by the capture-recapture model;using collective intelligence to support multi-objective decisions: collaborative and online preferences;RepMine: a system for transferrable analyses of collaboration activities in software engineering;an automated contextual collaboration approach for distributed agile delivery;and comparing model coverage and code coverage in model driven testing: an exploratory study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Solutions for processing K Nearest Neighbor Joins for Massive Data on MapReduce

Solutions for Processing K Nearest Neighbor Joins for Massiv...

引用

Euromicro conference on parallel, distributed and Network-Based processing

作者： Ge Song Justine Rochas Fabrice Huet Frédéric Magoulès † Ecole Centrale de Paris France * Univ. Nice Sophia Antipolis CNRS 13S UMR Sophia Antipolis France

Given a point p and a set of points S, the kNN operation finds the k closest points to p in S. It is a computational intensive task with a large range of applications such as knowledge discovery or data mining. However, as the volume and the dimension of data increase, only distributed approaches can perform such costly operation in a reasonable time. Recent works have focused on implementing efficient solutions using the MapReduce programming model because it is suitable for large scale data processing. Also, it can easily be executed in a distributed environment. Although these works provide different solutions to the same problem, each one has particular constraints and properties. There is no readily available comparison to help users choose the one most appropriate for their needs. This is the problem we address in this work. Firstly, we show that all kNN implementations go through a common workflow, which we use as a basis for classification. Secondly, we describe precisely the different techniques published so far. And lastly, we provide a set of objective criteria that can be used to make informed decisions.

关键词： Complexity theory Computational modeling Sorting Silicon Programming Data models Accuracy

来源：评论

学校读者我要写书评

暂无评论

parallel computing with Particle and Heavy Ion transport code system (PHITS)

Parallel computing with Particle and Heavy Ion transport cod...

引用

Mathematics and Computations, Supercomputing in Nuclear applications and Monte Carlo international conference, M and C+SNA+MC 2015

作者： Furuta, T. Sato, T. Ogawa, T. Niita, K. Ishikawa, K.L. Noda, S. Takagi, S. Maeyama, T. Fukunishi, N. Fukasaku, K. Himeno, R. Japan Atomic Energy Agency 2-4 Shirakata-Shirane Tokai Ibaraki319-1195 Japan Research Organization for Information Science and Technology 2-4 Shirakata-Shirane Tokai Ibaraki319-1106 Japan University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo113-8656 Japan RIKEN 2-1 Hirosawa Wako Saitama351-0198 Japan

ISBN: (纸本)9781510808041

Particle and Heavy Ion code System, PHITS, is a general-purpose Monte Carlo code, which has been used by many users in various fields of research and development. Two parallel computing functions are available in PHITS to reduce its computation time. One is the distributed-memory parallelization using protocols of message passing interface (MPI) and the other is the shared-memory parallelization using open multi-processing (OpenMP) directives. Each function has advantages and disadvantages, and the performances depend on simulation details such as geometry, materials, choices of the physics models, and so on. By adopting both MPI and OpenMP parallelization functions in PHITS, the parallel computing can be flexibly adjusted to suit users' needs. On supercomputer systems, the so-called hybrid parallelization using both functions can be also performed with the inter-node MPI parallelization and the intra-node OpenMP parallelization. The explanation is given for both MPI and OpenMP parallelization functions and the performance of PHITS was tested with some applications using a typical workstation computer. The performance of the hybrid parallelization of PHITS on a supercomputer was also tested using K computer at RIKEN. The good parallelization efficiency for strong scaling (96.2 %) was confirmed up to 2,048 nodes (X8 intra-node cores).

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Accelerating Support Vector Machine Learning with GPU-Based MapReduce

Accelerating Support Vector Machine Learning with GPU-Based ...

引用

IEEE international conference on Systems, Man and Cybernetics

作者： Tianyao Sun Hanli Wang Yun Shen Jun Wu Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9781479986989

With the exploding growth of data, the computational complexity required by learning Support Vector Machine (SVM) lays a heavy burden on real-world applications. To address this issue, parallel computational techniques can be employed such as the Graphics processing Units (GPUs) and MapReduce model. As it is well known, GPUs are microprocessors on a multi-core architecture which reveal high performance in mass data parallel computing, and MapReduce allows computational tasks to be divided into a plurality of parts, distributed to various computing nodes and combined on a single node. In this paper, we propose a GPU-based MapReduce framework to accelerate SVM learning by jointly utilizing the parallel computing power of GPU and MapReduce. Extensive experimental results have verified the effectiveness and efficiency of the proposed approach.

关键词： Graphics processing units Support vector machines Kernel Training Optimization Acceleration parallel processing

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation of Fuzzified Pattern Matching Algorithm on GPU

Parallel Implementation of Fuzzified Pattern Matching Algori...

引用

Euromicro conference on parallel, distributed and Network-Based processing

作者： Shima Soroushnia Masoud Daneshtalab Tapio Pahikkala Juha Plosila Department of Information Technology University of Turku Turku Finland

Approximate pattern discovery is one of the fundamental and challenging problems in computer science. Fast and high performance algorithms are highly demanded in many applications in bioinformatics and computational molecular biology, which are the domains that are mostly and directly benefit from any enhancement of pattern matching theoretical knowledge and solutions. This paper proposed an efficient GPU implementation of fuzzified Aho-Corasick algorithm using Levenshtein method and N-gram technique as a solution for approximate pattern matching problem.

关键词： Graphics processing units Pattern matching Approximation algorithms Algorithm design and analysis Databases Instruction sets Automata

来源：评论

学校读者我要写书评

暂无评论

14th international Symposium on Intelligent Data Analysis, IDA 2015

14th International Symposium on Intelligent Data Analysis, I...

引用

14th international Symposium on Intelligent Data Analysis, IDA 2015

ISBN: (纸本)9783319244648

The proceedings contain 29 papers. The special focus in this conference is on Intelligent Data Analysis. The topics include: Data analytics and optimisation for assessing a ride sharing system;constraint-based querying for bayesian network exploration;efficient model selection for regularized classification by exploiting unlabeled data;segregation discovery in a social network of companies;a first-order-logic based model for grounded language learning;a parallel distributed processing algorithm for image feature extraction;a probabilistic graphical model based approach;diversity-driven widening of hierarchical agglomerative clustering;batch steepest-descent-mildest-ascent for interactive maximum margin clustering;time series classification with representation ensembles;simultaneous clustering and model selection for multinomial distribution;on binary reduction of large-scale multiclass classification problems;probabilistic active learning in datastreams;implicitly constrained semi-supervised least squares classification;diagonal co-clustering algorithm for document-word partitioning;an attributed graph clustering method;class-based outlier detection;using metalearning for prediction of taxi trip duration using different granularity levels;using entropy as a measure of acceptance for multi-label classification;investigation of node deletion techniques for clustering applications of growing self organizing maps;exploratory topic modeling with distributional semantics;assigning geo-relevance of sentiments mined from location-based social media posts and continuous and discrete deep classifiers for data integration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

27th international conference on Computer Aided Verification, CAV 2015

27th International Conference on Computer Aided Verification...

引用

27th international conference on Computer Aided Verification, CAV 2015

ISBN: (纸本)9783319216676

The proceedings contain 31 papers. The special focus in this conference is on SMT techniques, applications and HW Verification. The topics include: SMT aided linearizability proofs;finding bounded path in graph using SMT for automatic clock routing;cutting the mix;the inez mathematical programming modulo theories framework;using minimal correction sets to more efficiently compute minimal unsatisfiable sets;deciding local theory extensions via E-matching;modular deductive verification of multiprocessor hardware designs;word-level symbolic trajectory evaluation;synthesis through unification;from non-preemptive to preemptive scheduling using synchronization synthesis;counterexample-guided quantifier instantiation for synthesis in SMT;deductive program repair;quantifying conformance using the skorokhod metric;pareto curves of multidimensional mean-payoff games;conflict-driven conditional termination;predicate abstraction and CEGAR for disproving termination of higher-order functional programs;complexity of bradley-manna-sipma lexicographic ranking functions;measuring with timed patterns;automatic verification of stability and safety for delay differential equations;time robustness in MTL and expressivity in hybrid system falsification;adaptive concretization for parallel program synthesis;automatic completion of distributed protocols with symmetry;an axiomatic specification for sequential memory models;an abstraction for distributed almost-synchronous systems and automated and modular refinement reasoning for concurrent programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of repair cost in distributed storage systems with Fault-Tolerant coding strategies 15th

Analysis of repair cost in distributed storage systems with ...

引用

15th international conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： Lu, Yanbo Hao, Jie Liu, Xin-Ji Xia, Shu-Tao Graduate School at Shenzhen Tsinghua University Shenzhen518055 China Tsinghua National Laboratory for Information Science and Technology Beijing100084 China

ISBN: (纸本)9783319271392

To achieve reliability in distributed storage systems, fault tolerance techniques like replication strategy are adopted. As the rapid growth of data, distributed storage systems have been transitioning replication strategy to coding strategies like Reed Solomon codes to achieve higher storage efficiency. But the repair cost of Reed Solomon codes in terms of network bandwidth is high. For repair efficiency, a new class of codes called Regenerating Codes are proposed and become more popular. However, how to quantify and evaluate the repair cost of these coding strategies at the system level remains unexplored. In this paper, we propose a metric of the repair cost at the level of whole systems, and then compare the two main classes of codes Reed Solomon codes and Regenerating codes. Our goal is to provide system designers with evaluation methods of the system level repair cost. Thus, system designers can choose optimal coding strategies according to their certain systems. © Springer international Publishing Switzerland 2015.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

Concurrency Analysis and Implementation of SAR Imaging Algorithm Oriented to Hybrid Storage System

Concurrency Analysis and Implementation of SAR Imaging Algor...

引用

international conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC

作者： Jing Du Fujiang Ao Sai Sui Huabing Wang State Key Laboratory of High Performance Computing Changsha China State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics & Information System Luoyang China

ISBN: (纸本)9781467392013

Recently, the real-time synthetic aperture radar (SAR) imaging technique is a hotspot of research in the field of remote sensing and military applications. As the SAR imaging algorithm is associated with high data and computation intensive, it is suitable for using hybrid storage systems, e.g. A cluster, for the performance acceleration. To design a SAR algorithm with high performance, we need consider a prerequisite to maximize the parallelizability of the algorithm due to multi-level parallelization features of the cluster platform. Focusing on the large-scale data, we explore concurrency characteristics of the SAR imaging algorithm on a hybrid storage system, and propose some parallel optimization techniques to accelerate the SAR imaging algorithm. According to the study, we implement a parallel SAR imaging algorithm and evaluate its performance. Experiment results show that the optimized SAR imaging program has high-speed network utilization, and can realize obvious improvement on the performance.

关键词： Radar polarimetry Algorithm design and analysis Optimization Concurrent computing Imaging parallel processing Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 407 408 409 410 411 412 413 414 415 416 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：