Search

Recommendation accuracy is a fundamental problem in the quality of the recommendation system. In this paper, we propose an efficient deep matrix factorization with review feature learning for the industrial recommender system (EDMF). Two characteristics in user's review are revealed. First, interactivity between the user and the item, which can also be considered as the former's scoring behavior on the latter, is exploited in a review. Second, the review is only a partial description of the user's preferences for the item, which is revealed as the sparsity property. Specifically, in the first characteristic, EDMF extracts the interactive features of onefold review by convolutional neural networks with word attention mechanism. Subsequently, L0 norm is leveraged to constrain the review considering that the review information is a sparse feature, which is the second characteristic. Furthermore, the loss function is constructed by maximum a posteriori estimation theory, where the interactivity and sparsity property are converted as two prior probability functions. Finally, the alternative minimization algorithm is introduced to optimize the loss functions. Experimental results on several datasets demonstrate that the proposed methods, which show good industrial conversion application prospects, outperform the state-of-the-art methods in terms of effectiveness and efficiency.

Computation offloading is an important technology to achieve lower delay communication and improve the experience of service (EoS) in mobile edge computing (MEC). Due to the openness of wireless links and the limitation of computing resources in mobile computing process, the privacy of users is easy to leak, and the completion time of tasks is difficult to guarantee. In this paper, we propose an efficient computing offloading algorithm based on privacy-preserving (ECOAP), which solves the privacy problem of offloading users through the encryption technology. To avoid the algorithm falling into local optimum and reduce the offloading user energy consumption and task completion delay in the case of encryption, we use the improved fast nondominated sorting genetic algorithm (INSGA-II) to obtain the optimal offloading strategy set. We obtain the optimal offloading strategy by using the methods of min-max normalization and simple additive weighting based on the optimal offloading strategy set. The ECOAP algorithm can preserve user privacy and reduce task completion time and user energy consumption effectively by comparing with other algorithms.

Cryptography chips are often used in some applications, such as smart grids and Internet of Things (IoT) to ensure their security. Cryptographic chips must be strictly tested to guarantee the correctness of the encryption and decryption. Scan-based design-for-testability (DFT) provides high test quality. However, it can also be misused to steal the cipher key of cryptographic chips by hackers. In this article, we present a new scan design methodology that can resist scan-based side-channel attacks by the dynamical obfuscation of scan input data and scan output data. The scan test is managed by a test password, which consists of load password and scan password. When the chip enters into the test mode, it is required to apply the test password via some external input ports. Once the correct load password is delivered, the scan password can be loaded into a special shift register. If the scan password is also correct, the chip testing can proceed normally. In case the load password or the scan password is wrong, the data in scan chains cannot be propagated correctly. Specifically, some elusory bits are sneaked into scan chains dynamically. The advantage of the proposed method is that it has no negative impact on design performance and test flow when powerfully protecting cryptographic chips. The area penalty is also acceptably low compared with other schemes.

Internet of Things (IoT) realizes the interconnection of heterogeneous devices by the technology of wireless and mobile communication. The data of target regions are collected by widely distributed sensing devices and transmitted to the processing center for aggregation and analysis as the basis of IoT. The quality of IoT services usually depends on the accuracy and integrity of data. However, due to the adverse environment or device defects, the collected data will be anomalous. Therefore, the effective method of anomaly detection is the crucial issue for guaranteeing service quality. Deep learning is one of the most concerned technology in recent years which realizes automatic feature extraction from raw data. In this article, the integrated model of the convolutional neural network (CNN) and recurrent autoencoder is proposed for anomaly detection. Simple combination of CNN and autoencoder cannot improve classification performance, especially, for time series. Therefore, we utilize the two-stage sliding window in data preprocessing to learn better representations. Based on the characteristics of the Yahoo Webscope S5 dataset, raw time series with anomalous points are extended to fixed-length sequences with normal or anomaly label via the first-stage sliding window. Then, each sequence is transformed into continuous time-dependent subsequences by another smaller sliding window. The preprocessing of the two-stage sliding window can be considered as low-level temporal feature extraction, and we empirically prove that the preprocessing of the two-stage sliding window will be useful for high-level feature extraction in the integrated model. After data preprocessing, spatial and temporal features are extracted in CNN and recurrent autoencoder for the classification in fully connected networks. Empiric results show that the proposed model has better performances on multiple classification metrics and achieves preferable effect on anomaly detection.

