Miracle-dz/UniFAR-FTUs huggingface dataset:
Towards Time-Aware Context-Aware Deep Trust Prediction in Online Social Networks

Trust can be defined as a measure to determine which source of information is reliable and with whom we should share or from whom we should accept information. There are several applications for trust in Online Social Networks (OSNs), including social spammer detection, fake news detection, retweet behaviour detection and recommender systems. Trust prediction is the process of predicting a new trust relation between two users who are not currently connected. In applications of trust, trust relations among users need to be predicted. This process faces many challenges, such as the sparsity of user-specified trust relations, the context-awareness of trust and changes in trust values over time. In this dissertation, we analyse the state-of-the-art in pair-wise trust prediction models in OSNs. We discuss three main challenges in this domain and present novel trust prediction approaches to address them. We first focus on proposing a low-rank representation of users that incorporates users' personality traits as additional information. Then, we propose a set of context-aware trust prediction models. Finally, by considering the time-dependency of trust relations, we propose a dynamic deep trust prediction approach. We design and implement five pair-wise trust prediction approaches and evaluate them with real-world datasets collected from OSNs. The experimental results demonstrate the effectiveness of our approaches compared to other state-of-the-art pair-wise trust prediction models.
A modular phantom and software to characterize 3D geometric distortion in MRI

Magnetic resonance imaging (MRI) offers outstanding soft tissue contrast that may reduce uncertainties in target and organ-at-risk delineation and enable online adaptive image-guided treatment. Spatial distortions resulting from non-linearities in the gradient fields and non-uniformity in the main magnetic field must be accounted for across the imaging field-of-view to prevent systematic errors during treatment delivery. This work presents a modular phantom and software application to characterize geometric distortion (GD) within the large field-of-view MRI images required for radiation therapy simulation. The modular phantom is assembled from a series of rectangular foam blocks containing high-contrast fiducial markers in a known configuration. The modular phantom design facilitates transportation of the phantom between different MR scanners and MR-guided linear accelerators and allows the phantom to be adapted to fit different sized bores or coils. The phantom was evaluated using a 1.5 T MR-guided linear accelerator (MR-Linac) and 1.5 T and 3.0 T diagnostic scanners. Performance was assessed by varying acquisition parameters to induce image distortions in a known manner. Imaging was performed using T1 and T2 weighted pulse sequences with 2D and 3D distortion correction algorithms and the receiver bandwidth (BW) varied as 250–815 Hz pixel−1. Phantom set-up reproducibility was evaluated across independent set-ups. The software was validated by comparison with a non-modular phantom. Average geometric distortion was 0.94 ± 0.58 mm for the MR-Linac, 0.90 ± 0.53 mm for the 1.5 T scanner, and 1.15 ± 0.62 mm for the 3.0 T scanner, for a 400 mm diameter volume-of-interest. GD increased, as expected, with decreasing BW, and with the 2D versus 3D correction algorithm. Differences in GD attributed to phantom set-up were 0.13 mm or less. Differences in GD for the two software applications were less than 0.07 mm. A novel modular phantom was developed to evaluate distortions in MR images for radiation therapy applications.
K-Core Based Temporal Graph Convolutional Network for Dynamic Graphs

Graph representation learning is a fundamental task in various applications that strives to learn low-dimensional embeddings for nodes that can preserve graph topology information. However, many existing methods focus on static graphs while ignoring evolving graph patterns. Inspired by the success of graph convolutional networks(GCNs) in static graph embedding, we propose a novel k-core based temporal graph convolutional network, the CTGCN, to learn node representations for dynamic graphs. In contrast to previous dynamic graph embedding methods, CTGCN can preserve both local connective proximity and global structural similarity while simultaneously capturing graph dynamics. In the proposed framework, the traditional graph convolution is generalized into two phases, feature transformation and feature aggregation, which gives the CTGCN more flexibility and enables the CTGCN to learn connective and structural information under the same framework. Experimental results on 7 real-world graphs demonstrate that the CTGCN outperforms existing state-of-the-art graph embedding methods in several tasks, including link prediction and structural role classification. The source code of this work can be obtained from https://github.com/jhljx/CTGCN.
A critique of covariant emergent gravity

I address some problems encountered in the formulation of relativistic models encompassing the MOND phenomenology of radial acceleration. I explore scalar and vector theories with fractional kinetic terms and f(R)-type gravity, demanding that the energy density be bounded from below and that superluminal modes be absent, but also that some consistency constraints with observational results hold. I identify configurations whose energy is unbounded from below and formulate some no-go statements for vector field models and modified gravity theories. Finally, I discuss superfluid dark matter as a hybrid theory lying between cold dark matter and modified gravity, highlighting some difficulties present also in this case, which appears preferable to the others.
Universal Differentiable Renderer for Implicit Neural Representations

