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

9th IEEE International Conference on cloud computing in Emerging Markets, CCEM 2020

作者： Das, Abhishek Snv, Bhargav Sanketh Reddy, N. Phalachandra, H.L. Pes University Dept. of Computer Science and Engineering Bangalore India Center for Cloud Computing and Big Data Pes University Bangalore India

ISBN: (纸本)9781728195766

The rapidly increasing growth of big data is leading to increased usage of distributed computing and clusters as this can enable tasks to be split and processed in parallel resulting in higher computational efficiency. Environments like Apache Hadoop use Distributed file systems like the HDFS to support large clusters of typically commodity hardware to achieve the same. Commodity hardware present in HDFS consumes significant energy even when not in an active state, and considering our fragile ecosystem, reduction of the carbon footprint and conservation of energy in these environments is the focus of our work. We have evolved on a dynamic approach to Hadoop Distributed File Systems (HDFS) that provides an energy efficient paradigm for Hadoop clusters by segregating the servers in the cluster to two 'Zones', a 'Hot-Zone', and a 'Cold-Zone'. We use energy efficient storage devices (SSDs), to store data that is frequently used for the hot zone. The Cold-Zone would have lesser energy efficient devices (HDDs) and would be used to store data that is not frequently used. The Hot-Zone would always be in an active state to compute while the cold zone would have the HDDs to be in a low power consumption state. We have also enhanced the block placement policy for HDFS to support dynamic block transfer among the two zones. © 2020 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction by Disentangled Subgraph Structure

引用

Tsinghua science and Technology 2024年第5期29卷 1566-1579页

作者： Guiduo Duan Rui Guo Wenlong Luo Guangchun Luo Tianxi Huang Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of ChinaChengdu 611731Chinaand also with Trusted Cloud Computing and Big Data Key Laboratory of Sichuan ProvinceChengdu 611731China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Hangzhou NetEase Cloud Music Technology Co. Ltd.Hangzhou 310052China Department of Fundamental Courses Chengdu Textile CollegeChengdu 611700China

Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,which usually represent different semantic *** not all semantic information about the regions is helpful in relation prediction,we propose a relation prediction model based on a disentangled subgraph structure and implement a feature updating approach based on relevant semantic *** indirectly achieve the disentangled subgraph structure from a semantic perspective,the mapping of entity features into different semantic spaces and the aggregation of related semantics on each semantic space are *** disentangled model can focus on features having higher semantic relevance in the prediction,thus addressing a problem with existing approaches,which ignore the semantic differences in different subgraph ***,using a gated recurrent neural network,this model enhances the features of entities by sorting them by distance and extracting the path information in the ***,it is shown that when there are numerous disconnected regions in the subgraph,our model outperforms existing mainstream models in terms of both Area Under the Curve-Precision-Recall(AUC-PR)and Hits@*** prove that semantic differences in the knowledge graph can be effectively distinguished and verify the effectiveness of this method.

关键词： disentangled subgraph structure knowledge graph completion Gated Recurrent Unit(GRU) feature updating

来源：评论

学校读者我要写书评

暂无评论

Demystifying Ethereum account diversity:observations,models and analysis

引用

Frontiers of computer science 2022年第4期16卷 119-130页

作者： Chaofan Wang Xiaohai Dai Jiang Xiao Chenchen Li Ming Wen Bingbing Zhou Hai Jin Clusters and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Centre for Distributed and High Performance Computing School of Information TechnologiesThe University of SydneyCamperdownNew South Wales2006Australia

Blockchain platform Ethereum has involved millions of accounts due to its strong potential for providing numerous services based on smart *** massive accounts can be divided into diverse categories,such as miners,tokens,and exchanges,which is termed as account diversity in this *** benefit of investigating diversity are multi-fold,including understanding the Ethereum ecosystem deeper and opening the possibility of tracking certain abnormal ***,the exploration of blockchain account diversity remains *** the most relevant studies,which focus on the deanonymization of the accounts on Bitcoin,can hardly be applied on Ethereum since their underlying protocols and user idioms are *** this end,we present the first attempt to demystify the account diversity on *** key observation is that different accounts exhibit diverse behavior patterns,leading us to propose the heuristics for classification as the *** then raise the coverage rate of classification by the statistical learning model Maximum Likelihood Estimation(MLE).We collect real-world data through extensive efforts to evaluate our proposed method and show its ***,we make an in-depth analysis of the dynamic evolution of the Ethereum ecosystem and uncover the abnormal arbitrage *** for the former,we validate two sweeping statements reliably:(1)standalone miners are gradually replaced by the mining pools and cooperative miners;(2)transactions related to the mining pool and exchanges take up a large share of the total *** latter analysis shows that there are a large number of arbitrage transactions transferring the coins from one exchange to another to make a price difference.

关键词： blockchain Ethereum classification account diversity network analysis

来源：评论

