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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,645 篇 会议
54 篇 期刊文献
12 册 图书

馆藏范围

1,711 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
85 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,636 篇 英文
71 篇 其他
4 篇 中文
1 篇 土耳其文

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

共 1711 条记录，以下是881-890 订阅

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

详细简洁

排序：

Preliminary Resource Management for Dynamic parallel applications in the Grid

Preliminary Resource Management for Dynamic Parallel Applica...

引用

2nd international Conference on Networks for Grid applications

作者： Liu, Hao Nazir, Amril Sorensen, Soren-Aksel UCL Dept Comp Sci London WC1E 6BT England

ISBN: (纸本)9783642020797

Dynamic parallel applications such as CFD-OG impose a new problem for distributed processing because of their dynamic resource requirements at run-time. These applications are difficult to adapt in the current distributed processing model (such as the Grid) due to a lack of interface for them to directly communicate with the runtime system and the delay of resource allocation. In this paper, we propose a novel mechanism, the Application Agent (AA) embedded between an application and the underlying conventional Grid middleware to support the dynamic resource requests on the fly. We introduce AA's dynamic process management functionality and its resource buffer policies which efficiently store resources in advance to maintain the execution performance of the application. To this end, we introduce the implementation of AA.

关键词： resource management dynamic parallel application resource buffer

来源：评论

学校读者我要写书评

暂无评论

Simple broadcast synchronization in low energy-consumption distributed systems

Simple broadcast synchronization in low energy-consumption d...

引用

2009 2nd international symposium on Knowledge Acquisition and Modeling, KAM 2009

作者： Mu, Lei Jiang, Chunlan Zhao, Yumin Li, Ming Beijing Institute of Technology School of Mechatronical Engineering Beijing China China Electronics Technology Group Corporation 54th Institute Shijiazhuang Hebei Province China

ISBN: (纸本)9780769538884

A synchronized network time is essential for many applications in low energy-consumption distributed systems such as data fusion and target tracking. This paper presents a simple broadcast synchronization method for low energyconsumption distributed systems. It's based on senderreceiver scheme and uses only one time broadcast to synchronize all nodes in the distributed network. Also, this scheme uses a simple data processing method using deviation comparison to get the optimal parameters of skew and offset, which reduces the calculation complexity. Simulation results show that our method has greatly reduced energy consumption and obtained pretty good performance. © 2009 IEEE.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

The Effect of Heavy-Tailed Distribution on the Performance of Non-Contiguous Allocation Strategies in 2D Mesh Connected Multicomputers

The Effect of Heavy-Tailed Distribution on the Performance o...

引用

23rd IEEE international parallel and distributed processing symposium

作者： Mohammad, Saad Bani Al Al Bayt Univ Dept Comp Sci Prince Hussein Bin Abdullah Coll Informat Technol Mafraq 25113 Jordan

ISBN: (纸本)9781424437511

The performance of non-contiguous allocation strategies has been evaluated under the assumption that the number of messages sent by jobs, which is one of the factors that the job execution times depend on, follow an exponential distribution. However, many, measurement studies have convincingly demonstrated that the execution times of certain computational applications are best characterized by heavy-tailed job execution times. In this paper, the performance of existing non-contiguous allocation strategies is revisited in the context of heavy-tailed distributions. The strategies are evaluated and compared using simulation experiments for both First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) scheduling under a variety of system loads and system sizes. The results show that the performance of the non-contiguous allocation strategies degrades considerably when the number of messages sent follow a heavy-tailed distribution against that of the exponential distribution. Moreover, SSD copes much better than FCFS scheduling in the presence of heavy-tailed job execution times.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Aggregated Ant Colony Optimization Approach for Pricing Options

An Aggregated Ant Colony Optimization Approach for Pricing O...

引用

23rd IEEE international parallel and distributed processing symposium

作者： Udayshankar, Yeshwanth Kumar, Sameer Jha, Girish K. Thulasiram, Ruppa K. Thulasiraman, Parimala Univ Manitoba Dept Comp Sci Winnipeg MB R3T 2N2 Canada

