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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

472 篇 会议
179 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

369 篇 工学
- 321 篇 计算机科学与技术...
- 220 篇 软件工程
- 58 篇 信息与通信工程
- 32 篇 控制科学与工程
- 32 篇 生物工程
- 29 篇 电气工程
- 24 篇 电子科学与技术（可...
- 21 篇 网络空间安全
- 16 篇 动力工程及工程热...
- 15 篇 机械工程
- 10 篇 交通运输工程
- 8 篇 光学工程
- 7 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 7 篇 生物医学工程（可授...
- 6 篇 安全科学与工程
116 篇 理学
- 65 篇 数学
- 35 篇 生物学
- 17 篇 系统科学
- 12 篇 统计学（可授理学、...
- 11 篇 化学
- 9 篇 物理学
113 篇 管理学
- 85 篇 管理科学与工程(可...
- 37 篇 图书情报与档案管...
- 33 篇 工商管理
16 篇 法学
- 10 篇 社会学
- 6 篇 法学
13 篇 经济学
- 12 篇 应用经济学
6 篇 医学
- 6 篇 基础医学(可授医学...
- 5 篇 临床医学
4 篇 文学
4 篇 农学
1 篇 教育学
1 篇 军事学
1 篇 艺术学

主题

65 篇 grid computing
34 篇 virtual machinin...
30 篇 servers
29 篇 computer science
27 篇 peer to peer com...
26 篇 computational mo...
26 篇 cloud computing
25 篇 scalability
24 篇 bandwidth
23 篇 computer archite...
21 篇 computers
20 篇 resource managem...
19 篇 protocols
19 篇 kernel
19 篇 hardware
17 篇 operating system...
17 篇 application soft...
15 篇 memory managemen...
15 篇 costs
15 篇 feature extracti...

机构

102 篇 national enginee...
71 篇 services computi...
63 篇 school of comput...
53 篇 services computi...
48 篇 school of cyber ...
32 篇 national enginee...
30 篇 cluster and grid...
28 篇 services computi...
28 篇 hubei engineerin...
27 篇 huazhong univers...
25 篇 hubei key labora...
21 篇 school of softwa...
21 篇 cluster and grid...
16 篇 school of inform...
14 篇 services computi...
14 篇 zhejiang lab
13 篇 services computi...
13 篇 huazhong univers...
12 篇 national enginee...
12 篇 service computin...

作者

326 篇 hai jin
229 篇 jin hai
80 篇 xiaofei liao
53 篇 deqing zou
45 篇 liao xiaofei
42 篇 song wu
31 篇 zou deqing
30 篇 shi xuanhua
29 篇 wu song
28 篇 xuanhua shi
25 篇 long zheng
25 篇 haikun liu
24 篇 ran zheng
21 篇 hu shengshan
17 篇 xia xie
17 篇 qin zhang
17 篇 yu zhang
15 篇 jiang xiao
15 篇 yu huang
14 篇 wan yao

语言

575 篇 英文
72 篇 其他
12 篇 中文

检索条件"机构=Services Computing Technology and System Lab & Cluster and Grid Computing Lab"

共 658 条记录，以下是511-520 订阅

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

详细简洁

排序：

iDARE: Proactive Data Replication Mechanism for P2P VoD system

iDARE: Proactive Data Replication Mechanism for P2P VoD Syst...

引用

International Conference on Computer and Information technology (CIT)

作者： Xiaofei Liao Fan Zhang Hai Jin Linchen Yu Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China China University of Geoscience Wuhan China

Peer-to-peer (P2P) on-demand streaming systems inevitably suffer from peers churn that is the inherent dynamic characteristic of overlay network. With frequent peer departure, a large amount of media data cached on peer disk turns offline and unavailable, which becomes the major reason of heavy server load. To address the above issue, a new proactive data replication mechanism is proposed and implemented in existing P2P on-demand system GirdCast. Based on the new mechanism, peer can proactively replicate data chunks to stable cache servers for future sharing, when it has high possibility to leave the overlay. Two key heuristic algorithms are designed for departure prediction and replicated chunks selection. system trace driven simulation shows that the mechanism greatly decreases bandwidth load of media source server and improves the availability of chunks highly demanded but poorly provisioned by overlay peers.

关键词： Servers Peer to peer computing Media Availability Streaming media Bandwidth Distributed databases

来源：评论

学校读者我要写书评

暂无评论

SHelp: Automatic Self-Healing for Multiple Application Instances in a Virtual Machine Environment

SHelp: Automatic Self-Healing for Multiple Application Insta...

引用

IEEE International Conference on cluster computing

作者： Gang Chen Hai Jin Deqing Zou Bing Bing Zhou Weizhong Qiang Gang Hu Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China Centre of Distributed and High Performance Computing School of Information Technologies University of Sydney NSW Australia

When multiple instances of an application running on multiple virtual machines, an interesting problem is how to utilize the fault handling result from one application instance to heal the same fault occurred on other sibling instances, and hence to ensure high service availability in a cloud computing environment. This paper presents SHelp, a lightweight runtime system that can survive software failures in the framework of virtual machines. It applies weighted rescue points and error virtualization techniques to effectively make applications by-pass the faulty path. A two-level storage hierarchy is adopted in the rescue point database for applications running on different virtual machines to share error handling information to reduce the redundancy and to more effectively and quickly recover from future faults caused by the same bugs. A Linux prototype is implemented and evaluated using four web server applications that contain various types of bugs. Our experimental results show that SHelp can make server applications to recover from these bugs in just a few seconds with modest performance overhead.

关键词： Virtual machining Databases Servers Buffer overflow Computer bugs Software Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A Hierachical VoIP system Based on Peer-to-Peer SIP: A Manageable Approach

A Hierachical VoIP System Based on Peer-to-Peer SIP: A Manag...

引用

International Conference on Computer and Information technology (CIT)

作者： Linchen Yu Xiaofei Liao Hai Jin Pengcheng Qin Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer China University of Geoscience Wuhan China

Peer-to-Peer SIP is proposed to leverage Peer-to-Peer computing to control multimedia sessions in a decentralized manner. A lot of companies can be benefited if conventional SIP environment does not require the configuration and maintenance of central servers. However, existing P2PSIP systems put too much emphasis on the decentralization of SIP elements and the briefness of distribution. To some extent, P2PSIP system is manageable, but the control of the entire system is still relatively weak. In this paper, we propose a hierarchical P2PSIP system to address the manageable problems. Actual deployment and exhaustive simulations are performed to evaluate the performance of our P2PSIP schemes. Results indicate that the manageable approach not only solves the control liability problem, but also performs good reliability, scalability, and interoperability.

关键词： Servers Tin Reliability Protocols IP networks Authentication Registers

来源：评论

学校读者我要写书评

暂无评论

LEEN: Locality/Fairness-Aware Key Partitioning for MapReduce in the Cloud

LEEN: Locality/Fairness-Aware Key Partitioning for MapReduce...

引用

IEEE International Conference on Cloud computing technology and Science (CloudCom)

作者： Shadi Ibrahim Hai Jin Lu Lu Song Wu Bingsheng He Li Qi Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China School of Computer Engineering Nanyang Technological University Singapore Information and Technology Department China Development Bank Beijing China

This paper investigates the problem of Partitioning Skew in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence of partitioning skew causes a huge amount of data transfer during the shuffle phase and leads to significant unfairness on the reduce input among different data nodes. As a result, the applications experience performance degradation due to the long data transfer during the shuffle phase along with the computation skew, particularly in reduce phase. We develop a novel algorithm named LEEN for locality-aware and fairness-aware key partitioning in MapReduce. LEEN embraces an asynchronous map and reduce scheme. All buffered intermediate keys are partitioned according to their frequencies and the fairness of the expected data distribution after the shuffle phase. We have integrated LEEN into Hadoop-0.18.0. Our experiments demonstrate that LEEN can efficiently achieve higher locality and reduce the amount of shuffled data. More importantly, LEEN guarantees fair distribution of the reduce inputs. As a result, LEEN achieves a performance improvement of up to 40% on different workloads.

关键词： Partitioning algorithms Distributed databases Cloud computing Performance evaluation Time factors Degradation Kernel

来源：评论

学校读者我要写书评

暂无评论

Data Hiding in Virtual Machine Disk Images

Data Hiding in Virtual Machine Disk Images

引用

International Conference on Computer and Information technology (CIT)

作者： Yu Su Xiaofei Liao Hai Jin Tim Bell Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computer Science and Software Engineering College of Engineering University of Canterbury Christchurch New Zealand

Data hiding in computer system is an interesting and important research issue, which brings benefits for secret communication and watermarking. The development of virtual machine brings new potential for data hiding. In this paper we explore the potential for data hiding in virtual machine disk images, and especially hiding schemes that can be used with copy-on-write images. Besides being considered as a way for valid uses such as secret communication and watermarking, these schemes can be a warning against malicious intentions as well. Furthermore, it lays the foundation for a more thorough analysis of the whole virtual machine system for data hiding.

关键词： File systems Detectors Writing Virtual machining Linux Fats Virtual environment

来源：评论

学校读者我要写书评

暂无评论

Agent-based data loading method in medlmgrid

Agent-based data loading method in medlmgrid

引用

2009 International Conference on New Trends in Information and Service Science, NISS 2009

作者： Zheng, Ran Jin, Hai Zhang, Qin Liu, Xin Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769536873

Agent-based grid data loading method aims at integrating heterogeneous hospitals' information systems into a medical information exchange platform based on grid middleware. It collects distributed data sets for decision support system, which makes data sources expanded from independent database modes to medical information systems in wide area. Virtual data access with grid service improves data security and makes data modification in local system more flexible. HL7 protocol and middleware are utilized to transform HL7 data into various local data structures for keeping the independence of each hospital information system and providing more convenience and expansibility for various medical applications. © 2009 IEEE.

关键词： Medical applications

来源：评论

学校读者我要写书评

暂无评论

Adaptive multi-round scheduling strategy for divisible workloads in grid environments

Adaptive multi-round scheduling strategy for divisible workl...

引用

International Conference on Information Networking

作者： Yongcai Tao Hai Jin Song Wu Xuanhua Shi Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781424445264

Scheduling is the key to divisible workload execution. UMR (uniform multi-round) algorithm potentially performs near optimal by improving overlap of communication and computation. However, it is questioned how a static schedule works effectively in dynamic grid environment. The paper proposes an adaptive divisible workload scheduling system, which can adjust the schedule in a proactive way. An adaptive UMR-based multi-round algorithm (called AUMR) is presented and evaluated. In AUMR, if the run-time resource monitor notifies the scheduler of any resource changes, the scheduler will evaluate its impact and adjust the schedule if necessary. The experiment results show a considerable performance improvement by AUMR in dynamic grid environment.

关键词： Adaptive scheduling Processor scheduling grid computing Dynamic scheduling Monitoring Scheduling algorithm Robustness Delay Computers clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A High-efficient inter-domain data transferring system for virtual machines 09

A High-efficient inter-domain data transferring system for v...

引用

3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09

作者： Li, Dingding Jin, Hai Shao, Yingzhe Liao, Xiaofei Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605584058

Virtual machine (VM) technologies are becoming more and more important among industrial and academic institutions with the decreasing cost of computer hardware. It can offer a lot of benefits including performance isolation, server consolidation, and live migration. However, the development of virtualization technology is preferred to application isolation as yet, thus the performance overheads of communicate between virtual machines which are resident on the same physical machine are relatively high. In network-intensive applications, such as Internet servers, are consolidated in a physical machine using VM technology, the inter-domain shared memory communication mechanisms is necessary. In other words, nearly all the virtual machine monitors are not very efficient in I/O performance to meet these applications' requirements. As a result, some scholars resort to inter-domain shared memory mechanisms to improve data transferring performance, but some of these solutions only provide one-way tunnel for domains to communicate with each other, and others are not network-bypass, which use the existing AF-INET protocol family, and incur unnecessary overhead brought by TCP/IP stack. In this paper, we present an inter-domain data transferring system, called IDTS, with dual-way tunnels and fully network-bypass features in Xen virtual machine environment. The design of IDTS is different from virtual network scheme in that IDTS uses static circular memory buffer shared between domains instead of the Xen page-flipping mechanism. In order to enable dual-way communication, IDTS provides two shared memory tunnels for co-resident domains to communicate with each other. Our evaluation demonstrates that IDTS can reduce inter-domain round trip latency by nearly a factor of 4, and increase bandwidth by approximately 5 times, and also keep high scalability, compared with traditional TCP/IP approach. Copyright 2009 ACM.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

VMFence: A customized intrusion prevention system in distributed virtual computing environment 09

VMFence: A customized intrusion prevention system in distrib...

引用

3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09

作者： Jin, Hai Xiang, Guofu Zhao, Feng Zou, Deqing Li, Min Shi, Lei Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605584058

Intrusion Prevention system (IPS) has been an effective tool to detect and prevent unwanted attempts, which are mainly through network and system vulnerabilities, at accessing and manipulating computer systems. Intrusion detection and prevention are two main functions of IPS. As attacks are becoming massive and complex, the traditional centralized IPSes are incapable of detecting all those attempts. The existing distributed IPSes, mainly based on mobile agent, have some serious problems, such as weak security of mobile agents, response latency, large code size. In this paper, we propose a customized intrusion prevention system, VMFence, in distributed virtual computing environment to simplify the complexity of the management. In VMFence, the states of detection processes vary with those of Virtual Machines (VMs), which are described by Deterministic Finite Automata (DFA). The detection processes, each of which detects one virtual machine, reside in a privileged virtual machine. The processes run synchronously and outside of VMs in order to achieve high performance and security. The experimental results also show VMFence has higher detection efficiency than traditional intrusion detection systems and little impact on the performance of the monitored VMs. Copyright 2009 ACM.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Live virtual machine migration with adaptive memory compression

Live virtual machine migration with adaptive memory compress...

引用

2009 IEEE International Conference on cluster computing and Workshops, cluster '09

作者： Jin, Hai Li, Deng Wu, Song Shi, Xuanhua Pan, Xiaodong Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781424450121

Live migration of virtual machines has been a powerful tool to facilitate system maintenance, load balancing, fault tolerance, and power-saving, especially in clusters or data centers. Although pre-copy is a predominantly used approach in the state of the art, it is difficult to provide quick migration with low network overhead, due to a great amount of transferred data during migration, leading to large performance degradation of virtual machine services. This paper presents the design and implementation of a novel memory-compressionbased VM migration approach (MECOM) that first uses memory compression to provide fast, stable virtual machine migration, while guaranteeing the virtual machine services to be slightly affected. Based on memory page characteristics, we design an adaptive zero-aware compression algorithm for balancing the performance and the cost of virtual machine migration. Pages are quickly compressed in batches on the source and exactly recovered on the target. Experiment demonstrates that compared with Xen, our system can significantly reduce 27.1% of downtime, 32% of total migration time and 68.8% of total transferred data on average. ©2009 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：