As people become increasingly reliant on the Internet, securely storing and publishing private data has become an important issue. In real life, the release of graph data can lead to privacy breaches, which is a highl...
详细信息
As people become increasingly reliant on the Internet, securely storing and publishing private data has become an important issue. In real life, the release of graph data can lead to privacy breaches, which is a highly challenging problem. Although current research has addressed the issue of identity disclosure, there are still two challenges: First, the privacy protection for large-scale datasets is not yet comprehensive; Second, it is difficult to simultaneously protect the privacy of nodes, edges, and attributes in social networks. To address these issues, this paper proposes a(k,t)-graph anonymity algorithm based on enhanced clustering. The algorithm uses k-means++ clustering for k-anonymity and t-closeness to improve k-anonymity. We evaluate the privacy and efficiency of this method on two datasets and achieved good results. This research is of great significance for addressing the problem of privacy breaches that may arise from the publication of graph data.
The advancement of terahertz (THz) communication technology drives the evolution of wireless communication systems,offering novel pathways and technical means for the development of future 6G communication *** wireles...
The advancement of terahertz (THz) communication technology drives the evolution of wireless communication systems,offering novel pathways and technical means for the development of future 6G communication *** wireless communication systems are often constrained by bandwidth limitations of electronic devices in high frequency ***,THz communication technology leverages the characteristics of electromagnetic waves to transcend these limitations,enabling communication athigher frequencies and wider bandwidths.
In this paper, a fault-tolerant-based online critic learning algorithm is developed to solve the optimal tracking control issue for nonaffine nonlinear systems with actuator ***, a novel augmented plant is constructed...
详细信息
In this paper, a fault-tolerant-based online critic learning algorithm is developed to solve the optimal tracking control issue for nonaffine nonlinear systems with actuator ***, a novel augmented plant is constructed by fusing the system state and the reference trajectory, which aims to transform the optimal fault-tolerant tracking control design with actuator faults into the optimal regulation problem of the conventional nonlinear error system. Subsequently, in order to ensure the normal execution of the online learning algorithm, a stability criterion condition is created to obtain an initial admissible tracking policy. Then, the constructed model neural network(NN) is pretrained to recognize the system dynamics and calculate trajectory control. The critic and action NNs are constructed to output the approximate cost function and approximate tracking control,respectively. The Hamilton-Jacobi-Bellman equation of the error system is solved online through the action-critic framework. In theoretical analysis, it is proved that all concerned signals are uniformly ultimately bounded according to the Lyapunov *** tracking control law can approach the optimal tracking control within a finite approximation error. Finally, two experimental examples are conducted to indicate the effectiveness and superiority of the developed fault-tolerant tracking control scheme.
The optimal control of nonlinear systems is crucial to improve system performance. However, the uncertainties of cost functions and systems dynamics make it difficult to solve the optimal control laws. To cope with th...
详细信息
Conditional proxy re-encryption(CPRE)is an effective cryptographic primitive language that enhances the access control mechanism and makes the delegation of decryption permissions more granular,but most of the attribu...
详细信息
Conditional proxy re-encryption(CPRE)is an effective cryptographic primitive language that enhances the access control mechanism and makes the delegation of decryption permissions more granular,but most of the attribute-based conditional proxy re-encryption(AB-CPRE)schemes proposed so far do not take into account the importance of user attributes.A weighted attribute-based conditional proxy re-encryption(WAB-CPRE)scheme is thus designed to provide more precise decryption rights *** introducing the concept of weight attributes,the quantity of system attributes managed by the server is reduced *** the same time,a weighted tree structure is constructed to simplify the expression of access structure *** conditional proxy re-encryption,large amounts of data and complex computations are outsourced to cloud servers,so the data owner(DO)can revoke the user’s decryption rights directly with minimal *** scheme proposed achieves security against chosen plaintext attacks(CPA).Experimental simulation results demonstrated that the decryption time is within 6–9 ms,and it has a significant reduction in communication and computation cost on the user side with better functionality compared to other related schemes,which enables users to access cloud data on devices with limited resources.
Visible light communication (VLC) technology utilizes LEDs as light sources, offering several benefits, such as the use of license-free spectrum, green, and safe. However, conventional LED devices face challenges due ...
详细信息
In this communication, a metal-frame slot antenna with a very small ground clearance for laptop is proposed. Regarding the antenna structure, it is an asymmetrical modified inverted T-shaped slot (AMITS) structure, wh...
详细信息
Feature selection is a crucial step in data preprocessing because feature selection reduces the dimensionality of data by eliminating irrelevant and redundant features. Since manual labeling is expensive, unsupervised...
详细信息
Feature selection is a crucial step in data preprocessing because feature selection reduces the dimensionality of data by eliminating irrelevant and redundant features. Since manual labeling is expensive, unsupervised feature selection has received increasing attention in recent years. However, existing unsupervised feature selection methods tend to prioritize selecting highly correlated features over exploring feature diversity. Thus, a regularized fractal autoencoder(RFAE) method is proposed to select informative features in an unsupervised way. Specifically, the fractal autoencoder network extends autoencoders to construct a correspondence neural network and a selection neural network. The correspondence neural network exploits interfeature correlations and the selection neural network selects the informative features. A redundancy regularization strategy consists of a redundancy elimination regularization term based on the dependency between features and a sparse regularization term based on the group lasso. The redundancy regularization strategy eliminates feature subset redundancy and enhances network generalization ability. Extensive experimental results on six publicly available datasets show that the proposed RFAE outperforms the compared methods regarding clustering accuracy and classification accuracy. Moreover, the proposed RFAE achieves acceptable computation efficiency.
Infrared images have been widely used in military, civilian, and industrial fields. Due to the inherent limitations of sensors, infrared images usually have some disadvantages such as low resolution and blurred textur...
详细信息
High utility itemset mining is a research topic of the pattern mining domain, which has been widely applied in reality during the past decade. Although most high utility itemset mining algorithms show significant exec...
详细信息
暂无评论