Miracle-dz/UniFAR-FTUs huggingface dataset:
Fault Early Warning Model for High-Speed Railway Train Based on Feature Contribution and Causal Inference

The demands for model accuracy and computing efficiency in fault warning scenarios are increasing as high-speed railway train technology continues to advance. The black box model is difficult to interpret, making it impossible for this technology to be widely adopted in the railway industry, which has strict safety regulations. This paper proposes a fault early warning machine learning model based on feature contribution and causal inference. First, the contributions of the features are calculated through the Shapley additive explanations model. Then, causal relationships are discovered through causal inference models. Finally, data from causal and high-contribution time series are applied to the model. Ablation tests are conducted with the Naïve Bayes, Gradient Boosting Decision Tree, eXtreme Gradient Boosting, and other models in order to confirm the efficiency of the method based on early warning data regarding the on-site high-speed train traction equipment circuit board failure. The findings indicate that the strategy improves the evaluation markers, including the early warning accuracy, precision, recall, and F1 score, by an average of more than 10%. There is a 35% improvement in the computing efficiency, and the model can provide feature causal graph verification for expert product decision-making.
Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth Nonconvex Minimax Problems with Coupled Linear Constraints

Nonconvex minimax problems have attracted wide attention in machine learning, signal processing and many other fields in recent years. In this paper, we propose a primal-dual alternating proximal gradient (PDAPG) algorithm and a primal-dual proximal gradient (PDPG-L) algorithm for solving nonsmooth nonconvex-(strongly) concave and nonconvex-linear minimax problems with coupled linear constraints, respectively. The iteration complexity of the two algorithms are proved to be $\mathcal{O}\left( \varepsilon ^{-2} \right)$ (resp. $\mathcal{O}\left( \varepsilon ^{-4} \right)$) under nonconvex-strongly concave (resp. nonconvex-concave) setting and $\mathcal{O}\left( \varepsilon ^{-3} \right)$ under nonconvex-linear setting to reach an $\varepsilon$-stationary point, respectively. To our knowledge, they are the first two algorithms with iteration complexity guarantees for solving the nonconvex minimax problems with coupled linear constraints.
Information-Theoretic Safe Exploration with Gaussian Processes

We consider a sequential decision making task where we are not allowed to evaluate parameters that violate an a priori unknown (safety) constraint. A common approach is to place a Gaussian process prior on the unknown constraint and allow evaluations only in regions that are safe with high probability. Most current methods rely on a discretization of the domain and cannot be directly extended to the continuous case. Moreover, the way in which they exploit regularity assumptions about the constraint introduces an additional critical hyperparameter. In this paper, we propose an information-theoretic safe exploration criterion that directly exploits the GP posterior to identify the most informative safe parameters to evaluate. Our approach is naturally applicable to continuous domains and does not require additional hyperparameters. We theoretically analyze the method and show that we do not violate the safety constraint with high probability and that we explore by learning about the constraint up to arbitrary precision. Empirical evaluations demonstrate improved data-efficiency and scalability.
CopAS: A Big Data Forensic Analytics System

With the advancing digitization of our society, network security has become one of the critical concerns for most organizations. In this paper, we present CopAS, a system targeted at Big Data forensics analysis, allowing network operators to comfortably analyze and correlate large amounts of network data to get insights about potentially malicious and suspicious events. We demonstrate the practical usage of CopAS for insider attack detection on a publicly available PCAP dataset and show how the system can be used to detect insiders hiding their malicious activity in the large amounts of data streams generated during the operations of an organization within the network.
Framewise Wavegan: High Speed Adversarial Vocoder In Time Domain With Very Low Computational Complexity

GAN vocoders are currently one of the state-of-the-art methods for building high-quality neural waveform generative models. However, most of their architectures require dozens of billion floating-point operations per second (GFLOPS) to generate speech waveforms in samplewise manner. This makes GAN vocoders still challenging to run on normal CPUs without accelerators or parallel computers. In this work, we propose a new architecture for GAN vocoders that mainly depends on recurrent and fully-connected networks to directly generate the time domain signal in framewise manner. This results in considerable reduction of the computational cost and enables very fast generation on both GPUs and low-complexity CPUs. Experimental results show that our Framewise WaveGAN vocoder achieves significantly higher quality than auto-regressive maximum-likelihood vocoders such as LPCNet at a very low complexity of 1.2GFLOPS. This makes GAN vocoders more practical on edge and low-power devices.
Emergent computations in trained artificial neural networks and real brains

Synaptic plasticity allows cortical circuits to learn new tasks and to adapt to changing environments. How do cortical circuits use plasticity to acquire functions such as decision-making or working memory? Neurons are connected in complex ways, forming recurrent neural networks, and learning modifies the strength of their connections. Moreover, neurons communicate emitting brief discrete electric signals. Here we describe how to train recurrent neural networks in tasks like those used to train animals in neuroscience laboratories and how computations emerge in the trained networks. Surprisingly, artificial networks and real brains can use similar computational strategies.
Taskgraph: A Low Contention OpenMP Tasking Framework

