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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,712 篇 会议
29 册 图书
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,296 篇 工学
- 1,195 篇 计算机科学与技术...
- 535 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
164 篇 管理学
- 116 篇 管理科学与工程(可...
- 58 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

154 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
67 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 resource managem...

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 rothermel kurt
10 篇 shen hong
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,727 篇 英文
30 篇 俄文
4 篇 其他
3 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1765 条记录，以下是201-210 订阅

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

详细简洁

排序：

A bi-criteria algorithm for scheduling parallel task graphs on clusters 10

A bi-criteria algorithm for scheduling parallel task graphs ...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Desprez, Frédéric Suter, Frédéric INRIA LIP ENS Lyon Lyon France IN2P3 Computing Center CNRS/IN2P3 Lyon-Villeurbanne France

ISBN: (纸本)9781424469871

applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a long-standing challenge. In the case of a single homogeneous cluster, most of the existing algorithms focus on the reduction of the application completion time (makespan). But in presence of resource managers such as batch schedulers and due to accentuated pressure on energy concerns, the produced schedules also have to be efficient in terms of resource usage. In this paper we propose a novel bi-criteria algorithm, called biCPA, able to optimize these two performance metrics either simultaneously or separately. Using simulation over a wide range of experimental scenarios, we find that biCPA leads to better results than previously published algorithms. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploring the Search Space between Active and Passive Workflow Replication 10

Exploring the Search Space between Active and Passive Workfl...

引用

10th IEEE international conference on Service-Oriented computing and applications (SOCA)

作者： Schaefer, David Richard Rothermel, Kurt Tariq, Muhammad Adnan Univ Stuttgart Inst Parallel & Distributed Syst Stuttgart Germany

ISBN: (纸本)9781538613269

Today, workflows are executed in heterogeneous environments, such as the Internet, to automate interactions with services of business partners and other third parties. In such heterogeneous environments, device and communication failures occur frequently. these failures might delay or even stop the workflow executions rendering the workflow unavailable. For ensuring availability, workflow executions are replicated on multiple devices allowing the workflow execution to continue even if some of the devices fail. So far, two workflow replication mechanisms have been proposed: active and passive replication. While active replication incurs high cost in terms of compensation even for failure free executions, passive replication provides lower availability than active replication. In this paper, we propose a new replication mechanism called partition-tolerant replication that combines the benefits of active and passive replication. Our evaluations on OpenStack show that partition-tolerant replication imposes no compensation cost for failure free executions like passive replication while providing availability close to active replication.

关键词： TV Protocols Voting Computer crashes Computational modeling Delays

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed Visualization the State of the Art

Parallel and Distributed Visualization The State of the Art

引用

5th international conference on Computer Graphics, Imaging and Visualization (CGIV)

作者： Meligy, Ali Middle E Univ Grad Studies Fac Informat Technol Amman Jordan

ISBN: (纸本)9780769533599

Visualization is one of the most important applications of computer graphics. To have a parallel infrastructure for visualization, some technologies would be needed. We identify the state-of-the-art technologies that have prepared for building such an infrastructure and examine a collection of applications that would benefit from it. We consider a broad range of scientific and technological advances in visualization, which are relevant to visual supercomputing. Mainly, we present the original abstracts from the cited papers.

关键词： parallel processing distributed processing cluster computers parallel rendering algorithms visual supercomputing visualization autonomic computing mobile visualization

来源：评论

学校读者我要写书评

暂无评论

Congestion Control Algorithm based on Loss Trend Oriented to Many-to-many Reliable Multicast

Congestion Control Algorithm based on Loss Trend Oriented to...

引用

3rd international Workshop on e-Activity (IWEA2009)/10th ACIS international conference on Software Engineering Artificial Intelligence, Networking and parallel/distributed computing

作者： Liu Li Zhou Zhong Liu Dongmei Wu Wei State Key Lab Virtual Real Technol & Syst Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (纸本)9780769536422

Congestion control algorithms of existing reliable multicast protocols are mainly derived from end-to-end model, which has high resource requirements and sometimes suppresses the package sending too much. Many-to-many reliable multicast requires efficient congestion control over a one-to-many model. It's an important mechanism to use many-to-many multicast in LAN (Local Area Network) in distributed simulation. In this paper, a congestion control algorithm based on loss trend for many-to-many reliable multicast is proposed. It predicts future package loss of receivers on the analysis of historic loss and buffer variety, and then control the congestion by adjusting the sending rate in advance. this algorithm aims at the reliable multicast in LAN. the main idea of the algorithm is to lower the possibility of multicast package loss, and then the nodes can afford the cost of package recovery. It alleviates the congestion on the depression of package loss possibility by regulating the sending rate. Experiment results indicate that the algorithm can keep a high throughput of many-to-many reliable multicast with relatively real-time performance.

关键词： many-to-many reliable multicast congestion control distributed simulation

来源：评论

学校读者我要写书评

暂无评论

Entropy based mitigation of distributed-Denial-of-Service (DDoS) attack on Control Plane in Software-Defined-Network (SDN) 10

Entropy based mitigation of Distributed-Denial-of-Service (D...

引用

10th international conference on computing, Communication and Networking technologies (ICCCNT)

作者： Yadav, Sanjay Kumar Suguna, P. Velusamy, R. Leela Natl Inst Technol Comp Sci & Engn Tiruchirappalli 620015 India

ISBN: (纸本)9781538659069

SDN is new networking concept which has revolutionized the network architecture in recent years. It decouples control plane from data plane. Architectural change provides re- programmability and centralized control management of the network. At the same time it also increases the complexity of underlying physical infrastructure of the network. Unfortunately, the centralized control of the network introduces new vulnerabilities and attacks. Attackers can exploit the limitation of centralized control by DDoS attack on control plane. the entire network can be compromised by DDoS attack. Based on packet entropy, a solution for mitigation of DDoS attack provided in the proposed scheme.

关键词： SDN Data plane Control plane Centralized control DDoS Attack Vulnerabilities Mitigation Entropy

来源：评论

学校读者我要写书评

暂无评论

A User Behavior Anomaly Detection Approach based on Sequence Mining over Data Streams 17

A User Behavior Anomaly Detection Approach based on Sequence...

引用

17th international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Zhou, Yong Wang, Yijie Ma, Xingkong Natl Univ Def Technol Coll Comp Natl Key Lab Parallel & Distributed Proc Changsha Hunan Peoples R China

ISBN: (纸本)9781509050819

How to design a low-latency and accurate approach for user behavior anomaly detection over data streams has become a great challenge. However, existing studies cannot meet low-latency and accurate requirements, due to a large number of subsequences and sequential relationship in behaviors. this paper presents BADSM, a user behavior anomaly detection approach based on sequence milling over data streams that seeks to address such challenge. BADSM uses self-adaptive behavior pruning algorithm to adaptively divide data stream into behaviors and decrease the number of subsequences to improve the efficiency of sequence mining. Meanwhile, the top-k abnormal scoring algorithm is used to reduce the complexity of traversal and obtain quantitative detection result to improve accuracy. We design and implement a streaming anomaly detection system based on BADSM to perform online detection. Extensive experiments confirm that BADSM significantly reduces processing delay by at least 36.8% and false positive rate by 6.4% compared with the classic sequence mining approach PrefixSpan.

关键词： anomaly detection sequence mining data stream user behavior

来源：评论

学校读者我要写书评

暂无评论

ProjectileSort - Rule based parallel sorting algorithm - Architecture for reconfigurable multi-partition object arrays 18

ProjectileSort - Rule based parallel sorting algorithm - Arc...

引用

18th international conference on parallel and distributed computing, applications and technologies, PDCAT 2017

作者： Liyanage, Nandika Staffordshire University United Kingdom

ISBN: (纸本)9781538631515

Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time consuming task even using the latest hardware and software technologies. Sorting is one of the key concepts that helps to improve the efficiency of various computational process. Unlike the early single processor or single server operations using monolithic applications, multi-core distributed environments required more advanced computational theories and algorithms. Existing sorting theories are basically derived from linear algorithms and enhanced to support for distributed processing. this research discuss the characteristics of existing parallel sorting algorithms, techniques, limitation. Aim and objective is to introduce a new pure parallel sorting algorithm and sorting architecture that pointing to execute under latest distributed environments. the proposed pattern and the sorting architecture can be used as rule based parallel sorting technique and algorithm to support for any type of distributed environment to sort infinite dataset. © 2017 IEEE.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

A Voronoi-trajectory based hybrid routing (VTBR) algorithm for wireless ad hoc networks with obstacles

A Voronoi-trajectory based hybrid routing (VTBR) algorithm f...

引用

6th international conference on parallel and distributed computing, applications and technologies (PDCAT 2005)

作者： Wu, D Qu, Y Chi, ZX Dalian Univ Technol Dept Comp Sci & Engn Dalian 116024 Peoples R China

ISBN: (纸本)0769524052

Position based routing methods can construct effective routes;however, in some topologies with obstacles, such algorithms may end in failure. In order to avoid stationaty obstacles, this paper presents a Voronoi-trajectory based hybrid routing (VTBR) algorithm that combines both proactive and reactive routing, trategies to provide high routing performance. If the destination node is within the source node's two-hop range, then the source will consult the routing table to determine the route. When the destinction is beyond that range, the source establishes a trajectory which is the set of points of the shortest obstacle-avoiding path. the intermediate nodes take the forwarding decision based on the relationship to the trajectory. Eventually, an example and simulation experiments are conducted to validate and evaluate the performance of VTBR. Our simulation results show that the proposed algorithm makes it possible to successfully construct the routes.

关键词： Ad hoc networks Computer science Network topology Discrete event simulation Mobile ad hoc networks Mobile communication Routing protocols Computational geometry Joining processes distributed computing

来源：评论

学校读者我要写书评

暂无评论

Low-cost tuning of two-step algorithms for scheduling mixed-parallel applications onto homogeneous clusters 10

Low-cost tuning of two-step algorithms for scheduling mixed-...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Hunold, Sascha International Computer Science Institute Berkeley CA United States

ISBN: (纸本)9781424469871

Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. parallel applications are often expressed using a task-parallel model (task graphs), in which tasks can be executed concurrently unless they share a dependency. If these tasks can also be executed in a data-parallel fashion, e.g., by using MPI or OpenMP, then we call it a mixed-parallel programming model. Mixed-parallel applications are often modeled as directed acyclic graphs (DAGs), where nodes represent the tasks and edges represent data dependencies. To execute a mixed-parallel application efficiently, a good scheduling strategy is required to map the tasks to the available processors. Several algorithms for the scheduling of mixed-parallel applications onto a homogeneous cluster have been proposed. MCPA (Modified CPA) has been shown to lead to efficient schedules. In the allocation phase, MCPA considers the total number of processors allocated to all potentially concurrently running tasks as well as the number of processors in the cluster. In this article, it is shown how MCPA can be extended to obtain a more balanced workload in situations where concurrently running tasks differ significantly in the number of operations. We also show how the allocation procedure can be tuned in order to deal not only with regular DAGs (FFT), but also with irregular ones. We also investigate the question whether additional optimizations of the mapping procedure, such as packing of allocations or backfilling, can reduce the makespan of the schedules. © 2010 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Programming models based on data versioning for dependency-aware task-based parallelisation

Programming models based on data versioning for dependency-a...

引用

15th IEEE international conference on Computational Science and Engineering (CSE) / 10th IEEE/IFIP international conference on Embedded and Ubiquitous computing (EUC)

作者： Zafari, Afshin Tillenius, Martin Larsson, Elisabeth Uppsala Univ Dept Informat Technol SE-75105 Uppsala Sweden

ISBN: (纸本)9781467351652;9780769549149

By using task-based programming models, application developers who are not necessarily experts in parallel programming get access to the potentially high performance of multi-core based computer systems. We have derived a family of task parallel programming models where data dependencies are represented through data versioning. Benefits of using this type of model are that it is easy to represent different types of dependencies and that scheduling decisions can be made locally. Experiments show that a thread parallel shared memory implementation as well as a hybrid thread/MPI distributed memory implementation scale well on a system with 64 cores. Comparing the hybrid implementation with a pure MPI version, the results are comparable for small numbers of cores, but for larger numbers of cores the gain of using the hybrid model is substantial.

关键词： data dependency data versioning distributed memory hybrid multi-core task parallel data dependency distributed memory HYBRID parallel programming core Hybrid modes Hybrid electric vehicles HIGH-PERFORMANCE application developer Programming Core samples Computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：