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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
9 册 图书

馆藏范围

660 篇 电子文献
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 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

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

共 660 条记录，以下是341-350 订阅

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

详细简洁

排序：

An Autonomous Configuration Scheme of Storage Tiers for distributed File System 18

An Autonomous Configuration Scheme of Storage Tiers for Dist...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Shimano, Shingo Nunome, Atsushi Yokoi, Yuta Shibayama, Kiyoshi Hirata, Hiroaki Kyoto Inst Technol Grad Sch Informat Sci Kyoto Japan Kyoto Inst Technol Fac Informat & Human Sci Kyoto Japan Kyoto Coll Grad Studies Informat Kyoto Japan

ISBN: (纸本)9781509055043

We have proposed a distributed storage system which dynamically makes storage tiers and optimizes location of data blocks autonomously. this aims to enhance the I/O performance of the storage system without remarkable network overhead. Our system dynamically organizes storage tiers considering device characteristics. And the data blocks will be placed in a suitable storage tier according to their access pattern. In this paper, we propose a method to select the destination storage node for migration using an access characteristic of a data block to be migrated. this method ranks the storage nodes dynamically, and each storage node configures storage tiers autonomously. Simulation results show that our scheme can short the execution time of a program with file I/O by 49% at maximum, in comparison with the static migration without considering the access characteristics of the migration data.

关键词： distributed storage system storage tiering block relocation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Using unfolding to minimize inter-iteration dependencies

Using unfolding to minimize inter-iteration dependencies

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： O'Neil, Timothy W. Sha, Edwin H.-M. Computer Science Dept. University of Akron Akron OH 44325-4002 Computer Science Dept. Univ. of Texas at Dallas Richardson TX 75083-0688

Since data dependencies greatly decrease instruction level parallelism, minimizing dependencies becomes a crucial part of the process of parallelizing sequential code. Eliminating all unnecessary hazards leads to the more efficient use of resources, fewer processor stalls and easily maintainable code. Previously we proposed a novel approach for eliminating redundant data dependencies from code. In this paper, we review this method and show how this elimination technique may be combined with unfolding so as to parallelize code even further.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

WPress: An Application-Driven Performance Benchmark For Cloud-Based Virtual Machines 18

WPress: An Application-Driven Performance Benchmark For Clou...

引用

18th IEEE international Enterprise distributed Object computing conference (EDOC)

作者： Borhani, Amir Hossein Leitner, Philipp Lee, Bu-Sung Li, Xiaorong Hung, Terence Inst High Performance Comp Singapore 13863 Singapore Univ Zurich Seal Software Evolut & Architecture Lab CH-8006 Zurich Switzerland Nanyang Technol Univ Sch Comp Engn Parallel & Distributed Comp Ctr Singapore 639798 Singapore

ISBN: (纸本)9781479954704

Approaching a comprehensive performance benchmark for on-line transaction processing (OLTP) applications in a cloud environment is a challenging task. Fundamental features of clouds, such as the pay-as-you-go pricing model and unknown underlying configuration of the system, are contrary to the basic assumptions of available benchmarks such as TPC-W or RUBiS. In this paper, we introduce a systematic performance benchmark approach for OLTP applications on public clouds that use virtual machines (VMs). We propose WPress benchmark, which is based on the widespread blogging software, WordPress, as a representative OLTP application and implement an open source workload generator. Furthermore, we utilize a CPU micro-benchmark to investigate CPU performance of cloud-based VMs in greater detail. Average response time and total VM cost are the performance metrics measured by WPress. We evaluate small and large instance types of three real-life cloud providers, Amazon EC2, Microsoft Azure and Rackspace cloud. Results imply that Rackspace cloud has better average response times and total VM cost on small instances. However, Microsoft Azure is preferable for large instance type.

关键词： Benchmarking Cloud computing Virtual Machine Amazon EC2 Microsoft Azure Rackspace Cloud OLTP CPU Micro-Benchmark

来源：评论

学校读者我要写书评

暂无评论

HPGraph: A High parallel Graph Processing System Based on Flash Array

HPGraph: A High Parallel Graph Processing System Based on Fl...

引用

18th IEEE international conference on High Performance computing and Communications, 14th IEEE international conference on Smart City and 2nd IEEE international conference on Data Science and systems, HPCC/SmartCity/DSS 2016

作者： Xing, Yuxuan Feng, Ya Yu, Songping Chen, Zhengguo Liu, Fang Xiao, Nong State Key Lab. of High Performance Comput. Nat. Univ. of Defense Technol. Changsha China School of Data and Computer Science Sun Yat-sun University Guangzhou China

ISBN: (纸本)9781509042968

Large graphs analytics has been an important aspect of many big data applications, such as web search, social networks and recommendation systems. Many research focuses on processing large scale graphs using distributed system over past few years. And numbers of studies turn to construct graph processing system on a single server-class machine in consideration of cost, usability and maintainability. HPGraph is a high parallel graph processing system which adopts the edge-centric model, our contributions are as follows: (1) designing an efficient data allocation and access strategy for NUMA machine, and providing tasks scheduling to keep load balance, (2) raising a fine-grained edge-block filtering mechanism to avoid accessing unnecessary edge data, (3) constructing a high-speed flash array as the second storage. We made a detailed evaluation on a 16-core machine using asset of popular real word and synthetic data sets, and the results show that HPGraph always outperforms the state-of-the-art single machine graph processing systems-GridGraph. And HPGraph can achieve 1.27X faster than GridGraph for specific application. Our source code is available at https://***/xinghuan1990/HPGraph. © 2016 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Nature-Inspired Optimization Method : Hydrozoan Algorithm for Solving Continuous Problems 18

