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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,501 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,574 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,572 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2574 条记录，以下是2211-2220 订阅

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

详细简洁

排序：

Achieving scalability in parallel tabled logic programs 16

Achieving scalability in parallel tabled logic programs

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Rocha, R. Silva, F. Costa, V.S. DCC-FC LIACC Universidade do Porto Portugal COPPE Systems Universidade do Rio de Janeiro Brazil

ISBN: (纸本)0769515738

Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming because it addresses some of the most significant weaknesses of Prolog. Namely, it can guarantee termination for programs with the bounded term-size property. Tabled programs exhibit a more complex execution mechanism than traditional Prolog's left-to-right search with backtracking. the reason is that Prolog programs are highly recursive and generate multiple answers. this rather involved execution mechanism requires a more complex implementation than traditional Prolog. the declarative nature of tabled logic programming suggests that it might be amenable to parallel execution. On the other hand, the complexity of the tabling mechanism, and the existence of a shared resource, the table, argues that parallelism might be limited, and that performance for real applications might never scale. In this work we prove that parallel tabling is indeed scalable for real applications by experimenting the OPTYap parallel tabled system on a scalable shared-memory machine. © 2002 ieee.

关键词： parallel Logic Programming Tabling

来源：评论

学校读者我要写书评

暂无评论

Scalability of a distributed neural information retrieval system 11

Scalability of a distributed neural information retrieval sy...

引用

11th ieee international symposium on High Performance distributed Computing (HPDC-11)

作者： Weeks, M Hodge, VJ Austin, J Univ York Dept Comp Sci York YO1 5DD N Yorkshire England

ISBN: (纸本)0769516866

Summary form only given. AURA (Advanced Uncertain Reasoning Architecture) is a generic family of techniques and implementations intended for high-speed approximate search and match operations on large unstructured datasets. AURA technology is fast, economical, and offers unique advantages for finding near-matches not available with other methods. AURA is based upon a high-performance binary neural network called a correlation matrix memory (CMM). Typically, several CMM elements are used in combination to solve soft or fuzzy pattern-matching problems. AURA takes large volumes of data and constructs a special type of compressed index. AURA finds exact and near-matches between indexed records and a given query, where the query itself may have omissions and errors. the degree of nearness required during matching can be varied through thresholding techniques. the PCI-based PRESENCE (parallel Structured Neural Computing Engine) card is a hardware-accelerator architecture for the core CMM computations needed in AURA-based applications. the card is designed for use in low-cost workstations and incorporates 128 MByte of low-cost DRAM for CMM storage. To investigate the scalability of the distributed AURA system, we implement a word-to-document index of an AURA-based information retrieval system, called MinerTaur, over a distributed PRESENCE CMM. © 2002 ieee.

关键词： Aircraft Artificial neural networks Computer architecture Computer science Concurrent computing Coordinate measuring machines Environmental economics Information retrieval Neural networks Scalability

来源：评论

学校读者我要写书评

暂无评论

A map-based dead-reckoning protocol for updating location information 16

A map-based dead-reckoning protocol for updating location in...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Leonhardi, A. Nicu, C. Rothermel, K. Breitwiesenstr. 20-22 Stuttgart70565 Germany

ISBN: (纸本)0769515738

An important aspect of location-aware services is the management of location information. To this end, location information needs to be transferred from a mobile device, which determines this information by means of a local positioning sensor (such as GPS), to a location service, where the location information can be queried by applications. Because bandwidth in wide area mobile communications is still scarce and expensive, it is important to use an update protocol that requires as few messages as possible while still guaranteeing a desired accuracy of the location information. To decrease the number of necessary update messages, so-called dead-reckoning strategies have been proposed. In this paper we give an overview of different variants of dead-reckoning protocols for updating location information and propose a new mapbased protocol. While a simple dead-reckoning protocol already reduces the number of update messages in some cases by up to 83%, the map-based protocol further reduces their number by again up to 60% and is able to sustain these improvements for non-uniform movement. © 2002 ieee.

关键词： dead-reckoning location service location update protocols location-aware applications

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the ieee international symposium on High Performance distributed Computing

Proceedings of the IEEE International Symposium on High Perf...

引用

11th ieee international symposium on High Performance distributed Computing, HPDC 2002

ISBN: (纸本)0769516866