OpenMP is the de-facto standard for shared memory systems in High-Performance Computing (HPC). It includes a tasking model that offers a high-level of abstraction to effectively exploit structured (loop-based) and highly dynamic unstructured (task-based) parallelism in an easy and flexible way. Unfortunately, the run-time overheads introduced to manage tasks are (very) high in most common OpenMP frameworks (e.g., GCC, LLVM), which defeats the potential benefits of the tasking model, and makes it suitable for coarse-grained tasks only. This paper presents taskgraph, a framework that uses a task dependency graph (TDG) to represent a region of code implemented with OpenMP tasks in order to reduce the run-time overheads associated with the management of tasks, i.e., contention and parallel orchestration, including task creation and synchronization. The TDG avoids the overheads related to the resolution of task dependencies and greatly reduces those deriving from accesses to shared resources. Moreover, the taskgraph framework introduces in OpenMP the record-and-replay execution model that accelerates the taskgraph region from its second execution. Overall, the multiple optimizations presented in this paper allow exploiting fine-grained OpenMP tasks to cope with the trend in current applications pointing to leverage massive on-node parallelism, fine-grained and dynamic scheduling paradigms. The framework is implemented on LLVM 15.0. Results show that the taskgraph implementation outperforms the vanilla OpenMP system in terms of performance and scalability, for all structured and unstructured parallelism, and considering coarse and fine grained tasks. Furthermore, the proposed framework makes the tasking model a competitive alternative to the OpenMP thread model in most cases.
Multi-Task Off-Policy Learning from Bandit Feedback

Many practical applications, such as recommender systems and learning to rank, involve solving multiple similar tasks. One example is learning of recommendation policies for users with similar movie preferences, where the users may still rank the individual movies slightly differently. Such tasks can be organized in a hierarchy, where similar tasks are related through a shared structure. In this work, we formulate this problem as a contextual off-policy optimization in a hierarchical graphical model from logged bandit feedback. To solve the problem, we propose a hierarchical off-policy optimization algorithm (HierOPO), which estimates the parameters of the hierarchical model and then acts pessimistically with respect to them. We instantiate HierOPO in linear Gaussian models, for which we also provide an efficient implementation and analysis. We prove per-task bounds on the suboptimality of the learned policies, which show a clear improvement over not using the hierarchical model. We also evaluate the policies empirically. Our theoretical and empirical results show a clear advantage of using the hierarchy over solving each task independently.
Decomposable Sparse Tensor on Tensor Regression

Most regularized tensor regression research focuses on tensors predictors with scalars responses or vectors predictors to tensors responses. We consider the sparse low rank tensor on tensor regression where predictors X and responses Y are both high-dimensional tensors. By demonstrating that the general inner product [Raskutti et al., 2019] or the contracted product [Lock, 2018] on a unit rank tensor can be decomposed into standard inner products and outer products, the problem can be simply transformed into a tensor to scalar regression followed by a tensor decomposition. So we propose a fast solution based on stagewise search composed by contraction part and generation part which are optimized alternatively. We successfully demonstrate our method can out perform current methods in terms of accuracy, predictors selection by effectively incorporating the structural information.
Elastic wavefield simulation using spectral element and finite element methods with triangles

Summary The finite element method (FEM) and spectral element method (SEM) based on triangular grids (TFEM and TSEM, respectively) are flexible in wavefield modeling in complex geometries. In this paper, we thoroughly investigate the computational accuracy and efficiency of the TFEM and TSEM in elastic wavefield modeling. The diagonal mass matrices of both the TFEM and TSEM free from matrix inversion are compared comprehensively by making full use of the mass-lumped technique and quadrature rule. Generally, the TFEM has a comparable accuracy to the TSEM with the same number of interpolant points. In view of efficiency, the TFEM can compete against the TSEM on condition that the order of interpolation polynomials is identical. In addition, a perfectly matched layer (PML) boundary condition in variational form is deduced. Numerical examples are given at last to investigate the performance of the TFEM and TSEM, and also test the effectiveness of the PML.
CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared Accounts

