Reviewerly/exHarmony huggingface dataset:
Sensing Technology for Human Activity Recognition: A Comprehensive Survey

Sensors are devices that quantify the physical aspects of the world around us. This ability is important to gain knowledge about human activities. Human Activity recognition plays an import role in people's everyday life. In order to solve many human-centered problems, such as health care, and individual assistance, the need to infer various simple to complex human activities is prominent. Therefore, having a well defined categorization of sensing technology is essential for the systematic design of human activity recognition systems. By extending the sensor categorization proposed by White, we survey the most prominent research works that utilize different sensing technologies for human activity recognition tasks. To the best of our knowledge, there is no thorough sensor-driven survey that considers all sensor categories in the domain of human activity recognition with respect to the sampled physical properties, including a detailed comparison across sensor categories. Thus, our contribution is to close this gap by providing an insight into the state-of-the-art developments. We identify the limitations with respect to the hardware and software characteristics of each sensor category and draw comparisons based on benchmark features retrieved from the research works introduced in this survey. Finally, we conclude with general remarks and provide future research directions for human activity recognition within the presented sensor categorization.
Deep learning for detecting financial statement fraud

Financial statement fraud is an area of significant consternation for potential investors, auditing companies, and state regulators. The paper proposes an approach for detecting statement fraud through the combination of information from financial ratios and managerial comments within corporate annual reports. We employ a hierarchical attention network (HAN) to extract text features from the Management Discussion and Analysis (MD&A) section of annual reports. The model is designed to offer two distinct features. First, it reflects the structured hierarchy of documents, which previous approaches were unable to capture. Second, the model embodies two different attention mechanisms at the word and sentence level, which allows content to be differentiated in terms of its importance in the process of constructing the document representation. As a result of its architecture, the model captures both content and context of managerial comments, which serve as supplementary predictors to financial ratios in the detection of fraudulent reporting. Additionally, the model provides interpretable indicators denoted as “red-flag” sentences, which assist stakeholders in their process of determining whether further investigation of a specific annual report is required. Empirical results demonstrate that textual features of MD&A sections extracted by HAN yield promising classification results and substantially reinforce financial ratios.
Dynamic differential annealed optimization: New metaheuristic optimization algorithm for engineering applications

This work proposes a novel optimization algorithm which can be used to solve a wide range of mathematical optimization problems where the global minimum or maximum is required. The new algorithm is based on random search and classical simulated annealing algorithm (it mimics the modern process of producing high-quality steel) and is designated dynamic differential annealed optimization (DDAO). The proposed algorithm was benchmarked for 51 test functions. The dynamic differential annealed optimization algorithm has been compared to a large number of highly cited optimization algorithms. Over numerical tests, DDAO has outperformed some of these algorithms in many cases and shown high performance. Constrained path planning and spring design problem were selected as a practical engineering optimization problem. DDAO converged to the global minimum of problems efficiently, and for spring design problem DDAO has found the best feasible solution than what is found by many algorithms.
Robust Graph-Based Semisupervised Learning for Noisy Labeled Data via Maximum Correntropy Criterion

Semisupervised learning (SSL) methods have been proved to be effective at solving the labeled samples shortage problem by using a large number of unlabeled samples together with a small number of labeled samples. However, many traditional SSL methods may not be robust with too much labeling noisy data. To address this issue, in this paper, we propose a robust graph-based SSL method based on maximum correntropy criterion to learn a robust and strong generalization model. In detail, the graph-based SSL framework is improved by imposing supervised information on the regularizer, which can strengthen the constraint on labels, thus ensuring that the predicted labels of each cluster are close to the true labels. Furthermore, the maximum correntropy criterion is introduced into the graph-based SSL framework to suppress labeling noise. Extensive image classification experiments prove the generalization and robustness of the proposed SSL method.
Improving Automatic Polyp Detection Using CNN by Exploiting Temporal Dependency in Colonoscopy Video