the proceedings contain 54 papers. the topics discussed include: flexibility, manageability and performance in a grid storage appliance;distributed computing with load-managed active storage;a decentralized, adaptive replica location mechanism;adaptive timeout discovery using the network weather service;dynamic right-sizing in FTP (drsFTP): enhancing grid performance in user-space;QoS-based resource discovery in intermittently available environments;a scalable QoS-aware service aggregation model for peer-to-peer computing grids;interactive and descriptor-based deployment of object-oriented grid applications;partitionable services: a framework for seamlessly adapting distributed applications to heterogeneous environments;using kernel couplings to predict parallel application performance;using semantic information to guide efficient parallel I/O on clusters;backtracking and re-execution in the automatic debugging of parallelized programs;and leveraging run time knowledge about event rates to improve memory utilization in wide area data stream filtering.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pattern recognition tool to detect reconfigurable patterns in MPEG4 video processing 16

Pattern recognition tool to detect reconfigurable patterns i...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Akoglu, A. Dasu, A. Sudarsanam, A. Srinivasan, M. Panchanathan, S. Visual Computing and Communications Laboratory Arizona State University United States

ISBN: (纸本)0769515738

Current approaches towards building a reconfigurable processor are targeted towards general purpose computing or a limited range of media specific applications and are not specifically tuned for mobile multimedia applications. the increasing demand for mobile multimedia processing with stringent constraints for low power, low chip area and high flexibility at both the encoder and decoder naturally demand the design and development of a dynamically reconfigurable multimedia processor. We have performed a detailed complexity analysis of the MPEG-4 video coding mode which has illustrated the potential for reconfigurable computing. We have recently proposed a methodology for designing a reconfigurable media processor. this involves the design of a parser that identifies data/control flow graphs generated from the input assembly code of an UltraSPARC V-9 architecture;recurring pattern analyzer that uses a clustering based approach to identify specific sequences of operations that can potentially be implemented in hardware;and finally a count of such modules at every level of granularity with the associated weights based on the complexity of computation and data transfers used by partitioner and router. In this paper we then propose the design of the parser and pattern recognizer with results for detecting the reconfigurable patterns in MPEG4. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A multithreaded concurrent garbage collector parallelizing the new instruction in Java 16

A multithreaded concurrent garbage collector parallelizing t...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Lo, C.-T.D. Srisa-An, W. Chang, J.M. Department of Computer Science Illinois Institute of Technology ChicagoIL60616-3793 United States

ISBN: (纸本)0769515738

parallel, multithreaded Java applications such as Web servers, database servers, and scientific applications are becoming increasingly prevalent. Most of them have high object instantiation rates through the new bytecode that is implemented in a garbage collection subsystem typically. For aforementioned applications, traditional garbage collectors are often the bottleneck that limits program performance and processor utilization on multiprocessor systems. they suffer from long garbage collection pauses (stop-the-world mark-sweep algorithm) or inability of collecting cyclic garbage (reference counting approach). Generational garbage collection, however, is based only on the weak generational hypothesis that most objects die young. In this paper, a new multithreaded concurrent generational garbage collector (MCGC) based on mark-sweep with the assistance of reference counting is proposed. the MCGC can take advantage of multiple CPUs in an SMP system and the merits or light weight processes. Furthermore, the long garbage collection pause can be reduced and the garbage collection efficiency can be enhanced. © 2002 ieee.

关键词： concurrent garbage collection dynamic memory management Java Virtual Machine multithreaded programming object-oriented programming parallel garbage collector

来源：评论

学校读者我要写书评

暂无评论

An efficient schedulability analysis policing technique for periodic, dynamic real-time applications 16

An efficient schedulability analysis policing technique for ...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Huh, Eui-Nam Welch, L.R. Pfarr, B. Department of Computer Science Sahmyook University Seoul Korea Republic of School of Electrical Engineering and Computer Science Ohio University AthensOH45701 United States Real-Time Software Engineering Branch NASA/GSFC United States

ISBN: (纸本)0769515738

Schedulability Analysis (SA) approaches that are based on a priori information and use fixed execution times with constant workloads work well in many application domains and allow pre-deployment guarantees of real-time performance such as Rate Monotonic Analysis (RMA [2]). However, certain real-time applications must operate in highly dynamic environments, thereby precluding accurate characterization of workloads by static models. this leads to the notion that a new SA trigger for dynamic environments, in which applications experience large variations in the workload, needs to guarantee real-time performance during run-time. this paper examines the case of periodic, dynamic real-time systems, and describes an efficient SA policing technique which can trigger SA appropriately, and uses a dynamic threshold which becomes sensitive when the quality of service (QoS) of the dynamic real-time application approaches its deadline. © 2002 ieee.

