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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 59 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

794 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是141-150 订阅

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

详细简洁

排序：

Using a RESTful Messaging and Registry System to Support a Range a distributed Applications

Using a RESTful Messaging and Registry System to Support a R...

引用

international symposium on parallel and distributed Computing

作者： Mark Baker Garry Smith Matthew Grove Rahim Lakhoo Hugo Mills Carl Albing School of Systems Engineering University of Reading Reading UK

ISBN: (纸本)9781424444106

Tycho was conceived in 2003 in response to a need by the GridRM [1] resource-monitoring project for a ldquolight-weightrdquo, scalable and easy to use wide-area distributed registry and messaging system. Since Tycho's first release in 2006 a number of modifications have been made to the system to make it easier to use and more flexible. Since its inception, Tycho has been utilised across a number of application domains including widearea resource monitoring, distributed queries across archival databases, providing services for the nodes of a Cray supercomputer, and as a system for transferring multi-terabyte scientific datasets across the Internet. This paper provides an overview of the initial Tycho system, describes a number of applications that utilise Tycho, discusses a number of new utilities, and how the Tycho infrastructure has evolved in response to experience of building applications with it.

关键词： Virtual reality Application software Cryptography Peer to peer computing Java distributed computing Milling machines systems engineering and theory Electronic mail Monitoring

来源：评论

学校读者我要写书评

暂无评论

Representing service information in a collaborative KDD environment

Representing service information in a collaborative KDD envi...

引用

international symposium on Collaborative Technologies and systems

作者： Diamantini, Claudia Potena, Domenico Univ Politecn Marche Dipartimento Ingn Informat Gest & Automaz I-60131 Ancona Italy

ISBN: (纸本)9781424422487

The development of descriptive languages for resource characterization is one of the most active research field in distributed computer science. It is mainly considered in the so called Semantic Web scenario, where the availability of self-describing resources is seen to leverage integration, sharing and reuse. The semantic web vision can be applied to the Knowledge Discovery in databases (KDD) field as well, when collaboration among distributed resources has to be taken into account. The present paper takes this perspective, proposing a descriptive language for the characterization of KDD services, tools and algorithms. In order to do so, first a systematization of the bulk of information about services, tools and algorithms is given. Finally, the paper discusses how the language relates to existing standards and how it can be exploited to give support to users of a collaborative distributed environment.

关键词： Collaborative Knowledge Discovery in databases KDD service service oriented architecture algorithm ontology Tool Markup Language

来源：评论

学校读者我要写书评

暂无评论

Topo-Semantic Constraints Checking

Topo-Semantic Constraints Checking

引用

IEEE international symposium on parallel and distributed Processing with Applications

作者： Xiang, Li Priyanath, Kalum Guang, Men Chao Lovatt, Stephen Harbin Engn Univ Harbin Peoples R China Udagepola WSGrp Melbourne Vic Australia WSGrp Melbourne Vic Australia

ISBN: (纸本)9780769534718

In any Active Geographical Information System the reliability of any results of queries, analysis or reasoning depends on data quality (up-to-date data with properties of positional accuracy, consistency and so on). A system is built for violation detection under Topo-Semantic consistency with specific checking and correcting processes using a SSRO-Tree structure for spatial data access. Results indicate that the developed Constraint Violation Detection (CVD) system is powerful when compared with popular conventional systems. Three kinds of errors are identified which lead to three kinds of consistency, namely structural consisteny, geometric consistency and Topo-Semantic consistency.

关键词： Constraint rule R-Tree SSRo-Tree Spatial database Spatial join Spatial object Spatial query Spatial relation Topo-semantic integrity constraint Violation detection dimensional relationship space targets visual databases spatial data Data Quality Reasoning

来源：评论

学校读者我要写书评

暂无评论

On the Performance of parallel Neural Network Implementations on distributed Memory Architectures 08

On the Performance of Parallel Neural Network Implementation...

引用

8th IEEE international symposium on Cluster Computing and the Grid

作者： Ganeshamoorthy, K. Ranasinghe, D. N. Univ Colombo Sch Comp Dept Computat & Intelligent Syst Colombo 07 Sri Lanka

ISBN: (纸本)9781424442379

In this paper, we study the impact of multi processor memory systems in particular, the distributed memory (I)M) and virtual shared memory (VSM), on the implementation of parallel backpropagation neural network algorithms. In the first instance, neural network is partitioned into sub neural networks by applying a hybrid partitioning scheme. In the second, each partitioned network is evaluated with matrix multiplication. Three different sizes of neural networks are used and exchange rate prediction used as a reference problem. parallel implementations for each of the distributed memory and virtual shared memory scenarios is obtained. These algorithms are implemented on a high performance cluster, "Monolith" consisting of over 396 nodes. Programming is realized using Message Passing Interface (MPI) library and C-Linda. The partitioned, matrix multiplication has the fastest execution time, and DM/MPI implementation is always faster than the VSM/Linda equivalent. However in VSM/Linda it is possible to allow the parallel neural network to choose the optimum number of processors dynamically.

关键词： VSM DM Hybrid partition parallel neural network

来源：评论

学校读者我要写书评

暂无评论

Genetic Optimization of parallel FDTD Computations

Genetic Optimization of Parallel FDTD Computations

引用

7th international symposium on parallel and distributed Computing

作者： Smyk, Adam Tudruj, Marek Polish Japanese Inst Informat Technol PL-02008 Warsaw Poland

ISBN: (纸本)9780769534725

