OpenRaiser/Intern-Atlas huggingface dataset:
Towards augmented reality for corporate training
Venue: arXiv cs.HC 2021
Year: 2021

Corporate training relates to employees acquiring essential skills to operate equipment or effectively performing required tasks both competently and safely. Unlike formal education, training can be incorporated into the task workflow and performed during working hours. Increasingly, organizations adopt different technologies to develop both individual skills and improve their organization. Studies indicate that Augmented Reality (AR) is quickly becoming an effective technology for training programs. This systematic literature review (SLR) aims to screen works published on AR for corporate training. We describe AR training applications, discuss current challenges, literature gaps, opportunities, and tendencies of corporate AR solutions. We structured a protocol to define keywords, the semantics of research, and databases used as sources of this SLR. From a primary analysis, we considered 1952 articles in the review for qualitative synthesis. We selected 60 among the selected articles for this study. The survey shows a large number of 41.7% of applications focused on automotive and medical training. Additionally, 20% of selected publications use a camera-display with a tablet device, while 40% refer to head-mounted-displays, and many surveyed approaches (45%) adopt marker-based tracking. Results indicate that publications on AR for corporate training increased significantly in recent years. AR has been used in many areas, exhibiting high quality and provides viable approaches to On-The-Job training. Finally, we discuss future research issues related to increasing relevance regarding AR for corporate training.
Clockwork Variational Autoencoders
Venue: arXiv cs.CV 2021
Year: 2021

Deep learning has enabled algorithms to generate realistic images. However, accurately predicting long video sequences requires understanding long-term dependencies and remains an open challenge. While existing video prediction models succeed at generating sharp images, they tend to fail at accurately predicting far into the future. We introduce the Clockwork VAE (CW-VAE), a video prediction model that leverages a hierarchy of latent sequences, where higher levels tick at slower intervals. We demonstrate the benefits of both hierarchical latents and temporal abstraction on 4 diverse video prediction datasets with sequences of up to 1000 frames, where CW-VAE outperforms top video prediction models. Additionally, we propose a Minecraft benchmark for long-term video prediction. We conduct several experiments to gain insights into CW-VAE and confirm that slower levels learn to represent objects that change more slowly in the video, and faster levels learn to represent faster objects.
SLAKE: A Semantically-Labeled Knowledge-Enhanced Dataset for Medical Visual Question Answering
Venue: arXiv cs.CV 2021
Year: 2021

Medical visual question answering (Med-VQA) has tremendous potential in healthcare. However, the development of this technology is hindered by the lacking of publicly-available and high-quality labeled datasets for training and evaluation. In this paper, we present a large bilingual dataset, SLAKE, with comprehensive semantic labels annotated by experienced physicians and a new structural medical knowledge base for Med-VQA. Besides, SLAKE includes richer modalities and covers more human body parts than the currently available dataset. We show that SLAKE can be used to facilitate the development and evaluation of Med-VQA systems. The dataset can be downloaded from http://www.med-vqa.com/slake.
Knowledge Hypergraph Embedding Meets Relational Algebra
Venue: arXiv cs.LG 2021
Year: 2021

Embedding-based methods for reasoning in knowledge hypergraphs learn a representation for each entity and relation. Current methods do not capture the procedural rules underlying the relations in the graph. We propose a simple embedding-based model called ReAlE that performs link prediction in knowledge hypergraphs (generalized knowledge graphs) and can represent high-level abstractions in terms of relational algebra operations. We show theoretically that ReAlE is fully expressive and provide proofs and empirical evidence that it can represent a large subset of the primitive relational algebra operations, namely renaming, projection, set union, selection, and set difference. We also verify experimentally that ReAlE outperforms state-of-the-art models in knowledge hypergraph completion, and in representing each of these primitive relational algebra operations. For the latter experiment, we generate a synthetic knowledge hypergraph, for which we design an algorithm based on the Erdos-R'enyi model for generating random graphs.
A Deep Embedded Refined Clustering Approach for Breast Cancer Distinction based on DNA Methylation
Venue: arXiv cs.LG 2021
Year: 2021

