arXiv subjects

Ran Liu

Publications and source records attributed to Ran Liu.

At least 55 records · Page 3Linked to original sources

arXiv2023

Half-Hop: A graph upsampling approach for slowing down message passing

Message passing neural networks have shown a lot of success on graph-structured data. However, there are many instances where message passing can lead to over-smoothing or fail when neighboring nodes belong to different classes. In this work, we introduce a simple yet general framework for improving learning in message passing neural networks. Our approach essentially upsamples edges in the original graph by adding "slow nodes" at each edge that can mediate communication between a source and a target node. Our method only modifies the input graph, making it plug-and-play and easy to use with existing models. To understand the benefits of slowing down message passing, we provide theoretical and empirical analyses. We report results on several supervised and self-supervised benchmarks, and show improvements across the board, notably in heterophilic conditions where adjacent nodes are more likely to have different labels. Finally, we show how our approach can be used to generate augmentations for self-supervised learning, where slow nodes are randomly introduced into different edges in the graph to generate multi-scale views with variable path lengths.

cs.LG↗

arXiv2023

Different phase leads to different transport behavior in Pb$_9$Cu(PO$_4$)$_6$O compounds

The recent claimed room-temperature superconductivity in Cu-doped lead apatite at ambient pressure are under highly debate. To identify its physical origin, we studied the crystal structures, energy band structures, lattice dynamics and magnetic properties of the parent Pb$_{10}$(PO$_4$)$_6$O compound, in which two different phases of the LK-99 compound are analyzed in detail. Our results show that the Pb$_{10}$(PO$_4$)$_6$O compound is an indirect band gap semiconductor, where Cu doping at the 4$f$ site of Pb leads to a semiconducting to half-metallic transition. Two half-filled flat bands spanning the Fermi energy levels are present in the 4$f$-phase of LK-99, which are mainly formed by hybridization of the $d_{x^2-y^2}$ and $d_{zy}$ orbitals of Cu with the 2$p$ orbitals of O. In addition, 6$h$-phase of LK-99 always has spin polarity at the bottom of the conduction band and at the top of the valence band, making the material a bipolar magnetic semiconductor. Our results are basically consistent with the recent experimental transport properties of LK-99 posted on arXiv:2308.05778.

cond-mat.supr-con↗

arXiv2023

A Feature Set of Small Size for the PDF Malware Detection

Machine learning (ML)-based malware detection systems are becoming increasingly important as malware threats increase and get more sophisticated. PDF files are often used as vectors for phishing attacks because they are widely regarded as trustworthy data resources, and are accessible across different platforms. Therefore, researchers have developed many different PDF malware detection methods. Performance in detecting PDF malware is greatly influenced by feature selection. In this research, we propose a small features set that don't require too much domain knowledge of the PDF file. We evaluate proposed features with six different machine learning models. We report the best accuracy of 99.75% when using Random Forest model. Our proposed feature set, which consists of just 12 features, is one of the most conciseness in the field of PDF malware detection. Despite its modest size, we obtain comparable results to state-of-the-art that employ a much larger set of features.

cs.CR↗

arXiv2023

IMCDCF: An Incremental Malware Detection Approach Using Hidden Markov Models

The popularity of dynamic malware analysis has grown significantly, as it enables analysts to observe the behavior of executing samples, thereby enhancing malware detection and classification decisions. With the continuous increase in new malware variants, there is an urgent need for an automated malware analysis engine capable of accurately identifying malware samples. In this paper, we provide a brief overview of malware detection and classification methodologies. Moreover, we introduce a novel framework tailored for the dynamic analysis environment, called the Incremental Malware Detection and Classification Framework (IMDCF). IMDCF offers a comprehensive solution for general-purpose malware detection and classification, achieving an accuracy rate of 96.49% while maintaining a simple architecture.

cs.CR↗

arXiv2023

Can Feature Engineering Help Quantum Machine Learning for Malware Detection?

With the increasing number and sophistication of malware attacks, malware detection systems based on machine learning (ML) grow in importance. At the same time, many popular ML models used in malware classification are supervised solutions. These supervised classifiers often do not generalize well to novel malware. Therefore, they need to be re-trained frequently to detect new malware specimens, which can be time-consuming. Our work addresses this problem in a hybrid framework of theoretical Quantum ML, combined with feature selection strategies to reduce the data size and malware classifier training time. The preliminary results show that VQC with XGBoost selected features can get a 78.91% test accuracy on the simulator. The average accuracy for the model trained using the features selected with XGBoost was 74% (+- 11.35%) on the IBM 5 qubits machines.

