Search

Chemical mechanical planarization (CMP) is vital for ensuring chip fabrication uniformity at nanometer scales. The emergence of a series of phenomenological CMP process models (Stine et al., 1997; Gbondo-Tugbawa, 2002; Xie, 2007; Vasilev, 2011) suggests that the existing model upgrade approach is largely based on a change in phenomenological model assumptions, demanding deep insights into complex process mechanisms and protracted period for accuracy improvements. To tackle this issue, this paper proposes a decoupling regression strategy for model upgrades. This strategy employs a data-driven approach to enhance the coupling relationships within the model, facilitating continuous improvement of simulation accuracy based on the existing model. It is capable of achieving improvements in model accuracy even in scenarios where modelers lack insight into complex process mechanisms. We validate our method by upgrading the Density Step Height (DSH) model to the Extend-DSH model to address poor erosion predictions at the 28nm node. Comparing model predictions with silicon data reveals that the Extend-DSH model aligns better with the measured data, reducing the root mean square error from 159.31Å to 6.89Å and increasing the coefficient of determination from -0.83561 to 0.6058, showcasing the effectiveness of the proposed chip-level CMP model upgrade method grounded in the decoupling regression strategy. [ABSTRACT FROM AUTHOR]

Monitoring topographic variations in the engineered surface is crucial for quality engineers since the change in the surface finish is closely related to the performance of products. However, several challenging issues such as the existence of spatial autocorrelation within the surface, and changes of topographic features such as position and shape of peaks and valleys across defect-free surfaces make it difficult to monitor variations in the surface. In addition, existing monitoring approaches fail to detect local changes in the surface. In this article, we present a new approach for monitoring topographic variations in surfaces. We develop a residual-based separation deviation (RBSD) model to effectively identify local surface changes. Residuals are obtained through the fit surface prediction model, which characterizes the generic behavior of defect-free surfaces, and binarized by the RBSD model to distinguish the defective region where residuals are autocorrelated. A spatial randomness-based monitoring statistic is introduced to evaluate binary patterns in order to detect surface anomalies. Numerical simulation and a case study of the coated paper surface monitoring are provided to demonstrate the effectiveness of the proposed approach. Note to Practitioners—An increasing number of optical measuring instruments provide quality engineers with surface topographic data of the product, and enable precise and accurate inspection of surface variations during the manufacturing process. However, spatial and arbitrary geometric features on topographic data often make monitoring the surface changes a challenging task. This article proposes a new monitoring approach for detecting topographic variations in the surface. We mathematically characterize the generic behavior of the surface under the normal process, and present a surface segmentation model to detect local variations in the surface. In practice, our approach is applicable to real-life paper surface variations monitoring. The proposed approach is expected to provide a new idea to practitioners who work on surface topography inspection in various fields as well as the pulp industry. [ABSTRACT FROM AUTHOR]

This paper is devoted to electric arc furnace (EAF) modeling using a random differential equation based on the power balance equation. The proposed approach broadens and improves the model through the introduction of stochastic processes in place of existing coefficients. The paper presents a method which enables the estimation of EAF model coefficients with the help of measurement data - voltage and current waveforms recorded during the melting stage of an EAF work cycle. The estimation process is conducted with a Monte Carlo method and genetic algorithm, which is applied iteratively to each of the defined frames of the input signal. The estimated coefficients have been analyzed with respect to their time variability as well as the probability distributions of their values and increments. The results have been extensively visualized. Next, the identification of the stochastic processes representing the model coefficients has been carried out. Based on the previous results and autocorrelation functions, the density functions and parameters of discrete-time stochastic processes were identified. The paper presents solutions validated with statistical tests. [ABSTRACT FROM AUTHOR]

The semi-supervised face recognition problem has become a popular research topic in recent years. However, one common and important situation, in which the unlabeled data is shallow, has rarely been considered in most existing works. In this paper, shallow data means there are only few images per identity. In the unlabeled shallow situation, the existing semi-supervised face recognition methods generally do not work well. Thus, how to effectively utilize the unlabeled shallow face data for improving face recognition performance is an important issue. In this paper, we propose a novel semi-supervised face recognition method, namely VirFace $^{\infty} $ , to enhance the face recognition performance effectively with the unlabeled shallow data. VirFace $^{\infty} $ consists of VirClass and VirDistribution components. In VirClass, we inject the unlabeled data as virtual classes into the feature space to enlarge the inter-class distance. In VirDistribution, we predict the distribution of each virtual class, namely virtual distribution, and then enhance the inter-class discriminativeness by enlarging the distances between the labeled features and the virtual distributions. To the best of our knowledge, we are among the first to tackle the face recognition problem on unlabeled shallow face data. Extensive experiments demonstrate the superiority of our proposed method. [ABSTRACT FROM AUTHOR]

Recognition of aggressive driving behavior helps future research and practices in Intelligent Transport Systems. This paper tries to briefly explain the concepts related to aggressive driving behavior and introduces a system integrated with a novel machine learning algorithm for the recognition of trip-based aggressive driving behavior. The algorithm is a Gaussian Mixture Model (GMM) structured with Factor Analysis (FA), and Hierarchical Clustering (HC): common factors were extracted using FA, which is further applied to HC and GMM in the recognition of trip-based aggressive driving. The system is applied in a case study using data from the Shanghai Naturalistic Driving Study, for simulating data collection using the Advanced Driving Assistance System (ADAS) system in a real-traffic situation. Three behavior types (cautious, regular, and aggressive driving) were successfully clustered. For validity, the real aggressive driving behavior records were extracted based on the video, and the proposed system was compared with existing recognition methods. Results indicate that the accuracy of aggressive driving recognition of the system is higher than others (accuracy = 87%). This paper provides a reference in defining and determining aggressive driving, and a robust system for aggressive driving behavior recognition along with the trained algorithm, which can be used in real-world applications for improving driving safety with the applications in ADAS systems, auto-insurance industry. [ABSTRACT FROM AUTHOR]

Since the introduction of adaptive steganography, most of the recent research works seek at designing cost functions that are evaluated against steganalysis methods. While those approaches have been successful, they rely on intuitive principles and ad-hoc costs associated with each pixel or Discrete Cosine Transform (DCT) coefficient. Beyond the empirical assessments, the insights one can get from such approaches are very limited. On the opposite, this paper presents an original method for steganography in JPEG images that exploits a statistical model of the DCT coefficients. Within the framework of hypothesis testing theory, we use a statistical model of covers to derive the analytical expression of the most powerful detector. The objective of the steganographer is to minimize the statistical performance of this “omniscient detector” which represents a “worst-case” scenario for security. This paper shows how this method allows designing effective steganography, in terms of both security and computational complexity, in the two main use cases: when having only one single JPEG image and when the uncompressed image is available, case also known as Side-Informed (SI). A wide range of numerical comparisons shows that the proposed method outperforms the current state-of-the-art especially against the latest and most accurate steganalysis approaches based on Deep Learning. [ABSTRACT FROM AUTHOR]