Automatic polyp detection has been shown to be difficult due to various polyp-like structures in the colon and high interclass variations in polyp size, color, shape, and texture. An efficient method should not only have a high correct detection rate (high sensitivity) but also a low false detection rate (high precision and specificity). The state-of-the-art detection methods include convolutional neural networks (CNN). However, CNNs have shown to be vulnerable to small perturbations and noise; they sometimes miss the same polyp appearing in neighboring frames and produce a high number of false positives. We aim to tackle this problem and improve the overall performance of the CNN-based object detectors for polyp detection in colonoscopy videos. Our method consists of two stages: a region of interest (RoI) proposal by CNN-based object detector networks and a false positive (FP) reduction unit. The FP reduction unit exploits the temporal dependencies among image frames in video by integrating the bidirectional temporal information obtained by RoIs in a set of consecutive frames. This information is used to make the final decision. The experimental results show that the bidirectional temporal information has been helpful in estimating polyp positions and accurately predict the FPs. This provides an overall performance improvement in terms of sensitivity, precision, and specificity compared to conventional false positive learning method, and thus achieves the state-of-the-art results on the CVC-ClinicVideoDB video data set.
An Improved Genetic Algorithm for Path-Planning of Unmanned Surface Vehicle

The genetic algorithm (GA) is an effective method to solve the path-planning problem and help realize the autonomous navigation for and control of unmanned surface vehicles. In order to overcome the inherent shortcomings of conventional GA such as population premature and slow convergence speed, this paper proposes the strategy of increasing the number of offsprings by using the multi-domain inversion. Meanwhile, a second fitness evaluation was conducted to eliminate undesirable offsprings and reserve the most advantageous individuals. The improvement could help enhance the capability of local search effectively and increase the probability of generating excellent individuals. Monte-Carlo simulations for five examples from the library for the travelling salesman problem were first conducted to assess the effectiveness of algorithms. Furthermore, the improved algorithms were applied to the navigation, guidance, and control system of an unmanned surface vehicle in a real maritime environment. Comparative study reveals that the algorithm with multi-domain inversion is superior with a desirable balance between the path length and time-cost, and has a shorter optimal path, a faster convergence speed, and better robustness than the others.
The many Shapley values for model explanation

The Shapley value has become a popular method to attribute the prediction of a machine-learning model on an input to its base features. The use of the Shapley value is justified by citing [16] showing that it is the \emph{unique} method that satisfies certain good properties (\emph{axioms}). There are, however, a multiplicity of ways in which the Shapley value is operationalized in the attribution problem. These differ in how they reference the model, the training data, and the explanation context. These give very different results, rendering the uniqueness result meaningless. Furthermore, we find that previously proposed approaches can produce counterintuitive attributions in theory and in practice---for instance, they can assign non-zero attributions to features that are not even referenced by the model. In this paper, we use the axiomatic approach to study the differences between some of the many operationalizations of the Shapley value for attribution, and propose a technique called Baseline Shapley (BShap) that is backed by a proper uniqueness result. We also contrast BShap with Integrated Gradients, another extension of Shapley value to the continuous setting.
Towards an Appropriate Query, Key, and Value Computation for Knowledge Tracing

In this paper, we propose a novel Transformer-based model for knowledge tracing, SAINT: Separated Self-AttentIve Neural Knowledge Tracing. SAINT has an encoder-decoder structure where the exercise and response embedding sequences separately enter, respectively, the encoder and the decoder. The encoder applies self-attention layers to the sequence of exercise embeddings, and the decoder alternately applies self-attention layers and encoder-decoder attention layers to the sequence of response embeddings. This separation of input allows us to stack attention layers multiple times, resulting in an improvement in area under receiver operating characteristic curve (AUC). To the best of our knowledge, this is the first work to suggest an encoder-decoder model for knowledge tracing that applies deep self-attentive layers to exercises and responses separately. We empirically evaluate SAINT on a large-scale knowledge tracing dataset, EdNet, collected by an active mobile education application, Santa, which has 627,347 users, 72,907,005 response data points as well as a set of 16,175 exercises gathered since 2016. The results show that SAINT achieves state-of-the-art performance in knowledge tracing with an improvement of 1.8% in AUC compared to the current state-of-the-art model.
From Features Engineering to Scenarios Engineering for Trustworthy AI: I&amp;I, C&amp;C, and V&amp;V

Artificial intelligence (AI)’s rapid development has produced a variety of state-of-the-art models and methods that rely on network architectures and features engineering. However, some AI approaches achieve high accurate results only at the expense of interpretability and reliability. These problems may easily lead to bad experiences, lower trust levels, and systematic or even catastrophic risks. This article introduces the theoretical framework of scenarios engineering for building trustworthy AI techniques. We propose six key dimensions, including intelligence and index, calibration and certification, and verification and validation to achieve more robust and trusting AI, and address issues for future research directions and applications along this direction.
What Does ChatGPT Say: The DAO from Algorithmic Intelligence to Linguistic Intelligence

