Miracle-dz/UniFAR-FTUs huggingface dataset:
Three-Dimensional Damage Characterisation in Dual Phase Steel using Deep Learning

High performance sheet metals with a multi-phase microstructure suffer from deformation induced damage formation during forming in the constituent phases but importantly also where these intersect. To capture damage in terms of the physical processes in three dimensions (3D) and its stochastic nature during deformation, two challenges remain to be tackled: First, bridging high resolution analysis towards large scales to consider statistical data and, second, characterising in 3D with a resolution appropriate for sub-micron sized voids at a large scale. Here, we present how this can be achieved using panoramic scanning electron microscopy (SEM), metallographic serial sectioning, and deep-learning assisted automatic image analysis. This brings together the 3D evolution of active damage mechanisms with volumetric and environmental information for thousands of individual damage sites. We also assess potential surface preparation artefacts in 2D analyses. Overall, we find that for the material considered here, a dual phase (DP800) steel, martensite cracking is the dominant but not sole origin of deformation induced damage and that for a quantitative comparison of damage density, metallographic preparation can induce additional surface damage density far exceeding what is commonly induced between uniaxial straining steps.
Gaussian Max-Value Entropy Search for Multi-Agent Bayesian Optimization

We study the multi-agent Bayesian optimization (BO) problem, where multiple agents maximize a black-box function via iterative queries. We focus on Entropy Search (ES), a sample-efficient BO algorithm that selects queries to maximize the mutual information about the maximum of the black-box function. One of the main challenges of ES is that calculating the mutual information requires computationallycostly approximation techniques. For multi-agent BO problems, the computational cost of ES is exponential in the number of agents. To address this challenge, we propose the Gaussian Max-value Entropy Search, a multi-agent BO algorithm with favorable sample and computational efficiency. The key to our idea is to use a normal distribution to approximate the function maximum and calculate its mutual information accordingly. The resulting approximation allows queries to be cast as the solution of a closed-form optimization problem which, in turn, can be solved via a modified gradient ascent algorithm and scaled to a large number of agents. We demonstrate the effectiveness of Gaussian max-value Entropy Search through numerical experiments on standard test functions and real-robot experiments on the source seeking problem. Results show that the proposed algorithm outperforms the multi-agent BO baselines in the numerical experiments and can stably seek the source with a limited number of noisy observations on real robots.
A hybrid deep-learning-metaheuristic framework to approximate discrete road network design problems

This study proposes a hybrid deep-learning-metaheuristic framework with a bi-level architecture to solve road network design problems (NDPs). We train a graph neural network (GNN) to approximate the solution of the user equilibrium (UE) traffic assignment problem, and use inferences made by the trained model to calculate fitness function evaluations of a genetic algorithm (GA) to approximate solutions for NDPs. Using two NDP variants and an exact solver as benchmark, we show that our proposed framework can provide solutions within 5% gap of the global optimum results given less than 1% of the time required for finding the optimal results. Moreover, we observe many interesting future directions, thus we propose a brief research agenda for this topic. The key observation inspiring influential future research was that fitness function evaluation time using the inferences made by the GNN model for the genetic algorithm was in the order of milliseconds, which points to an opportunity and a need for novel heuristics that 1) can cope well with noisy fitness function values provided by neural networks, and 2) can use the significantly higher computation time provided to them to explore the search space effectively (rather than efficiently). This opens a new avenue for a modern class of metaheuristics that are crafted for use with AI-powered predictors.
A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA

Abstract Drensky and Lakatos (Lecture Notes in Computer Science, 357 (Springer, Berlin, 1989), pp. 181–188) have established a convenient property of certain ideals in polynomial quotient rings, which can now be used to determine error-correcting capabilities of combined multiple classifiers following a standard approach explained in the well-known monograph by Witten and Frank (Data Mining: Practical Machine Learning Tools and Techniques (Elsevier, Amsterdam, 2005)). We strengthen and generalise the result of Drensky and Lakatos by demonstrating that the corresponding nice property remains valid in a much larger variety of constructions and applies to more general types of ideals. Examples show that our theorems do not extend to larger classes of ring constructions and cannot be simplified or generalised.
Machine learning for sports betting: should forecasting models be optimised for accuracy or calibration?

