Miracle-dz/UniFAR-FTUs huggingface dataset:
Maintaining Light Spanners via Minimal Updates

We study the problem of maintaining a lightweight bounded-degree $(1+\varepsilon)$-spanner of a dynamic point set in a $d$-dimensional Euclidean space, where $\varepsilon>0$ and $d$ are arbitrary constants. In our fully-dynamic setting, points are allowed to be inserted as well as deleted, and our objective is to maintain a $(1+\varepsilon)$-spanner that has constant bounds on its maximum degree and its lightness (the ratio of its weight to that of the minimum spanning tree), while minimizing the recourse, which is the number of edges added or removed by each point insertion or deletion. We present a fully-dynamic algorithm that handles point insertion with amortized constant recourse and point deletion with amortized $O(\log\Delta)$ recourse, where $\Delta$ is the aspect ratio of the point set.
Cobweb: An Incremental and Hierarchical Model of Human-Like Category Learning

Cobweb, a human like category learning system, differs from other incremental categorization models in constructing hierarchically organized cognitive tree-like structures using the category utility measure. Prior studies have shown that Cobweb can capture psychological effects such as the basic level, typicality, and fan effects. However, a broader evaluation of Cobweb as a model of human categorization remains lacking. The current study addresses this gap. It establishes Cobweb's alignment with classical human category learning effects. It also explores Cobweb's flexibility to exhibit both exemplar and prototype like learning within a single model. These findings set the stage for future research on Cobweb as a comprehensive model of human category learning.
In the Search of Optimal Tree Networks: Hardness and Heuristics

Demand-aware communication networks are networks whose topology is optimized toward the traffic they need to serve. These networks have recently been enabled by novel optical communication technologies and are investigated intensively in the context of datacenters. In this work, we consider networks with one of the most common topologies~ -- a binary tree. We show that finding an optimal demand-aware binary tree network is NP-hard. Then, we propose optimization algorithms that generate efficient binary tree networks on real-life and synthetic workloads.
Leveraging The Finite States of Emotion Processing to Study Late-Life Mental Health

Traditional approaches in mental health research apply General Linear Models (GLM) to describe the longitudinal dynamics of observed psycho-behavioral measurements (questionnaire summary scores). Similarly, GLMs are also applied to characterize relationships between neurobiological measurements (regional fMRI signals) and perceptual stimuli or other regional signals. While these methods are useful for exploring linear correlations among the isolated signals of those constructs (i.e., summary scores or fMRI signals), these classical frameworks fall short in providing insights into the comprehensive system-level dynamics underlying observable changes. Hidden Markov Models (HMM) are a statistical model that enable us to describe the sequential relations among multiple observable constructs, and when applied through the lens of Finite State Automata (FSA), can provide a more integrated and intuitive framework for modeling and understanding the underlying controller (the prescription for how to respond to inputs) that fundamentally defines any system, as opposed to linearly correlating output signals produced by the controller. We present a simple and intuitive HMM processing pipeline vcHMM (See Preliminary Data) that highlights FSA theory and is applicable for both behavioral analysis of questionnaire data and fMRI data. HMMs offer theoretic promise as they are computationally equivalent to the FSA, the control processor of a Turing Machine (TM) The dynamic programming Viterbi algorithm is used to leverage the HMM model. It efficiently identifies the most likely sequence of hidden states. The vcHMM pipeline leverages this grammar to understand how behavior and neural activity relate to depression.
RADIA -- Radio Advertisement Detection with Intelligent Analytics

Radio advertising remains an integral part of modern marketing strategies, with its appeal and potential for targeted reach undeniably effective. However, the dynamic nature of radio airtime and the rising trend of multiple radio spots necessitates an efficient system for monitoring advertisement broadcasts. This study investigates a novel automated radio advertisement detection technique incorporating advanced speech recognition and text classification algorithms. RadIA's approach surpasses traditional methods by eliminating the need for prior knowledge of the broadcast content. This contribution allows for detecting impromptu and newly introduced advertisements, providing a comprehensive solution for advertisement detection in radio broadcasting. Experimental results show that the resulting model, trained on carefully segmented and tagged text data, achieves an F1-macro score of 87.76 against a theoretical maximum of 89.33. This paper provides insights into the choice of hyperparameters and their impact on the model's performance. This study demonstrates its potential to ensure compliance with advertising broadcast contracts and offer competitive surveillance. This groundbreaking research could fundamentally change how radio advertising is monitored and open new doors for marketing optimization.
Spectral Phase Transition and Optimal PCA in Block-Structured Spiked models