This paper presents an Adaboost algorithm based cutting data analysis for chatter detection. This offline chatter analysis uses the vibration data collected by accelerometers attached to the spindle housing. A comparison of the accuracy achieved with support vector machine, Random Forest, 1D Convolutional Neural Networks and Multilayer Perceptron algorithm is also made. In this paper, the accelerometer data are transformed into bandwidth. Time-accelerometer and time-spectral bandwidth learning models are built in order to realize chatter detection and automated machine learning. A comparison of the models is made. The results of cross validation indicate that an accuracy of 98% is achieved, which is made possible by using the bandwidth signals that are transformed from accelerometer data. Experimental results show that applying the Adaboost algorithm to analyze the spectral data transformed from vibration signals and using them to detect chatters has higher reliability and accuracy compared to other algorithms and analyzing other transform signals. [ABSTRACT FROM AUTHOR]

The online retail market shows a sharp increase in traffic during holiday sales. The ability to distinguish customers who will likely purchase is critical for provisioning traffic and for providing cost-effective promotions. This paper uniquely studies the browsing and purchasing behaviors of online shoppers during a yearly sale event in China, the world’s largest online marketplace. Based on 31 million action logs gathered from wide residential areas, we characterize the steps leading to purchases and determine their precursors. We investigate the effect of time (e.g., date, time of date), environment (e.g., platform, viewed category), and action (e.g., session time, clicks, sequence) on purchases. Action cues from shopping behaviors can be used for early detection. While most shoppers start with strong intentions to purchase, yet the moment of ordering comes rather impulsively within 30 seconds to several minutes of browsing. The predictive accuracy reaches as a high AUC of 0.924. The findings in this paper provide an understanding of traffic during mega sale events that can help online shops plan and provide a better user experience for upcoming shopping festivals. [ABSTRACT FROM AUTHOR]

Graph-based clustering plays an important role in the clustering area. Recent studies about graph neural networks (GNN) have achieved impressive success on graph-type data. However, in general clustering tasks, the graph structure of data does not exist such that GNN can not be applied to clustering directly and the strategy to construct a graph is crucial for performance. Therefore, how to extend GNN into general clustering tasks is an attractive problem. In this paper, we propose a graph auto-encoder for general data clustering, AdaGAE, which constructs the graph adaptively according to the generative perspective of graphs. The adaptive process is designed to induce the model to exploit the high-level information behind data and utilize the non-euclidean structure sufficiently. Importantly, we find that the simple update of the graph will result in severe degeneration, which can be concluded as better reconstruction means worse update. We provide rigorous analysis theoretically and empirically. Then we further design a novel mechanism to avoid the collapse. Via extending the generative graph models to general type data, a graph auto-encoder with a novel decoder is devised and the weighted graphs can be also applied to GNN. AdaGAE performs well and stably in different scale and type datasets. Besides, it is insensitive to the initialization of parameters and requires no pretraining. [ABSTRACT FROM AUTHOR]

Deep learning models have been shown to be vulnerable to adversarial attacks. Adversarial attacks are imperceptible perturbations added to an image such that the deep learning model misclassifies the image with a high confidence. Existing adversarial defenses validate their performance using only the classification accuracy. However, classification accuracy by itself is not a reliable metric to determine if the resulting image is “adversarial-free”. This is a foundational problem for online image recognition applications where the ground-truth of the incoming image is not known and hence we cannot compute the accuracy of the classifier or validate if the image is “adversarial-free” or not. This paper proposes a novel privacy preserving framework for defending Black box classifiers from adversarial attacks using an ensemble of iterative adversarial image purifiers whose performance is continuously validated in a loop using Bayesian uncertainties. The proposed approach can convert a single-step black box adversarial defense into an iterative defense and proposes three novel privacy preserving Knowledge Distillation (KD) approaches that use prior meta-information from various datasets to mimic the performance of the Black box classifier. Additionally, this paper proves the existence of an optimal distribution for the purified images that can reach a theoretical lower bound, beyond which the image can no longer be purified. Experimental results on six public benchmark datasets namely: 1) Fashion-MNIST, 2) CIFAR-10, 3) GTSRB, 4) MIO-TCD, 5) Tiny-ImageNet, and 6) MS-Celeb show that the proposed approach can consistently detect adversarial examples and purify or reject them against a variety of adversarial attacks. [ABSTRACT FROM AUTHOR]

Multi-Task Learning (MTL) is a learning paradigm in machine learning and its aim is to leverage useful information contained in multiple related tasks to help improve the generalization performance of all the tasks. In this paper, we give a survey for MTL from the perspective of algorithmic modeling, applications and theoretical analyses. For algorithmic modeling, we give a definition of MTL and then classify different MTL algorithms into five categories, including feature learning approach, low-rank approach, task clustering approach, task relation learning approach and decomposition approach as well as discussing the characteristics of each approach. In order to improve the performance of learning tasks further, MTL can be combined with other learning paradigms including semi-supervised learning, active learning, unsupervised learning, reinforcement learning, multi-view learning and graphical models. When the number of tasks is large or the data dimensionality is high, we review online, parallel and distributed MTL models as well as dimensionality reduction and feature hashing to reveal their computational and storage advantages. Many real-world applications use MTL to boost their performance and we review representative works in this paper. Finally, we present theoretical analyses and discuss several future directions for MTL. [ABSTRACT FROM AUTHOR]

This paper presents an asset health index (HI) prediction methodology for high voltage transmission overhead lines (OHLs) using supervised machine learning and structured, unambiguous visual inspections. We propose a framework for asset HI predictions to determine the technical condition of individual OHL towers to improve grid reliability in a cost-effective manner. The paper focuses on asset HI prediction and the selection of the most parsimonious model. Based on the technical specifications and HI data, our methodology allows for the prediction of a HI for OHLs without HI data, and models asset aging behaviour. Technical specifications and the HI as defined in this paper are taken from the Estonian TSO periodical visual inspections implemented in 2018. The case study successfully demonstrates that the proposed methodology can predict tower HI values for a single OHL with nearly 80 percent accuracy without the need for additional measurements. [ABSTRACT FROM AUTHOR]

The Cox proportional hazards model is a popular semi-parametric model for survival analysis. In this paper, we aim at developing a federated algorithm for the Cox proportional hazards model over vertically partitioned data (i.e., data from the same patient are stored at different institutions). We propose a novel algorithm, namely VERTICOX, to obtain the global model parameters in a distributed fashion based on the Alternating Direction Method of Multipliers (ADMM) framework. The proposed model computes intermediary statistics and exchanges them to calculate the global model without collecting individual patient-level data. We demonstrate that our algorithm achieves equivalent accuracy for the estimation of model parameters and statistics to that of its centralized realization. The proposed algorithm converges linearly under the ADMM framework. Its computational complexity and communication costs are polynomially and linearly associated with the number of subjects, respectively. Experimental results show that VERTICOX can achieve accurate model parameter estimation to support federated survival analysis over vertically distributed data by saving bandwidth and avoiding exchange of information about individual patients. The source code for VERTICOX is available at: https://github.com/daiwenrui/VERTICOX. [ABSTRACT FROM AUTHOR]

