A Linked List Encryption Scheme for Image Steganography without Embedding

Information steganography has received more and more attention from scholars nowadays,especially in the area of image steganography,which uses image content to transmit information and makes the existence of secret information undetectable.To enhance concealment and security,the Steganography without Embedding(SWE)method has proven effective in avoiding image distortion resulting from cover modification.In this paper,a novel encrypted communication scheme for image SWE is proposed.It reconstructs the image into a multi-linked list structure consisting of numerous nodes,where each pixel is transformed into a single node with data and pointer domains.By employing a special addressing algorithm,the optimal linked list corresponding to the secret information can be identified.The receiver can restore the secretmessage fromthe received image using only the list header position information.The scheme is based on the concept of coverless steganography,eliminating the need for any modifications to the cover image.It boasts high concealment and security,along with a complete message restoration rate,making it resistant to steganalysis.Furthermore,this paper proposes linked-list construction schemeswithin theproposedframework,which caneffectively resist a variety of attacks,includingnoise attacks and image compression,demonstrating a certain degree of robustness.To validate the proposed framework,practical tests and comparisons are conducted using multiple datasets.The results affirm the framework’s commendable performance in terms of message reduction rate,hidden writing capacity,and robustness against diverse attacks.

Enhancing visual security: An image encryption scheme based on parallel compressive sensing and edge detection embedding

A novel image encryption scheme based on parallel compressive sensing and edge detection embedding technology is proposed to improve visual security. Firstly, the plain image is sparsely represented using the discrete wavelet transform.Then, the coefficient matrix is scrambled and compressed to obtain a size-reduced image using the Fisher–Yates shuffle and parallel compressive sensing. Subsequently, to increase the security of the proposed algorithm, the compressed image is re-encrypted through permutation and diffusion to obtain a noise-like secret image. Finally, an adaptive embedding method based on edge detection for different carrier images is proposed to generate a visually meaningful cipher image. To improve the plaintext sensitivity of the algorithm, the counter mode is combined with the hash function to generate keys for chaotic systems. Additionally, an effective permutation method is designed to scramble the pixels of the compressed image in the re-encryption stage. The simulation results and analyses demonstrate that the proposed algorithm performs well in terms of visual security and decryption quality.

Identification of partial differential equations from noisy data with integrated knowledge discovery and embedding using evolutionary neural networks

Identification of underlying partial differential equations(PDEs)for complex systems remains a formidable challenge.In the present study,a robust PDE identification method is proposed,demonstrating the ability to extract accurate governing equations under noisy conditions without prior knowledge.Specifically,the proposed method combines gene expression programming,one type of evolutionary algorithm capable of generating unseen terms based solely on basic operators and functional terms,with symbolic regression neural networks.These networks are designed to represent explicit functional expressions and optimize them with data gradients.In particular,the specifically designed neural networks can be easily transformed to physical constraints for the training data,embedding the discovered PDEs to further optimize the metadata used for iterative PDE identification.The proposed method has been tested in four canonical PDE cases,validating its effectiveness without preliminary information and confirming its suitability for practical applications across various noise levels.

TCM-HIN2Vec:A strategy for uncovering biological basis of heart qi deficiency pattern based on network embedding and transcriptomic experiment

Objective To elucidate the biological basis of the heart qi deficiency(HQD)pattern,an in-depth understanding of which is essential for improving clinical herbal therapy.Methods We predicted and characterized HQD pattern genes using the new strategy,TCM-HIN2Vec,which involves heterogeneous network embedding and transcriptomic experiments.First,a heterogeneous network of traditional Chinese medicine(TCM)patterns was constructed using public databases.Next,we predicted HQD pattern genes using a heterogeneous network-embedding algorithm.We then analyzed the functional characteristics of HQD pattern genes using gene enrichment analysis and examined gene expression levels using RNA-seq.Finally,we identified TCM herbs that demonstrated enriched interactions with HQD pattern genes via herbal enrichment analysis.Results Our TCM-HIN2Vec strategy revealed that candidate genes associated with HQD pattern were significantly enriched in energy metabolism,signal transduction pathways,and immune processes.Moreover,we found that these candidate genes were significantly differentially expressed in the transcriptional profile of mice model with heart failure with a qi deficiency pattern.Furthermore,herbal enrichment analysis identified TCM herbs that demonstrated enriched interactions with the top 10 candidate genes and could potentially serve as drug candidates for treating HQD.Conclusion Our results suggested that TCM-HIN2Vec is capable of not only accurately identifying HQD pattern genes,but also deciphering the basis of HQD pattern.Furthermore our finding indicated that TCM-HIN2Vec may be further expanded to develop other patterns,leading to a new approach aimed at elucidating general TCM patterns and developing precision medicine.