关键词： dynamic execution time quality of service real-time performance schedulability analysis workload

来源：评论

学校读者我要写书评

暂无评论

A distributed primary-segmented backup scheme for dependable real-time communication in multihop net 16

A distributed primary-segmented backup scheme for dependable...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Ranjith, G. Krishna, G.P. Ram Murthy, C.S. Department of Computer Science and Engg. Indian Institute of Technology Madras Chennai600036 India Department of Computer Science and Engg. University of Washington SeattleWA98195-3530 United States

ISBN: (纸本)0769515738

Several distributed real-time applications require fault-tolerance apart from guaranteed timeliness, at acceptable levels of overhead. these applications require hard guarantees on recovery delays, due to network component failures, which cannot be ensured in traditional datagram services. Several schemes exist which attempt to guarantee failure recovery in a timely and resource efficient manner. these methods center around a priori reservation of network resources called spare resources along a backup channel, in addition to each primary communication channel. this backup channel is usually routed along a path disjoint with the primary channel. In this paper, we propose a distributed method of segmented backups for dependable real-time communication in multihop networks, which improves upon existing methods in terms of network resource utilization, average call acceptance rate, scalability and provides better QoS guarantees on bounded failure recovery time and propagation delays, without any compromise in fault-tolerance levels. the distributed algorithm is one of finding a "minimal path" based on flooding with a cut-out mechanism that does not relay messages if they came along longer paths than those known. We further show that the complexity of the distributed algorithm is bounded and acceptable. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Capturing causality by compressed vector clock in real-time group editors 16

Capturing causality by compressed vector clock in real-time ...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Sun, Chengzheng Cai, Wentong School of Computing and Information Tech. Griffith University BrisbaneQLD4111 Australia School of Computer Engineering Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)0769515738

Real-time group editors allow a group of users to view and edit the same document at the same time over the Internet. they are a special class of distributed applications in the area of groupware. A vector logical clock is a powerful technique to capture causality in distributed computing systems. In general, the minimum size of a vector clock is the number of communicating processes in a distributed system (N). In this paper, we propose a novel technique to compress the vector size from N to a constant (2) by means of operational transformation - an innovative technique invented by groupware research for consistency maintenance in real-time group editors. We show how compressed vector clocks can be used as an effective and efficient means for operation time-stamping and concurrency detection in group editors. the proposed technique has been implemented in a Web-based real-time group editor which allows an arbitrary number of users to participate a collaborative editing session. the basic ideas and techniques of this work may be generalized and are potentially applicable to other distributed computing systems and applications. © 2002 ieee.

关键词： distributed systems operational transformation real-time group editors vector logical clock Web-based applications

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling parallel loops with variable iterate execution times 16

Dynamic scheduling parallel loops with variable iterate exec...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Cariño, R.L. Banicescu, I. MSU-NSF Engineering Research Center Mississippi State University United States Institute of Computer Science University of the Philippines Los Baños Philippines Department of Computer Science Mississippi State University United States

ISBN: (纸本)0769515738

To improve performance of scientific applications in parallel and distributed environments, dynamic scheduling algorithms for parallel loops have been proposed. Such algorithms address performance degradations due to load imbalance caused by predictable phenomena like nonuniform data distribution or algorithmic variance, and unpredictable phenomena such as data access latency or operating system interference. In particular, algorithms such as factoring, weighted factoring, adaptive weighted factoring, and adaptive factoring have been developed based on a probabilistic analysis of parallel loop iterates with variable running times. these algorithms execute the iterates in variable size chunks, where the sizes are determined such that the chunks complete before the optimal time with a high probability. these algorithms have successfully been implemented in a number of scientific applications such as: N-Body and Monte Carlo simulations, CFD, and radar signal processing. this paper presents a comparative study of the performance of various loop scheduling algorithms in a message-passing environment. the algorithms have been integrated into a tool for executing parallel loops, and the tool applied in profiling quadrature routines that are often used in scientific computations such as finite element methods, particle physics, and multivariate statistics. Experimental results reveal the effectiveness and robustness of the latest developed scheduling algorithms over the previous ones on loops with irregular iterate execution times. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 218 219 220 221 222 223 224 225 226 227 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：