Miracle-dz/UniFAR-FTUs huggingface dataset:
Skeletal Point Representations with Geometric Deep Learning

Skeletonization has been a popular shape analysis technique that models both the interior and exterior of an object. Existing template-based calculations of skeletal models from anatomical structures are a time-consuming manual process. Recently, learning-based methods have been used to extract skeletons from 3D shapes. In this work, we propose novel additional geometric terms for calculating skeletal structures of objects. The results are similar to traditional fitted s-reps but but are produced much more quickly. Evaluation on real clinical data shows that the learned model predicts accurate skeletal representations and shows the impact of proposed geometric losses along with using s-reps as weak supervision.
Chemical models of adenine precursors cyanamide and carbodiimide in the interstellar medium

Cyanamide (NH2CN) and its isomer, carbodiimide (HNCNH), may form adenine in the interstellar medium (ISM) via a series of reactions. Therefore, they are considered key prebiotic molecules in the study of the origin of life. We used the three-phase NAUTILUS chemical code, which includes the gas, the dust surface, and the icy mantle, to investigate the formation and destruction of cyanamide and carbodiimide. We added over 200 new chemical reactions of the two isomers and related species, and established a relatively complete network. We applied cold core, hot corino/core and shock models to simulate the different physical environments, and found that the two isomers are mainly produced by the free radical reactions on grain surfaces. Our simulated results suggest that cyanamide and carbodiimide molecules come from surface chemistry at early evolutionary stages. Then they are released back to the gas phase, either by thermal process (in hot cores, hot corinos) or shock-induced desorption (in shock regions). We speculate that it is an inefficient route to form a tautomer of adenine by starting from molecules cyanoacetylene (C3NH), cyanamide and carbodiimide in ISM.
Modeling and Exploration of Gain Competition Attacks in Optical Network-on-Chip Architectures

Network-on-Chip (NoC) enables energy-efficient communication between numerous components in System-on-Chip architectures. The optical NoC is widely considered a key technology to overcome the bandwidth and energy limitations of traditional electrical on-chip interconnects. While optical NoC can offer high performance, they come with inherent security vulnerabilities due to the nature of optical interconnects. In this paper, we investigate the gain competition attack in optical NoCs, which can be initiated by an attacker injecting a high-power signal to the optical waveguide, robbing the legitimate signals of amplification. To the best of our knowledge, our proposed approach is the first attempt to investigate gain competition attacks as a security threat in optical NoCs. We model the attack and analyze its effects on optical NoC performance. We also propose potential attack detection techniques and countermeasures to mitigate the attack. Our experimental evaluation using different NoC topologies and diverse traffic patterns demonstrates the effectiveness of our modeling and exploration of gain competition attacks in optical NoC architectures.
Revisiting the effect of search frictions on market concentration

Search frictions can impede the formation of optimal matches between consumer and supplier, or employee and employer, and lead to inefficiencies. This paper revisits the effect of search frictions on the firm size distribution when challenging two common but strong assumptions: that all agents share the same ranking of firms, and that agents meet all firms, whether small or large, at the same rate. We build a random search model in which we relax those two assumptions and show that the intensity of search frictions has a non monotonic effect on market concentration. An increase in friction intensity increases market concentration up to a certain threshold of frictions, that depends on the slope of the meeting rate with respect to firm size. We leverage unique French customs data to estimate this slope. First, we find that in a range of plausible scenarios, search frictions intensity increases market concentration. Second, we show that slopes have increased over time, which unambiguously increases market concentration in our model. Overall, we shed light on the importance of the structure of frictions, rather than their intensity, to understand market concentration.
On SORA for High-Risk UAV Operations under New EU Regulations: Perspectives for Automated Approach

