Miracle-dz/UniFAR-FTUs huggingface dataset:
Data-Driven Identification of Attack-free Sensors in Networked Control Systems

This paper proposes a data-driven framework to identify the attack-free sensors in a networked control system when some of the sensors are corrupted by an adversary. An operator with access to offline input-output attack-free trajectories of the plant is considered. Then, a data-driven algorithm is proposed to identify the attack-free sensors when the plant is controlled online. We also provide necessary conditions, based on the properties of the plant, under which the algorithm is feasible. An extension of the algorithm is presented to identify the sensors completely online against certain classes of attacks. The efficacy of our algorithm is depicted through numerical examples.
Fine-Grained Extraction of Road Networks via Joint Learning of Connectivity and Segmentation

Road network extraction from satellite images is widely applicated in intelligent traffic management and autonomous driving fields. The high-resolution remote sensing images contain complex road areas and distracted background, which make it a challenge for road extraction. In this study, we present a stacked multitask network for end-to-end segmenting roads while preserving connectivity correctness. In the network, a global-aware module is introduced to enhance pixel-level road feature representation and eliminate background distraction from overhead images; a road-direction-related connectivity task is added to ensure that the network preserves the graph-level relationships of the road segments. We also develop a stacked multihead structure to jointly learn and effectively utilize the mutual information between connectivity learning and segmentation learning. We evaluate the performance of the proposed network on three public remote sensing datasets. The experimental results demonstrate that the network outperforms the state-of-the-art methods in terms of road segmentation accuracy and connectivity maintenance.
Fault-tolerant one-way noiseless amplification for microwave bosonic quantum information processing

Microwave quantum information networks require reliable transmission of single photon propagating modes over lossy channels. In this article we propose a microwave noise-less linear amplifier (NLA) suitable to circumvent the losses incurred by a flying photon undergoing an amplitude damping channel (ADC). The proposed model is constructed by engineering a simple one-dimensional four node cluster state. Contrary to conventional NLAs based on quantum scissors (QS), single photon amplification is realized without the need for photon number resolving detectors (PNRDs). Entanglement between nodes comprising the device's cluster is achieved by means of a controlled phase gate (CPHASE). Furthermore, photon measurements are implemented by quantum non demolition detectors (QNDs), which are currently available as a part of circuit quantum electrodynamics (cQED) toolbox. We analyze the performance of our device practically by considering detection inefficiency and dark count probability. We further examine the potential usage of our device in low power quantum sensing applications and remote secret key generation (SKG). Specifically, we demonstrate the device's ability to prepare loss-free resources offline, and its capacity to overcome the repeater-less bound of SKG. We compare the performance of our device against a QS-NLA for the aforementioned applications, and highlight explicitly the operating conditions under which our device can outperform a QS-NLA. The proposed device is also suitable for applications in the optical domain.
Developers’ Leverage, Capital Market Financing, and Fire Sale Externalities: Evidence from the Thai Condominium Market

Leveraged developers facing rollover risk are more likely to engage in fire sales. Using COVID-19 as a natural experiment, we find evidence of fire sale externalities in the Thai condominium market. Resales in properties whose developers have higher leverage ratios have lower listing prices for listed developers (who have access to capital market financing) but not unlisted developers (who primarily use bank financing). We attribute this difference to the flexibility of bank loan renegotiation versus the rigidity of debt capital market repayments and highlight the role of commercial banks in financial intermediation in the presence of information asymmetry.
Anisotropic Signatures: Neutrinos -- Dark Energy Interaction and Its Effect on the Transition from Radiation to Matter, and Dark Energy Dominated Phases

This paper explains the significance of neutrino mass in the cosmic progression from the radiation-dominated phase to matter and subsequently to the dark energy-dominated era. We have put a constraint on the total mass of neutrinos by coupling them with quintessence. For the combination of full data(Pantheon+CMB+BAO+CC), we find $ \sum m_{\nu}<0.101$eV \ \ (95$\% $CL.) and for the relativistic to non-relativistic phase transition redshif ${z_{\rm nr}} = 180$ which is in the matter-dominated era. Our findings confirm that when neutrinos become non-relativistic, the universe transitions from a radiation-dominated era to a matter-dominated era. Coupled neutrinos with quintessence (CQ) have also a significant impact on transitions from a matter-dominated era to a dark energy era. We have shown this effect by investigating the impact of neutrino mass on the bulk flow direction and amplitude of bulk velocity. Moreover, we have discussed the impact of this coupling on the CMB power spectrum to show the anisotropy in the universe. Finally, we have established a link between the quintessence field coupled with neutrinos and the bulk flow, which allowed us to demonstrate that the mass of neutrinos could be the cause of anisotropy in the universe.
Learning to Fly Omnidirectional Micro Aerial Vehicles with an End-To-End Control Network

