Cloud storage auditing research is dedicated to solving the data integrity problem of outsourced storage on the cloud. In recent years, researchers have proposed various cloud storage auditing schemes using different ...
详细信息
Cloud storage auditing research is dedicated to solving the data integrity problem of outsourced storage on the cloud. In recent years, researchers have proposed various cloud storage auditing schemes using different techniques. While these studies are elegant in theory, they assume an ideal cloud storage model;that is, they assume that the cloud provides the storage and compute interfaces as required by the proposed schemes. However, this does not hold for mainstream cloud storage systems because these systems only provide read and write interfaces but not the compute interface. To bridge this gap, this work proposes a serverless computing-based cloud storage auditing system for existing mainstream cloud object storage. The proposed system leverages existing cloud storage auditing schemes as a basic building block and makes two adaptations. One is that we use the read interface of cloud object storage to support block data requests in a traditional cloud storage auditing scheme. Another is that we employ the serverless computing paradigm to support block data computation as traditionally required. Leveraging the characteristics of serverless computing, the proposed system realizes economical, pay-as-you-go cloud storage auditing. The proposed system also supports mainstream cloud storage upper layer applications(e.g., file preview) by not modifying the data formats when embedding authentication tags for later auditing. We prototyped and open-sourced the proposed system to a mainstream cloud service, i.e., Tencent Cloud. Experimental results show that the proposed system is efficient and promising for practical use. For 40 GB of data, auditing takes approximately 98 s using serverless computation. The economic cost is 120.48 CNY per year, of which serverless computing only accounts for 46%. In contrast, no existing studies reported cloud storage auditing results for real-world cloud services.
In order to reconstruct 3D clothed human with accurate fine-grained details from sparse views, we propose a deep cooperating two-level global to fine-grained reconstruction framework that constructs robust global geom...
详细信息
The naive Bayesian classifier(NBC) is a supervised machine learning algorithm having a simple model structure and good theoretical interpretability. However, the generalization performance of NBC is limited to a large...
详细信息
The naive Bayesian classifier(NBC) is a supervised machine learning algorithm having a simple model structure and good theoretical interpretability. However, the generalization performance of NBC is limited to a large extent by the assumption of attribute independence. To address this issue, this paper proposes a novel attribute grouping-based NBC(AG-NBC), which is a variant of the classical NBC trained with different attribute groups. AG-NBC first applies a novel effective objective function to automatically identify optimal dependent attribute groups(DAGs). Condition attributes in the same DAG are strongly dependent on the class attribute, whereas attributes in different DAGs are independent of one another. Then,for each DAG, a random vector functional link network with a SoftMax layer is trained to output posterior probabilities in the form of joint probability density estimation. The NBC is trained using the grouping attributes that correspond to the original condition attributes. Extensive experiments were conducted to validate the rationality, feasibility, and effectiveness of AG-NBC. Our findings showed that the attribute groups chosen for NBC can accurately represent attribute dependencies and reduce overlaps between different posterior probability densities. In addition, the comparative results with NBC, flexible NBC(FNBC), tree augmented Bayes network(TAN), gain ratio-based attribute weighted naive Bayes(GRAWNB), averaged one-dependence estimators(AODE), weighted AODE(WAODE), independent component analysis-based NBC(ICA-NBC), hidden naive Bayesian(HNB) classifier, and correlation-based feature weighting filter for naive Bayes(CFW) show that AG-NBC obtains statistically better testing accuracies, higher area under the receiver operating characteristic curves(AUCs), and fewer probability mean square errors(PMSEs) than other Bayesian classifiers. The experimental results demonstrate that AG-NBC is a valid and efficient approach for alleviating the attribute i
To mitigate the challenges posed by data uncertainty in Full-Self Driving (FSD) systems. This paper proposes a novel feature extraction learning model called Adaptive Region of Interest Optimized Pyramid Network (ARO)...
详细信息
This article presents LoRaDIP, a novel low-light image enhancement (LLIE) model based on deep image priors (DIPs). While DIP-based enhancement models are known for their zero-shot learning, their expensive computation...
详细信息
Handling the massive amount of data generated by Smart Mobile Devices(SMDs)is a challenging computational *** Computing is an emerging computation paradigm that is employed to conquer this *** can bring computation po...
详细信息
Handling the massive amount of data generated by Smart Mobile Devices(SMDs)is a challenging computational *** Computing is an emerging computation paradigm that is employed to conquer this *** can bring computation power closer to the end devices to reduce their computation latency and energy ***,this paradigm increases the computational ability of SMDs by collaboration with edge *** is achieved by computation offloading from the mobile devices to the edge nodes or ***,not all applications benefit from computation offloading,which is only suitable for certain types of *** properties,SMD capability,wireless channel state,and other factors must be counted when making computation offloading ***,optimization methods are important tools in scheduling computation offloading tasks in Edge Computing *** this paper,we review six types of optimization methods-they are Lyapunov optimization,convex optimization,heuristic techniques,game theory,machine learning,and *** each type,we focus on the objective functions,application areas,types of offloading methods,evaluation methods,as well as the time complexity of the proposed *** discuss a few research problems that are still *** purpose for this review is to provide a concise summary that can help new researchers get started with their computation offloading researches for Edge Computing networks.
Mobile edge computing(MEC) provides edge services to users in a distributed and on-demand *** to the heterogeneity of edge applications, deploying latency and resource-intensive applications on resourceconstrained dev...
详细信息
Mobile edge computing(MEC) provides edge services to users in a distributed and on-demand *** to the heterogeneity of edge applications, deploying latency and resource-intensive applications on resourceconstrained devices is a key challenge for service providers. This is especially true when underlying edge infrastructures are fault and error-prone. In this paper, we propose a fault tolerance approach named DFGP, for enforcing mobile service fault-tolerance in MEC. It synthesizes a generative optimization network(GON) model for predicting resource failure and a deep deterministic policy gradient(DDPG) model for yielding preemptive migration *** show through extensive simulation experiments that DFGP is more effective in fault detection and guaranteeing quality of service, in terms of fault detection accuracy, migration efficiency, task migration time, task scheduling time,and energy consumption than other existing methods.
Medical image classification plays a pivotal role in modern healthcare, aiding in accurate disease diagnosis, treatment planning, and patient management. With the advent of deep learning techniques, significant advanc...
详细信息
Partial-label learning(PLL) is a typical problem of weakly supervised learning, where each training instance is annotated with a set of candidate labels. Self-training PLL models achieve state-of-the-art performance b...
详细信息
Partial-label learning(PLL) is a typical problem of weakly supervised learning, where each training instance is annotated with a set of candidate labels. Self-training PLL models achieve state-of-the-art performance but suffer from error accumulation problems caused by mistakenly disambiguated instances. Although co-training can alleviate this issue by training two networks simultaneously and allowing them to interact with each other, most existing co-training methods train two structurally identical networks with the same task, i.e., are symmetric, rendering it insufficient for them to correct each other due to their similar limitations. Therefore, in this paper, we propose an asymmetric dual-task co-training PLL model called AsyCo,which forces its two networks, i.e., a disambiguation network and an auxiliary network, to learn from different views explicitly by optimizing distinct tasks. Specifically, the disambiguation network is trained with a self-training PLL task to learn label confidence, while the auxiliary network is trained in a supervised learning paradigm to learn from the noisy pairwise similarity labels that are constructed according to the learned label confidence. Finally, the error accumulation problem is mitigated via information distillation and confidence refinement. Extensive experiments on both uniform and instance-dependent partially labeled datasets demonstrate the effectiveness of AsyCo.
Knowledge tracing aims to track students’knowledge status over time to predict students’future performance *** a real environment,teachers expect knowledge tracing models to provide the interpretable result of knowl...
详细信息
Knowledge tracing aims to track students’knowledge status over time to predict students’future performance *** a real environment,teachers expect knowledge tracing models to provide the interpretable result of knowledge *** chain-based knowledge tracing(MCKT)models,such as Bayesian Knowledge Tracing,can track knowledge concept mastery probability over ***,as the number of tracked knowledge concepts increases,the time complexity of MCKT predicting student performance increases exponentially(also called explaining away problem).When the number of tracked knowledge concepts is large,we cannot utilize MCKT to track knowledge concept mastery probability over *** addition,the existing MCKT models only consider the relationship between students’knowledge status and problems when modeling students’responses but ignore the relationship between knowledge concepts in the same *** address these challenges,we propose an inTerpretable pRobAbilistiC gEnerative moDel(TRACED),which can track students’numerous knowledge concepts mastery probabilities over *** solve explain away problem,we design long and short-term memory(LSTM)-based networks to approximate the posterior distribution,predict students’future performance,and propose a heuristic algorithm to train LSTMs and probabilistic graphical model *** better model students’exercise responses,we proposed a logarithmic linear model with three interactive strategies,which models students’exercise responses by considering the relationship among students’knowledge status,knowledge concept,and *** conduct experiments with four real-world datasets in three knowledge-driven *** experimental results show that TRACED outperforms existing knowledge tracing methods in predicting students’future performance and can learn the relationship among students,knowledge concepts,and problems from students’exercise *** also conduct several case *** case studies show that
暂无评论