Influenza poses a significant risk to public health, as evidenced by the 2009 H1N1 pandemic which caused up to 203,000 deaths worldwide. Predicting the spatiotemporal information of disease in the incubation period is crucial because the prime aim of it is to provide guidance on preparing a response and avoid presumably adverse impact caused by a pandemic. This article designs and analyzes a prediction system about influenza-like illness (ILI) from the latent temporal and spatial information. In this system 1) Gaussian function model and multivariate polynomial regression are employed to investigate the temporal and spatial distribution of ILI data; 2) the phase space reconstructed by delay-coordinate embedding is used to explore the dynamical evolution behavior of the 1-D ILI series; and 3) a dynamical radial basis function neural network (DRBFNN) method which is the kernel of the system, is proposed to predict the ILI values based on the correlations between the observations space and reconstructed phase space. The performance analysis of our system shows that the regression equations coupling with spatial distribution information can be used to supplement the missing data, and the proposed DRBFNN method can predict the trends of ILI for the following one year. Furthermore, the prediction system in this article applies a model-free control schemes, i.e., there are no restriction equations between the multivariable inputs and outputs. This prediction system is expected to be used in predicting the output signals, even the chaotic output signals, in meteorology, industry, medicine, economy, and other fields. An example of predicting the Standard & Poors 500 index is given to introduce the application of our proposed system. The trend of open prices of the following eight trading days is well predicted.

In recent years, Industrial Internet of Things (IIoT) has gradually attracted the attention of the industry owing to its accurate time synchronization, communication accuracy, and high adaptability. As an important data structure, graphs are widely used in IIoT applications, where entities and their relationships can be expressed in the form of graphs. With the widespread adoption of IIoT and cloud computing, an increasing number of individuals or organizations are outsourcing their IIoT graph data to cloud servers to enjoy the unlimited storage space and fast computing service. To protect the privacy of graph data, graphs are usually encrypted before being outsourced. In this article, we propose a search pattern privacy system for approximate shortest distance query of encrypted graphs in IIoT. To realize search pattern privacy, we adopt two noncolluded cloud servers to accomplish different tasks. We leverage the first server to store the encrypted data and perform query operations, and use the second one to rerandomize the contents and shuffle the locations of the queried records. Before queries, we generate the trapdoors by using different random numbers. After queries, we ask the second server to rerandomize the contents of the records that the first server touched. In addition, we shuffle the physical locations of original records by inserting some fake records. In this way, all contents and physical locations of the touched records change, so that the first server cannot distinguish whether two queries are the same or not. To enhance the efficiency on the user side, we further improve this system by moving some heavy workloads from the user to the cloud. The security analysis and the performance evaluation show that our work is secure and efficient.

UAV-assisted wireless communications facilitate the applications of Internet of Things (IoT), which employ billions of devices to sense and collect data with an on-demand style. However, there are numerous malicious Mobile Data Collectors (MDCs) mixing into the network, stealing or tampering with data, which greatly damages IoT applications. So, it is urgent to build a ubiquitous trust communication system. In this paper, a UAV-assisted Ubiquitous Trust Evaluation (UUTE) framework is proposed, which combines the UAV-assisted global trust evaluation and the historical interaction based local trust evaluation. We first propose a global trust evaluation model for data collection platforms. It can accurately eliminate malicious MDCs and create a clean data collection environment, by dispatching UAVs to collect baseline data to validate the data submitted by MDCs. After that, a local trust evaluation model is proposed to help select credible MDCs for collaborative data collection. By letting UAVs distribute the data verification hash codes to MDCs, the MDCs can verify whether the exchanged data from the interacted MDCs is reliable. Extensive experiments conduct on a real-life dataset demonstrate that our UUTE system outperforms the existing trust evaluation systems in terms of accuracy and cost.