Overactuated tilt-rotor platforms offer many advantages over traditional fixed-arm drones, allowing the decoupling of the applied force from the attitude of the robot. This expands their application areas to aerial interaction and manipulation, and allows them to overcome disturbances such as from ground or wall effects by exploiting the additional degrees of freedom available to their controllers. However, the overactuation also complicates the control problem, especially if the motors that tilt the arms have slower dynamics than those spinning the propellers. Instead of building a complex model-based controller that takes all of these subtleties into account, we attempt to learn an end-to-end pose controller using reinforcement learning, and show its superior behavior in the presence of inertial and force disturbances compared to a state-of-the-art traditional controller.
The Graph Lottery Ticket Hypothesis: Finding Sparse, Informative Graph Structure

Graph learning methods help utilize implicit relationships among data items, thereby reducing training label requirements and improving task performance. However, determining the optimal graph structure for a particular learning task remains a challenging research problem. In this work, we introduce the Graph Lottery Ticket (GLT) Hypothesis - that there is an extremely sparse backbone for every graph, and that graph learning algorithms attain comparable performance when trained on that subgraph as on the full graph. We identify and systematically study 8 key metrics of interest that directly influence the performance of graph learning algorithms. Subsequently, we define the notion of a"winning ticket"for graph structure - an extremely sparse subset of edges that can deliver a robust approximation of the entire graph's performance. We propose a straightforward and efficient algorithm for finding these GLTs in arbitrary graphs. Empirically, we observe that performance of different graph learning algorithms can be matched or even exceeded on graphs with the average degree as low as 5.
Large Spin Stern-Gerlach Interferometry for Gravitational Entanglement

Recently, there has been a proposal to test the quantum nature of gravity in the laboratory by witnessing the growth of entanglement between two masses in spatial quantum superpositions. The required superpositions can be created via Stern-Gerlach interferometers, which couple an embedded spin qubit quantum state to the spatial dynamics of each mass. The masses would entangle only if gravity is quantum in nature. Here, we generalise the experiment to an arbitrary spin $j$ or equivalently to an ensemble of uniformly coupled spins. We first exemplify how to create a generalized Stern-Gerlach interferometer, which splits the mass into $2j+1$ trajectories. This shows that a controlled protocol can be formulated to encode the amplitudes of any spin state to a spatial superposition. Secondly, two masses in spatial superpositions of the above form are left to interact via gravity, and the entanglement is computed. Different families of initial spin states are varied to find the optimal spin state that maximizes the entanglement. We conclude that larger spins can offer a modest advantage in enhancing gravity-induced entanglement.
VOODOO 3D: Volumetric Portrait Disentanglement for One-Shot 3D Head Reenactment

We present a 3D-aware one-shot head reenactment method based on a fully volumetric neural disentanglement framework for source appearance and driver expressions. Our method is real-time and produces high-fidelity and view-consistent output, suitable for 3D teleconferencing systems based on holographic displays. Existing cutting-edge 3D-aware reenactment methods often use neural radiance fields or 3D meshes to produce view-consistent appearance encoding, but, at the same time, they rely on linear face models, such as 3DMM, to achieve its disentanglement with facial expressions. As a result, their reenactment results often exhibit identity leakage from the driver or have unnatural expressions. To address these problems, we propose a neural self-supervised disentanglement approach that lifts both the source image and driver video frame into a shared 3D volumetric representation based on tri-planes. This representation can then be freely manipulated with expression tri-planes extracted from the driving images and rendered from an arbitrary view using neural radiance fields. We achieve this disentanglement via self-supervised learning on a large in-the-wild video dataset. We further introduce a highly effective fine-tuning approach to improve the generalizability of the 3D lifting using the same real-world data. We demonstrate state-of-the-art performance on a wide range of datasets, and also showcase high-quality 3D-aware head reenactment on highly challenging and diverse subjects, including non-frontal head poses and complex expressions for both source and driver.
A stacked ensemble learning IDS model for Software-defined VANET

Intrusion Detection Systems (IDS) are widely employed to detect and mitigate external network security events. VANETs (Vehicle ad-hoc Networks) are evolving, especially with the development of Connected Autonomous Vehicles (CAVs). So, it is crucial to assess how traditional IDS approaches can be utilised for emerging technologies. To address this concern, our work presents a stacked ensemble learning approach for IDS, which combines multiple machine learning algorithms to detect threats more effectively than single algorithm methods. Using the CICIDS2017 and the VeReMi benchmark data sets, we compare the performance of our approach with existing machine learning methods and find that it is more accurate at identifying threats. Our method also incorporates hyperparameter optimization and feature selection to improve its performance further. Overall, our results suggest that stacked ensemble learning is a promising technique for enhancing the effectiveness of IDS.
Differential Calculus over Graded Commutative Algebras and Vector Bundles with Inner Structures