In this paper, we investigate requirements to prepare an application for Specific Operations Risk Assessment (SORA), regulated by European Union Aviation Safety Agency (EASA) to obtain flight authorization for Unmanned Aerial Vehicles (UAVs) operations and propose some perspectives to automate the approach based on our successful application. Preparation of SORA requires expert knowledge as it contains technicalities. Also, the whole process is an iterative and timeconsuming one. It is even more challenging for higher-risk operations, such as those in urban environments, near airports, and multi- and customized models for research activities. SORA process limits the potential socio-economic impacts of innovative UAV capabilities. Therefore, in this paper, we present a SORA example, review the steps and highlight challenges. Accordingly, we propose an alternative workflow, considering the same steps, while addressing the challenges and pitfalls, to shorten the whole process. Furthermore, we present a comprehensive list of preliminary technical procedures, including the pre/during/post-flight checklists, design and installation appraisal, flight logbook, operational manual, training manual, and General Data Protection Regulation (GDPR), which are not explicitly instructed in SORA manual. Moreover, we propose the initial idea to create an automated SORA workflow to facilitate obtaining authorization, which is significantly helpful for operators, especially the scientific community, to conduct experimental operations.
Independent Control of Two Magnetic Robots using External Permanent Magnets: A Feasibility Study

The ability to have multiple magnetic robots operate independently in the same workspace would increase the clinical potential of these systems allowing collaborative operation. In this work, we investigate the feasibility of actuating two magnetic robots operating within the same workspace using external permanent magnets. Unlike actuation systems based on pairs of electromagnetic coils, the use of multiple permanent magnets comes with the advantage of a large workspace which better suits the clinical setting. In this work, we present an optimization routine capable of generating the required poses for the external magnets in order to control the position and orientation of two magnetic robots. We show that at a distance of 15cm, minimal coupling between the magnetic robots can be achieved (3.9% crosstalk) each embedded with 5mm diameter, 5mm length NdFeB magnets. At smaller distances, we observe that the ability to independently control the robot torques decreases, but forces can still achieve independent control even with alignment of the robots. We test our developed control system in a simulation of two magnetic robots following pre-planned trajectories in close proximity (60 mm) showing a mean positional error of 8.7 mm and mean angular error of 16.7°.
Node-Specific Space Selection via Localized Geometric Hyperbolicity in Graph Neural Networks

Many graph neural networks have been developed to learn graph representations in either Euclidean or hyperbolic space, with all nodes' representations embedded in a single space. However, a graph can have hyperbolic and Euclidean geometries at different regions of the graph. Thus, it is sub-optimal to indifferently embed an entire graph into a single space. In this paper, we explore and analyze two notions of local hyperbolicity, describing the underlying local geometry: geometric (Gromov) and model-based, to determine the preferred space of embedding for each node. The two hyperbolicities' distributions are aligned using the Wasserstein metric such that the calculated geometric hyperbolicity guides the choice of the learned model hyperbolicity. As such our model Joint Space Graph Neural Network (JSGNN) can leverage both Euclidean and hyperbolic spaces during learning by allowing node-specific geometry space selection. We evaluate our model on both node classification and link prediction tasks and observe promising performance compared to baseline models.
Word-As-Image for Semantic Typography

A word-as-image is a semantic typography technique where a word illustration presents a visualization of the meaning of the word, while also preserving its readability. We present a method to create word-as-image illustrations automatically. This task is highly challenging as it requires semantic understanding of the word and a creative idea of where and how to depict these semantics in a visually pleasing and legible manner. We rely on the remarkable ability of recent large pretrained language-vision models to distill textual concepts visually. We target simple, concise, black-and-white designs that convey the semantics clearly. We deliberately do not change the color or texture of the letters and do not use embellishments. Our method optimizes the outline of each letter to convey the desired concept, guided by a pretrained Stable Diffusion model. We incorporate additional loss terms to ensure the legibility of the text and the preservation of the style of the font. We show high quality and engaging results on numerous examples and compare to alternative techniques. Code and demo will be available at our project page.
Kinetic and macroscopic equations for action potential in neural networks