We discuss the inhomogeneous spiked Wigner model, a theoretical framework recently introduced to study structured noise in various learning scenarios, through the prism of random matrix theory, with a specific focus on its spectral properties. Our primary objective is to find an optimal spectral method and to extend the celebrated \cite{BBP} (BBP) phase transition criterion -- well-known in the homogeneous case -- to our inhomogeneous, block-structured, Wigner model. We provide a thorough rigorous analysis of a transformed matrix and show that the transition for the appearance of 1) an outlier outside the bulk of the limiting spectral distribution and 2) a positive overlap between the associated eigenvector and the signal, occurs precisely at the optimal threshold, making the proposed spectral method optimal within the class of iterative methods for the inhomogeneous Wigner problem.
Stabilization via localized controls in nonlocal models of crowd dynamics

We consider a control system driven by a nonlocal continuity equation. Admissible controls are Lipschitz vector fields acting inside a fixed open set. We demonstrate that small perturbations of the initial measure, traced along Wasserstein geodesics, may be neutralized by admissible controls. More specifically, initial perturbations of order $\varepsilon$ can be reduced to order $\varepsilon^{1+\kappa}$, where $\kappa$ is a positive constant.
Book2Dial: Generating Teacher-Student Interactions from Textbooks for Cost-Effective Development of Educational Chatbots

Educational chatbots are a promising tool for assisting student learning. However, the development of effective chatbots in education has been challenging, as high-quality data is seldom available in this domain. In this paper, we propose a framework for generating synthetic teacher-student interactions grounded in a set of textbooks. Our approaches capture one aspect of learning interactions where curious students with partial knowledge interactively ask a teacher questions about the material in the textbook. We highlight various quality criteria that such dialogues should fulfill and compare several approaches relying on either prompting or fine-tuning large language models. We use synthetic dialogues to train educational chatbots and show benefits of further fine-tuning in different educational domains. However, human evaluation shows that our best data synthesis method still suffers from hallucinations and tends to reiterate information from previous conversations. Our findings offer insights for future efforts in synthesizing conversational data that strikes a balance between size and quality. We will open-source our data and code.
More Sample-Efficient Tuning of Particle Accelerators with Bayesian Optimization and Prior Mean Models

Tuning particle accelerators is a challenging and time-consuming task, but can be automated and carried out efficiently through the use of suitable optimization algorithms. With successful applications at various facilities, Bayesian optimization using Gaussian process modeling has proven to be a particularly powerful tool to address these challenges in practice. One of its major benefits is that it allows incorporating prior information, such as knowledge about the shape of the objective function or predictions based on archived data, simulations or surrogate models, into the model. In this work, we propose the use of a neural network model as an efficient way to include prior knowledge about the objective function into the Bayesian optimization process to speed up convergence. We report results obtained in simulations and experiments using neural network priors to perform optimization of electron and heavy-ion accelerator facilities, specifically the Linac Coherent Light Source and the Argonne Tandem Linear Accelerator System. Finally, we evaluate how the accuracy of the prior mean predictions affect optimization performance.
Deep Configuration Performance Learning: A Systematic Survey and Taxonomy

Performance is arguably the most crucial attribute that reflects the behavior of a configurable software system. However, given the increasing scale and complexity of modern software, modeling and predicting how various configurations can impact performance becomes one of the major challenges in software maintenance. As such, performance is often modeled without having a thorough knowledge of the software system, but relying mainly on data, which fits precisely with the purpose of deep learning. In this paper, we conduct a comprehensive review exclusively on the topic of deep learning for performance learning of configurable software, covering 948 searched papers spanning six indexing services, based on which 85 primary papers were extracted and analyzed. Our results summarize the key topics and statistics on how the configuration data is prepared; how the deep configuration performance learning model is built; how the model is evaluated and how they are exploited in different tasks related to software configuration. We also identify the good practice and the potentially problematic phenomena from the studies surveyed, together with insights on future opportunities for the field. To promote open science, all the raw results of this survey can be accessed at our repository: https://github.com/ideas-labo/DCPL-SLR.
Harvest control rule vs optimal harvesting of an age-structured population: The case of the Ibero-Atlantic Sardine Fishery

In this study we apply an age-structured bio-economic model to the Ibero-Atlantic sardine stock, and compute an optimal harvesting strategy. We compare it with the ongoing harvest control rule, which overlooks economic incentives. We show that the optimal plan entails greater net returns from the fishery, though at a cost of reducing biomass below acceptable reference points. By incorporating precautionary constraints, we find that an optimal plan still yields higher economic returns, while better adhering to stock-recovery objectives.
Fate of the Mollow triplet in strongly-coupled atomic arrays