The communication in a 6G-enabled network in a box (NIB) needs to meet the characteristics of fast, convenient, and safe. Secret sharing scheme has become a hot topic nowadays due to unconditional security and simple decryption. At the same time, a quick response (QR) code as a popular carrier has been widely applied in various industrial applications because of the data payload and convenience. Thus, the combination of secret sharing and QR code provides a solution by satisfying the requirements of 6G-enabled NIB. In this article, we design a QR code secret sharing scheme with authentication to protect private data and prevent cheater. In this scheme, a secret image is first divided into a series of shadows based on a polynomial, and authentication bits are generated based on the generated shadows. Then shadows and the authentication bits are embedded into the cover QR codes according to the error correction redundancy and the homomorphism of the Reed–Solomon code in the QR code. In addition, the secret can be restored with the qualified shares and the authentication bits could verify the authenticity of the embedded shadows. Compared with existing schemes, the proposed scheme not only guarantees a high capacity but also embeds more authentication bits to improve the authentication ability. In addition, experimental results have demonstrated that the proposed scheme is both robust and secure.

Intelligent anomaly detection for key performance indicators (KPIs) is important for keeping services reliable in industrial-based cyber–physical systems (CPS). However, it is common in practice for various KPI sampling strategies to be utilized. We experimentally verify that anomaly detection is highly sensitive to irregular sampling, and accordingly go on to investigate low-cost anomaly detection for large-scale irregular KPIs. Irregular KPIs can be classified into four types: equal interval and unequal quantity (EIUQ) KPIs, unequal interval (UI) KPIs, unequal interval with equal duration (UIED) KPIs, and segmented irregular KPIs. In this article, we propose an anomaly detection framework based on these irregular types. Moreover, to handle the various lengths and phase shifts among EIUQ KPIs, we propose a normalized version of unequal cross-correlation, which slides the KPIs to enable finding the most similar position. To avoid high computational costs, we analyze the low-rank feature of KPIs data and propose a matrix factorization-based alignment algorithm for UIED KPIs; this algorithm treats UIED KPIs as an incomplete matrix and recovers the KPIs to align them before performing anomaly detection. Extensive simulations using three public datasets and two real-world datasets demonstrate that our algorithm can achieve a larger F1-score than Minkowski distance and less time than dynamic time warping distance.

Semi-supervised clustering algorithms have several limitations: 1) the computation complexity of them is very high, because calculating the similarity distances of pairs of examples is time-consuming; 2) traditional semi-supervised clustering methods have not considered how to make full use of must-link and cannot-link constraints. In the clustering, the contribution of a few pairwise constraints to the clustering performance is very limited, and some may negatively affect the outcome; and 3) these methods are not effective to handle high dimensional data, especially for time series data. Up to now, few work touched semi-supervised clustering on time series data. To efficiently cluster large-scale time series data, we first tackle contract time series clustering to produce the most accurate clustering results under a contracted time. We propose a semi-supervised time series clustering framework (STSC), which integrates a fast similarity measure and a constraint propagation approach. Based on the proposed framework, two valid semi-supervised clustering algorithms including fssK-means and fssDBSCAN are designed. Experiments on 11 datasets show that our proposed method is efficient and effective for clustering large-scale time series data.

Once defined, the access control policies and regulations would never be changed in a running and state transition process. However, it will give attackers the possibility of discovering vulnerabilities in the system, and the control systems lack the ability of dynamic perception of security state and risk, causing the systems to be exposed to risks. In this article, a dynamic Bell–LaPadula (BLP) model is proposed. The conditional random field (CRF) is introduced into the BLP model to optimize the rules. First, the model formalizes the security attributes, states of system, transition rules, and constraint models on the basis of the state transition of CRFs. After the historical system access logs are processed as the original dataset, a feature selection method is proposed to extract the requests and current states as feature vectors. Second, this article presents a rules training algorithm based on L-BFGS to implement the study and training of datasets, and then marks the logs in the test set through Viterbi algorithm automatically. On the base of these, a rule generation algorithm is proposed to dynamically adjust the access control rules based on the current security status and events of the system. Third, the security of CRFs-BLP is proved by theoretical analysis. Finally, the validity and accuracy of the model are verified by estimating the value of the precision, recall, and $F1$ -score. As the system threats are shown to be decreased obviously from these experiments, this dynamic model can decrease the vulnerabilities and risk effectively.