Starting from the concept of binary interactions between pairs of particles, a kinetic framework for the description of the action potential dynamics on a neural network is proposed. It consists of two coupled levels: the description of a single brain region dynamics and the interactions among different regions. On one side, the pairwise interaction between neurons exchanging membrane potential is statistically described to account for the unmanageable number of neuron synapses within a single brain region. On the other, the network connections accounting for the brain region topology are represented and studied using concepts of the graph theory. Equilibrium and stability of the obtained macroscopic systems are analyzed as well as numerical simulations of the system dynamics are performed in different scenarios. In particular, the latter allows us to observe the influence of the discrete network topology on the membrane potential propagation and synchronization through the different regions, in terms of its spiking characteristics.
Lagrangian trajectories and closure models in quantum-classical dynamics ⋆

Mixed quantum-classical models have been proposed in several contexts to overcome the computational challenges of fully quantum approaches. However, current models beyond mean-ﬁeld approximations typically suﬀer from long-standing consistency issues, and, in some cases, invalidate Heisenberg’s uncertainty principle. Here, we present a fully Hamiltonian theory of quantum-classical dynamics that appears to be the ﬁrst to ensure a series of consistency properties, beyond positivity of quantum and classical densities. Based on Lagrangian phase-space paths, the model possesses a quantum-classical Poincaré integral invariant as well as inﬁnite classes of Casimir functionals. We also present a trajectory closure scheme that extends the Ehrenfest model from chem-ical physics.
Synthetic Data Generator for Adaptive Interventions in Global Health

Artificial Intelligence and digital health have the potential to transform global health. However, having access to representative data to test and validate algorithms in realistic production environments is essential. We introduce HealthSyn, an open-source synthetic data generator of user behavior for testing reinforcement learning algorithms in the context of mobile health interventions. The generator utilizes Markov processes to generate diverse user actions, with individual user behavioral patterns that can change in reaction to personalized interventions (i.e., reminders, recommendations, and incentives). These actions are translated into actual logs using an ML-purposed data schema specific to the mobile health application functionality included with HealthKit, and open-source SDK. The logs can be fed to pipelines to obtain user metrics. The generated data, which is based on real-world behaviors and simulation techniques, can be used to develop, test, and evaluate, both ML algorithms in research and end-to-end operational RL-based intervention delivery frameworks.
Graph-based Extreme Feature Selection for Multi-class Classification Tasks

When processing high-dimensional datasets, a common pre-processing step is feature selection. Filter-based feature selection algorithms are not tailored to a specific classification method, but rather rank the relevance of each feature with respect to the target and the task. This work focuses on a graph-based, filter feature selection method that is suited for multi-class classifications tasks. We aim to drastically reduce the number of selected features, in order to create a sketch of the original data that codes valuable information for the classification task. The proposed graph-based algorithm is constructed by combing the Jeffries-Matusita distance with a non-linear dimension reduction method, diffusion maps. Feature elimination is performed based on the distribution of the features in the low-dimensional space. Then, a very small number of feature that have complementary separation strengths, are selected. Moreover, the low-dimensional embedding allows to visualize the feature space. Experimental results are provided for public datasets and compared with known filter-based feature selection techniques.
MAEVI: Motion Aware Event-Based Video Frame Interpolation

Utilization of event-based cameras is expected to improve the visual quality of video frame interpolation solutions. We introduce a learning-based method to exploit moving region boundaries in a video sequence to increase the overall interpolation quality.Event cameras allow us to determine moving areas precisely; and hence, better video frame interpolation quality can be achieved by emphasizing these regions using an appropriate loss function. The results show a notable average \textit{PSNR} improvement of $1.3$ dB for the tested data sets, as well as subjectively more pleasing visual results with less ghosting and blurry artifacts.
AZTR: Aerial Video Action Recognition with Auto Zoom and Temporal Reasoning

