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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 软件工程
- 58 篇 信息与通信工程
- 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

语言

792 篇 英文
4 篇 其他

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

共 796 条记录，以下是381-390 订阅

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

详细简洁

排序：

Compression-domain parallel rendering

Compression-domain parallel rendering

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： T. Mitra Tzi-cker Chiueh School of Computing National University of Singapore Singapore Department of Computer Science State University of New York Stony Brook Stony Brook NY USA

The 3D triangle mesh is the dominant representation used in the parallel rendering of 3D geometric models. However, the explosive growth in the complexity of the mesh-based 3D models overwhelms the communication bandwidth of existing parallel rendering systems. An effective solution to this problem is to use a compressed mesh representation. In recent years, researchers have shown a great deal of interest in developing highly efficient mesh compression algorithms. However, using a compressed mesh in a parallel rendering architecture to achieve the highest possible end-to-end performance is a largely unexplored area. We have previously (1998, 2000) developed an efficient mesh compression/decompression algorithm, called "breadth-first traversal" (BFT). In this paper, we design and implement a parallel rendering architecture that can use a BFT mesh representation. The enabling technology is a novel algorithm that can perform a compression-domain subdivision of the BFT mesh for bandwidth-efficient distribution of submeshes to parallel processors. parallel rendering using a BFT mesh reduces the communication requirement to about one third of that of uncompressed representation.

关键词： Tiles Compression algorithms Rendering (computer graphics) Pipelines Graphics Sorting Concurrent computing Image converters Computer science Solid modeling

来源：评论

学校读者我要写书评

暂无评论

Leveraging run time knowledge about event rates to improve memory utilization in wide area data stream filtering

Leveraging run time knowledge about event rates to improve m...

引用

international symposium on High Performance distributed Computing

作者： B. Plale Computer Science Department Indiana University Bloomington IN USA

The dQUOB system conceptualization of data streams as database and its SQL interface to data streams is an intuitive way for users to think about their data needs in a large scale application containing hundreds if not thousands of data streams. Experience with dQUOB has shown the need for more aggressive memory management to achieve the scalability we desire. This paper addresses the problem with a two-fold solution. The first one is replacement of the existing first-come first-served scheduling algorithm with an earliest job first algorithm which we demonstrate to yield better average service time. The second one is an introspection algorithm that sets and adapts the sizes of join windows in response to the knowledge acquired at runtime about event rates. In addition to the potential for significant improvements in memory utilization, the algorithm presented here also provides a means by which the user can reason about join window sizes. Wide area measurements demonstrate the adaptive capability required by the introspection technique.

关键词： Scalability Scheduling algorithm Relational databases Filtering Computer science Large-scale systems Application software Memory management Runtime Wide area measurements

来源：评论

学校读者我要写书评

暂无评论

OntoRama: Browsing RDF ontologies using a hyperbolic-style browser

OntoRama: Browsing RDF ontologies using a hyperbolic-style b...

引用

international Conference on Cyberworlds

作者： P. Eklund N. Roberts S. Green School of Information Technology and Electrical Engineering University of Queensland Saint Lucia QLD Australia Distributed Systems Technology Centre Private Limited University of Queensland Saint Lucia QLD Australia

This paper presents a Java-based hyperbolic-style browser designed to render RDF files as structured ontological maps. The program was motivated by the need to browse the content of a web-accessible ontology server: WEB KB-2. The ontology server contains descriptions of over 74,500 object types derived from the WordNet 1.7 lexical database and can be accessed using RDF syntax. Such a structure creates complications for hyperbolic-style displays. In WEB KB-2 there are 140 stable ontology link types and a hyperbolic display needs to filter and iconify the view so different link relations can be distinguished in multi-link views. Our browsing tool, OntoRama, is therefore motivated by two possibly interfering aims: the first to display up to 10 times the number of nodes in a hyperbolic-style view than using a conventional graphics display; secondly, to render the ontology with multiple links comprehensible in that view.

关键词： Resource description framework Ontologies Displays Java Tree graphs Australia Visualization Navigation Information technology databases

