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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Large-scale simulation of Eukaryotic cell signaling processes

Large-scale simulation of Eukaryotic cell signaling processe...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： J.M. Miller F. Zheng School of Electrical Engineering and Computer Science Washington State University Tri-Cities Richland WA USA

Summary form only given. A database of rate constants and related quantities has been assembled by Schoeberl et al. for intracellular signaling downstream of the epidermal growth factor receptor (EGFR). This information was combined with data on metalloprotease activation to build a model of autocrine signal transduction by cancer cells exposed to ionizing radiation. The model predicts prompt activation of mitogen-activated-protein-kinase (MAPK) pathways in response to a radiation-induced shift in the RasGDP /spl harr/ RasGTP equilibrium toward more RasGTP. A secondary MAPK activation is predicted due to metalloprotease activity that releases transforming growth factor alpha (TGF/spl alpha/), an autocrine ligand of EGFR. Model predictions were compared to data by Dent et al. on extracellular regulated kinase (ERK) activation following a 2 Gy exposure of carcinoma cells in vitro. Good agreement was obtained with the magnitude of prompt and secondary ERK activation; however, the experimental secondary response was delayed relative the prompt peak more than predicted by our model. A mechanistic understanding of radiation-induced growth factors is needed to improve treatment of cancer by radiation therapy. Inhibitors of the signaling pathways modeled in this study may reduce a potentially self-limiting aspect of radiation therapy whereby induced growth factors accelerate repopulation of treated tumor volumes.

关键词： Large-scale systems Signal processing Predictive models Cancer Biomedical applications of radiation databases Assembly Epidermis Ionizing radiation Extracellular

来源：评论

学校读者我要写书评

暂无评论

Time-sensitive computation of aggregate functions over distributed imprecise data

Time-sensitive computation of aggregate functions over distr...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Q. Han M. Ba Nguyen Sandy Irani Nalini Venkatasubramanian School of Information and Computer Science University of California Irvine CA USA

Summary form only given. Many distributed applications in the real world now require real time services in which aggregate queries need to be computed over a set of values. These applications can often tolerate varying degrees of inaccuracy in the results. System designers, on the other hand, would like to provide services with low inaccuracy and minimal management overhead. We focus on addressing the tradeoffs between timeliness, accuracy and cost for data aggregation in distributed environments. Specifically, we address the problem of time-sensitive computation of aggregate queries (count, sum and min) over a set of values represented by intervals with lower and upper bounds. These intervals are approximations based on most recent values about distributed sources. In order to meet the precision constraints from users, a subset of sources needs to be probed for exact values. We first propose algorithms for batch selection of the probing set, where selection is done before probing without the knowledge of the actual values. In addition, we propose an iterative selection approach where the selection of the next probing source depends on the previous returned value.

关键词： distributed computing Aggregates Application software Real time systems Costs Upper bound Computer networks Fault diagnosis Streaming media Delay

来源：评论

学校读者我要写书评

暂无评论

ViSMI: software distributed shared memory for Infiniband clusters

ViSMI: software distributed shared memory for Infiniband clu...

引用

IEEE international symposium on Network Computing and Applications

作者： C. Osendorfer C. Trinitis M. Mairandres Jie Tao Lehrstuhl für Rechnertechnik und Rechnerorganisation Technische Universität München Garching Germany Institut für Rechnerentwurf und Fehlertoleranz Universität Karlsruhe Karlsruhe Germany

This work describes ViSMI, a software distributed shared memory system for cluster systems connected via InfiniBand. ViSMI implements a kind of home-based lazy release consistency protocol, which uses a multiple-writer coherence scheme to alleviate the traffic introduced by false sharing. For further performance gain, InfiniBand features and optimized page invalidation mechanisms are applied in order to reduce synchronization overhead. first experimental results show that ViSMI introduces good performance comparable to similar software DSMs.

关键词： Protocols Computer architecture Hardware parallel programming Space technology Performance gain Software performance parallel architectures LAN interconnection Local area networks

来源：评论

学校读者我要写书评

暂无评论

Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings

Bounded service time and memory space optimal self-stabilizi...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： C. Johnen LRI-UMR 8623 CNRS Université Paris Sud Orsay France