We propose a novel approach for aerial video action recognition. Our method is designed for videos captured using UAVs and can run on edge or mobile devices. We present a learning-based approach that uses customized auto zoom to automatically identify the human target and scale it appropriately. This makes it easier to extract the key features and reduces the computational overhead. We also present an efficient temporal reasoning algorithm to capture the action information along the spatial and temporal domains within a controllable computational cost. Our approach has been implemented and evaluated both on the desktop with high-end GPUs and on the low power Robotics RB5 Platform for robots and drones. In practice, we achieve $6.1-7.4 \%$ improvement over SOTA in Top-1 accuracy on the RoCoG-v2 dataset, 8.3-10.4% improvement on the UAV-Human dataset and 3.2% improvement on the Drone Action dataset.
Simultaneous prediction of hand gestures, handedness, and hand keypoints using thermal images

Hand gesture detection is a well-explored area in computer vision with applications in various forms of Human-Computer Interactions. In this work, we propose a technique for simultaneous hand gesture classification, handedness detection, and hand keypoints localization using thermal data captured by an infrared camera. Our method uses a novel deep multi-task learning architecture that includes shared encoderdecoder layers followed by three branches dedicated for each mentioned task. We performed extensive experimental validation of our model on an in-house dataset consisting of 24 users data. The results confirm higher than 98 percent accuracy for gesture classification, handedness detection, and fingertips localization, and more than 91 percent accuracy for wrist points localization.
Learning-based Position and Stiffness Feedforward Control of Antagonistic Soft Pneumatic Actuators using Gaussian Processes

Variable stiffness actuator (VSA) designs are manifold. Conventional model-based control of these nonlinear systems is associated with high effort and design-dependent assumptions. In contrast, machine learning offers a promising alternative as models are trained on real measured data and nonlinearities are inherently taken into account. Our work presents a universal, learning-based approach for position and stiffness control of soft actuators. After introducing a soft pneumatic VSA, the model is learned with input-output data. For this purpose, a test bench was set up which enables automated measurement of the variable joint stiffness. During control, Gaussian processes are used to predict pressures for achieving desired position and stiffness. The feedforward error is on average 11.5% of the total pressure range and is compensated by feedback control. Experiments with the soft actuator show that the learning-based approach allows continuous adjustment of position and stiffness without model knowledge.
On the Provable Advantage of Unsupervised Pretraining

Unsupervised pretraining, which learns a useful representation using a large amount of unlabeled data to facilitate the learning of downstream tasks, is a critical component of modern large-scale machine learning systems. Despite its tremendous empirical success, the rigorous theoretical understanding of why unsupervised pretraining generally helps remains rather limited -- most existing results are restricted to particular methods or approaches for unsupervised pretraining with specialized structural assumptions. This paper studies a generic framework, where the unsupervised representation learning task is specified by an abstract class of latent variable models $\Phi$ and the downstream task is specified by a class of prediction functions $\Psi$. We consider a natural approach of using Maximum Likelihood Estimation (MLE) for unsupervised pretraining and Empirical Risk Minimization (ERM) for learning downstream tasks. We prove that, under a mild ''informative'' condition, our algorithm achieves an excess risk of $\tilde{\mathcal{O}}(\sqrt{\mathcal{C}_\Phi/m} + \sqrt{\mathcal{C}_\Psi/n})$ for downstream tasks, where $\mathcal{C}_\Phi, \mathcal{C}_\Psi$ are complexity measures of function classes $\Phi, \Psi$, and $m, n$ are the number of unlabeled and labeled data respectively. Comparing to the baseline of $\tilde{\mathcal{O}}(\sqrt{\mathcal{C}_{\Phi \circ \Psi}/n})$ achieved by performing supervised learning using only the labeled data, our result rigorously shows the benefit of unsupervised pretraining when $m \gg n$ and $\mathcal{C}_{\Phi\circ \Psi}>\mathcal{C}_\Psi$. This paper further shows that our generic framework covers a wide range of approaches for unsupervised pretraining, including factor models, Gaussian mixture models, and contrastive learning.
Developing a Compiler for EROP - A Language for the Specification of Smart Contracts, An Experience Report

