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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

269 篇 会议
7 篇 期刊文献
5 册 图书

馆藏范围

281 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

138 篇 工学
- 129 篇 计算机科学与技术...
- 75 篇 软件工程
- 37 篇 电气工程
- 9 篇 电子科学与技术（可...
- 9 篇 控制科学与工程
- 7 篇 信息与通信工程
- 6 篇 机械工程
- 2 篇 光学工程
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 2 篇 网络空间安全
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 纺织科学与工程
25 篇 理学
- 16 篇 数学
- 6 篇 物理学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 生物学
24 篇 管理学
- 15 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 8 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 3 篇 作物学
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 医学

主题

30 篇 peer to peer com...
26 篇 servers
21 篇 cloud computing
20 篇 parallel process...
19 篇 algorithm design...
19 篇 distributed comp...
18 篇 concurrent compu...
14 篇 computer archite...
13 篇 processor schedu...
13 篇 computational mo...
12 篇 bandwidth
12 篇 resource managem...
12 篇 protocols
12 篇 delay
11 篇 application soft...
11 篇 high performance...
10 篇 scalability
10 篇 routing
10 篇 streaming media
9 篇 hardware

机构

4 篇 equipe runtime i...
4 篇 equipe hiepacs i...
4 篇 institute of com...
3 篇 china univ geosc...
2 篇 institute of inf...
2 篇 pervasive techno...
2 篇 icar-cnr napoli
2 篇 school of comput...
2 篇 karlsruhe inst t...
2 篇 department of co...
2 篇 brookhaven natl ...
2 篇 computer science...
2 篇 natl univ def te...
2 篇 university of st...
2 篇 department of en...
2 篇 second universit...
2 篇 indiana univ per...
2 篇 shenzhen institu...
2 篇 department of co...
2 篇 univ texas dept ...

作者

4 篇 jean roman
4 篇 emmanuel jeannot
4 篇 raymond namyst
3 篇 lizhe wang
3 篇 wang lizhe
2 篇 sens pierre
2 篇 jesper larsson t...
2 篇 michael alexande...
2 篇 feng wu-chun
2 篇 divitini monica
2 篇 sergio bernabe
2 篇 pinki pinki
2 篇 huang bormin
2 篇 li chen
2 篇 wang d
2 篇 nagalingam sv
2 篇 gianni francesco
2 篇 wang yijie
2 篇 tao jie
2 篇 ernst m.

语言

279 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=17th International Conference on Parallel and Distributed Computing Systems, PDCS 2004"

共 281 条记录，以下是11-20 订阅

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

详细简洁

排序：

Self-Stabilizing Algorithms for the Shortest Path Problem in distributed systems 17

Self-Stabilizing Algorithms for the Shortest Path Problem in...

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Huang, Tetz C. Lin, Ji-Cherng Mou, Nathan Department of Computer Engineering and Science Yuan-Ze University 135 Yuan-Tung Rd. Chung-Li Taoyuan320 Taiwan

ISBN: (纸本)9781618398185

Shortest path finding has a variety of applications in the areas of transportation and communication in distributed systems. In this paper, self-stabilization with respect to the single-source shortest path problem for a distributed system is studied. Our contribution is twofold. First, the existing results concerning a well-known self-stabilizing algorithm for the shortest path problem are extended to a more general distributed system. the system assumes positive real weights on all its links, instead of positive integral weights. Besides, the system assumes the more general distributed demon model, instead of the central demon model. Secondly, the algorithm is modified into a version that can operates in a distributed system of the Dolev type in which read/write separate atomicity is assumed. the new version is then rigorously verified to be a self-stabilizing algorithm that can indeed solve the shortest path problem. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

distributed Denial of Service: Taxonomies of Attacks, Tools and Countermeasures 17

Distributed Denial of Service: Taxonomies of Attacks, Tools ...

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Specht, Stephen M. Lee, Ruby B. Electrical Engineering Princeton University PrincetonNJ08544 United States

ISBN: (纸本)9781618398185

distributed Denial of Service (DDoS) attacks have become a large problem for users of computer systems connected to the Internet. DDoS attackers hijack secondary victim systems using them to wage a coordinated large-scale attack against primary victim systems. As new countermeasures are developed to prevent or mitigate DDoS attacks, attackers are constantly developing new methods to circumvent these new countermeasures. In this paper, we describe DDoS attack models and propose taxonomies to characterize the scope of DDoS attacks, the characteristics of the software attack tools used, and the countermeasures available. these taxonomies illustrate similarities and patterns in different DDoS attacks and tools, to assist in the development of more generalized solutions to countering DDoS attacks, including new derivative attacks. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Fast parallel Matrix Multiplication Algorithms on Optical Bus Fully Shuffled Trees 17