Subwavelength arrays of quantum emitters have emerged as an interesting platform displaying prominent collective effects. Here we study such arrays under coherent driving, realizing an open quantum many-body problem in a strongly non-linear regime. We show that the combination of dipolar interactions and regular geometry have a dramatic effect on the spectrum of emitted light: the famous Mollow triplet characterizing the emission of a single atom develops a structured broadening with flat sidebands, with a bandwidth determined by the dipolar interactions. This emission spectrum characterizes atomic arrays and distinguishes them from disordered ensembles as well as non-interacting emitters. Our predictions are based on a novel dynamical mean-field theory (DMFT) approach to the problem, paving the way for further studies of these systems.
FingerNet: EEG Decoding of A Fine Motor Imagery with Finger-tapping Task Based on A Deep Neural Network

Brain-computer interface (BCI) technology facilitates communication between the human brain and computers, primarily utilizing electroencephalography (EEG) signals to discern human intentions. Although EEG-based BCI systems have been developed for paralysis individuals, ongoing studies explore systems for speech imagery and motor imagery (MI). This study introduces FingerNet, a specialized network for fine MI classification, departing from conventional gross MI studies. The proposed FingerNet could extract spatial and temporal features from EEG signals, improving classification accuracy within the same hand. The experimental results demonstrated that performance showed significantly higher accuracy in classifying five finger-tapping tasks, encompassing thumb, index, middle, ring, and little finger movements. FingerNet demonstrated dominant performance compared to the conventional baseline models, EEGNet and DeepConvNet. The average accuracy for FingerNet was 0.3049, whereas EEGNet and DeepConvNet exhibited lower accuracies of 0.2196 and 0.2533, respectively. Statistical validation also demonstrates the predominance of FingerNet over baseline networks. For biased predictions, particularly for thumb and index classes, we led to the implementation of weighted cross-entropy and also adapted the weighted cross-entropy, a method conventionally employed to mitigate class imbalance. The proposed FingerNet involves optimizing network structure, improving performance, and exploring applications beyond fine MI. Moreover, the weighted Cross Entropy approach employed to address such biased predictions appears to have broader applicability and relevance across various domains involving multi-class classification tasks. We believe that effective execution of motor imagery can be achieved not only for fine MI, but also for local muscle MI
DIFFUSION OF ION IMPLANTED BORON IN SILICON: THE EFFECTS OF LATTICE DEFECTS AND CO-IMPLANTED IMPURITIES

iii ACKNOWLEDGMENTS After four and a half years of graduate work, I am finally done. The completion of this dissertation has required sacrifice, perseverance, and seemingly endless toil. I have put much effort into this work. I have also received the invaluable support and assistance from my colleagues, friends, and family. Professionally, no one has been a greater help to me than my advisor, Kevin Jones. I would like to thank Dr. Jones for giving me the freedom to explore new ideas and the guidance to see them through to completion. He gave me direction, support, and resources to accomplish this work and to earn my degree. He advised me on everything from scientific writing to career decisions. As an advisor, he provided a safety net of support through learning processes that often involved many iterations of trial and error. In addition to having Dr. Jones as an advisor, I had the privilege of having Mark Law serve as a co-advisor. Dr. Law provided an alternative viewpoint to many issues and was able to advise me on topics that were out of Dr. Jones field of experience. In particular, Dr. Law's input on computer simulations using FLOOPS was instrumental in the completion of those tasks, without his advice I would probably still be debugging an input file. I am very grateful for the support that Dr. Law provided during my graduate career. There have also been many students in the SWAMP group who have assisted me both in general and on specific tasks. Over the years, many of the undergraduate research assistants have helped me prepare samples for TEM and other characterization. I would like to thank Katherine and for the many TEM samples that they helped me prepare. I would also like to thank Kevin Gable in particular for his assistance. Over the last 9 months, Kevin has made close to one hundred TEM samples, diced a couple hundred Hall samples, taken four-point probe measurements, taken Hall measurements and much more. Without his assistance, there is no way that I could have completed the amount of work that I did in the last year of my research. For that I will always be grateful. Lahir Shaik-Adam and Aaron Lilak have also helped me in my research. When I was banging my head against a unix terminal, they helped me fix my codes so that I could perform the simulations …
Optical and spin properties of nitrogen vacancy centers formed along the tracks of high energy heavy ions

Exposure of nitrogen doped diamond to high energy, heavy ions induces formation of vacancy related color centers aligned along the trajectories of the ions. Quasi 1D chains of coupled NV centers with lengths of a few tens of microns can be building blocks for quantum information processing and they provide insights into harsh radiation-matter interactions. Here, we report on color center formation in diamond (1 ppm nitrogen) with 1 GeV gold and uranium ions. Using depth-resolved photoluminescence, we observe direct formation of single vacancy related color centers (GR1 centers) along the ion tracks. Mobile vacancies can form NV-centers with native nitrogen atoms during thermal annealing. Molecular dynamics simulations indicate that both isolated vacancies and defect clusters form along ion trajectory through electronic stopping processes, leading to broad color center profiles that range from the sample surface to a depth of about 25 microns. We quantify the spin properties of NV-centers formed by swift heavy ions through optical detection of magnetic resonance (ODMR) and validate the feasibility of using swift-heavy-ion-generated NV$^{-}$ along quasi 1D chains (for isolated tracks from low fluence irradiations) or in thin sheets of coupled 1D spin chains (formed with higher ion fluences) for NV-based magnetometry and for the exploration of quasi 1D and 2D spin textures in diamond.
TTPXHunter: Actionable Threat Intelligence Extraction as TTPs from Finished Cyber Threat Reports

