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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,282 篇 会议
362 篇 期刊文献
31 册 图书
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

1,209 篇 distributed data...
993 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
779 篇 computer science
695 篇 databases
617 篇 computer archite...
586 篇 application soft...
553 篇 computational mo...
463 篇 parallel process...
367 篇 scalability
358 篇 distributed comp...
352 篇 distributed proc...
327 篇 hardware
325 篇 database systems
294 篇 processor schedu...
294 篇 costs
293 篇 parallel program...
291 篇 resource managem...
269 篇 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,636 篇 英文
21 篇 中文
19 篇 其他

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

共 9676 条记录，以下是251-260 订阅

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

详细简洁

排序：

Towards traceability across sovereign, distributed RFID databases

Towards traceability across sovereign, distributed RFID data...

引用

10th international Database Engineering and Applications symposium (IDEAS 2006)

作者： Agrawal, Rakesh Cheung, Alvin Kailing, Karin Schonauer, Stefan Micro Ser Lab 1065 La Avenida Mountain View CA USA IBM Corp Almaden Res Ctr San Jose CA USA

ISBN: (纸本)9780769525778

Tracking and tracing individual items is a new and emerging trend in many industries. Driven by maturing technologies such as Radio-Frequency Identification (RFID) and upcoming standards such as the Electronic Product Code (EPC) a rapidly increasing number of enterprises are collecting vast amounts of tracking data. To enable traceability over the entire life-cycle of items data has to be shared across independent and possibly competing enterprises. The need to simultaneously compete and cooperate requires a traceability system design that allows companies to share their traceability data while maintaining complete sovereignty over what is shared and with whom. Based on an extensive study of traceability applications, we introduce the formal concept of traceability networks and highlight the technical challenges involved in sharing data in such a network. To address these challenges, we present an innovative combination of query processing techniques from P2P networks and distributed as well as parallel databases with confidentiality enforcement techniques.

关键词： traceability RFID query processing data sovereignty distributed databases

来源：评论

学校读者我要写书评

暂无评论

A Status Monitoring Method for Multi-parallel Choppers in Wind Turbine Converters 11

A Status Monitoring Method for Multi-parallel Choppers in Wi...

引用

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

作者： Wu, Rui Parkhou, Masoud Vestas Wind Syst AS Aarhus Denmark

ISBN: (纸本)9781728169903

The multi-parallel chopper system is commonly used in modern MW-level wind turbine converters. Even though the chopper is usually considered as robust and reliable, the semiconductor module can suffer critical junction temperature in extreme fault ride through (FRT) events. This paper proposes a method to monitor and identify if the individual chopper is functioning, degraded, or failed by means of collecting and comparing the parallel semiconductors' temperatures during FRT events. A simulation model is created in PLCES, the accuracy of which is further validated by a dedicated experimental setup including an infrared camera. The proposed method is verified by PLECS simulations.

关键词： DC chopper Insulated Gate Bipolar Transistor (IGBT) fault ride through status monitoring temperature infrared measurement

来源：评论

学校读者我要写书评

暂无评论

Evaluating Asynchronous parallel I/O on HPC systems 37

Evaluating Asynchronous Parallel I/O on HPC Systems

引用

37th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Ravi, John Byna, Suren Koziol, Quincey Tang, Houjun Becchi, Michela N Carolina State Univ Raleigh NC 27695 USA Lawrence Berkeley Natl Lab Berkeley CA 94720 USA

ISBN: (纸本)9798350337662

parallel I/O is an effective method to optimize data movement between memory and storage for many scientific applications. Poor performance of traditional disk-based file systems has led to the design of I/O libraries which take advantage of faster memory layers, such as on-node memory, present in high-performance computing (HPC) systems. By allowing caching and prefetching of data for applications alternating computation and I/O phases, a faster memory layer also provides opportunities for hiding the latency of I/O phases by overlapping them with computation phases, a technique called asynchronous I/O. Since asynchronous parallel I/O in HPC systems is still in the initial stages of development, there hasn't been a systematic study of the factors affecting its performance. In this paper, we perform a systematic study of various factors affecting the performance and efficacy of asynchronous I/O, we develop a performance model to estimate the aggregate I/O bandwidth achievable by iterative applications using synchronous and asynchronous I/O based on past observations, and we evaluate the performance of the recently developed asynchronous I/O feature of a parallel I/O library (HDF5) using benchmarks and real-world science applications. Our study covers parallel file systems on two large-scale HPC systems: Summit and Cori, the former with a GPFS storage and the latter with a Lustre parallel file system.