Chemical mechanical polishing/planarization (CMP) combines physical grinding and chemical reactions to planarize the wafer surface. The complex mechanism of CMP brings great challenges to the mechanism-based modeling process. The data-driven CMP modeling process is limited by insufficient datasets. At the same time, these two types of models generally have high computational complexity. In this paper, we introduce the group method of data handling (GMDH)-type polynomial network to build the CMP model to address the above challenges. We designed and manufactured the test chip using a 28nm process. The measurement data from the test chip shows that compared with the mechanism-based CMP model, the trained CMP model based on GMDH-type polynomial network has higher accuracy and lower computational complexity, with the average simulation speed being 115x faster. Experiments based on silicon data show that this modeling method has a small demand for data, and 20 randomly selected sets of data can meet the needs for modeling the current CMP process. [ABSTRACT FROM AUTHOR]

Accurate estimation of short-term traffic flow, which can help to assist travelers make better route choices, is a significant research field of intelligent transportation system. In order to extract complex spatiotemporal features from a small amount of available traffic data, in this paper we propose a novel Deep Graph Gaussian Processes (DGGPs) for short-term traffic flow prediction. First, in order to accurately describe the relationship between vertices in time series, this paper proposes an attention kernel. Based on this, the Aggregation Gaussian Process uses attention kernel as the covariance function, which overcomes the problem that the existing Gaussian processes and the deep Gaussian processes cannot effectively obtain dynamic spatial features. Second, DGGPs are constructed by the Aggregation Gaussian Process (AGP), the Temporal Convolutional Gaussian Process (TCGP) and the Gaussian process with linear kernel, to solve the existing short-term traffic flow forecasting models cannot obtain complex spatiotemporal features from a small amount of available data. We verify that the attention kernel helps to the proposed model convergence on the three data sets. At the same time, the proposed DGGP can obtain spatiotemporal features from the situation with less available spatial information or temporal information, accurately predict short-term traffic flow, and quantify temporal uncertainty. [ABSTRACT FROM AUTHOR]

Modern complexities associated with an arterial traffic makes existing safety prediction methods insufficient to meet desired standards required by recent developmental needs. This paper proposes an enhanced active safety prediction method based on big-data approach and Stacked AutoEncoder-Gated Recurrent Unit. Firstly, the big-data technology is used to construct a dynamic identification model to recognize real-time operation state and risk state. Secondly, the Stacked AutoEncoder-Gated Recurrent Unit is used to predict a level of safety based on associated recognition results. This paper uses data from working days of Sunset Boulevard, California, from January $1^{\mathrm{st}}$ , 2020, to February $28^{\mathrm{th}}$ , 2020. The results of analysis show that the accuracy of the proposed dynamic recognition model reaches 98.92%, which is better than existing models such as random forest, K-nearest neighbor, and naïve Bayes models. In addition, it is found that the Stacked AutoEncoder-Gated Recurrent Unit can achieve a prediction accuracy of 95.157% and has significant advantages in terms of efficiency. The proposed methods will provide feasible solutions for actively monitoring safety levels. [ABSTRACT FROM AUTHOR]

Bridges play an important role in transportation infrastructure systems. Intelligent and digital management of bridges group is an essential part of the future intelligent transportation infrastructure system. This paper proposes a digital twin system for bridges group in the regional transportation infrastructure network, which is interconnected by measured traffic loads. In physical space, a full-bridge traffic load monitoring system based on information fusion of weigh-in-motion (WIM) and multi-source heterogeneous machine vision is set up on the target bridge to measure traffic loads, also lightweight sensors are employed on the bridges group for structural response information. Furthermore, by establishing mechanical analysis models in the corresponding digital space and using the measured traffic loads as links, the working condition perception and safety warning of all bridges in the regional transportation network is achieved, forming an important support for further intelligent transportation infrastructure system. The proposed digital twin system has been preliminarily implemented in a bridges group around Shanghai, China, demonstrating the feasibility of the technical framework proposed in this paper and the bright prospects. [ABSTRACT FROM AUTHOR]

This paper presents a dynamic event data-based stability risk assessment method for power grids with high penetrations of inverter-based resources (IBRs). This method relies on obtaining the IBRs’ DQ admittance through dynamic event data and computing the system’s eigenvalues based on the admittance models. Two critical technologies are employed in this research, including time-domain and frequency-domain data fitting and $dq$ -frame voltage and current signal derivation. The first technology is key to obtaining the $s$ -domain expressions from the transient response data, and the $s$ -domain DQ admittance model from the frequency-domain measurements. The second technology is key to obtaining the $dq$ -frame voltage and current signals from either the three-phase instantaneous measurements or the phasor measurement unit (PMU) data. The method is illustrated using data generated from a Type-4 wind power plant modeled in PSCAD. This paper demonstrates the technical feasibility of the proposed approach. [ABSTRACT FROM AUTHOR]

Drug-induced liver injury describes the adverse effects of drugs that damage the liver. Life-threatening results were also reported in severe cases. Therefore, liver toxicity is an important assessment for new drug candidates. These reports are documented in research papers that contain preliminary in vitro and in vivo experiments. Conventionally, data extraction from publications relies on resource-demanding manual labeling, which restricts the efficiency of the information extraction. The development of natural language processing techniques enables the automatic processing of biomedical texts. Herein, based on around 28,000 papers (titles and abstracts) provided by the Critical Assessment of Massive Data Analysis challenge, this study benchmarked model performances on filtering liver-damage-related literature. Among five text embedding techniques, the model using term frequency-inverse document frequency (TF-IDF) and logistic regression outperformed others with an accuracy of 0.957 on the validation set. Furthermore, an ensemble model with similar overall performances was developed with a logistic regression model on the predicted probability given by separate models with different vectorization techniques. The ensemble model achieved a high accuracy of 0.954 and an F1 score of 0.955 in the hold-out validation data in the challenge. Moreover, important words in positive/negative predictions were identified via model interpretation. The prediction reliability was quantified with conformal prediction, which provides users with a control over the prediction uncertainty. Overall, the ensemble model and TF-IDF model reached satisfactory classification results, which can be used by researchers to rapidly filter literature that describes events related to liver injury induced by medications. [ABSTRACT FROM AUTHOR]

