Miracle-dz/UniFAR-FTUs huggingface dataset:
Effective and Acceptable Eco-Driving Guidance for Human-Driving Vehicles: A Review

Eco-driving guidance refers to courses, warnings, or suggestions provided to human drivers to improve driving behaviour to enable less energy use and emissions. This paper reviews existing eco-driving guidance studies and identifies challenges to tackle in the future. We summarize two categories of current guidance systems, static and dynamic, distinguished by whether real-world driving records are used to generate behaviour guidance or not. We find that influencing factors, such as the content of suggestions, the display methods, and drivers’ socio-demographic characteristics, have varied effects on the guidance results across studies. Drivers are reported to have basic eco-driving knowledge, while the question of how to motivate the acceptance and practice of such behaviour, especially in the long term, is overlooked. Adaptive driving suggestions based on drivers’ individual habits can improve the effectiveness and acceptance while this field is under investigation. In-vehicle assistance presents potential safety issues, and visualized in-vehicle assistance is reported to be most distractive. Given existing studies focusing on the operational level, a common agreement on the guidance design and associated influencing factors has yet to be reached. Research on the systematic and tactical design of eco-driving guidance and in-vehicle interaction is advised.
HEALPix Alchemy: Fast All-Sky Geometry and Image Arithmetic in a Relational Database for Multimessenger Astronomy Brokers

Efficient searches for electromagnetic counterparts to gravitational wave, high-energy neutrino, and gamma-ray burst events demand rapid processing of image arithmetic and geometry set operations in a database to cross-match galaxy catalogs, observation footprints, and all-sky images. Here we introduce HEALPix Alchemy, an open-source, pure Python implementation of a set of methods that enables rapid all-sky geometry calculations. HEALPix Alchemy is built upon HEALPix, a spatial indexing strategy that is widely used in astronomical databases as well as the native format of LIGO-Virgo-KAGRA gravitational-wave sky localization maps. Our approach leverages new multirange types built into the PostgreSQL 14 database engine. This enables fast all-sky queries against probabilistic multimessenger event localizations and telescope survey footprints. Questions such as “What are the galaxies contained within the 90% credible region of an event? ” and “What is the rank-ordered list of the fields within an observing footprint with the highest probability of containing the event? ” can be performed in less than a few seconds on commodity hardware using off-the-shelf cloud-managed database implementations without server-side database extensions. Common queries scale roughly linearly with the number of telescope pointings. As the number of fields grows into the hundreds or thousands, HEALPix Alchemy is orders of magnitude faster than other implementations. HEALPix Alchemy is now used as the spatial geometry engine within SkyPortal, which forms the basis of the Zwicky Transient Facility transient marshal, called Fritz.
Towards Flexible Sparsity-Aware Modeling: Automatic Tensor Rank Learning Using the Generalized Hyperbolic Prior

Tensor rank learning for canonical polyadic decomposition (CPD) has long been deemed as an essential yet challenging problem. In particular, since thetensor rank controls the complexity of the CPD model, its inaccurate learning would cause overfitting to noise or underfitting to the signal sources, and even destroy the interpretability of model parameters. However, the optimal determination of a tensor rank is known to be a non-deterministic polynomial-time hard (NP-hard) task. Rather than exhaustively searching for the best tensor rank via trial-and-error experiments, Bayesian inference under the Gaussian-gamma prior was introduced in the context of probabilistic CPD modeling, and it was shown to be an effective strategy for automatic tensor rank determination. This triggered flourishing research on other structured tensor CPDs with automatic tensor rank learning. On the other side of the coin, these research works also reveal that the Gaussian-gamma model does not perform well for high-rank tensors and/or low signal-to-noise ratios (SNRs). To overcome these drawbacks, in this paper, we introduce a more advanced generalized hyperbolic (GH) prior to the probabilistic CPD model, which not only includes the Gaussian-gamma model as a special case, but also is more flexible to adapt to different levels of sparsity. Based on this novel probabilistic model, an algorithm is developed under the framework of variational inference, where each update is obtained in a closed-form. Extensive numerical results, using synthetic data and real-world datasets, demonstrate the significantly improved performance of the proposed method in learning both low as well as high tensor ranks even for low SNR cases.
Pushing the limits of raw waveform speaker recognition