关键词： Performance Evaluation Modeling Asynchronous I/O parallel I/O

来源：评论

学校读者我要写书评

暂无评论

Comparative Evaluation of Modulation Schemes for Grid-connected parallel Interleaved Inverters 7

Comparative Evaluation of Modulation Schemes for Grid-connec...

引用

7th IEEE international symposium On Power Electronics for distributed Generation systems (PEDG)

作者： Gohil, Ghanshyamsinh Bede, Lorand Teodorescu, Remus Kerekes, Tamas Blaabjerg, Frede Aalborg Univ Dept Energy Technol Aalborg Denmark

ISBN: (纸本)9781467386173

A comparative evaluation of the different modulation schemes for the grid-connected converter with two parallel interleaved Voltage Source Converters (VSCs) is presented in this paper. The volume and the losses of the converter-side inductor of the LCL harmonic filter are evaluated for the grid-side converter of the multi-MW Wind Energy Conversion System (WECS). In order to achieve high current rating in MW-level WECS, two-level VSCs are often connected in parallel. The parallel connected VSCs can be operated with interleaved carrier signals and can be treated as a multi-level converter. As a result, the size of the harmonic filter components can be significantly reduced. However, circulating current flows between the parallel VSCs and it is often suppressed using a Coupled Inductor (CI). The losses and size of the CI are also evaluated for different modulation schemes and compared in this paper. A detailed discussion on the loss modeling of the inductive components and a multi-objective optimization method is also presented.

关键词： Voltage source converters (VSC) filter design multi-objective optimization harmonic filter pulse width modulation interleaving phase disposition modulation

来源：评论

学校读者我要写书评

暂无评论

The Coming Age of Pervasive Data Processing 18

The Coming Age of Pervasive Data Processing

引用

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

作者： Rellermeyer, Jan S. Khorasani, Sobhan Omranian Graur, Dan Parthasarathy, Apourva Delft Univ Technol Distributed Syst Grp Delft Netherlands

ISBN: (纸本)9781728138015

Emerging Big Data analytics and machine learning applications require a significant amount of computational power. While there exists a plethora of large-scale data processing frameworks which thrive in handling the various complexities of data-intensive workloads, the ever-increasing demand of applications have made us reconsider the traditional ways of scaling (e.g., scale-out) and seek new opportunities for improving the performance. In order to prepare for an era where data collection and processing occur on a wide range of devices, from powerful HPC machines to small embedded devices, it is crucial to investigate and eliminate the potential sources of inefficiency in the current state of the art platforms. In this paper, we address the current and upcoming challenges of pervasive data processing and present directions for designing the next generation of large-scale data processing systems.

关键词： Big Data Machine Learning systems Performance Efficiency

来源：评论

学校读者我要写书评

暂无评论

parallel Data systems With Self-Generating Analytics Demo of self-generating analytics on the hospital supply chain ecosystem

Parallel Data Systems With Self-Generating Analytics Demo of...

引用

IEEE Region 10 symposium (TENSYMP) - Good Technologies for Creating Future

作者： Baker, Feyaz Chandrasekaran, K. Natl Inst Technol Comp Sci & Engn Dept Surathkal Karnataka India

ISBN: (纸本)9781665400268

We attempt to produce a feasible solution for a real-world problem, using distributed data management concepts. The tool is designed to improve the quality of decision making in hospitals, suppliers, and manufacturers by presenting all information about mutual transactions in a secure and searchable manner. Since the databases of hospitals, suppliers, and manufacturers are large enough that compiling all of them would be difficult, we have applied modified aggregation and query methods for distributed data systems and produce metrics that can support growth. Such a system could help detect outbreaks of disease, produce meaningful data about drug use, and prevent wastage of medical resources.

关键词： distributed data DDM hospital management self-generating analytics

来源：评论

学校读者我要写书评

暂无评论

Efficient allocation in distributed object oriented databases 16

Efficient allocation in distributed object oriented database...

引用

16th international Conference on parallel and distributed Computing systems (PDCS 2003)

作者： Graham, J Alves-Foss, J Univ Idaho Ctr Secure & Dependable Syst Moscow ID 83844 USA

ISBN: (纸本)188084348X

Efficient distribution of data is a major challenge in distributed databases. The problem is even more severe for distributed object oriented databases because of inheritance, encapsulation and the more complex problem involved when methods invoke other methods. This problem is a harder version of the relational database allocation problem (DAP), a problem known to be NP-haxd. We looked at the problem of developing an efficient heuristic for allocating object fragments in a distributed object oriented database. To accomplish this we created a genetic algorithm which produced more favorable results as compared to the graphical algorithm of Barker and Bhar [2]. Our results show near optimal allocation for those configurations in which the optimal could be computed, improvement over the graphical algorithm and has a linear running time.

