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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,285 篇 会议
362 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

9,681 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,567 篇 工学
- 4,178 篇 计算机科学与技术...
- 2,157 篇 软件工程
- 847 篇 电气工程
- 629 篇 信息与通信工程
- 313 篇 控制科学与工程
- 226 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,073 篇 理学
- 863 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 33 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,198 篇 distributed data...
995 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
778 篇 computer science
693 篇 databases
616 篇 computer archite...
586 篇 application soft...
559 篇 computational mo...
467 篇 parallel process...
369 篇 scalability
351 篇 distributed comp...
345 篇 distributed proc...
333 篇 hardware
325 篇 database systems
293 篇 parallel program...
293 篇 processor schedu...
290 篇 resource managem...
287 篇 costs
269 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
12 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
10 篇 j. saltz
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop

语言

9,597 篇 英文
63 篇 其他
21 篇 中文

检索条件"任意字段=International Symposium on Databases in Parallel and Distributed Systems"

共 9681 条记录，以下是4901-4910 订阅

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

详细简洁

排序：

parallel computations in mixed formats

Parallel computations in mixed formats

引用

3rd IASTED international Conference on Advances in Computer Science and Technology, ACST 2007

作者： Pogribny, Wlodzimierz Drechny, Marcin Faculty of Telecommunications and Electrical Engineering of UTLS Al. Prof. S. Kaliskiego 7 85-796 Bydgoszcz Poland

ISBN: (纸本)9780889866560

This paper presents the new approach to parallel calculations with the use of mixed formats. Usually parallel computations are done in multibit Pulse Code Modulation (PCM). Using this format requires doing multibit multiplications what often decreases the speed of calculations. Mixed formats, which join differential modulation codes such as Delta Modulation (DM) with PCM, can lead to the decrease of code word length and speed-up operation in DSP (Digital Signal Processing). Some kinds of DM such as MDPCM-PCM (Modified Differential Pulse Code Modulation) and SDPCM-PCM (Synthetic DPCM) enable to replace the time-consuming multiplications with fast shift operations. The purpose of this work is working out the new processing methods for the fast-acting increase of DSP algorithms on the basis of parallel computations in mixed formats, especially with the use of MDPCM-PCM and SDPCM-PCM formats.

关键词： Processing

来源：评论

学校读者我要写书评

暂无评论

Study of an iterative technique to minimize completion times of non-makespan machines

Study of an iterative technique to minimize completion times...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Briceño, Luis Diego Oltikar, Mohana Siegel, Howard Jay Maciejewski, Anthony A. Colorado State University Department of Electrical and Computer Engineering Fort Collins CO 80523-1373 Colorado State University Department of Computer Science Fort Collins CO 80523-1373

ISBN: (纸本)1424409101

Heterogeneous computing (HC) is the coordinated use of different types of machines, networks, and interfaces to maximize the combined performance and/or cost effectiveness of the system. Heuristics for allocating resources in an HC system have different optimization criteria. A common optimization criterion is to minimize the completion time of the last to finish machine (makespan). In some environments, it is useful to minimize the finishing times of the other machines in the system, i.e., those machines that are not the last to finish. Consider a production environment where a set of known tasks are to be mapped to resources off-line before execution begins. Minimizing the finishing times of all the machines will provide the earliest available ready time for these machines to execute tasks that were not initially considered. In this study, we examine an iterative approach that decreases machine finishing times by repeatedly running a resource allocation heuristic. The goal of this study is to investigate whether this iterative procedure can reduce the finishing time of some machines compared to the mapping initially generated by the heuristic. We show that the effectiveness of the iterative approach is heuristic dependent and study the behavior of the iterative approach for each of the chosen heuristics. This work which identifies heuristics can and cannot attain improvements in the completion time of non-makespan machines using this iterative approach. © 2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Agent-based approach to distributed ensemble learning of Fuzzy ARTMAP classifiers

Agent-based approach to distributed ensemble learning of Fuz...

引用

1st KES international symposium on Agent and Multi-Agent systems - Technology and Applications (KES-AMSTA 2007)

作者： Cervantes, Louie Lee, Jung-sik Lee, Jaewan Kunsan Natl Univ Sch Elect & Informat Engn 68 Miryong Dong Kunsan 573701 Chonbuk South Korea

ISBN: (纸本)9783540728290

