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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是111-120 订阅

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

详细简洁

排序：

PPerfGrid: A grid services-based tool for the exchange of heterogeneous parallel performance data

PPerfGrid: A grid services-based tool for the exchange of he...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Hoffman, John J. Byrd, Andrew Mohror, Kathryn M. Karavanic, Karen L. Portland State University Department of Computer Science

ISBN: (纸本)0769523129

This paper presents PPerfGrid, a tool that addresses the challenges involved in the exchange of heterogeneous parallel computing performance data. parallel computing performance data exists in a wide variety of different schemas and formats, from basic text files to relational databases to XML, and it is stored on geographically dispersed host systems of various platforms. PPerfGrid uses Grid Services to address these challenges. PPerfGrid exposes Application and Execution semantic objects as Grid services and publishes their location and characteristics in a registry. PPerfGrid clients access this registry, locate the PPerfGrid sites with performance data they are interested in, and bind to a set of Grid services that represent this data. This set of Application and Execution Grid services provides a uniform, virtual view of the data available in a particular PPerfGrid session. PPerfGrid addresses scalability by allowing specific questions to be asked about a data store, thereby narrowing the scope of the data returned to a client. In addition, by using a Grid services approach, the Application and Execution Grid services involved in a particular query can be dynamically distributed across several hosts, thereby taking advantage of parallelism and improving scalability, We describe our PPerfGrid prototype and include data from preliminary prototype performance tests.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A distributed monitoring mechanism for mobile Ad hoc networks

A distributed monitoring mechanism for mobile Ad hoc network...

引用

8th international symposium on parallel Architectures, Algorithms and Networks, I-SPAN 2005

作者： Jianhua, Song Fan, Hong Yajun, Guo College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 Hubei China School of Mathematics and Computer Science Hubei University Wuhan 430062 Hubei China

ISBN: (纸本)0769525091

With emergence of a wide range of wireless devices, protecting mobile ad hoc networks became an increasingly important and also a more difficult task Intrusion detection system (IDS) can be deployed as a second line of defense in a Mobile Ad hoc Network (MANET). But it may be impossible to make every wireless node the monitoring nodes due to the resource limitation So it is important to investigate distributed monitoring mechanism appropriate for ad hoc networks. A distributed scheme based on the concepts of connected weighted dominating set is proposed for selecting the monitoring nodes to detect network packets in ad hoc networks. The proposed scheme is aimed to minimize costs of network monitoring and IDS system The performance of the proposed scheme is also investigated. © 2005 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed storage layout schemes

Distributed storage layout schemes

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Sobe, Peter University of Lübeck Institute of Computer Engineering Germany

ISBN: (纸本)0769523129

When distributing data across several nodes, two different approaches exist. The first one consists in distribution of the data object itself, e.g. in striping. The second approach is aggregation of local storages, whereby each data object is assigned to a home storage node. From the viewpoint of fault-tolerant data layouts, these schemes seem to be similar. In both cases the addition of parity, e.g. RAID level 3, level 5 or Reed-Solomon codes provide tolerance against node failures. A closer look shows differences in reachable access rates, needed number of messages and recovery cost. In this paper we compare both approaches and provide a method for self reconfiguration. The transformation from a parity grouping layout to a striping layout is shown to be feasible for stepwise and concurrent operation during data access.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the CLI for I/O-intensive computing

Benchmarking the CLI for I/O-intensive computing

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Qin, Xiao Xie, Tao Nathan, Ahalya Tadepalli, Vijaya K. Department of Computer Science New Mexico Institute of Mining and Technology Socorro NM 87801 Department of Computer Science and Engineering University of Nebraska-Lincoln Lincoln NE 68588-0115

ISBN: (纸本)0769523129

Common Language Infrastructure, or CLI, is a standardized virtual machine, which increasingly becomes popular on a wide range of platforms. In this paper we developed three I/O-intensive benchmarks for the CLI using various techniques. The first benchmark is designed in accordance with an application behavioural model that rebuilds the behavior of real world I/O-intensive applications. The second benchmark is a trace driven simulator that simulates five I/O-intensive applications. The third benchmark is a micro I/O-Intensive benchmark used to emulate a simple web server. In addition, the performances of the benchmarks are evaluated on the SSCLI. The results suggest that the CLI is a potential virtual machine for I/O-intensive computing.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource management algorithm for a distributed real-time system

