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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

497 篇 会议
10 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 185 篇 计算机科学与技术...
- 96 篇 软件工程
- 37 篇 信息与通信工程
- 26 篇 电气工程
- 13 篇 控制科学与工程
- 10 篇 材料科学与工程（可...
- 9 篇 电子科学与技术（可...
- 4 篇 网络空间安全
- 3 篇 安全科学与工程
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 冶金工程
54 篇 理学
- 48 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 地质学
34 篇 管理学
- 28 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
1 篇 军事学

主题

93 篇 computer science
79 篇 concurrent compu...
71 篇 distributed comp...
67 篇 application soft...
65 篇 database systems
62 篇 parallel process...
59 篇 databases
57 篇 distributed data...
43 篇 transaction data...
42 篇 delay
39 篇 computer archite...
37 篇 algorithm design...
36 篇 costs
36 篇 relational datab...
35 篇 hardware
30 篇 processor schedu...
30 篇 large-scale syst...
27 篇 computational mo...
27 篇 performance anal...
27 篇 computer network...

机构

7 篇 ibm thomas j. wa...
4 篇 department of co...
3 篇 ieee
3 篇 king saud univer...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 toyohashi univer...
2 篇 center for paral...
2 篇 department of co...
2 篇 school of comput...
2 篇 computer science...
2 篇 department of el...
2 篇 university of el...
2 篇 school of comput...
2 篇 department of bi...
2 篇 school of comput...
2 篇 eth zurich
2 篇 computer science...
2 篇 computer science...

作者

6 篇 a. choudhary
5 篇 j. saltz
4 篇 t. kurc
4 篇 a. boukerche
4 篇 a. el abbadi
3 篇 f. dehne
3 篇 p.s. yu
3 篇 wan maseri wan m...
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 jasni mohamad za...
3 篇 eyas el-qawasmeh
3 篇 d. agrawal
2 篇 a. burger
2 篇 a. rau-chaplin
2 篇 a. ghafoor
2 篇 s. bandyopadhyay
2 篇 hoefler torsten
2 篇 o. wolfson

语言

512 篇 英文
1 篇 其他

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

共 513 条记录，以下是71-80 订阅

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

详细简洁

排序：

Scalable processing of trajectory-based queries in space-partitioned moving objects databases 08

Scalable processing of trajectory-based queries in space-par...

引用

16th ACM SIGSPATIAL international Conference on Advances in Geographic Information systems, ACM GIS 2008

作者： Lange, Ralph Dürr, Frank Rothermel, Kurt Institute of Parallel and Distributed Systems Universitätsstraße 38 70569 Stuttgart Germany

ISBN: (纸本)9781605583235

Space-partitioned Moving Objects databases (SP-MODs) allow for the scalable, distributed management of large sets of mobile objects' trajectories by partitioning the trajectory data to a network of database servers. Processing a spatio-temporal query q therefore requires efficiently routing q to the servers storing the affected trajectory segments. With a coordinate-based query - like a spatio-temporal range query - the relevant servers are directly determined by the queried range. However, with trajectory-based queries - like retrieving the distance covered by a certain object during a given time interval - the relevant servers depend on actual movement of the queried object. Therefore, efficient routing mechanisms for trajectory-based queries are an important challenge in SP-MODs. In this paper, we present the distributed Trajectory Index (DTI) that allows for such efficient query routing by creating an overlay network for each trajectory. We further present an enhanced index called DTI+S. It accelerates the processing of queries on aggregates of dynamic attributes, like the maximum speed during a time interval, by augmenting DTI with summaries of trajectory segments. Our simulations with a network of 1000 database servers show that DTI+S can reduce the overall processing time by more than 98%. © 2008 ACM.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

parallel computation for luc cryptosystems on distributed memory multiprocessor machine

Parallel computation for luc cryptosystems on distributed me...

引用

4th IASTED international Conference on Advances in Computer Science and Technology, ACST 2008

作者： Ali, Zulkarnain Md Othman, Mohamed Said, Mohd Rushdan Muhd Sulaiman, Mohammad Nasir Department of Computer Science Universiti Kebangsaan Malaysia 43600 Bangi Selangor Malaysia

ISBN: (纸本)9780889867307

Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing computation technique will suffer a huge computations time and spaces when calculating a very large size of public-key and private-key. Recently, a method for fast LUC Cryptosystems computation on single processor has been proposed. In this paper, we extend the method in parallel on distributed memory multiprocessor machine using message-passing interface. We are generating a special sequence from a given value of public-key and private-key. This special sequence will be used to direct the computation of LUC. We examine the parallelism efficiency of the algorithm by analyze the simulation time and speedup.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for P systems implementation in multiprocessors