Sports betting’s recent federal legalisation in the USA coincides with the golden age of machine learning. If bettors can leverage data to accurately predict the probability of an outcome, they can recognise when the bookmaker’s odds are in their favour. As sports betting is a multi-billion dollar industry in the USA alone, identifying such opportunities could be extremely lucrative. Many researchers have applied machine learning to the sports outcome prediction problem, generally using accuracy to evaluate the performance of forecasting models. We hypothesise that for the sports betting problem, model calibration is more important than accuracy. To test this hypothesis, we train models on NBA data over several seasons and run betting experiments on a single season, using published odds. Evaluating various betting systems, we show that optimising the forecasting model for calibration leads to greater returns than optimising for accuracy, on average (return on investment of 110.42% versus 2.98%) and in the best case (902.01% versus 222.84%). These ﬁndings suggest that for sports betting (or any forecasting problem where decisions are made based on the predicted probability of each outcome), calibration is a more important metric than accuracy. Sports bettors who wish to increase proﬁts should therefore optimise their forecasting model for calibration.
Weakly-Supervised HOI Detection from Interaction Labels Only and Language/Vision-Language Priors

Human-object interaction (HOI) detection aims to extract interacting human-object pairs and their interaction categories from a given natural image. Even though the labeling effort required for building HOI detection datasets is inherently more extensive than for many other computer vision tasks, weakly-supervised directions in this area have not been sufficiently explored due to the difficulty of learning human-object interactions with weak supervision, rooted in the combinatorial nature of interactions over the object and predicate space. In this paper, we tackle HOI detection with the weakest supervision setting in the literature, using only image-level interaction labels, with the help of a pretrained vision-language model (VLM) and a large language model (LLM). We first propose an approach to prune non-interacting human and object proposals to increase the quality of positive pairs within the bag, exploiting the grounding capability of the vision-language model. Second, we use a large language model to query which interactions are possible between a human and a given object category, in order to force the model not to put emphasis on unlikely interactions. Lastly, we use an auxiliary weakly-supervised preposition prediction task to make our model explicitly reason about space. Extensive experiments and ablations show that all of our contributions increase HOI detection performance.
Synchrotron nebulae created by anisotropic magnetized pulsar winds

In this paper, we give a detailed description of the first attempt to study the properties of the flow produced by a magnetized pulsar wind within a plerionic nebula via fully relativistic magnetohydrodynamic (MHD) simulations. Following the current theoretical models of pulsar winds, we assume that in the equatorial direction the magnetization of the wind drops to zero but its energy flux reaches a maximum. The results of our 2D axisymmetric simulations reveal complex dynamics of the post-shock flow, very different from the steady quasi-radial outflow assumed in earlier analytical models for plerions. The termination shock has the shape of a distorted torus and most of the downstream flow is initially confined to the equatorial plane. Provided the wind magnetization is higher than a certain value, the magnetic hoop stress stops the outflow in the surface layers of the equatorial disc and redirects it into magnetically confined polar jets. The outflow in the inner layers of the equatorial disc continues until it reaches the slowly expanding outer shell and then turns back and forms the vortex flow filling the nebular volume at intermediate latitudes. We simulated the synchrotron images of the nebula taking into account the relativistic beaming effect and the particle energy losses. These images are strikingly similar to the well-known images of the Crab and other pulsar wind nebulae obtained by Chandra and the Hubble Space Telescope. They exhibit both a system of rings, which makes an impression of an equatorial disc-like or even a toroidal structure, and well-collimated polar jets, which appear to originate from the pulsar. A number of fine details of the inner Crab nebula find natural explanation including the bright knot discovered by Hester et al. in 1995 very close to the Crab pulsar.
STAP: Sequencing Task-Agnostic Policies

Advances in robotic skill acquisition have made it possible to build general-purpose libraries of learned skills for downstream manipulation tasks. However, naively executing these skills one after the other is unlikely to succeed without accounting for dependencies between actions prevalent in longhorizon plans. We present Sequencing Task-Agnostic Policies (STAP), a scalable framework for training manipulation skills and coordinating their geometric dependencies at planning time to solve long-horizon tasks never seen by any skill during training. Given that Q-functions encode a measure of skill feasibility, we formulate an optimization problem to maximize the joint success of all skills sequenced in a plan, which we estimate by the product of their Q-values. Our experiments indicate that this objective function approximates ground truth plan feasibility and, when used as a planning objective, reduces myopic behavior and thereby promotes long-horizon task success. We further demonstrate how STAP can be used for task and motion planning by estimating the geometric feasibility of skill sequences provided by a task planner. We evaluate our approach in simulation and on a real robot. Qualitative results and code are made available at sites.google. com/stanford.edu/stap.
Checking the Statistical Assumptions Underlying the Application of the Standard Deviation and RMS Error to Eye-Movement Time Series: A Comparison between Human and Artificial Eyes