The issue of impulse noise detection and reduction is a critical problem for image processing application systems. In order to detect impulse noises in corrupted images, a statistic named local consensus index (LCI) is proposed for quantitatively evaluating how noise free a pixel is, and then an impulse noise detection scheme based on LCI is introduced. First, the similarity between arbitrary two pixels in an image is quantified based on both their geometric distance and intensity difference, and the LCI of arbitrary pixel is calculated by summing all the similarity values of pixels in its neighborhood. As a new statistic, the value of LCI indicates the local consensus of the concerned pixel regarding its neighbors and could also tell whether a pixel is noise free or impulsive. Therefore, LCI can be directly used as an efficient indicator of impulse noise. Furthermore, to improve the performance of impulse noise detection, different strategies are applied to the pixels at flat regions and the ones with complex textures, since distributions of LCI value within those regions are totally different. As for impulse noise filtering, a hybrid graph Laplacian regularization (HGLR) method is introduced to restore the intensities of those pixels degraded by impulse noise. We conduct extensive experiments to verify the effectiveness of our impulsive noise detection and reduction method, and the results show that the proposed method outperforms the state-of-the-art techniques in terms of impulse detection and noise removal.

The gap between the peak-hour Internet and the average level is increasing, which inevitably creates a type of temporary cellular weak coverage when there is a surge in data traffic demand, where any cell-edge device will have a low spectrum efficiency (SE). In this article, we propose a novel incentive architecture based on the dynamic radio frequency charging technology to improve the SE and use the Stackelberg game theory to formulate the problem. In such a model, a small base station (SBS) acts as the leader to offer a desired partition of the resource block obtained by a cell-edge device, while some small energy providers (SEPs) and small virtual access points (SVAPs) that are selected from user equipment act as the followers to make their decisions, respectively, to compete for the free part of such a resource block. Following the potential game rules, all the SEPs compete for a specific free resource part allocated by the SBS, and then, all the SVAPs compete for another nonoverlapping part allocated by the SBS on the basis of the results of the SEPs’ potential game. Although our incentive architecture formally has three game stages, it is essentially a two-level Stackelberg game, which is analyzed by using a backward induction method. The theoretical analysis proves the convergence of the above-mentioned game models, and the simulation results demonstrate that the proposed incentive architecture can improve the SE for each cell-edge device.

The blockchain-based management system has been regarded as a novel way to improve the efficiency and safety of Vehicular Ad Hoc Networks (VANETs). A blockchain-based scheme’s performance depends on blockchain nodes’ computing power composed from the road-side unit (RSU). However, the throughput of blockchain-based application in VANETs is limited by the network bandwidth. A single blockchain cannot record large-scale VANETs’ data. In this paper, we design an atomic cross-chain swap-based management system (ACSMS) to boost the scalability of blockchain-based application in VANETs. The blockchain-based public-key encryption with keyword search is further introduced to protect user privacy. The analysis shows that ACSMS achieves cross-chain swap without loss of CAV security privacy. The simulation results show that our method can realize multiple blockchain-based applications in VANETs.

During the COVID-19 pandemic, the treatment of aortic dissection has faced additional challenges. The necessary medical resources are in serious shortage, and the preoperative waiting time has been significantly prolonged due to the requirement to test for COVID-19 infection. In this work, we focus on the risk prediction of aortic dissection surgery under the influence of the COVID-19 pandemic. A general scheme of medical data processing is proposed, which includes five modules, namely problem definition, data preprocessing, data mining, result analysis, and knowledge application. Based on effective data preprocessing, feature analysis and boosting trees, our proposed fusion decision model can obtain 100% accuracy for early postoperative mortality prediction, which outperforms machine learning methods based on a singlemodel such as LightGBM,XGBoost, andCatBoost. The results reveal the critical factors related to the postoperative mortality of aortic dissection, which can provide a theoretical basis for the formulation of clinical operation plans and help to effectively avoid risks in advance. © 2021 Tech Science Press. All rights reserved.

