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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

语言

788 篇 英文
8 篇 其他

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

共 796 条记录，以下是331-340 订阅

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

详细简洁

排序：

Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications

Improved methods for divisible load distribution on k-dimens...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Keqin Li Department of Computer Science State University of New York New Paltz NY USA

ISBN: (纸本)0769519261

We give the closed form solutions to the parallel time and speedup of the classic method for processing divisible loads on linear arrays as functions of N, the network size. We propose two methods which employ pipelined communications to distribute divisible loads on linear arrays. We derive the closed form solutions to the parallel time and speedup for both methods and show that the asymptotic speedup of both methods is /spl beta/+1, where /spl beta/ is the ratio of the time for computing a unit load to the time for communicating a unit load Such performance is even better than that of the known methods on k-dimensional meshes with k>1. The two new algorithms which use pipelined communications are generalized to distribute divisible loads on k-dimensional meshes, and we show that the asymptotic speedup of both algorithms is k/spl beta/+1, where k/spl ges/1. We also prove that on k-dimensional meshes where k/spl ges/1, as the network size becomes large, the asymptotic speedup of 2k/spl beta/+1 can be achieved for processing divisible loads by using interior initial processors.

关键词： Closed-form solution Computer networks distributed computing Concurrent computing Multimedia databases Multiprocessor interconnection networks parallel processing Computer science Large-scale systems Signal processing

来源：评论

学校读者我要写书评

暂无评论

Importance of SIMD computation reconsidered

Importance of SIMD computation reconsidered

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： W.C. Meilander J.W. Baker Mingxian Jin Department of Computer Science Kent University Kent OH USA

In this paper, SIMD and MIMD solutions for the real-time database management problem of air traffic control are compared. A real-time database system is highly constrained in a multiprocessor and access to the common database must be made to a limited number of data elements at a time. This MIMD database access is contrasted with the comparable SIMD common database access, which can be several hundred times greater. This is true because the SIMD can simultaneously access thousands of pertinent records instead of the limited number in the MIMD. A relatively simple example is given of a problem that has a polynomial time solution using a SIMD but for which a polynomial time solution using a MIMD is normally impossible. The fact that SIMD can support a polynomial time solution for the air traffic control problem but this problem is normally considered to be intractable for multiprocessors argues against the common belief that MIMD have greater power than SIMD. SIMD are more efficient and powerful for some critically important application areas.

关键词： Polynomials databases Air traffic control Optimal scheduling Dynamic scheduling Concurrent computing Broadcasting Scheduling algorithm Computer science Real time systems

来源：评论

学校读者我要写书评

暂无评论

Several parallel algorithms for solving nonlinear systems with symmetric and positive definite Jacobians

Several parallel algorithms for solving nonlinear systems wi...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： J. Peinado A.M. Vidal Departamento de Sistemas Informáticos y Computación Universidad Politécnica de Valencia Valencia Spain

In this work we describe two sequential algorithms and their parallel counterparts for solving nonlinear systems, when the Jacobian matrix is symmetric and positive definite. This case appears frequently in unconstrained optimization problems. Both algorithms are based on Newton's method. The first solves the inner iteration with Cholesky decomposition while the second is based on the inexact Newton methods family, where a preconditioned CG method has been used for solving the linear inner iteration. In this latter case and to control the inner iteration as far as possible and avoid the oversolving problem, we also parallelized several forcing term criteria and used parallel preconditioning techniques. We implemented the parallel algorithms using the SCALAPACK library. Experimental results have been obtained using a cluster of Pentium II PC connected through a Myrinet network. To test our algorithms we used four different problems. The algorithms show good scalability in most cases.

关键词： parallel algorithms Nonlinear systems Jacobian matrices Clustering algorithms Libraries Large-scale systems Character generation Testing Iterative algorithms Newton method

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of two emerging media processors: VIRAM and Imagine

Performance evaluation of two emerging media processors: VIR...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S. Chatterji M. Narayanan J. Duell L. Oliker Computer Science Division University of California Berkeley CA USA Computer Science Research Division Lawrence Berkeley National Laboratory Berkeley CA USA