Landing is generally cited as one of the riskiest phases of a flight, as indicated by the much higher accident rate than other flight phases. In this paper, we focus on the hard landing problem (which is defined as the touchdown vertical speed exceeding a predefined threshold), and build a probabilistic predictive model to forecast the aircraft’s vertical speed at touchdown, using DASHlink data. Previous work has treated hard landing as a classification problem, where the vertical speed is represented as a categorical variable based on a predefined threshold. In this paper, we build a machine learning model to numerically predict the touchdown vertical speed during aircraft landing. Probabilistic forecasting is used to quantify the uncertainty in model prediction, which in turn supports risk-informed decision-making. A Bayesian neural network approach is leveraged to construct the predictive model. The overall methodology consists of five steps. First, a clustering method based on the minimum separation between different airports is developed to identify flights in the dataset that landed at the same airport. Secondly, identifying the touchdown point itself is not straightforward; in this paper, it is determined by comparing the vertical speed distributions derived from different candidate touchdown indicators. Thirdly, a forward and backward filtering (filtfilt) approach is used to smooth the data without introducing phase lag. Next, a minimal-redundancy-maximal-relevance (mRMR) analysis is used to reduce the dimensionality of input variables. Finally, a Bayesian recurrent neural network is trained to predict the touchdown vertical speed and quantify the uncertainty in the prediction. The model is validated using several flights in the test dataset, and computational results demonstrate the satisfactory performance of the proposed approach. [ABSTRACT FROM AUTHOR]

To accurately pour drinks into various containers is an essential skill for service robots. However, drink pouring is a dynamic process and difficult to model. Traditional deep imitation learning techniques for implementing autonomous robotic pouring have an inherent black-box effect and require a large amount of demonstration data for model training. To address these issues, an Explainable Hierarchical Imitation Learning (EHIL) method is proposed in this paper such that a robot can learn high-level general knowledge and execute low-level actions across multiple drink pouring scenarios. Moreover, with the EHIL method, a logical graph can be constructed for task execution, through which the decision-making process for action generation can be made explainable to users and the causes of failure can be traced out. Based on the logical graph, the framework is manipulable to achieve different targets while the adaptability to unseen scenarios can be achieved in an explainable manner. A series of experiments have been conducted to verify the effectiveness of the proposed method. Results indicate that EHIL outperforms the traditional behavior cloning method in terms of success rate, adaptability, manipulability, and explainability. Note to Practitioners—Pouring liquids is a common activity in people’s daily lives and all wet-lab industries. Drink pouring dynamic control is difficult to model, while the accurate perception of flow is challenging. To enable the robot to learn under unknown dynamics via observing the human demonstration, deep imitation learning can be used. To address the limitations of traditional deep neural networks, an Explainable Hierarchical Imitation Learning (EHIL) method is proposed in this paper. The proposed method enables the robot to learn a sequence of reasonable pouring phases for performing the task rather than simply execute the task via traditional behavior cloning. In this way, explainability and safety can be ensured. Manipulability can be achieved by reconstructing the logical graph. The target of this research is to obtain pouring dynamics via the learning method and realize the precise and quick pouring of drink from the source containers to various targeted containers with reliable performance, adaptability, manipulability, and explainability. [ABSTRACT FROM AUTHOR]

Random traffic flow load (TFL) simulation is an important analysis method for bridge design and safety assessment, and accurate TFL modelling is a prerequisite for high-quality simulation. The existing TFL modelling methods almost all rely on the load data monitored by the weigh-in-motion system (WIM system). However, the WIM system has natural defects such as unsatisfactory measurement accuracy at low speed and the inability to measure vehicle lengths and transverse positions in the lane, limiting the improvement of TFL simulation accuracy. Regarding this, a TFL monitoring system that integrates the functions of machine vision and WIM system is developed in this paper. In this system, a deep learning method is applied, for the accurate detection of vehicles and wheels in the video, and the extraction of key parameters for TFL modelling based on detection results. According to the long-term monitoring value, statistical distributions of key parameters are determined, and then an intelligent TFL model is derived from the Intelligent Driver Model (IDM), considering the car-following behavior of vehicles. Correspondingly, this paper further suggests a TFL simulation method and achieves an accurate TFL simulation. A cable-stayed bridge is taken as an example to verify the feasibility of the method. The results show that, compared to the modelling and simulation methods that only rely on the WIM system, the proposed method not only reduces the measurement error of vehicle dimensions by nearly 4 times, but also performs higher resolution in time measurement. The proposed method effectively overcomes the shortcomings of existing schemes and has good application potential in engineering. [ABSTRACT FROM AUTHOR]

This report analyzes the reproducibility of the article “Computing Planetary Interior Normal Modes with A Highly Parallel Polynomial Filtering Eigensolver” by Jia Shi et al. (Shi, 2018). To reproduce the results we perform different weak and strong scaling studies using a series of Mars models. All experimental runs were performed during the SC19 Student Cluster Competition on a four node Intel Skylake cluster. We show that the findings of the original article can be reproduced in a different environment. [ABSTRACT FROM AUTHOR]

The integration of global navigation satellite system (GNSS) and inertial navigation system (INS) has been widely studied in the past decades. The traditional Kalman filtering method, a procedure that leads to historical states and observations loss, can estimate fast by limiting the update to the latest state. Furthermore, the performance of loosely coupled GNSS/INS navigation integration depends largely on environmental conditions and sensor costs. In cities, GNSS signals may be interrupted due to the influence of obstructions and moving objects, which leads to the discontinuity of GNSS/INS navigation. Therefore, in order to overcome these difficulties an auto regressive integrated moving average (ARIMA) auxiliary model based on time sequence is proposed in this paper, which makes use of the data before interruption to predict the GNSS measurements during the interruption period and makes up for the data gap. In addition, the INS and GNSS measurements are loosely coupled using the most advanced factor graph model. Compared to the filtering algorithm, all previous measurements are used for state estimation through the factor graph framework. In this paper, the experiment is based on the dataset of Tokyo which is a typical challenging city canyon. Experiments showed that, compared with the traditional GNSS/INS integration method, the proposed method can provide a higher precision and a series of continuous navigation results even when the GNSS measurement data was interrupted. [ABSTRACT FROM AUTHOR]

With low voltage (LV) distribution networks increasingly being re-purposed beyond their original design specifications to accommodate low carbon technologies, the ability to accurately calculate their actual spare capacity is critical. Traditionally, within the Great Britain (GB) power system, there has been limited monitoring of LV distribution networks, making this difficult. This paper proposes a method for estimating spare capacity of unmonitored LV networks using demand data from customer Smart Meters. In particular, the proposed method infers existing LV network capacity, as well as losses, across scenarios where only a limited number of customers have Smart Meters installed. Typical daily load profiles across customers with Smart Meters are learned using a Dirichlet sampled Gaussian mixture model (GMM). Learned profiles are then applied to all unmetered customers to estimate network parameters. Method accuracy is assessed by comparing estimations with simulated, fully observed, LV network models. The method is also compared to benchmark models for establishing unobserved demand profiles. Overall, results in the paper show that the proposed method outperforms benchmark models in terms of accurately assessing substation headroom, particularly in scenarios where only 10–50% of customers have Smart Meters installed. [ABSTRACT FROM AUTHOR]

