Reviewerly/exHarmony huggingface dataset:
Sparse deep feature learning for facial expression recognition

While weight sparseness-based regularization has been used to learn better deep features for image recognition problems, it introduced a large number of variables for optimization and can easily converge to a local optimum. The L2-norm regularization proposed for face recognition reduces the impact of the noisy information, while expression information is also suppressed during the regularization. A feature sparseness-based regularization that learns deep features with better generalization capability is proposed in this paper. The regularization is integrated into the loss function and optimized with a deep metric learning framework. Through a toy example, it is showed that a simple network with the proposed sparseness outperforms the one with the L2-norm regularization. Furthermore, the proposed approach achieved competitive performances on four publicly available datasets, i.e., FER2013, CK+, Oulu-CASIA and MMI. The state-of-the-art cross-database performances also justify the generalization capability of the proposed approach.
Ensemble Deep Manifold Similarity Learning Using Hard Proxies

This paper is about learning deep representations of images such that images belonging to the same class have more similar representations than those belonging to different classes. For this goal, prior work typically uses the triplet or N-pair loss, specified in terms of either l2-distances or dot-products between deep features. However, such formulations seem poorly suited to the highly non-Euclidean deep feature space. Our first contribution is in specifying the N-pair loss in terms of manifold similarities between deep features. We introduce a new time- and memory-efficient method for estimating the manifold similarities by using a closed-form convergence solution of the Random Walk algorithm. Our efficiency comes, in part, from following the recent work that randomly partitions the deep feature space, and expresses image distances via representatives of the resulting subspaces, a.k.a. proxies. Our second contribution is aimed at reducing overfitting by estimating hard proxies that are as close to one another as possible, but remain in their respective subspaces. Our evaluation demonstrates that we outperform the state of the art in both image retrieval and clustering on the benchmark CUB-200-2011, Cars196, and Stanford Online Products datasets.
Graph Representations for Higher-Order Logic and Theorem Proving

This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the formalization of most mathematical theories and have been shown to pose a significant challenge for deep learning. Higher-order logic is highly expressive and, even though it is well-structured with a clearly defined grammar and semantics, there still remains no well-established method to convert formulas into graph-based representations. In this paper, we consider several graphical representations of higher-order logic and evaluate them against the HOList benchmark for higher-order theorem proving.
An Effective of Ensemble Boosting Learning Method for Breast Cancer Virtual Screening Using Neural Network Model

Radial Based Function Neural Network models (RBFNN) are currently used deep-rooted methods for assessing the stages of diagnosis of chronic diseases. The goals of this research are to suggest a model for the diagnosis of breast cancer, and to be able to estimate the stages of development of pre-malignant breast tumors. The significance of the study is to develop an integrated RBF neural network with ensemble features using the boosting method. The importance of the ensemble boosting method is to generate a sequence of models to achieve more precise predictions. One of the ensemble boosting advantages is that it can take longer to build and to score than a RBF NN standard model. By using ensemble boosting, the accuracy of breast tumor diagnosis increased and thus it became easier to know the stage of the tumor, and whether it was malignant or benign. This will help doctors to select appropriate treatment for each tumor stage, consequently leading to the salvage of cancer patients with this type of tumor. The suggested RBFNN method was examined on the different type of UCI breast cancer datasets. The general diagnosis accuracy based on 10-fold cross validation using RBFNN method obtained 97.4%, 98.4%, 97.7% and 97.0% for the WBC, BCD, BCP, and WBCD UCI datasets respectively. The effectiveness of the proposed method was confirmed by comparing accuracy improvement both before and after using ensemble boosting, and it was found to be more accurate compared with other breast cancer diagnosis methods such as Logistic Regression (91.5%), KNN (96%), SVM (89%), Decision tree (95.13), CNN (97.66%), and Naive Bayes (91%).
Deep Learning for Photovoltaic Generation Forecast in Active Solar Trackers

The generation of electricity by photovoltaic panels depends on the position of solar incidence on them. Using active solar trackers may be a maximization of generating capacity. However, if motors that update the position of the panels use more energy than the efficiency in their use, the system becomes ineffective. In this way, solar forecasting can be used to actively determine the generation capacity and to assess whether position updating is efficient. Among the algorithms that can be used to predict photovoltaic generation, stands out the Long Short-Term Memory (LSTM) which is an artificial recurrent neural network architecture used in deep learning. This technique stands out among the others for having the ability to handle complex problems with high nonlinearity. The results of the application of LSTM for photovoltaic generation forecast in active solar trackers are promising as described in this article.
HybridDNN: A Framework for High-Performance Hybrid DNN Accelerator Design and Implementation