Fast Parallel Matrix Multiplication Algorithms on Optical Bu...

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Deif, Safia H. Karam, Omar H. Shaheen, Samir I. Department of Computers and Systems National Telecommunication Institute Cairo Egypt Department of Information Systems Ain Shams University Cairo Egypt Department of ComputerEngineering Cairo University Giza Egypt

ISBN: (纸本)9781618398185

In this paper, two parallel matrix multiplication algorithms are mapped to a massively parallel architecture, the Optical Bus Fully Shuffled Tree (OBFST). We develop the matrix multiplication algorithms MM1 for ordinary matrix multiplication and MM2 using Strassen's algorithm. For K ∗ K matrices, the r-clustering of the architecture makes the complexity of MM1 equal to O(log(K) ÷ log(r)) using K3processors. For MM2, using Klog7processors, the complexity is 0((2+log (K)) ÷ log(r)) which is better than other architectures such as MESH, AROB and LARPB. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

On Scheduling Computation-Dags for Internet-Based computing 17

On Scheduling Computation-Dags for Internet-Based Computing

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Rosenberg, Arnold L. Yurkewych, Matthew Department of Computer Science University of Massachusetts at Amherst AmherstMA01003 United States

ISBN: (纸本)9781618398185

An abstract "pebble game" is used to schedule three common families of computation-dags for Internet-based computing (IC, for short): reduction-meshes, which represent (the intertask dependencies of) computations that comprise "upsweeps" of meshes;reduction-trees, which represent the analogous computations on trees;and FFT dags, which represent a large variety of convolutional computations. the quality of a schedule is assessed by Us memory requirements and its rate of producing tasks that are eligible for allocation to clients. these criteria are important because of respectively the typically enormous sizes of IC computations;the typical temporal unpredictability of clients in IC, which renders a computation vulnerable to stalling indefinitely, pending the return of intermediate results by clients. Under idealized assumptions, the schedules produce eligible tasks at an optimal rate and use memory either exactly or approximately optimally. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Integrated circuits

来源：评论

学校读者我要写书评

暂无评论

parallel COMPUTATION APPLIED TO DYNAMICAL systems 17

PARALLEL COMPUTATION APPLIED TO DYNAMICAL SYSTEMS

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Akl, Selim G. Yao, Weiguang School of Computing Queen's University KingstonON Canada

ISBN: (纸本)9781618398185

In certain physical systems measuring one variable of the system modifies the values of any number of other variables unpredictably. We show in this paper that under these conditions a parallel approach succeeds in carrying out the required measurement while a sequential approach fails. Two dynamical systems are provided as examples of this phenomenon. the short-term dynamical behavior of such systems is important in the context of real-time control applications, where the parameters of a system need to be monitored on a permanent basis and measured at regular intervals. the first system is a linear one. An RLC circuit, certain parameters of which are measured sequentially, that is, one after the other, undergoes significant perturbations that affect its dynamical behavior. By contrast, these perturbations could be eliminated when the measurements are performed in parallel, that is, when the parameters are measured simultaneously. Our second example is a nonlinear dynamical system. In a Belousov-Zhabotinskii chemical reaction, measurement disturbs the equilibrium of the system and causes it to enter into an undesired state. If, however, several measurements are performed in parallel, the effect of perturbations seems to cancel out and the system remains in a stable state. these results confirm the existence of physical systems with the property that certain operations on them can be performed successfully in parallel but not sequentially. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Nonlinear dynamical systems

来源：评论

学校读者我要写书评

暂无评论

PROVIDING STATISTICAL QoS GUARANTEES FOR IN___ACTIVE OPERATIONS IN parallel MULTIMEDIA SERVERS 17

PROVIDING STATISTICAL QoS GUARANTEES FOR IN___ACTIVE OPERATI...

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Grover, Radnika S. Li, Qiang Fegan, George Computer Engineering Department Santa Clara University Santa ClaraCA95053 United States Applied Mathematics Santa Clara University Santa ClaraCA95053 United States

ISBN: (纸本)9781618398185

We consider the problem of supporting interactive operations on a parallel video server using variable bit-rate multi-resolution video. In parallel servers video data are striped across multiple independent servers or nodes connected by an interconnection network. Each rode has its own disk storage, buffer and network interface. We show that the statistical multiplexing of available resources can reduce the resources required to support interactive service on a parallel server. An analytical model is developed to predict the probability with which stream requirements can be met for a given node buffer level. the results show that the proposed scheme can reduce buffer requirements for a tolerable level of client jitter. the analytical model is validated using simulations. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Analytical models

来源：评论

学校读者我要写书评

暂无评论

Fine-Grain parallel Reconstruction Algorithm for MR Images 17

