In this paper, we design a distributed stochastic source seeking algorithm based on time-delay measurements to implement source seeking and formation control, so that vehicles can achieve and maintain a specific forma...
详细信息
In this paper, we design a distributed stochastic source seeking algorithm based on time-delay measurements to implement source seeking and formation control, so that vehicles can achieve and maintain a specific formation during the source seeking process. First, we present continuous-time stochastic averaging theorems for nonlinear delay-differential systems with stochastic perturbations. Then, based on the stochastic extremum seeking method and the leaderless formation strategy,we design a distributed stochastic source seeking algorithm based on time-delay measurements to navigate multiple velocity-actuated vehicles to search for an unknown source while achieving and maintaining a predefined formation, and the effect of the delay is eliminated by adopting the one-stage sequential predictor approach. Moreover, based on our developed stochastic averaging theorems, we prove that the average position of vehicles exponentially converges to a small neighborhood of the source in the almost sure sense, and vehicles can achieve and maintain a predefined formation. Finally, we provide numerical examples to verify the effectiveness of our proposed algorithm.
Estimating lighting from standard images can effectively circumvent the need for resourceintensive high-dynamic-range(HDR)lighting ***,this task is often ill-posed and challenging,particularly for indoor scenes,due to...
详细信息
Estimating lighting from standard images can effectively circumvent the need for resourceintensive high-dynamic-range(HDR)lighting ***,this task is often ill-posed and challenging,particularly for indoor scenes,due to the intricacy and ambiguity inherent in various indoor illumination *** propose an innovative transformer-based method called SGformer for lighting estimation through modeling spherical Gaussian(SG)distributions—a compact yet expressive lighting *** from previous approaches,we explore underlying local and global dependencies in lighting features,which are crucial for reliable lighting ***,we investigate the structural relationships spanning various resolutions of SG distributions,ranging from sparse to dense,aiming to enhance structural consistency and curtail potential stochastic noise stemming from independent SG component *** harnessing the synergy of local–global lighting representation learning and incorporating consistency constraints from various SG resolutions,the proposed method yields more accurate lighting estimates,allowing for more realistic lighting effects in object relighting and *** code and model implementing our work can be found at https://***/junhong-jennifer-zhao/SGformer.
Dialogue-based relation extraction(DialogRE) aims to predict relationships between two entities in dialogue. Current approaches to dialogue relationship extraction grapple with long-distance entity relationships in di...
详细信息
Dialogue-based relation extraction(DialogRE) aims to predict relationships between two entities in dialogue. Current approaches to dialogue relationship extraction grapple with long-distance entity relationships in dialogue data as well as complex entity relationships, such as a single entity with multiple types of connections. To address these issues, this paper presents a novel approach for dialogue relationship extraction termed the hypergraphs and heterogeneous graphs model(HG2G). This model introduces a two-tiered structure, comprising dialogue hypergraphs and dialogue heterogeneous graphs, to address the shortcomings of existing methods. The dialogue hypergraph establishes connections between similar nodes using hyper-edges and utilizes hypergraph convolution to capture multi-level features. Simultaneously, the dialogue heterogeneous graph connects nodes and edges of different types, employing heterogeneous graph convolution to aggregate cross-sentence information. Ultimately, the integrated nodes from both graphs capture the semantic nuances inherent in dialogue. Experimental results on the DialogRE dataset demonstrate that the HG2G model outperforms existing state-of-the-art methods.
Deep neural networks(DNNs)are vulnerable to elaborately crafted and imperceptible adversarial *** the continuous development of adversarial attack methods,existing defense algorithms can no longer defend against them ...
详细信息
Deep neural networks(DNNs)are vulnerable to elaborately crafted and imperceptible adversarial *** the continuous development of adversarial attack methods,existing defense algorithms can no longer defend against them ***,numerous studies have shown that vision transformer(ViT)has stronger robustness and generalization performance than the convolutional neural network(CNN)in various ***,because the standard denoiser is subject to the error amplification effect,the prediction network cannot correctly classify all reconstruction ***,this paper proposes a defense network(CVTNet)that combines CNNs and ViTs that is appended in front of the prediction *** can effectively eliminate adversarial perturbations and maintain high ***,this paper proposes a regularization loss(L_(CPL)),which optimizes the CVTNet by computing different losses for the correct prediction set(CPS)and the wrong prediction set(WPS)of the reconstruction examples,*** evaluation results on several standard benchmark datasets show that CVTNet performs better robustness than other advanced *** with state-of-the-art algorithms,the proposed CVTNet defense improves the average accuracy of pixel-constrained attack examples generated on the CIFAR-10 dataset by 24.25%and spatially-constrained attack examples by 14.06%.Moreover,CVTNet shows excellent generalizability in cross-model protection.
As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of *** in a SIS scheme,a secret image is shared via shadows and could be reconstructed by having the required ...
详细信息
As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of *** in a SIS scheme,a secret image is shared via shadows and could be reconstructed by having the required number of them.A major downside of this method is its noise-like shadows,which draw the malicious users'*** order to overcome this problem,SIS schemes with meaningful shadows are introduced in which the shadows are first hidden in innocent-looking cover images and then *** most of these schemes,the cover image cannot be recovered without distortion,which makes them useless in case of utilising critical cover images such as military or medical ***,embedding the secret data in Least significant bits of the cover image,in many of these schemes,makes them very fragile to steganlysis.A reversible IWT-based SIS scheme using Rook polynomial and Hamming code with authentication is *** order to make the scheme robust to steganalysis,the shadow image is embedded in coefficients of Integer wavelet transform of the cover *** Rook polynomial makes the scheme more secure and moreover makes authentication very easy and with no need to share private key to ***,utilising Hamming code lets us embed data with much less required modifications on the cover image which results in high-quality stego images.
The parafoil system is nonlinear and complex with a large time delay. This makes it challenging for traditional control methods to control the parafoil system effectively. However, the Markov property of reinforcement...
详细信息
data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er soun...
详细信息
data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.
Traffic encryption techniques facilitate cyberattackers to hide their presence and activities. Traffic classification is an important method to prevent network threats. However, due to the tremendous traffic volume an...
详细信息
Traffic encryption techniques facilitate cyberattackers to hide their presence and activities. Traffic classification is an important method to prevent network threats. However, due to the tremendous traffic volume and limitations of computing, most existing traffic classification techniques are inapplicable to the high-speed network environment. In this paper, we propose a High-speed Encrypted Traffic Classification(HETC) method containing two stages. First, to efficiently detect whether traffic is encrypted, HETC focuses on randomly sampled short flows and extracts aggregation entropies with chi-square test features to measure the different patterns of the byte composition and distribution between encrypted and unencrypted flows. Second, HETC introduces binary features upon the previous features and performs fine-grained traffic classification by combining these payload features with a Random Forest model. The experimental results show that HETC can achieve a 94% F-measure in detecting encrypted flows and a 85%–93% F-measure in classifying fine-grained flows for a 1-KB flow-length dataset, outperforming the state-of-the-art comparison methods. Meanwhile, HETC does not need to wait for the end of the flow and can extract mass computing features. The average time for HETC to process each flow is only 2 or 16 ms, which is lower than the flow duration in most cases, making it a good candidate for high-speed traffic classification.
In this study, the event-triggered asymptotic tracking control problem is considered for a class of nonholonomic systems in chained form for the time-varying reference input. First, to eliminate the ripple phenomenon ...
详细信息
In this study, the event-triggered asymptotic tracking control problem is considered for a class of nonholonomic systems in chained form for the time-varying reference input. First, to eliminate the ripple phenomenon caused by the imprecise compensation of the time-varying reference input, a novel time-varying event-triggered piecewise continuous control law and a triggering mechanism with a time-varying triggering function are developed. Second, an explicit integral input-to-state stable Lyapunov function is constructed for the time-varying closed-loop system regarding the sampling error as the external input. The origin of the closed-loop system is shown to be uniformly globally asymptotically stable for any global exponential decaying threshold signals, which in turn rules out the Zeno behavior. Moreover, infinitely fast sampling can be avoided by appropriately tuning the exponential convergence rate of the threshold signal. A numerical simulation example is provided to illustrate the proposed control approach.
Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distri...
详细信息
Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.
暂无评论