Insider threat detection approach for tobacco industry based on heterogeneous graph embedding

In the tobacco industry,insider employee attack is a thorny problem that is difficult to detect.To solve this issue,this paper proposes an insider threat detection method based on heterogeneous graph embedding.First,the interrelationships between logs are fully considered,and log entries are converted into heterogeneous graphs based on these relationships.Second,the heterogeneous graph embedding is adopted and each log entry is represented as a low-dimensional feature vector.Then,normal logs and malicious logs are classified into different clusters by clustering algorithm to identify malicious logs.Finally,the effectiveness and superiority of the method is verified through experiments on the CERT dataset.The experimental results show that this method has better performance compared to some baseline methods.

A chaotic hierarchical encryption/watermark embedding scheme for multi-medical images based on row-column confusion and closed-loop bi-directional diffusion

Security during remote transmission has been an important concern for researchers in recent years.In this paper,a hierarchical encryption multi-image encryption scheme for people with different security levels is designed,and a multiimage encryption(MIE)algorithm with row and column confusion and closed-loop bi-directional diffusion is adopted in the paper.While ensuring secure communication of medical image information,people with different security levels have different levels of decryption keys,and differentiated visual effects can be obtained by using the strong sensitivity of chaotic keys.The highest security level can obtain decrypted images without watermarks,and at the same time,patient information and copyright attribution can be verified by obtaining watermark images.The experimental results show that the scheme is sufficiently secure as an MIE scheme with visualized differences and the encryption and decryption efficiency is significantly improved compared to other works.

Thin-Shell Wormholes Admitting Conformal Motions in Spacetimes of Embedding Class One

This paper discusses the feasibility of thin-shell wormholes in spacetimes of embedding class one admitting a one-parameter group of conformal motions. It is shown that the surface energy density σis positive, while the surface pressure is negative, resulting in , thereby signaling a violation of the null energy condition, a necessary condition for holding a wormhole open. For a Morris-Thorne wormhole, matter that violates the null energy condition is referred to as “exotic”. For the thin-shell wormholes in this paper, however, the violation has a physical explanation since it is a direct consequence of the embedding theory in conjunction with the assumption of conformal symmetry. These properties avoid the need to hypothesize the existence of the highly problematical exotic matter.

Cryptocurrency Transaction Network Embedding From Static and Dynamic Perspectives: An Overview

Cryptocurrency, as a typical application scene of blockchain, has attracted broad interests from both industrial and academic communities. With its rapid development, the cryptocurrency transaction network embedding(CTNE) has become a hot topic. It embeds transaction nodes into low-dimensional feature space while effectively maintaining a network structure,thereby discovering desired patterns demonstrating involved users' normal and abnormal behaviors. Based on a wide investigation into the state-of-the-art CTNE, this survey has made the following efforts: 1) categorizing recent progress of CTNE methods, 2) summarizing the publicly available cryptocurrency transaction network datasets, 3) evaluating several widely-adopted methods to show their performance in several typical evaluation protocols, and 4) discussing the future trends of CTNE. By doing so, it strives to provide a systematic and comprehensive overview of existing CTNE methods from static to dynamic perspectives,thereby promoting further research into this emerging and important field.

Future Event Prediction Based on Temporal Knowledge Graph Embedding