The well-known ancient Chinese philosopher Lao Tzu (老子) or Laozi (6th∼4th century BC during the Spring and Autumn period) started his classic Tao Teh Ching 《道德经》 or Dao De Jing (see Fig. 1) with six Chinese characters: “道(Dao)可(Ke)道(Dao)非(Fei)常(Chang)道(Dao)”, which has been traditionally interpreted as “道可道,非常道” or “The Dao that can be spoken is not the eternal Dao”. However, mordern archaeological discoveries in 1973 and 1993 at Changsha, Hunan, and Jingmen, Hubei, China, have respectively indicated a new, yet more natural and simple interpretation: “道,可道,非常道”, or “The Dao, The Speakable Dao, The Eternal Dao”.
Differential box counting methods for estimating fractal dimension of gray-scale images: A survey

Fractal dimension is extensively in use as features in computer vision applications to characterize roughness and self-similarity of objects in an image for many years. These features have been adopted successfully mainly in texture segmentation and classification. Differential box counting method is one of the widely accepted approaches, those exist in literature to estimate fractal dimension of an image. In this work, we comprehensively reviewed the available differential box counting methods. First, the differential box counting method is discussed in detail along with its computer vision applications and drawbacks. Second, various variants of differential box counting method are thoroughly studied and grouped using different parameters of differential box counting method. Third, the synthetic and real-world databases, considered for demonstrating experimental results by the state-of-the-art methods have been presented. Fourth, some of the state-of-the-art methods have been implemented and corresponding results obtained in this study are reported. Fifth, three evaluation metrics have also been reviewed. However, these metrics work only for synthetic fractal Brownian motion images because the theoretical fractal dimension values for these images are known and have been used as a set of ground truths. Finally, we concluded the status of differential box counting methods and explored the possible future directions.
Neural Relation Extraction within and across Sentence Boundaries

Past work in relation extraction mostly focuses on binary relation between entity pairs within single sentence. Recently, the NLP community has gained interest in relation extraction in entity pairs spanning multiple sentences. In this paper, we propose a novel architecture for this task: inter-sentential dependency-based neural networks (iDepNN). iDepNN models the shortest and augmented dependency paths via recurrent and recursive neural networks to extract relationships within (intra-) and across (inter-) sentence boundaries. Compared to SVM and neural network baselines, iDepNN is more robust to false positives in relationships spanning sentences. We evaluate our models on four datasets from newswire (MUC6) and medical (BioNLP shared task) domains that achieve state-of-the-art performance and show a better balance in precision and recall for inter-sentential relationships. We perform better than 11 teams participating in the BioNLP shared task 2016 and achieve a gain of 5.2% (0.587 vs 0.558) in F1 over the winning team. We also release the crosssentence annotations for MUC6.
Conversion of Gaussian states to non-Gaussian states using photon-number-resolving detectors

Generation of high fidelity photonic non-Gaussian states is a crucial ingredient for universal quantum computation using continous-variable platforms, yet it remains a challenge to do so efficiently. We present a general framework for a probabilistic production of multimode non-Gaussian states by measuring few modes of multimode Gaussian states via photon-number-resolving detectors. We use Gaussian elements consisting of squeezed displaced vacuum states and interferometers, the only non-Gaussian elements consisting of photon-number-resolving detectors. We derive analytic expressions for the output Wigner function, and the probability of generating the states in terms of the mean and the covariance matrix of the Gaussian state and the photon detection pattern. We find that the output states can be written as a Fock basis superposition state followed by a Gaussian gate, and we derive explicit expressions for these parameters. These analytic expressions show exactly what non-Gaussian states can be generated by this probabilistic scheme. Further, it provides a method to search for the Gaussian circuit and measurement pattern that produces a target non-Gaussian state with optimal fidelity and success probability. We present specific examples such as the generation of cat states, ON states, Gottesman-Kitaev-Preskill states, NOON states and bosonic code states. The proposed framework has potential far-reaching implications for the generation of bosonic error-correction codes that require non-Gaussian states, resource states for the implementation of non-Gaussian gates needed for universal quantum computation, among other applications requiring non-Gaussianity. The tools developed here could also prove useful for the quantum resource theory of non-Gaussianity.
Filter-based deep-compression with global average pooling for convolutional networks