Spatial precision is often measured using the standard deviation (SD) of the eye position signal or the RMS of the sample-to-sample differences (StoS) signal during fixation. As both measures emerge from statistical theory applied to time-series, there are certain statistical assumptions that accompany their use. It is intuitively obvious that the SD is most useful when applied to unimodal distributions. Both measures assume stationarity, which means that the statistical properties of the signals are stable over time. Both metrics assume the samples of the signals are independent. The presence of autocorrelation indicates that the samples in the time series are not independent. We tested these assumptions with multiple fixations from two studies, a publicly available dataset that included both human and artificial eyes ("HA Dataset", N=224 fixations), and data from our laboratory of 4 subjects ("TXstate", N=37 fixations). Many position signal distributions were multimodal (HA: median=32%, TXstate: median=100%). No fixation position signals were stationary. All position signals were statistically significantly autocorrelated (p<0:01). Thus, the statistical assumptions of the SD were not met for any fixation. All StoS signals were unimodal. Some StoS signals were stationary (HA: 34%, TXstate: 24%). Almost all StoS signals were statistically significantly autocorrelated (p<0:01). For TXstate, 3 of 37 fixations met all assumptions. Thus, the statistical assumptions of the RMS were generally not met. The general failure of these assumptions calls into question the appropriateness of the SD or the RMS-StoS as metrics of precision for eye-trackers.
A discrete Gould transform data hiding scheme

Discrete Gould transform has been recently introduced in image processing. This paper proposes a data hiding scheme that uses the discrete Gould transform in order to invisibly embed a secret message. The Gould coefficients represent the differences between neighboring pixels. Small changes of the coefficients generate even smaller changes to the pixels. By this, a high capacity fragile steganographic technique is achieved. The message is easily destroyed after any manipulation, and therefore, its absence can prove that the image has been altered in some way. Because of this property, the proposed technique finds application in image authentication and tamper proofing. Copyright © 2013 John Wiley & Sons, Ltd.
Depression Diagnosis and Drug Response Prediction via Recurrent Neural Networks and Transformers Utilizing EEG Signals

The Early diagnosis and treatment of depression is essential for effective treatment. Depression, while being one of the most common mental illnesses, is still poorly understood in both research and clinical practice. Among different treatments, drug prescription is widely used, however the drug treatment is not effective for many patients. In this work, we propose a method for major depressive disorder (MDD) diagnosis as well as a method for predicting the drug response in patient with MDD using EEG signals. Method: We employ transformers, which are modified recursive neural networks with novel architecture to evaluate the time dependency of time series effectively. We also compare the model to the well-known deep learning schemes such as CNN, LSTM and CNN-LSTM. Results: The transformer achieves an average recall of 99.41% and accuracy of 97.14% for classifying normal and MDD subjects. Furthermore, the transformer also performed well in classifying responders and non-responders to the drug, resulting in 97.01% accuracy and 97.76% Recall. Conclusion: Outperforming other methods on a similar number of parameters, the suggested technique, as a screening tool, seems to have the potential to assist health care professionals in assessing MDD patients for early diagnosis and treatment. Significance: Analyzing EEG signal analysis using transformers, which have replaced the recursive models as a new structure to examine the time dependence of time series, is the main novelty of this research.
Nanopore and tunneling resonance in an open kink in carbon nanotubes

In weakly buckled carbon nanotubes, the kink is an open, ovalized constriction where molecular-sized analytes and ions can pass. Moreover, in semiconducting tubes, the kink has an electronic bound state within the bandgap. This state is localized, hence highly susceptible to electrostatic perturbation by a proximate, itinerant ion. The degree to which this perturbation will modulate the electronic current, which is our signal, can be maximized in a tunnel-junction set-up, near resonance. We thus propose such a device, analyze its performance and, since the bound state depends on the post-buckling bending, suggest a scalable fabrication method to achieve bending and buckling of carbon nanotubes to an adjustable degree.
Training, Architecture, and Prior for Deterministic Uncertainty Methods

Accurate and efficient uncertainty estimation is crucial to build reliable Machine Learning (ML) models capable to provide calibrated uncertainty estimates, generalize and detect Out-Of-Distribution (OOD) datasets. To this end, Deterministic Uncertainty Methods (DUMs) is a promising model family capable to perform uncertainty estimation in a single forward pass. This work investigates important design choices in DUMs: (1) we show that training schemes decoupling the core architecture and the uncertainty head schemes can significantly improve uncertainty performances. (2) we demonstrate that the core architecture expressiveness is crucial for uncertainty performance and that additional architecture constraints to avoid feature collapse can deteriorate the trade-off between OOD generalization and detection. (3) Contrary to other Bayesian models, we show that the prior defined by DUMs do not have a strong effect on the final performances.
Pohang canal dataset: A multimodal maritime dataset for autonomous navigation in restricted waters

This paper presents a multimodal maritime dataset and the data collection procedure used to gather it, which aims to facilitate autonomous navigation in restricted water environments. The dataset comprises measurements obtained using various perception and navigation sensors, including a stereo camera, an infrared camera, an omnidirectional camera, three LiDARs, a marine radar, a global positioning system, and an attitude heading reference system. The data were collected along a 7.5-km-long route that includes a narrow canal, inner and outer ports, and near-coastal areas in Pohang, South Korea. The collection was conducted under diverse weather and visual conditions. The dataset and its detailed description are available for free download at https://sites.google. com/view/pohang-canal-dataset.
Learning Multimodal Bipedal Locomotion and Implicit Transitions: A Versatile Policy Approach