cs.LG↗

arXiv2023

Exploiting Radio Fingerprints for Simultaneous Localization and Mapping

Simultaneous localization and mapping (SLAM) is paramount for unmanned systems to achieve self-localization and navigation. It is challenging to perform SLAM in large environments, due to sensor limitations, complexity of the environment, and computational resources. We propose a novel approach for localization and mapping of autonomous vehicles using radio fingerprints, for example WiFi (Wireless Fidelity) or LTE (Long Term Evolution) radio features, which are widely available in the existing infrastructure. In particular, we present two solutions to exploit the radio fingerprints for SLAM. In the first solution-namely Radio SLAM, the output is a radio fingerprint map generated using SLAM technique. In the second solution-namely Radio+LiDAR SLAM, we use radio fingerprint to assist conventional LiDAR-based SLAM to improve accuracy and speed, while generating the occupancy map. We demonstrate the effectiveness of our system in three different environments, namely outdoor, indoor building, and semi-indoor environment.

cs.RO↗

arXiv2023

MTNeuro: A Benchmark for Evaluating Representations of Brain Structure Across Multiple Levels of Abstraction

There are multiple scales of abstraction from which we can describe the same image, depending on whether we are focusing on fine-grained details or a more global attribute of the image. In brain mapping, learning to automatically parse images to build representations of both small-scale features (e.g., the presence of cells or blood vessels) and global properties of an image (e.g., which brain region the image comes from) is a crucial and open challenge. However, most existing datasets and benchmarks for neuroanatomy consider only a single downstream task at a time. To bridge this gap, we introduce a new dataset, annotations, and multiple downstream tasks that provide diverse ways to readout information about brain structure and architecture from the same image. Our multi-task neuroimaging benchmark (MTNeuro) is built on volumetric, micrometer-resolution X-ray microtomography images spanning a large thalamocortical section of mouse brain, encompassing multiple cortical and subcortical regions. We generated a number of different prediction challenges and evaluated several supervised and self-supervised models for brain-region prediction and pixel-level semantic segmentation of microstructures. Our experiments not only highlight the rich heterogeneity of this dataset, but also provide insights into how self-supervised approaches can be used to learn representations that capture multiple attributes of a single image and perform well on a variety of downstream tasks. Datasets, code, and pre-trained baseline models are provided at: https://mtneuro.github.io/ .

cs.CV↗

arXiv2022

Iterative Gradient Ascent Pulse Engineering algorithm for quantum optimal control

Gradient ascent pulse engineering algorithm (GRAPE) is a typical method to solve quantum optimal control problems. However, it suffers from an exponential resource in computing the time evolution of quantum systems with the increasing number of qubits, which is a barrier for its application in large-qubit systems. To mitigate this issue, we propose an iterative GRAPE algorithm (iGRAPE) for preparing a desired quantum state, where the large-scale, resource-consuming optimization problem is decomposed into a set of lower-dimensional optimization subproblems by disentanglement operations. Consequently these subproblems can be solved in parallel with less computing resources. For physical platforms such as nuclear magnetic resonance (NMR) and superconducting quantum systems, we show that iGRAPE can provide up to 13-fold speedup over GRAPE when preparing desired quantum states in systems within 12 qubits. Using a four-qubit NMR system, we also experimentally verify the feasibility of the iGRAPE algorithm.

quant-ph↗

arXiv2022

Clustering and Analysis of GPS Trajectory Data using Distance-based Features

The proliferation of smartphones has accelerated mobility studies by largely increasing the type and volume of mobility data available. One such source of mobility data is from GPS technology, which is becoming increasingly common and helps the research community understand mobility patterns of people. However, there lacks a standardized framework for studying the different mobility patterns created by the non-Work, non-Home locations of Working and Nonworking users on Workdays and Offdays using machine learning methods. We propose a new mobility metric, Daily Characteristic Distance, and use it to generate features for each user together with Origin-Destination matrix features. We then use those features with an unsupervised machine learning method, $k$-means clustering, and obtain three clusters of users for each type of day (Workday and Offday). Finally, we propose two new metrics for the analysis of the clustering results, namely User Commonality and Average Frequency. By using the proposed metrics, interesting user behaviors can be discerned and it helps us to better understand the mobility patterns of the users.

cs.LG↗

arXiv2022

Seeing the forest and the tree: Building representations of both individual and collective dynamics with transformers