关键词： distributed object oriented database object fragments genetic algorithm optimal allocation

来源：评论

学校读者我要写书评

暂无评论

On the Influence of Graph Density on Randomized Gossiping 29

On the Influence of Graph Density on Randomized Gossiping

引用

29th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Elsaesser, Robert Kaaser, Dominik Salzburg Univ Dept Comp Sci A-5020 Salzburg Austria

ISBN: (纸本)9781479986484

Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, known as the broadcasting problem, a single message has to be spread among all nodes of a graph. A prominent communication protocol for this problem is based on the so-called random phone call model (Karp et al., FOCS 2000). In each step, every node opens a communication channel to a randomly chosen neighbor, which can then be used for bidirectional communication. Motivated by replicated databases and peer-to-peer networks, Berenbrink et al., ICALP 2010, considered the so-called gossiping problem in the random phone call model. There, each node starts with its own message and all messages have to be disseminated to all nodes in the network. They showed that any O(log n)-time algorithm in complete graphs requires O(log n) message transmissions per node to complete gossiping, with high probability, while it is known that in the case of broadcasting the average number of message transmissions per node is O(log log n). Furthermore, they explored different possibilities on how to reduce the communication overhead of randomized gossiping in complete graphs. It is known that the O(n log log n) bound on the number of message transmissions produced by randomized broadcasting in complete graphs cannot be achieved in sparse graphs even if they have best expansion and connectivity properties. In this paper, we analyze whether a similar influence of the graph density also holds w.r.t. the performance of gossiping. We study analytically and empirically the communication overhead generated by gossiping algorithms w.r.t. the random phone call model in random graphs and also consider simple modifications of the random phone call model in these graphs. Our results indicate that, unlike in broadcasting, there seems to be no significant difference between the performance of randomized gossiping in complete graphs and sparse random graphs. Furthermore, our simulations illus

关键词： message passing Telephone broadcasting Line of nodes Communication channels replicated databases Transmissions Random RANDOMISING Ganglia Line graph

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Fuzzy Co-clustering with distributed Cooccurrence Matrices 7

Privacy Preserving Fuzzy Co-clustering with Distributed Cooc...

引用

Joint 7th international Conference on Soft Computing and Intelligent systems (SCIS) and 15th international symposium on Advanced Intelligent systems (ISIS)

作者： Tanaka, Daiji Oda, Toshiya Honda, Katsuhiro Notsu, Akira Osaka Prefecture Univ Grad Sch Engn Sakai Osaka 5998531 Japan

ISBN: (纸本)9781479959556

Privacy preserving data mining is a promising topic for utilizing various personal information without fear of information leaks. Fuzzy co-clustering is a fundamental technique for summarizing mutual cooccurrence information among objects and items, and has been demonstrated to be useful in such applications as document analysis and collaborative filtering. In this paper, a secure framework for privacy preserving fuzzy co-clustering is proposed for handling both vertically and horizontally distributed cooccurrence matrices. Personal observation stored in each site is summarized into co-cluster structures with an encryption operation. The advantage of utilizing distributed cooccurrence matrices is demonstrated in several numerical experiments.

关键词： data mining data privacy matrix algebra pattern clustering collaborative filtering distributed cooccurrence matrices document analysis encryption operation personal information privacy preserving data mining privacy preserving fuzzy coclustering Clustering algorithms Collaboration Data privacy distributed databases Encryption Privacy Vectors Data privacy Data Security collaborative filtering distributed databases Privacy cryptography Clustering algorithms matrix algebra data mining Cluster Analysis Content analysis

来源：评论

学校读者我要写书评

暂无评论

Accelerating Nearest Neighbor Search on Manycore systems

Accelerating Nearest Neighbor Search on Manycore Systems

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Cayton, Lawrence Max Planck Inst Tubingen Germany

ISBN: (纸本)9780769546759

We develop methods for accelerating metric similarity search that are effective on modern hardware. Our algorithms factor into easily parallelizable components, making them simple to deploy and efficient on multicore CPUs and GPUs. Despite the simple structure of our algorithms, their search performance is provably sublinear in the size of the database, with a factor dependent only on its intrinsic dimensionality. We demonstrate that our methods provide substantial speedups on a range of datasets and hardware platforms. In particular, we present results on a 48-core server machine, on graphics hardware, and on a multicore desktop.

关键词： similarity search metric spaces parallel algorithms manycore

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：