Summary form only given. Robustness is one of the most important requirements of modern distributed systems. Various types of faults are likely to occur at various parts of the system. The concept of self-stabilization is the most general technique to design a system to tolerate arbitrary transient faults. A self-stabilizing system, regardless of the initial states of the processors and initial messages in the links, is guaranteed to converge to the intended behavior in finite time. We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not require processor identifiers, no distinguished processor (i.e. all processors perform the same code). The algorithm can deal with any kind of schedules even unfair ones. Our protocol is the first one having the two major advantages : the duration of a token circulation is bounded and the protocol is optimal in memory space. The memory space required by our protocol on each processor is 0(lg(M/sub N/)), M/sub N/ being the smallest non divisor of ring size. Our protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). Once the system is stabilized, the circulation of the sole token is 1-fair (i.e. in every round, every processor obtains the token one time).

关键词： Protocols Processor scheduling Robustness Scheduling algorithm Computational modeling distributed processing

来源：评论

学校读者我要写书评

暂无评论

Strategies for using additional resources in parallel hash-based join algorithms 04

Strategies for using additional resources in parallel hash-b...

引用

international symposium on High Performance distributed Computing

作者： Xi Zhang T. Kurc T. Pan U. Catalyurek S. Narayanan P. Wyckoff J. Saltz Dept. of Biomedical Informatics The Ohio State University Columbus OH USA Dept. of Biomedical Informatics The Ohio State University Columbus OH Ohio Supercomputer Center Columbus OH

Hash-based join is a compute- and memory-intensive algorithm. It achieves good performance and scales well to large datasets, if sufficient memory is available to hold the hash table and the distribution of computing had across nodes is balanced. We compare three adaptive algorithms that start with a partitioning of the hash table across a group of nodes and expand during the hash table building phase to additional resources, when memory on a node is used up. The split-based algorithm partitions the hash table range assigned to the node, on which memory is full, into two segments and assigns one of the segments to a new node in the system. The replication-based algorithm replicates the hash table range on a new node. The hybrid algorithm combines the first and second strategies in order to address each strategy's short comings. We perform an experimental performance evaluation of these algorithms on a PC cluster. Our results show that among the three algorithms, in most cases the hybrid algorithm either performs close to the better of the two or is the best algorithm.

关键词： Clustering algorithms Partitioning algorithms distributed computing Biomedical computing Filters Biomedical informatics Adaptive algorithm Performance evaluation databases Subcontracting

来源：评论

学校读者我要写书评

暂无评论

A dichotomous algorithm for association rule mining

A dichotomous algorithm for association rule mining

引用

international Workshop on Database and Expert systems Applications

作者： T.-Y. Jen R. Taouil D. Laurent IT Department HELP Institute Kuala Lumpur Malaysia LI Université de Tours Blois France LICP Université de Cergy Pontoise Cergy-Pontoise France

The analysis of large amounts of data requires important computing resources that may not be available, even in current environment, and there are traditionally two main ways for solving this problem. The first is to use multiprocessor machines, and the second is to use computer clusters. The main drawbacks of these solutions are the expensive cost of machines and their specific utilization. In order to avoid these drawbacks, distributed algorithms for mining association rules have been proposed. However, these algorithms either run high-synchronous methods or lack flexibility to be adapted to machines with limited available resources. A distributed dichotomous algorithm (DDA) is proposed for association rule mining. The main features of DDA are that this algorithm does not require a high level of synchronization and that it does not process data replication and redundant calculations. In addition, DDA can partition recursively the tasks and the data set so as to be processed by machines with limited available resources.

关键词： Association rules Data mining Partitioning algorithms Clustering algorithms distributed algorithms Costs Concurrent computing Transaction databases Algorithm design and analysis parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic key messaging for cluster computing

Dynamic key messaging for cluster computing

引用

IEEE international symposium on Network Computing and Applications

作者： Ming Zhu C. Katsinis Yang Wang Meng Ding Department of Electrical and Computer Engineering Drexel University Philadelphia PA USA Department of Computing Science University of Alberta Edmonton AB Canada Dept. of Electrical and Computer Engineering Drexel University Philadelphia PA

ISBN: (纸本)0769522424