Fine-Grain Parallel Reconstruction Algorithm for MR Images

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Lee, Hyo Jong Potkin, Steven Div. of Electronic and Information Chonbuk National University Jeonju Korea Republic of Dept. of Psychiatry and Human Behavior University of California Irvine IrvineCA92697 United States

ISBN: (纸本)9781618398185

the role of magnetic resonance imaging (MRI) analysis is critical in medical diagnoses for performing a noninvasive diagnostic technique. the raw data of MRI consists of series of complex numbers that represent phases and amplitudes of signals. the reconstruction procedure of the MRI requires lengthy computational time and complicated procedure due to the heavy discrete Fourier transformation. A parallel algorithm is developed for the cluster of heterogeneous computers and analyzed based on its performance, focusing on communication overhead and granularity. Granularity and scalability are critical factors to determine the performance of parallel reconstruction algorithms. the performance of fine granularity is more efficient compared to the one of coarse granularity, if its input and output(I/O) processing is fast enough to handle messages from all slave processors. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

A Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filling Curves 17

A Locality Preserving Graph Ordering Approach for Implicit P...

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Schamberger, Stefan Wierum, Jens-Michael Fakultät für Elektrotechnik Informatik und Mathematik Universität Paderborn Fürstenaliee 11 PaderbornD-33102 Germany Paderborn Center for Parallel Computing Universitat Paderborn Fürstenallee 11 PaderbornD-33102 Germany

ISBN: (纸本)9781618398185

Linear orderings defined through space-filling curves are often applied to quickly partition graphs arising in finite element simulations. In applications with constant meshes but a rapidly changing load per element, an ordering has to be determined only once and all subsequent partition-Ings can be computed very quickly through a simple Interval splitting. However, partitlonings based on space-filling curves have known drawbacks. Especially when applied to deeply refined meshes or discretizations that contain holes, a high edge-cut is produced. In this paper we present a new linear ordering approach called graph-filling curves. In contrast to space-filling curves, we determine a node ordering based on the graph's structure rather than on its geometric information. Our experimental evaluation shows that such orderings involving the graphs connectivity information lead to clearly superior implicit partitionings. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Optimal and Non-Optimal parallel Implementations of the Sequentiall Minimal Optimization Algorithm for Support Vector Machine Training 17

Optimal and Non-Optimal Parallel Implementations of the Sequ...

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Castaneda, Benjamin Cockburn, Juan C. Shaaban, Muhammad Department of Computer Engineering Kate Gleason College of Engineering Rochester Institute of Technology RochesterNY United States

ISBN: (纸本)9781618398185

Support Vector Machines (SVMs) are supervised learning systems that have gained wide acceptance among the pattern recognition community. Learning is based on structural risk minimization over a training set and leads to a quadratic programming problem. Due to the sample size these optimization problems are very large and training remains one of the most computationally expensive stages in Support Vector Machine design. this paper addresses this problem by exploring different approaches to parallel training. Several algorithms are developed and evaluated including a non-optimal approach for parallel training based on the unbiased version of Piatt's Sequential Minimal Optimization (SMO) algorithm, an improvement to a previous biased non-optimal parallel SMO, and an optimal solution combining SMO with the Chunking approach. Experimental results show that non-optimal solutions can achieve a speed-up of 0(N2), according to the number of processors used, with a compromise in the increment of the number of Support Vectors and a decrement in accuracy. the SMO - Chunking optimal solution presents a much lesser speedup, which depends on the number of support vectors vs. total number of samples ratio. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

An approach for fine-grained profiling of mesh-based parallel programs 17

An approach for fine-grained profiling of mesh-based paralle...

引用

17th international conference on parallel and distributed computing systems, pdcs 2004

作者： Deshmukh, Amol S. Liu, Qingyuan Tomko, Karen ECECS Department University of Cincinnati CincinnatiOH45220 United States

ISBN: (纸本)9781618398185

Characterizing the dynamic behavior of parallel programs in terms of their execution profile helps to understand their behavior and suggest optimization strategies to improve the performance. Traditional event tracing techniques write the profiled data to trace files. Using the traditional approach for fine grained profiling not only yields large unwieldy trace files but often also gives skewed results due to the inaccuracies introduced by the profiling. this paper describes an approach to profile mesh-based parallel programs at a very fine level of granularity by measuring performance metrics at the level of each mesh element. the approach described in this paper is novel in that profile data is associated with mesh elements, not processors, so the profile data can be used, for example, to develop adaptive load balancing policies. A tool implementing the idea described in this paper is developed which provides an easy-to-use C API with Fortran 90 wrappers to enable fine grained profiling of mesh-based parallel applications. © (2004) by the international Society for Computers and their Applications All rights reserved.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：