ISBN: (纸本)9781424437511

Estimating the current cost of an option by predicting the underlying asset prices is the most common methodology for pricing options. Pricing options has been a challenging problem for along time due to unpredictability in market which gives rise to unpredictability in the option prices. Also the time when the options have to be exercised has to be determined to maximize the profits. This paper proposes an algorithm for predicting the time and price when the option can be exercised to gain expected profits. The proposed method is based on Nature inspired algorithm i.e. Ant Colony Optimization (ACO) which is used extensively in combinatorial optimization problems and dynamic applications such as mobile ad-hoc networks where the objective is to find the shortest path. In option pricing, the primary objective is to find the best node in terms of price and time that would bring expected profit to the investor. Ants traverse the solution space (asset price movements) in the market to identify a profitable node. We have designed and implemented an Aggregated ACO algorithm to price options which is distributed and robust. The initial results are encouraging and we are continuing this work further.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

distributed Transfer Network Learning Based Intrusion Detection

Distributed Transfer Network Learning Based Intrusion Detect...

引用

IEEE international symposium on parallel and distributed processing with applications

作者： Gou, Shuiping Wang, Yuqin Jiao, Licheng Feng, Jing Yao, Yao Xidian Univ Inst Intelligent Informat Proc Xian Peoples R China

ISBN: (纸本)9780769537474

In order to solve the problem that there exists unbalanced detection performance on different types of attacks in current large-scale network intrusion detection algorithms, distributed Transfer Network Learning algorithm is proposed in this paper. The algorithm introduces transfer learning into distributed Network Boosting algorithm for instructing the attacks learning with poor performance, in which the instances transfer learning is adopted for different domain adaptation. The experimental results on the Kdd Cup'99 Data Set show that the proposed algorithm has higher efficacy and better performance. Further, the detection accuracy of R2L attacks has been improved greatly while maintaining higher detection accuracy of other attack types.

关键词： Intrusion detection distributed Network Transfer Learning Instances transfer learning

来源：评论

学校读者我要写书评

暂无评论

A Faster parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

A Faster Parallel Algorithm and Efficient Multithreaded Impl...

引用

23rd IEEE international parallel and distributed processing symposium

作者： Madduri, Kamesh Ediger, David Jiang, Karl Bader, David A. Chavarria-Miranda, Daniel Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA 94720 USA Georgia Inst Technol Coll Comp Atlanta GA 30332 USA High Performance Comp Pacif Northwest Natl Lab Richland WA USA

ISBN: (纸本)9781424437511

We present a new lock free parallel algorithm for computing betweenness centrality, of massive complex networks that achieves better spatial locality compared with previous approaches. Betweenness centrality is a key kennel in analyzing the importance of vertices (or edges) in applications ranging from social networks, to power grids, to the influence of jazz musicians, and is also incorporated into the DARPA HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph analytics. We design an optimized implementation of betweenness centrality for the massively multithreaded Cray XMT system with the Thread-storm processor. For a small-world network of 268 million vertices and 2.147 billion edges, the 16-processor XMT system. achieves a TEPS rate (an algorithmic performance count for the number of edges traversed per second) of 160 million per second, which corresponds to more than a 2x performance improvement over the previous parallel implementation. We demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for the large IMDb movie-actor network.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Program Optimization of Stencil Based Application on the GPU-accelerated System

Program Optimization of Stencil Based Application on the GPU...

引用

IEEE international symposium on parallel and distributed processing with applications

作者： Wang, Guibin Yang, Xuejun Zhang, Ying Tang, Tao Fang, XuDong Natl Univ Def Technol Sch Comp Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China

ISBN: (纸本)9780769537474

