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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,292 篇 会议
363 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

9,689 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,569 篇 工学
- 4,179 篇 计算机科学与技术...
- 2,157 篇 软件工程
- 849 篇 电气工程
- 636 篇 信息与通信工程
- 313 篇 控制科学与工程
- 227 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,072 篇 理学
- 862 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 33 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,216 篇 distributed data...
993 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
779 篇 computer science
694 篇 databases
616 篇 computer archite...
586 篇 application soft...
553 篇 computational mo...
463 篇 parallel process...
371 篇 scalability
357 篇 distributed comp...
351 篇 distributed proc...
327 篇 hardware
325 篇 database systems
295 篇 processor schedu...
294 篇 parallel program...
294 篇 resource managem...
293 篇 costs
270 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
13 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop
9 篇 cameron kirk w.

语言

9,580 篇 英文
88 篇 其他
21 篇 中文

检索条件"任意字段=International Symposium on Databases in Parallel and Distributed Systems"

共 9689 条记录，以下是1071-1080 订阅

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

详细简洁

排序：

Instrumental Data Management and Scientific Workflow Execution: the CEA case study 33

Instrumental Data Management and Scientific Workflow Executi...

引用

33rd IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Boito, Francieli Zanon Mehaut, Jean-Francois Deutsch, Thierry Videau, Brice Desprez, Frederic Univ Grenoble Alpes CNRS INRIA Grenoble INPLIGInst Engn F-38000 Grenoble France Univ Grenoble Alpes CEA MEM Lab Simulat Atomist F-38000 Grenoble France

ISBN: (纸本)9781538655559

In this paper, we study a typical scenario in research facilities. Instrumental data is generated by lab equipment such as microscopes, collected by researchers into USB devices, and analyzed in their own computers. In this scenario, an instrumental data management framework could store data in a institutionlevel storage infrastructure and allow to execute tasks to analyze this data in some available processing nodes. This setup has the advantages of promoting reproducible research and the efficient usage of the expensive lab equipment (in addition to increasing researchers productivity). We detail the requirements for such a framework regarding the needs of our case study of the CEA, review existing solutions and recommend the choice of Galaxy. We then analyze the performance limitations of the proposed architecture, and point to the connection between centralized storage and the processing nodes as the critical point. We also conduct a performance evaluation over an experimental platform to observe the limitations encountered in practice. We finish by pointing issues that are not addressed by existing solutions, and are therefore future work perspectives for the research field.

关键词： distributed systems data management instrumental data workflow execution

来源：评论

学校读者我要写书评

暂无评论

CuSP: A Customizable Streaming Edge Partitioner for distributed Graph Analytics 33

CuSP: A Customizable Streaming Edge Partitioner for Distribu...

引用

33rd IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Hoang, Loc Dathathri, Roshan Gill, Gurbinder Pingali, Keshav Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9781728112466

Graph analytics systems must analyze graphs with billions of vertices and edges which require several terabytes of storage. distributed-memory clusters are often used for analyzing such large graphs since the main memory of a single machine is usually restricted to a few hundreds of gigabytes. This requires partitioning the graph among the machines in the cluster. Existing graph analytics systems usually come with a built-in partitioner that incorporates a particular partitioning policy, but the best partitioning policy is dependent on the algorithm, input graph, and platform. Therefore, built-in partitioners are not sufficiently flexible. Stand-alone graph partitioners are available, but they too implement only a small number of partitioning policies. This paper presents CuSP, a fast streaming edge partitioning framework which permits users to specify the desired partitioning policy at a high level of abstraction and generates high-quality graph partitions fast. For example, it can partition wdc12, the largest publicly available web-crawl graph, with 4 billion vertices and 129 billion edges, in under 2 minutes for clusters with 128 machines. Our experiments show that it can produce quality partitions 6x faster on average than the state-of-the-art stand-alone partitioner in the literature while supporting a wider range of partitioning policies.

关键词： Graph analytics graph partitioning streaming partitioners distributed-memory computing

来源：评论

学校读者我要写书评

暂无评论

Strongly Minimal MapReduce Algorithms: A TeraSort Case Study 1

引用

11th international symposium on Foundations of Information and Knowledge systems (FoIKS)

作者： Xia, Daniel Simpson, Michael Srinivasan, Venkatesh Thomo, Alex Univ Victoria Victoria BC Canada

ISBN: (数字)9783030399511

ISBN: (纸本)9783030399511;9783030399504