In this note we highlight a common origin for many ubiquitous geometric structures, as well as several new ones by using only the functors of differential calculus in A.M Vinogradov's original sense, adapted to special classes of (graded) commutative algebras. Special attention is given to the particularly simple cases of diole and triole algebras and we show the latter environment is the appropriate one to describe calculus in vector bundles in the presence of a vector-valued fiber metric.
Massive strings from a haunted field theory

In this work we present the $\alpha'$-exact background equations of motion of the bosonic chiral string (also known as Hohm-Siegel-Zwiebach model), with the spin two ghost fields integrated out. This is the first instance of a worldsheet model in which all corrections are fully determined in a generic curved spacetime. As a concrete cross-check, we find complete agreement between all three-point and a sample of four-point tree level scattering amplitudes computed using field theory methods and the chiral string prescription. These equations of motion provide a field theoretical shortcut to compute worldsheet correlators in conventional bosonic strings (with arbitrary number of massless and mass level one states), and outline a new perspective on massive resonances in string theory.
Forcing Generative Models to Degenerate Ones: The Power of Data Poisoning Attacks

Growing applications of large language models (LLMs) trained by a third party raise serious concerns on the security vulnerability of LLMs.It has been demonstrated that malicious actors can covertly exploit these vulnerabilities in LLMs through poisoning attacks aimed at generating undesirable outputs. While poisoning attacks have received significant attention in the image domain (e.g., object detection), and classification tasks, their implications for generative models, particularly in the realm of natural language generation (NLG) tasks, remain poorly understood. To bridge this gap, we perform a comprehensive exploration of various poisoning techniques to assess their effectiveness across a range of generative tasks. Furthermore, we introduce a range of metrics designed to quantify the success and stealthiness of poisoning attacks specifically tailored to NLG tasks. Through extensive experiments on multiple NLG tasks, LLMs and datasets, we show that it is possible to successfully poison an LLM during the fine-tuning stage using as little as 1\% of the total tuning data samples. Our paper presents the first systematic approach to comprehend poisoning attacks targeting NLG tasks considering a wide range of triggers and attack settings. We hope our findings will assist the AI security community in devising appropriate defenses against such threats.
The Impact of AI Innovations on U.S. Occupations

AI's impact has traditionally been assessed in terms of occupations. However, an occupation is comprised of interconnected tasks, and it is these tasks, not occupations themselves, that are affected by AI. To evaluate how tasks may be impacted, previous approaches utilized manual annotations or coarse-grained matching. Leveraging recent advancements in machine learning, we replace coarse-grained matching with more precise deep learning approaches. Introducing the AI Impact (AII) measure, we employ Deep Learning Natural Language Processing to automatically identify AI patents that impact various occupational tasks at scale. Our methodology relies on a comprehensive dataset of 19,498 task descriptions and quantifies AI's impact through analysis of 12,984 AI patents filed with the United States Patent and Trademark Office (USPTO) between 2015 and 2020. Our observations reveal that the impact of AI on occupations defies simplistic categorizations based on task complexity, challenging the conventional belief that the dichotomy between basic and advanced skills alone explains the effects of AI. Instead, the impact is intricately linked to specific skills, whether basic or advanced, associated with particular tasks. For instance, while basic skills like scanning items may be affected, others like cooking may not. Similarly, certain advanced skills, such as image analysis in radiology, may face impact, while skills involving interpersonal relationships may remain unaffected. Furthermore, the influence of AI extends beyond knowledge-centric regions. Regions in the U.S. that heavily rely on industries susceptible to AI changes, often characterized by economic inequality or a lack of economic diversification, will experience notable AI impact.
Laboratory realization of relativistic pair-plasma beams

Relativistic electron-positron plasmas are ubiquitous in extreme astrophysical environments such as black holes and neutron star magnetospheres, where accretion-powered jets and pulsar winds are expected to be enriched with such pair plasmas. Their behaviour is quite different from typical electron-ion plasmas due to the matter-antimatter symmetry of the charged components and their role in the dynamics of such compact objects is believed to be fundamental. So far, our experimental inability to produce large yields of positrons in quasi-neutral beams has restricted the understanding of electron-positron pair plasmas to simple numerical and analytical studies which are rather limited. We present first experimental results confirming the generation of high-density, quasi-neutral, relativistic electron-positron pair beams using the 440 GeV/c beam at CERN's Super Proton Synchrotron (SPS) accelerator. The produced pair beams have a volume that fills multiple Debye spheres and are thus able to sustain collective plasma oscillations. Our work opens up the possibility of directly probing the microphysics of pair plasmas beyond quasi-linear evolution into regimes that are challenging to simulate or measure via astronomical observations.
Enhancing Polynomial Chaos Expansion Based Surrogate Modeling using a Novel Probabilistic Transfer Learning Strategy