Deep neural networks are powerful, but using these networks is both memory and time consuming due to their numerous parameters and large amounts of computation. Many studies have been conducted on compressing the models on the parameter-level as well as on the bit-level. Here, we propose an efficient strategy to compress on the layers that are computation or memory consuming. We compress the model by introducing global average pooling, performing iterative pruning on the filters with the proposed order-deciding scheme in order to prune more efficiently, applying truncated SVD to the fully-connected layer, and performing quantization. Experiments on the VGG16 model show that our approach achieves a 60.9 × compression ratio in off-line storage with about 0.848% and 0.1378% loss of accuracy in the top-1 and top-5 classification results, respectively, with the validation dataset of ILSVRC2012. Our approach also shows good compression results on AlexNet and faster R-CNN.
XACC: a system-level software infrastructure for heterogeneous quantum–classical computing

Quantum programming techniques and software have advanced significantly over the past five years, with a majority focusing on high-level language frameworks targeting remote REST library APIs. As quantum computing architectures advance and become more widely available, lower-level, system software infrastructures will be needed to enable tighter, co-processor programming and access models. Here we present XACC, a system-level software infrastructure for quantum–classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks. We detail XACC's interfaces, their interactions, and its implementation as a hardware-agnostic framework for both near-term and future quantum–classical architectures. We provide concrete examples demonstrating the utility of this framework with paradigmatic tasks. Our approach lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting

While Graph Neural Networks (GNNs) have achieved remarkable results in a variety of applications, recent studies exposed important shortcomings in their ability to capture the structure of the underlying graph. It has been shown that the expressive power of standard GNNs is bounded by the Weisfeiler-Leman (WL) graph isomorphism test, from which they inherit proven limitations such as the inability to detect and count graph substructures. On the other hand, there is significant empirical evidence, e.g. in network science and bioinformatics, that substructures are often intimately related to downstream tasks. To this end, we propose ”Graph Substructure Networks” (GSN), a topologically-aware message passing scheme based on substructure encoding. We theoretically analyse the expressive power of our architecture, showing that it is strictly more expressive than the WL test, and provide sufficient conditions for universality. Importantly, we do not attempt to adhere to the WL hierarchy; this allows us to retain multiple attractive properties of standard GNNs such as locality and linear network complexity, while being able to disambiguate even hard instances of graph isomorphism. We perform an extensive experimental evaluation on graph classification and regression tasks and obtain state-of-the-art results in diverse real-world settings including molecular graphs and social networks.
Multilingual Neural Machine Translation with Language Clustering

Multilingual neural machine translation (NMT), which translates multiple languages using a single model, is of great practical importance due to its advantages in simplifying the training process, reducing online maintenance costs, and enhancing low-resource and zero-shot translation.Given there are thousands of languages in the world and some of them are very different, it is extremely burdensome to handle them all in a single model or use a separate model for each language pair.Therefore, given a fixed resource budget, e.g., the number of models, how to determine which languages should be supported by one model is critical to multilingual NMT, which, unfortunately, has been ignored by previous work.In this work, we develop a framework that clusters languages into different groups and trains one multilingual model for each cluster.We study two methods for language clustering: (1) using prior knowledge, where we cluster languages according to language family, and (2) using language embedding, in which we represent each language by an embedding vector and cluster them in the embedding space.In particular, we obtain the embedding vectors of all the languages by training a universal neural machine translation model.Our experiments on 23 languages show that the first clustering method is simple and easy to understand but leading to suboptimal translation accuracy, while the second method sufficiently captures the relationship among languages well and improves the translation accuracy for almost all the languages over baseline methods.
Efficient algorithm for big data clustering on single machine

Big data analysis requires the presence of large computing powers, which is not always feasible. And so, it became necessary to develop new clustering algorithms capable of such data processing. This study proposes a new parallel clustering algorithm based on the k-means algorithm. It significantly reduces the exponential growth of computations. The proposed algorithm splits a dataset into batches while preserving the characteristics of the initial dataset and increasing the clustering speed. The idea is to define cluster centroids, which are also clustered, for each batch. According to the obtained centroids, the data points belong to the cluster with the nearest centroid. Real large datasets are used to conduct the experiments to evaluate the effectiveness of the proposed approach. The proposed approach is compared with k-means and its modification. The experiments show that the proposed algorithm is a promising tool for clustering large datasets in comparison with the k-means algorithm.