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

2nd International Conference on Cloud computing and Big Data, CloudCom-Asia 2015

作者： Xie, Tao Chen, Haibao Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computer and Information Engineering Chuzhou University Chuzhou239000 China

ISBN: (纸本)9783319284293

It is a huge challenge to deploy a cloud computing system in large-scale data centers. In order to help resolve this issue, we propose an automatic cloud system deployment approach with the characteristics of reliability, availability, and load balance. Specifically, we use workflow to deal with the dependencies among the automatic deployment processes of a cloud system. We also design a failover mechanism to avoid the single point failure of the deployment server. Besides, we adopt a load balancing algorithm to solve the bottleneck problem of deploying a cloud system. We implement a prototype, and evaluate it with 16 physical nodes as well as a virtualized environment with 160 virtual machines. Experimental results show that the average deployment time under our approach is lower than that with traditional deployment methods. In addition, it achieves a cloud system deployment success ratio of up to 90%, even in the high-concurrency environment. © Springer International Publishing Switzerland 2015.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of Computer Science & technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

CNLoc: Channel state information assisted indoor WLAN localization using nomadic access points 1

引用

15th IFIP International Conference on Network and Parallel computing, NPC 2018

作者： Xiao, Jiang Li, Huichuwu Li, He Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Information and Electronic Engineering Muroran Institute of Technology MuroranHokkaido Japan

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

Wireless local area network (WLAN) based indoor localization is expanding its fast-paced adoption to facilitate a variety of indoor location-based services (ILBS). Unfortunately, the performance of current WLAN localization systems relying on fixed access points (APs) deployment is constrained by the spatial localizability variance (SLV) problem that different locations may exhibit significantly distinct localization resolution. Prior approaches tackle this problem through nomadic APs with favorable mobility to dynamically adjust the network topology. However, the lack of prior knowledge of nomadic AP’s position has been a challenge for location distinction and will lead to prohibitive performance degradation. In this paper, we propose and develop CNLoc, a novel CSI-based (Channel State Information) indoor WLAN localization framework to overcome the location uncertainty of nomadic APs. Our implementation and evaluation show that CNLoc can improve the accuracy with unknown location information of nomadic APs. We also discuss some open issues and new possibilities in future nomadic AP based indoor localization. © IFIP International Federation for Information Processing 2018.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

Efficient subgraph search on large anonymized graphs

Efficient subgraph search on large anonymized graphs

引用

作者： Ding, Xiaofeng Ou, Yangling Jia, Jianhong Jin, Hai Liu, Jixue Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Information Technology & Mathematical Sciences University of South Australia Adelaide Australia

Graph is one of the most important data structures to model social networks and becomes popular to find interesting relationships between individuals. Since graphs may contain sensitive information, data curators usually need to anonymize the graph before publication to prevent individual re-identification, which thus leads to plenty of anonymized graphs for data sharing and exploration. However, the new structures and properties of anonymized graphs make the traditional graph indexing method inefficient or even invalid for query processing. To address the subgraph query problem over anonymized graph database, in this paper, we first introduce basic concepts about anonymized graphs and subgraph queries, then propose an index structure named Closure+-tree to process the subgraph query efficiently. In particular, graphs were organized hierarchically that each node is an union of its child nodes under some specified mapping functions. During the processing of subgraph queries, the whole graph descendants will be pruned if their union does not contain the query graph. To evaluate the performance of our proposed Closure+-tree, extensive experiments are performed on both real and synthetic graph data sets. The experimental results revealed that our index structure can prune up to 80% unqualified graphs with variable size of queries. Furthermore, the size of our index structure is only around a quarter of the entire anonymized graph data set, which indicates good scalability over large data sets. © 2018 John Wiley & Sons, Ltd.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous differential privacy for vertically partitioned databases

Heterogeneous differential privacy for vertically partitione...

引用

作者： Xia, Yang Zhu, Tianqing Ding, Xiaofeng Jin, Hai Zou, Deqing National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Deakin University Victoria Australia

Existing privacy-preserving approaches are generally designed to provide privacy guarantee for individual data in a database, which reduces the utility of the database for data analysis. In this paper, we propose a novel differential privacy mechanism to preserve the heterogeneous privacy of a vertically partitioned database based on attributes. We first present the concept of privacy label, which characterizes the privacy information of the database and is instantiated by the classification. Then, we use an information-based method to systematically explore the dependencies between all attributes and the privacy label. We finally assign privacy weights to every attribute and design a heterogeneous mechanism according to the basic Laplace mechanism. Evaluations using real datasets demonstrate that the proposed mechanism achieves a balanced privacy and utility. © 2019 John Wiley & Sons, Ltd.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Can Language Models Serve as Temporal Knowledge Bases?

Can Language Models Serve as Temporal Knowledge Bases?

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Ruilin Zhao, Feng Xu, Guandong Zhang, Sixiao Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Recent progress regarding the use of language models (LMs) as knowledge bases (KBs) has shown that language models can act as structured knowledge bases for storing relational facts. However, most existing works only considered the LM-as-KB paradigm in a static setting, which ignores the analysis of temporal dynamics of world knowledge. Furthermore, a basic function of KBs, i.e., the ability to store conflicting information (i.e., 1-N, N-1 and N-M relations), is underexplored. In this paper, we formulate two practical requirements for treating LMs as temporal KBs: (i) the capacity to store temporally-scoped knowledge that contains conflicting information and (ii) the ability to use stored knowledge for temporally-scoped knowledge queries. We introduce a new dataset called LAMA-TK which is aimed at probing temporally-scoped knowledge, and investigate the two above requirements to explore the LM-as-KB paradigm in the temporal domain. On the one hand, experiments show that LMs can memorize millions of temporally-scoped facts with relatively high accuracy and transfer stored knowledge to temporal knowledge queries, thereby expanding the LM-as-KB paradigm to the temporal domain. On the other hand, we show that memorizing conflicting information, which has been neglected by previous works, is still challenging for LMs and hinders the memorization of other unrelated one-to-one relationships. © 2022 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Predicting Friendship Using a Unified Probability Model 7th

