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.
With the diversification of space-based information network task requirements and the dramatic increase in demand, the efficient scheduling of various tasks in space-based information network becomes a new challenge. ...
详细信息
With the diversification of space-based information network task requirements and the dramatic increase in demand, the efficient scheduling of various tasks in space-based information network becomes a new challenge. To address the problems of a limited number of resources and resource heterogeneity in the space-based information network, we propose a bilateral pre-processing model for tasks and resources in the scheduling pre-processing stage. We use an improved fuzzy clustering method to cluster tasks and resources and design coding rules and matching methods to match similar categories to improve the clustering effect. We propose a space-based information network task scheduling strategy based on an ant colony simulated annealing algorithm for the problems of high latency of space-based information network communication and high resource dynamics. The strategy can efficiently complete the task and resource matching and improve the task scheduling performance. The experimental results show that our proposed task scheduling strategy has less task execution time and higher resource utilization than other algorithms under the same experimental conditions. It has significantly improved scheduling performance.
The modern university computer lab and kindergarden through 12th grade classrooms require a centralized solution to efficiently manage a large number of desktops. The existing solutions either bring virtualization ove...
详细信息
The modern university computer lab and kindergarden through 12th grade classrooms require a centralized solution to efficiently manage a large number of desktops. The existing solutions either bring virtualization overhead in runtime or requires loading a large image over 30 GB leading to an unacceptable network latency. In this work, we propose Troy which takes advantage of the differencing virtual hard disk techniques in Windows *** such, Troy only loads the modifications made on one machine to all other machines. Troy consists of two modules that are responsible to generate an initial image and merge a differencing image with its parent image, respectively. Specifically, we identify the key fields in the virtual hard disk image that links the differencing image and the parent image and find the modified blocks in the differencing images that should be used to replace the blocks in the parent image. We further design a lazy copy solution to reduce the I/O burden in image merging. We have implemented Troy on bare metal machines. The evaluation results show that the performance of Troy is comparable to the native implementation in Windows, without requiring the Windows environment.
Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lac...
详细信息
Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lack of fine-grained instance-wise annotations, existing VAE methods can easily suffer from the posterior collapse problem. In this paper, we propose an innovative asymmetric VAE network by aligning enhanced feature representation（AEFR） for GZSL. Distinguished from general VAE structures, we designed two asymmetric encoders for visual and semantic observations and one decoder for visual reconstruction. Specifically, we propose a simple yet effective gated attention mechanism（GAM） in the visual encoder for enhancing the information interaction between observations and latent variables, alleviating the possible posterior collapse problem effectively. In addition, we propose a novel distributional decoupling-based contrastive learning（D2-CL） to guide learning classification-relevant information while aligning the representations at the taxonomy level in the latent representation space. Extensive experiments on publicly available datasets demonstrate the state-of-the-art performance of our method. The source code is available at https://***/seeyourmind/AEFR.
Pre-trained language models(PLMs),such as BERT,have achieved good results on many natural language processing(NLP)***,some studies have attempted to integrate factual knowledge into PLMs to adapt to vari-ous downstrea...
详细信息
Pre-trained language models(PLMs),such as BERT,have achieved good results on many natural language processing(NLP)***,some studies have attempted to integrate factual knowledge into PLMs to adapt to vari-ous downstream *** sentiment analysis tasks,sentiment knowledge,such as sentiment words,plays a significant role in determining the sentiment tendencies of *** Chinese sentiment analysis,historical stories and fables imbue words with richer connotations and more complex sentiments than those typically found in English,which makes senti-ment knowledge injection *** clearly,this knowledge has not been fully *** this paper,we propose EKBSA,a Chinese sentiment analysis model,which is based on the K-BERT model and utilizes a sentiment knowledge graph to achieve better results on sentiment analysis *** construct a high-quality sentiment knowledge graph,we collect a large number of sentiment words by combining several existing sentiment ***,in order to under-stand texts better,we enhance local attention through syntactic analysis and direct to EKBSA focus more on syntactical-ly relevant *** is compatible with BERT and existing structural *** results show that EKBSA achieves better performance on Chinese sentiment analysis *** upon EKBSA,we further change the gen-eral attention to the context attention and propose Context EKBSA,so that the model can adapt to sentiment analysis tasks in Chinese conversations and achieve good performance.
Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inher...
详细信息
Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.
Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical...
详细信息
Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.
This paper focuses on the finite-time control(FTC) of the composite formation consensus(CFC)problems for multi-robot systems(MRSs). The CFC problems are firstly proposed for MRSs under the complex network topology of ...
详细信息
This paper focuses on the finite-time control(FTC) of the composite formation consensus(CFC)problems for multi-robot systems(MRSs). The CFC problems are firstly proposed for MRSs under the complex network topology of cooperative or cooperative-competitive networks. Regarding the problems of FTC and CFC on multiple Lagrange systems(MLSs), coupled sliding variables are introduced to deal with the robustness and consistent convergence. Then, the adaptive finite-time protocols are given based on the displacement approaches. With the premised FTC, tender-tracking methods are further developed for the problems of tracking information disparity. Stability analyses of those MLSs mentioned above are clarified with Lyapunov candidates considering the coupled sliding vectors, which provide new verification for tender-tracking systems. Under the given coupled-sliding-variable-based finite-time protocols, MLSs distributively adjust the local formation error to achieve global CFC and perform uniform convergence in time-varying tracking. Finally, simulation experiments are conducted while providing practical solutions for the theoretical results.
Recently, multirobot systems(MRSs) have found extensive applications across various domains, including industrial manufacturing, collaborative formation of unmanned equipment, emergency disaster relief, and war scenar...
详细信息
Recently, multirobot systems(MRSs) have found extensive applications across various domains, including industrial manufacturing, collaborative formation of unmanned equipment, emergency disaster relief, and war scenarios [1]. These advancements are largely supported by the development of consistency control theory. However, traditional dynamicsfree models may cause instability in complex robotic systems. Lagrangian dynamics offers a better approach for modeling these systems, as it facilitates controller design and optimization analysis. Despite this, challenges persist with unknown parameters and nonlinear friction within the systems.
The magnetic flux in a permanent magnet transverse flux generator(PMTFG) is three-dimensional(3D), therefore, its efficacy is evaluated using 3D magnetic field analysis. Although the 3D finite-element method(FEM) is h...
详细信息
The magnetic flux in a permanent magnet transverse flux generator(PMTFG) is three-dimensional(3D), therefore, its efficacy is evaluated using 3D magnetic field analysis. Although the 3D finite-element method(FEM) is highly accurate and reliable for machine simulation, it requires a long computation time, which is crucial when it is to be used in an iterative optimization process. Therefore, an alternative to 3DFEM is required as a rapid and accurate analytical technique. This paper presents an analytical model for PMTFG analysis using winding function method. To obtain the air gap MMF distribution, the excitation magneto-motive force(MMF) and the turn function are determined based on certain assumptions. The magnetizing inductance, flux density, and back-electro-magnetomotive force of the winding are then determined. To assess the accuracy of the proposed method, the analytically calculated parameters of the generator are compared to those obtained by a 3D-FEM. The presented method requires significantly shorter computation time than the 3D-FEM with comparable accuracy.
暂无评论