MapReduce is a widely used parallel computing paradigm for the big data realm on the scale of terabytes and higher. The introduction of minimal MapReduce algorithms promised efficiency in load balancing among participating machines by ensuring that partition skew (where some machines end up processing a significantly larger fraction of the input than other machines) is prevented. Despite minimal MapReduce algorithms guarantee of load-balancing within constant multiplicative factors, the constants are relatively large which severely diminishes the theoretical appeal for true efficiency at scale. We introduce the notion of strongly minimal MapReduce algorithms that provide strong guarantees of parallelization up to a small additive factor that diminishes with an increasing number of machines. We show that a strongly minimal MapReduce algorithm exists for sorting;this leads to strongly minimal algorithms for several fundamental database algorithms and operations that crucially rely on sorting as a primitive. Our techniques are general and apply beyond the analysis of strongly minimal MapReduce algorithms;we show that given a sufficiently high, but still realistic, sampling rate, the approximate partitions obtained from a particular sampling strategy are almost as good as the partitions produced by an ideal partitioning.

关键词： distributed sorting Minimal MapReduce algorithms Sample-Partition problem

来源：评论

学校读者我要写书评

暂无评论

Byzantine-Tolerant distributed Coordinate Descent

Byzantine-Tolerant Distributed Coordinate Descent

引用

IEEE international symposium on Information Theory (ISIT)

作者： Data, Deepesh Diggavi, Suhas Univ Calif Los Angeles Los Angeles CA 90032 USA

ISBN: (纸本)9781538692912

We study distributed coordinate descent (CD) in the master-worker architecture under adversarial attacks, where the data is partitioned (across the parameter space) and distributed among m worker nodes (t of which can be maliciously corrupt), which update some coordinates of their part of the parameter vector, in parallel and iteratively, using CD updates, with the help of the master. We propose a method based on data encoding and real error correction to combat the adversary. Our method can tolerate up to [m-1/2] corrupt nodes, which is information-theoretically optimal. Our design gives a trade-off between the resiliency t, the required redundancy, and the computation at master and worker nodes. For example, with constant overhead in the storage and computational complexity over that required by the plain distributed CD, we can tolerate up to m/3 corrupt nodes. We design a sparse encoding scheme, which yields low encoding complexity.

关键词： Encoding Xenon distributed databases Redundancy Computational modeling Error correction Optimization

来源：评论

学校读者我要写书评

暂无评论

A Survey on Crawlers used in developing Search Engine

A Survey on Crawlers used in developing Search Engine

引用

international Conference on ent Computing and Control systems (ICICCS)

作者： Smita Deshmukh Kantilal Vishwakarma Mumbai University Terna Engineering College Navi Mumbai India

A vast collection of information, which is developed over a period, using HTML (Hyper Text Markup Language) formatted documents that are interlinked to each other is called as World Wide Web (WWW). With the increasing size of World Wide Web (WWW), obtaining meaningful information from the web is becoming a tedious task. Search Engine is developed for extracting information from the web. It works as an interface between the web and the user. The three important components of a search engine are: Crawler, Indexer and Page Ranking. The ambiguity of data along with its vast availability on the web is increasing at a greater pace due to the tremendous increase in data on the World Wide Web (WWW). For a naïve user this implies a challenge while surfing on the web for retrieving relevant and required information based on the search. Crawler is a component of search engine responsible for traversing webpages and fetching relevant links from the web. This represents huge dependency of any search engine on the crawlers. So, a detailed study about all the available crawlers for understanding the drawbacks and the insights about the working methodology undertaken is necessary before proceeding to develop a smart crawler. For developing a smart crawler which is future scope, a comparative analysis of widely used crawlers like Focused Crawler, Inference-based Crawler, Incremental Crawler, parallel Crawler and distributed Crawler is done.

关键词： databases Crawlers Search engines World Wide Web Control systems HTML Performance analysis

来源：评论

学校读者我要写书评

暂无评论

LADD: A Length-Adaptive Approach to Detecting Taxi Anomalous Detours 25

LADD: A Length-Adaptive Approach to Detecting Taxi Anomalous...

引用

25th IEEE international Conference on parallel and distributed systems (IEEE ICPADS)

作者： Lu, Xuansheng Cheng, Weiyu Shen, Yanyan Zhu, Yanmin Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China

ISBN: (纸本)9781728125831

This paper focuses on the practical problem of detecting taxi anomalous detours. In this paper, we propose a length-adaptive detection approach called LADD to detect if a taxi conducted an anomalous detour by investigating the taxi journey's trajectory. We employ a similarity-based detection strategy, which takes trajectory length into consideration. Our approach can deal with both long and short trajectories by applying weighted similarity on trajectories and using trajectory concatenation or clipping. For quantitative performance comparison, we propose a performance metric, and compare our approach with the state-of-the-art methods on a real-world dataset. The results verify the superior performance of LADD on taxi detour detection.

关键词： Big data processing spatial databases detour detecting GPS trajectories intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

Operational Equivalence of distributed Hypothesis Testing and Identification systems

Operational Equivalence of Distributed Hypothesis Testing an...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Minh Thanh Vu Oechtering, Tobias J. Skoglund, Mikael KTH Royal Inst Technol Div Informat Sci & Engn Stockholm Sweden