As the industrial sector is becoming ever more flexible in order to improve productivity, legacy interfaces for industrial applications must evolve to enhance efficiency and must adapt to achieve higher elasticity and reliability in harsh manufacturing environments. The localization of machines, sensors and workers inside the industrial premises is one of such interfaces used by many applications. Current localization-based systems are unable to deal with highly variable conditions, meaning that the solutions working well in stationary systems suffer from considerable difficulties in harsh environments, such as factories. As a result, the precision of localization techniques is not satisfactory in most industrial applications. This paper fills in the existing gap between static approaches and dynamic indoor positioning systems, by presenting a solution adapting the system to highly changeable conditions. The proposed solution makes use of a Machine Learning-based feedback loop that learns the variability of the environment. This feedback makes continuous fingerprint calibration feasible even in the presence of different machines and Industrial Internet of Things sensors that introduce variations to the electromagnetic environment. This paper also presents a comprehensive indoor positioning system solution that reduces complexity of hardware, meaning that a multi-standard-transceiver infrastructure may be adopted with reduced capital and operational expenditures. We have developed the system from scratch and have conducted an extensive range of testbed experiments showing that the multi-technology transceiver feature is capable of increasing positioning accuracy, as well as of introducing permanent fingerprints calibration at harsh industrial premises.

In recent years, fingerprint authentication systems have been extensively deployed in various applications, including attendance systems, authentications on smartphones, mobile payment authorizations, as well as various safety certifications. However, similar to the other biometric identification technologies, fingerprint recognition is vulnerable to artificial replicas made from cheap materials, such as silicon, gelatin, etc. Thus, it is especially necessary to distinguish whether a given fingerprint is a live or a spoof one prior to such authentication. In order to solve the problems above, a novel local descriptor named Weber local binary descriptor for fingerprint liveness detection (FLD) has been proposed in this paper. The method consists of two components: the local binary differential excitation component that extracts intensity-variance features and the local binary gradient orientation component that extracts orientation features. The co-occurrence probability of the two components is calculated to construct a discriminative feature vector, which is fed into support vector machine (SVM) classifiers. The effectiveness of the proposed method is intuitively analyzed on the image samples and numerically demonstrated by Mahalanobis distance. Experiments are performed on two public databases from FLD competitions from 2011 and 2013. The results have proved that the proposed method obtains the best detection accuracy among the existing image local descriptors in FLD.

Persistent Organic Pollutants (POPs) are toxic and difficult to degrade, which will cause huge damages to human life and the ecological environment. Therefore, based on historical measurements, it is important to use intelligent methods and data analysis technologies to build an intelligent prediction system to accurately predict the future POPs concentrations in advance. This work has extremely important significance for policy formulation, human health, environmental protection and the sustainable development of society. Since the POPs concentrations sequence contains both linear and nonlinear components, this paper proposes an intelligent data analysis system combining autoregressive integrated moving average (ARIMA) and long short-term memory network (LSTM) to analyze and predict the POPs concentrations in the Great Lakes region. ARIMA is used to capture linear components while LSTM is used to process nonlinear components, which overcomes the deficiency of single models. Moreover, a one-class SVM algorithm is used to detect outliers during data preprocessing. Bayesian information criterion and grid search methods are also used to obtain the optimal parameter combinations of ARIMA and LSTM, respectively. This paper compares our intelligent data analysis system with other single baseline models by using multiple evaluation indicators and finds that our system has the smallest MAE, RMSE and SMAPE values on all datasets. Meanwhile, our system can predict the trends of concentration changes well and the predicted values are closer to true values, which prove that it can effectively improve the precision of prediction. Finally, our system is used to predict concentration values of sites in the Great Lakes region in the next 5 years. The predicted concentrations present a large fluctuation trend in each year, but the overall trend is downward.