Complex time-varying systems are often studied by abstracting away from the dynamics of individual components to build a model of the population-level dynamics from the start. However, when building a population-level description, it can be easy to lose sight of each individual and how they contribute to the larger picture. In this paper, we present a novel transformer architecture for learning from time-varying data that builds descriptions of both the individual as well as the collective population dynamics. Rather than combining all of our data into our model at the onset, we develop a separable architecture that operates on individual time-series first before passing them forward; this induces a permutation-invariance property and can be used to transfer across systems of different size and order. After demonstrating that our model can be applied to successfully recover complex interactions and dynamics in many-body systems, we apply our approach to populations of neurons in the nervous system. On neural activity datasets, we show that our model not only yields robust decoding performance, but also provides impressive performance in transfer across recordings of different animals without any neuron-level correspondence. By enabling flexible pre-training that can be transferred to neural recordings of different size and order, our work provides a first step towards creating a foundation model for neural decoding.

q-bio.NC↗

arXiv2022

Multi-AGV's Temporal Memory-based RRT Exploration in Unknown Environment

With the increasing need for multi-robot for exploring the unknown region in a challenging environment, efficient collaborative exploration strategies are needed for achieving such feat. A frontier-based Rapidly-Exploring Random Tree (RRT) exploration can be deployed to explore an unknown environment. However, its' greedy behavior causes multiple robots to explore the region with the highest revenue, which leads to massive overlapping in exploration process. To address this issue, we present a temporal memory-based RRT (TM-RRT) exploration strategy for multi-robot to perform robust exploration in an unknown environment. It computes adaptive duration for each frontier assigned and calculates the frontier's revenue based on the relative position of each robot. In addition, each robot is equipped with a memory consisting of frontier assigned and share among fleets to prevent repeating assignment of same frontier. Through both simulation and actual deployment, we have shown the robustness of TM-RRT exploration strategy by completing the exploration in a 25.0m x 54.0m (1350.0m2) area, while the conventional RRT exploration strategy falls short.

cs.RO↗

arXiv2022

Distributed Ranging SLAM for Multiple Robots with Ultra-WideBand and Odometry Measurements

To accomplish task efficiently in a multiple robots system, a problem that has to be addressed is Simultaneous Localization and Mapping (SLAM). LiDAR (Light Detection and Ranging) has been used for many SLAM solutions due to its superb accuracy, but its performance degrades in featureless environments, like tunnels or long corridors. Centralized SLAM solves the problem with a cloud server, which requires a huge amount of computational resources and lacks robustness against central node failure. To address these issues, we present a distributed SLAM solution to estimate the trajectory of a group of robots using Ultra-WideBand (UWB) ranging and odometry measurements. The proposed approach distributes the processing among the robot team and significantly mitigates the computation concern emerged from the centralized SLAM. Our solution determines the relative pose (also known as loop closure) between two robots by minimizing the UWB ranging measurements taken at different positions when the robots are in close proximity. UWB provides a good distance measure in line-of-sight conditions, but retrieving a precise pose estimation remains a challenge, due to ranging noise and unpredictable path traveled by the robot. To deal with the suspicious loop closures, we use Pairwise Consistency Maximization (PCM) to examine the quality of loop closures and perform outlier rejections. The filtered loop closures are then fused with odometry in a distributed pose graph optimization (DPGO) module to recover the full trajectory of the robot team. Extensive experiments are conducted to validate the effectiveness of the proposed approach.

cs.RO↗

arXiv2022

NLOS Ranging Mitigation with Neural Network Model for UWB Localization

Localization of robots is vital for navigation and path planning, such as in cases where a map of the environment is needed. Ultra-Wideband (UWB) for indoor location systems has been gaining popularity over the years with the introduction of low-cost UWB modules providing centimetre-level accuracy. However, in the presence of obstacles in the environment, Non-Line-Of-Sight (NLOS) measurements from the UWB will produce inaccurate results. As low-cost UWB devices do not provide channel information, we propose an approach to decide if a measurement is within Line-Of-Sight (LOS) or not by using some signal strength information provided by low-cost UWB modules through a Neural Network (NN) model. The result of this model is the probability of a ranging measurement being LOS which was used for localization through the Weighted-Least-Square (WLS) method. Our approach improves localization accuracy by 16.93% on the lobby testing data and 27.97% on the corridor testing data using the NN model trained with all extracted inputs from the office training data.

cs.RO↗

arXiv2022

Efficient WiFi LiDAR SLAM for Autonomous Robots in Large Environments

