Searcharxiv⌕ Search

arXiv subjects

Di Liu

Publications and source records attributed to Di Liu.

At least 91 records · Page 5Linked to original sources

Resilience in Platoons of Cooperative Heterogeneous Vehicles: Self-organization Strategies and Provably-correct Design

This work proposes provably-correct self-organizing strategies for platoons of heterogeneous vehicles. We refer to self-organization as the capability of a platoon to autonomously homogenize to a common group behavior. We show that self-organization promotes resilience to acceleration limits and communication failures, i.e., homogenizing to a common group behavior makes the platoon recover from these causes of impairments. In the presence of acceleration limits, resilience is achieved by self-organizing to a common constrained group behavior that prevents the vehicles from hitting their acceleration limits. In the presence of communication failures, resilience is achieved by self-organizing to a common group observer to estimate the missing information. Stability of the self-organization mechanism is studied analytically, and correctness with respect to traffic actions (e.g. emergency braking, cut-in, merging) is realized through a provably-correct safety layer. Numerical validations via the platooning toolbox OpenCDA in CARLA and via the CommonRoad platform confirm improved performance through self-organization and the provably-correct safety layer.

eess.SY↗

"When He Feels Cold, He Goes to the Seahorse"-Blending Generative AI into Multimaterial Storymaking for Family Expressive Arts Therapy

Storymaking, as an integrative form of expressive arts therapy, is an effective means to foster family communication. Yet, the integration of generative AI as expressive materials in therapeutic storymaking remains underexplored. And there is a lack of HCI implications on how to support families and therapists in this context. Addressing this, our study involved five weeks of storymaking sessions with seven families guided by a professional therapist. In these sessions, the families used both traditional art-making materials and image-based generative AI to create and evolve their family stories. Via the rich empirical data and commentaries from four expert therapists, we contextualize how families creatively melded AI and traditional expressive materials to externalize their ideas and feelings. Through the lens of Expressive Therapies Continuum (ETC), we characterize the therapeutic implications of AI as expressive materials. Desirable interaction qualities to support children, parents, and therapists are distilled for future HCI research.

cs.HC↗

Clustering Molecular Energy Landscapes by Adaptive Network Embedding

In order to efficiently explore the chemical space of all possible small molecules, a common approach is to compress the dimension of the system to facilitate downstream machine learning tasks. Towards this end, we present a data driven approach for clustering potential energy landscapes of molecular structures by applying recently developed Network Embedding techniques, to obtain latent variables defined through the embedding function. To scale up the method, we also incorporate an entropy sensitive adaptive scheme for hierarchical sampling of the energy landscape, based on Metadynamics and Transition Path Theory. By taking into account the kinetic information implied by a system's energy landscape, we are able to interpret dynamical node-node relationships in reduced dimensions. We demonstrate the framework through Lennard-Jones (LJ) clusters and a human DNA sequence.

q-bio.BM↗

Decreasing emissions and increasing sink capacity to support China in achieving carbon neutrality before 2060

In September 2020, President Xi Jinping announced that China strives to achieve carbon neutrality before 2060. This ambitious and bold commitment was well received by the global community. However, the technology and pathway are not so clear. Here, we conducted an extensive review covering more than 200 published papers and summarized the key technologies to achieve carbon neutrality. We projected sectoral CO2 emissions for 2020-2050 based on our previous studies and published scenarios. We applied a medium sink scenario for terrestrial sinks due to the potential resource competition and included an ocean sink, which has generally not been included in previous estimates. We analyzed and revisited China's historical terrestrial carbon sink capacity from 1980-2020 based on multiple models and a literature review. To achieve neutrality, it is necessary to increase sink capacity and decrease emissions from many sources. On the one hand, critical measures to reduce emissions include decreasing the use of fossil fuels; substantially increasing the proportion of the renewable energy and nuclear energy. On the other hand, the capacity of future carbon sinks is projected to decrease due to the natural evolution of terrestrial ecosystems, and anthropogenic management practices are needed to increase sink capacity, including increasing the forest sinks through national ecological restoration projects and large-scale land greening campaigns; increasing wood harvesting and storage; and developing CCUS. This paper provides basic source and sink data,and established and promising new technologies for decreasing emissions and increasing sinks for use by the scientific community and policy makers.

physics.ao-ph↗

Steering Prototypes with Prompt-tuning for Rehearsal-free Continual Learning

