Miracle-dz/UniFAR-FTUs huggingface dataset:
Goal-Oriented Next Best Activity Recommendation using Reinforcement Learning

Recommending a sequence of activities for an ongoing case requires that the recommendations conform to the underlying business process and meet the performance goal of either completion time or process outcome. Existing work on next activity prediction can predict the future activity but cannot provide guarantees of the prediction being conformant or meeting the goal. Hence, we propose a goal-oriented next best activity recommendation. Our proposed framework uses a deep learning model to predict the next best activity and an estimated value of a goal given the activity. A reinforcement learning method explores the sequence of activities based on the estimates likely to meet one or more goals. We further address a real-world problem of multiple goals by introducing an additional reward function to balance the outcome of a recommended activity and satisfy the goal. We demonstrate the effectiveness of the proposed method on four real-world datasets with different characteristics. The results show that the recommendations from our proposed approach outperform in goal satisfaction and conformance compared to the existing state-of-the-art next best activity recommendation techniques.
Multi-View Point Cloud Registration Based on Evolutionary Multitasking With Bi-Channel Knowledge Sharing Mechanism

Multi-view point cloud registration is fundamental in 3D reconstruction. Since there are close connections between point clouds captured from different viewpoints, registration performance can be enhanced if these connections be harnessed properly. Therefore, this article models the registration problem as multi-task optimization, and proposes a novel bi-channel knowledge sharing mechanism for effective and efficient problem solving. The modeling of multi-view point cloud registration as multi-task optimization are twofold. By simultaneously considering the local accuracy of two point clouds as well as the global consistency posed by all the point clouds involved, a fitness function with an adaptive threshold is derived. Also a framework of the co-evolutionary search process is defined for the concurrent optimization of multiple fitness functions belonging to related tasks. To enhance solution quality and convergence speed, the proposed bi-channel knowledge sharing mechanism plays its role. The intra-task knowledge sharing introduces aiding tasks that are much simpler to solve, and useful information is shared across aiding tasks and the original tasks, accelerating the search process. The inter-task knowledge sharing explores commonalities buried among the original tasks, aiming to prevent tasks from getting stuck to local optima. Comprehensive experiments conducted on model object as well as scene point clouds show the efficacy of the proposed method.
Discrete-time gradient flows in Gromov hyperbolic spaces

We investigate fundamental properties of the proximal point algorithm for Lipschitz convex functions on (proper, geodesic) Gromov hyperbolic spaces. We show that the proximal point algorithm from an arbitrary initial point can find a point close to a minimizer of the function. Moreover, we establish contraction estimates (akin to trees) for the proximal (resolvent) operator. Our results can be applied to small perturbations of trees.
Application of Clustering Algorithms for Dimensionality Reduction in Infrastructure Resilience Prediction Models