In this paper, we propose a novel framework for synthesizing a single multimodal control policy capable of generating diverse behaviors (or modes) and emergent inherent transition maneuvers for bipedal locomotion. In our method, we first learn efficient latent encodings for each behavior by training an autoencoder from a dataset of rough reference motions. These latent encodings are used as commands to train a multimodal policy through an adaptive sampling of modes and transitions to ensure consistent performance across different behaviors. We validate the policy's performance in simulation for various distinct locomotion modes such as walking, leaping, jumping on a block, standing idle, and all possible combinations of inter-mode transitions. Finally, we integrate a task-based planner to rapidly generate open-loop mode plans for the trained multimodal policy to solve high-level tasks like reaching a goal position on a challenging terrain. Complex parkour-like motions by smoothly combining the discrete locomotion modes were generated in $\sim 3$ min. to traverse tracks with a gap of width 0.45 m, a plateau of height 0.2 m, and a block of height 0.4 m, which are all significant compared to the dimensions of our mini-biped platform.
Bianisotropic Susceptibility Theory of Artificial Magnetic Conductors

Over the past 30 years, Artificial Magnetic Conductors (AMCs) have generated immense interest in the microwave community. However, their description has been restricted to crude RLC design or subsidiary transmission-line network modelling. This paper introduces an electromagnetic theory of AMCs in terms of bianisotropic susceptibilities. This theory will be completed by precise explanations of the corresponding dipolar responses in generic AMC structures that will be presented at the conference.
LGBTQIA+ (In) Visibility in Computer Science and Software Engineering Education

Modern society is diverse, multicultural, and multifaceted. Because of these characteristics, we are currently observing an increase in the debates about equity, diversity, and inclusion in different areas, especially because several groups of individuals are underrepresented in many environments. In computer science and software engineering, it seems counterintuitive that these areas, which are responsible for creating technological solutions and systems for billions of users around the world, do not reflect the diversity of the society to which it serves. In trying to solve this diversity crisis in the software industry, researchers started to investigate strategies that can be applied to increase diversity and improve inclusion in academia and the software industry. However, the lack of diversity in computer science and related courses, including software engineering, is still a problem, in particular when some specific groups are considered. LGBTQIA+ students, for instance, face several challenges to fit into technology courses, even though most students in universities right now belong to Generation Z, which is described as open-minded to aspects of gender and sexuality. In this study, we aimed to discuss the state-of-art of publications about the inclusion of LGBTQIA+ students in computer science education. Using a mapping study, we identified eight studies published in the past six years that focused on this public. We present strategies developed to adapt curricula and lectures to be more inclusive to LGBTQIA+ students and discuss challenges and opportunities for future research.
K moduli of log del Pezzo pairs

We establish the full explicit wall-crossing for K-moduli space $\overline{P}^K_c$ of degree $8$ del Pezzo pairs $(X,cC)$ where generically $X \cong \bbF_1$ and $C \sim -2K_X$. We also show K-moduli spaces $\overline{P}^K_c$ coincide with Hassett-Keel-Looijenga(HKL) models $\cF(s)$ of a $18$-dimensional locally symmetric spaces associated to the lattice $E_8\oplus U^2\oplus E_7\oplus A_1$.
CRC-based Reliable WiFi Backscatter Communiation for Supply Chain Management

Supply chain management aims to achieve both efficiency and low cost. Backscatter technology provides a low-energy consumption approach for critical links in the supply chain, such as warehouse management and cargo identification. Traditional backscatter systems achieve tag data transmission through dedicated hardware or controlled transmission sources. An additional access point (AP) can be used to ensure that the original data are always known in tag data decoding. These requirements increase the deployment costs and are not suitable for large-scale applications. To address these challenges, we introduce CRCScatter, a backscatter system based on a cyclic redundancy check (CRC) reverse algorithm, with an uncontrolled source and a single-AP receiver. The CRCScatter decoder at the receiver uses the constraints within 802.11b WiFi packets to recover the original packet and decode tag data from the backscatter packet. Our Matlab simulation results show that CRCScatter is effective in the low signal-to-noise ratio (SNR) regime, and its average decoding time is independent of the length of tag data. By appending redundant bits in tag data, the decoding accuracy of CRCScatter can be improved. In summary, CRCScatter presents a backscatter communication mode based on ambient WiFi signals with fewer hardware requirements and low deployment costs. Furthermore, the decoding idea of calculating unknown data based on the packet constraints has the potential to expand to different types of excitation packages.