Accurate prediction of future events brings great benefits and reduces losses for society in many domains,such as civil unrest,pandemics,and crimes.Knowledge graph is a general language for describing and modeling complex systems.Different types of events continually occur,which are often related to historical and concurrent events.In this paper,we formalize the future event prediction as a temporal knowledge graph reasoning problem.Most existing studies either conduct reasoning on static knowledge graphs or assume knowledges graphs of all timestamps are available during the training process.As a result,they cannot effectively reason over temporal knowledge graphs and predict events happening in the future.To address this problem,some recent works learn to infer future events based on historical eventbased temporal knowledge graphs.However,these methods do not comprehensively consider the latent patterns and influences behind historical events and concurrent events simultaneously.This paper proposes a new graph representation learning model,namely Recurrent Event Graph ATtention Network(RE-GAT),based on a novel historical and concurrent events attention-aware mechanism by modeling the event knowledge graph sequence recurrently.More specifically,our RE-GAT uses an attention-based historical events embedding module to encode past events,and employs an attention-based concurrent events embedding module to model the associations of events at the same timestamp.A translation-based decoder module and a learning objective are developed to optimize the embeddings of entities and relations.We evaluate our proposed method on four benchmark datasets.Extensive experimental results demonstrate the superiority of our RE-GAT model comparing to various base-lines,which proves that our method can more accurately predict what events are going to happen.

Extrapolation over temporal knowledge graph via hyperbolic embedding

Predicting potential facts in the future,Temporal Knowledge Graph(TKG)extrapolation remains challenging because of the deep dependence between the temporal association and semantic patterns of facts.Intuitively,facts(events)that happened at different timestamps have different influences on future events,which can be attributed to a hierarchy among not only facts but also relevant entities.Therefore,it is crucial to pay more attention to important entities and events when forecasting the future.However,most existing methods focus on reasoning over temporally evolving facts or mining evolutional patterns from known facts,which may be affected by the diversity and variability of the evolution,and they might fail to attach importance to facts that matter.Hyperbolic geometry was proved to be effective in capturing hierarchical patterns among data,which is considered to be a solution for modelling hierarchical relations among facts.To this end,we propose ReTIN,a novel model integrating real-time influence of historical facts for TKG reasoning based on hyperbolic geometry,which provides low-dimensional embeddings to capture latent hierarchical structures and other rich semantic patterns of the existing TKG.Considering both real-time and global features of TKG boosts the adaptation of ReTIN to the ever-changing dynamics and inherent constraints.Extensive experiments on benchmarks demonstrate the superiority of ReTIN over various baselines.The ablation study further supports the value of exploiting temporal information.

Oxygen functionalization-assisted anionic exchange toward unique construction of flower-like transition metal chalcogenide embedded carbon fabric for ultra-long life flexible energy storage and conversion

The metal-organic framework(MOF)derived Ni–Co–C–N composite alloys(NiCCZ)were“embedded”inside the carbon cloth(CC)strands as opposed to the popular idea of growing them upward to realize ultrastable energy storage and conversion application.The NiCCZ was then oxygen functionalized,facilitating the next step of stoichiometric sulfur anion diffusion during hydrothermal sulfurization,generating a flower-like metal hydroxysulfide structure(NiCCZOS)with strong partial implantation inside CC.Thus obtained NiCCZOS shows an excellent capacity when tested as a supercapacitor electrode in a three-electrode configuration.Moreover,when paired with the biomass-derived nitrogen-rich activated carbon,the asymmetric supercapacitor device shows almost 100%capacity retention even after 45,000 charge–discharge cycles with remarkable energy density(59.4 Wh kg^(-1)/263.8μWh cm^(–2))owing to a uniquely designed cathode.Furthermore,the same electrode performed as an excellent bifunctional water-splitting electrocatalyst with an overpotential of 271 mV for oxygen evolution reaction(OER)and 168.4 mV for hydrogen evolution reaction(HER)at 10 mA cm−2 current density along with 30 h of unhinged chronopotentiometric stability performance for both HER and OER.Hence,a unique metal chalcogenide composite electrode/substrate configuration has been proposed as a highly stable electrode material for flexible energy storage and conversion applications.

Enhanced Image Captioning Using Features Concatenation and Efficient Pre-Trained Word Embedding

One of the issues in Computer Vision is the automatic development of descriptions for images,sometimes known as image captioning.Deep Learning techniques have made significant progress in this area.The typical architecture of image captioning systems consists mainly of an image feature extractor subsystem followed by a caption generation lingual subsystem.This paper aims to find optimized models for these two subsystems.For the image feature extraction subsystem,the research tested eight different concatenations of pairs of vision models to get among them the most expressive extracted feature vector of the image.For the caption generation lingual subsystem,this paper tested three different pre-trained language embedding models:Glove(Global Vectors for Word Representation),BERT(Bidirectional Encoder Representations from Transformers),and TaCL(Token-aware Contrastive Learning),to select from them the most accurate pre-trained language embedding model.Our experiments showed that building an image captioning system that uses a concatenation of the two Transformer based models SWIN(Shiftedwindow)and PVT(PyramidVision Transformer)as an image feature extractor,combined with the TaCL language embedding model is the best result among the other combinations.