This article mainly studies the projective quasisynchronization for an array of nonlinear heterogeneous-coupled neural networks with mixed time-varying delays and a cluster-tree topology structure. For the sake of the mismatched parameters and the mutual influence among distinct clusters, the exponential and global quasisynchronization within a prescribed error bound instead of complete synchronization for the coupled neural networks with clustering trees is investigated. A kind of pinning impulsive controllers is designed, which will be imposed on the selected neural networks with some largest norms of error states at each impulsive instant in different clusters. By employing the concept of the average impulsive interval, the matrix measure method, and the Lyapunov stability theorem, sufficient conditions for the realization of the cluster projective quasisynchronization are derived. Meanwhile, in terms of the formula of variation of parameters and the comparison principle for the impulsive systems with mixed time-varying delays, the convergence rate and the synchronization error bound are precisely estimated. Furthermore, the synchronization error bound is efficiently optimized based on different functions of the impulsive effects. Finally, a numerical experiment is given to prove the results of theoretical analysis.

With the gradually opening of energy markets and popularization of Electric Vehicles (EVs), EVs can transmit, dispatch and recharge energy in different markets and domains dynamically. However, in Vehicular Energy Network, EVs may randomly enter and leave a market, it imposes a difficult problem in that how to schedule and distribute energy effectively. Additionally, the location of EV owners usually includes sensitive information such as home addresses, company names, hospital traces, and so on, which may be collected by attackers and may result in the privacy leakage about EV owners. In this article, we propose a decentralized blockchain-enabled energy trading scheme that can trade cross over various domains efficiently, which enables reliable transactions between EVs and energy nodes within short processing delay. It can also preserve the privacy of EV owners, by adopting the k-anonymity method in constructing a united request to hide the location information and creating a clocking area based on undirected graphs. Even though the server is maliciously attacked, the attacker cannot distinguish among EV owners, which breaks the linkage between real locations and identities to preserve EV owners’ privacy. Finally, we conduct a comprehensive experimental evaluation to evaluate the trading performance and location privacy protection performance. The simulation results show that our proposed architecture outperforms over most state-of-the-art schemes in terms of processing delay and location privacy awareness.

New coronavirus disease (COVID-19) has constituted a global pandemic and has spread to most countries and regions in the world Through understanding the development trend of confirmed cases in a region, the government can control the pandemic by using the corresponding policies However, the common traditional mathematical differential equations and population prediction models have limitations for time series population prediction, and even have large estimation errors To address this issue, we propose an improved method for predicting confirmed cases based on LSTM (Long -Short Term Memory) neural network This work compares the deviation between the experimental results of the improved LSTM prediction model and the digital prediction models (such as Logistic and Hill equations) with the real data as reference Furthermore, this work uses the goodness of fitting to evaluate the fitting effect of the improvement Experiments show that the proposed approach has a smaller prediction deviation and a better fitting effect Compared with the previous forecasting methods, the contributions of our proposed improvement methods are mainly in the following aspects: 1) we have fully considered the spatiotemporal characteristics of the data, rather than single standardized data 2) the improved parameter settings and evaluation indicators are more accurate for fitting and forecasting 3) we consider the impact of the epidemic stage and conduct reasonable data processing for different stage

In the era of Industrial Internet of Things (IIoT), huge amounts of data are generated, and companies are highly motivated to store the data on cloud servers for cost saving and efficient application. However, the IIoT data are always of great value. The direct outsourcing of such data can leak the important information of the companies and cause great business losses. A straightforward solution is to encrypt the data by using standard encryption methods before outsourcing. Nevertheless, this will make data utilization quite inconvenient. This paper focuses on the secure process of image data on cloud servers. Images are stored on cloud servers in encrypted form, and the local binary pattern feature can be directly extracted from the encrypted images for applications. The security analysis and experimental results demonstrate the security and effectiveness of our scheme.