Data quality plays an important role during the training stage of machine/deep learning models. The annotation hinges on the experiences of domain experts. To acquire the expert’s knowledge in the context of machine learning, manual data labeling, a tedious and time-consuming task in supervised learning, should be given a top priority. However, the domain experts in the line of plentiful manual annotation may easily get distracted or fatigued after long-time work, causing judgment errors, mislabeling, etc. The pattern recognition of wafer defect map is investigated in this paper, the primary goal of which is to train the convolutional neural network (CNN) model through a very limited number of manually labeled data so that the trained model is capable of performing pseudo labeling. Subsequently, a self-assured adaptive ensemble learner in terms of a series of shallow neural networks is proposed to filter wafer map samples with untrusted pseudo-labels. In the result, the amount of human annotations is significantly reduced by 61% for training a highly accurate classifier. A minimum number of manually labeled data is suggested while the equally high classification performance of wafer defect pattern is maintained. For the evaluation purpose, the proposed self-assured learning is compared with the confidence learning. [ABSTRACT FROM AUTHOR]

Federated learning (FL) models are vulnerable to membership inference attacks (MIAs), and the requirement of individual privacy motivates the protection of subjects where the individual data is distributed across multiple users in the cross-silo FL setting. In this paper, we propose a subject-level membership inference attack based on data augmentation and model discrepancy. It can effectively infer whether the data distribution of the target subject has been sampled and used for training by specific federated users, even if other users (also) may sample from the same subject and use it as part of their training set. Specifically, the adversary uses a generative adversarial network (GAN) to perform data augmentation on a small amount of priori federation-associated information known in advance. Subsequently, the adversary merges two different outputs from the global and tested user models using an optimal feature construction method. We simulate a controlled federation configuration and conduct extensive experiments on real datasets that include both image and categorical data. Results show that the area under the curve (AUC) is improved by 12.6% to 16.8% compared to the classical membership inference attack. This is at the expense of the test accuracy of the data augmented with GAN, which is at most 3.5% lower than the real test data. We also explore the degree of privacy leakage between overfitted models and well-generalized models in the cross-silo FL setting and conclude experimentally that the former is more likely to leak individual privacy with a subject-level degradation rate of up to 0.43. Finally, we present two possible defense mechanisms to attenuate this newly discovered privacy risk. [ABSTRACT FROM AUTHOR]

In-home health monitoring has attracted great attention for the ageing population worldwide. With the abundant user health data accessed by Internet of Things (IoT) devices and recent development in machine learning, smart healthcare has seen many successful stories. However, existing approaches for in-home health monitoring do not pay sufficient attention to user data privacy and thus are far from being ready for large-scale practical deployment. In this paper, we propose FedHome, a novel cloud-edge based federated learning framework for in-home health monitoring, which learns a shared global model in the cloud from multiple homes at the network edges and achieves data privacy protection by keeping user data locally. To cope with the imbalanced and non-IID distribution inherent in user’s monitoring data, we design a generative convolutional autoencoder (GCAE), which aims to achieve accurate and personalized health monitoring by refining the model with a generated class-balanced dataset from user’s personal data. Besides, GCAE is lightweight to transfer between the cloud and edges, which is useful to reduce the communication cost of federated learning in FedHome. Extensive experiments based on realistic human activity recognition data traces corroborate that FedHome significantly outperforms existing widely-adopted methods. [ABSTRACT FROM AUTHOR]

This paper studies instance-dependent Positive and Unlabeled (PU) classification, where whether a positive example will be labeled (indicated by $s$ s ) is not only related to the class label $y$ y , but also depends on the observation $\mathbf {x}$ x . Therefore, the labeling probability on positive examples is not uniform as previous works assumed, but is biased to some simple or critical data points. To depict the above dependency relationship, a graphical model is built in this paper which further leads to a maximization problem on the induced likelihood function regarding $P(s,y|\mathbf {x})$ P (s , y | x) . By utilizing the well-known EM and Adam optimization techniques, the labeling probability of any positive example $P(s=1|y=1,\mathbf {x})$ P (s = 1 | y = 1 , x) as well as the classifier induced by $P(y|\mathbf {x})$ P (y | x) can be acquired. Theoretically, we prove that the critical solution always exists, and is locally unique for linear model if some sufficient conditions are met. Moreover, we upper bound the generalization error for both linear logistic and non-linear network instantiations of our algorithm, with the convergence rate of expected risk to empirical risk as $\mathcal {O}(1/\sqrt{k}+1/\sqrt{n-k}+1/\sqrt{n})$ O (1 / k + 1 / n - k + 1 / n) ($k$ k and $n$ n are the sizes of positive set and the entire training set, respectively). Empirically, we compare our method with state-of-the-art instance-independent and instance-dependent PU algorithms on a wide range of synthetic, benchmark and real-world datasets, and the experimental results firmly demonstrate the advantage of the proposed method over the existing PU approaches. [ABSTRACT FROM AUTHOR]

This paper presents a command governor (CG) based adaptive cruise controller (ACC) that is applied in simulation to normal driving scenarios and emergency stopping scenarios. The vehicle-following case study used in this paper involves a heavy-duty ego vehicle and a light-duty non-connected lead vehicle (i.e., the ego vehicle does not communicate with the lead vehicle and can only infer the lead vehicles’ position and velocity states through its own sensors). Typically, to ensure constraints in the presence of disturbances, receding horizon based ACCs will assume some known worst-case behavior of the lead vehicle. In the presence of a stochastic, non-connected lead vehicle, however, achieving such a guarantee requires a worst-case assumption on the behavior of the lead vehicle for all future time. In this work, the CG assumes a lead vehicle velocity profile that will be achieved with a prescribed level of certainty, based on a stochastic characterization of lead vehicle behavior that has been informed by actual on-road data. The CG ensures safe following distance under this probabilistic lead vehicle assumption. Here, “safe following distance” is based on the ego vehicle’s ability to come to a stop without collision if the lead vehicle were to suddenly brake at maximum deceleration after proceeding at a velocity profile that is prescribed based on a statistical lower bound on lead vehicle velocity. Ultimately, the CG ensures that the worst-case safe following distance is satisfied with a prescribed probability, thereby paralleling chance-constrained CG formulations. Simulation results for a heavy-duty truck indicate that the CG-based ACC outperforms a PID-ACC in terms of fuel economy and drivability. Additionally, the CG-ACC approach was able to ensure rear-end collision avoidance in emergency stopping simulations. [ABSTRACT FROM AUTHOR]

Traffic state estimation (TSE) bifurcates into two main categories, model-driven and data-driven (e.g., machine learning, ML) approaches, while each suffers from either deficient physics or small data. To mitigate these limitations, recent studies introduced hybrid methods, such as physics-informed deep learning (PIDL), which contains both model-driven and data-driven components. This paper contributes an improved paradigm, called physics-informed deep learning with a fundamental diagram learner (PIDL + FDL), which integrates ML terms into the model-driven component to learn a functional form of a fundamental diagram (FD), i.e., a mapping from traffic density to flow or velocity. The proposed PIDL + FDL has the advantages of performing the TSE learning, model parameter identification, and FD estimation simultaneously. This paper focuses on highway TSE with observed data from loop detectors, using traffic density or velocity as traffic variables. We demonstrate the use of PIDL + FDL to solve popular first-order and second-order traffic flow models and reconstruct the FD relation as well as model parameters that are outside the FD term. We then evaluate the PIDL + FDL-based TSE using the Next Generation SIMulation (NGSIM) dataset. The experimental results show the superiority of the PIDL + FDL in terms of improved estimation accuracy and data efficiency over advanced baseline TSE methods, and additionally, the capacity to properly learn the unknown underlying FD relation. [ABSTRACT FROM AUTHOR]