Graphic processing Unit (GPU), with many lightweight data-parallel cores, can provide substantial parallel computational power to accelerate general purpose applications. But the powerful computing capacity could not be fully utilized for memory-intensive applications, which are limited by off-chip memory bandwidth and latency. Stencil computation has abundant parallelism and low computational intensity which make it a useful architectural evaluation benchmark. In this paper, we propose some memory optimizations for a stencil based application mgrid from SPEC 2K benchmarks. Through exploiting data locality in 3-level memory hierarchies and tuning the thread granularity, we reduce the pressure on the off-chip memory bandwidth. To hide the long off-chip memory access latency, we further prefetch data during computation through double-buffer. In order to fully exploit the CPU-GPU heterogeneous system, we redistribute the computation between these two computing resource. Through all these optimizations, we gain 24.2x speedup compared to the simple mapping version, and get as high as 34.3x speedup when compared with a CPU implementation.

关键词： GPGPU CUDA mgrid stencil heterogeneous system

来源：评论

学校读者我要写书评

暂无评论

An Approach for parallel Interest Matching in distributed Virtual Environments 09

An Approach for Parallel Interest Matching in Distributed Vi...

引用

13th IEEE/ACM symposium on distributed Simulation and Real-Time applications (DS-RT 2009)

作者： Liu, Elvis S. Theodoropoulos, Georgios K. Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England

ISBN: (纸本)9780769538686

Interest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing interest management schemes such as HLA DDM focus on providing precise message filtering mechanisms. However, this leads to a second problem: the computational overhead of the interest matching process. If the CPU cost of interest matching is too high, it would be unsuitable for real-time applications such as multiplayer online games for which runtime performance is important. This paper evaluates the performance of existing interest matching algorithms and proposes a new algorithm based on parallel processing. The new algorithm is expected to have better computational efficiency than existing algorithms and maintain the same accuracy of message filtering as them. Experimental evidence shows that our approach works well in practice.

关键词： Computer Games distributed Virtual Environments Interest Management High Level Architecture Data Distribution Management

来源：评论

学校读者我要写书评

暂无评论

On-line automatic resource configuration for distributed applications

On-line automatic resource configuration for distributed app...

引用

2009 2nd international Conference on Computer Science and Its applications, CSA 2009

作者： Liu, Hao Sørensen, Søren-Aksel Nazir, Amril Department of Computer Science University College London United Kingdom

ISBN: (纸本)9781424449460

A key problem in executing performance critical applications on distributed computing environments (e.g. the Grid) is the selection of resources. Research related to "automatic resource selection" aims to allocate resources on behalf of users to optimize the execution performance. However, most of current approaches are based on the static principle (i.e. resource selection is performed prior to execution) and need detailed application-specific information. In the paper, we introduce a novel on-line automatic resource selection approach. This approach is based on a simple control theory: the application continuously reports the Execution Satisfaction Degree (ESD) to the middleware Application Agent (AA), which relies on the reported ESD values to learn the execution behavior and tune the computing environment by adding/replacing/deleting resources during the execution in order to satisfy users' performance requirements. We introduce the Desired processing Capability Estimation learning policy to enable AA to learn and tune the computing environment based on the approach. A Mandelbrot computation and a Bulk Synchronization parallel (BSP) computation are performed to show the effectiveness of the approach. © 2009 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Grey Theory Based Nodes Risk Assessment in P2P Networks

Grey Theory Based Nodes Risk Assessment in P2P Networks

引用

IEEE international symposium on parallel and distributed processing with applications

作者： Fu Cai Tang Fugui Cui Yongquan Liu Ming Peng Bing Huazhong Univ Sci & Technol Coll Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9780769537474

P2P Networks are self-organized and distributed. Efficient nodes risk assessment is one of the key factors for high quality resource exchanging. Most assessment methods based on trust or reputation have some remarkable drawbacks. For example, some methods impose too many restrictions to the samples, and many methods can't identify the malicious recommendations, which result in that the final results are not convincible and credible. To solve these problems, we propose a novel risk assessment method based on grey theory. In our scheme, the communication nodes' incomplete information state is described as several key attributes. Original data of these attributes is collected using taste concourse method to avoid malicious recommendation. The analysis and computing example shows this scheme is an efficient incomplete information nodes risk assessment method in P2P networks.

关键词： P2P Networks Risk Assessment Grey Theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 85 86 87 88 89 90 91 92 93 94 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：