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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 电气工程
- 638 篇 信息与通信工程
- 313 篇 控制科学与工程
- 227 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 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,637 篇 英文
21 篇 中文
18 篇 其他

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

共 9676 条记录，以下是231-240 订阅

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

详细简洁

排序：

Experimental validation of parallel computation models on the Intel Paragon 1

Experimental validation of parallel computation models on th...

引用

1st Merged international parallel Processing symposium/symposium on parallel and distributed Processing (IPPS/SPDP 1998)

作者： Juurlink, BHH Univ Gesamthsch Paderborn Heinz Nixdorf Inst D-33102 Paderborn Germany

ISBN: (纸本)0818684038

Experimental data validating some of the proposed parallel computation models on the Intel Paragon is presented. This architecture is characterized by a large bandwidth and a relatively large startup cost of a message transmission, which makes it extremely important to employ bulk transfers. The models considered are the BSP model, in which it is assumed that all messages have a fixed short size, and the BPRAM, in which block transfers are rewarded.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CODBS: A cascading oblivious search protocol optimized for real-world relational database indexes 40

CODBS: A cascading oblivious search protocol optimized for r...

引用

40th international symposium on Reliable distributed systems (SRDS)

作者： Pontes, Rogerio Portela, Bernardo Barbosa, Manuel Vilaca, Ricardo Univ Porto Porto Portugal Univ Minho Braga Portugal INESC TEC Porto Portugal NOVA LINCS Costa Da Caparica Portugal

ISBN: (纸本)9781665438193

Encrypted databases systems and searchable encryption schemes still leak critical information (e.g.: access patterns) and require a choice between privacy and efficiency. We show that using ORAM schemes as a black-box is not a panacea and that optimizations are still possible by improving the data structures. We design an ORAM-based secure database that is built from the ground up: we replicate the typical data structure of a database system using different optimized ORAM constructions and derive a new solution for oblivious searches on databases. Our construction has a lower bandwidth overhead than state-of-the-art ORAM constructions by moving client-side computations to a proxy with an intermediate (rigorously defined) level of trust, instantiated as a server-side isolated execution environment. We formally prove the security of our construction and show that its access patterns depend only on public information. We also provide an implementation compatible with SQL databases (PostgresSQL). Our system is 1.2 times to 4 times faster than state-of-the-art ORAM-based solutions.

关键词： Data privacy Protocols Bandwidth Relational databases Forestry Reliability theory Data structures

来源：评论

学校读者我要写书评

暂无评论

An Error-Reflective Consistency Model for distributed Data Stores 33

An Error-Reflective Consistency Model for Distributed Data S...

引用

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

作者： Dexter, Philip Chiu, Kenneth Sendir, Bedri SUNY Binghamton Binghamton NY 13902 USA IBM Res Austin TX USA

ISBN: (纸本)9781728112466

Consistency models for distributed data stores offer insights and paths to reasoning about what a user of such a system can expect. However, often consistency models are defined or implemented in coarse-grained manners, making it difficult to achieve precisely the consistency required. Further, many domains are already written to handle anomalies in distributed systems, yet they have little opportunity for expressing or taking advantage of their leniency. We propose reflective consistency an active solution which adapts an underlying data store to changing loads and resource availability to meet a given consistency level. We implement reflective consistency in Cassandra, an existing distributed data store supporting per-read and per-write consistency. Our implementation allows users to express their anomaly leniency directly and the system will react to the presence of anomalies, changing Cassandra's consistency only when needed. Users of Reflective Cassandra can expect minimal overhead (anywhere from 1% to 14% depending on configuration) and a 50% decrease in the amount of costly strong reads.

关键词： distributed computing Database systems

来源：评论

学校读者我要写书评

暂无评论

In-Memory Indexed Caching for distributed Data Processing 36

In-Memory Indexed Caching for Distributed Data Processing

引用

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

作者： Uta, Alexandru Ghit, Bogdan Dave, Ankur Rellermeyer, Jan Boncz, Peter Leiden Univ LIACS Leiden Netherlands Databricks San Francisco CA USA Univ Calif Berkeley Berkeley CA USA Delft Univ Technol Delft Netherlands CWI Amsterdam Netherlands

ISBN: (纸本)9781665481069

Powerful abstractions such as dataframes are only as efficient as their underlying runtime system. The de-facto distributed data processing framework, Apache Spark, is poorly suited for the modern cloud-based data-science workloads due to its outdated assumptions: static datasets analyzed using coarse-grained transformations. In this paper, we introduce the Indexed DataFrame, an in-memory cache that supports a dataframe abstraction which incorporates indexing capabilities to support fast lookup and join operations. Moreover, it supports appends with multi-version concurrency control. We implement the Indexed DataFrame as a lightweight, standalone library which can be integrated with minimum effort in existing Spark programs. We analyze the performance of the Indexed DataFrame in cluster and cloud deployments with real-world datasets and benchmarks using both Apache Spark and Databricks Runtime. In our evaluation, we show that the Indexed DataFrame significantly speeds-up query execution when compared to a nonindexed dataframe, incurring modest memory overhead.