This paper presents a parallel and distributed approach to ensemble learning of Fuzzy ARTMAP classifiers based on the multi-agent platform. Neural networks have been used successfully in a broad range of non-linear problems that are difficult to solve using traditional techniques. Training a neural network for practical applications is often time consuming thus extensive research work is being carried out to accelerate this process. Fuzzy ARTMAP (FAM) is one of the fastest neural network architectures given its ability to produce neurons on demand to represent new classification categories. FAM can adapt to the input data without having to specify an arbitrary structure. However, FAM is vulnerable to noisy data which can rapidly degrade network performance. Due to its fast learning features, FAM is sensitive to the sequence of input sample presentations. In this paper we propose a parallel and distributed approach to ensemble learning for FAM networks as a means to improve the over-all performance of the classifier and increase its resilience to noisy data. We use the multi-agent platform to distribute the computational load of the ensemble to several hosts. The multi-agent platform is a robust environment that can support large-scale neural network ensembles. Our approach also demonstrates the feasibility of large-scale ensembles. The experimental results show that ensemble learning substantially improved the performance of fuzzy ARTMAP classifiers.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Storage Optimization for Large-Scale distributed Stream Processing systems

Storage Optimization for Large-Scale Distributed Stream Proc...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Kirsten Hildrum Fred Douglis Joel L. Wolf Philip Yu Lisa Fleischer Akshay Katta IBM Thomas J. Watson Research Center USA Dartmouth College USA Amazon Corporation USA

We consider storage in an extremely large-scale distributed computer system designed for stream processing applications. In such systems, incoming data and intermediate results may need to be stored to enable future analyses. The quantity of such data would dominate even the largest storage system. Thus, a mechanism is needed to keep the most useful data. One recently introduced approach is to employ retention value functions, which effectively assign each data object a value that changes over time. Storage space is then reclaimed automatically by deleting data of lowest current value. In such large systems, there can naturally be multiple file systems available, each with different properties. Choosing the right file system for a given incoming data stream presents a challenge. In this paper we provide a novel and effective scheme for optimizing the placement of data within a distributed storage subsystem employing retention value functions. The goal is to keep the data of highest overall value, while simultaneously balancing the read load to the file system.

关键词： Large-scale systems Streaming media File systems distributed computing Application software Internet Relational databases Information services Web sites Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Effects of mobility on membership estimation and routing services in Ad hoc networks

引用

5th international symposium on parallel and distributed Processing and Applications/ISPA 2007 international Workshops

作者： Garcia, Juan Carlos Banuls, Mari-Carmen Beyer, Stefan Galdamez, Pablo Univ Politecn Valencia Inst Informat Technol Valencia 46022 Spain

ISBN: (纸本)9783540747413

The use of MANET's (or Mobile Ad hoc NETworks) is becoming very popular. Power efficiency is a key issue in this type of network, as mobile devices usually rely on limited power supplies. One essential service, the routing protocol, employed to discover routes between nodes in the network, can greatly affect power consumption. Furthermore, many distributed applications require an additional membership service to keep track of the nodes that make up the system at any moment. In general, this information is not provided by routing services with the exception of the Optimised Link State Routing protocol (OLSR). The two services, routing and membership estimation, form a basic support to build other higher-level distributed services on ad hoc networks. To decrease the over-all power consumption these services should be optimized for the intended use of the network. In particular the degree of mobility can have an impact on the power consumption and performance of different approaches to routing and membership estimation. In this paper we present a study of two different approaches that combine a routing service with membership estimation. We compare the proactive OLSR with our own approach. Our approach consists of integrating a gossip-style failure detector with the reactive Dynamic Source Routing protocol (DSR). We present an analysis of the effects of mobility on the global performance and power consumption of the two approaches. We identify scenarios for which each approach is best suited.

关键词： ad hoc networks distributed systems wireless routing energy consumption group membership

来源：评论

学校读者我要写书评

暂无评论

international symposium on Fundamentals of Software Engineering: international symposium, FSEN 2007, Proceedings

International Symposium on Fundamentals of Software Engineer...

引用

2nd IPM international symposium on Fundamentals of Software Engineering, FSEN 2007

ISBN: (纸本)9783540756972