In the context of continual learning, prototypes-as representative class embeddings-offer advantages in memory conservation and the mitigation of catastrophic forgetting. However, challenges related to semantic drift and prototype interference persist. In this study, we introduce the Contrastive Prototypical Prompt (CPP) approach. Through task-specific prompt-tuning, underpinned by a contrastive learning objective, we effectively address both aforementioned challenges. Our evaluations on four challenging class-incremental benchmarks reveal that CPP achieves a significant 4% to 6% improvement over state-of-the-art methods. Importantly, CPP operates without a rehearsal buffer and narrows the performance divergence between continual and offline joint-learning, suggesting an innovative scheme for Transformer-based continual learning systems.

cs.LG↗

Cosmologically Varying Kinetic Mixing

The portal connecting the invisible and visible sectors is one of the most natural explanations of the dark world. However, the early-time dark matter production via the portal faces extremely stringent late-time constraints. To solve such tension, we construct the scalar-controlled kinetic mixing varying with the ultralight CP-even scalar's cosmological evolution. To realize this and eliminate the constant mixing, we couple the ultralight scalar within $10^{-33}\text{eV} \lesssim m_0 \ll \text{eV}$ with the heavy doubly charged messengers and impose the $\mathbb{Z}_2$ symmetry under the dark charge conjugation. Via the varying mixing, the $\text{keV}-\text{MeV}$ dark photon dark matter is produced through the early-time freeze-in when the scalar is misaligned from the origin and free from the late-time exclusions when the scalar does the damped oscillation and dynamically sets the kinetic mixing. We also find that the scalar-photon coupling emerges from the underlying physics, which changes the cosmological history and provides the experimental targets based on the fine-structure constant variation and the equivalence principle violation. To ensure the scalar naturalness, we discretely re-establish the broken shift symmetry by embedding the minimal model into the $\mathbb{Z}_N$-protected model. When $N \sim 10$, the scalar's mass quantum correction can be suppressed much below $10^{-33}\text{eV}$.

hep-ph↗

A Pairwise Dataset for GUI Conversion and Retrieval between Android Phones and Tablets

With the popularity of smartphones and tablets, users have become accustomed to using different devices for different tasks, such as using their phones to play games and tablets to watch movies. To conquer the market, one app is often available on both smartphones and tablets. However, although one app has similar graphic user interfaces (GUIs) and functionalities on phone and tablet, current app developers typically start from scratch when developing a tablet-compatible version of their app, which drives up development costs and wastes existing design resources. Researchers are attempting to employ deep learning in automated GUIs development to enhance developers' productivity. Deep learning models rely heavily on high-quality datasets. There are currently several publicly accessible GUI page datasets for phones, but none for pairwise GUIs between phones and tablets. This poses a significant barrier to the employment of deep learning in automated GUI development. In this paper, we collect and make public the Papt dataset, which is a pairwise dataset for GUI conversion and retrieval between Android phones and tablets. The dataset contains 10,035 phone-tablet GUI page pairs from 5,593 phone-tablet app pairs. We illustrate the approaches of collecting pairwise data and statistical analysis of this dataset. We also illustrate the advantages of our dataset compared to other current datasets. Through preliminary experiments on this dataset, we analyse the present challenges of utilising deep learning in automated GUI development and find that our dataset can assist the application of some deep learning models to tasks involving automatic GUI development.

cs.HC↗

Pairwise GUI Dataset Construction Between Android Phones and Tablets

In the current landscape of pervasive smartphones and tablets, apps frequently exist across both platforms. Although apps share most graphic user interfaces (GUIs) and functionalities across phones and tablets, developers often rebuild from scratch for tablet versions, escalating costs and squandering existing design resources. Researchers are attempting to collect data and employ deep learning in automated GUIs development to enhance developers' productivity. There are currently several publicly accessible GUI page datasets for phones, but none for pairwise GUIs between phones and tablets. This poses a significant barrier to the employment of deep learning in automated GUI development. In this paper, we introduce the Papt dataset, a pioneering pairwise GUI dataset tailored for Android phones and tablets, encompassing 10,035 phone-tablet GUI page pairs sourced from 5,593 unique app pairs. We propose novel pairwise GUI collection approaches for constructing this dataset and delineate its advantages over currently prevailing datasets in the field. Through preliminary experiments on this dataset, we analyze the present challenges of utilizing deep learning in automated GUI development.