ISBN: (纸本)9781538692912

In this paper we revisit the connections of the distributed hypothesis testing against independence (HT) problem with the Wyner-Ahlswede-Korner (WAK) problem and the identification systems (ID). We show that the strong converse for the WAK problem is equivalent to the strong converse for the HT problem via constructive and nonconstructive transformations of codes. As another consequence of the transformation we provide a new exponentially strong converse equivalence statement. Applying the same idea, we prove a new result that the epsilon-identification capacity of the ID problem is equal to the maximum epsilon-exponent of type II of error in the HT problem when both side compression is allowed.

关键词： Testing Convergence Transforms databases Encoding Decoding Information science

来源：评论

学校读者我要写书评

暂无评论

Virtual Synchronous Generator Technology and Its parallel Control Strategy in Isolated Island Microgrid 10

Virtual Synchronous Generator Technology and Its Parallel Co...

引用

IEEE 10th international symposium on Power Electronics for distributed Generation systems (PEDG)

作者： Li Ning Zhang Xiang Cao Yujie He Fuxing Zhang Shiqian Wang Yelin Xian Univ Technol Sch Automat & Informat Engn Xian 710048 Shaanxi Peoples R China China Ship Dev & Design Ctr Wuhan 430064 Hubei Peoples R China Xian Kenuo Network & Informat Secur Technol Inst Xian 710065 Shaanxi Peoples R China

ISBN: (纸本)9781728124551

For the Virtual synchronous generator (VSG) technology in microgrid, a VSG control strategy for islanding microgrid, which helps to reduce AC bus voltage drop is introduced in this paper firstly. Secondly, a parameter design method based on inertia constant time matching and impedance matching is proposed, so that making VSG parallel system have good dynamic characteristics of active and reactive power during switching load. Finally, the proposed control strategy and parameter design method are verified correct and effective in MTLAB/Simulink.

关键词： Microgrid virtual synchronous generator virtual power

来源：评论

学校读者我要写书评

暂无评论

Leveraging InfiniBand for Highly Concurrent Messaging in Java Applications 18

Leveraging InfiniBand for Highly Concurrent Messaging in Jav...

引用

18th international symposium on parallel and distributed Computing (ISPDC)

作者： Nothaas, Stefan Beineke, Kevin Schoettner, Michael Heinrich Heine Univ Dept CS Operating Syst Dusseldorf Germany

ISBN: (纸本)9781728138015

In this paper, we describe the design and implementation of Ibdxnet, an InfiniBand transport to enable high throughput and low-latency messaging for concurrent Java applications with transparent serialization of Java objects using DXNet. Ibdxnet applies best practices by implementing a dynamic and scalable pipeline with RC QPs and messaging verbs using the ibverbs library. A carefully designed JNI layer ensures minimal overhead to connect the native Ibdxnet library to the Java counterpart without impacting performance. Existing as well as new multi-threaded Java applications can use DXNet's event-based architecture concurrently to send and receive messages and requests transparently over InfiniBand with the Ibdxnet transport. We compared DXNet with Ibdxnet to the InfiniBand supporting MPI implementations FastMPJ and MVAPICH2. DXNet's performance for middle sized and large messages keeps up with FastMPJ's and MVAPICH2's. For small messages, DXNet clearly outperforms both systems especially in a multi-threaded environment. Furthermore, we compared the two key-value storages DXRAM, which uses DXNet with Ibdxnet, and RAMCloud, which uses a custom network subsystem based on ibverbs, using the YCSB with two workloads. On a graph data workload, DXRAM outperforms RAMCloud with a five times higher throughput of 7.96 mops on 40 nodes.

关键词： High-speed networks Big data applications distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallel Iteration Algorithm of Roll Angle Based On High-Performance ARM Processor

Parallel Iteration Algorithm of Roll Angle Based On High-Per...

引用

IEEE international Conference on Unmanned systems (ICUS)

作者： Shiyao Wang Dongguang Li Siyu Xiao School of Mechatronical Engineering Beijing Institute of Technology Beijing China

ISBN: (数字)9781728180250

ISBN: (纸本)9781728180267

The method for calculating the attitude of the projectile requires high real-time performance and a large amount of *** parallel calculation method of the missile-borne signal is studied. For the linear iterative equations in the attitude solution algorithm, a parallel calculation based on Newton method is *** method decomposes linear iterative equations in parallel to form a distributed multi-core parallel solution process, which can effectively optimize the algorithm solution *** were conducted through four sets of data with different data lengths and frame rates to verify the execution efficiency of multi-core parallel computing.

关键词： Multicore processing Computational modeling distributed databases parallel processing Iterative algorithms Real-time systems Mathematical model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 104 105 106 107 108 109 110 111 112 113 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：