The goal of this work is to learn implicit 3D shape representation with 2D supervision (i.e., a collection of images). To that end we introduce the Universal Differentiable Renderer (UDR) a neural network architecture that can provably approximate reflected light from an implicit neural representation of a 3D surface, under a wide set of reflectance properties and lighting conditions. Experimenting with the task of multiview 3D reconstruction, we find our model to improve upon the baselines in the accuracy of the reconstructed 3D geometry and rendering from unseen viewing directions.
Active Interaction Force Control for Omnidirectional Aerial Contact-Based Inspection

This paper presents and validates two approaches for active interaction force control and planning for omnidirectional aerial manipulation platforms, with the goal of aerial contact inspection in unstructured environments. We extend upon an axis-selective impedance controller to present a variable axis-selective impedance control which integrates direct force control for intentional interaction, using feedback from an on-board force sensor. The control approaches aim to reject disturbances in free flight, while handling unintentional interaction, and actively controlling desired interaction forces. A fully actuated and omnidirectional tilt-rotor aerial system is used to show capabilities of the control and planning methods. Experiments demonstrate disturbance rejection, push-and-slide interaction, and force controlled interaction in different flight orientations. The system is validated as a tool for non-destructive testing of concrete infrastructure, and statistical results of interaction control performance are presented and discussed.
Monocular visual-inertial SLAM algorithm combined with wheel speed anomaly detection

To address the weak observability of monocular visual-inertial odometers on ground-based mobile robots, this paper proposes a monocular inertial SLAM algorithm combined with wheel speed anomaly detection. The algorithm uses a wheel speed odometer pre-integration method to add the wheel speed measurement to the least-squares problem in a tightly coupled manner. For abnormal motion situations, such as skidding and abduction, this paper adopts the Mecanum mobile chassis control method, based on torque control. This method uses the motion constraint error to estimate the reliability of the wheel speed measurement. At the same time, in order to prevent incorrect chassis speed measurements from negatively influencing robot pose estimation, this paper uses three methods to detect abnormal chassis movement and analyze chassis movement status in real time. When the chassis movement is determined to be abnormal, the wheel odometer pre-integration measurement of the current frame is removed from the state estimation equation, thereby ensuring the accuracy and robustness of the state estimation. Experimental results show that the accuracy and robustness of the method in this paper are better than those of a monocular visual-inertial odometer.
Continual Graph Learning

Graph Neural Networks (GNNs) have recently received significant research attention due to their prominent performance on a variety of graph-related learning tasks. Most of the existing works focus on either static or dynamic graph settings, addressing a particular task, e.g., node/graph classification, link prediction. In this work, we investigate the question: can GNNs be applied to continuously learning a sequence of tasks? Towards that, we explore the Continual Graph Learning (CGL) paradigm and we present the Experience Replay based framework ER-GNN for CGL to address the catastrophic forgetting problem in existing GNNs. ER-GNN stores knowledge from previous tasks as experiences and replays them when learning new tasks to mitigate the forgetting issue. We propose three experience node selection strategies: mean of features, coverage maximization and influence maximization, to guide the process of selecting experience nodes. Extensive experiments on three benchmark datasets demonstrate the effectiveness of ER-GNN and shed light on the incremental (non-Euclidean) graph structure learning.
Kac meets Johnson and Lindenstrauss: a memory-optimal, fast Johnson-Lindenstrauss transform

Based on the Kac random walk on the orthogonal group, we present a fast Johnson-Lindenstrauss transform: given a set X of n points in R and an error parameter ǫ, this is a linear transformation Ψ : R → RO(ǫ−2 log n) such that ‖Ψx‖2 ∈ (1 − ǫ, 1 + ǫ) · ‖x‖2 for all x ∈ X , and such that for each x ∈ X , Ψx can be computed in time O(d log d+min{d logn, ǫ log n log(ǫ−1 logn)}) with only a constant amount of memory overhead. In some parameter regimes, our algorithm is best known, and essentially confirms a conjecture of Ailon and Chazelle. Massachusetts Institute of Technology. Department of Mathematics. Email: visheshj@mit.edu. Harvard University. Department of Statistics. Email: pillai@fas.harvard. edu. University of Ottawa. Department of Statistics. Email: smith.aaron. matthew@gmail.com.
Event-Based Control for Online Training of Neural Networks

