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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,983 篇 电气工程
- 1,384 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 536 篇 控制科学与工程
- 229 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 62 篇 安全科学与工程
1,974 篇 理学
- 1,506 篇 数学
- 245 篇 物理学
- 204 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,464 篇 管理学
- 1,206 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

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

共 16627 条记录，以下是4721-4730 订阅

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

详细简洁

排序：

Performance evaluation of scheduling applications with DAG topologies on multiclusters with independent local schedulers 20

Performance evaluation of scheduling applications with DAG t...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： He, Ligang Jarvis, Stephen A. Spooner, Daniel P. Nudd, Graham R. Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom

ISBN: (纸本)1424400546

Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG-based application) to be executed at each computational resource are determined. The tasks are then sent to the corresponding resources, where they are orchestrated in the pre-designed pattern to complete the work. Most DAG mapping policies in the literature assume that each computational resource is a processing node of a single processor, i.e. the tasks mapped to a resource are to be run in sequence. Our studies demonstrate that if the resource is actually a cluster with multiple processing nodes, this assumption will cause a misperception in the tasks' execution time and execution order. This will disturb the pre-designed cooperation among tasks so that the expected performance cannot be achieved. In this paper, a DAG mapping algorithm is presented for multicluster architectures. Each constituent cluster in the multicluster is shared by background work-load (from other users) and has its own independent local scheduler. The multicluster DAG mapping policy is based on theoretical analysis and its performance is evaluated through extensive experimental studies. The results show that compared with conventional DAG mapping policies, the new scheme that we present can significantly improve the scheduling performance of a DAG-based application in terms of the schedule length*. © 2006 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Implementation and evaluation of prefetching in the Intel Paragon parallel file system

Implementation and evaluation of prefetching in the Intel Pa...

引用

10th international parallel processing symposium (IPPS 96)

作者： Arunachalam, M Choudhary, A Rullman, B SYRACUSE UNIV ECESYRACUSENY 13244

ISBN: (纸本)0818672552

The significant difference between the speeds of the I/O system (e.g. disks) and compute processors in parallel systems creates a bottleneck that lowers the performance of an application that does a considerable amount of disk accesses. A major portion of the compute processors' time is wasted on waiting for I/O to complete. This problem can be addressed to a certain extent, if the necessary data can be fetched from the disk before the I/O call to the disk is issued. Fetching data ahead of time, known as prefetching in a multiprocessor environment depends a great deal on the application's access pattern. The subject of this paper is implementation and performance evaluation of a prefetching prototype in a production parallel file system on the Intel Paragon. Specifically, this paper presents a) design and implementation of a prefetching strategy in the parallel file system and b) performance measurements and evaluation of the file system with and without prefetching. The prototype is designed at the operating system level for the PFS. It is implemented in the PFS subsystem of the Intel Paragon Operating System. It is observed that in many cases prefetching provides considerable performance improvements. In some other cases no improvements or some performance degradation is observed due to the overheads incurred in prefetching.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Defending distributed systems against malicious intrusions and network anomalies

Defending distributed systems against malicious intrusions a...

引用

19th ieee international parallel and distributed processing symposium, IPDPS 2005

作者： Hwang, Kai Chen, Ying Liu, Hua University of Southern California Los Angeles CA 90089 University of Southern California

ISBN: (纸本)0769523129

Network security breaches hinder the application of distributed computing systems manifested as the Grids, clusters, intranets, extranets, or P2P systems. A new integrated approach is presented for building future, network-based intrusion detection systems (NIDS). We integrate the Snort (a NIDS) with a custom-designed anomaly detection system (ADS) to yield a powerful cyber defense system, called CAIDS. This system detects known attacks through signature matching and reveals network anomalies by Internet traffic datamining. The CAIDS design integrates two different detection engines for alert correlation between intrusions and anomalies. We aim to automate signature generation into Snort database. The system was tested over an Internet trace of 24 millions of packets containing 200 attacks. Our simulation experiments result in a 75% detection rate on all attacks with a low 5% false alarm rate. The system generates alerts on both intrusive attacks to distributed resources and anomalies detected in the Internet, intranet, and extranet connections.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

CLASSIFICATION- ORIENTED HYPERSPECTRAL AND POLSAR IMAGES SYNERGIC processing