Dynamic resource management algorithm for a distributed real...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Cavanaugh, Charles Ari, Radhika Center for Advanced Computer Studies University of Louisiana Lafayette

ISBN: (纸本)0769523129

In this paper we propose a framework and algorithm for dynamic resource management in a distributed real-time system. Our assumptions are as follows: first, multiple real-time & non real-time processes are active throughout the system. Those processes in the critical path for a given task, i.e., autopilot, fire control (as in firing weapons), surveillance, collaborative planning, are RT for the duration of the task and may or may not be party to multiple tasks in either critical or ancillary capacities. For instance, the radar may be part of the critical path during surveillance, but have uses other thaan that, say to take a snampshot during a collaborative planning sessiong that may serve an ancillary use (as a supplementary illusatration for discussion, e.g., "this is the depot we will go after tomorrow during a flyover") But then, if you can fly over it, why not go after it then? Another example: during a coordinated maneuver, plane-to-plane communications are in the critical path but during fire control they are not. second, the operating system or run-time environment has task migration capabilities. Third, storage is cheap - can store images of multiple processes in different states on each computing device for purpose of instantiating one or more in any combination on that device and across devices for reconfigurable distributed computing. This paper presents a software architecture and an algorithm for resource management in such systems.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Measuring scalability of resource management systems

Measuring scalability of resource management systems

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Mitra, Arindam Maheswaran, Muthucumaru Ali, Shoukat Dept. of Computer Science University of Manitoba Winnipeg Man. R3T 2N2 Canada School of Computer Science McGill University Montreal Que. H3A 2A7 Canada Dept. of Elec. and Comp. Engg University of Missouri-Rolla Rolla MO 65409-0040 United States University of Manitoba Winnipeg Man. Canada School of Computer Science McGill University Montreal Canada Eta Kappa Nu Honorary Society Electrical and Computer Engineering Department University of Missouri-Rolla IEEE IEEE Computer Society ACM

ISBN: (纸本)0769523129

Scalability refers to the extent of configuration modifications over which a system continues to be economically deployable. Until now, scalability of resource management systems (RMSs) has been examined implicitly by studying different performance measures of the RMS designs for different parameters. However, a framework is yet to be developed for quantitatively evaluating scalability to unambiguously examine the trade-offs among the different RMS designs. In this paper, we present a methodology to study scalability of RMSs based on overhead cost estimation. First, we present a performance model for a managed distributed system (e.g., Grid computing system) that separates the manager and managee. second, based on the performance model we present a metric used to quantify the sealability of a RMS. Third, simulations are used to apply the proposed scalability metric to selected RMSs from the literature. The results show that the proposed metric is useful in quantifying the scalabilities of the RMSs.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

2nd international symposium on parallel and distributed Processing and Applications, ISPA 2004

引用

2nd international symposium on parallel and distributed Processing and Applications, ISPA 2004

ISBN: (纸本)9783540241287

The proceedings contain 119 papers. The special focus in this conference is on parallel and distributed Processing and Applications. The topics include: Present and future supercomputer architectures;challenges in P2P computing;multihop wireless Ad Hoc networking: current challenges and future opportunities;an inspector-executor algorithm for irregular assignment;multi-grain parallel processing of data-clustering on programmable graphics hardware;a parallel reed-solomon decoder on the imagine stream processor;asynchronous document dissemination in dynamic Ad Hoc networks;location-dependent query results retrieval in a multi-cell wireless;an efficient mobile data mining model;towards correct distributed simulation of high-level petri nets with fine-grained partitioning;m-guard: a new distributed deadlock detection algorithm based on mobile agent technology;meta-based distributed computing framework;locality optimizations for jacobi iteration on distributed parallel;fault-tolerant cycle embedding in the WK-recursive network;RAIDb: redundant array of inexpensive databases;a fault-tolerant multi-agent development framework;a fault tolerance protocol for uploads: design and evaluation;topological adaptability for the distributed token circulation paradigm in faulty environment;adaptive data dissemination in wireless sensor networks;design and analysis of a k-connected topology control algorithm for Ad Hoc networks;on using temporal consistency for parallel execution of real-time queries in wireless sensor systems;cluster-based parallel simulation for large scale molecular dynamics in microscale thermophysics;parallel checkpoint/recovery on cluster of IA-64 computers;an enhanced message exchange mechanism in cluster-based mobile;a scalable low discrepancy point generator for parallel computing;generalized trellis stereo matching with systolic array.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Kinematic and dynamic adaptive control of a nonholonomic mobile robot using a RNN