Acyclic (binary-state) networks are commonly implemented in many diverse disciplines and applications, including information systems, processes management, project management. These networks owe their popularity to the fact that they do not use directed cycles. Network reliability is the most commonly used tool for evaluating and managing systems modeled on acyclic networks, and minimal paths (MPs) play a significant role in evaluating this reliability. This study therefore proposes a new algorithm based on a novel convolution concept for evaluating acyclic network reliability. The proposed algorithm is able to find all convolution-based MP sets within polynomial time, and then obtain the symbolic function of the acyclic network reliability in terms of those convolution-based MP sets based on the pivotal decomposition. Its total time complexity is O(2n), which is the best among all existing MP algorithms which are at least O(2|P|), where O(|P|) = O(2n), and n and |P| are the number of nodes and MPs, respectively. The correctness and time complexity of the proposed algorithm is proven and examined. An example is used to display the novel convolution-based algorithm is implemented to solve the acyclic network reliability problem.

Pervasive sensing devices make an unprecedented increase in data sensing, collection, and processing in edge network and they form the edge content server system. The edge content server system combines the content-centric network (CCN) to form a huge content propagation system which makes it challenging to achieve efficient content propagation. Different from IP-based, host-oriented Internet architecture, the CCN systems focus on the information that is contained in network and directly accessible, providing more secure and flexible Internet services. This emerging network architecture supports a number of novel applications, such as common interests sharing, mobile data offloading, and information dissemination without Internet access. In this paper, an analytical framework is proposed to address the problem of content propagation among users with the same interests in leveraging location-based social networks, where the check-in patterns of users are recorded. Particularly, we propose a content propagation effectiveness quantitative model that considers the distance between users, users’ interests, and contact rates to formulate the propagation effect and latency. We also apply our framework to two real-world datasets for the evaluation of its effectiveness. Compared with previous studies, our simulated annealing-based algorithm can greatly improve the effects by as much as 25.4%–65.6%, and the contents can be disseminated faster by about 24.6%–57.8%.

Amid the COVID-19 pandemic, prevention and control measures became normalized, prompting the development of campuses from digital to intelligent, eventually evolving to become wise. Current cutting-edge technologies include big data, Internet of Things, cloud computing, and artificial intelligence drive campus innovation, but there are still problems of unintuitive scenes, lagging monitoring information, untimely processing, and high operation and maintenance costs. Based on this, this study proposes the use of digital twin technology to digitally construct the physical campus scene, fully digitally represent it, accurately map the physical campus to the virtual campus with real-time sensing, and remotely control it to achieve the reverse control of the twin virtual campus to the physical campus. The research is guided by the theoretical model proposed by the digital twin technology, using UAV tilt photography and 3D modelling to collaboratively build the virtual campus scene. At the design stage, the interactive channel of the system is developed based on Unity3D to the realize real-time monitoring, decision making and prevention of dual spatial data. A design scheme of the spiral optimization system life cycle is formed. The modules of the smart campus system were evaluated using a system usability scale based on student experience. The experimental results show that the virtual-real campus system can enhance school management and teaching, providing important implications for promoting the development and application of campus intelligent systems.

Automated industrial quality detection (QD) boosts quality-detection efficiency and reduces costs. However, current quality-detection algorithms have drawbacks such as low efficiency, easily missed detections, and false detections. We propose QD-YOLO, an attention-based method to enhance quality-detection efficiency on computer mainboards. Firstly, we propose a composite attention module for the network’s backbone to highlight appropriate feature channels and improve the feature fusion structure, allowing the network to concentrate on the crucial information in the feature map. Secondly, we employ the Meta-ACON activation function to dynamically learn whether the activation function is linear or non-linear for various input data and adapt it to varied input scenarios with varying linearity. Additionally, we adopt Ghost convolution instead of ordinary convolution, using linear operations as possible to reduce the number of parameters and speed up detection. Experimental results show that our method can achieve improved real-time performance and accuracy on the self-created mainboard quality defect dataset, with a mean average precision (mAP) of 98.85% and a detection speed of 31.25 Frames Per Second (FPS). Compared with the original YOLOv5s model, the improved method improves mAP@0.5 by 2.09% and detection speed by 2.67 FPS.