CLASSIFICATION- ORIENTED HYPERSPECTRAL AND POLSAR IMAGES SYN...

引用

ieee international Geoscience and Remote Sensing symposium (IGARSS)

作者： Li, Tong Zhang, Junping Zhao, Honglei Shi, Cuiping Harbin Inst Technol Dept Informat Engn Harbin 150006 Peoples R China

ISBN: (纸本)9781479911141

Classification is one of the most important applications in the field of remote sensing. How to improve the accuracy of classification is the critical topic that has long obsessed the researchers. In this paper, a fusion method based on a synergic use of hyperspectral data and Polarimetric SAR (PolSAR) data is presented. This method consists of two main parts, feature-level fusion and decision-level fusion. In feature-level, parallel feature combination strategy is introduced to classification of remote sensing images. Results of feature-level fusion are used as inputs of decision-level fusion based on fuzzy set theory. The final results are compared with processing of single level and single data set, and it shows that the synergic method proposed in this paper has a superior performance in joint classification of hyperspectral and polarimetric SAR data.

关键词： Data fusion classification synergic processing hyperspectral Polarimetric SAR

来源：评论

学校读者我要写书评

暂无评论

MT-ClustalW: Multithreading multiple sequence alignment 20

MT-ClustalW: Multithreading multiple sequence alignment

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Chaichoompu, Kridsadakorn Kittitornkun, Surin Tongsima, Sissades Dept. of Computer Engineering Faculty of Engineering King Mongkut's Institute of Technology Ladkrabang Bangkok 10520 Thailand National Center for Genetic Engineering and Biotechnology Klong 1 Klong Luang Pathumtani 12120 Thailand

ISBN: (纸本)1424400546

ClustalW is the most widely used tool for aligning multiple protein or nucleotide sequences. The alignment is achieved via three stages: pairwise alignment, guide tree generation and progressive alignment. This paper analyzes and enhances a multithreaded implementation of ClustalW called ClustalW-SMP for higher throughput. Our goal is to maximize the degree of parallelism on multithreading ClustalW called MultiThreading-ClustalW (MT-ClustalW). As a result, bioinformatics laboratories are able to use this MT-ClustalW with much less energy consumption on multicore and SMP (Symmetric Multiprocessor) machines than that of PC clusters. The experiment results show that the MT-ClustalW framework can achieve a considerable speedup over the sequential ClustalW and original multithreaded ClustalW-SMP implementations. © 2006 ieee.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of distributed search in open agent systems

Performance analysis of distributed search in open agent sys...

引用

international parallel and distributed processing symposium, IPDPS 2003

作者： Dimakopoulos, Vassilios V. Pitoura, Evaggelia Department of Computer Science University of Ioannina IoanninaGR-45110 Greece

ISBN: (纸本)0769519261

In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem are based on a central directory that maintains a mapping between agents and resources. However, such solutions do not scale well since the central directory becomes a bottleneck in terms of both performance and reliability. In this paper, we introduce a different approach: each agent maintains a limited size local cache in which it keeps information about k different resources, that is, for each of k resources, it stores the contact information of one agent that provides it. This creates a directed network of caches. We address the following fundamental problem: how can an agent that needs a particular resource find an agent that provides it by navigating through this network of caches? We propose and analytically compare the performance of three different algorithms for this problem, flooding, teeming and random paths, in terms of three performance measures: the probability to locate the resource, the number of steps and the number of messages to do so. Our analysis is also applicable to distributed search in unstructured peer-to-peer networks. © 2003 ieee.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant distributed coloring algorithms that stabilize in linear time 16

Fault tolerant distributed coloring algorithms that stabiliz...

引用

16th international parallel and distributed processing symposium, IPDPS 2002

作者： Hedetniemi, S.T. Jacobs, D.P. Srimani, P.K. Department of Computer Science Clemson University ClemsonSC29634-0974 United States

ISBN: (纸本)0769515738

We propose two new self-stabilizing distributed algorithms for proper Δ+1 (Δ is the maximum degree of a node in the graph) coloring of arbitrary system graphs. Both algorithms are capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1]. The first algorithm converges in O(m) moves while the second converges in at most n moves (n is the number of nodes and m is the number of edges in the graph) as opposed to the O(Δ x n) moves required by the algorithm [1]. The second improvement is that neither of the proposed algorithms requires each node to have knowledge of Δ, as is required in [1]. Further, the coloring produced by our first algorithm provides an interesting special case of coloring, e.g., Grundy Coloring [2]. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A distributed hierarchical programming model for heterogeneous cluster of SMPs

