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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

169 篇 会议
70 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

99 篇 工学
- 75 篇 计算机科学与技术...
- 49 篇 软件工程
- 16 篇 信息与通信工程
- 11 篇 生物工程
- 9 篇 电气工程
- 9 篇 网络空间安全
- 7 篇 控制科学与工程
- 5 篇 机械工程
- 4 篇 动力工程及工程热...
- 4 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 轻工技术与工程
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
34 篇 理学
- 15 篇 生物学
- 13 篇 数学
- 5 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 大气科学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 天文学
30 篇 管理学
- 26 篇 管理科学与工程(可...
- 7 篇 工商管理
- 4 篇 图书情报与档案管...
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 2 篇 作物学
2 篇 医学
- 2 篇 基础医学(可授医学...

主题

30 篇 grid computing
25 篇 virtual machinin...
20 篇 peer to peer com...
19 篇 servers
16 篇 computers
15 篇 computer science
15 篇 cloud computing
14 篇 resource managem...
13 篇 bandwidth
12 篇 application soft...
12 篇 kernel
11 篇 protocols
11 篇 virtual machine ...
11 篇 hardware
10 篇 scalability
9 篇 operating system...
8 篇 computational mo...
8 篇 computer network...
8 篇 large-scale syst...
7 篇 access control

机构

52 篇 services computi...
38 篇 school of comput...
38 篇 school of cyber ...
28 篇 national enginee...
26 篇 hubei key labora...
26 篇 hubei engineerin...
24 篇 services computi...
24 篇 cluster and grid...
17 篇 school of softwa...
15 篇 school of inform...
12 篇 national enginee...
11 篇 services computi...
11 篇 cluster and grid...
8 篇 huazhong univers...
8 篇 services computi...
8 篇 jinyinhu laborat...
7 篇 cluster and grid...
6 篇 key laboratory o...
5 篇 cluster and grid...
5 篇 nanyang technolo...

作者

134 篇 hai jin
45 篇 jin hai
25 篇 xiaofei liao
24 篇 deqing zou
20 篇 song wu
18 篇 hu shengshan
14 篇 zhang leo yu
13 篇 li minghui
13 篇 fangming liu
12 篇 xuanhua shi
11 篇 zou deqing
11 篇 zhou ziqi
10 篇 ran zheng
9 篇 long zheng
8 篇 qin zhang
8 篇 wan wei
8 篇 hong yao
7 篇 kan hu
7 篇 shi xuanhua
7 篇 wang xianlong

语言

225 篇 英文
12 篇 中文
4 篇 其他

检索条件"机构=Services Computing Technology and System Laboratory"

共 241 条记录，以下是121-130 订阅

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

详细简洁

排序：

Desktop Virtualization: Techniques and Applications

Desktop Virtualization: Techniques and Applications

引用

International Conference on Pervasive computing and Applications (ICPCA)

作者： Hai Jin Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science슠and슠Technology Wuhan China

In this talk, the author discusses some recent advances in desktop virtualization field. Especially, the author talks about desktop virtualization research work in the National 973 Basic Research Program, The Research on Fundamental Theory and Approach of computing system Virtualization. These works include multi-platform supported virtual desktop (MSVD) and HVM supported virtual laptop environment. The design objectives and considerations are discussed in this talk, as well as the system design, performance evaluation compared with other techniques, and some system demonstrations.

关键词： Application virtualization Pervasive computing Grid computing Computers system software Application software Platform virtualization Resource virtualization Costs Investments

来源：评论

学校读者我要写书评

暂无评论

Adaptive Interference-Aware VNF Placement for Service-Customized 5G Network Slices

Adaptive Interference-Aware VNF Placement for Service-Custom...

引用

IEEE Conference on Computer Communications

作者： Qixia Zhang Fangming Liu Chaobing Zeng Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781728105161

Based on network function virtualization (NFV) and software defined network (SDN), network slicing is proposed as a new paradigm for building service-customized 5G network. In each network slice, service-required virtual network functions (VNFs) can be flexibly deployed in an on-demand manner, which will support a variety of 5G use cases. However, due to the diverse performance requirements among different 5G scenarios, an adaptive VNF placement approach is needed to automatically accommodate to service-specific requirements. In this paper, we tackle the VNF placement problem by first proposing a general 5G network slice framework, which jointly contains both edge cloud and core cloud servers. Specially, based on the fact that VNF consolidation may cause severe performance degradation, we adopt a demand-supply model to quantity the VNF interference. With an aim to maximize the total throughput of accepted requests, we propose an Adaptive Interference-Aware (AIA) heuristic approach to automatically place VNFs in 5G service-customized network slices. Through simulations on two typical 5G scenarios, we demonstrate that AIA can efficiently handle traffic variation especially caused by VNF interference and improve the total throughput by 20.11% and 24.21% in autonomous driving and 4K/8K HD video network slices as compared with the state-of-the-art methods.

关键词： slicing degradation of performance AUTOMATIC INCIDENT ACTIONS Network placement Self tuning AUTOMATIC

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MeG2: In-Memory Acceleration for Genome Graphs Analysis

MeG2: In-Memory Acceleration for Genome Graphs Analysis

引用

Design Automation Conference

作者： Yu Huang Long Zheng Haifeng Liu Zhuoran Zhou Dan Chen Pengcheng Yao Qinggang Wang Xiaofei Liao Hai Jin National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China Zhejiang Lab Hangzhou China

Genome graphs analysis has emerged as an effective means to enable mapping DNA fragments (known as reads) to the reference genome. It replaces the traditional linear reference with a graph-based representation to augment the genetic variations and diversity information, significantly improving the quality of genotyping. The in-depth characterization of genome graphs analysis uncovers that it is bottlenecked by the irregular seed index access and the intensive alignment operation, stressing both the memory system and computing *** on these observations, we propose MeG 2 , a lightweight, commodity DRAM-compliant, processing-in-memory architecture to accelerate genome graphs analysis. MeG 2 is specifically integrated with the capabilities of both near-memory processing and bitwise in-situ computation. Specifically, MeG 2 leverages the low access latency of near-memory processing with the index-centric offload mechanism to alleviate the irregular memory access in the seeding procedure, and harnesses the row-parallel capacity of in-situ computation with the distance-aware technique to exploit the intensive computational parallelism in the alignment process. Results show that MeG 2 outperforms the CPU-, GPU-, and ASIC-based genome graphs analysis solutions by 502× (30.2×), 272× (15.1× ), and 5.5× (8.3×) for short (long) reads, while reducing energy consumption by 1628× (85.6×), 1443× (77.1×), and 7.8× (11.7×), respectively. We also demonstrate that MeG 2 offers significant improvements over existing PIM-based genome sequence analysis accelerators.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities 24

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability Dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Worm Containment in Peer-to-Peer Networks

Worm Containment in Peer-to-Peer Networks

引用

International Conference on Scalable computing and Communications;International Conference on Embedded computing, SCALCOM-EMBEDDEDCOM

作者： Sirui Yang Hai Jin Bo Li Xiaofei Liao Hong Yao 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 Hong Kong University of Science and Technology Hong Kong China

Recently there have been increasing attentions on the security aspects in Peer-to-Peer (P2P) networks, especially with respect to worm epidemics. However, existing worm containment mechanisms can be largely ineffective due to the long delay exhibited in worm identification and patch generation. In this paper, we propose a new worm containment algorithm based on the concept of overlay partition, which can effectively quarantine worms into small and more manageable sub-networks. This algorithm relies on a simple anomaly detection which takes effect much faster than existing schemes. With ldquobridge linksrdquo, the alert of an anomaly can be disseminated faster than random scanning and dedicated worms. Further, in order to deal with false positives, we propose a granularity based clustering algorithm, called CAGA, which, through extensive simulation, is shown to realize better service sustenance during unnecessary partition caused by false positives and can effectively contain fast worms. Finally, we examine the effects of topologies and network dynamics.

关键词： Peer to peer computing Computer worms Partitioning algorithms Clustering algorithms Embedded computing Grid computing Computer networks Computer science Computer security Delay

来源：评论

学校读者我要写书评

暂无评论

When smart grid meets geo-distributed cloud: An auction approach to datacenter demand response

When smart grid meets geo-distributed cloud: An auction appr...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Zhi Zhou Fangming Liu Zongpeng Li Hai Jin Key Laboratory of Services Computing Technology and System Huazhong University of Science and Technology China Department of Computer Science University of Calgary Canada

Datacenter demand response is envisioned as a promising tool for mitigating operational stability issues faced by smart grids. It enables significant potentials in peak load reduction and facilitates the incorporation of distributed generation. Monetary refund from the smart grid can also alleviate the cloud's burden in escalating electricity cost. However, the current demand response paradigm is inefficient towards incentivizing a cloud that runs over geo-distributed datacenters. Leveraging auction theory, this work presents an efficient incentive mechanism to elicit demand response from geo-distributed clouds. To determine the winning bids and their corresponding payments, the cloud that acts as the auctioneer needs to solve a set of winner determination problems that are highly challenging. By integrating techniques from the Gibbs sampling method and the alternating direction method of multipliers, we propose a decentralized algorithm for each datacenter to make autonomous decisions on winning bid selection and workload management, striking a balance among the economic efficiency, truthfulness and the computational efficiency. Through extensive trace-driven evaluations, we demonstrate that our incentive mechanism constitutes a win-win mechanism for both the geo-distributed cloud and the smart grid.

关键词： Smart grids Load management Power demand Servers Cost accounting Conferences Computers

来源：评论

学校读者我要写书评

暂无评论

Analyzing and Improving MPI Communication Performance in Overcommitted Virtualized systems

Analyzing and Improving MPI Communication Performance in Ove...

引用

International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems (MASCOTS)

作者： Zhiyuan Shao Qiang Wang Xuejiao Xie Hai Jin Ligang He 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 Department of Computer Science University of Warwick Coventry UK

Nowadays, it is an important trend in the system domain to use the software-based virtualization technology to build the execution environments (e.g., Clouds) and serve high performance computing (HPC) applications. However, with the extra virtualization layer, the application performance may be negatively affected. Studies revealed that the communication performance of the MPI library, which is widely used by the HPC applications, would suffer a high penalty when a physical host machine becomes overcommitted by virtual processors (VCPU). Unfortunately, the problem has not received enough attention and has not been solved yet in literature. In this paper, we investigate the reasons behind the performance penalty, and propose a solution to improve the communication performance of running MPI applications in the overcommitted virtualized systems. The experimental results show that by our proposal, most HPC applications can gain performance improvement to different extents among the overcommitted systems, depending on their communication patterns and the over committing level.

关键词： Libraries Benchmark testing Virtual machine monitors Kernel Cloud computing Linux Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Adaptive Disk I/O Scheduling for MapReduce in Virtualized Environment

Adaptive Disk I/O Scheduling for MapReduce in Virtualized En...

引用

International Conference on Parallel Processing (ICPP)

作者： Shadi Ibrahim Hai Jin Lu Lu Bingsheng He Song Wu 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 School of Computer Engineering Nanyang Technological University Singapore

Virtual machine (VM) interference has long been a challenging problem for performance predictability and system throughput for large-scale virtualized environments in the cloud. Such interferences are contributed by intertwined factors including the application's type, the number of con current VMs, and the VM scheduling algorithms used within the host. Since MapReduce has become an important data processing platform in the cloud, we investigate the impact of disk schedulers in Hadoop. Interestingly, our experimental results report a noticeable variation of the Hadoop performance between different applications when applying different disk pairs' schedulers in both the hypervisor and the virtual machines. Furthermore, a typical Hadoop application consists of different interleaving stages, each requiring different I/O workloads and patterns. As a result, the disk pairs' schedulers are not only sub-optimal for different MapReduce applications, but also sub-optimal for different sub-phases of the whole job. Accordingly, this paper presents a novel approach for adaptively tuning the disk pairs' schedulers in both the hypervisor and the virtual machines during the execution of a single MapReduce job. Our results show that MapReduce performance can be significantly improved; specifically, adaptive tuning of disk pairs' schedulers achieves a 25% performance improvement on a sort benchmark with Hadoop.

关键词： Benchmark testing Throughput Virtual machine monitors Interference Switches Virtual machining Tuning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共25页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：