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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是331-340 订阅

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

详细简洁

排序：

Job relocation: A method to enhance the performance of gang scheduling on clusters of PCs

Job relocation: A method to enhance the performance of gang ...

引用

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

作者： Zhou, BB Univ Sydney Sch Informat Technol Sydney NSW 2600 Australia

ISBN: (纸本)0780378407

Resource allocation and reallocation are very important issues affecting the performance of gang scheduling. Currently most gang scheduling systems adopt regular allocation policies. For many existing clusters of PCs, however, processors are interconnected via a fast Ethernet or a crossbar switch network and the location of processors is not a significant factor when communication costs are considered. Adopting regular allocation policies may cause unnecessary problems of fragmentation. In this paper we introduce a job-relocation method to alleviate the fragmentation problem.

关键词： cluster of PCs gang scheduling parallel computing resource allocation

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed broadcasting algorithm for wireless ad hoc networks

An efficient distributed broadcasting algorithm for wireless...

引用

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

作者： Li, YM Peng, ST Chu, WM Hosei Univ Dept Comp Sci Tokyo 1848584 Japan

ISBN: (纸本)0769524052

In this paper we propose a distributed broadcasting algorithm for wireb?ss ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. the proposed algorithm is more efficient than the existing broadcasting algorithms in the literatures. that is, the size of the forwarding nodes found by our algorithm is smaller and the running time is faster than other broadcasting. algorithms. Reducing the number of forwarding nodes will decrease the probability of transmission collision, and hence improve the packet delivery ratio. the algorithm runs in O (d(2)) time, where d is the maximum node degree. the full coverage is not guaranteed but as shown by the simulation results, the probability of full coverages can be over 99 percent when the network contains 100 or more nodes.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A Variable Markovian based Outlier Detection Method for Multi-dimensional Sequence over Data Stream 17

A Variable Markovian based Outlier Detection Method for Mult...

引用

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

作者： Yang, Dongsheng Wang, Yijie Li, Yongmou Ma, Xingkong Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781509050819

Nowadays sequence data tends to be multidimensional sequence over data stream, it has a large state space and arrives at unprecedented speed. It is a big challenge to design a multi-dimensional sequence outlier detection method to meet the accurate and high speed requirements. the traditional methods can't handle multi-dimensional sequence effectively as they have poor abilities for multi-dimensional sequence modeling, and can't detect outlier timely as they have high computational complexity. In this paper we propose a variable Markovian based outlier detection method for multi-dimensional sequence over data stream, VMOD, which consists of two algorithms: mutual information based feature selection algorithm (MIFS), variable Markovian based sequential analysis algorithm (VMSA). It uses MIFS algorithm to reduce the state space and redundant features, and uses VMSA algorithm to accelerate the outlier detection. through VMOD method, we can improve the detection rate and detection speed. the MIFS algorithm uses mutual information as similarity measures and adopt clustering based strategy to select features, it can improve the abilities for sequence modeling through reducing the state space and redundant features, consequently, to improve the detection rate. the VMSA algorithm use random sample and index structure to accelerate the variable Markovian model construction and reduce the model complexity, consequently, to quicken the outlier detection. the experiments show that VMOD can detect outlier effectively, and reduce the detection time by at least 50% compared with the traditional methods.

关键词： multi-dimensional sequence data stream outlier detection feature selection mutual information variable Markovian

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithm for Triangular Mesh Reconstruction by Deformation in Medical applications

Parallel Algorithm for Triangular Mesh Reconstruction by Def...

引用

10th international conference on parallel computing technologies

作者： Nechaeva, Olga Afanasyev, Ivan Russian Acad Sci Supercomp Software Dept ICMMG Siberian Branch Pr Lavrentieva 6 Novosibirsk 630090 Russia Novosibirsk State Univ Dept Mech & Math Novosibirsk 630090 Russia

ISBN: (纸本)9783642032745

the main goal of this paper is to develop an efficient method of triangular mesh generation for physical objects which have similar geometrical structure. the method is based on deforming a high quality mesh generated over some "ideal" object into another object of the same structure with mesh quality preservation. the approach uses the Self Organizing Maps algorithm and has been applied for constructing meshes on human femur bones using the GeomBox and GeomRandom packages. A parallel deformation algorithm is implemented using MPI. the efficiency of the parallelization is about 90%.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling of Task Graphs on parallel Systems

Optimal Scheduling of Task Graphs on Parallel Systems

引用

9th international conference on parallel and distributed computing, applications and technologies

作者： Shahul, Ahmed Zaki Semar Sinnen, Oliver Hewlett Packard New Zealand 22 Viaduct Harbour AveMaritime SqPOB 3860 Auckland New Zealand Univ Auckland Dept Elect & Comp Engn Auckland New Zealand

ISBN: (纸本)9780769534435

Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hard nature of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example for time critical systems or to evaluate scheduling heuristics. this paper investigates the task scheduling problem using A* search algorithm. the A* scheduling algorithm implemented can produce optimal schedules in reasonable time for small to medium sized task graphs. In comparison to a previous approach, the here presented A* scheduling algorithm has a significantly reduced search space due to a much improved cost function f (s) and additional pruning techniques. Last but not least, the experimental results show that the proposed A* scheduling algorithm significantly outperforms the previous approach.

关键词： parallel computing scheduling task graphs optimal schedules A

来源：评论

学校读者我要写书评

暂无评论

A parallel approach to evidence combination on qualitative Markov trees

A parallel approach to evidence combination on qualitative M...

引用

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

作者： Hong, X Liu, WR Adamson, K Univ Ulster Sch Comp & Informat Engn Coleraine BT52 1SA Londonderry North Ireland

ISBN: (纸本)0780378407