To speedup Deep Neural Networks (DNN) accelerator design and enable effective implementation, we propose HybridDNN, a framework for building high-performance hybrid DNN accelerators and delivering FPGA-based hardware implementations. Novel techniques include a highly flexible and scalable architecture with a hybrid Spatial/Winograd convolution (CONV) Processing Engine (PE), a comprehensive design space exploration tool, and a complete design flow to fully support accelerator design and implementation. Experimental results show that the accelerators generated by HybridDNN can deliver 3375.7 and 83.3 GOPS on a high-end FPGA (VU9P) and an embedded FPGA (PYNQ-Z1), respectively, which achieve a 1.8x higher performance improvement compared to the state-of-art accelerator designs. This demonstrates that HybridDNN is flexible and scalable and can target both cloud and embedded hardware platforms with vastly different resource constraints.
Mixup-Transformer: Dynamic Data Augmentation for NLP Tasks

Mixup (Zhang et al., 2017) is a latest data augmentation technique that linearly interpolates input examples and the corresponding labels.It has shown strong effectiveness in image classification by interpolating images at the pixel level.Inspired by this line of research, in this paper, we explore: i) how to apply mixup to natural language processing tasks since text data can hardly be mixed in the raw format; ii) if mixup is still effective in transformer-based learning models, e.g., BERT.To achieve the goal, we incorporate mixup to transformer-based pre-trained architecture, named "mixup-transformer", for a wide range of NLP tasks while keeping the whole end-to-end training system.We evaluate the proposed framework by running extensive experiments on the GLUE benchmark.Furthermore, we also examine the performance of mixup-transformer in low-resource scenarios by reducing the training data with a certain ratio.Our studies show that mixup is a domain-independent data augmentation technique to pre-trained language models, resulting in significant performance improvement for transformer-based models.
Specific Emitter Identification Based on Multi-Level Sparse Representation in Automatic Identification System

Illegally forged signals in automatic identification system (AIS) pose a threat to maritime traffic safety management. In this paper, a multi-level sparse representation based identification (MSRI) algorithm is proposed for specific emitter identification (SEI) in the AIS. The MSRI innovatively combines neural networks with sparse representation based classification (SRC). Channel attention mechanism is introduced to a multi-scale convolutional neural network (CNN) for extracting hidden features in the signal. These extracted features are divided into shallow and deep features according to the depth of the network layer they are extracted from. The original AIS signals and the two-level features are spliced together to form a multi-level dictionary. Subsequently, a sparse representation based identification is performed on the decorrelated multi-level dictionary using the principal components analysis (PCA) method. The proposed MSRI is evaluated on a dataset composed of real-world AIS signals, and compared with the state-of-the-art identification algorithms. The evaluation is based on several factors including computational complexity, number of training samples, and number of emitters. Numerical results indicate that the proposed algorithm can identify emitters with higher accuracy and requires lower training time compared to other methods. Given more than 15 training samples at each emitter, the MSRI can identify nine emitters with an accuracy higher than 90%.
Heavy metal: a misused term?

The use of the term “heavy metal” is regularly questioned by the scientific community. Here, we followed the evolution (1970–2020) in the number of published papers including this term in their title. Thus, we can evidence a continuous, albeit sometimes stabilizing, increase especially in environmental journals. After several other warning opinions, we propose that it should be replaced in the scientific literature by terms like “metal”, “metalloid”, “trace metal elements” or “potentially toxic element”.
BSN++: Complementary Boundary Regressor with Scale-Balanced Relation Modeling for Temporal Action Proposal Generation

Generating human action proposals in untrimmed videos is an important yet challenging task with wide applications. Current methods often suffer from the noisy boundary locations and the inferior quality of confidence scores used for proposal retrieving. In this paper, we present BSN++, a new framework which exploits complementary boundary regressor and relation modeling for temporal proposal generation. First, we propose a novel boundary regressor based on the complementary characteristics of both starting and ending boundary classifiers. Specifically, we utilize the U-shaped architecture with nested skip connections to capture rich contexts and introduce bi-directional boundary matching mechanism to improve boundary precision. Second, to account for the proposal-proposal relations ignored in previous methods, we devise a proposal relation block to which includes two self-attention modules from the aspects of position and channel. Furthermore, we find that there inevitably exists data imbalanced problems in the positive/negative proposals and temporal durations, which harm the model performance on tail distributions. To relieve this issue, we introduce the scale-balanced re-sampling strategy. Extensive experiments are conducted on two popular benchmarks: ActivityNet-1.3 and THUMOS14, which demonstrate that BSN++ achieves the state-of-the-art performance. Not surprisingly, the proposed BSN++ ranked 1st place in the CVPR19 - ActivityNet challenge leaderboard on temporal action localization task.
Online Multiple Object Tracking with Cross-Task Synergy