Over the past decades, distributed computing has been gaining popularity. It provides more computing power and memory space for parallel applications. On the other hand, such applications fight back and challenge the architectures of the distributed systems for more efficiency. To face the challenge, a key messaging (KM) scheme was proposed to realize the optimization of communication at a system architecture level in our previous papers. The contribution of KM is that it performs the optimization in both the underlying communication system and high level application model. The performance of an application is always determined by its critical path. Currently, messages along the critical path can be easily blocked by non-critical path messages, which degrade the performance. To solve this problem, KM provides an algorithm to identify the critical-path messages and optimizes them by introducing a prioritized protocol layer. Thus, these messages are served first before any low priority messages. Shorter processing time for the messages results in faster completion time of the critical path. Although KM was proved to be effective by a prototype system on the IBM SP2, there are limitations in its optimization procedures where dynamic natures of an underlying network should be considered when running parallel applications on cluster/distributed computing environments. To address the problem, a dynamic key message (DKM) algorithm is introduced. DKM takes into considerations the changes of network traffic load while tasks are running and dynamically updates the critical path on the fly. A comprehensive simulation method is adopted to evaluate the performance of this algorithm and the results show that under the same workload, DKM exhibits much more stability than the static key message (SKM) algorithm when the network traffic load changes.

关键词： distributed computing Computer architecture Telecommunication traffic Concurrent computing Degradation Protocols Prototypes Clustering algorithms Computational modeling Stability

来源：评论

学校读者我要写书评

暂无评论

Discouraging free riding in a peer-to-peer CPU-sharing grid 04

Discouraging free riding in a peer-to-peer CPU-sharing grid

引用

international symposium on High Performance distributed Computing

作者： N. Andrade F. Brasileiro W. Cirne M. Mowbray Departamento de Sistemas e Computação Universidade Federal de Campina Grande Campina Grande Brazil HP Labs Bristol HP Labs Bristol UK

Grid computing has excited many with the promise of access to huge amounts of resources distributed across the globe. However, there are no largely adopted solutions for automatically assembling grids, and this limits the scale of today's grids. Some argue that this is due to the overwhelming complexity of the proposed economy-based solutions. Peer-to-peer grids Iwve emerged as a less complex alternative. We are currently deploying OurGrid, one such peer-to-peer grid. OurGrid is a CPU-sharing grid that targets bag-of-tasks applications (i.e. parallel applications whose tasks are independent). In order to ease system deployment, OurGrid is based on a very lightweight autonomous reputation scheme. Free riding is an important issue for any peer-to-peer system. The aim is to show that OurGrid's reputation system successfully discourages free riding, making it in each peer s own interest to collaborate with the peer-to-peer community. We show this in two steps. first, we analyze the conditions under which a reputation scheme can discourage free riding in a CPU-sharing grid. Second, we show that OurGrid's reputation scheme satisfies these conditions, even in the presence of malicious peers. Unlike other distributed mechanisms for discouraging free riding, OurGrid's reputation scheme achieves this without requiring a shared cryptographic infrastructure or specialized storage.

关键词： Peer to peer computing Grid computing Collaboration distributed computing Cryptography Assembly Production systems Resource management Incentive schemes

来源：评论

学校读者我要写书评

暂无评论

Agent based dynamic recovery protocol in distributed databases 2

Agent based dynamic recovery protocol in distributed databas...

引用

2nd international symposium on parallel and distributed Computing (ISPDC 2003)

作者： Wang, Y Liu, XS Univ Elect Sci & Technol China Res Lab 8010 Chengdu 610054 Peoples R China

ISBN: (纸本)0769520693

Recovering from node failures is a critical issue in distributed database systems. In conventional log-based recovery protocols, the nodes providing recovery service may be overburdened, especially when the recovery is resource consuming. In this paper, an agent-based dynamic recovery protocol is presented. It divides the whole recovery process into three major steps: log-recovery, agent-recovery, and synchronization. The key idea of this protocol is to cache new database operations initiated during recovery into agents. All these cached operations are then replayed independently for further recovery. The analysis indicates that the new protocol can minimize internode's dependency and improve recovery speed. As a result, system failure rate is cut down and the overall performance gets improved.

关键词： agent dynamic recovery log recovery distributed database systems

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed computing for an adaptive visual object retrieval system

Parallel and distributed computing for an adaptive visual ob...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Krüger, Thomas Wickel, Jochen Kraiss, Karl-Friedrich Lehrstuhl für Technische Informatik Technical Computer Science RWTH Aachen University Germany

ISBN: (纸本)0769519261

Computer vision and image processing has always been an active research domain that requires an enormous computational effort. In this paper we present the architecture of a modular object retrieval system. It is based on a dataflow concept which allows flexible adaptations to different tasks. This concept facilitates parallel processing as well as distributed computing. We also present a dynamic load balancing service for heterogeneous environments that has been integrated to improve system performance. first experiments show that the developed balancer performs better than standard balancing techniques in this environment. © 2003 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：