Predicting information popularity in social networks has become a central focus of network analysis. While recent advancements have been made, most existing approaches rely solely on the final cascade size as the primary supervision signal for model optimization. This narrow focus limits the model generalization ability, particularly when faced with highly heterogeneous cascades. Additionally, in real-world scenarios, obtaining detailed social relationships is challenging, complicating effective structural feature learning. To address these issues, this paper proposes a semi-supervised model called Dual Variational Cascade AutoEncoders (DVCAE), which leverages parallel structural and temporal variational autoencoders for enhanced feature learning and popularity prediction. The model first aggregates multiple cascades into a global interaction graph, enabling structural information sharing across cascades. Then, it applies sparse matrix factorization-based graph embedding and graph filtering techniques on global and local cascade graphs respectively, generating initial node embeddings that are insensitive to topological perturbations. After that, two parallel variational autoencoders are designed to generate hidden representations for structural and temporal features respectively, with two self-supervised reconstruction losses integrated into the prediction loss to enrich supervision signals. Extensive experiments conducted on three real-world datasets demonstrate that DVCAE outperforms state-of-the-art models in terms of prediction accuracy.

Big data require exceptional technologies to efficiently process large quantities of data within tolerable elapsed times, such as capture, curation, storage, search, sharing, transfer, analysis and visualization. Concept, features, construction importance, architecture, run mode, and its key technologies of big data are analyzed in this paper. Information sharing and data security under big data constructin are studied, at last, four measures for building big data are putforward, which can provide good decision-making for big data construction.

Block layout dimension prediction is an important activity in many very large scale integration computer-aided design tasks, among them structural synthesis, floor planning and physical synthesis. Block layout dimension prediction is harder than block area prediction and has been previously considered to be intractable. The authors present a solution to this problem using a neural network machine learning approach. The method uses a neural network to predict first the number of contacts; then another neural network uses this prediction and other circuit features to predict the width and the height of its layout. The approach has produced much better results than those published-a dimension (aspect ratio) prediction average error of less than 18% with a corresponding area prediction average error of less than 15%. Furthermore, the technique predicts the number of contacts in a circuit with less than 4% error on average.