Predicting Friendship Using a Unified Probability Model

引用

7th CCF Academic Conference on BigData, CCF BigData 2019

作者： Kou, Zhijuan Wang, Hua Yuan, Pingpeng Jin, Hai Xie, Xia National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9789811518980

Now, it is popular for people to share their feelings, activities tagged with geography and temporal information in Online Social Networks (OSNs). The spatial and temporal interactions occurred in OSNs contain a wealth of information to indicate friendship between persons. Existing researches generally focused on single dimension: spatial or temporal dimension. The simplified model only works in limited scenarios. Here, we aim to understand the probability of friendship and the place and time of interactions. First, spatial similarity of interactions is defined as a vector of places where persons checked in. Second, we employ exponential functions to characterize the change of strength of interactions as time goes on. Finally, a unified probability model to predict friendship between two persons is given. The model contains two sub-models based on spatial similarity and temporal similarity respectively. The experimental results on four data sets including spatial data sets (Gowalla and Weeplaces) and temporal data sets (Higgs Twitter Data set, High school Call Data set) show that our model works as expected. © Springer Nature Singapore Pte Ltd 2019.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Autonomous Agent Based Intrusion Detection in Virtual computing Environment

Autonomous Agent Based Intrusion Detection in Virtual Comput...

引用

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

作者： Feng Zhao Alex K. Ohoussou Deqing Zou Hai Jin Guofu Xiang Ge Cheng Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of S Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of S

One of the motivations for virtualization technology is the desire to develop new services to enhance system security without trusting both the applications and the operating systems. An intrusion detection system is an example of such service that can help to isolate users from malicious attacks. In this paper, we propose hybrid-based intrusion detection architecture in virtual computing environment to detect and isolate harmful behaviors by real-time monitoring and alarming. In contrast to monolithic intrusion detection system, we introduce autonomous agents, acting independently of each other, to monitor the system. The agents are deployed in virtual machines to analyze actions occurring on the network and inside the hosts to determine whether they are potential security violations or not. Our architecture is implemented based on Xen, and the detection management center is deployed in a secure virtual machine.

关键词： intrusion detection autonomous agent virtual computing environment

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Model Combined with SVM and CNN for Community Content Classification 23

A Hybrid Model Combined with SVM and CNN for Community Conte...

引用

23rd IEEE International Conference on High Performance computing and Communications, 7th IEEE International Conference on Data Science and systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Ye, Yukui Xie, Xia Jin, Hai Wang, Duoqiang National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and Technology Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Hainan University Haikou China

ISBN: (纸本)9781665494571

Community websites bring many conveniences to people, and the classification of community content is playing an important role in website management and information searching. As the carrier of community content, posts are difficult to classify manually. According to the characteristics of community content, a hybrid classification model for machine learning is proposed. This model consists of three steps. Firstly, aiming at the problem of fewer features of posts, a weighted word vector is proposed to enrich the features of posts. Secondly, since the single kernel function of SVM can not completely match all data distributions, a mixed kernel function is employed to improve the model. Finally, in order to fully utilize the powerful feature extraction ability of Convolutional Neural Network as well as the classification ability of SVM, a hybrid model is designed and implemented by replacing softmax layer with SVM classifier. The corresponding experiment results indicate that compared with traditional Convolutional Neural Network, the proposed hybrid model has better performance and stability with classification accuracy improved from 0.9% to 1.4% in general. © 2021 IEEE.

关键词： Support vector machines Smart cities Support vector machine classification Machine learning Feature extraction Stability analysis Data models

来源：评论

学校读者我要写书评

暂无评论

Dynamic cluster strategy for hierarchical rollback-recovery protocols in MPI HPC applications

Dynamic cluster strategy for hierarchical rollback-recovery ...

引用

作者： Liao, Xiaofei Zheng, Long Zhang, Binsheng Zhang, Yu Jin, Hai Shi, Xuanhua Lin, Yi Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China College of Computer Science and Technology Civil Aviation University of China Tianjin300300 China

Fault tolerance in parallel computing becomes increasingly important with a significant rise in high-performance computing systems. Coordinated checkpointing and message logging protocols are commonly used fault tolerance mechanisms for message-passing applications. However, these mechanisms are insufficient because of their severe drawbacks. Hierarchical rollback-recovery protocols, combining coordinated checkpointing with message logging, are a better solution. However, such protocols may not obtain the appropriate efficiency because the communication pattern in different stages of applications may vary at runtime. In an effort to improve the efficiency of hierarchical rollback-recovery protocols, we propose a dynamic cluster strategy to adapt to the runtime variation of communication pattern by using a prediction scheme. Finally, the efficiency and scalability of the dynamic cluster strategy are evaluated using 2 static process partition algorithms on the High-Performance Linpack benchmark. © 2017 John Wiley & Sons, Ltd.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：