The proceedings contain 32 papers. The topics discussed include: finite abstract models for deterministic transition systems: fair parallel composition and refinement-preserving logic;slicing abstractions;formalizing compatibility and substitutability in communication protocols using I/O-constraint automata;is your security protocol on time?;adapting the UPPAAL model of a distributed lift system;zone-based universality analysis for single-clock timed automata;compositional semantics of system-level designs written in SystemC;reusing requirements: the need for extended variability models;test selection criteria for quantifier-free first-order specifications;formal testing of systems presenting soft and hard deadlines;automatic composition of stateless components: a logical reasoning approach;and a model of component-based programming.

关键词： Technical presentations

来源：评论

学校读者我要写书评

暂无评论

Detecting temporal logic predicates on distributed computations

Detecting temporal logic predicates on distributed computati...

引用

21st international symposium on distributed Computing

作者： Ogale, Vinit A. Garg, Vijay K. Univ Texas Parallel & Distributed Syst Lab Dept Elect & Comp Engn Austin TX 78712 USA

ISBN: (纸本)9783540751410

We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection of a reasonably large class of predicates which we call the Basic Temporal Logic or BTL. Examples of valid BTL predicates are nested temporal predicates based on local variables with arbitrary negations, disjunctions, conjunctions and the possibly (EF or lozenge) and invariant(AG or square) temporal operators. We introduce the concept of a basis, a compact representation of all global cuts which satisfy the predicate. We present an algorithm to compute a basis of a computation given any BTL predicate and prove that its time complexity is polynomial with respect to the number of processes and events in the trace although it is not polynomial in the size of the formula. We do not know of any other technique which detects a similar class of predicates with a time complexity that is polynomial in the number of processes and events in the system. We have implemented a predicate detection toolkit based on our algorithm that accepts offline traces from any distributed program.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A debugger for flow graph based parallel applications

A debugger for flow graph based parallel applications

引用

2007 ACM international symposium on Software Testing and Analysis, ISSTA'07 and PADTAD-V Workshop

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

ISBN: (纸本)159593748X

Flow graphs provide an explicit description of the parallelization of an application by mapping vertices onto serial computations and edges onto message transfers. We present the design and implementation of a debugger for the flow graph based Dynamic parallel Schedules (DPS) parallelization framework. We use the flow graph to provide both a high level and detailed picture of the current state of the application execution. We describe how reordering incoming messages enables testing for the presence of message races while debugging a parallel application. The knowledge about causal dependencies between messages enables tracking messages and computations along individual branches of the flow graph. In addition to common features such as restricting the analysis to a subset of threads or processes and attaching sequential debuggers to running processes, the proposed debugger also provides support for message alterations and for message content dependent breakpoints. Copyright 2007 ACM.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Performance Studies of a WebSphere Application, Trade, in Scale-out and Scale-up Environments

Performance Studies of a WebSphere Application, Trade, in Sc...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Hao Yu Jose E. Moreira Parijat Dube I-hsin Chung Li Zhang IBM Thomas J. Watson Research Center Yorktown Heights NY USA

Scale-out approach, in contrast to scale-up approach (exploring increasing performance by utilizing more powerful shared-memory servers), refers to deployment of applications on a large number of small, inexpensive, but tightly packaged and tightly interconnected servers. Recently, there has been an increasing interest in scale-out approach. The purpose of this study is to discover advantages or disadvantages of scale-out systems with a typical enterprise workload, IBM Trade Performance Benchmark Sample for Websphere application server (a.k.a. Trade6). In this work, through cross system performance comparison, we show that for such workload, scale-out approach has better performance/cost effect. In term of scalability, we show that Websphere application server packages for distributed environment scale well while the possible bottleneck of the application deployment is the database tier. We present preliminary results to show that both database partitioning feature (DPF) and federated database server approaches are not exactly suitable for providing scale-out solution for the database tier of workloads similar to Trade (small tables and short transactions). In addition, we discuss our on-going effort on further performance study: (1) studies of performance/scalability for larger deployments by adopting the IBM AMBIENCE queuing network modeling tool, (2) performance breakdowns utilizing IBM ACTC hardware counter library.

关键词： Spatial databases Transaction databases Packaging Scalability Power system interconnection System performance Costs distributed databases Network servers Electric breakdown

来源：评论

学校读者我要写书评

暂无评论

Workshop on parallel and distributed Real-Time systems

Workshop on Parallel and Distributed Real-Time Systems

引用

international symposium on parallel and distributed Processing (IPDPS)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 487 488 489 490 491 492 493 494 495 496 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：