来源：评论

学校读者我要写书评

暂无评论

Armada: A parallel file system for computational grids

Armada: A parallel file system for computational grids

引用

1st IEEE/AMC international symposium on Cluster Computing and the Grid

作者： Oldfield, R Kotz, D Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA

ISBN: (纸本)0769510108;0769510116

High-performance distributed computing appears to be shifting away from tightly-connected supercomputers to "computational grids" composed of heterogeneous systems of networks, computers, storage devices, and various other devices that collectively act as a single geographically distributed "virtual" computer One of the great challenges for this environment is providing efficient parallel data access to remote distributed datasets. In this paper, we discuss some of the issues associated with parallel I/O and computatational grids and describe the design of a flexible parallel file system that allows the application to control the behavior and functionality of virtually all aspects of the file system.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Stability of 2-D distributed processes with time-variant communication delays

Stability of 2-D distributed processes with time-variant com...

引用

2001 IEEE international symposium on Circuits and systems, ISCAS 2001

作者： Bauer, Peter H. Sichitiu, Mihail L. Premaratne, Kamal Dept. of Electr. Eng. Notre Dame Univ. Notre Dame IN 46556 United States Dept. of Electrical and Computer Engineering University of Miami Coral Gables FL 33124 United States

ISBN: (纸本)0780366859

Motivated by the applications of parallel and distributed computing in m-D systems, this paper analyzes the effect of time-variant communication delays on the stability of 2-D systems. The time-variant communication delays are at first modeled and then used in the formulation of the 2-D Roesser local state space model. The arising overall dynamic system model is of uncertain, shift-variant form and it is described by finite uncertainty sets. The result is a sufficient condition for stability of the described process. © 2001 IEEE.

关键词： State space methods

来源：评论

学校读者我要写书评

暂无评论

R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases 01

R-tree-based data migration and self-tuning strategies in sh...

引用

ACM-GIS 2001: proceedings of the Ninth ACM international symposium on: Advances in Geographic Information systems

作者： Mondal, Anirban Kitsuregawa, Masaru Ooi, Beng Chin Tan, Kian Lee Department of Computer Science National University of Singapore Singapore Singapore

ISBN: (纸本)9781581134438

In order to provide fast and timely answers to queries in the context of spatial databases and GIS, we present our solution for effective data migration and tuning strategies in shared-nothing parallel spatial databases. Our purpose is to improve the performance of the indexes. Our approach has the following features. first, our scheme is self-tuning, dynamic as well as query-centric and it can adapt to dynamically changing user access patterns. Second, a global distributed R-tree-based indexing method is employed to facilitate effective data migration. Third, unlike traditional partitioning strategies where each processing element (PE) contains data from a single region of space, we allow each PE to store data from multiple and disjoint regions. This minimizes overlap in regions as well as coverage. We implemented the proposed scheme and conducted an extensive performance study on Fujitsu's AP3000 machine with 32 workstations using real datasets. Our experimental results show that our load-balancing strategy can distribute the load effectively across the PEs in the system, thereby reducing response times of incoming queries.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling parallel applications using malleable tasks on clusters 15

Scheduling parallel applications using malleable tasks on cl...

引用

15th international parallel and distributed Processing symposium, IPDPS 2001

作者： Trystram, D. ID-IMAG 51 avenue Jean Kuntzmann Montbonnot Saint Martin38330 France

ISBN: (纸本)0769509908

Scheduling is a central issue for implementing applications on parallel and distributed systems. This problem has been intensively studied for conventional parallel systems. Clusters of SMP (symmetric Multi-Processors) are a cost effective alternative to parallel supercomputers which are more and more popular. New characteristics are influencing the execution of parallel applications, like for instance the hierarchical structure and the heterogeneity of the processors. Communications between SMP usually need some important latencies that create large communication delays. Designing efficient software that take full advantage of such systems remains difficult. The model of malleable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications on conventional systems. Here, the target application is considered at a larger level of granularity than in other models (corresponding typically to numerical routines) where the tasks can themselves be executed in parallel. In this paper, we are interested in designing efficient low-cost scheduling algorithms for implementing parallel applications for clusters. We first discuss the problems that occur while scheduling an application on parallel systems and give a classification of applications leading to various scheduling problems. For each of these problems, we will use the same methodology for optimizing the resource utilization of parallel programs. © 2001 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