Parallel algorithm for P systems implementation in multiproc...

引用

作者： Gil, F. Javier Fernández, Luis Arroyo, Fernando De Frutos, J. Alberto Natural Computing Group Universidad Politécnica de Madrid Spain

ISBN: (纸本)9784990288020

The Transition P systems perform a computation through transition or evolution step between two consecutive configurations. Each evolution step is made up of two phases: on the first phase the evolution rules are applied, and a second phase of communication between membranes. At the time of designing architectures hardware and/or software for the implementation of Transition P systems, has been detected the necessity of having algorithms that can know beforehand the required time to apply a set of active evolution rules on a multiset inside a membrane. This is very important as it allows to determinate the balanced number of membranes to be located in each processor in the implementation of distributed architectures of P systems in order to achieve optimal evolution step time with minimal resources. In this work we introduce a parallel algorithm for application of active rules in a membrane oriented towards the implementation of Transition P systems in multiprocessors hardware architectures. Given a set of active rules R, the algorithm is based on power set of R (the set formed by all the subsets of R) and on the rules elimination algorithm (applying them to its maximum applicability benchmark). This new algorithm complies the requisites of being nondeterministic, parallel, and what is very important, the algorithm is time delimited because it is only dependant on the number of evolution rules placed in a membrane. ©ISAROB 2008.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel ODETLAP for terrain compression and reconstruction 08

Parallel ODETLAP for terrain compression and reconstruction

引用

16th ACM SIGSPATIAL international Conference on Advances in Geographic Information systems, ACM GIS 2008

作者： Stookey, Jared Xie, Zhongyi Cutler, Barbara Franklin, W. Randolph Tracy, Dan Andrade, Marcus V. A. ECSE Dept. RPI United States CS Dept. RPI United States DPI Univ. Fed. Vicosa Brazil RPI United States

ISBN: (纸本)9781605583235

We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data used for Geographical Information systems (GIS). ODETLAP can be used to reconstruct a compressed elevation map, or to generate a dense regular grid from airborne Light Detection and Ranging (LIDAR) point cloud data. With previous methods, the time to execute ODETLAP does not scale well with the size of the input elevation map, resulting in running times that are prohibitively long for large data sets. Our algorithm divides the data set into patches, runs ODETLAP on each patch, and then merges the patches together. This method gives two distinct speed improvements. First, we provide scalability by reducing the complexity such that the execution time grows almost linearly with the size of the input, even when run on a single processor. second, we are able to calculate ODETLAP on the patches concurrently in a parallel or distributed environment. Our new patch-based implementation takes 2 seconds to run ODETLAP on an 800 x 800 elevation map using 128 processors, while the original version of ODETLAP takes nearly 10 minutes on a single processor (271 times longer). We demonstrate the effectiveness of the new algorithm by running it on data sets as large as 16000 x 16000 on a cluster of computers. We also discuss our preliminary results from running on an IBM Blue Gene/L system with 32,768 processors. © 2008 ACM.

关键词： Optical radar

来源：评论

学校读者我要写书评

暂无评论

Towards data partitioning for parallel computing on three interconnected clusters

Towards data partitioning for parallel computing on three in...

引用

6th international symposium on parallel and distributed Computing

作者： Becker, Brett A. Lastovetsky, Alexey Univ Coll Dublin Sch Comp Sci & Informat Dublin 4 Ireland

ISBN: (纸本)9780769529172

We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can reduce communication time due to a lower total volume of communication and a more efficient communication schedule. When the network topology is a linear array this partitioning always results in a lower total volume of communication compared to existing partitionings, provided the most powerful node is at the center of the array. When the topology is fully connected this partitioning results in a lower total volume of communication for all but a few power ratios. second, it allows for the overlapping of communication and computation. These two inherent advantages work together to reduce overall execution time significantly.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive distributed database replication through colonies of pogo ants

Adaptive distributed database replication through colonies o...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Abdul-Wahid, Sarah Andonie, RǍzvan Lemley, Joseph Schwing, James Widger, Jonathan Central Washington University Computer Science Department Ellensburg WA 98926 United States

ISBN: (纸本)1424409101

We address the problem of optimizing the distribution of partially replicated databases over a computer network. Replication is used to increase data availability in the presence of site or communication failures and to decrease retrieval, costs by local access if possible. We present a new bio-inspired replication management approach which is adaptive, completely decentralized, and based on swarm intelligence. Each node has the autonomy to start at any time, depending on the internal state of its stored data objects, a redistribution process. "Redistribution" means replicate, create, delete, update, or move data objects to other nodes of the network. The redistribution process is a dynamic load-balancing scheme which runs with lower priority in the background. The system is event-driven, but the learning process is not synchronized with the events. © 2007 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Programming distributed memory sytems using OpenMP