This work presets two emerging media microprocessors, VIRAM and Imagine, and compares the implementation strategies and performance results of these unique architectures. VIRAM is a complete system on a chip which uses PIM technology to combine vector processing with embedded DRAM. Imagine is a programmable streaming architecture with a specialized memory hierarchy designed for computationally intensive data-parallel codes. first, we preset a simple and effective approach for understanding and optimizing vector/stream applications. Performance results are then presented from a number of multimedia benchmarks and a computationally intensive scientific kernel. We explore the complex interactions between programming paradigms, the architectural support at the ISA level and the underlying microarchitecture of these two systems. Our long term goal is to evaluate leading media microprocessors as possible building blocks for future high performance systems.

关键词： Streaming media Computer architecture Computer science Instruction sets Microarchitecture Signal processing algorithms Kernel parallel processing Delay Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Sparse WDM optical interconnects under wavelength-based model

Sparse WDM optical interconnects under wavelength-based mode...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Yuanyuan Yang Jianchao Wang Department of Electrical & Computer Engineering State University of New York Stony Brook NY USA Data Treasury Corporation Melville NY USA

ISBN: (纸本)0769519261

Optical communication, in particular, wavelength division multiplexing (WDM) technique, has become a promising networking choice to meet ever-increasing demands on bandwidth from emerging bandwidth-intensive computing/communication applications. As optics become a major networking media in all communications needs, optical interconnects will inevitably play an important role in interconnecting processors in parallel and distributed computing systems. In this paper, we consider cost-effective designs of WDM optical interconnects for current and future generation parallel and distributed computing and communication systems. We first classify WDM optical interconnects into two different connection models based on their target applications: the wavelength-based model and the fiber-link-based model. We then focus on the wavelength-based model and present a minimum cost design for WDM optical interconnects by using sparse crossbar switches instead of full crossbar switches in combination with wavelength converters. We also show another design which can trade-off the switch cost with wavelength converter cost in this type of WDM optical interconnect.

关键词： Wavelength division multiplexing Optical interconnections Optical design Costs Optical switches Optical fiber communication distributed computing Optical wavelength conversion Bandwidth Computer applications

来源：评论

学校读者我要写书评

暂无评论

parallel ROLAP data cube construction on shared-nothing multiprocessors

Parallel ROLAP data cube construction on shared-nothing mult...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Ying Chen F. Dehne T. Eavis A. Rau-Chaplin Dalhousie University Halifax Canada Carleton University Ottawa Canada

The pre-computation of data cubes is critical to improving the response time of on-line analytical processing (OLAP) systems and can be instrumental in accelerating data mining tasks in large data warehouses. In order to meet the need for improved performance created by growing data sizes, parallel solutions for generating the data cube are becoming increasingly important. The paper presents a parallel method for generating data cubes on a shared-nothing multiprocessor. Since no (expensive) shared disk is required, our method can be used on low cost Beowulf style clusters consisting of standard PCs with local disks connected via a data switch. Our approach uses a ROLAP representation of the data cube where views are stored as relational tables. This allows for tight integration with current relational database technology. We have implemented our parallel shared-nothing data cube generation method and evaluated it on a PC cluster, exploring relative speedup, local vs. global schedule trees, data skew, cardinality of dimensions, data dimensionality, and balance tradeoffs. For an input data set of 2000000 rows (72 Megabytes), our parallel data cube generation method achieves close to optimal speedup; generating a full data cube of /spl ap/227 million rows (5.6 Gigabytes) on a 16 processors cluster in under 6 minutes. For an input data set of 10,000,000 rows (360 Megabytes), our parallel method, running on a 16 processor PC cluster, created a data cube consisting of /spl ap/846 million rows (21.7 Gigabytes) in under 47 minutes.

关键词： Switches Delay Instruments Acceleration Data mining Data warehouses Costs Personal communication networks Relational databases Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

RMIX: a multiprotocol RMI framework for Java

RMIX: a multiprotocol RMI framework for Java

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D. Kurzyniec T. Wrzosek V. Sunderam A. Slominski Department of Math and Computer Science Emory University Atlanta GA USA Department of Computer Science Indiana University Bloomington IN USA

With the increasing adoption of Java for parallel and distributed computing, there is a strong motivation for enhancing the expressive elegance of the RMI paradigm with flexible and adaptable communication substrates. Java RMI is an especially powerful and semantically comprehensive framework for distributed Java applications - but the default Java RMI implementation is bound to a concrete wire protocol, JRMP, that is neither interoperable nor very efficient. To address the first issue, libraries have been proposed that provide RMI semantics over different wire protocols such as SOAP or IIOP, making Java interoperable with Web Services and CORBA. Similarly, alternative high performance RMI implementations have been developed. However, none of these solutions are designed to work cooperatively, and each imposes specific constraints on developers. This paper describes RMIX: an RMI framework that supports a variety of dynamically pluggable wire transports underlying a common and uniform RMI facade. RMIX facilitates dynamic protocol negotiation in loosely coupled parallel and distributed systems, and enables the development and deployment of applications that are multiprotocol by nature. Additionally, RMIX offers some enhancements to RMI semantics that are particularly useful in multiuser environments. We describe the design and preliminary implementation of RMIX, present two prototype protocol providers based on the JRMP and SOAP protocols, and outline a transition path from legacy RMI applications to RMIX.