On the use of mobile code technology for monitoring Grid system

On the use of mobile code technology for monitoring Grid sys...

引用

1st IEEE/AMC international symposium on Cluster Computing and the Grid

作者： Tomarchio, O Vita, L Univ Catania Dipartimento Ingn Informat & Telecomunicaz I-95125 Catania Italy

ISBN: (纸本)0769510116

Grid systems are becoming the underlying infrastructure for many high-performance distributed scientific, applications. Resources in these systems have heterogeneous features, are connected by potentially unreliable networks, and are often under different administrative management domains. These remarks show how a new generation of techniques, mechanisms and tools need to he considered, that can cope with the complexity of such systems and provide the performances suitable for scientific computing applications. In this paper, an architecture for monitoring services in Grid environments based on mobile agent technology is presented, One of the most interesting aspects of the proposed approach is the possibility of customizing the parameters to be monitored. After describing the general framework where agents will execute, an application for improving the capabilities of traditional network monitoring paradigms will be presented.

关键词： Grid mobile agents monitoring Java distributed management

来源：评论

学校读者我要写书评

暂无评论

Scheduling aspects for image retrieval in cluster-based image databases

Scheduling aspects for image retrieval in cluster-based imag...

引用

1st IEEE/AMC international symposium on Cluster Computing and the Grid

作者： Kao, O Steinert, G Drews, F Tech Univ Clausthal Dept Comp Sci D-38678 Clausthal Zellerfeld Germany

ISBN: (纸本)0769510108;0769510116

systems for the archival and retrieval of images are used in many areas, for example medical applications, news agencies, etc. The state-of-the-art approach for image description considers a priori extracted features. The disadvantageous reduction of the image content onto a few low-level features limits the applicability of image databases. A search for objects and other important image components requires dynamic feature extraction. The related computational and storage requirements exceed the possibilities Of computer architectures with a single processing element. Therefore we developed a cluster platform, which supports the implementation of this novel retrieval approach in existing systems. In this paper ve introduce the basic principles of image retrieval with dynamic feature extraction and a cluster platform. The main focus regards thereby the workload balancing across the cluster For this purpose ive developed a scheduling heuristic and executed performance measurements with the implemented prototype. The obtained results are discussed in the last part of this paper.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Fast and scalable parallel algorithms for matrix chain product and matrix powers on distributed memory systems 15

Fast and scalable parallel algorithms for matrix chain produ...

引用

15th international parallel and distributed Processing symposium, IPDPS 2001

作者： Li, Keqin Department of Computer Science State University of New York New PaltzNY12561-2440 United States

ISBN: (纸本)0769509908

Given N matrices A1, A2,..., AN of size NxN, the matrix chain product problem is to compute A1 x A2 xx AN. Given an N x N matrix A, the matrix powers problem is to calculate the first N powers of A, i.e., A, A2, A3,..., AN. We consider distributed memory systems (DMS) with p processors that can support one-to-one communications in O(T(p)) time. Assume that the time complexity of the best known sequential algorithm for matrix multiplication is O(Nα), where αα+1/log N. We show that the two problems can be solved on a p-processor DMS in Tchain(N,p)=O(Nα+1/p+T(p)(N2(1+1/α)/p2/α(log p/N)1-2/α+log(p log N/Nα) log N)) and Tpower(N,p)=0(Nα+1/p+T(p)(N2(1+1/α)/p2/α(log p/log N)1-2/α+(log N)2)) times, respectively. We also give instantiation of the above results in distributed memory parallel computers and DMS with hypercubic networks, and show that our parallel algorithms are either fully scalable or highly scalable. © 2001 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：