Modern online multiple object tracking (MOT) methods usually focus on two directions to improve tracking performance. One is to predict new positions in an incoming frame based on tracking information from previous frames, and the other is to enhance data association by generating more discriminative identity embeddings. Some works combined both directions within one framework but handled them as two individual tasks, thus gaining little mutual benefits. In this paper, we propose a novel unified model with synergy between position prediction and embedding association. The two tasks are linked by temporal-aware target attention and distractor attention, as well as identity-aware memory aggregation model. Specifically, the attention modules can make the prediction focus more on targets and less on distractors, therefore more reliable embeddings can be extracted accordingly for association. On the other hand, such reliable embeddings can boost identity-awareness through memory aggregation, hence strengthen attention modules and suppress drifts. In this way, the synergy between position prediction and embedding association is achieved, which leads to strong robustness to occlusions. Extensive experiments demonstrate the superiority of our proposed model over a wide range of existing methods on MOTChallenge benchmarks. Our code and models are publicly available at https://github.com/songguocode/TADAM.
Construction and Application of a Knowledge Graph

With the development and improvement of modern surveying and remote-sensing technology, data in the fields of surveying and remote sensing have grown rapidly. Due to the characteristics of large-scale, heterogeneous and diverse surveys and the loose organization of surveying and remote-sensing data, effectively obtaining information and knowledge from data can be difficult. Therefore, this paper proposes a method of using ontology for heterogeneous data integration. Based on the heterogeneous, decentralized, and dynamic updates of large surveying and remote-sensing data, this paper constructs a knowledge graph for surveying and remote-sensing applications. First, data are extracted. Second, using the ontology editing tool Protégé, a knowledge graph mode level is constructed. Then, using a relational database, data are stored, and a D2RQ tool maps the data from the mode level’s ontology to the data layer. Then, using the D2RQ tool, a SPARQL protocol and resource description framework query language (SPARQL) endpoint service is used to describe functions such as query and reasoning of the knowledge graph. The graph database is then used to display the knowledge graph. Finally, the knowledge graph is used to describe the correlation between the fields of surveying and remote sensing.
Physical Inertial Poser (PIP): Physics-aware Real-time Human Motion Tracking from Sparse Inertial Sensors

Motion capture from sparse inertial sensors has shown great potential compared to image-based approaches since occlusions do not lead to a reduced tracking quality and the recording space is not restricted to be within the viewing frustum of the camera. However, capturing the motion and global position only from a sparse set of inertial sensors is inherently ambiguous and challenging. In consequence, recent state-of-the-art methods can barely handle very long period motions, and unrealistic artifacts are common due to the unawareness of physical constraints. To this end, we present the first method which combines a neural kinematics estimator and a physics-aware motion optimizer to track body motions with only 6 inertial sensors. The kinematics module first regresses the motion status as a reference, and then the physics module refines the motion to satisfy the physical constraints. Experiments demonstrate a clear improvement over the state of the art in terms of capture accuracy, temporal stability, and physical correctness.
Deterministic PAC-Bayesian generalization bounds for deep networks via generalizing noise-resilience

The ability of overparameterized deep networks to generalize well has been linked to the fact that stochastic gradient descent (SGD) finds solutions that lie in flat, wide minima in the training loss -- minima where the output of the network is resilient to small random noise added to its parameters. So far this observation has been used to provide generalization guarantees only for neural networks whose parameters are either \textit{stochastic} or \textit{compressed}. In this work, we present a general PAC-Bayesian framework that leverages this observation to provide a bound on the original network learned -- a network that is deterministic and uncompressed. What enables us to do this is a key novelty in our approach: our framework allows us to show that if on training data, the interactions between the weight matrices satisfy certain conditions that imply a wide training loss minimum, these conditions themselves {\em generalize} to the interactions between the matrices on test data, thereby implying a wide test loss minimum. We then apply our general framework in a setup where we assume that the pre-activation values of the network are not too small (although we assume this only on the training data). In this setup, we provide a generalization guarantee for the original (deterministic, uncompressed) network, that does not scale with product of the spectral norms of the weight matrices -- a guarantee that would not have been possible with prior approaches.
Potentials of Augmented Reality in Training

The technological advances through digitalization provide the basis for a new form of life. Targeting the future of work, digitalization will lead to a redesign of jobs, particularly in the manufacturing industry. This changes the requirements on employees, meaning new digital competences. To support employees building up the required competences different technologies such as augmented reality can be used. The aim of the study is to analyze the potential of augmented reality technologies to meet the outlined challenges. To fulfill this objective, this paper detects the potential of augmented reality as an innovative learning medium showing several use cases. It will be shown which different teaching and learning objectives can be achieved through the use of this technology in training with a special focus on practical learning scenarios in the industrial environment. This paper serves to optimize education and training in order to meet the requirements of digitalization more successfully.
Efficient Autonomous Robotic Exploration With Semantic Road Map in Indoor Environments