In recent years, speaker recognition systems based on raw waveform inputs have received increasing attention. However, the performance of such systems are typically inferior to the state-of-the-art handcrafted feature-based counterparts, which demonstrate equal error rates under 1% on the popular VoxCeleb1 test set. This paper proposes a novel speaker recognition model based on raw waveform inputs. The model incorporates recent advances in machine learning and speaker verification, including the Res2Net backbone module and multi-layer feature aggregation. Our best model achieves an equal error rate of 0.89%, which is competitive with the state-of-the-art models based on handcrafted features, and outperforms the best model based on raw waveform inputs by a large margin. We also explore the application of the proposed model in the context of self-supervised learning framework. Our self-supervised model outperforms single phase-based existing works in this line of research. Finally, we show that self-supervised pre-training is effective for the semi-supervised scenario where we only have a small set of labelled training data, along with a larger set of unlabelled examples.
MPED: Quantifying Point Cloud Distortion Based on Multiscale Potential Energy Discrepancy

In this article, we propose a new distortion quantification method for point clouds, the multiscale potential energy discrepancy (MPED). Currently, there is a lack of effective distortion quantification for a variety of point cloud perception tasks. Specifically, in human vision tasks, a distortion quantification method is used to predict human subjective scores and optimize the selection of human perception task parameters, such as dense point cloud compression and enhancement. In machine vision tasks, a distortion quantification method usually serves as loss function to guide the training of deep neural networks for unsupervised learning tasks (e.g., sparse point cloud reconstruction, completion, and upsampling). Therefore, an effective distortion quantification should be differentiable, distortion discriminable, and have low computational complexity. However, current distortion quantification cannot satisfy all three conditions. To fill this gap, we propose a new point cloud feature description method, the point potential energy (PPE), inspired by classical physics. We regard the point clouds are systems that have potential energy and the distortion can change the total potential energy. By evaluating various neighborhood sizes, the proposed MPED achieves global-local tradeoffs, capturing distortion in a multiscale fashion. We further theoretically show that classical Chamfer distance is a special case of our MPED. Extensive experiments show that the proposed MPED is superior to current methods on both human and machine perception tasks. Our code is available at https://github.com/Qi-Yangsjtu/MPED.
P-ADMMiRNN: Training RNN with Stable Convergence via An Efficient and Paralleled ADMM Approach

It is hard to train Recurrent Neural Network (RNN) with stable convergence and avoid gradient vanishing and exploding problems, as the weights in the recurrent unit are repeated from iteration to iteration. Moreover, RNN is sensitive to the initialization of weights and bias, which brings difficulties in training. The Alternating Direction Method of Multipliers (ADMM) has become a promising algorithm to train neural networks beyond traditional stochastic gradient algorithms with the gradient-free features and immunity to unsatisfactory conditions. However, ADMM could not be applied to train RNN directly since the state in the recurrent unit is repetitively updated over timesteps. Therefore, this work builds a new framework named ADMMiRNN upon the unfolded form of RNN to address the above challenges simultaneously. We also provide novel update rules and theoretical convergence analysis. We explicitly specify essential update rules in the iterations of ADMMiRNN with constructed approximation techniques and solutions to each sub-problem instead of vanilla ADMM. Numerical experiments are conducted on MNIST, IMDb, and text classification tasks. ADMMiRNN achieves convergent results and outperforms the compared baselines. Furthermore, ADMMiRNN trains RNN more stably without gradient vanishing or exploding than stochastic gradient algorithms. We also provide a distributed paralleled algorithm regarding ADMMiRNN, named P-ADMMiRNN, including Synchronous Parallel ADMMiRNN (SP-ADMMiRNN) and Asynchronous Parallel ADMMiRNN (AP-ADMMiRNN), which is the first to train RNN with ADMM in an asynchronous parallel manner. The source code is publicly available.
An Adaptive Benchmark for Modeling User Exploration of Large Datasets