学校读者我要写书评

暂无评论

Revocable and certificateless public auditing for cloud storage

引用

science China(Information sciences) 2020年第10期63卷 282-284页

作者： Yinghui ZHANG Tiantian ZHANG Shengmin XU Guowen XU Dong ZHENG School of Cyberspace Security Xi'an University of Posts and Telecommunications Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology National Engineering Laboratory for Wireless Security Xi'an University of Posts and Telecommunications Secure Mobile Centre School of Information SystemsSingapore Management University School of Computer Science and Engineering University of Electronic Science and Technology of China

Dear editor,Plenty of computing and storage resources in the cloud are provided for users with restricted computing and storage resources,which has attracted the attention of many researchers[1,2].A generic blockchain-based cloud data auditing scheme[3] is proposed,which is compatible with any blockchains including the bitcoin *** the data integrity checking scheme,certificate-

关键词：

来源：评论

学校读者我要写书评

暂无评论

SP-DSTS-MIMO Scheme-Aided H.266 for Reliable High data Rate Mobile Video Communication

引用

computers, Materials & Continua 2023年第1期74卷 995-1010页

作者： Khadem Ullah Nasru Minallah Durre Nayab Ishtiaque Ahmed Jaroslav Frnda Jan Nedoma Department of Computer Systems Engineering University of Engineering and Technology PeshawarPeshawar25000Pakistan National Centre in Big Data and Cloud Computing University of Engineering and Technology Peshawar(NCBC-UETP)Peshawar25000Pakistan Department of Quantitative Methods and Economic Informatics Faculty of Operation and Economics of Transport and CommunicationsUniversity of Zilina01026ZilinaSlovakia Department of Telecommunications Faculty of Electrical Engineering and Computer ScienceVSB-Technical University of OstravaOstrava-PorubaCzech Republic

With the ever growth of Internet users,video applications,and massive data traffic across the network,there is a higher need for reliable bandwidth-efficient multimedia *** Video Coding(VVC/H.266)is finalized in September 2020 providing significantly greater compression efficiency compared to Highest Efficient Video Coding(HEVC)while providing versatile effective use for Ultra-High Definition(HD)*** article analyzes the quality performance of convolutional codes,turbo codes and self-concatenated convolutional(SCC)codes based on performance metrics for reliable future video *** advent of turbo codes was a significant achievement ever in the era of wireless communication approaching nearly the Shannon *** codes are operated by the deployment of an interleaver between two Recursive Systematic Convolutional(RSC)encoders in a parallel *** RSC encoders may be operating on the same or different architectures and code *** proposed work utilizes the latest source compression standards H.266 and H.265 encoded standards and Sphere Packing modulation aided differential Space Time Spreading(SP-DSTS)for video transmission in order to provide bandwidth-efficient wireless video ***,simulation results show that turbo codes defeat convolutional codes with an averaged E_(b)/N_(0) gain of 1.5 dB while convolutional codes outperformcompared to SCC codes with an E_(b)/N_(0) gain of 3.5 dBatBit ErrorRate(BER)of 10−*** Peak Signal to Noise Ratio(PSNR)results of convolutional codes with the latest source coding standard of H.266 is plotted against convolutional codes with H.265 and it was concluded H.266 outperform with about 6 dB PSNR gain at E_(b)/N_(0) value of 4.5 dB.

关键词： H.265 RSC turbo codes SCC SP-DSTS BP-CNN BER PSNR

来源：评论

学校读者我要写书评

暂无评论

Performance tuning analysis of spatial operations on Spatial Hadoop cluster with SSD

引用

Procedia computer science 2020年 167卷 2253-2266页

作者： Prafullata Auradkar Tejas Prashanth Suraj Aralihalli Sreeniketh Pradeep Kumar Dinkar Sitaram Center for Cloud Computing and Big Data Department of Computer Science and Engineering PES University Bangalore Karnataka India

Solid State Drives have shown promising results in improving the performance of MapReduce jobs. Previous work in the usage of SSD consisted of evaluation of its incorporation in Hadoop using benchmarking tests, such as WordCount, TeraGen, TeraSort and so on. It was empirically observed that the type of Map Reduce implementation, specifically the nature of the processing performed during the shuffle phase, has a major role in the overall outcome. This finding opens a plethora of possibilities of exploring the impact of storage media on spatial data processing in big data frameworks. Spatial big data frameworks, such as Spatial Hadoop, have been successfully used for several spatial operations, but the effect of SSD utilization in these operations is yet to be evaluated. This paper evaluates the feasibility of adopting SSD in a Spatial Hadoop cluster. The contributions presented are 1) Characterization of Spatial Hadoop jobs that would benefit from the usage of SSD. 2) Identification of the optimal mix of Solid State Drives and Hard Disk Drives for HDFS for each type of job. 3) Evaluation of cluster configuration parameters that influence the speed-up. The cluster exhibited a speed-up of up to 15% for I/O intensive spatial operations, while other compute-intensive operations could not harness a similar gain.

