Miracle-dz/UniFAR-FTUs huggingface dataset:
Restoring the structure: A modular analysis of ego-driven organizational networks

Organizational network analysis (ONA) is a method for studying interactions within formal organizations. The utility of ONA has grown substantially over the years as means to analyze the relationships developed within and between teams, departments, and other organizational units. The mapping and quantifying of these relationships have been shown to provide insight into the exchange of information and resources, the building of social capital, and the spread of culture within and between organizations. However, the ethical concerns regarding personally identifiable information (PII) that exist for traditional social science research are made more pertinent in ONA, as the relational nature of the network may leave participants open to identification by organization management. To address this, we propose a method of generating a network of organizational groups (e.g. units, departments, teams) through the projection of ego-networks absent of PII. We validate this method through modular analysis of the resulting networks and compare the identified structure to a known structure of the organization. The methodology lays a foundation for performing ONA that needs only anonymous ego-centric data to identify large-scale aspects of organizational structures.
Interatomic potential theory on the phase transition of charge density wave in transition metal dichalcogenides

Patterns and periods of charge density waves (CDW) in transition metal dichalcogenides exhibit complex phase diagrams that depend on pressure, temperature, metal intercalation, or chalcogen alloying. The phase diagrams have been understood in the context of phenomenological Landau free energy model, but the microscopic mechanisms underlying them are still not clear. Here, we present a new microscopic theory based on the interatomic potential, and have explicitly calculated temperature-dependent phase diagrams using the interatomic potential extracted from first-principles calculations. With detailed atomic structures, the calculated phase diagram of monolayer H-TaSe2 successfully reproduces the experimental features such as commensurate lock-in and stripe phase. Our work shows the complex behaviors of charge density wave are originated from the relatively simple structure of the interatomic potential and elucidates the role of lattice anharmonicity on the CDW phase transition.
The $4 \times 4$ minors of a $5 \times 5$ symmetric matrix are a tropical basis

The r×r minors of anm×nmatrix of variables are a tropical basis if r = 2, 3, or min(m,n). They are not form a tropical basis if 4 < r < min(m,n). The r = 4 case is special. The 4 × 4 minors of an m × n matrix of variables are a tropical basis if min(m,n) ≤ 6, but otherwise not. The r = 4 case is exceptional for symmetric matrices as well. In this paper we prove the 4 × 4 minors of a symmetric 5 × 5 matrix of variables form a tropical basis, and develop a method that might generalize to larger symmetric matrices. The paper begins with a review of the basic concepts from tropical geometry that we will use. It then introduces a technique called ”the method of joints”, and uses it to prove the 4× 4 minors of a symmetric 5× 5 matrix of indeterminates form a tropical basis. The paper concludes with an explanation for why the 4× 4 minors of an n×n symmetric matrix of indeterminates do not form a tropical basis for n > 12, and why the author conjectures they do when n ≤ 12. A note on notation. When denoting the element in row i and column j of a matrix these indices will be separated by a comma, so for example Ai,j is element (i, j) of the matrix A. The notation Aij refers to the submatrix formed from A be removing row i and column j. Unless stated otherwise, the columns and rows of a submatrix inherit their indices from the larger matrix. So, if A is a 5 × 5 matrix the principal submatrix A33 has columns and rows labeled sequentially 1, 2, 4, 5. The author would like to thank the mathematics department of the University of Utah for support during the research for this paper, and in particular his advisor Aaron Bertram.
Multi-Stage Episodic Control for Strategic Exploration in Text Games

Text adventure games present unique challenges to reinforcement learning methods due to their combinatorially large action spaces and sparse rewards. The interplay of these two factors is particularly demanding because large action spaces require extensive exploration, while sparse rewards provide limited feedback. This work proposes to tackle the explore-vs-exploit dilemma using a multi-stage approach that explicitly disentangles these two strategies within each episode. Our algorithm, called eXploit-Then-eXplore (XTX), begins each episode using an exploitation policy that imitates a set of promising trajectories from the past, and then switches over to an exploration policy aimed at discovering novel actions that lead to unseen state spaces. This policy decomposition allows us to combine global decisions about which parts of the game space to return to with curiosity-based local exploration in that space, motivated by how a human may approach these games. Our method significantly outperforms prior approaches by 27% and 11% average normalized score over 12 games from the Jericho benchmark (Hausknecht et al., 2020) in both deterministic and stochastic settings, respectively. On the game of Zork1, in particular, XTX obtains a score of 103, more than a 2x improvement over prior methods, and pushes past several known bottlenecks in the game that have plagued previous state-of-the-art methods.
Interactive Attention AI to translate low light photos to captions for night scene understanding in women safety