Convolutional Neural Network (CNN) has become the most used method for image classification tasks. During its training the learning rate and the gradient are two key factors to tune for influencing the convergence speed of the model. Usual learning rate strategies are time-based, i.e., monotonous decay over time. Recent state-of-the-art techniques focus on adaptive gradient algorithms, i.e., Adam and its versions. In this letter we consider an online learning scenario and we propose two Event-Based control loops to adjust the learning rate of a classical algorithm E (Exponential)/PD (Proportional Derivative)-Control. The first Event-Based control loop will be implemented to prevent sudden drop of the learning rate when the model is approaching the optimum. The second Event-Based control loop will decide, based on the learning speed, when to switch to the next data batch. Experimental evaluation is provided using two state-of-the-art machine learning image datasets (CIFAR-10 and CIFAR-100). Results show the Event-Based E/PD is better than the original algorithm (higher final accuracy, lower final loss value), and the Double-Event-Based E/PD can accelerate the training process, save up to 67% training time compared to state-of-the-art algorithms and even result in better performance.
A Robotic 3D Perception System for Operating Room Environment Awareness

Purpose: We describe a 3D multi-view perception system for the da Vinci surgical system to enable Operating room (OR) scene understanding and context awareness. Methods: Our proposed system is comprised of four Time-of-Flight (ToF) cameras rigidly attached to strategic locations on the daVinci Xi patient side cart (PSC). The cameras are registered to the robot's kinematic chain by performing a one-time calibration routine and therefore, information from all cameras can be fused and represented in one common coordinate frame. Based on this architecture, a multi-view 3D scene semantic segmentation algorithm is created to enable recognition of common and salient objects/equipment and surgical activities in a da Vinci OR. Our proposed 3D semantic segmentation method has been trained and validated on a novel densely annotated dataset that has been captured from clinical scenarios. Results: The results show that our proposed architecture has acceptable registration error ($3.3\%\pm1.4\%$ of object-camera distance) and can robustly improve scene segmentation performance (mean Intersection Over Union - mIOU) for less frequently appearing classes ($\ge 0.013$) compared to a single-view method. Conclusion: We present the first dynamic multi-view perception system with a novel segmentation architecture, which can be used as a building block technology for applications such as surgical workflow analysis, automation of surgical sub-tasks and advanced guidance systems.
Perturbative Resonance during Dark Matter Production and Its Cosmological Implications

To trace the unknown particle nature of dark matter (DM) from observations in CMB, we study the co-evolution of DM density perturbation and primordial metric perturbation in the early Universe. By analytically solving the improved Einstein-Boltzmann equation to include all perturbative contributions from the DM productions, we observe an amplified perturbative resonance that takes place between DM density perturbation and scalar modes of metric perturbation. As this perturbative resonance does not affect the tensor modes, it results in a suppression of the tensor-to-scalar ratio of metric perturbation $r$. Then by using a typical reheating model to specify cosmic background, we establish an explicit relation between DM particle mass $m_\chi$ and $r$. As $r$ will be further constrained in the coming round of primordial gravitational wave detections, $m_\chi$ would be constrained accordingly.
Fasteriva: Update Rules for Independent Vector Analysis Based on Negentropy and the Majorize-Minimize Principle

Algorithms for Blind Source Separation (BSS) of acoustic signals require efficient and fast converging optimization strategies to adapt to nonstationary signal statistics and time-varying acoustic scenarios. In this paper, we derive fast converging update rules from a negentropy perspective, which are based on the Majorize-Minimize (MM) principle and eigenvalue decomposition. The presented update rules are shown to outperform competing state-of-the-art methods in terms of convergence speed at a comparable runtime due to the restriction to unitary demixing matrices. This is demonstrated by experiments with recorded real-world data.
UAV-Assisted Secure Communications in Terrestrial Cognitive Radio Networks: Joint Power Control and 3D Trajectory Optimization

This paper considers secure communications for an underlay cognitive radio network (CRN) in the presence of an external eavesdropper (Eve). The secrecy performance of CRNs is usually limited by the primary receiver's interference power constraint. To overcome this issue, we propose to use an unmanned aerial vehicle (UAV) as a friendly jammer to interfere Eve in decoding the confidential message from the secondary transmitter. Our goal is to jointly optimize the transmit power and UAV's trajectory in the three-dimensional space to maximize the average achievable secrecy rate of the secondary system. The formulated optimization problem is nonconvex due to the non-convexity of the objective and non-convexity of constraints, which is very challenging to solve. To obtain a suboptimal but efficient solution to the design problem, we first transform it into a more tractable form and then develop an iterative algorithm for its solution by leveraging the inner approximation (IA) framework. Combining tools from IA framework and S-procedure, we further extend the proposed algorithm to a more realistic scenario, where the imperfect location information of ground nodes (including Eve, secondary receiver and primary receiver) is considered, resulting in the average worst-case secrecy rate. Extensive numerical results are provided to demonstrate the merits of the proposed algorithms over existing approaches.
Prior Knowledge Driven Label Embedding for Slot Filling in Natural Language Understanding