Multiplex network infomax:Multiplex network embedding via information fusion

For networking of big data applications,an essential issue is how to represent networks in vector space for further mining and analysis tasks,e.g.,node classification,clustering,link prediction,and visualization.Most existing studies on this subject mainly concentrate on monoplex networks considering a single type of relation among nodes.However,numerous real-world networks are naturally composed of multiple layers with different relation types;such a network is called a multiplex network.The majority of existing multiplex network embedding methods either overlook node attributes,resort to node labels for training,or underutilize underlying information shared across multiple layers.In this paper,we propose Multiplex Network Infomax(MNI),an unsupervised embedding framework to represent information of multiple layers into a unified embedding space.To be more specific,we aim to maximize the mutual information between the unified embedding and node embeddings of each layer.On the basis of this framework,we present an unsupervised network embedding method for attributed multiplex networks.Experimental results show that our method achieves competitive performance on not only node-related tasks,such as node classification,clustering,and similarity search,but also a typical edge-related task,i.e.,link prediction,at times even outperforming relevant supervised methods,despite that MNI is fully unsupervised.

Vertex centrality of complex networks based on joint nonnegative matrix factorization and graph embedding

Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.

Question-Answering Pair Matching Based on Question Classification and Ensemble Sentence Embedding

Question-answering(QA)models find answers to a given question.The necessity of automatically finding answers is increasing because it is very important and challenging from the large-scale QA data sets.In this paper,we deal with the QA pair matching approach in QA models,which finds the most relevant question and its recommended answer for a given question.Existing studies for the approach performed on the entire dataset or datasets within a category that the question writer manually specifies.In contrast,we aim to automatically find the category to which the question belongs by employing the text classification model and to find the answer corresponding to the question within the category.Due to the text classification model,we can effectively reduce the search space for finding the answers to a given question.Therefore,the proposed model improves the accuracy of the QA matching model and significantly reduces the model inference time.Furthermore,to improve the performance of finding similar sentences in each category,we present an ensemble embedding model for sentences,improving the performance compared to the individual embedding models.Using real-world QA data sets,we evaluate the performance of the proposed QA matching model.As a result,the accuracy of our final ensemble embedding model based on the text classification model is 81.18%,which outperforms the existing models by 9.81%∼14.16%point.Moreover,in terms of the model inference speed,our model is faster than the existing models by 2.61∼5.07 times due to the effective reduction of search spaces by the text classification model.

An Unsupervised Writer Identification Based on Generating Clusterable Embeddings

The writer identification system identifies individuals based on their handwriting is a frequent topic in biometric authentication and verification systems.Due to its importance,numerous studies have been conducted in various languages.Researchers have established several learning methods for writer identification including supervised and unsupervised learning.However,supervised methods require a large amount of annotation data,which is impossible in most scenarios.On the other hand,unsupervised writer identification methods may be limited and dependent on feature extraction that cannot provide the proper objectives to the architecture and be misinterpreted.This paper introduces an unsupervised writer identification system that analyzes the data and recognizes the writer based on the inter-feature relations of the data to resolve the uncertainty of the features.A pairwise architecturebased Autoembedder was applied to generate clusterable embeddings for handwritten text images.Furthermore,the trained baseline architecture generates the embedding of the data image,and the K-means algorithm is used to distinguish the embedding of individual writers.The proposed model utilized the IAM dataset for the experiment as it is inconsistent with contributions from the authors but is easily accessible for writer identification tasks.In addition,traditional evaluation metrics are used in the proposed model.Finally,the proposed model is compared with a few unsupervised models,and it outperformed the state-of-the-art deep convolutional architectures in recognizing writers based on unlabeled data.

Adaptive Graph Embedding With Consistency and Specificity for Domain Adaptation