The paper presents research on mode identification of broad-band oscillation in interconnected power system. A data-driven mode identification (DDMI) method for broad-band oscillation signals is proposed creatively in this paper. Firstly, piecewise aggregation approximation algorithm is improved to achieve effective dimension reduction of oscillation data. Combined with ${k}$ -Shape clustering algorithm, oscillation database is established with historical data, real-time data and simulation data. Then, oscillation mode identification models corresponding to different data categories can be obtained based on random forest algorithm, which can realize fast and automatic matching between broad-band oscillation data and oscillation mode parameters. Finally, the identification results of two simulation oscillation cases and an actual oscillation case show that proposed method can accurately identify the oscillation mode parameters from broad-band oscillation signals and has higher accuracy compared with other methods. [ABSTRACT FROM AUTHOR]

Vehicle-to-vehicle (V2V) wireless communication systems are fundamental in many intelligent transportation applications, e.g., traffic load control, driverless vehicle, and collision avoidance. Hence, developing appropriate V2V communication systems and standardization require realistic V2V propagation channel models. However, most existing V2V channel modeling studies focus on car-to-car channels; only a few investigate truck-to-car (T2C) or truck-to-truck (T2T) channels. In this paper, a hybrid geometry-based stochastic model (GBSM) is proposed for T2X (T2C or T2T) channels in freeway environments. Next, we parameterize this GBSM from the extensive channel measurements. We extract the multipath components (MPCs) by using a joint maximum likelihood estimation (RiMAX) and then determine the cluster types based on their evolution patterns. We classify the determined clusters into line-of-sight, single-bounce reflections from static interaction objects (IOs), single-bounce reflections from mobile IOs, multiple-bounce reflections, and density multipath components (DMCs). Particularly, we model multiple-bounce reflections as double clusters following the COST 273/COST2100 method. This paper presents the complete parameterization of the channel model. We validate this model by comparing the delay spread and the angular spreads of arrival/departure obtained from the proposed model with the measurement data. [ABSTRACT FROM AUTHOR]

For deep learning model training, most existing supervised learning-based person re-identification (Re-ID) models require considerable data with annotations as samples. However, it is labor-intensive to generate labeled data in many real-world situations. Meanwhile, the large scale of the existing models increases the load of model learning. To this end, this paper proposes a person Re-ID method by deep batch active learning and knowledge distillation. With the goal of minimizing the human labeling cost and maximizing the performance of the person Re-ID model, a batch active learning algorithm is applied to person Re-ID, which selects samples with both uncertainty and diversity, and the model needs only a small amount of labeled data to achieve a high performance. In addition, a knowledge distillation approach is used to compress the original backbone model to reduce the model scale while maintaining the model performance. Furthermore, experiments on two public datasets demonstrate the effectiveness and superiority of the proposed method. [ABSTRACT FROM AUTHOR]

The vanilla Few-shot Learning (FSL) learns to build a classifier for a new concept from one or very few target examples, with the general assumption that source and target classes are sampled from the same domain. Recently, the task of Cross-Domain Few-Shot Learning (CD-FSL) aims at tackling the FSL where there is a huge domain shift between the source and target datasets. Extensive efforts on CD-FSL have been made via either directly extending the meta-learning paradigm of vanilla FSL methods, or employing massive unlabeled target data to help learn models. In this paper, we notice that in the CD-FSL task, the few labeled target images have never been explicitly leveraged to inform the model in the training stage. However, such a labeled target example set is very important to bridge the huge domain gap. Critically, this paper advocates a more practical training scenario for CD-FSL. And our key insight is to utilize a few labeled target data to guide the learning of the CD-FSL model. Technically, we propose a novel Generalized Meta-learning based Feature-Disentangled Mixup network, namely GMeta-FDMixup. We make three key contributions of utilizing GMeta-FDMixup to address CD-FSL. Firstly, we present two mixup modules – mixup-P and mixup-M that help facilitate utilizing the unbalanced and disjoint source and target datasets. These two novel modules enable diverse image generation for training the model on the source domain. Secondly, to narrow the domain gap explicitly, we contribute a novel feature disentanglement module that learns to decouple the domain-irrelevant and domain-specific features. By stripping the domain-specific features, we alleviate the negative effects caused by the domain inductive bias. Finally, we repurpose a new contrastive learning module, dubbed ConL. ConL prevents the model from only capturing category-related features via introducing contrastive loss. Thus, the generalization ability on novel categories is improved. Extensive experimental results on two benchmarks show the superiority of our setting and the effectiveness of our method. Code and models will be released. [ABSTRACT FROM AUTHOR]

This paper investigates the cyber-security problem for autonomous vehicles under sensor attacks. In particular, a model-based framework is proposed which can detect sensor attacks and identify their sources in order to achieve the secure localization of self-driving vehicles. To ensure robustness of the vehicle against cyber-attacks, sensor redundancy is introduced, that is to deploy multiple sensors, each of which provides real-time pose observations of the vehicle. A bank of attack detectors is developed to capture anomalies in each sensor measurement, which is a combination of an extended Kalman filter (EKF) and a cumulative sum (CUSUM) discriminator. EKFs are employed to estimate the vehicle position and orientation recursively, while each CUSUM discriminator is designed to analyze the residual generated by its combined EKF to detect the possible deviation of the sensor measurement from the expected pose derived according to the mathematical model of the vehicle. To monitor the inconsistency amongst multiple sensor measurements, an auxiliary detector is introduced which fuses observations from multiple sensors. Based on the results of all the detectors, a rule-based isolation scheme is developed to identify the source anomalous sensor. The effectiveness of our proposed framework has been demonstrated on real vehicle data. [ABSTRACT FROM AUTHOR]

