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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...
2 篇 fukuoka inst tec...
2 篇 guizhou universi...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 sha edwin h.-m.
3 篇 ohkawa takeshi
3 篇 wang jun
3 篇 li xiaorong
2 篇 kumar dhruv

语言

635 篇 英文
20 篇 其他

检索条件"任意字段=18th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 655 条记录，以下是381-390 订阅

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

详细简洁

排序：

Scalability Issues for Self Similarity Join in distributed systems

Scalability Issues for Self Similarity Join in Distributed S...

引用

18th Euromicro international conference on parallel, distributed and Network-Based Processing (PDP)

作者： Gennaro, Claudio Rabitti, Fausto ISTI CNR Via G Moruzzi 1 I-56124 Pisa Italy

ISBN: (纸本)9780769539393

Efficient processing of similarity joins is important for a large class of data analysis and data-mining applications. this primitive finds all pairs of records within a predefined distance threshold of each other. However, most of the existing approaches have been based on spatial join techniques designed primarily for data in a vector space. Treating data collections as metric objects brings a great advantage in generality, because a single metric technique can be applied to many specific search problems quite different in nature. In this paper, we concentrate our attention on a special form of join, the Self Similarity Join, which retrieves pairs from the same dataset. In particular, we consider the case in which the dataset is split into subsets that are searched for self similarity join independently (e.g, as in a distributed computing environment). To this end, we formalize the abstract concept of epsilon-Cover, prove its correctness, and demonstrate its effectiveness by applying it to two real implementations on a real-life large dataset.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Development of a network on chip for parallel processing systems

Development of a network on chip for parallel processing sys...

引用

9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Tanaka, Kazuto Iwanami, Satoshi Ohashi, Tuneki Yamakawa, Takeshi Fukunaga, Chikara Mathematics and Information Sciences Tokyo Metropolitan University Hachioji Tokyo Japan

ISBN: (纸本)9780889868205

We have developed a network (called TPNET) which is adaptable for any parallel processing systems. It consists of several core processors and a router. A process element in a parallel processing system is a processor called TPCORE2, which has been developed by the authors' group. Since this core processor can execute full set of the transputer instruction set, we can describe a software system using the parallel processing language occam. Occam is based on theoretically a model called Communicating Sequential Processes (CSP). If a parallel system can be described in occam language, and work fine, it will be regarded as free from any deadlocks or livelocks which will be intrinsically hidden in a parallel system. We can construct simply a secure parallel processing system in this way. Each processor can be connected to a router, and we can achieve a dynamic configuration of the network topology by controlling the router. the basic communication protocol in TPNET is IEEE 1355. An assured and efficient network can be constructed despite the structural simplicity of the protocol. With characteristics discussed above and with an efficient interrupt processing system in TPCORE2, we propose this TPNET as a basic framework for high performance embedded systems used widely in various industrial fields.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel architecture of median filter

Efficient parallel architecture of median filter

引用

9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Medhat, R. Faheem, H.M. Khaleefa, M.E. Computer Systems Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

ISBN: (纸本)9780889868205

Many attempts have been made to optimize the median filter from the software and hardware approach. An architectural design of hardware capable of performing real-time median filtering is presented. the architecture uses the histogram approach to calculate the median, while optimizing the sliding window method to reuse all its calculations. Data is output row by row and every input pixel is processed only once. the design is independent of window size or image size, and supports adding more processing elements to support wider images. the control unit design is minimized to enable self-adjustment of plug-and-play processing elements. the architecture is implemented in VHDL and synthesized to a Virtex-2 Pro FPGA. the architecture's performance as well as operation is compared to previous work.

关键词： Electric filters

来源：评论

学校读者我要写书评

暂无评论

distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid

Distributed Scheduler of Workflows with Deadlines in a P2P D...

引用

18th Euromicro international conference on parallel, distributed and Network-Based Processing (PDP)

作者： Celaya, Javier Arronategui, Unai Univ Zaragoza Dept Comp Sci & Syst Engn Zaragoza Spain