Nature-Inspired Optimization Method : Hydrozoan Algorithm fo...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Tansui, Daranat thammano, Arit King Mongkuts Inst Technol Ladkrabang Fac Informat Technol Computat Intelligence Lab Bangkok 10520 Thailand

ISBN: (纸本)9781509055043

In this article, a new optimization algorithm that is inspired by the biology of hydrozoa (HA) is proposed. Our aim was to develop an algorithm that is based on the regeneration and transplantation processes of hydrozoa for finding the best solutions for continuous optimization problems. Basically, HA follows the same general processes of evolutionary algorithm;however, its distinctive processes mimic the life cycle of 3 basic forms of hydrozoa: motile planula, polyps, and medusa. In particular, the growth of strong buds from the polyp stage depends on levels of morphogens: activators and inhibitors. these 3 forms develop or evolve into the best solution. HA was performance tested with 20 standard benchmark functions and compared with genetic algorithm and Particle Swarm Optimization (PSO). the test results have confirmed that the proposed algorithm is computationally more efficient than both GA and PSO. It works very well on most benchmark functions.

关键词： nature-inspired optimization method hydrozoan life cycle continuous optimization problems

来源：评论

学校读者我要写书评

暂无评论

Implementing Molecular Dynamics Simulation on Sunway TaihuLight System

Implementing Molecular Dynamics Simulation on Sunway TaihuLi...

引用

18th IEEE international conference on High Performance computing and Communications (HPCC) / 14th IEEE international conference on Smart City (Smart City) / 2nd IEEE international conference on Data Science and systems (DSS)

作者： Dong, Wenqian Kang, Letian Quan, Zhe Li, Kenli Li, Keqin Hao, Ziyu Xie, Xiang-Hui Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA Jiangnan Inst Comp Technol Wuxi 214000 Jiangsu Peoples R China

ISBN: (纸本)9781509042975

Molecular dynamics (MD) simulation is a common tool to study the physical movements of atoms and molecules in many research fields. However, it is an extremely time-consuming application which takes researchers weeks or months to run a single simulation when simulation size scales up and computing demands keep growing. In this paper, an improved MD implementation on Sunway TaihuLight supercomputer is developed to solve the above mentioned issues. the new implementation is extended from an existing implementation (i. e., LAMMPS) which widely uses the MD application. Sunway TaihuLight is a heterogeneous supercomputer with a fully customized integration approach and a brand new many-core processor SW26010. the Sunway TaihuLight takes the world's first place with peak performance over 100PFlops. We propose an optimization method of the MD simulation in three steps: paralleled extensions to SW26010, memory-access optimizations, and vectorization. After the optimization process, an 8x speedup is achieved on a single computing node. Superiorly, we also scale up to 95 thousands computing nodes (6 millions cores) with an almost leaner speedup. Besides, the proposed methods can also be applied to many other molecular dynamics codes, or similar applications.

关键词： Sunway TaihuLignt Molecular Dynamics Simulation High performance computing parallel distributed computing

来源：评论

学校读者我要写书评

暂无评论

18th international conference on distributed computing and Intelligent Technology, ICDCIT 2022

18th International Conference on Distributed Computing and I...

引用

18th international conference on distributed computing and Intelligent Technology, ICDCIT 2022

ISBN: (纸本)9783030948757

the proceedings contain 19 papers. the special focus in this conference is on distributed computing and Intelligent Technology. the topics include: An Introduction to Graph Neural Networks from a distributed computing Perspective;Towards Temporally Uncertain Explainable AI Planning;the Impact of Synchronization in parallel Stochastic Gradient Descent;a distributed Algorithm for Constructing an Independent Dominating Set;An Approach to Cost Minimization with EC2 Spot Instances Using VM Based Migration Policy;transforming Medical Resource Utilization Process to Verifiable Timed Automata Models in Cyber-Physical systems;An SDN Implemented Adaptive Load Balancing Scheme for Mobile Networks;rewriting Logic and Petri Nets: A Natural Model for Reconfigurable distributed systems;preface;Modern AI/ML Methods for Healthcare: Opportunities and Challenges;MCDPS: An Improved Global Scheduling Algorithm for Multiprocessor Mixed-Criticality systems;replication Based Fault Tolerance Approach for Cloud;A Comparative Study on MFCC and Fundamental Frequency Based Speech Emotion Classification;efficient Traffic Routing in Smart Cities to Minimize Evacuation Time During Disasters;early Detection of Parkinson’s Disease as a Pre-diagnosis Tool Using Various Classification Techniques on Vocal Features;extracting Emotion Quotient of Viral Information Over Twitter;a Novel Modified Harmonic Mean Combined with Cohesion Score for Multi-document Summarization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Actor-Based Runtime Monitoring System for Web and Desktop Applications 18

An Actor-Based Runtime Monitoring System for Web and Desktop...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Lavery, Paul Watanabe, Takuo Tokyo Inst Technol Dept Comp Sci Meguro Ku 2-12-1 Ookayama Tokyo 1528552 Japan

ISBN: (纸本)9781509055043

In this paper, we introduce a runtime monitoring method for Actor-based programs and present a Scala module that realizes the proposed method. the primary characteristic of our method is that it supports asynchronous message-passing based on the Actor model. Besides, the module does not require specialized languages for describing application properties to be monitored. Once a developer incorporates the module in his/her application, it continuously checks whether the application satisfies certain properties described as Scala code and invokes mitigation code when it finds the violation of the properties. this paper also provides two non-trivial use cases to illustrate how the module can be seamlessly integrated into actual modern Scala applications. We also demonstrate the efficiency of the module using a set of benchmarks that resulted in only 8% of the experiments causing more than 5% runtime overhead.

关键词： Estimation Field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：