A smart grid integrates advanced sensors, efficient measurement methods, progressive control technologies, and other techniques and devices to achieve safe, efficient and economical operation of the grid system. However, the diversified and open environment of a smart grid makes energy and information of the smart grid vulnerable to malicious attacks. As a representative cyber-physical attack, the data integrity attack has an extremely severe impact on the grid operation for it can bypass the traditional detection mechanisms by adjusting the attack vector. In this paper, we first present the attack strategy against dynamic state estimation of power grid in the perspective of adversary and formulate the data integrity attack detection problem that has the characteristic of sequential decision making as a partially observable Markov decision process. Then, a deep reinforcement learning-based approach is proposed to detect against data integrity attacks, which utilizes the Long Short-Term Memory layer to extract the state features of previous time steps in determining whether the system is currently under attack. Moreover, the noisy networks are employed to ensure effective agent exploration, which prevents the agent from sticking to the non-optimal policy. The principle of a multi-step learning is adopted to increase the estimation accuracy of Q value. To address the sparse rewards problem, the prioritized experience replay is proposed to increase training efficiency. Simulation results demonstrated that the proposed detection approach surpasses the benchmarks in the comparison metrics: delay error rate and false rate. Note to Practitioners—In this paper, we present a deep reinforcement learning-based algorithm to defend against the data integrity attacks of smart grid. Most of the previous works discretized the system states and utilized the current state information to identify whether the system is under attack. For this reason, the detection policy may totally ignored the continuously changing characteristics of the grid states, which will lead to poor detection performance. Moreover, the attacked system states only accounts for a small part of the entire grid operation states, the probability of sampling the experience containing the attack state is extremely small, which limits the learning efficiency of previous RL-based detection approaches. In order to increase the accuracy of detection, we first present the attack strategy against power grid’s dynamic state estimation in the perspective of adversary and formulate the partially observable Markov decision process model of attack detection problem. Moreover, we propose a deep reinforcement learning-based detection approach combining the LSTM network to extract the system state features of the previous time steps to determine whether the system is currently being attacked. To address the sparse rewards problem, the prioritized experience replay is used to increase learning efficiency. The experiments demonstrate the effectiveness of proposed detection scheme compared with benchmarks in terms of detection delay as well as accuracy. In conclusion, the proposed detection scheme is helpful in defending against the data integrity attacks without obtaining the opponent’s strategy in advance and can be conveniently applied to the real-world security management system of smart grid. [ABSTRACT FROM AUTHOR]

Electricity price prediction plays a vital role in energy storage system (ESS) management. Current prediction models focus on reducing prediction errors but overlook their impact on downstream decision-making. So this paper proposes a decision-focused electricity price prediction approach for ESS arbitrage to bridge the gap from the downstream optimization model to the prediction model. The decision-focused approach aims at utilizing the downstream arbitrage model for training prediction models. It measures the difference between actual decisions under the predicted price and oracle decisions under the true price, i.e., decision error, by regret, transforms it into the tractable surrogate regret, and then derives the gradients to predicted price for training prediction models. Based on the prediction and decision errors, this paper proposes the hybrid loss and corresponding stochastic gradient descent learning method to learn prediction models for prediction and decision accuracy. The case study verifies that the proposed approach can efficiently bring more economic benefits and reduce decision errors by flattening the time distribution of prediction errors, compared to prediction models for only minimizing prediction errors. [ABSTRACT FROM AUTHOR]

Unsupervised spectral feature selection (USFS) methods could output interpretable and discriminative results by embedding a Laplacian regularizer in the framework of sparse feature selection to keep the local similarity of the training samples. To do this, USFS methods usually construct the Laplacian matrix using either a general-graph or a hyper-graph on the original data. Usually, a general-graph could measure the relationship between two samples while a hyper-graph could measure the relationship among no less than two samples. Obviously, the general-graph is a special case of the hyper-graph and the hyper-graph may capture more complex structure of samples than the general graph. However, in previous USFS methods, the construction of the Laplacian matrix is separated from the process of feature selection. Moreover, the original data usually contain noise. Each of them makes difficult to output reliable feature selection models. In this paper, we propose a novel feature selection method by dynamically constructing a hyper-graph based Laplacian matrix in the framework of sparse feature selection. Experimental results on real datasets showed that our proposed method outperformed the state-of-the-art methods in terms of both clustering and segmentation tasks. [ABSTRACT FROM AUTHOR]

This paper proposes a linear regression model for scalar-valued responses and two-way functional (bivariate) predictors. Our motivation stems from the quality evaluation of products based on optical emission spectroscopy data from virtual metrology of semiconductor manufacturing. We focus on multivariate cases where the smoothness and shapes of the data vary significantly across variables. We propose a two-step solution to this problem, consisting of decomposition and prediction. First, we decompose the two-way functional data into pairs of component functions using functional singular value decomposition. Next, we build functional linear models for the decomposed functional variables and obtain the final predictor by averaging the models. Results from numerical studies, including simulation studies and real data analysis, demonstrate the promising empirical properties of the proposed approach, especially when the number of predictors is large. [ABSTRACT FROM AUTHOR]

Video games are one of the richest and most popular forms of human-computer interaction and, hence, their role is critical for our understanding of human behaviour and affect at a large scale. As artificial intelligence (AI) tools are gradually adopted by the game industry a series of ethical concerns arise. Such concerns, however, have so far not been extensively discussed in a video game context. Motivated by the lack of a comprehensive review on the ethics of AI as applied to games, we survey the current state of the art in this area and discuss ethical considerations of these systems from the holistic perspective of the affective loop. Through the components of this loop, we study the ethical challenges that AI faces in video game development. Elicitation highlights the ethical boundaries of artificially induced emotions; sensing showcases the trade-off between privacy and safe gaming spaces; and detection, as utilised during in-game adaptation, poses challenges to transparency and ownership. This paper calls for an open dialogue and action for the games of today and the virtual spaces of the future. By setting an appropriate framework we aim to protect users and to guide developers towards safer and better experiences for their customers. [ABSTRACT FROM AUTHOR]

With the proliferation of user-generated online videos, Multimodal Sentiment Analysis (MSA) has attracted increasing attention recently. Despite significant progress, there are still two major challenges on the way towards robust MSA: 1) inefficiency when modeling cross-modal interactions in unaligned multimodal data; and 2) vulnerability to random modality feature missing which typically occurs in realistic settings. In this paper, we propose a generic and unified framework to address them, named Efficient Multimodal Transformer with Dual-Level Feature Restoration (EMT-DLFR). Concretely, EMT employs utterance-level representations from each modality as the global multimodal context to interact with local unimodal features and mutually promote each other. It not only avoids the quadratic scaling cost of previous local-local cross-modal interaction methods but also leads to better performance. To improve model robustness in the incomplete modality setting, on the one hand, DLFR performs low-level feature reconstruction to implicitly encourage the model to learn semantic information from incomplete data. On the other hand, it innovatively regards complete and incomplete data as two different views of one sample and utilizes siamese representation learning to explicitly attract their high-level representations. Comprehensive experiments on three popular datasets demonstrate that our method achieves superior performance in both complete and incomplete modality settings. [ABSTRACT FROM AUTHOR]