A smart contract is a translation of a standard paper-based contract that can be enforced and executed by a contract management system. At a high level of abstraction, a contract is only a document that describes how the signing parties are to behave in different scenarios; nevertheless, the translation of a typical paper-based contract to its electronic counterpart has proved to be both time-consuming and difficult. The requirement for a language capable of capturing the core of a contract in simple phrases and definitions has been a focus of study for many years. EROP (Events, Rights, Obligations, Prohibitions) is a contract specification language that breaks a contract down into sets of events, rights, obligations, and prohibitions.
HitGNN: High-Throughput GNN Training Framework on CPU+Multi-FPGA Heterogeneous Platform

As the size of real-world graphs increases, training Graph Neural Networks (GNNs) has become time-consuming and requires acceleration. While previous works have demonstrated the potential of utilizing FPGA for accelerating GNN training, few works have been carried out to accelerate GNN training with multiple FPGAs due to the necessity of hardware expertise and substantial development effort. To this end, we propose HitGNN, a framework that enables users to effortlessly map GNN training workloads onto a CPU+Multi-FPGA platform for acceleration. In particular, HitGNN takes the user-defined synchronous GNN training algorithm, GNN model, and platform metadata as input, determines the design parameters based on the platform metadata, and performs hardware mapping onto the CPU+Multi-FPGA platform, automatically. HitGNN consists of the following building blocks: (1) high-level application programming interfaces (APIs) that allow users to specify various synchronous GNN training algorithms and GNN models with only a handful of lines of code; (2) a software generator that generates a host program that performs mini-batch sampling, manages CPU-FPGA communication, and handles workload balancing among the FPGAs; (3) an accelerator generator that generates GNN kernels with optimized datapath and memory organization. We show that existing synchronous GNN training algorithms such as DistDGL and PaGraph can be easily deployed on a CPU+Multi-FPGA platform using our framework, while achieving high training throughput. Compared with the state-of-the-art frameworks that accelerate synchronous GNN training on a multi-GPU platform, HitGNN achieves up to 27.21× bandwidth efficiency, and up to 4.26× speedup using much less compute power and memory bandwidth than GPUs. In addition, HitGNN demonstrates good scalability to 16 FPGAs on a CPU+Multi-FPGA platform.
WESPER: Zero-shot and Realtime Whisper to Normal Voice Conversion for Whisper-based Speech Interactions

Recognizing whispered speech and converting it to normal speech creates many possibilities for speech interaction. Because the sound pressure of whispered speech is significantly lower than that of normal speech, it can be used as a semi-silent speech interaction in public places without being audible to others. Converting whispers to normal speech also improves the speech quality for people with speech or hearing impairments. However, conventional speech conversion techniques do not provide sufficient conversion quality or require speaker-dependent datasets consisting of pairs of whispered and normal speech utterances. To address these problems, we propose WESPER, a zero-shot, real-time whisper-to-normal speech conversion mechanism based on self-supervised learning. WESPER consists of a speech-to-unit (STU) encoder, which generates hidden speech units common to both whispered and normal speech, and a unit-to-speech (UTS) decoder, which reconstructs speech from the encoded speech units. Unlike the existing methods, this conversion is user-independent and does not require a paired dataset for whispered and normal speech. The UTS decoder can reconstruct speech in any target speaker’s voice from speech units, and it requires only an unlabeled target speaker’s speech data. We confirmed that the quality of the speech converted from a whisper was improved while preserving its natural prosody. Additionally, we confirmed the effectiveness of the proposed approach to perform speech reconstruction for people with speech or hearing disabilities.