Epigenetic alterations have an important role in the development of several types of cancer. Epigenetic studies generate a large amount of data, which makes it essential to develop novel models capable of dealing with large-scale data. In this work, we propose a deep embedded refined clustering method for breast cancer differentiation based on DNA methylation. In concrete, the deep learning system presented here uses the levels of CpG island methylation between 0 and 1. The proposed approach is composed of two main stages. The first stage consists in the dimensionality reduction of the methylation data based on an autoencoder. The second stage is a clustering algorithm based on the soft-assignment of the latent space provided by the autoencoder. The whole method is optimized through a weighted loss function composed of two terms: reconstruction and classification terms. To the best of the authors' knowledge, no previous studies have focused on the dimensionality reduction algorithms linked to classification trained end-to-end for DNA methylation analysis. The proposed method achieves an unsupervised clustering accuracy of 0.9927 and an error rate (%) of 0.73 on 137 breast tissue samples. After a second test of the deep-learning-based method using a different methylation database, an accuracy of 0.9343 and an error rate (%) of 6.57 on 45 breast tissue samples is obtained. Based on these results, the proposed algorithm outperforms other state-of-the-art methods evaluated under the same conditions for breast cancer classification based on DNA methylation data.
A Differential Geometry Perspective on Orthogonal Recurrent Models
Venue: arXiv cs.LG 2021
Year: 2021

Recently, orthogonal recurrent neural networks (RNNs) have emerged as state-of-the-art models for learning long-term dependencies. This class of models mitigates the exploding and vanishing gradients problem by design. In this work, we employ tools and insights from differential geometry to offer a novel perspective on orthogonal RNNs. We show that orthogonal RNNs may be viewed as optimizing in the space of divergence-free vector fields. Specifically, based on a well-known result in differential geometry that relates vector fields and linear operators, we prove that every divergence-free vector field is related to a skew-symmetric matrix. Motivated by this observation, we study a new recurrent model, which spans the entire space of vector fields. Our method parameterizes vector fields via the directional derivatives of scalar functions. This requires the construction of latent inner product, gradient, and divergence operators. In comparison to state-of-the-art orthogonal RNNs, our approach achieves comparable or better results on a variety of benchmark tasks.
Speculative Analysis for Quality Assessment of Code Comments
Venue: arXiv cs.SE 2021
Year: 2021

Previous studies have shown that high-quality code comments assist developers in program comprehension and maintenance tasks. However, the semi-structured nature of comments, unclear conventions for writing good comments, and the lack of quality assessment tools for all aspects of comments make their evaluation and maintenance a non-trivial problem. To achieve high-quality comments, we need a deeper understanding of code comment characteristics and the practices developers follow. In this thesis, we approach the problem of assessing comment quality from three different perspectives: what developers ask about commenting practices, what they write in comments, and how researchers support them in assessing comment quality. Our preliminary findings show that developers embed various kinds of information in class comments across programming languages. Still, they face problems in locating relevant guidelines to write consistent and informative comments, verifying the adherence of their comments to the guidelines, and evaluating the overall state of comment quality. To help developers and researchers in building comment quality assessment tools, we provide: (i) an empirically validated taxonomy of comment convention-related questions from various community forums, (ii) an empirically validated taxonomy of comment information types from various programming languages, (iii) a language-independent approach to automatically identify the information types, and (iv) a comment quality taxonomy prepared from a systematic literature review.
Neuromorphic Pattern Generation Circuits for Bioelectronic Medicine
Venue: arXiv cs.ET 2021
Year: 2021

Chronic diseases can greatly benefit from bioelectronic medicine approaches. Neuromorphic electronic circuits present ideal characteristics for the development of brain-inspired low-power implantable processing systems that can be interfaced with biological systems. These circuits, therefore, represent a promising additional tool in the tool-set of bioelectronic medicine. In this paper, we describe the main features of neuromorphic circuits that are ideally suited for continuously monitoring the physiological parameters of the body and interact with them in real-time. We propose examples of computational primitives that can be used for real-time pattern generation and present a neuromorphic implementation of neural oscillators for the generation of sequence activation patterns. We demonstrate the features of such systems with an implementation of a three-phase network that models the dynamics of the respiratory Central Pattern Generator (CPG) and the heart chambers rhythm, and that could be used to build an adaptive pacemaker.
Modeling epigenetic evolutionary algorithms: An approach based on the epigenetic regulation process
Venue: arXiv cs.NE 2021
Year: 2021

Many biological processes have been the source of inspiration for heuristic methods that generate high-quality solutions to solve optimization and search problems. This thesis presents an epigenetic technique for Evolutionary Algorithms, inspired by the epigenetic regulation process, a mechanism to better understand the ability of individuals to adapt and learn from the environment. Epigenetic regulation comprises biological mechanisms by which small molecules, also known as epigenetic tags, are attached to or removed from a particular gene, affecting the phenotype. Five fundamental elements form the basis of the designed technique: first, a metaphorical representation of Epigenetic Tags as binary strings; second, a layer on chromosome top structure used to bind the tags (the Epigenotype layer); third, a Marking Function to add, remove, and modify tags; fourth, an Epigenetic Growing Function that acts like an interpreter, or decoder of the tags located over the alleles, in such a way that the phenotypic variations can be reflected when evaluating the individuals; and fifth, a tags inheritance mechanism. A set of experiments are performed for determining the applicability of the proposed approach.
Obfuscated Access and Search Patterns in Searchable Encryption
Venue: arXiv cs.CR 2021
Year: 2021