ISBN: (纸本)9780769539393

Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhead. thus, we propose a new scalable scheduler for task workflows with deadlines following a completely decentralized architecture. It's built upon a tree-based P2P overlay that supports efficient and fast aggregation of resource availability information. Constraints for deadlines and the correct timing of tasks in workflows are guaranteed with a suitable distributed management of availability time intervals of resources. A local scheduler in each node provides its available time intervals to the distributed global scheduler, which summarizes them in the aggregation process. A two phase reservation protocol looks for suitable resources that comply with workflow structure and deadline. Experimental results, from simulations of a system composed of one million nodes, show scalable fast scheduling with low overhead that can allow a high dynamic usage of computational resources.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Software distributed Shared Memory with Transactional Coherence A software engine to run transactional shared-memory parallel applications on clusters

Software Distributed Shared Memory with Transactional Cohere...

引用

18th Euromicro international conference on parallel, distributed and Network-Based Processing (PDP)

作者： Di Santo, Michele Ranaldo, Nadia Sementa, Carmine Zimeo, Eugenio Univ Sannio Dept Engn Benevento Italy

ISBN: (纸本)9780769539393

Transactional Memory is a novel, promising approach for simplifying parallel programming and increasing its acceptance and diffusion. Until now, almost all the research work on TM has been focused on shared-memory architectures, while very limited effort has been dedicated to TM on distributed-memory architectures. In this paper, we propose an extension of the transactional engine DSTM2, originally designed for hardware shared-memory systems, so as to run transactional applications on the nodes of a computer cluster. the framework obtained provides a software distributed shared memory with transactional consistency whereby threads running on the nodes of a cluster can access a shared memory with atomicity and isolation. So the physical private memory of each node contributes to form a global address space accessible through programming statements having transactional semantics. the extension proposed is also useful for experimentally evaluating different techniques to be employed in a distributed implementation of TM.

关键词： transactional memory commodity clusters distributed shared memory scalability

来源：评论

学校读者我要写书评

暂无评论

An adaptive multi-agent approach for distributed alarm correlation and fault identification

An adaptive multi-agent approach for distributed alarm corre...

引用

9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Mohamed, Abduljalil A. Basir, Otman Department of Systems Design Engineering University of Waterloo Waterloo ON Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada

ISBN: (纸本)9780889868205

Network fault management systems rely heavily on observed alarms to identify the root causes of network failures. Due to the increasing complexity of modern computer networks, the information carried by these alarms may in fact be vague, imprecise, and inconsistent. thus, these alarms often possess different diagnostic capabilities and should not be treated equally. In this paper, we propose a new distributed alarm correlation approach that effectively tackles the aforementioned data deficiencies. According to the proposed approach, the managed network is first divided into a disjoint set of management domains and each domain is assigned an intelligent agent. Within the framework of Dempster-Shafer evidence theory, the intelligent agent perceives each network entity in its domain as a source of information. As such, alarms emitted by these entities are expected to exhibit different information qualities and are assigned different weights accordingly. Based on their weights, the observed alarms are then correlated by their respective agent into a single local fuzzy composite alarm. Since local composite alarms constitute only partial views of the managed network, they are correlated, by a higher management entity, into a global alarm that accurately reflects a comprehensive view of the managed network.

关键词： Alarm systems

来源：评论

学校读者我要写书评

暂无评论

Trusted Interaction Patterns in Large-scale Enterprise Service Networks

Trusted Interaction Patterns in Large-scale Enterprise Servi...

引用

18th Euromicro international conference on parallel, distributed and Network-Based Processing (PDP)

作者： Skopik, Florian Schall, Daniel Dustdar, Schahram Vienna Univ Technol Distributed Syst Grp Argentinierstr 8-184-1 A-1040 Vienna Austria

ISBN: (纸本)9780769539393

the evolution towards cross-organizational collaboration and interaction patterns has led to the emergence of scalable, Web services-based composition infrastructures. the success of service-oriented architecture (SOA) was mainly influenced by the standardization of composition languages such as BPEL. However, compositions require humans to be in the loop and ways to interface with people in a service-oriented manner. In this paper, we discuss Human-Provided Services (HPS) enabling the seamless integration of human capabilities in SOA. In complex and large-scale environments, processes might span interactions among partially unknown participants residing in different organizational units. To address the problem of trusted selection of participants, we introduce a mining approach for the automatic inference of trust relations. Unlike a security-based view on trust, our approach relates to the emergence of trust across humans and services from a social perspective.

关键词： interaction patterns trust mixed systems human involvement in SOA online help and support

来源：评论

学校读者我要写书评

暂无评论