cs.SE↗

Heavy Baryon Dark Matter from $SU(N)$ Confinement: Bubble Wall Velocity and Boundary Effects

Confinement in $SU(N_{\rm DC})$ Yang-Mills theories is known to proceed through first-order phase transition. The wall velocity is bounded by $v_w \lesssim 10^{-6}$ due to the needed time for the substantial latent heat released during the phase transition to dissipate through Hubble expansion. Quarks much heavier than the confinement scale can be introduced without changing the confinement dynamics. After they freeze-out, heavy quarks are squeezed into pockets of the deconfined phase until they completely annihilate with anti-quarks. We calculate the dark baryon abundance surviving annihilation, due to bound-state formation occurring both in the bulk and - for the first time - at the boundary. We find that dark baryons can be dark matter with a mass up to $10^3~\rm TeV$. We study indirect and direct detection, CMB and BBN probes, assuming portals to Higgs and neutrinos.

hep-ph↗

FPHammer: A Device Identification Framework based on DRAM Fingerprinting

The device fingerprinting technique extracts fingerprints based on the hardware characteristics of the device to identify the device. The primary goal of device fingerprinting is to accurately and uniquely identify a device, which requires the generated device fingerprints to have good stability to achieve long-term tracking of the target device. However, the fingerprints generated by some existing fingerprinting technologies are not stable enough or change frequently, making it impossible to track the target device for a long time. In this paper, we present FPHammer, a novel DRAM-based fingerprinting technique. The device fingerprint generated by our technique has high stability and can be used to track the device for a long time. We leverage the Rowhammer technique to repeatedly and quickly access a row in DRAM to get bit flips in its adjacent row. We then construct a physical fingerprint of the device based on the locations of the collected bit flips. The evaluation results of the uniqueness and reliability of the physical fingerprint show that it can be used to distinguish devices with the same hardware and software configuration. The experimental results on device identification demonstrate that the physical fingerprints engendered by our innovative technique are inherently linked to the entirety of the device rather than just the DRAM module. Even if the device modifies software-level parameters such as MAC address and IP address or even reinstalls the operating system, we can accurately identify the target device. This demonstrates that FPHammer can generate stable fingerprints that are not affected by software layer parameters.

cs.CR↗

Single spin qubit geometric gate in a silicon quantum dot

Preserving qubit coherence and maintaining high-fidelity qubit control under complex noise environment is an enduring challenge for scalable quantum computing. Here we demonstrate an addressable fault-tolerant single spin qubit with an average control fidelity of 99.12% via randomized benchmarking on a silicon quantum dot device with an integrated micromagnet. Its dephasing time T2* is 1.025 us and can be enlarged to 264 us by using the Hahn echo technique, reflecting strong low-frequency noise in our system. To break through the noise limitation, we introduce geometric quantum computing to obtain high control fidelity by exploiting its noise-resilient feature. However, the control fidelities of the geometric quantum gates are lower than 99%. According to our simulation, the noise-resilient feature of geometric quantum gates is masked by the heating effect. With further optimization to alleviate the heating effect, geometric quantum computing can be a potential approach to reproducibly achieving high-fidelity qubit control in a complex noise environment.

cond-mat.mes-hall↗

DeFormer: Integrating Transformers with Deformable Models for 3D Shape Abstraction from a Single Image

Accurate 3D shape abstraction from a single 2D image is a long-standing problem in computer vision and graphics. By leveraging a set of primitives to represent the target shape, recent methods have achieved promising results. However, these methods either use a relatively large number of primitives or lack geometric flexibility due to the limited expressibility of the primitives. In this paper, we propose a novel bi-channel Transformer architecture, integrated with parameterized deformable models, termed DeFormer, to simultaneously estimate the global and local deformations of primitives. In this way, DeFormer can abstract complex object shapes while using a small number of primitives which offer a broader geometry coverage and finer details. Then, we introduce a force-driven dynamic fitting and a cycle-consistent re-projection loss to optimize the primitive parameters. Extensive experiments on ShapeNet across various settings show that DeFormer achieves better reconstruction accuracy over the state-of-the-art, and visualizes with consistent semantic correspondences for improved interpretability.

cs.CV↗

Biological Aggregations from Spatial Memory and Nonlocal Advection

