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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

463 篇 会议
26 册 图书
17 篇 期刊文献

馆藏范围

506 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

282 篇 工学
- 267 篇 计算机科学与技术...
- 113 篇 软件工程
- 33 篇 信息与通信工程
- 30 篇 电气工程
- 16 篇 控制科学与工程
- 12 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 力学（可授工学、理...
- 5 篇 生物医学工程（可授...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 网络空间安全
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 交通运输工程
76 篇 理学
- 58 篇 数学
- 12 篇 系统科学
- 10 篇 物理学
- 8 篇 生物学
- 7 篇 统计学（可授理学、...
41 篇 管理学
- 25 篇 管理科学与工程(可...
- 17 篇 工商管理
- 16 篇 图书情报与档案管...
10 篇 医学
- 7 篇 临床医学
- 4 篇 基础医学(可授医学...
- 3 篇 公共卫生与预防医...
5 篇 经济学
- 5 篇 应用经济学
4 篇 法学
- 4 篇 社会学
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

63 篇 concurrent compu...
60 篇 distributed comp...
53 篇 parallel process...
35 篇 parallel algorit...
31 篇 computer science
31 篇 application soft...
30 篇 computer archite...
28 篇 hardware
28 篇 computer network...
22 篇 computational mo...
21 篇 message passing
20 篇 parallel process...
20 篇 high performance...
19 篇 costs
18 篇 grid computing
18 篇 workstations
18 篇 delay
17 篇 distributed comp...
16 篇 parallel program...
14 篇 bandwidth

机构

5 篇 department of co...
3 篇 syracuse univ sy...
3 篇 polytechnic univ...
3 篇 harbin institute...
3 篇 peking universit...
3 篇 department of co...
2 篇 université jean ...
2 篇 enea headquarter...
2 篇 leibniz universi...
2 篇 department of co...
2 篇 int comp sci ins...
2 篇 georgia inst tec...
2 篇 univ paderborn d...
2 篇 gte laboratories...
2 篇 ruhr university ...
2 篇 department of co...
2 篇 unicredit milan
2 篇 northwestern uni...
2 篇 mcgill universit...
2 篇 upc barcelonatec...

作者

5 篇 a. choudhary
4 篇 yongqiang sun
3 篇 priya unnikrishn...
3 篇 meyerhenke henni...
3 篇 babik marian
3 篇 kit barton
3 篇 hluchy ladislav
3 篇 sun yq
3 篇 xinda lu
3 篇 s. hariri
2 篇 davies a.j.
2 篇 ibéria medeiros
2 篇 r. fujimoto
2 篇 grover pulkit
2 篇 holger fröning
2 篇 to-yat cheung
2 篇 pascal welke
2 篇 linara adilova
2 篇 sauerwald thomas
2 篇 g. allen

语言

499 篇 英文
4 篇 中文
2 篇 其他
1 篇 西班牙文

检索条件"任意字段=Proceedings of the Advances in Parallel and Distributed Computing"

共 506 条记录，以下是121-130 订阅

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

详细简洁

排序：

PPS: parallel Pincer Search for Mining Frequent Itemsets Based on Spark 8th

PPS: Parallel Pincer Search for Mining Frequent Itemsets Bas...

引用

8th International Conference on Soft computing and Pattern Recognition (SoCPaR) / 8th International Conference on Computational Aspects of Social Networks (CASoN)

作者： Sethi, Krishan Kumar Dharavath, Ramesh Nyakotey, Samuel Indian Inst Technol ISM Dept Comp Sci & Engn Dhanbad 826004 Jharkhand India

ISBN: (纸本)9783319606187;9783319606170

Association rule mining is one of prominent techniques to discover the relation between data items of a transactional data. The process of mining has been simplified by considering only the frequent itemsets. Pincer search is one of the frequent itemset mining method which combines top-down and bottom-up search techniques to get the benefits of both. Top-down approach in Pincer search reduces the number of candidates in pass of iterations and saves a lot of computing resources. In this work, we present a parallel Pincer Search (PPS) which is based on distributed implementation on Spark framework. We have converted the search algorithm according to the Spark framework to make it run in parallel. Spark provides a lot of features for the iterative algorithm such as in-memory execution, efficient data structure, better fault tolerant method, etc. We implemented the PPS on a Spark cluster with multiple datasets and analysed the performance.

关键词： Pincer search Frequent itemset mining Apriori algorithm Maximal itemset Spark

来源：评论

学校读者我要写书评

暂无评论

Track Chair's Report of CDCGM2019-Convergence of distributed Clouds, Grids and their Management WETICE-2019 Going Beyond Church-Turing Thesis Boundaries. WETICE2019, Capri, Napoli, Italy, June 12-14, 2019 28

Track Chair's Report of CDCGM2019-Convergence of Distributed...

引用

28th IEEE International Conference on Enabling Technologies - Infrastructure for Collaborative Enterprises (WETICE)

作者： Messina, Fabrizio Mikkilineni, Rao Morana, Giovanni Univ Catania Dipartimento Matemat & Informat Vle Andrea Doria 6 I-95125 Catania Italy Golden Gate Univ Edward S Ageno Sch Business San Francisco CA USA Platina Syst Santa Clara Santa Clara CA USA

ISBN: (纸本)9781728106762

This track has made signicant contribution to advance the current state of the art in enterprise distributed application management across datacenters, and clouds public or private. A new computing model proposing extensions to the current von Neumann implementation of the Turing machine was contributed by the efforts of several participants in this conference since 2009. Keeping with this tradition, this year a new paper demonstrates theory and practice that pushes the Church-Turing thesis boundaries and demonstrates a novel low-latency and high-performance edge computing solution. In addition, there are nine full papers describing advances in current distributed and cloud computing practices dealing with quality of service, business intelligence, cloud security, Internet of Things, cloud performance and economics.

关键词： Cloud computing grid computing distributed Intelligent Managed Element Networks distributed Services Management Services Virtualization parallel computing

来源：评论

学校读者我要写书评

暂无评论

Methods for partitioning data to improve parallel execution time for sorting on heterogeneous clusters

引用

1st International Conference on Grid and Pervasive computing

作者： Cerin, Christophe Dubacq, Jean-Christophe Roch, Jean-Louis Univ Paris 13 LIPN CNRS UMR 7030 F-93430 Villetaneuse France INRIA INPG UJF ID IMAGProjet MOAIS F-38330 St Martin Dheres France

ISBN: (纸本)3540338098

The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds. Such an application requires a partitioning step. For uniformly related processors (processors speeds are related by a constant factor), we develop a constant time technique for mastering processor load and execution time in an heterogeneous environment and also a technique to deal with unknown cost functions. For non uniformly related processors, we use a technique based on dynamic programming. Most of the time, the solutions are in O(p) (p is the number of processors), independent of the problem size n. Consequently, there is a small overhead regarding the problem we deal with but it is inherently limited by the knowing of time complexity of the portion of code following the partitioning.

关键词： Complexity of parallel algorithms Data distribution Heterogeneous computing parallel in-core sorting

来源：评论

学校读者我要写书评

暂无评论

An Advanced Exchange Infomation Model Based on Formal Concept Analysis Oriented Inteligent computing 1

引用

3rd International Conference on Teaching and Computational Science (WTCS 2009)

作者： Liu Zhangang Univ Sci & Technol Liaoning Software Sch Anshan Peoples R China

ISBN: (数字)9783642254376

ISBN: (纸本)9783642254369

The concept lattice can be changed based on sub-lattice was proposed in this paper, and the new concept lattice was composed of a series of sub-lattice which was isomorphic to the original related sub-lattice, the isomorphic relation and the method to obtain the new concept lattice from the original concept lattice by the new context and the arrow relation was proposed and proved. At last, we analysis that concept lattice was adapted to be exchange information model because of a series of inner, advanced property consisted with distributed, parallel algorithm.

关键词： Concept Lattice Concept Analysis computing Model Isomorphic Concept Lattice Information Modle

来源：评论

学校读者我要写书评

暂无评论

2nd Workshop on advances in parallel and distributed Computational Models 15

2nd Workshop on Advances in Parallel and Distributed Computa...

引用

15th International parallel and distributed Processing Symposium, IPDPS 2001

作者： Ibarra, O.H. Nakano, K. Olariu, S. Department of Computer Science University of California Santa BarbaraCA93106 United States Dept. of Electrical and Computer Engineering Nagoya Institute of Technology Showa-ku Nagoya466 Japan Department of Computer Science Old Dominion University NorfolkVA23529 United States

ISBN: (纸本)0769509908

The main goal of this workshop is to provide a timely forum for the exchange and dissemination of new ideas, techniques and research in the field of the new parallel and distributed computational models. The workshop is meant to bring together researchers and practitioners interested in all aspects of parallel and distributed computing taken in an inclusive, rather than exclusive, sense. We are convinced that the workshop atmosphere will be conducive to open and mutually beneficial exchanges of ideas between the participants. © 2001 IEEE.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed particle collision simulation with decentralized control

引用

3rd International Conference on Grid and Pervasive computing

作者： Li, Ruipeng Jiang, Hai Su, Hung-Chi Zhang, Bin Jenness, Jeff Arkansas State Univ Dept Computat Sci State Univ AR 72467 USA Univ Arkansas Dept Chem & Phys Fayetteville AR 72701 USA

ISBN: (纸本)9783540680819

Scientific computing applications with highly demanding data capacity and computation power drive a computing platform migration from shared memory machines to multi-core/multiprocessor computer clusters. However, overheads in coordinating operations across computing nodes could counteract the benefit of having extra machines. Furthermore, the hidden dependency in applications slows down the simulation over non-shared memory machines. This paper proposed a framework to utilize multi-core/multiprocessor clusters for distributed simulation. Among several coordination schemes, decentralized control approach has demonstrated its effectiveness in reducing the communication overheads. A speculative execution strategy is applied to exploit parallelism thoroughly and overcome strong data dependency. Performance analysis and experiments are provided to demonstrate the performance gains.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

advances of research in Fuzzy integral for classifiers' fusion

Advances of research in Fuzzy integral for classifiers' fusi...

引用

SNPD 2007: 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing

作者： Zhizhou, Kong Zixing, Cai School of Statistics Hunan University Changsha 410079 China School of Information Science Central South University Changsha 410083 China

ISBN: (纸本)0769529097

Fuzzy Integral is compared with other two methods which are hot in studying of classifiers ' fusion. The standard model of Fuzzy Integral and its general solution are introduced. Then, the state of the art and the challenge problems in Fuzzy Integral research field are discussed. The algorithms for standard and extended Fuzzy Integral models are briefly analyzed. Finally, the open areas of theoretic and applied research in Fuzzy Integral are brought forward. © 2007 IEEE.

关键词： Fuzzy rules

来源：评论

学校读者我要写书评

暂无评论

GPR-Tree: A global parallel index structure for multiattribute declustering on cluster of workstations

GPR-Tree: A global parallel index structure for multiattribu...

引用

International Conference on advances in parallel and distributed computing

作者： Fu, XD Wang, DX Zheng, WM Sheng, MM Tsinghua Univ Beijing China

ISBN: (纸本)0818678763

R-tree is a very popular dynamic access structure cable of storing multidimensional and spatial data. Considering it's merit of the efficient global balance and dynamic reorganization. We try to use R-tree to decluster the multiattribute data in database system or file system. As Many previous multiattribute declustering mechanisms do not take into account the properties of the Cluster of Workstations (COW), we present the Global parallel R-Tree(GPR-Tree) under the architecture of COW. Firstly we inspect the issues in efficiency of R-tree and it's variants, we try to enhance the R-Tree efficiency by using heuristics information in the reconstruction of R-Tree during the node splitting and the treatment of the orphan entries of the underfilled node. Then we parallelize the improved R-Tree among the components in the system. The basic thought is to alleviate the bottleneck effect of the I/O subsystem, making use of the high speed network communication and the memory. The GPR-Tree is shared among the processing units (PU) of the system. We use a mixed LRU algorithm to schedule pages in memory to maintain the nodes visited frequently in memory. A write-update-like protocol is used to keep the coherency among multiple copies maintained in the system. This mechanism will be proved efficient to improve the salability and performance of the system.

关键词： parallel database systems cluster of workstations multiattribute data declustering data placement R-Tree

来源：评论

学校读者我要写书评

暂无评论

Perspectives of Fast Clustering Techniques 3rd

Perspectives of Fast Clustering Techniques

引用

3rd International Scientific Conference on Intelligent Information Technologies for Industry (IITI)

作者： Savvas, Ilias K. Garani, Georgia TEI Thessaly Dept Comp Sci & Engn Larisa Greece

ISBN: (纸本)9783030018214

Nowadays, when the data size grows exponentially, it becomes more and more difficult to extract useful information in reasonable time. One very important technique to exploit data is clustering and many algorithms have been proposed like k-means and its variations (k-medians, kernel k-means etc.), DBSCAN, OPTICS and others. The time complexity of all these methods is prohibitive (NP hard) in order to make decisions on time and the solution is either new faster algorithms to be invented, or increase the performance of the old well tested ones. distributed, parallel, and multi-core GPU computing or even combination of these platforms consist a very promising method to speed up clustering techniques. In this paper, parallel versions of the above mentioned algorithms were used and implemented in order to increase their performance and consequently, their perspectives in several fields like industry, political/social sciences, telecommunications businesses, and intrusion detection in big networks. The parallel versions of clustering techniques are presented here and two different cases of their applications on different fields are illustrated. The results obtained are very promising concerning their quality and performance and therefore, the perspective of using clustering techniques in industry and sciences is increased.

关键词： Clustering k-means DBSCAN parallel computing

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Codes in Bandwidth-Limited distributed Storage Systems

Hierarchical Codes in Bandwidth-Limited Distributed Storage ...

引用

2nd International Congress on Computer Applications and Computational Science (CACS 2011)

作者： Huang, Zhen Liu, Lixia Peng, Yuxing Xue, Shoufu National Laboratary of Parallel and Distributed Processing National University of Defense Technology Changsha China Air Defence Command College Changsha China

ISBN: (纸本)9783642283079;9783642283086

distributed storage systems store data on the "unreliable" network peers that can leave the system at any moment and their network bandwidth is limited. In this case, the only way to assure reliability of the data is to add redundancy using either replication or erasure codes. As a generalization of replication, erasure codes require less storage space with the same reliability as replication. Recently, a near-optimal erasure code named Hierarchical Codes, has been proposed that can significantly reduce the repair traffic by reducing the number of nodes participating in repair, which is referred to as repair degree d. To overcome the complexity of reintegration and efficiently control the reliability of Hierarchical Codes, we refine two concepts called location and relocation, then we propose an integrated maintenance scheme, which allow us to tune the code construction.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共51页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：