Interactive analysis systems provide efficient and accessible means by which users of varying technical experience can comfortably manipulate and analyze data using interactive widgets. Widgets are elements of interaction within a user interface (e.g. scrollbar, button, etc). Interactions with these widgets produce database queries whose results determine the subsequent changes made to the current visualization made by the user. In this paper, we present a tool that extends IDEBench to ingest visualization interfaces and a dataset, and estimate the expected database load that would be generated by real users. Our tool analyzes the interactive capabilities of the visualization and creates the queries that support the various interactions. We began with a proof of concept implementation of every interaction widget, which led us to define three distinct sets of query templates that can support all interactions. We then show that these templates can be layered to imitate various interfaces and tailored to any dataset. Secondly, we simulate how users would interact with the proposed interface and report on the strain that such use would place on the database management system.
Demystifying Software Release Note Issues on GitHub

Release notes (RNs) summarize main changes between two consecutive software versions and serve as a central source of information when users upgrade software. While producing high quality RNs can be hard and poses a variety of challenges to developers, a comprehensive empirical understanding of these challenges is still lacking. In this paper, we bridge this knowledge gap by manually analyzing 1,731 latest GitHub issues to build a comprehensive taxonomy of RN issues with four dimensions: Content, Presentation, Accessibility, and Production. Among these issues, nearly half (48.47%) of them focus on Production; Content, Accessibility, and Presentation take 25.61 %, 17.65%, and 8.27%, respectively. We find that: 1) RN producers are more likely to miss information than to include incorrect information, especially for breaking changes; 2) improper layout may bury important information and confuse users; 3) many users find RNs inaccessible due to link deterioration, lack of notification, and obfuscate RN locations; 4) automating and regulating RN production remains challenging despite the great needs of RN producers. Our taxonomy not only pictures a roadmap to improve RN production in practice but also reveals interesting future research directions for automating RN production.
Towards Filling the Gaps around Recurrent Events in High-Dimensional Framework: Literature Review and Early Comparison

Background Study individuals may face repeated events overtime. However, there is no consensus around learning approaches to use in a high-dimensional framework for survival data (when the number of variables exceeds the number of individuals, i.e., p>n). This study aimed at identifying learning algorithms for analyzing/predicting recurrent events and at comparing them to standard statistical models in various data simulation settings. Methods A literature review (LR) was conducted to provide state-of-the-art methodology. Data were then simulated including variations of the number of variables and proportion of active variables. Learning algorithms from the LR were compared to standard methods in such simulation scheme. Evaluation measures were Harrell's concordance index (C-index), Kim's C-index and error rate for active variables. Results Seven publications were identified, consisting in four methodological studies, one application paper and two review. The broken adaptive ridge penalization and the RankDeepSurv deep neural network were used for comparison. On simulated data, the standard models failed when p>n. Penalized Andersen-Gill and frailty models outperformed, whereas RankDeepSurv reported lower performances. Conclusion As no guidelines support a specific approach, this study helps to better understand mechanisms and limits of investigated methods in such context.
Photographic Visualization of Weather Forecasts with Generative Adversarial Networks