A typical blockchain protocol uses consensus to make sure that mutually mistrusting users agree on the order in which their operations on shared data are executed. However, it is known that asset transfer systems, by far the most popular application of blockchains, can be implemented without consensus. Assuming that no account can be accessed concurrently and every account belongs to a single owner, one can efficiently implement an asset transfer system in a purely asynchronous, consensus-free manner. It has also been shown that implementing asset transfer with shared accounts is impossible without consensus. In this paper, we propose CryptoConcurrency, an asset transfer protocol that allows concurrent accesses to be processed in parallel, without involving consensus, whenever possible. More precisely, if concurrent transfer operations on a given account do not lead to overspending, i.e. can all be applied without the account balance going below zero, they proceed in parallel. Otherwise, the account's owners may have to access an external consensus object. Notably, we avoid relying on a central, universally-trusted, consensus mechanism and allow each account to use its own consensus implementation, which only the owners of this account trust. This provides greater decentralization and flexibility.
Small logical qubit architecture based on strong interactions and many-body dynamical decoupling

We propose a novel superconducting logical qubit architecture, called the Cold Echo Qubit (CEQ), which is capable of preserving quantum information for much longer timescales than any of its component parts. The CEQ operates fully autonomously, requiring no measurement or feedback, and is compatible with relatively strong interaction elements, allowing for fast, high fidelity logical gates between multiple CEQ's. Its quantum state is protected by a combination of strong interactions and microwave driving, which implements a form of many-body dynamical decoupling to suppress phase noise. Estimates based on careful theoretical analysis and numerical simulations predict improvements in lifetimes and gate fidelities by an order of magnitude or more compared to the current state of the art, assuming no improvements in base coherence. Here, we consider the simplest possible implementation of the CEQ, using a pair of fluxonium qubits shunted through a shared mutual inductance. While not necessarily the best possible implementation, it is the easiest to test experimentally and should display coherence well past breakeven (as compared to the limiting coherence times of its components). A more complex three-node circuit is also presented; it is expected to roughly double the coherence of its two-fluxonium counterpart.
Robust Graph Representation Learning via Predictive Coding

Predictive coding is a message-passing framework initially developed to model information processing in the brain, and now also topic of research in machine learning due to some interesting properties. One of such properties is the natural ability of generative models to learn robust representations thanks to their peculiar credit assignment rule, that allows neural activities to converge to a solution before updating the synaptic weights. Graph neural networks are also message-passing models, which have recently shown outstanding results in diverse types of tasks in machine learning, providing interdisciplinary state-of-the-art performance on structured data. However, they are vulnerable to imperceptible adversarial attacks, and unfit for out-of-distribution generalization. In this work, we address this by building models that have the same structure of popular graph neural network architectures, but rely on the message-passing rule of predictive coding. Through an extensive set of experiments, we show that the proposed models are (i) comparable to standard ones in terms of performance in both inductive and transductive tasks, (ii) better calibrated, and (iii) robust against multiple kinds of adversarial attacks.
A Double Regression Method for Graphical Modeling of High-dimensional Nonlinear and Non-Gaussian Data

Graphical models have long been studied in statistics as a tool for inferring conditional independence relationships among a large set of random variables. The most existing works in graphical modeling focus on the cases that the data are Gaussian or mixed and the variables are linearly dependent. In this paper, we propose a double regression method for learning graphical models under the high-dimensional nonlinear and non-Gaussian setting, and prove that the proposed method is consistent under mild conditions. The proposed method works by performing a series of nonparametric conditional independence tests. The conditioning set of each test is reduced via a double regression procedure where a model-free sure independence screening procedure or a sparse deep neural network can be employed. The numerical results indicate that the proposed method works well for high-dimensional nonlinear and non-Gaussian data.
Fill in the Blank: Context-aware Automated Text Input Generation for Mobile GUI Testing

Automated GUI testing is widely used to help ensure the quality of mobile apps. However, many GUIs require appropriate text inputs to proceed to the next page, which remains a prominent obstacle for testing coverage. Considering the diversity and semantic requirement of valid inputs (e.g., flight departure, movie name), it is challenging to automate the text input generation. Inspired by the fact that the pre-trained Large Language Model (LLM) has made outstanding progress in text generation, we propose an approach named QTypist based on LLM for intelligently generating semantic input text according to the GUI context. To boost the performance of LLM in the mobile testing scenario, we develop a prompt-based data construction and tuning method which automatically extracts the prompts and answers for model tuning. We evaluate QTypist on 106 apps from Google Play, and the result shows that the passing rate of QTypist is 87%, which is 93% higher than the best baseline. We also integrate QTypist with the automated GUI testing tools and it can cover 42% more app activities, 52% more pages, and subsequently help reveal 122% more bugs compared with the raw tool.
MED-SE: Medical Entity Definition-based Sentence Embedding

We propose Medical Entity Definition-based Sentence Embedding (MED-SE), a novel unsupervised contrastive learning framework designed for clinical texts, which exploits the definitions of medical entities. To this end, we conduct an extensive analysis of multiple sentence embedding techniques in clinical semantic textual similarity (STS) settings. In the entity-centric setting that we have designed, MED-SE achieves significantly better performance, while the existing unsupervised methods including SimCSE show degraded performance. Our experiments elucidate the inherent discrepancies between the general- and clinical-domain texts, and suggest that entity-centric contrastive approaches may help bridge this gap and lead to a better representation of clinical sentences.
Lower Bounds for Rényi Differential Privacy in a Black-Box Setting