There is amazing progress in Deep Learning based models for Image captioning and Low Light image enhancement. For the first time in literature, this paper develops a Deep Learning model that translates night scenes to sentences, opening new possibilities for AI applications in the safety of visually impaired women. Inspired by Image Captioning and Visual Question Answering, a novel Interactive Image Captioning is developed. A user can make the AI focus on any chosen person of interest by influencing the attention scoring. Attention context vectors are computed from CNN feature vectors and user-provided start word. The Encoder-Attention-Decoder neural network learns to produce captions from low brightness images. This paper demonstrates how women safety can be enabled by researching a novel AI capability in the Interactive Vision-Language model for perception of the environment in the night.
A Gradient Mapping Guided Explainable Deep Neural Network for Extracapsular Extension Identification in 3D Head and Neck Cancer Computed Tomography Images

BACKGROUND Diagnosis and treatment management for head and neck squamous cell carcinoma (HNSCC) is guided by routine diagnostic head and neck computed tomography (CT) scans to identify tumor and lymph node features. The extracapsular extension (ECE) is a strong predictor of patients' survival outcomes with HNSCC. It is essential to detect the occurrence of ECE as it changes staging and treatment planning for patients. Current clinical ECE detection relies on visual identification and pathologic confirmation conducted by clinicians. However, manual annotation of the lymph node region is a required data preprocessing step in most of the current machine learning-based ECE diagnosis studies. PURPOSE In this paper, we propose a Gradient Mapping Guided Explainable Network (GMGENet) framework to perform ECE identification automatically without requiring annotated lymph node region information. METHODS The gradient-weighted class activation mapping (Grad-CAM) technique is applied to guide the deep learning algorithm to focus on the regions that are highly related to ECE. The proposed framework includes an extractor and a classifier. In a joint training process, informative volumes of interest (VOIs) are extracted by the extractor without labeled lymph node region information, and the classifier learns the pattern to classify the extracted VOIs into ECE positive and negative. RESULTS In evaluation, the proposed methods are well-trained and tested using cross-validation. GMGENet achieved test accuracy and area under the curve (AUC) of 92.2% and 89.3%, respectively. GMGENetV2 achieved 90.3% accuracy and 91.7% AUC in the test. The results were compared with different existing models and further confirmed and explained by generating ECE probability heatmaps via a Grad-CAM technique. The presence or absence of ECE has been analyzed and correlated with ground truth histopathological findings. CONCLUSIONS The proposed deep network can learn meaningful patterns to identify ECE without providing lymph node contours. The introduced ECE heatmaps will contribute to the clinical implementations of the proposed model and reveal unknown features to radiologists. The outcome of this study is expected to promote the implementation of explainable artificial intelligence-assiste ECE detection.
Detailed Facial Geometry Recovery from Multi-view Images by Learning an Implicit Function

Recovering detailed facial geometry from a set of calibrated multi-view images is valuable for its wide range of applications. Traditional multi-view stereo (MVS) methods adopt an optimization-based scheme to regularize the matching cost. Recently, learning-based methods integrate all these into an end-to-end neural network and show superiority of efficiency. In this paper, we propose a novel architecture to recover extremely detailed 3D faces within dozens of seconds. Unlike previous learning-based methods that regularize the cost volume via 3D CNN, we propose to learn an implicit function for regressing the matching cost. By fitting a 3D morphable model from multi-view images, the features of multiple images are extracted and aggregated in the mesh-attached UV space, which makes the implicit function more effective in recovering detailed facial shape. Our method outperforms SOTA learning-based MVS in accuracy by a large margin on the FaceScape dataset. The code and data are released in https://github.com/zhuhao-nju/mvfr.
The parental active model: A unifying stochastic description of self-propulsion.

We propose a new overarching model for self-propelled particles that flexibly generates a full family of "descendants. " The general dynamics introduced in this paper, which we denote as the "parental" active model (PAM), unifies two special cases commonly used to describe active matter, namely, active Brownian particles (ABPs) and active Ornstein-Uhlenbeck particles (AOUPs). We thereby document the existence of a deep and close stochastic relationship between them, resulting in the subtle balance between fluctuations in the magnitude and direction of the self-propulsion velocity. Besides illustrating the relation between these two common models, the PAM can generate additional offsprings, interpolating between ABP and AOUP dynamics, that could provide more suitable models for a large class of living and inanimate active matter systems, possessing characteristic distributions of their self-propulsion velocity. Our general model is evaluated in the presence of a harmonic external confinement. For this reference example, we present a two-state phase diagram that sheds light on the transition in the shape of the positional density distribution from a unimodal Gaussian for AOUPs to a Mexican-hat-like profile for ABPs.
An approach to interfacing the brain with quantum computers: practical steps and caveats