Outdoor webcam images jointly visualize many aspects of the past and present weather, and since they are also easy to interpret, they are consulted by meteorologists and the general public alike. Weather forecasts, in contrast, are communicated as text, pictograms, or charts, each focusing on separate aspects of the future weather. We therefore introduce a method that uses photographic images to also visualize weather forecasts. This is a challenging task because photographic visualizations of weather forecasts should look real and match the predicted weather conditions, the transition from observation to forecast should be seamless, and there should be visual continuity between images for consecutive lead times. We use conditional generative adversarial networks to synthesize such visualizations. The generator network, conditioned on the analysis and the forecasting state of the numerical weather prediction (NWP) model, transforms the present camera image into the future. The discriminator network judges whether a given image is the real image of the future, or whether it has been synthesized. Training the two networks against each other results in a visualization method that scores well on all four evaluation criteria. We present results for three camera sites across Switzerland that differ in climatology and terrain. We show that even experts struggle to distinguish real from generated images, achieving only a 59% accuracy. The generated images match the atmospheric, ground, and illumination conditions visible in the true future images in 67% up to 99% of cases. Nowcasting sequences of generated images achieve a seamless transition from observation to forecast and attain good visual continuity.
Properties and Performance of the ABCDe Random Graph Model with Community Structure

In this paper, we investigate properties and performance of synthetic random graph models with a built-in community structure. Such models are important for evaluating and tuning community detection algorithms that are unsupervised by nature. We propose ABCDe, a multi-threaded implementation of the ABCD (Artificial Benchmark for Community Detection) graph generator. We discuss the implementation details of the algorithm and compare it with both the previously available sequential version of the ABCD model and with the parallel implementation of the standard and extensively used LFR (Lancichinetti--Fortunato--Radicchi) generator. We show that ABCDe is more than ten times faster and scales better than the parallel implementation of LFR provided in NetworKit. Moreover, the algorithm is not only faster but random graphs generated by ABCD have similar properties to the ones generated by the original LFR algorithm, while the parallelized NetworKit implementation of LFR produces graphs that have noticeably different characteristics.
FedADMM: A federated primal-dual algorithm allowing partial participation

Federated learning is a framework for distributed optimization that places emphasis on communication efficiency. In particular, it follows a client-server broadcast model and is appealing because of its ability to accommodate heterogeneity in client compute and storage resources, non-i.i. d. data assumptions, and data privacy. Our contribution is to offer a new federated learning algorithm, FedADMM, for solving non-convex composite optimization problems with non-smooth regularizers. We prove the convergence of FedADMM for the case when not all clients are able to participate in a given communication round under a very general sampling model.
Constraining Black Hole Natal Kicks with Astrometric Microlensing

Multiple pieces of evidence suggest that neutron stars receive large kicks when formed from the remnant of a collapsing star. However, the evidence for whether black holes (BHs) receive natal kicks is less clear, reliant on weak constraints from the analysis of BH X-ray binaries and massive runaway and walkaway stars. Here we show, for the first time, that recent microlensing detections offer a new method for measuring the kicks BHs receive at birth. When a BH is identified through both photometric and astrometric microlensing and when the lensed star has a known distance and proper motion, the mass, distance, and proper motion of the BH can be determined. We study the runaway velocities for components of eccentric binaries disrupted during a supernova (SN), finding the peculiar velocity correlates strongly with the kick a BH received at birth, typically within 20%, even when the natal kick is smaller than the orbital velocity. Therefore, by measuring the peculiar velocity of a BH or other compact object that formed from a binary which disrupted during core collapse, we are in effect measuring the natal kick that object received. We focus on MOA-2011-BLG-191/OGLE-2011-BLG-0462, an isolated, single BH detected by microlensing, and consider a range of possible formation scenarios, including its formation from the disruption of a binary during a SN event. We determine that MOA-2011-BLG-191/OGLE-2011-BLG-0462 has a Milky Way orbit consistent with a thick-disk population, but if it was formed within the kinematic thin disk it received a natal kick ≲100 km s−1.
Optical and X-ray GRB Fundamental Planes as cosmological distance indicators