关键词： Java Wire distributed computing Libraries Simple object access protocol Web services Computer science Dynamic programming Concrete Prototypes

来源：评论

学校读者我要写书评

暂无评论

parallel multi-dimensional ROLAP indexing 03

Parallel multi-dimensional ROLAP indexing

引用

IEEE/ACM international symposium on Cluster Computing and the Grid (CCGRID)

作者： F. Dehne T. Eavis A. Rau-Chaplin School of Computer Science Carleton University Ottawa Canada Faculty of Computer Science Dalhousie University Halifax Canada

ISBN: (纸本)9780769519197

This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to implement, requires only a small communication volume, and is fully adapted to distributed disks. Our solution is efficient for spatial searches in high dimensions and scalable in terms of data sizes, dimensions, and number of processors. Our method is also incrementally maintainable. Using "surrogate" group-bys, it allows for the efficient processing of arbitrary OLAP queries on partial cubes, where not all of the group-bys have been materialized. Our experiments show that the ROLAP advantage of better scalability, in comparison to MOLAP can be maintained while providing, at the same time, a fast and flexible index for OLAP queries.

关键词： Indexing Scalability Computer science Lattices Large-scale systems Decision support systems Delay Data warehouses Relational databases Middleware

来源：评论

学校读者我要写书评

暂无评论

Approximate search engine optimization for directory service

Approximate search engine optimization for directory service

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Kai-Hsiang Yang Chi-Chien Pan Tzao-Lin Lee Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan R.O.C.

ISBN: (纸本)0769519261

Today, in many practical e-commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short strings is not the same as searching within longer strings. General search engines try their best to scan all long strings (or articles) quickly, and find out the places that match the search conditions. Some great online search algorithms (such as "agrep" as used inside glimpse, or "cgrep " as used inside compressed indices, or 'NR-grep') are proposed for searching without any indices in the sub-linear time O(n). However, for short strings (n is small), the practical performance of algorithms of O(n) and O(n) are much the same. Therefore, suitable indices are necessary to optimize the performance of the search engine. On the other hand, directory services are more and more important because of its optimization for searching data. The data stored in directory servers are almost short strings. The approximate search engine for directory service must take the properties of short strings into considerations. In our previous research, we have designed one approximate search engine especially for short strings by using filters to filter out the possible short strings, and then checking for the answers. However the performance of the previous search engine needs to be enhanced. In this paper, we propose new architecture and algorithm to optimize the performance of searching for directory service.

关键词： Search engines Signal processing algorithms databases Computer science Filters Pattern matching Telephony Application software Computational biology Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Flat-distributed network architecture (FDNet) for rescue robots - FDNet and its implementation

Flat-distributed network architecture (FDNet) for rescue rob...

引用

IEEE international symposium on Computational Intelligence in Robotics and Automation (CIRA)

作者： Y. Koji S. Tadokoro K. Tokuda A. Pujol T. Toda H. Nobuhiro M. Konyo T. Takamori Graduate school of Science and Technology Kobe University Japan Department of Computer and Systems Engineering Kobe University Japan Faculty of Economics Kobe University Japan

This paper deals with flat-distributed architecture for a rescue robot. This architecture provides the rescue robot with intelligence and flexibility. When this architecture is used, the robot system is described using networks. These networks are composed by data and processing agents. The data, referred to as "data", is a distributed component. The processing agents, referred to as "relation", are a distributed and parallel-processing component, which can refer to any existing data. We consider nodes that can formally connect to any other node, and relations that can be organized according to human's or any other network's pattern. This architecture was called "FDNet(Flat-distributed Networks for Rescue System)". first, we describe the proposition of the architecture and its implementation for a robot. Then we report some experimental results. We provide this architecture for any intelligent rescue system.

关键词： Intelligent robots Educational institutions Computer architecture Computer networks systems engineering and theory Earthquakes Intelligent systems Protocols Intelligent networks Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：