Cyber physical systems (CPS) is a tightly coupled integration and interaction between computational and physical components. In many cases, information collection in CPS is provided through a group of distributed sensors and all of them change continuously with time. Thus the sensor information is usually in the form of time series. One particularly interesting application in time series analysis is use of complex networks to represent and study behaviors of system. Complex networks has been playing an important role for analyzing complex systems as it helps understanding the topology structure of systems with different interacting units. In this paper, we proposed a reliable method for constructing complex networks from multivariate time series (MTSs) in the cases of single and multisensor based on information geometry theory, which allows the information in the time series to be extracted by analyzing the associated complex network. We first estimate covariance matrices and then a geodesic-based distance between the covariance matrices is introduced. Consequently, the network can be constructed on a Riemannian manifold where the nodes and edges correspond to the covariance matrix and the geodesic-based distance, respectively. The proposed method provides us with a nonlinear relationship and intrinsic geometry viewpoint to understand the MTSs and also an alternative approach to fuse, model, represent, and visualize the multisensor data in CPS. A number of experimental studies and numerical examples are presented to demonstrate the generality and the effectiveness of our approach with both synthetic and real datasets.

Artificial intelligence technology plays an increasingly important role in human life. For example, distinguishing different people is an essential capability of many intelligent systems. To achieve this, one possible technical means is to perceive and recognize people by optical imaging of faces, so-called face recognition technology. After decades of research and development, especially the emergence of deep learning technology in recent years, face recognition has made great progress with more and more applications in the fields of security, finance, education, social security, etc. The field of computer vision has become one of the most successful branch areas. With the wide application of biometrics technology, bio-encryption technology came into being. Aiming at the problems of classical hash algorithm and face hashing algorithm based on Multiscale Block Local Binary Pattern (MB-LBP) feature improvement, this paper proposes a method based on Generative Adversarial Networks (GAN) to encrypt face features. This work uses Wasserstein Generative Adversarial Networks Encryption (WGAN-E) to encrypt facial features. Because the encryption process is an irreversible one-way process, it protects facial features well. Compared with the traditional face hashing algorithm, the experimental results show that the face feature encryption algorithm has better confidentiality.

The traffic congestion situation is an important reference indicator for the orderly control and management of traffic systems. As intelligent transport systems (ITS) become increasingly popular, the challenge of realizing real-time traffic congestion situation assessments (TCSAs) in the post-traffic era is particularly important. In this study, we propose a TCSA scheme for multi-metric fuzzy integrated evaluation based on three predicted vehicle traffic parameters for the 5G Internet of Vehicles (5G-IoV) environment, which is dedicated to accelerating the development of ITS. Firstly, the scheme uses dynamic multi-model adaptive exponential smoothing (DMMAES), which can calculate the optimal smoothing coefficients and weight of each model based on historical prediction errors to predict the average speed and traffic volume and then calculate the predicted traffic speed, traffic flow density, and road saturation of the three traffic congestion indicators. Secondly, the predicted values of the three traffic congestion indicators are used as fuzzy comprehensive evaluation, taking into account the vagueness of the traffic congestion levels, the uncertainty of the indicators, and the conflict among the indicators, using a trapezoidal affiliation function to determine the degree of affiliation of each indicator through the adaptive CRITIC method to determine the weights. Finally, the predicted traffic congestion situations are classified into five levels. The effectiveness of the scheme was verified by the measured data of Yanta North Road in Xi’an. The results showed that the traffic congestion level predicted by TCSA was basically consistent with the actual situation and had a high prediction accuracy.

With various emerging mobile devices, the visual content have be to resized into different sizes or aspect ratios for good viewing experiences. In this paper, we propose a new multioperator retargeting algorithm by using four retargeting operators of seam carving, cropping, warping, and scaling iteratively. To determine which retargeting operator should be used at each iteration, we adopt structural similarity (SSIM) to evaluate the similarity between the original and retargeted images. The retargeting operator sequence is constructed based on the four types of retargeting operators by an optimization process. Since the sizes of original and retargeted images are different, scale-invariant feature transform flow is used for dense correspondence between the original and retargeted images for similarity evaluation. Additionally, visual saliency is used to weight SSIM results based on the characteristics of the human visual system. Experimental results on a public image retargeting database have shown the promising performance of the proposed multioperator retargeting algorithm.