A distributed hierarchical programming model for heterogeneo...

引用

international parallel and distributed processing symposium, IPDPS 2003

作者： Rauber, Thomas Rünger, Gudula Trautmann, Sven Fakultät für Mathematik und Physik Universität Bayreuth Bayreuth95445 Germany Fakultät für Informatik Technische Universität Chemnitz Chemnitz09107 Germany

ISBN: (纸本)0769519261

Cluster systems are getting increasingly popular since they provide large computational power at a reasonable price. The cluster nodes are often SMP with a small number of processors that can access a shared address space. The nodes are connected by a network like Myrinet or SCI, so the global address space is distributed. In this paper, we present a new programming model for such clusters of SMP. The model allows the programmer to adapt his program to the two-level structure of the address space by providing a micro-level and a macro-level. The micro-level allows a thread formulation of multiprocessor tasks that are executed within a node of the cluster system. The macro-level allows the hierarchical structuring of multiprocessor-tasks according to the structure of the algorithm using message passing for data-exchange. We demonstrate the usefulness of the approach by runtime tests on several cluster systems with different node architectures and different interconnection networks. © 2003 ieee.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

Availability/consistency balancing replication model

Availability/consistency balancing replication model

引用

21st international parallel and distributed processing symposium, IPDPS 2007

作者： Osrael, Johannes Froihofer, Lorenz Goeschka, Karl M. Vienna University of Technology Institute of Information Systems Argentinierstrasse 8/184-1 1040 Vienna Austria

ISBN: (纸本)1424409101

Replication combined with explicit management of data integrity constraints can be used to enhance availability of object-oriented, data-centric distributed systems when node and link failures occur. Our approach enhances availability by temporarily relaxing non-critical data integrity constraints during degraded situations. This requires new kinds of optimistic replication protocols that support the configuration of this trade-off. The contribution of this paper is a replication model called Availability/Consistency Balancing Replication Model that allows replicas to diverge in degraded situations if data integrity can be temporarily relaxed and re-establishes both replica consistency and data integrity during repair time. The Primary-per-Partition- Protocol and Adaptive Voting are two concrete protocols following our model. The feasibility of our approach has been shown by several prototype implementations. ©2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A Moving Target Defense Approach for the distributed Dynamic Network 21

A Moving Target Defense Approach for the Distributed Dynamic...

引用

21st ieee international symposium on parallel and distributed processing with applications, 13th ieee international Conference on Big Data and Cloud Computing, 16th ieee international Conference on Social Computing and Networking and 13th international Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Zhang, Lin Guo, Yunchuan Leng, Siyuan Li, Zifu Li, Fenghua Fang, Liang Institute of Information Engineering Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences School of Cyber Security Beijing China

ISBN: (纸本)9798350329223

The distributed dynamic network is vulnerable to scanning attacks due to the openness of wireless channels. Traditional defense systems tend to be passive and exhibit delayed responses. A moving target defense approach, namely distributed Network Address Shuffling (DNAS), is proposed to thwart attackers' network scanning through the shuffling of network addresses. To resolve address conflicts resulting from this shuffling, DNAS employs a dynamic diffusion method of allocated addresses before the shuffling process to reduce the probability of conflict generation, and utilizes a passive detection based conflict elimination algorithm after the shuffling process to eliminate any generated conflicts. To select low-risk addresses, DNAS leverages an artificial feature selection based Fully Connected Neural Network (FCNN) to recognize the attacker's scanning policy, and identifies low-risk addresses based on the scanning range of the policy. Empirical experiments and theoretical analysis indicate that DNAS significantly reduces the probability of address conflict generation at a minimal cost. It effectively eliminates all generated address conflicts within an average conflict resolution time of less than 500ms. Furthermore, DNAS exhibits an accuracy of 99.45% in recognizing scanning policies, surpassing pseudorandom address hopping in diminishing the success rate of sequential, local random, and mixed scanning. © 2023 ieee.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 469 470 471 472 473 474 475 476 477 478 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：