Traditional slot filling in natural language understanding (NLU) predicts a one-hot vector for each word. This form of label representation lacks semantic correlation modeling, which leads to severe data sparsity problem, especially when adapting an NLU model to a new domain. To address this issue, a novel label embedding based slot filling framework is proposed in this article. Here, distributed label embedding is constructed for each slot using prior knowledge. Three encoding methods are investigated to incorporate different kinds of prior knowledge about slots: atomic concepts, slot descriptions, and slot exemplars. The proposed label embeddings tend to share text patterns and reuses data with different slot labels. This makes it useful for adaptive NLU with limited data. Also, since label embedding is independent of NLU model, it is compatible with almost all deep learning based slot filling models. The proposed approaches are evaluated on three datasets. Experiments on single domain and domain adaptation tasks show that label embedding achieves significant performance improvement over traditional one-hot label representation as well as advanced zero-shot approaches.
High-dimensional inference for inhomogeneous Gibbs point processes

Gibbs point processes (GPPs) constitute a large and flexible class of spatial point processes with explicit dependence between the points. They can model attractive as well as repulsive point patterns. Feature selection procedures are an important topic in high-dimensional statistical modeling. In this paper, composite likelihood approach regularized with convex and non-convex penalty functions is proposed to handle statistical inference for high-dimensional inhomogeneous GPPs. The composite likelihood incorporates both the pseudo-likelihood and the logistic composite likelihood. We particularly investigate the setting where the number of covariates diverges as the domain of observation increases. Under some conditions provided on the spatial GPP and on the penalty functions, we show that the oracle property, the consistency and the asymptotic normality hold. The latter two asymptotic properties also hold in an unregularized setting which is already a contribution to the current literature. Through simulation experiments, we validate our theoretical results and finally, an application to a tropical forestry dataset illustrates the use of the proposed approach.
Multimodal Analytics for Real-world News using Measures of Cross-modal Entity Consistency

The World Wide Web has become a popular source for gathering information and news. Multimodal information, e.g., enriching text with photos, is typically used to convey the news more effectively or to attract attention. The photos can be decorative, depict additional details, or even contain misleading information. Quantifying the cross-modal consistency of entity representations can assist human assessors in evaluating the overall multimodal message. In some cases such measures might give hints to detect fake news, which is an increasingly important topic in today's society. In this paper, we present a multimodal approach to quantify the entity coherence between image and text in real-world news. Named entity linking is applied to extract persons, locations, and events from news texts. Several measures are suggested to calculate the cross-modal similarity of these entities with the news photo, using state-of-the-art computer vision approaches. In contrast to previous work, our system automatically gathers example data from the Web and is applicable to real-world news. The feasibility is demonstrated on two novel datasets that cover different languages, topics, and domains.
Room-Temperature Amplification of Terahertz Radiation by Grating-Gate Graphene Structures

We report on experimental studies of terahertz (THz) radiation transmission through grating-gate graphene-channel transistor nanostructures and demonstrate room temperature THz radiation amplification stimulated by current-driven plasmon excitations. Specifically, with increase of the direct current (dc) under periodic charge density modulation, we observe a strong red shift of the resonant THz plasmon absorption, its complete bleaching, followed by the amplification and blue shift of the resonant plasmon frequency. Our results are, to the best of our knowledge, the first experimental observation of energy transfer from dc current to plasmons leading to THz amplification. We present a simple model allowing for the phenomenological description of the observed amplification phenomena. This model shows that in the presence of dc current the radiation-induced correction to dissipation is sensitive to the phase shift between THz oscillations of carrier density and drift velocity, and with increase of the current becomes negative, leading to amplification. The experimental results of this work as all obtained at room temperature, pave the way towards the new 2D plasmons based, voltage tuneable THz radiation amplifiers.
Multi-task U-Net for Music Source Separation

A fairly straightforward approach for music source separation is to train independent models, wherein each model is dedicated for estimating only a specific source. Training a single model to estimate multiple sources generally does not perform as well as the independent dedicated models. However, Conditioned U-Net (C-U-Net) uses a control mechanism to train a single model for multi-source separation and attempts to achieve a performance comparable to that of the dedicated models. We propose a multi-task U-Net (M-U-Net) trained using a weighted multi-task loss as an alternative to the C-U-Net. We investigate two weighting strategies for our multi-task loss: 1) Dynamic Weighted Average (DWA), and 2) Energy Based Weighting (EBW). DWA determines the weights by tracking the rate of change of loss of each task during training. EBW aims to neutralize the effect of the training bias arising from the difference in energy levels of each of the sources in a mixture. Our methods provide two-fold advantages compared to the C-U-Net: 1) Fewer effective training iterations with no conditioning, and 2) Fewer trainable network parameters (no control parameters). Our methods achieve performance comparable to that of C-U-Net and the dedicated U-Nets at a much lower training cost.