In this paper we present and compare two algorithms to transform and optimize the Finite Difference Time Domain (FDTD) method computations in irregular computational areas for multiprocessor systems. Both algorithms art, based oil a genetic approach with different design of chromosomes, In the first case, a chromosome represents a complete merging algorithm as a sequence of merging functions that are used to reduce a number of macro nodes. In the second case, a chromosome corresponds to an assignment of each macro node to specified processor. We have tested a mixed fitness function, which can switch between two sub functions: cut min value and difference between the maximally and minimally loaded macro nodes in an individual. As our experiments have shown, it allows to adjust the behavior of a genetic algorithm to the requirements of the computational system. We have tested both algorithms for multiprocessor systems with shared and distributed memory, with MPI and RDMA communication.

关键词： Chromosomes

来源：评论

学校读者我要写书评

暂无评论

Two Complementary Tools for the Formal Testing of distributed systems with Time Constraints 08

Two Complementary Tools for the Formal Testing of Distribute...

引用

12th IEEE/ACM international symposium on distributed Simulation and Real Time Applications

作者： Cavalli, Ana Rosa de Oca, Edgardo Montes Mallouli, Wissarn Lallali, Mounir Telecom SudParis Inst Telecom CNRS SAMOVAR Paris France Montimage Res Labs F-75013 Paris France

ISBN: (纸本)9780769534251

The complexity and the variety of the deployed time-dependent systems, as well as the high degree of reliability required for their global functioning, justify the care provided to the design of the best possible tests. Moreover;it is significant to automate these steps with an aim of reducing the time and the development cost and especially of increasing the reliability of the offered products. In this paper we present two different tools to test systems with time constraints. The first one allows to automatically generate test cases based on model-based active testing techniques. Whereas the second tool is based on passive testing approach to check that the collected system traces respect a silt of formal properties called Invariants.

关键词： Formal Testing Active and Passive Testing Real-Time systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

StoreGPU: Exploiting graphics processing units to accelerate distributed storage systems 08

StoreGPU: Exploiting graphics processing units to accelerate...

引用

17th international symposium on High Performance distributed Computing 2008, HPDC'08

作者： Al-Kiswany, Samer Gharaibeh, Abdullah Santos-Neto, Elizeu Yuan, George Ripeanu, Matei Electrical and Computer Engineering Department University of British Columbia Vancouver BC Canada

ISBN: (纸本)9781595939975

Today Graphics Processing Units (GPUs) are a largely underexploited resource on existing desktops and a possible cost-effective enhancement to high-performance systems. To date, most applications that exploit GPUs are specialized scientific applications. Little attention has been paid to harnessing these highly-parallel devices to support more generic functionality at the operating system or middleware level. This study starts from the hypothesis that generic middleware-level techniques that improve distributed system reliability or performance (such as content addressing, erasure coding, or data similarity detection) can be significantly accelerated using GPU support. We take a first step towards validating this hypothesis, focusing on distributed storage systems. As a proof of concept, we design StoreGPU, a library that accelerates a number of hashing based primitives popular in distributed storage system implementations. Our evaluation shows that StoreGPU enables up to eight-fold performance gains on synthetic benchmarks as well as on a high-level application: the online similarity detection between large data files. Copyright 2008 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

S²AN-WBN: An Innovative Hybrid P2P Location Network

S<SUP>2</SUP>AN-WBN: An Innovative Hybrid P2P Location Netwo...

引用

international symposium on Computer Science and Computational Technology

作者： Gao, Lei Zeng, Guangzhou Shandong Univ Sch Comp Sci & Technol Jinan 250100 Shandong Peoples R China

ISBN: (纸本)9780769534985

P2P workflow systems meet the development trend of workflow systems. The running path optimization (the path with the minimum running time which consists of the services discovery time and the task execution time) in full-distribution (decentralized) environments has been a bottleneck restricting the performance of P2P workflow systems. Aiming at this problem, this paper proposes a innovative hybrid P2P location network by introducing a novel structured P2P network which effectively reduces the service discovery time with one hop routing and the search bandwidth with 100% location precision at each step and a novel decentralized workload balance network which optimizes the tasks execution time at each step with little churns of network to P2P workflow systems for the first time to fit the global optimal running path with the sequence of the optimal single running steps.

关键词： parallel and distributed computing P2P network structured service addressable network workload balance network random graph

来源：评论

学校读者我要写书评

暂无评论

Dynamic testing of flow graph based parallel applications

Dynamic testing of flow graph based parallel applications

引用

6th Workshop on parallel and distributed systems: Testing, Analysis, and Debugging 2008, PADTAD'08

作者： Schaeli, Basile Hersch, Roger D. School of Computer and Communication Sciences CH-1015 Lausanne Switzerland

ISBN: (纸本)9781605580524

In message-passing parallel applications, messages are not delivered in a strict order. The number of messages, their content and their destination may depend on the ordering of their delivery. Nevertheless, for most applications, the computation results should be the same for all possible orderings. Finding an ordering that produces a different outcome or that prevents the execution from terminating reveals a message race or a deadlock. Starting from the initial application state, we dynamically build an acyclic message-passing state graph such that each path within the graph represents one possible message ordering. All paths lead to the same final state if no deadlock or message race exists. If multiple final states are reached, we reveal message orderings that produce the different outcomes. The corresponding executions may then be replayed for debugging purposes. We reduce the number of states to be explored by using previously acquired knowledge about communication patterns and about how operations read and modify local process variables. We also describe a heuristic that tests a subset of orderings that are likely to reveal existing message races or deadlocks. We applied our approach on several applications developed using the Dynamic parallel Schedules (DPS) parallelization framework. Compared to the naive execution of all message orderings, the use of a message-passing state graph reduces the cost of testing all orderings by several orders of magnitude. The use of prior information further reduces the number of visited states by a factor of up to fifty in our tests. The heuristic relying on a subset of orderings was able to reveal race conditions in all tested cases. We finally present a first step in generalizing the approach to MPI applications. Copyright 2008 ACM.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：