We report on the first proof-of-concept system demonstrating how one can control a qubit with mental activity. We developed a method to encode neural correlates of mental activity as instructions for a quantum computer. Brain signals are detected utilizing electrodes placed on the scalp of a person, who learns how to produce the required mental activity to issue instructions to rotate and measure a qubit. Currently, our proof-of-concept runs on a software simulation of a quantum computer. At the time of writing, available quantum computing hardware and brain activity sensing technology are not sufficiently developed for real-time control of quantum states with the brain. But we are one step closer to interfacing the brain with real quantum machines, as improvements in hardware technology at both fronts become available in time to come. The paper ends with a discussion on some of the challenging problems that need to be addressed before we can interface the brain with quantum hardware.
Identifying the exterior image of buildings on a 3D map and extracting elevation information using deep learning and digital image processing

Despite the fact that architectural administration information in Korea has been providing high-quality information for a long period of time, the level of utility of the information is not high because it focuses on administrative information. While this is the case, a three-dimensional (3D) map with higher resolution has emerged along with the technological development. However, it cannot function better than visual transmission, as it includes only image information focusing on the exterior of the building. If information related to the exterior of the building can be extracted or identified from a 3D map, it is expected that the utility of the information will be more valuable as the national architectural administration information can then potentially be extended to include such information regarding the building exteriors to the level of BIM(Building Information Modeling). This study aims to present and assess a basic method of extracting information related to the appearance of the exterior of a building for the purpose of 3D mapping using deep learning and digital image processing. After extracting and preprocessing images from the map, information was identified using the Fast R-CNN(Regions with Convolutional Neuron Networks) model. The information was identified using the Faster R-CNN model after extracting and preprocessing images from the map. As a result, it showed approximately 93% and 91% accuracy in terms of detecting the elevation and window parts of the building, respectively, as well as excellent performance in an experiment aimed at extracting the elevation information of the building. Nonetheless, it is expected that improved results will be obtained by supplementing the probability of mixing the false detection rate or noise data caused by the misunderstanding of experimenters in relation to the unclear boundaries of windows.
A Heterogeneous In-Memory Computing Cluster for Flexible End-to-End Inference of Real-World Deep Neural Networks

Deployment of modern TinyML tasks on small battery-constrained IoT devices requires high computational energy efficiency. Analog In-Memory Computing (IMC) using non-volatile memory (NVM) promises major efficiency improvements in deep neural network (DNN) inference and serves as on-chip memory storage for DNN weights. However, IMC’s functional flexibility limitations and their impact on performance, energy, and area efficiency are not yet fully understood at the system level. To target practical end-to-end IoT applications, IMC arrays must be enclosed in heterogeneous programmable systems, introducing new system-level challenges which we aim at addressing in this work. We present a heterogeneous tightly-coupled clustered architecture integrating 8 RISC-V cores, an in-memory computing accelerator (IMA), and digital accelerators. We benchmark the system on a highly heterogeneous workload such as the Bottleneck layer from a MobileNetV2, showing $11.5\times $ performance and $9.5\times $ energy efficiency improvements, compared to highly optimized parallel execution on the cores. Furthermore, we explore the requirements for end-to-end inference of a full mobile-grade DNN (MobileNetV2) in terms of IMC array resources, by scaling up our heterogeneous architecture to a multi-array accelerator. Our results show that our solution, on the end-to-end inference of the MobileNetV2, is one order of magnitude better in terms of execution latency than existing programmable architectures and two orders of magnitude better than state-of-the-art heterogeneous solutions integrating in-memory computing analog cores.
Towards Transferable Unrestricted Adversarial Examples with Minimum Changes

Transfer-based adversarial example is one of the most important classes of black-box attacks. However, there is a trade-off between transferability and imperceptibility of the adversarial perturbation. Prior work in this direction of-ten requires a fixed but large $l$ p-norm perturbation budget to reach a good transfer success rate, leading to perceptible adversarial perturbations. On the other hand, most of the current unrestricted adversarial attacks that aim to generate semantic-preserving perturbations suffer from weaker transferability to the target model. In this work, we propose a geometry-aware framework to generate transferable adversarial examples with minimum changes. Analogous to model selection in statistical machine learning, we leverage a validation model to select the best perturbation budget for each image under both the $\ell_{\infty}$ ‘ norm and unrestricted threat models. We propose a principled method for the partition of training and validation models by encouraging intra-group diversity while penalizing extra-group similarity. Extensive experiments verify the effectiveness of our framework on balancing imperceptibility and transferability of the crafted adversarial examples. The methodology is the foundation of our entry to the CVPR'21 Security AI Challenger: Unrestricted Adversarial Attacks on ImageNet, in which we ranked 1st place out of 1,559 teams and surpassed the runner-up submissions by 4.59% and 23.91% in terms of final score and average image quality level, respectively. Code is available at https://github.com/Equationliu/GA-Attack.
Gradient descent dynamics and the jamming transition in infinite dimensions