Gamma-ray bursts (GRBs), can be employed as standardized candles, extending the distance ladder beyond Type Ia supernovae (SNe Ia, z = 2.26). We standardize GRBs using the three-dimensional (3D) Fundamental Plane relation (the Dainotti relation) among the rest-frame end time of the X-ray plateau emission, its corresponding luminosity, and the peak prompt luminosity. Combining SNe Ia and GRBs, we constrain ΩM = 0.299 ± 0.009 assuming a flat Λ cold dark matter (ΛCDM) cosmology with and without correcting GRBs for selection biases and redshift evolution. Using a 3D optical Dainotti correlation, we find this sample is as efficacious in the determination of ΩM as the X-ray sample. We trimmed our GRB samples to achieve tighter planes to simulate additional GRBs. We determined how many GRBs are needed as stand-alone probes to achieve a comparable precision on ΩM to the one obtained by SNe Ia only. We reach the same error measurements derived using SNe Ia in 2011 and 2014 with 142 and 284 simulated optical GRBs, respectively, considering the error bars on the variables halved. These error limits will be reached in 2038 and in 2047, respectively. Using a doubled sample (obtained by future machine learning approaches allowing a light-curve reconstruction and the estimates of GRB redshifts when z is unknown) compared to the current sample, with error bars halved we will reach the same precision as SNe Ia in 2011 and 2014, now and in 2026, respectively. If we consider the current SNe precision, this will be reached with 390 optical GRBs by 2054.
Process Mining Analysis of Puzzle-Based Cybersecurity Training

The hands-on cybersecurity training quality is crucial to mitigate cyber threats and attacks effectively. However, practical cybersecurity training is strongly process-oriented, making the post-training analysis very difficult. This paper presents process-mining methods applied to the learning analytics workflow. We introduce a unified approach to reconstructing behavioral graphs from sparse event logs of cyber ranges. Furthermore, we discuss significant data features that affect their practical usability for educational process mining. Based on that, methods of dealing with the complexity of process graphs are presented, taking advantage of the puzzle-based gamification of in-class training sessions.
Synthesis and Execution of Communicative Robotic Movements with Generative Adversarial Networks

Object manipulation is a natural activity we perform every day. How humans handle objects can communicate not only the willfulness of the acting, or key aspects of the context where we operate, but also the properties of the objects involved, without any need for explicit verbal description. Since human intelligence comprises the ability to read the context, allowing robots to perform actions that intuitively convey this kind of information would greatly facilitate collaboration. In this work, we focus on how to transfer on two different robotic platforms the same kinematics modulation that humans adopt when manipulating delicate objects, aiming to endow robots with the capability to show carefulness in their movements. We choose to modulate the velocity profile adopted by the robots' end-effector, inspired by what humans do when transporting objects with different characteristics. We exploit a novel Generative Adversarial Network architecture, trained with human kinematics examples, to generalize over them and generate new and meaningful velocity profiles, either associated with careful or not careful attitudes. This approach would allow next generation robots to select the most appropriate style of movement, depending on the perceived context, and autonomously generate their motor action execution.
High-Dimensional Vector Autoregression with Common Response and Predictor Factors

The reduced-rank vector autoregressive (VAR) model can be interpreted as a supervised factor model, where two factor modelings are simultaneously applied to response and predictor spaces. This article introduces a new model, called vector autoregression with common response and predictor factors, to explore further the common structure between the response and predictors in the VAR framework. The new model can provide better physical interpretations and improve estimation efficiency. In conjunction with the tensor operation, the model can easily be extended to any finite-order VAR model. A regularization-based method is considered for the high-dimensional estimation with the gradient descent algorithm, and its computational and statistical convergence guarantees are established. For data with pervasive cross-sectional dependence, a transformation for responses is developed to alleviate the diverging eigenvalue effect. Moreover, we consider additional sparsity structure in factor loading for the case of ultra-high dimension. Simulation experiments confirm our theoretical findings and a macroeconomic application showcases the appealing properties of the proposed model in structural analysis and forecasting.