In recent years, many agent-based models of human groups have implemented a mechanism of emotion contagion, yet empirical validation is lagging behind. The aim of the present paper is to validate an agent-based model of emotion contagion at the level of group emotion, by comparing simulations against the emotional development of real people in small groups. To study the effect of emotion contagion, the participants interacted via a video call, where they were virtually placed in different social environments while they played a quiz. This allowed the exchange of emotion among all, some or none of the participants. The patterns of emotional development in the empirical results supported our hypotheses based on literature of emotion contagion and social norms. Further, the simulations with the complete model resembled many of these patterns. When emotion contagion was disabled in the model, the resemblance decreased. These results give a first indication that emotion contagion occurs in groups that meet via video calls, and can in-part be predicted by the proposed model of emotion contagion. Yet, further study with a larger and more diverse empirical sample is needed, as well as comparisons across contagion mechanisms, to draw stronger conclusions and ultimately justify societal application. [ABSTRACT FROM AUTHOR]

There is an opportunity in modern power systems to explore the demand flexibility by incentivizing consumers with dynamic prices. In this paper, we quantify demand flexibility using an efficient tool called time-varying elasticity, whose value may change depending on the prices and decision dynamics. This tool is particularly useful for evaluating the demand response potential and system reliability. Recent empirical evidences have highlighted some abnormal features when studying demand flexibility, such as delayed responses and vanishing elasticities after price spikes. Existing methods fail to capture these complicated features because they heavily rely on some predefined (often over-simplified) regression expressions. Instead, this paper proposes a model-free methodology to automatically and accurately derive the optimal estimation pattern. We further develop a two-stage estimation process with Siamese long short-term memory (LSTM) networks. Here, a LSTM network encodes the price response, while the other network estimates the time-varying elasticities. In the case study, the proposed framework and models are validated to achieve higher overall estimation accuracy and better description for various abnormal features when compared with the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

As important equipment, rotating machinery has been widely used in many industrial fields. Because rotating machinery is prone to failure, its fault diagnosis will be of great significance. In the industrial scene, rotating machinery is usually in normal operation, so it is difficult to accumulate fault samples. Therefore, it will face the problem of fault diagnosis with small samples, which seriously affects the accuracy and stability of fault diagnosis. To solve the above problems, the author proposes a fault diagnosis method based on ACWGAN-GP and homogeneous stacking ensemble learning. Firstly, the method utilizes the argmax multi-class classification idea to construct multiple different training subsets. Secondly, these constructed training subsets are used to train multiple base learners based on ACWGAN-GP, Finally, the meta learner based on Softmax Regression is used to fuse these trained basic learners. So far, the complete fault diagnosis is realized. In this paper, the proposed method is applied to the gearbox data set and the bearing data set. Through a series of experiments, it is proved that this method can not only effectively solve the problem of fault diagnosis with small samples, but also effectively improve the classification accuracy and stability. [ABSTRACT FROM AUTHOR]

Semiconductor manufacturing plays a crucial role in the world’s economic growth and technology development and is the backbone of the high value-added electronic device manufacturing industry. In this paper, a new anomaly detection framework by means of data visualization is proposed for semiconductor manufacturing. Firstly, t-Distributed Stochastic Neighbor Embedding (t-SNE) in unsupervised learning is used to transform the high-dimensional raw trace data, corresponding to normal wafers, into a two-dimensional map, with the purpose of visually observing the distribution of normal wafers. The t-SNE algorithm cannot be used at run time for a new test sample since it requires the whole dataset for the embedding transformation, and is computationally very expensive. The Multilayer Perceptron (MLP) neural network is then applied as a regressor for the real-time t-SNE embedding of a new test data. The envelope of t-SNE score estimates for a set of normal wafers is circumscribed and used as the 2D control boundary based on the Delaunay Triangulation (D.T.). A new test sample with its MLP estimated embedding points outside the D.T boundary is identified as defective. Lastly, a real-world dataset in semiconductor manufacturing is used to illustrate the proposed data visualization tool for anomaly detection. The experimental results show that a multilayer perceptron in combination with t-SNE and Delaunay Triangulation performs very well for data visualization and automated detection of anomalies. [ABSTRACT FROM AUTHOR]

The past decade has seen growing importance being attached to the Completely Independent Spanning Trees (CISTs). The CISTs can facilitate many network functionalities, and the existence and construction schemes of CISTs in various networks can be an indicator of the network's robustness. In this paper, we establish the number of CISTs that can be constructed in the line graph of the complete graph $K_n$ K n (denoted $L(K_n)$ L (K n) , for $n\geq 4$ n ≥ 4 ), and present an algorithm to construct the optimal (i.e., maximal) number of CISTs in $L(K_n)$ L (K n) . The $L(K_n)$ L (K n) is a special class of SWCube [13], an architectural model proposed for data center networks. Our construction algorithm is also implemented to verify its validity. [ABSTRACT FROM AUTHOR]

With the aim of synchronizing high-speed railway (HSR) and aviation services to adapt intermodality traffic needs, this paper is concerned with HSR-Air timetable coordination (HATC) problem. This problem is solved by rescheduling the HSR timetable with the goal of attracting the maximum HSR-Air passenger flow, and at the same time, considering the minimum adjustments to the initial HSR timetable. The HATC problem is an integration of train timetable rescheduling and HSR-air passenger flow predicting problem. There is a trade-off increasing the HSR-Air passenger flow and the adjustments to the initial train timetable. In order to capture the complex feature interactions of passenger flow impact features, a novel HSR-Air passenger flow prediction model is proposed by using factorization machine and deep neural networks in this paper. Moreover, this passenger flow prediction model then is integrated into the train timetable rescheduling model to calculate the passenger flow under different HSR-Air service network. An approach based on a genetic algorithm is developed to solve the integrated model of deep learning and integer programming. The model and approach are tested in a real-world HSR-Air case in China with 15 HSR stations, 200 trains and 82 flights. The results show that the proposed model can obtain the satisfactory predictions and effectively enhance the HSR-Air passenger flow within an acceptable level of deviations to initial train timetable. [ABSTRACT FROM AUTHOR]

Sea state estimation is beneficial for marine systems to enhance on-board decision-making and improve work efficiency. In the era of ship intelligence, artificial intelligence has greatly promoted the technology of sensing environment, such as by using the deep learning. However, it is difficult to collect enough motion data from a marine system to train a deep learning model. In addition, the model for sea state estimation is trained using the data from a specific marine system; applying the model directly to another marine system may result in performance degradation. In this paper, a supervised transfer learning based framework for sea state estimation (STLSSE) is proposed. The STLSSE focuses on knowledge transfer when the collected data for the source marine system is sufficient but the collected data of the target marine system is scarce. In STLSSE, a data pairing algorithm is proposed to determine the relationship of the source and the target marine system. Based on these paired data, a Siamese convolutional neural network, including a new proposed residual fully convolutional network and two novel attention modules, is designed for the semantic alignment. Moreover, the conventional contrastive loss is improved to characterize the distributions when there are only few samples in the target marine system. The extensive comparisons between STLSSE and state-of-the-art transfer learning approaches show its superior performance. The comparisons with state-of-the-art attention modules has verified the competitiveness of the proposed attention modules. The key parameters and each component of STLSSE are emphasized in the ablation and sensitivity studies. [ABSTRACT FROM AUTHOR]