This letter presents a novel and integrated framework for Next-Best-View (NBV) selection toward autonomous robotic exploration in indoor environments. A topological map, named semantic road map (SRM), is proposed to represent the explored environment during the exploration. The basic concept of the SRM is to construct a graph with nodes containing the exploration states and with edges satisfying the collision-free constraints. Especially, the SRM integrates both semantic and structure information of the environment, which possesses the beneficial properties of using a topological map in the exploration. It is worth noting that the proposed SRM is incrementally built along with the exploration process, thereby, avoiding the unnecessary reconsideration of the explored areas when constructing the topological map. Based on the SRM, a novel decision model with semantic information is presented for determining the NBV during the exploration. Moreover, the decision model takes into account both information gain and cost-to-go of a candidate NBV, which can be queried efficiently on the SRM, enabling the efficient exploration of the environment. The effectiveness and efficiency of the proposed system are assessed and demonstrated using both simulated and real-world indoor experiments.
How to delegate computations publicly

We construct a delegation scheme for all polynomial time computations. Our scheme is publicly verifiable and completely non-interactive in the common reference string (CRS) model.
An Efficient Blockchain-Based Hierarchical Authentication Mechanism for Energy Trading in V2G Environment

Vehicle-to-grid (V2G) networks have emerged as a new technology in modern electric power transmission networks. It allows bi-directional flow of communication and electricity between electric vehicles (EVs) and the Smart Grid (SG), in order to provide more sophisticated energy trading. However, due to the involvement of a huge amount of trading data and the presence of untrusted entities in the visiting networks, the underlying V2G infrastructure suffers from various security and privacy challenges. Although, several solutions have been proposed in the literature to address these problems, issues like lack of mutual authentication and anonymity, incapability to protect against several attack vectors, generation of huge overhead, and dependency on centralized infrastructures make security and privacy issues even more challenging. To address the above mentioned problems, in this paper, we propose a blockchain oriented hierarchical authentication mechanism for rewarding EVs. The overall process is broadly classified into the following phases: 1) System Initialization, 2) Registration, 3) Hierarchical Mutual Authentication, and 4) Consensus; wherein blockchain's distributed ledger has been employed for transaction execution in distributed V2G environments while Elliptic curve cryptography (ECC) has been used for hierarchical authentication. The designed hierarchical authentication mechanism has been employed to preserve the anonymity of EVs and support mutual authentication between EVs, charging stations (CSs) and the central aggregator (CAG). Additionally, it also supports minimal communicational and computational overheads on resource constrained EVs. Further, formal security verification of the proposed scheme on widely accepted Automated Validation of Internet Security Protocols and Applications (AVISPA) tool validates its safeness against different security attacks.
Foundations for Restraining Bolts: Reinforcement Learning with LTLf/LDLf Restraining Specifications

In this work we investigate on the concept of “restraining bolt”, envisioned in Science Fiction. Specifically we introduce a novel problem in AI. We have two distinct sets of features extracted from the world, one by the agent and one by the authority imposing restraining specifications (the “restraining bolt”). The two sets are apparently unrelated since of interest to independent parties, however they both account for (aspects of) the same world. We consider the case in which the agent is a reinforcement learning agent on the first set of features, while the restraining bolt is specified logically using linear time logic on finite traces LTLf/LDLf over the second set of features. We show formally, and illustrate with examples, that, under general circumstances, the agent can learn while shaping its goals to suitably conform (as much as possible) to the restraining bolt specifications.
PRETSA: Event Log Sanitization for Privacy-aware Process Discovery

Event logs that originate from information systems enable comprehensive analysis of business processes, e.g., by process model discovery. However, logs potentially contain sensitive information about individual employees involved in process execution that are only partially hidden by an obfuscation of the event data. In this paper, we therefore address the risk of privacy-disclosure attacks on event logs with pseudonymized employee information. To this end, we introduce PRETSA, a novel algorithm for event log sanitization that provides privacy guarantees in terms of k-anonymity and t-closeness. It thereby avoids disclosure of employee identities, their membership in the event log, and their characterization based on sensitive attributes, such as performance information. Through step-wise transformations of a prefix-tree representation of an event log, we maintain its high utility for discovery of a performance-annotated process model. Experiments with real-world data demonstrate that sanitization with PRETSA yields event logs of higher utility compared to methods that exploit frequency-based filtering, while providing the same privacy guarantees.