In the field of surrogate modeling, polynomial chaos expansion (PCE) allows practitioners to construct inexpensive yet accurate surrogates to be used in place of the expensive forward model simulations. For black-box simulations, non-intrusive PCE allows the construction of these surrogates using a set of simulation response evaluations. In this context, the PCE coefficients can be obtained using linear regression, which is also known as point collocation or stochastic response surfaces. Regression exhibits better scalability and can handle noisy function evaluations in contrast to other non-intrusive approaches, such as projection. However, since over-sampling is generally advisable for the linear regression approach, the simulation requirements become prohibitive for expensive forward models. We propose to leverage transfer learning whereby knowledge gained through similar PCE surrogate construction tasks (source domains) is transferred to a new surrogate-construction task (target domain) which has a limited number of forward model simulations (training data). The proposed transfer learning strategy determines how much, if any, information to transfer using new techniques inspired by Bayesian modeling and data assimilation. The strategy is scrutinized using numerical investigations and applied to an engineering problem from the oil and gas industry.
Enhancing Facial Classification and Recognition using 3D Facial Models and Deep Learning

Accurate analysis and classification of facial attributes are essential in various applications, from human-computer interaction to security systems. In this work, a novel approach to enhance facial classification and recognition tasks through the integration of 3D facial models with deep learning methods was proposed. We extract the most useful information for various tasks using the 3D Facial Model, leading to improved classification accuracy. Combining 3D facial insights with ResNet architecture, our approach achieves notable results: 100% individual classification, 95.4% gender classification, and 83.5% expression classification accuracy. This method holds promise for advancing facial analysis and recognition research.
First Attempt at Building Parallel Corpora for Machine Translation of Northeast India's Very Low-Resource Languages

This paper presents the creation of initial bilingual corpora for thirteen very low-resource languages of India, all from Northeast India. It also presents the results of initial translation efforts in these languages. It creates the first-ever parallel corpora for these languages and provides initial benchmark neural machine translation results for these languages. We intend to extend these corpora to include a large number of low-resource Indian languages and integrate the effort with our prior work with African and American-Indian languages to create corpora covering a large number of languages from across the world.
Physical-Layer Semantic-Aware Network for Zero-Shot Wireless Sensing

Device-free wireless sensing has recently attracted significant interest due to its potential to support a wide range of immersive human-machine interactive applications. However, data heterogeneity in wireless signals and data privacy regulation of distributed sensing have been considered as the major challenges that hinder the wide applications of wireless sensing in large area networking systems. Motivated by the observation that signals recorded by wireless receivers are closely related to a set of physical-layer semantic features, in this paper we propose a novel zero-shot wireless sensing solution that allows models constructed in one or a limited number of locations to be directly transferred to other locations without any labeled data. We develop a novel physical-layer semantic-aware network (pSAN) framework to characterize the correlation between physical-layer semantic features and the sensing data distributions across different receivers. We then propose a pSAN-based zero-shot learning solution in which each receiver can obtain a location-specific gesture recognition model by directly aggregating the already constructed models of other receivers. We theoretically prove that models obtained by our proposed solution can approach the optimal model without requiring any local model training. Experimental results once again verify that the accuracy of models derived by our proposed solution matches that of the models trained by the real labeled data based on supervised learning approach.
Make out like a (Multi-Armed) Bandit: Improving the Odds of Fuzzer Seed Scheduling with T-Scheduler

Fuzzing is a highly-scalable software testing technique that uncovers bugs in a target program by executing it with mutated inputs. Over the life of a fuzzing campaign, the fuzzer accumulates inputs inducing new and interesting target behaviors, drawing from these inputs for further mutation. This rapidly results in a large number of inputs to select from, making it challenging to quickly and accurately select the"most promising"input for mutation. Reinforcement learning (RL) provides a natural solution to this"seed scheduling"problem: the fuzzer dynamically adapts its selection strategy by learning from past results. However, existing RL approaches are (a) computationally expensive (reducing fuzzer throughput) and/or (b) require hyperparameter tuning (reducing generality across targets and input types). To this end, we propose T-Scheduler, a seed scheduler built on multi-armed bandit theory that automatically adapts to the target without any hyperparameter tuning. We evaluate T-Scheduler over 35 CPU-yr of fuzzing, comparing it to 11 state-of-the-art schedulers. Our results show that T-Scheduler improves on these 11 schedulers on both bug-finding and coverage-expansion abilities.