Dempster's rule of evidence combination is computational expensive. this paper presents a parallel approach to evidence combination on a qualitative Markov tree. Binarization algorithm transforms a qualitative Markov tree into a binary tree based on the computational workload in nodes for an exact implementation of evidence combination. A binary tree is then partitioned into clusters with each cluster being assigned to a processor in a parallel environment. the parallel implementation improves the computational efficiency of evidence combination.

关键词： evidence combination binarization partition cluster parallel processing

来源：评论

学校读者我要写书评

暂无评论

A new way to high performance NFS for clusters

A new way to high performance NFS for clusters

引用

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

作者： Tang, RF Xiong, J Ma, J Meng, D Chinese Acad Sci Grad Sch Natl Res Ctr Intelligent Comp Syst Inst Comp Technol Beijing 100864 Peoples R China

ISBN: (纸本)0769524052

For its simplicity, reliability and maturity, NFS is widely-used in clusters. However, due to its high overheads and implementation limitations, the standard NFS cannot fully exert the potential abilities provided by multiple network channels and multiple SCSI channely on the server. In this paper, we present a new efficient way to high performance NFS implementation for cluster applications. By adding mechanisms to make good use of NFS server's multiple communication channels and multiple I/O channels, CluserNFS can potentially provide better I/O performance khan standard NFS, as illustrated by our simulation experiment results.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Accounting and Billing Challenges in Large Scale Emerging Cloud technologies 10

Accounting and Billing Challenges in Large Scale Emerging Cl...

引用

10th international conference on Cloud computing and Services Science (CLOSER)

作者： Harsh, Piyush Serhiienko, Oleksii Zurich Univ Appl Sci Winterthur Switzerland

ISBN: (纸本)9789897584244

Billing models which can easily adapt with emerging market opportunities is essential in long term survival of any business. Accounting and billing is also one of the few processes which has wide impact on legal and regulatory compliance, revenue lines as well as customer retention models of all businesses. In the era of rapid technology shifts, with emergence of Fog and Edge deployment models, and marriage of IoT and cloud which promises smart-everything everywhere, it is paramount to understand what new challenges must be addressed within any billing framework. In this paper we list several emerging challenges which should be overcome in architecting any future-ready billing platform. We also present briefly an analysis of few technologies which could be used in prototyping such a solution. We present our proof of concept experiment along with initial results highlighting the feasibility of our proposed architecture towards a scalable billing framework for massively distributed IoT applications at the edge.

关键词： Accounting Billing IoT Edge Fog Cloud Architecture

来源：评论

学校读者我要写书评

暂无评论

Joint selection of providers and the new comer for optimal repair in distributed storage network with network coding 15

Joint selection of providers and the new comer for optimal r...

引用

Joint 15th IEEE international conference on Trust, Security and Privacy in computing and Communications, 10th IEEE international conference on Big Data Science and Engineering and 14th IEEE international Symposium on parallel and distributed Processing with applications, IEEE TrustCom/BigDataSE/ISPA 2016

作者： Jia, Chengjin Wang, Jin Zhu, Yanqin Wen, Zhengqing Jia, Juncheng Department of Computer Science and Technology Soochow University China Collobrative Innovation Center of Novel Software Technology and Industrialization China

ISBN: (纸本)9781509032051

In distributed storage networks (DSN), server failures occur frequently. Although network coding can provide high reliability of storage in DSN, to maintain reliability, a new server, named the new comer, should be firstly implemented to replace the failed server. then, new comer should download enough data from multiple storage servers, called provider selected from surviving servers to regenerate the lost data. therefore, the providers, new comer and data routing have a great impact on regeneration time during repair process. In this paper, we jointly consider the providers and new comer selection (JPNS) problem with two objectives of minimizing regeneration time and minimizing transmission cost under the minimum regeneration time guarantee. Specifically, for the first objective, we firstly model the JPNS problem as a mathematical programming and formulate it as an integer linear programming (ILP). We also propose a Heuristic Providers and New Comer Selection (HPNS) algorithm. For the second objective, based on the providers and a new comer selected by the HPNS algorithm, we give a linear programming (LP) to optimally obtain the routing paths and flows from these providers to the new comer with minimum transmission cost. Finally, we conduct extensive simulation experiments and the results show the effectiveness of the proposed algorithms. © 2016 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel scheduling algorithm of dependent task graphs

An efficient parallel scheduling algorithm of dependent task...

引用

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

作者： Shang, MS Sun, SX Wang, QX Univ Elect Sci & Technol China Dept Comp Sci Chengdu 610054 Peoples R China

ISBN: (纸本)0780378407

Optimal scheduling of tasks of a directed acyclic graph (DAG) onto a set of processors is a strong NP-hard problem. Because list scheduling has shown good performance and is less difficult to design, it has been studied and used widely. In this paper we present a new list scheduling scheme to schedule tasks of a DAG onto a homogeneous multi-processors system. the primary objective of this scheme is to minimize schedule length and scheduling time itself. We analyzed three typical list scheduling algorithms-MCP algorithm, ETF algorithm and BDCP algorithm, and find that they all can not guarantee the earliest schedules of the CPNs. In this paper, we propose a better list scheduling algorithm based on critical path, and its time-complexity is O(pv(2)). this algorithm always it is the most important purpose that schedule CPN as soon as it is a ready task, which makes the nodes that have the greatest influence to the scheduling length of the task graph be scheduled first. this greatly shortens the scheduling length of the task graph. We compare the performance of this algorithm with existing scheduling scheme through analysis and the result of experiments. the scheduling length generated by this algorithm is shorter than that of other scheduling algorithm.

关键词： list scheduling critical path parallel algorithm system

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：