Understanding the modus operandi of adversaries aids organizations in employing efficient defensive strategies and sharing intelligence in the community. This knowledge is often present in unstructured natural language text within threat analysis reports. A translation tool is needed to interpret the modus operandi explained in the sentences of the threat report and translate it into a structured format. This research introduces a methodology named TTPXHunter for the automated extraction of threat intelligence in terms of Tactics, Techniques, and Procedures (TTPs) from finished cyber threat reports. It leverages cyber domain-specific state-of-the-art natural language processing (NLP) to augment sentences for minority class TTPs and refine pinpointing the TTPs in threat analysis reports significantly. The knowledge of threat intelligence in terms of TTPs is essential for comprehensively understanding cyber threats and enhancing detection and mitigation strategies. We create two datasets: an augmented sentence-TTP dataset of 39,296 samples and a 149 real-world cyber threat intelligence report-to-TTP dataset. Further, we evaluate TTPXHunter on the augmented sentence dataset and the cyber threat reports. The TTPXHunter achieves the highest performance of 92.42% f1-score on the augmented dataset, and it also outperforms existing state-of-the-art solutions in TTP extraction by achieving an f1-score of 97.09% when evaluated over the report dataset. TTPXHunter significantly improves cybersecurity threat intelligence by offering quick, actionable insights into attacker behaviors. This advancement automates threat intelligence analysis, providing a crucial tool for cybersecurity professionals fighting cyber threats.
Quantitative estimates: How well does the discrete Fourier transform approximate the Fourier transform on $\mathbb{R}$

In order to compute the Fourier transform of a function $f$ on the real line numerically, one samples $f$ on a grid and then takes the discrete Fourier transform. We derive exact error estimates for this procedure in terms of the decay and smoothness of $f$. The analysis provides a new recipe of how to relate the number of samples, the sampling interval, and the grid size.
Bi-KVIL: Keypoints-based Visual Imitation Learning of Bimanual Manipulation Tasks

Visual imitation learning has achieved impressive progress in learning unimanual manipulation tasks from a small set of visual observations, thanks to the latest advances in computer vision. However, learning bimanual coordination strategies and complex object relations from bimanual visual demonstrations, as well as generalizing them to categorical objects in novel cluttered scenes remain unsolved challenges. In this paper, we extend our previous work on keypoints-based visual imitation learning (\mbox{K-VIL})~\cite{gao_kvil_2023} to bimanual manipulation tasks. The proposed Bi-KVIL jointly extracts so-called \emph{Hybrid Master-Slave Relationships} (HMSR) among objects and hands, bimanual coordination strategies, and sub-symbolic task representations. Our bimanual task representation is object-centric, embodiment-independent, and viewpoint-invariant, thus generalizing well to categorical objects in novel scenes. We evaluate our approach in various real-world applications, showcasing its ability to learn fine-grained bimanual manipulation tasks from a small number of human demonstration videos. Videos and source code are available at https://sites.google. com/view/bi-kvil.
Multiwinner Elections and the Spoiler Effect

In the popular debate over the use of ranked-choice voting, it is often claimed that the method of single transferable vote (STV) is immune or mostly immune to the so-called ``spoiler effect,'' where the removal of a losing candidate changes the set of winners. This claim has previously been studied only in the single-winner case. We investigate how susceptible STV is to the spoiler effect in multiwinner elections, where the output of the voting method is a committee of size at least two. To evaluate STV we compare it to numerous other voting methods including single non-transferable vote, $k$-Borda, and the Chamberlin-Courant rule. We provide simulation results under three different random models and empirical results using a large database of real-world multiwinner political elections from Scotland. Our results show that STV is not spoiler-proof in any meaningful sense in the multiwinner context, but it tends to perform well relative to other methods, especially when using real-world ballot data.
A Context for Manifold Calculus

We develop Weiss's manifold calculus in the setting of $\infty$-categories, where we allow the target $\infty$-category to be any $\infty$-category with small limits. We will establish the connection between polynomial functors, Kan extensions, and Weiss sheaves, and will classify homogeneous functors. We will also generalize Weiss and Boavida de Brito's theorem to functors taking values in arbitrary $\infty$-categories with small limits.