Searchable Symmetric Encryption (SSE) allows a data owner to securely outsource its encrypted data to a cloud server while maintaining the ability to search over it and retrieve matched documents. Most existing SSE schemes leak which documents are accessed per query, i.e., the so-called access pattern, and thus are vulnerable to attacks that can recover the database or the queried keywords. Current techniques that fully hide access patterns, such as ORAM or PIR, suffer from heavy communication or computational costs, and are not designed with search capabilities in mind. Recently, Chen et al. (INFOCOM'18) proposed an obfuscation framework for SSE that protects the access pattern in a differentially private way with a reasonable utility cost. However, this scheme leaks the so-called search pattern, i.e., how many times a certain query is performed. This leakage makes the proposal vulnerable to certain database and query recovery attacks. In this paper, we propose OSSE (Obfuscated SSE), an SSE scheme that obfuscates the access pattern independently for each query performed. This in turn hides the search pattern and makes our scheme resistant against attacks that rely on this leakage. Under certain reasonable assumptions, our scheme has smaller communication overhead than ORAM-based SSE. Furthermore, our scheme works in a single communication round and requires very small constant client-side storage. Our empirical evaluation shows that OSSE is highly effective at protecting against different query recovery attacks while keeping a reasonable utility level. Our protocol provides significantly more protection than the proposal by Chen et al.~against some state-of-the-art attacks, which demonstrates the importance of hiding search patterns in designing effective privacy-preserving SSE schemes.
MUDES: Multilingual Detection of Offensive Spans
Venue: arXiv cs.CL 2021
Year: 2021

The interest in offensive content identification in social media has grown substantially in recent years. Previous work has dealt mostly with post level annotations. However, identifying offensive spans is useful in many ways. To help coping with this important challenge, we present MUDES, a multilingual system to detect offensive spans in texts. MUDES features pre-trained models, a Python API for developers, and a user-friendly web-based interface. A detailed description of MUDES' components is presented in this paper.
Semantics and Axiomatization for Stochastic Differential Dynamic Logic
Venue: arXiv cs.LO 2021
Year: 2021

Building on previous work by André Platzer, we present a formal language for Stochastic Differential Dynamic Logic, and define its semantics, axioms and inference rules. Compared to the previous effort, our account of the Stochastic Differential Dynamic Logic follows closer to and is more compatible with the traditional account of the regular Differential Dynamic Logic. We resolve an issue with the well-definedness of the original work's semantics, while showing how to make the logic more expressive by incorporating nondeterministic choice, definite descriptions and differential terms. Definite descriptions necessitate using a three-valued truth semantics. We also give the first Uniform Substitution calculus for Stochastic Differential Dynamic Logic, making it more practical to implement in proof assistants.
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints
Venue: arXiv cs.DS 2021
Year: 2021

We give improved multi-pass streaming algorithms for the problem of maximizing a monotone or arbitrary non-negative submodular function subject to a general $p$-matchoid constraint in the model in which elements of the ground set arrive one at a time in a stream. The family of constraints we consider generalizes both the intersection of $p$ arbitrary matroid constraints and $p$-uniform hypergraph matching. For monotone submodular functions, our algorithm attains a guarantee of $p+1+\varepsilon$ using $O(p/\varepsilon)$-passes and requires storing only $O(k)$ elements, where $k$ is the maximum size of feasible solution. This immediately gives an $O(1/\varepsilon)$-pass $(2+\varepsilon)$-approximation algorithms for monotone submodular maximization in a matroid and $(3+\varepsilon)$-approximation for monotone submodular matching. Our algorithm is oblivious to the choice $\varepsilon$ and can be stopped after any number of passes, delivering the appropriate guarantee. We extend our techniques to obtain the first multi-pass streaming algorithm for general, non-negative submodular functions subject to a $p$-matchoid constraint with a number of passes independent of the size of the ground set and $k$. We show that a randomized $O(p/\varepsilon)$-pass algorithm storing $O(p^3k\log(k)/\varepsilon^3)$ elements gives a $(p+1+\barγ+O(\varepsilon))$-approximation, where $\bar{gamma}$ is the guarantee of the best-known offline algorithm for the same problem.
Fixing Errors of the Google Voice Recognizer through Phonetic Distance Metrics
Venue: arXiv cs.CL 2021
Year: 2021

Speech recognition systems for the Spanish language, such as Google's, produce errors quite frequently when used in applications of a specific domain. These errors mostly occur when recognizing words new to the recognizer's language model or ad hoc to the domain. This article presents an algorithm that uses Levenshtein distance on phonemes to reduce the speech recognizer's errors. The preliminary results show that it is possible to correct the recognizer's errors significantly by using this metric and using a dictionary of specific phrases from the domain of the application. Despite being designed for particular domains, the algorithm proposed here is of general application. The phrases that must be recognized can be explicitly defined for each application, without the algorithm having to be modified. It is enough to indicate to the algorithm the set of sentences on which it must work. The algorithm's complexity is $O(tn)$, where $t$ is the number of words in the transcript to be corrected, and $n$ is the number of phrases specific to the domain.
Convolutional Normalization
Venue: arXiv cs.LG 2021
Year: 2021

As the deep neural networks are being applied to complex tasks, the size of the networks and architecture increases and their topology becomes more complicated too. At the same time, training becomes slow and at some instances inefficient. This motivated the introduction of various normalization techniques such as Batch Normalization and Layer Normalization. The aforementioned normalization methods use arithmetic operations to compute an approximation statistics (mainly the first and second moments) of the layer's data and use it to normalize it. The aforementioned methods use plain Monte Carlo method to approximate the statistics and such method fails when approximating the statistics whose distribution is complex. Here, we propose an approach that uses weighted sum, implemented using depth-wise convolutional neural networks, to not only approximate the statistics, but to learn the coefficients of the sum.
Fortify Machine Learning Production Systems: Detect and Classify Adversarial Attacks
Venue: arXiv cs.LG 2021
Year: 2021

Production machine learning systems are consistently under attack by adversarial actors. Various deep learning models must be capable of accurately detecting fake or adversarial input while maintaining speed. In this work, we propose one piece of the production protection system: detecting an incoming adversarial attack and its characteristics. Detecting types of adversarial attacks has two primary effects: the underlying model can be trained in a structured manner to be robust from those attacks and the attacks can be potentially filtered out in real-time before causing any downstream damage. The adversarial image classification space is explored for models commonly used in transfer learning.
Tight Trade-off in Contention Resolution without Collision Detection
Venue: arXiv cs.DC 2021
Year: 2021

In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to send. In each time slot, each node may attempt to broadcast its message or remain idle. If a single node broadcasts in a slot, the message is received by all nodes; otherwise, if multiple nodes broadcast simultaneously, a collision occurs and none succeeds. If collision detection is available, nodes can differentiate collision and silence (i.e., no nodes broadcast). Performance of contention resolution algorithms is often measured by throughput -- the number of successful transmissions within a period of time; whereas robustness is often measured by jamming resistance -- a jammed slot always generates a collision. Previous work has shown, with collision detection, optimal constant throughput can be attained, even if a constant fraction of all slots are jammed. The situation when collision detection is not available, however, remains unclear. In a recent breakthrough paper [Bender et al., STOC '20], a crucial case is resolved: constant throughput is possible without collision detection, but only if there is no jamming. Nonetheless, the exact trade-off between the best possible throughput and the severity of jamming remains unknown. In this paper, we address this open question. Specifically, for any level of jamming ranging from none to constant fraction, we prove an upper bound on the best possible throughput, along with an algorithm attaining that bound. An immediate and interesting implication of our result is, when a constant fraction of all slots are jammed, which is the worst-case scenario, there still exists an algorithm achieving a decent throughput: $Θ(t/\log{t})$ messages could be successfully transmitted within $t$ slots.
Personality Profiles of Global Software Developers
Venue: arXiv cs.SE 2021
Year: 2021

Context: Individuals' personality traits have been shown to influence their behavior during team work. In particular, positive group attitudes are said to be essential for distributed and global software development efforts where collaboration is critical to project success. Objective: Given this, we have sought to study the influence of global software practitioners' personality profiles from a psycholinguistic perspective. Method: Artifacts from ten teams were selected from the IBM Rational Jazz repository and mined. We employed social network analysis (SNA) techniques to identify and group practitioners into two clusters based on the numbers of messages they communicated, Top Members and Others, and used standard statistical techniques to assess practitioners' engagement in task changes associated with work items. We then performed psycholinguistic analysis on practitioners' messages using linguistic dimensions of the LIWC tool that had been previously correlated with the Big Five personality profiles. Results: For our sample of 146 practitioners, we found that the Top Members demonstrated more openness to experience than the Other practitioners. Additionally, practitioners involved in usability-related tasks were found to be highly extroverted, and coders were most neurotic and conscientious. Conclusion: High levels of organizational and inter-personal skills may be useful for those operating in distributed settings, and personality diversity is likely to boost team performance.