Kinematic and dynamic adaptive control of a nonholonomic mob...

引用

2005 IEEE international symposium on Computational Intelligence in Robotics and Automation CIRA 2005

作者： Oubbati, Mohamed Schanz, Michael Levi, Paul IEEE Institute of Parallel and Distributed Systems University of Stuttgart Universitaetsstrasse 38 D-70569 Stuttgart Germany

In this paper, an adaptive neurocontrol system with two levels is proposed for the motion control of a nonholonomic mobile robot In the first level, a recurrent network improves the robustness of a kinematic controller and generates linear and angular velocities, necessary to track a reference trajectory. In the second level, another network converts the desired velocities, provided by the first level, into a torque control. The advantage of the control approach is that, no knowledge about the dynamic model is required, and no synaptic weight changing is needed in presence of robot's parameters variation. This capability is acquired through prior 'meta-learning'. Simulation results are demonstrated to validate the robustness of the proposed approach. © 2005 IEEE.

关键词： Mobile radio systems

来源：评论

学校读者我要写书评

暂无评论

Quick reconfiguration in clustered micro-sequencer

Quick reconfiguration in clustered micro-sequencer

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Jafari, Roozbeh Memik, Seda Ogrenci Sarrafzadeh, Majid UCLA 3256N Boelter Hall Los Angeles CA 90095 Northwestern University 2145 Sheridan Road Evanston IL 60208

ISBN: (纸本)0769523129

This paper presents a Micro-Sequencer based reconfigurable system. We introduce the concept of Quick Reconfiguration and compare it with existing "full reconfiguration " schemes. In a typical scenario, reconfiguring a system from one application to another does not require a "full" reconfiguration. Instead we can exploit similarities among various applications to save on reconfiguration time. We show that a significant speedup is gained, by using quick reconfiguration on a set of image processing benchmarks, which takes seconds versus hours in traditional FPGA reconfigurations. We evaluate the flexibility, the performance and the parallelism of this architecture with customized functional units. Furthermore, a method was proposed for customizing clustered datapath to improve the throughput of the system. This method accelerates the system by 13 times on average compared to the case where the same algorithm is running on a modern processor. We also map various applications directly onto FPGAs and measure the silicon area and the power consumption and compare to the case where the applications are implemented on micro-sequencers. On average, micro-sequencer takes 31% more area and consumes 23% more power. However, the reconfiguration time is decreased to less than one second on average while for applications directly mapped onto FPGAs, it is near 3000 seconds.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Security-driven heuristics and a fast genetic algorithm for trusted grid job scheduling

Security-driven heuristics and a fast genetic algorithm for ...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Song, Shanshan Kwok, Yu-Kwong Hwang, Kai University of Southern California Los Angeles CA 90089 United States Department of Computer Science University of Southern California Department of Electrical and Electronic Engineering HKU HKU University of Southern California IEEE Computer Society IEEE Communications Society IEEE Internet and Grid Computing Laboratory University of Southern California ITR GridSec Project USC

ISBN: (纸本)0769523129

In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. second, we propose a new Space-Time Genetic Algorithm (STGA) for trusted job scheduling, which is very fast and easy to implement. Under our new model, a job can possibly fail if the site security level is lower than the job security demand. We consider three security-driven heuristic modes: secure, risky, and f-risky. The secure mode always dispatches jobs to secure sites meeting the job security demands. The risky mode allocates jobs to any available resource site, taking whatever the risk it may face. The f-risky mode tries to limit the risk to be at most certain probability f. Our extensive simulation results indicated that the proposed STGA is highly effective in scheduling two types of practical workloads: NAS (Numerical Aerodynamic Simulation) and PSA (parameter-sweep application). The STGA outperforms the Min-Min and Sufferage heuristics under three risk modes, in terms of a wide range of performance metrics including makespan, average response time, site utilization, slowdown ratio, and job failure rate.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：