We present new methods for assessing the privacy guarantees of an algorithm with regard to R\'enyi Differential Privacy. To the best of our knowledge, this work is the first to address this problem in a black-box scenario, where only algorithmic outputs are available. To quantify privacy leakage, we devise a new estimator for the R\'enyi divergence of a pair of output distributions. This estimator is transformed into a statistical lower bound that is proven to hold for large samples with high probability. Our method is applicable for a broad class of algorithms, including many well-known examples from the privacy literature. We demonstrate the effectiveness of our approach by experiments encompassing algorithms and privacy enhancing methods that have not been considered in related works.
CEPHA29: Automatic Cephalometric Landmark Detection Challenge 2023

Quantitative cephalometric analysis is the most widely used clinical and research tool in modern orthodontics. Accurate localization of cephalometric landmarks enables the quantification and classification of anatomical abnormalities, however, the traditional manual way of marking these landmarks is a very tedious job. Endeavours have constantly been made to develop automated cephalometric landmark detection systems but they are inadequate for orthodontic applications. The fundamental reason for this is that the amount of publicly available datasets as well as the images provided for training in these datasets are insufficient for an AI model to perform well. To facilitate the development of robust AI solutions for morphometric analysis, we organise the CEPHA29 Automatic Cephalometric Landmark Detection Challenge in conjunction with IEEE International Symposium on Biomedical Imaging (ISBI 2023). In this context, we provide the largest known publicly available dataset, consisting of 1000 cephalometric X-ray images. We hope that our challenge will not only derive forward research and innovation in automatic cephalometric landmark identification but will also signal the beginning of a new era in the discipline.
Power Comparisons of Solutions to the Behrens-Fisher Problem

SYNOPTIC ABSTRACT The problem that arises, when testing the equality of means from two independent normal populations without the assumption of equality of variances, is known as Behrens – Fisher problem. In the literature several approximate solutions to the Behrens – Fisher problem have been proposed and evaluated with respect to type I and type II error rates. Saxena and Srivastava (1986) had developed a competitor test to the usual t-test by using the Jackknife estimator of the common population variance. This test can be used as an alternative to the Behrens – Fisher problem. In this paper powers of two commonly used tests, Welch – Satterthwaite test and Cochran – Cox test, have been compared to Saxena – Srivastava test empirically.
176Lu+ clock comparison at the 10−18 level via correlation spectroscopy

The extreme precision of optical atomic clocks has led to an anticipated redefinition of the second by the International System of Units. Furthermore, accuracies pushing the boundary of 1 part in 1018 and beyond will enable new applications, such as in geodesy and tests of fundamental physics. The 1S0 to 3D1 optical transition in 176Lu+ has exceptionally low sensitivity to external perturbations, making it suitable for practical clock implementations with inaccuracy at or below 10−18. Here, we perform high-accuracy comparisons between two 176Lu+ references using correlation spectroscopy. A comparison at different magnetic fields is used to obtain a quadratic Zeeman coefficient of −4.89264(88) Hz/mT for the reference frequency. With a subsequent comparison at low field, we demonstrate agreement at the low 10−18 level, statistically limited by the averaging time of 42 hours. The evaluated uncertainty in the frequency difference is 9 × 10−19 and the lowest reported in comparing independent optical references.
Music Recommendation System based on Emotion, Age and Ethnicity

A Music Recommendation System based on Emotion, Age, and Ethnicity is developed in this study, using FER-2013 and ``Age, Gender, and Ethnicity (Face Data) CSV'' datasets. The CNN architecture, which is extensively used for this kind of purpose has been applied to the training of the models. After adding several appropriate layers to the training end of the project, in total, 3 separate models are trained in the Deep Learning side of the project: Emotion, Ethnicity, and Age. After the training step of these models, they are used as classifiers on the web application side. The snapshot of the user taken through the interface is sent to the models to predict their mood, age, and ethnic origin. According to these classifiers, various kinds of playlists pulled from Spotify API are proposed to the user in order to establish a functional and user-friendly atmosphere for the music selection. Afterward, the user can choose the playlist they want and listen to it by following the given link.
Combining Unbiased Estimates of a Parameter Known to Be Positive

Abstract A statistician has n independent estimates of a parameter he knows is positive but, as is the case in components-of-variance problems, some of the estimates may be negative. If the n estimates are to be combined into a single number, we compare the procedure of averaging the n values and taking the positive part of the result with that of averaging the positive parts. Although the second estimation procedure is not consistent, it is calculated for the case of small n to have smaller mean square error than the first over an important region of the parameter space.