Domain adaptation(DA) aims to find a subspace,where the discrepancies between the source and target domains are reduced. Based on this subspace, the classifier trained by the labeled source samples can classify unlabeled target samples well.Existing approaches leverage Graph Embedding Learning to explore such a subspace. Unfortunately, due to 1) the interaction of the consistency and specificity between samples, and 2) the joint impact of the degenerated features and incorrect labels in the samples, the existing approaches might assign unsuitable similarity, which restricts their performance. In this paper, we propose an approach called adaptive graph embedding with consistency and specificity(AGE-CS) to cope with these issues. AGE-CS consists of two methods, i.e., graph embedding with consistency and specificity(GECS), and adaptive graph embedding(AGE).GECS jointly learns the similarity of samples under the geometric distance and semantic similarity metrics, while AGE adaptively adjusts the relative importance between the geometric distance and semantic similarity during the iterations. By AGE-CS,the neighborhood samples with the same label are rewarded,while the neighborhood samples with different labels are punished. As a result, compact structures are preserved, and advanced performance is achieved. Extensive experiments on five benchmark datasets demonstrate that the proposed method performs better than other Graph Embedding methods.

Optimizing Region of Interest Selection for Effective Embedding in Video Steganography Based on Genetic Algorithms

With the widespread use of the internet,there is an increasing need to ensure the security and privacy of transmitted data.This has led to an intensified focus on the study of video steganography,which is a technique that hides data within a video cover to avoid detection.The effectiveness of any steganography method depends on its ability to embed data without altering the original video’s quality while maintaining high efficiency.This paper proposes a new method to video steganography,which involves utilizing a Genetic Algorithm(GA)for identifying the Region of Interest(ROI)in the cover video.The ROI is the area in the video that is the most suitable for data embedding.The secret data is encrypted using the Advanced Encryption Standard(AES),which is a widely accepted encryption standard,before being embedded into the cover video,utilizing up to 10%of the cover video.This process ensures the security and confidentiality of the embedded data.The performance metrics for assessing the proposed method are the Peak Signalto-Noise Ratio(PSNR)and the encoding and decoding time.The results show that the proposed method has a high embedding capacity and efficiency,with a PSNR ranging between 64 and 75 dBs,which indicates that the embedded data is almost indistinguishable from the original video.Additionally,the method can encode and decode data quickly,making it efficient for real-time applications.

Heterogeneous Network Embedding: A Survey

Real-world complex networks are inherently heterogeneous;they have different types of nodes,attributes,and relationships.In recent years,various methods have been proposed to automatically learn how to encode the structural and semantic information contained in heterogeneous information networks(HINs)into low-dimensional embeddings;this task is called heterogeneous network embedding(HNE).Efficient HNE techniques can benefit various HIN-based machine learning tasks such as node classification,recommender systems,and information retrieval.Here,we provide a comprehensive survey of key advancements in the area of HNE.First,we define an encoder-decoder-based HNE model taxonomy.Then,we systematically overview,compare,and summarize various state-of-the-art HNE models and analyze the advantages and disadvantages of various model categories to identify more potentially competitive HNE frameworks.We also summarize the application fields,benchmark datasets,open source tools,andperformance evaluation in theHNEarea.Finally,wediscuss open issues and suggest promising future directions.We anticipate that this survey will provide deep insights into research in the field of HNE.

Role-Based Network Embedding via Quantum Walk with Weighted Features Fusion

Role-based network embedding aims to embed role-similar nodes into a similar embedding space,which is widely used in graph mining tasks such as role classification and detection.Roles are sets of nodes in graph networks with similar structural patterns and functions.However,the rolesimilar nodes may be far away or even disconnected from each other.Meanwhile,the neighborhood node features and noise also affect the result of the role-based network embedding,which are also challenges of current network embedding work.In this paper,we propose a Role-based network Embedding via Quantum walk with weighted Features fusion(REQF),which simultaneously considers the influence of global and local role information,node features,and noise.Firstly,we capture the global role information of nodes via quantum walk based on its superposition property which emphasizes the local role information via biased quantum walk.Secondly,we utilize the quantum walkweighted characteristic function to extract and fuse features of nodes and their neighborhood by different distributions which contain role information implicitly.Finally,we leverage the Variational Auto-Encoder(VAE)to reduce the effect of noise.We conduct extensive experiments on seven real-world datasets,and the results show that REQF is more effective at capturing role information in the network,which outperforms the best baseline by up to 14.6% in role classification,and 23% in role detection on average.