Programming distributed memory sytems using OpenMP

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Basumallik, Ayon Min, Seung-Jai Eigenmann, Rudolf Purdue University School of Electrical and Computer Engineering West Lafayette IN 47907-1285 United States

ISBN: (纸本)1424409101

OpenMP has emerged as an important model and language extension for shared-memory parallel programming. On shared-memory platforms, OpenMP offers an intuitive, incremental approach to parallel programming. In this paper, we present techniques that extend the ease of shared-memory parallel programming in OpenMP to distributedmemory platforms as well. First, we describe a combined compile-time/runtime system that uses an underlying Software distributed Shared Memory System and exploits repetitive data access behavior in both regular and irregular program sections. We present a compiler algorithm to detect such repetitive data references and an API to an underlying software distributed shared memory system to orchestrate the learning and proactive reuse of communication patterns. second, we introduce a direct translation of standard OpenMP into MPI message-passing programs for execution on distributed memory systems. We present key concepts and describe techniques to analyze and efficiently handle both regular and irregular accesses to shared data. Finally, we evaluate the performance achieved by our approaches on representative OpenMP applications. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A genetic approach for distributing semantic databases of crowd simulations

A genetic approach for distributing semantic databases of cr...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Lozano, M. Orduña, J.M. Cavero, V. Spain

ISBN: (纸本)1424409101

Last years have witnessed how crowd simulations have become an essential tool for many virtual environment applications. These applications require both rendering visually plausible images and managing the behavior of autonomous agents, and therefore they need a scalable design that allow them to simultaneously tackle these two requirements. One of the main problems in the design of a scalable crowd simulations consists of efficiently distributing among different computers the semantic database containing the virtual world. In this paper, we propose a genetic approach for distributing the semantic database of crowd simulations in such a way that the dependencies among the computers hosting the pieces of the database are minimized. The proposed approach avoids the saturation of these computers by ensuring that the size of the pieces assigned to each computer is properly balanced. The performance evaluation results show that the proposed approach significantly reduces the resulting overhead in regard to other local search methods, regardless of the movement pattern of the agents. Therefore, it allows an effective partition of the semantic database. © 2007 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Domain decomposition vs. master-slave in apparently homogeneous systems

Domain decomposition vs. master-slave in apparently homogene...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Banino-Rokkones, Cyril Sem Sælandsvei 7-9 NO-7491 Trondheim Norway

ISBN: (纸本)1424409101

This paper investigates the utilization of the master-slave (MS) paradigm as an alternative to domain decomposition (DD) methods for parallelizing lattice gauge theory (LGT) models within distributed memory environments. The motivations for this investigation are twofold. First, LGT models are inherently difficult to parallelize efficiently with DD methods. second, DD methods have proven useful for homogeneous environments, but are impractical for heterogeneous and dynamic environments. Besides, many modern supercomputer architectures that look homogeneous (such as multi-core or SMP), are in fact heterogeneous and dynamic environments. We highlight this issue by comparing a traditional first-come first-served MS implementation to a simple but yet efficient selective MS scheduling strategy that automatically accounts for system, heterogeneity and variability. Our experimental results with the parallelization of our LGT model, reveal that the selective MS implementation achieves good efficiency, but lacks of scalability. In contrast, the DD method is highly scalable, but at the expense of a poor efficiency. These results open up for a hybrid approach, where the MS and the DD methods would, be combined for achieving scalable high performance. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Packet loss burstiness: Measurements and implications for distributed applications

Packet loss burstiness: Measurements and implications for di...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Wei, David X. Cao, Pei Low, Steven H. Division of Engineering and Applied Science California Institute of Technology Pasadena CA 91125 United States Department of Computer Science Stanford University Stanford CA 94305 United States

ISBN: (纸本)1424409101

Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on congestion control protocols such as TCP to protect the systems from congestion collapse. Most TCP congestion control algorithms use packet loss as signal to detect congestion. In this paper, we study the packet loss process in sub-round-trip-time (sub-RTT) timescale and its impact on the loss-based congestion control algorithms. Our study suggests that the packet loss in sub-RTT timescale is very bursty. This burstiness leads to two effects. First, the subRTT burstiness in packet loss process leads to complicated interactions between different loss-based algorithms. second, the sub-RTT burstiness in packet loss process makes the latency of data transfers under TCP hard to predict. Our results suggest that the design of a distributed system has to seriously consider the nature of packet loss process and carefully select the congestion control algorithms best suited for the distributed computation environments. © 2007 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：