Autonomous robots operating in indoor and GPS denied environments can use LiDAR for SLAM instead. However, LiDARs do not perform well in geometrically-degraded environments, due to the challenge of loop closure detection and computational load to perform scan matching. Existing WiFi infrastructure can be exploited for localization and mapping with low hardware and computational cost. Yet, accurate pose estimation using WiFi is challenging as different signal values can be measured at the same location due to the unpredictability of signal propagation. Therefore, we introduce the use of WiFi fingerprint sequence for pose estimation (i.e. loop closure) in SLAM. This approach exploits the spatial coherence of location fingerprints obtained while a mobile robot is moving. This has better capability of correcting odometry drift. The method also incorporates LiDAR scans and thus, improving computational efficiency for large and geometrically-degraded environments while maintaining the accuracy of LiDAR SLAM. We conducted experiments in an indoor environment to illustrate the effectiveness of the method. The results are evaluated based on Root Mean Square Error (RMSE) and it has achieved an accuracy of 0.88m for the test environment.

cs.RO↗

arXiv2022

Optimal and robust experiment design for quantum state tomography of star-topology register

While quantum state tomography plays a vital role in the verification and benchmarking of quantum systems, it is an intractable task if the controllability and measurement of quantum registers are constrained. In this paper, we study the quantum state tomography of star-topology registers, in which the individual addressability of peripheral spins is infeasible. Based on the star-symmetry, we decompose the Hilbert space to alleviate the complexity of tomography and design a compact strategy with minimum number of measurements. By optimizing the parameterized quantum circuit for information transfer, the robustness against measurement errors is also improved. Furthermore, we apply this method to a 10-spin star-topology register and demonstrate its ability to characterize large-scale systems. Our results can help future investigations of quantum systems with constrained ability of quantum control and measurement.

quant-ph↗

arXiv2022

Detection of arbitrary quantum correlations via synthesized quantum channels

Quantum correlations are key information about the structures and dynamics of quantum many-body systems. There are many types of high-order quantum correlations with different time orderings, but only a few of them are accessible to the existing detection methods. Recently, a quantum-sensing approach based on sequential weak measurement was proposed to selectively extract arbitrary types of correlations. However, its experimental implementation is still elusive. Here we demonstrate the extraction of arbitrary types of quantum correlations. We generalized the original weak measurement scheme to a protocol using synthesized quantum channels, which can be applied to more universal scenarios including both single and ensemble quantum systems. In this quantum channel method, various controls on the sensors are superimposed to select the sensor-target evolution along a specific path for measuring a desired quantum correlation. Using the versatility of nuclear magnetic resonance techniques, we successfully extract the second- and fourth-order correlations of a nuclear-spin target by another nuclear-spin sensor. The full characterization of quantum correlations provides a new tool for understanding quantum many-body systems, exploring fundamental quantum physics, and developing quantum technologies.

quant-ph↗

arXiv2021

Mine Your Own vieW: Self-Supervised Learning Through Across-Sample Prediction

State-of-the-art methods for self-supervised learning (SSL) build representations by maximizing the similarity between different transformed "views" of a sample. Without sufficient diversity in the transformations used to create views, however, it can be difficult to overcome nuisance variables in the data and build rich representations. This motivates the use of the dataset itself to find similar, yet distinct, samples to serve as views for one another. In this paper, we introduce Mine Your Own vieW (MYOW), a new approach for self-supervised learning that looks within the dataset to define diverse targets for prediction. The idea behind our approach is to actively mine views, finding samples that are neighbors in the representation space of the network, and then predict, from one sample's latent representation, the representation of a nearby sample. After showing the promise of MYOW on benchmarks used in computer vision, we highlight the power of this idea in a novel application in neuroscience where SSL has yet to be applied. When tested on multi-unit neural recordings, we find that MYOW outperforms other self-supervised approaches in all examples (in some cases by more than 10%), and often surpasses the supervised baseline. With MYOW, we show that it is possible to harness the diversity of the data to build rich views and leverage self-supervision in new domains where augmentations are limited or unknown.

cs.LG↗

arXiv2021

Dual Band GNSS Antenna Phase Center Characterization for Automotive Applications

In this paper, a low-cost small size dual-band ceramic GNSS patch antenna is presented from design to real sample. A further study of this patch antenna illustrates the absolute phase center variation measured in an indoor range to achieve a received signal phase error correction. In addition, this low-cost antenna solution is investigated when integrated into a standard multi-band automotive antenna product. This product is evaluated both on its own in an indoor range and on a typical vehicle roof at an outdoor range. By using this evaluation file to estimate the receiver position could achieve phase motion error-free result.

eess.SP↗