We investigate a nonlocal single-species reaction-diffusion-advection model that integrates the spatial memory of previously visited locations and nonlocal detection in space, resulting in a coupled PDE-ODE system reflective of several existing models found in spatial ecology. We prove the existence and uniqueness of a Hölder continuous weak solution in one spatial dimension under some general conditions, allowing for discontinuous kernels such as the top-hat detection kernel. A robust spectral and bifurcation analysis is also performed, providing the rigorous analytical study not yet found in the existing literature. In particular, the essential spectrum is shown to be entirely negative, and we classify the nature of the bifurcation near the critical values obtained via a linear stability analysis. A pseudo-spectral method is used to solve and plot the steady states near and far away from these critical values, complementing the analytical insights.

math.AP↗

Correcting on-chip distortion of control pulses with silicon spin qubits

Pulse distortion, as one of the coherent error sources, hinders the characterization and control of qubits. In the semiconductor quantum dot system, the distortions on measurement pulses and control pulses disturb the experimental results, while no effective calibration procedure has yet been reported. Here, we demonstrate two different calibration methods to calibrate and correct the distortion using the two-qubit system as a detector. The two calibration methods have different correction accuracy and complexity. One is the coarse predistortion (CPD) method, with which the distortion is partly relieved. The other method is the all predistortion (APD) method, with which we measure the transfer function and significantly improve the exchange oscillation homogeneity. The two methods use the exchange oscillation homogeneity as the metric and are appropriate for any qubit that oscillates with a diabatic pulse. With the APD procedure, an arbitrary control waveform can be accurately delivered to the device, which is essential for characterizing qubits and improving gate fidelity.

cond-mat.mes-hall↗

Deep Deformable Models: Learning 3D Shape Abstractions with Part Consistency

The task of shape abstraction with semantic part consistency is challenging due to the complex geometries of natural objects. Recent methods learn to represent an object shape using a set of simple primitives to fit the target. \textcolor{black}{However, in these methods, the primitives used do not always correspond to real parts or lack geometric flexibility for semantic interpretation.} In this paper, we investigate salient and efficient primitive descriptors for accurate shape abstractions, and propose \textit{Deep Deformable Models (DDMs)}. DDM employs global deformations and diffeomorphic local deformations. These properties enable DDM to abstract complex object shapes with significantly fewer primitives that offer broader geometry coverage and finer details. DDM is also capable of learning part-level semantic correspondences due to the differentiable and invertible properties of our primitive deformation. Moreover, DDM learning formulation is based on dynamic and kinematic modeling, which enables joint regularization of each sub-transformation during primitive fitting. Extensive experiments on \textit{ShapeNet} demonstrate that DDM outperforms the state-of-the-art in terms of reconstruction and part consistency by a notable margin.

cs.CV↗

Network Embedding Using Sparse Approximations of Random Walks

In this paper, we propose an efficient numerical implementation of Network Embedding based on commute times, using sparse approximation of a diffusion process on the network obtained by a modified version of the diffusion wavelet algorithm. The node embeddings are computed by optimizing the cross entropy loss via the stochastic gradient descent method with sampling of low-dimensional representations of green functions. We demonstrate the efficacy of this method for data clustering and multi-label classification through several examples, and compare its performance over existing methods in terms of efficiency and accuracy. Theoretical issues justifying the scheme are also discussed.

cs.LG↗

A successive centralized circumcenter reflection method for the convex feasibility problem

In this paper we present the successive centralization of the circumcenter reflection scheme with several control sequences for solving the convex feasibility problem in Euclidean space. Assuming that a standard error bound holds, we prove the linear convergence of the method with the most violated constraint control sequence. Under additional smoothness assumptions, we prove the superlinear convergence. Numerical experiments confirm the efficiency of our method.

math.OC↗

Complete mode conversion for elastic waves reflected by elastic metamaterial slab with double hexapole resonances

In this study, we investigate the phenomenon of mode conversion in elastic bulk waves using coupled hexapole resonances. A metamaterial slab is proposed enabling the complete conversion between longitudinal and transverse modes. Each unit of the elastic metamaterial slab comprises a pair of scatterers, and their relative direction is oriented at an oblique angle. The interaction between the coupled hexapoles and the background results in oblique displacements, which are responsible for the mode conversion. Moreover, this conversion exhibits a broader frequency range compared to the quadrupole resonance. This innovative design significantly broadens the range of possibilities for developing mode-converting metamaterials.

physics.app-ph↗