Constructing non-dominated m-group coteries for group mutual exclusion

Constructing non-dominated m-group coteries for group mutual...

引用

9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Harada, Takashi Yamashita, Masafumi Graduate School of Management Hiroshima University Hiroshima Japan Department of Informatics Kyushu University Fukuoka Japan

ISBN: (纸本)9780889868205

A typical group mutual exclusion algorithm among m groups makes use of anm-group coterie, which determines the performance of the algorithm. there are two main performance measures: the availability is the probability that an algorithm tolerates process crash failures, and the concurrency is the number of processes that it allows simultaneous access to the resources. Since non-dominated (ND, for short) m-group coteries (locally) maximize the availability and their degrees roughly correspond to the concurrency, methods to construct ND m-group coteries with large degrees are looked for. Nevertheless, only a few naive methods have been proposed. this paper presents three methods to construct desirable m-group coteries. the first method constructs an ND m-group coterie from a dominated one using the transversal composition. the second one constructs an ND (m - 1)-group coterie from an ND m-group coterie. the last one uses the coterie join operation to produce an ND m-group coterie from an ND coterie and another ND mgroup coterie. these methods preserve the degrees of the original m-group coteries.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

High speed eigenvalue solver on the Cell cluster system for controlling nuclear fusion plasma

High speed eigenvalue solver on the Cell cluster system for ...

引用

18th Euromicro international conference on parallel, distributed and Network-Based Processing (PDP)

作者： Kushdia, Noriyuki Takemiya, Hiroshi Tokuda, Shinji Japan Atom Energy Agcy Ctr Computat Sci & E Syst Tokyo Japan Japan Atom Energy Agcy Div Adv Plasma Res Ibaraki Japan

ISBN: (纸本)9780769539393

In this study, we developed a high speed eigenvalue solver that is the necessity of plasma stability analysis system for international thermo-nuclear Experimental Reactor (ITER) on Cell cluster system. Our stability analysis system is developed in order to prevent damages to the ITER from plasma disruption. MARG2D, which is the main part of the system, analyzes the state of plasma with the measured conditions instantaneously. According to our estimation, the most time consuming part of MARG2D is eigensolver and we must solve resulted eigensystem whose dimension is hundred thousand within a second. However, current massively parallel processor (MPP) type supercomputer is not applicable for such instantaneous calculation, because the overhead of network communication becomes dominant. therefore, we employ Cell cluster system, whose processor has higher performance than MPP's, because we can obtain sufficient processing power with small number of processors. Furthermore, we developed novel eigenvalue solver with the consideration of hierarchical architecture of Cell cluster: Inter processor, intra processor, and SIMD parallelism. Finally, we succeeded to solve the block tridiagonal Hermitian matrix, which had 1024 diagonal blocks and the size of each block was 128 x 128 within a second.

关键词： PowerXCell8i Cell cluster Eigensolver Preconditioned Conjugate Gradient Method parallel computing Plasma stability analysis

来源：评论

学校读者我要写书评

暂无评论

Evaluation of a Massively parallel Architecture for Network Security Applications

Evaluation of a Massively Parallel Architecture for Network ...

引用

18th Euromicro international conference on parallel, distributed and Network-Based Processing (PDP)

作者： Mason, Blake C. Ghosal, Dipak Corbett, Cherita Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Johns Hopkins Univ Appl Phys Lab Laurel MD 20723 USA

ISBN: (纸本)9780769539393

Network security applications such as to detect malware, security breaches, and covert channels require packet inspection and processing. Performing these functions at very high network line rates and low power is critical to safe guarding enterprise networks from various cyber-security threats. Solutions based on FPGA and single or multi-core CPUs has several limitations with regards to power and the ability to match the ever increasing line rates. this paper describes a MPPA (Massively parallelized Processing Architecture) framework based on the Ambric parallel processing device that can speed up computation of network packet processing and analysis tasks. this is accomplished with a programmable processor interconnection that enables parallelizing the application and replication of data through channels. In this paper, we consider three network security applications - detecting malware, detecting covert timing channels, and a symmetric encryption engine. Experimental analyses of parallel implementations of the detection algorithms show that MPAA can easily achieve throughput greater than 1Gbps with low power usage.

关键词： Massively parallelized Processing Architecture (MPPA) Ambric malware detection covert timing channel entropy function experimental analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：