关键词： Spatial Hadoop Solid State Drives Performance analysis Global indexes Computational geometry

来源：评论

学校读者我要写书评

暂无评论

A Fine-Grained Anomaly Detection Method Fusing Isolation Forest and Knowledge Graph Reasoning 19th

A Fine-Grained Anomaly Detection Method Fusing Isolation For...

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Xu, Jie Zhou, Jiantao College of Computer Science Engineering Research Center of Ecological Big Data Ministry of Education National and Local Joint Engineering Research Center of Mongolian Intelligent Information Processing Technology Inner Mongolia Cloud Computing and Service Software Engineering Laboratory Inner Mongolia Social Computing and Data Processing Key Laboratory Inner Mongolia Discipline Inspection and Supervision Big Data Key Laboratory Inner Mongolia Big Data Analysis Technology Engineering Laboratory Inner Mongolia University Hohhot China

ISBN: (纸本)9783031203084

Anomaly detection aims to find outliers data that do not conform to expected behaviors in a specific scenario, which is indispensable and critical in current safety environments related studies. However, when performing outlier detection on a large-scale multidimensional dataset, most of the traditional methods make no distinctions between classes of outliers and lack the reasoning ability and the explainability of the analysis results, which leads to the low accuracy of global outlier detection and the inability to effectively identify local outliers. In this paper, we propose a fine-grained anomaly detection method which well utilizes isolation forest and knowledge graph reasoning tactics. First, a better extracting data feature method and a more reasonable weighted strategy are used to find global outliers based on the traditional isolation forest algorithm, and then we construct a custom rule base according to the in-depth research and analysis of global abnormal data, and at last the ontology knowledge is reasoned based on such rule base to achieve the detection of local outliers. Through analysis of extensive experiment results, our method could effectively discover more abnormal data without big loss of time costs, has strong generalization, and correspondingly improves the performance for abnormal detection. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

ES-Mask: Evolutionary Strip Mask for Explaining Time Series Prediction 37

ES-Mask: Evolutionary Strip Mask for Explaining Time Series ...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Sun, Yifei Song, Cheng Lu, Feng Li, Wei Jin, Hai Zomaya, Albert Y. 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 Centre for Distributed and High Performance Computing School of Computer Science University of Sydney Australia

ISBN: (纸本)9781577358800

Machine learning models are increasingly used in time series prediction with promising results. The model explanation of time series prediction falls behind the model development and makes less sense to users in understanding model decisions. This paper proposes ES-Mask, a post-hoc and model-agnostic evolutionary strip mask-based saliency approach for time series applications. ES-Mask designs the mask consisting of strips with the same salient value in consecutive time steps to produce binary and sustained feature importance scores over time for easy understanding and interpretation of time series. ES-Mask uses an evolutionary algorithm to search for the optimal mask by manipulating strips in rounds, thus is agnostic to models by involving no internal model states in the search. The initial experiments on MIMIC-III data set show that ES-Mask outperforms state-of-the-art methods. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional data Anomaly Detection Method Based on Extended Isolation Forest 26

Using Rough Sets to Improve the High-dimensional Data Anomal...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Liu, Hanlin Zhou, Jiantao Li, Hua Inner Mongolia University College of Computer Science Hohhot China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

The packing problem of uncertain multicasts

The packing problem of uncertain multicasts

引用

作者： Ren, Bangbang Guo, Deke Xie, Junjie Li, Wenxin Yuan, Bo Liu, Yunfei Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology Changsha China School of Computer Science and Technology Dalian University of Technology Dalian China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin China

Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizing the transmission cost of each multicast session. In practice, it is not necessary that the source of each multicast session has to be in a specific location, as long as certain constraints are satisfied. Accordingly, applications usually meet a novel multicast with uncertain sources, ie, uncertain multicast. That is, multiple nodes have the responsibility to act as the root node of a multicast session. Prior proposals have addressed an uncertain multicast by constructing the minimum cost forest. However, it is still unknown how to efficiently share the network resources, when a set of uncertain multicast occupies the network simultaneously. To tackle such a challenging issue, we present the packing problem of uncertain multicasts (MPU) to minimize the total transmission cost, under the constraint of link capacity. We prove that the MPU problem is NP-hard. An intrinsic solution is constructing the minimum cost forest for each uncertain multicast individually. This method, however, is inefficient and may be infeasible because of the constraint of link capacity. Thus, we design 2 dedicated greedy methods, named priority-based and adjusting congested link, to approximate the optimal solution. The comprehensive results indicate that both of our 2 methods can find a feasible solution for the MPU problem. Moreover, given a set of uncertain multicasts, the adjusting congested link method can generate a desired transmission structure for each uncertain multicast and achieve the least total cost when packing them. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：