Recent studies increasingly adopt simulation-based machine learning (ML) models to analyze critical infrastructure system resilience. For realistic applications, these ML models consider the component-level characteristics that influence the network response during emergencies. However, such an approach could result in a large number of features and cause ML models to suffer from the `curse of dimensionality'. We present a clustering-based method that simultaneously minimizes the problem of high-dimensionality and improves the prediction accuracy of ML models developed for resilience analysis in large-scale interdependent infrastructure networks. The methodology has three parts: (a) generation of simulation dataset, (b) network component clustering, and (c) dimensionality reduction and development of prediction models. First, an interdependent infrastructure simulation model simulates the network-wide consequences of various disruptive events. The component-level features are extracted from the simulated data. Next, clustering algorithms are used to derive the cluster-level features by grouping component-level features based on their topological and functional characteristics. Finally, ML algorithms are used to develop models that predict the network-wide impacts of disruptive events using the cluster-level features. The applicability of the method is demonstrated using an interdependent power-water-transport testbed. The proposed method can be used to develop decision-support tools for post-disaster recovery of infrastructure networks.
Neural jacobian fields

This paper introduces a framework designed to accurately predict piecewise linear mappings of arbitrary meshes via a neural network, enabling training and evaluating over heterogeneous collections of meshes that do not share a triangulation, as well as producing highly detail-preserving maps whose accuracy exceeds current state of the art. The framework is based on reducing the neural aspect to a prediction of a matrix for a single given point, conditioned on a global shape descriptor. The field of matrices is then projected onto the tangent bundle of the given mesh, and used as candidate jacobians for the predicted map. The map is computed by a standard Poisson solve, implemented as a differentiable layer with cached pre-factorization for efficient training. This construction is agnostic to the triangulation of the input, thereby enabling applications on datasets with varying triangulations. At the same time, by operating in the intrinsic gradient domain of each individual mesh, it allows the framework to predict highly-accurate mappings. We validate these properties by conducting experiments over a broad range of scenarios, from semantic ones such as morphing, registration, and deformation transfer, to optimization-based ones, such as emulating elastic deformations and contact correction, as well as being the first work, to our knowledge, to tackle the task of learning to compute UV parameterizations of arbitrary meshes. The results exhibit the high accuracy of the method as well as its versatility, as it is readily applied to the above scenarios without any changes to the framework.
RoboCraft: Learning to See, Simulate, and Shape Elasto-Plastic Objects with Graph Networks

Modeling and manipulating elasto-plastic objects are essential capabilities for robots to perform complex industrial and household interaction tasks (e.g., stuffing dumplings, rolling sushi, and making pottery). However, due to the high degree of freedom of elasto-plastic objects, significant challenges exist in virtually every aspect of the robotic manipulation pipeline, e.g., representing the states, modeling the dynamics, and synthesizing the control signals. We propose to tackle these challenges by employing a particle-based representation for elasto-plastic objects in a model-based planning framework. Our system, RoboCraft, only assumes access to raw RGBD visual observations. It transforms the sensing data into particles and learns a particle-based dynamics model using graph neural networks (GNNs) to capture the structure of the underlying system. The learned model can then be coupled with model-predictive control (MPC) algorithms to plan the robot's behavior. We show through experiments that with just 10 minutes of real-world robotic interaction data, our robot can learn a dynamics model that can be used to synthesize control signals to deform elasto-plastic objects into various target shapes, including shapes that the robot has never encountered before. We perform systematic evaluations in both simulation and the real world to demonstrate the robot's manipulation capabilities and ability to generalize to a more complex action space, different tool shapes, and a mixture of motion modes. We also conduct comparisons between RoboCraft and untrained human subjects controlling the gripper to manipulate deformable objects in both simulation and the real world. Our learned model-based planning framework is comparable to and sometimes better than human subjects on the tested tasks.
LPGNet: Link Private Graph Networks for Node Classification

Classification tasks on labeled graph-structured data have many important applications ranging from social recommendation to financial modeling. Deep neural networks are increasingly being used for node classification on graphs, wherein nodes with similar features have to be given the same label. Graph convolutional networks (GCNs) are one such widely studied neural network architecture that perform well on this task. However, powerful link-stealing attacks on GCNs have recently shown that even with black-box access to the trained model, inferring which links (or edges) are present in the training graph is practical. In this paper, we present a new neural network architecture called LPGNet for training on graphs with privacy-sensitive edges. LPGNet provides differential privacy (DP) guarantees for edges using a novel design for how graph edge structure is used during training. We empirically show that LPGNet models often lie in the sweet spot between providing privacy and utility: They can offer better utility than "trivially" private architectures which use no edge information (e.g., vanilla MLPs) and better resilience against existing link-stealing attacks than vanilla GCNs which use the full edge structure. LPGNet also offers consistently better privacy-utility tradeoffs than DPGCN, which is the state-of-the-art mechanism for retrofitting differential privacy into conventional GCNs, in most of our evaluated datasets.
Using network structure and community detection to discover important website features when distinguishing between phishing and legitimate ones

In this paper, we uncover the essential features of websites that allow intelligent models to distinguish between phishing and legitimate sites. Phishing websites are those that are made with a similar user interface and a near similar address to trustworthy websites in order to persuade users to input their private data for potential future misuse by attackers. Detecting phishing websites with intelligent systems is an important goal to protect users, companies, and other online services that use the HTTP protocol. An intelligent model needs to distinguish features that are important as input to predict phishing sites. In this research, using correlation-based networks, we provide a novel network-based method to find features that are more important in phishing detection. The networks are trained and tested on an established phishing dataset. Three different networks are made by partitioning the dataset by its data instance labels. The important features are found by discovering the hubs of these networks, and the results are presented and analysed. This is the first time using a network-based approach for feature selection which is a fast and accurate way to do so.
Characterizing TMS-EEG perturbation indexes using signal energy: initial study on Alzheimer's Disease classification

Transcranial Magnetic Stimulation (TMS) combined with EEG recordings (TMS-EEG) has shown great potential in the study of the brain and in particular of Alzheimer's Disease (AD). In this study, we propose an automatic method of determining the duration of TMS-induced perturbation of the EEG signal as a potential metric reflecting the brain's functional alterations. A preliminary study is conducted in patients with Alzheimer's disease (AD). Three metrics for characterizing the strength and duration of TMS-evoked EEG (TEP) activity are proposed and their potential in identifying AD patients from healthy controls was investigated. A dataset of TMS-EEG recordings from 17 AD and 17 healthy controls (HC) was used in our analysis. A Random Forest classification algorithm was trained on the extracted TEP metrics and its performance is evaluated in a leave-one-subject-out cross-validation. The created model showed promising results in identifying AD patients from HC with an accuracy, sensitivity and specificity of 69.32%, 72.23% and 66.41%, respectively. Clinical relevance— Three preliminary metrics were proposed to quantify the strength and duration of the response to TMS on EEG data. The proposed metrics were successfully used to identify Alzheimer's disease patients from healthy controls. These results proved the potential of this approach which will provide additional diagnostic value.
Hybrid Beamforming Design for Millimeter Wave Multiuser MIMO Systems with Dynamic Subarrays

In this letter, we investigate the millimeter wave (mmWave) downlink multiuser multiple-input multiple-output (MU-MIMO) system, adopting the dynamic subarray architecture at the base station and considering the multi-stream communication for each user. Aiming at maximizing the system spectral efficiency, we propose a novel hybrid beamforming design. First, assuming no inter-user interference (IUI), we easily get the optimal fully-digital beamformers and combiners using the singular value decomposition of each user channel and the waterfilling algorithm. Then, based on the obtained fullydigital beamformers, we propose a Kuhn-Munkres algorithmassisted dynamic hybrid beamforming design, which guarantees that each radio-frequency chain is connected to at least one antenna. Finally, we propose to further project each obtained digital beamformer onto the null space of all the other equivalent user channels to cancel the IUI. Numerical results verify the superiority of our proposed hybrid beamforming design.
Impact of very massive stars on the chemical evolution of extremely metal-poor galaxies

In recent observations of extremely metal-poor low-mass starburst galaxies, almost solar Fe/O ratios are reported, despite N/O ratios consistent with the low metallicity. We investigate if the peculiar Fe/O ratios can be a distinctive signature of an early enrichment produced by very massive objects dying as Pair-Instability Supernovae (PISN). We run chemical evolution models with yields that account for the contribution by PISN. We use both the recent non-rotating stellar yields from Goswami et al. 2021, and new yields from rotating very massive stars calculated on purpose in this work. We also search for the best initial mass function (IMF) that is able to reproduce the observations. We can reproduce the observations by adopting a bi-modal IMF and by including an initial burst of rotating very massive stars. Only with a burst of very massive stars can we reproduce the almost solar Fe/O ratios at the estimated young ages. We also confirm that rotation is absolutely needed to concomitantly reproduce the observed N/O ratios. These results stress the importance of very massive stars in galactic chemical evolution studies and strongly support a top-heavy initial mass function in the very early evolutionary stages of metal poor starburst galaxies.
Post Approvals in Online Communities

In many online communities, community leaders (i.e., moderators and administrators) can proactively filter undesired content by requiring posts to be approved before publication. But although many communities adopt post approvals, there has been little research on its impact on community behavior. Through a longitudinal analysis of 233,402 Facebook Groups, we examined 1) the factors that led to a community adopting post approvals and 2) how the setting shaped subsequent user activity and moderation in the group. We find that communities that adopted post approvals tended to do so following sudden increases in user activity (e.g., comments) and moderation (e.g., reported posts). This adoption of post approvals led to fewer but higher-quality posts. Though fewer posts were shared after adoption, not only did community members write more comments, use more reactions, and spend more time on the posts that were shared, they also reported these posts less. Further, post approvals did not significantly increase the average time leaders spent in the group, though groups that enabled the setting tended to appoint more leaders. Last, the impact of post approvals varied with both group size and how the setting was used, e.g., group size mediates whether leaders spent more or less time in the group following the adoption of the setting. Our findings suggest ways that proactive content moderation may be improved to better support online communities.
Improved Background Model for the Large Area X-Ray Proportional Counter (LAXPC) Instrument on board AstroSat

We present an improved background model for the Large Area X-ray Proportional Counter (LAXPC) detectors on board AstroSat. Because of the large collecting area and high pressure, the LAXPC instrument has a large background count rate, which varies during the orbit. Apart from the variation with latitude and longitude during the orbit there is a prominent quasi-diurnal variation which has not been previously modeled. Using over 5 yr of background observations, we determined the period of the quasi-diurnal variation to be 84,495 s and using this period it is possible to account for the variation and also identify time intervals where the fit is not good. These lead to a significant improvement in the background model. The quasi-diurnal variation can be ascribed to the changes in charged particle flux in the near-Earth orbit.
Implicit semantic-based personalized micro-videos recommendation

With the rapid development of mobile Internet and big data, a huge amount of data is generated in the network, but the data that users are really interested in a very small portion. To extract the information that users are interested in from the huge amount of data, the information overload problem needs to be solved. In the era of mobile internet, the user's characteristics and other information should be combined in the massive amount of data to quickly and accurately recommend content to the user, as far as possible to meet the user's personalized needs. Therefore, there is an urgent need to realize high-speed and effective retrieval in tens of thousands of micro-videos. Video data content contains complex meanings, and there are intrinsic connections between video data. For multimodal information, subspace coding learning is introduced to build a coding network from public potential representations to multimodal feature information, taking into account the consistency and complementarity of information under each modality to obtain a public representation of the complete eigenvalue. An end-to-end reordering model based on deep learning and attention mechanism, called interest-related product similarity model based on multimodal data, is proposed for providing top-N recommendations. The multimodal feature learning module, interest-related network module and product similarity recommendation module together form the new model.By conducting extensive experiments on publicly accessible datasets, the results demonstrate the state-of-the-art performance of our proposed algorithm and its effectiveness.
Observability-Aware Intrinsic and Extrinsic Calibration of LiDAR-IMU Systems

Accurate and reliable sensor calibration is essential to fuse LiDAR and inertial measurements, which are usually available in robotic applications. In this article, we propose a novel LiDAR-IMU calibration method within the continuous-time batch-optimization framework, where the intrinsics of both sensors and the spatial-temporal extrinsics between sensors are calibrated without using calibration infrastructure, such as fiducial tags. Compared to discrete-time approaches, the continuous-time formulation has natural advantages for fusing high-rate measurements from LiDAR and IMU sensors. To improve efficiency and address degenerate motions, the following two observability-aware modules are leveraged: first, The information-theoretic data selection policy selects only the most informative segments for calibration during data collection, which significantly improves the calibration efficiency by processing only the selected informative segments. Second, the observability-aware state update mechanism in nonlinear least-squares optimization updates only the identifiable directions in the state space with truncated singular value decomposition, which enables accurate calibration results even under degenerate cases where informative data segments are not available. The proposed LiDAR-IMU calibration approach has been validated extensively in both simulated and real-world experiments with different robot platforms, demonstrating its high accuracy and repeatability in commonly-seen human-made environments.
Spectral Methods for capillary surfaces described by bounded generating curves

We consider capillary surfaces that are constructed by bounded generating curves. This class of surfaces includes radially symmetric and lower dimensional fluid-fluid interfaces. We use the arc-length representation of the differential equations for these surfaces to allow for vertical points and inflection points along the generating curve. These considerations admit capillary tubes, sessile drops, and fluids in annular tubes as well as other examples. We present a pseudo-spectral method for approximating solutions to the associated boundary value problems based on interpolation by Chebyshev polynomials. This method is observably more stable than the traditional shooting method and it is computationally lean and fast. The algorithm is also adaptive, but does not use the adaptive automation in Chebfun.
Fast Rate Generalization Error Bounds: Variations on a Theme

A recent line of works, initiated by [1] and [2], has shown that the generalization error of a learning algorithm can be upper bounded by information measures. In most of the relevant works, the convergence rate of the expected generalization error is in the form of $O(\sqrt {\lambda I/n} )$ where λ is an assumption-dependent coefficient and I is some information-theoretic quantities such as the mutual information between the data sample and the learned hypothesis. However, such a learning rate is typically considered to be "slow", compared to a "fast rate" of O(1 /n) in many learning scenarios. In this work, we first show that the square root does not necessarily imply a slow rate, and a fast rate result can still be obtained using this bound by evaluating λ under an appropriate assumption. Furthermore, we identify the key conditions needed for the fast rate generalization error, which we call the ( η, c)-central condition. Under this condition, we give information-theoretic bounds on the generalization error and excess risk, with a convergence rate of O (1 /n) for specific learning algorithms such as empirical risk minimization. Finally, analytical examples are given to show the effectiveness of the bounds.