Gradient descent dynamics in complex energy landscapes, i.e. featuring multiple minima, finds application in many different problems, from soft matter to machine learning. Here, we analyze one of the simplest examples, namely that of soft repulsive particles in the limit of infinite spatial dimension d. The gradient descent dynamics then displays a jamming transition: at low density, it reaches zero-energy states in which particles’ overlaps are fully eliminated, while at high density the energy remains finite and overlaps persist. At the transition, the dynamics becomes critical. In the d → ∞ limit, a set of self-consistent dynamical equations can be derived via mean field theory. We analyze these equations and we present some partial progress towards their solution. We also study the random Lorentz gas in a range of d = 2…22, and obtain a robust estimate for the jamming transition in d → ∞. The jamming transition is analogous to the capacity transition in supervised learning, and in the appendix we discuss this analogy in the case of a simple one-layer fully-connected perceptron.
Modelling Cournot Games as Multi-agent Multi-armed Bandits

We investigate the use of a multi-agent multi-armed bandit (MA-MAB) setting for modeling repeated Cournot oligopoly games, where the firms acting as agents choose from the set of arms representing production quantity (a discrete value). Agents interact with separate and independent bandit problems. In this formulation, each agent makes sequential choices among arms to maximize its own reward. Agents do not have any information about the environment; they can only see their own rewards after taking an action. However, the market demand is a stationary function of the total industry output, and random entry or exit from the market is not allowed. Given these assumptions, we found that an ε-greedy approach offers a more viable learning mechanism than other traditional MAB approaches, as it does not require any additional knowledge of the system to operate. We also propose two novel approaches that take advantage of the ordered action space: ε-greedy+HL and ε-greedy+EL. These new approaches help firms to focus on more profitable actions by eliminating less profitable choices and hence are designed to optimize the exploration. We use computer simulations to study the emergence of various equilibria in the outcomes and do the empirical analysis of joint cumulative regrets.
THE HISTORY OF THE OBSERVATORY LIBRARY AT ØSTERVOLD IN COPENHAGEN, DENMARK

About fifty years after the work that astronomer Tycho Brahe carried out while living on the island of Hven had made him world famous, King Christian IV of Denmark built the Trinity Buildings in Copenhagen. The Tower observatory was opened in 1642, and it housed the astronomers from the University of Copenhagen until 1861 when a new, modern observatory was built at {\O}stervold in the eastern part of the city. In 1996, all the University astronomers from the observatories at {\O}stervold and the small town of Brorfelde were relocated to the Rockefeller Buildings at {\O}sterbro, and the two observatories were closed. In this paper we focus on the library at the observatory in {\O}stervold, and its subsequent fate following the close-down of that observatory.
Symptoms of Architecture Erosion in Code Reviews: A Study of Two OpenStack Projects

The phenomenon of architecture erosion can negatively impact the maintenance and evolution of software systems, and manifest in a variety of symptoms during software development. While erosion is often considered rather late, its symptoms can act as early warnings to software developers, if detected in time. In addition to static source code analysis, code reviews can be a source of detecting erosion symptoms and subsequently taking action. In this study, we investigate the erosion symptoms discussed in code reviews, as well as their trends, and the actions taken by developers. Specifically, we conducted an empirical study with the two most active Open Source Software (OSS) projects in the OpenStack community (i.e., Nova and Neutron). We manually checked 21,274 code review comments retrieved by keyword search and random selection, and identified 502 code review comments (from 472 discussion threads) that discuss erosion. Our findings show that (1) the proportion of erosion symptoms is rather low, yet notable in code reviews and the most frequently identified erosion symptoms are architectural violation, duplicate functionality, and cyclic dependency; (2) the declining trend of the identified erosion symptoms in the two OSS projects indicates that the architecture tends to stabilize over time; and (3) most code reviews that identify erosion symptoms have a positive impact on removing erosion symptoms, but a few symptoms still remain and are ignored by developers. The results suggest that (1) code review provides a practical way to reduce erosion symptoms; and (2) analyzing the trend of erosion symptoms can help get an insight about the erosion status of software systems, and subsequently avoid the potential risk of architecture erosion.