关键词： distributed processing Runtime Data analysis Cluster computing Relational databases Libraries Concurrency control

来源：评论

学校读者我要写书评

暂无评论

parallel Graph Partitioning for Complex Networks 29

Parallel Graph Partitioning for Complex Networks

引用

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

作者： Meyerhenke, Henning Sanders, Peter Schulz, Christian Karlsruhe Inst Technol Karlsruhe Germany

ISBN: (纸本)9781479986484

Processing large complex networks like social networks or web graphs has recently attracted considerable interest. To do this in parallel, we need to partition them into pieces of about equal size. Unfortunately, previous parallel graph partitioners originally developed for more regular mesh-like networks do not work well for these networks. This paper addresses this problem by parallelizing and adapting the label propagation technique originally developed for graph clustering. By introducing size constraints, label propagation becomes applicable for both the coarsening and the refinement phase of multilevel graph partitioning. We obtain very high quality by applying a highly parallel evolutionary algorithm to the coarsest graph. The resulting system is both more scalable and achieves higher quality than state-of-the-art systems like ParMetis or PT-Scotch. For large complex networks the performance differences are very big. As an example, our algorithm partitions a web graph with 3.3G edges in 16 seconds using 512 cores of a high-performance cluster while producing a high quality partition none of the competing systems can handle this graph on our system.

关键词： algorithm engineering complex networks graph partitioning parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parallel distributed scheme for stochastic coding of self-similar patterns

Parallel distributed scheme for stochastic coding of self-si...

引用

2nd AIZU international symposium on parallel Algorithms/Architecture Synthesis

作者： Kamejima, K Osaka Institute of Technology Japan

ISBN: (纸本)0818678704

A parallel distributed scheme is presented for coding random patterns generated via iteration of contraction mappings. The scheme is implemented by a decentralized computational process an distributed parameter system. The distributed parameter system generates a representation of missing probability for attractor as the basis of design of contraction mappings. The local minimals of missing probability is extracted and aggregated as the decentralized representation of contraction mappings. The coding scheme is verified through computer simulation.

关键词： Stochastic processes Image analysis Explosions distributed computing Fractals Optical imaging distributed parameter systems Data mining Computer simulation Image generation

来源：评论

学校读者我要写书评

暂无评论

A steering environment for online parallel visualization of legacy parallel simulations 06

A steering environment for online parallel visualization of ...

引用

10th IEEE international symposium on distributed Simulation and Real-Time Applications

作者： Esnard, Aurelien Richart, Nicolas Coulaud, Olivier INRIA Futurs/LaBri France

ISBN: (纸本)0769526977

In the context of scientific computing, the computational steering consists in the coupling of numerical simulations with 3D visualization systems through the network. This allows scientists to monitor online the inter mediate results of their computations in a more interactive way than the batch mode, and allows them to modify the simulation parameters on-the-fly. While most of existing computational steering environments support parallel simulations, they are often limited to sequential visualization systems. This may lead to an important bottleneck and increased rendering time. To achieve the required performance for online visualization, we have designed the EPSN framework, a computational steering environment that enables to interconnect legacy parallel simulations with parallel visualization systems. For this, we have introduced a redistribution algorithm for unstructured data, that is well adapted to the context of M x N computational steering. Then, we focus on the design of our parallel viewer and present some experimental results obtained with a particle-based simulation in astrophysics.

关键词： computational steering numerical simulation data redistribution parallel visualization

来源：评论

学校读者我要写书评

暂无评论

Proposed globally distributed federated database: a practical performance evaluation

Proposed globally distributed federated database: a practica...

引用

Proceedings of the 3rd international Conference on parallel and distributed Information systems

作者： Linn, Craig Howarth, Bruce Univ of Western Sydney Nepean

Many organisations are now planning to move their operations from total reliance on centralised databases towards distributed environments which may involve the interoperability of a number of heterogeneous databases. This study looks at a particular case for an international financial institution, with the likely performance of a proposed globally distributed federated database being compared with the performance of the current centralised system. The performance model developed includes submodels for transaction structure and management, user workload, and distributed heterogeneous databases. Simulations focus on response times for a particular class of credit control/deal entry transactions in the presence of a background load. The results demonstrate that the proposed federated database outperforms the current centralised system, and that this is achievable using currently available technology.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：