Searcharxiv⌕ Search

arXiv subjects

Dawei Chen

Publications and source records attributed to Dawei Chen.

At least 37 records · Page 2Linked to original sources

Connectedness of the boundaries of the strata of differentials

Let $\mathcal{P}(μ)^{\circ}$ be a connected component of the projectivized stratum of differentials on smooth complex curves, where the zero and pole orders of the differentials are specified by $μ$. When the complex dimension of $\mathcal{P}(μ)^{\circ}$ is at least two, Dozier--Grushevsky--Lee, through explicit degeneration techniques, showed that the boundary of $\mathcal{P}(μ)^{\circ}$ is connected in the multi-scale compactification constructed by Bainbridge--Chen--Gendron--Grushevsky--Möller. A natural question is whether the connectedness of the boundary of $\mathcal{P}(μ)^{\circ}$ is determined by its intrinsic properties. In the case of meromorphic differentials, we provide a concise explanation that the boundary of $\mathcal{P}(μ)^{\circ}$ is always connected in any complete algebraic compactification, based on the fact that the strata of meromorphic differentials are affine varieties. We also observe that the same result holds for linear subvarieties of meromorphic differentials, as well as for the strata of $k$-differentials with a pole of order at least $k$. In the case of holomorphic differentials, using properties of Teichmüller curves, we provide an alternative argument showing that the horizontal boundary of $\mathcal{P}(μ)^{\circ}$ and every irreducible component of its vertical boundary intersect non-trivially in the multi-scale compactification.

math.AG↗

Area Siegel--Veech constants for affine invariant submanifolds of REL zero

We describe the principal boundary of an arbitrary affine invariant submanifold of REL zero in terms of level graphs of the multi-scale compactification of strata of Abelian differentials with prescribed orders of zeros. We show that the area Siegel--Veech constant of the affine invariant submanifold can be obtained by using volumes of the principal boundary strata. As an application, we prove the conjectural formula in [CMS23a] that computes the area Siegel--Veech constant via intersection theory in the case of REL zero. In particular, the formula holds for strata of quadratic differentials with odd orders of zeros and for the gothic locus. We also explicitly describe the principal boundary components of the gothic locus and their individual contributions to the area Siegel--Veech constant

math.GT↗

GreenAuto: An Automated Platform for Sustainable AI Model Design on Edge Devices

We present GreenAuto, an end-to-end automated platform designed for sustainable AI model exploration, generation, deployment, and evaluation. GreenAuto employs a Pareto front-based search method within an expanded neural architecture search (NAS) space, guided by gradient descent to optimize model exploration. Pre-trained kernel-level energy predictors estimate energy consumption across all models, providing a global view that directs the search toward more sustainable solutions. By automating performance measurements and iteratively refining the search process, GreenAuto demonstrates the efficient identification of sustainable AI models without the need for human intervention.

cs.LG↗

The moduli space of multi-scale differentials

We construct a compactification of the moduli spaces of abelian differentials on Riemann surfaces with prescribed zeroes and poles. This compactification, called the moduli space of multi-scale differentials, is a complex orbifold with normal crossing boundary. Locally, our compactification can be described as the normalization of an explicit blowup of the incidence variety compactification, which was defined in [BCGGM18] as the closure of the stratum of abelian differentials in the closure of the Hodge bundle. We also define families of projectivized multi-scale differentials, which gives a proper Deligne-Mumford stack, and our compactification is the orbifold corresponding to it. Moreover, we perform a real oriented blowup of the unprojectivized moduli space of multi-scale differentials such that the $\mathrm{GL}_2(\mathbb R)$-action in the interior of the moduli space extends continuously to the boundary.

math.AG↗

CAVE: Crowdsourcing Passing-By Vehicles for Reliable In-Vehicle Edge Computing

In-vehicle edge computing is a much anticipated paradigm to serve ever-increasing computation demands originated from the ego vehicle, such as passenger entertainments. In this paper, we explore the unique idea of crowdsourcing passing-by vehicles to augment computing of the ego vehicle. The challenges lie in the high dynamics of passing-by vehicles, time-correlated task computation, and the stringent requirement of computing reliability for individual user tasks. To this end, we formulate an optimization problem to minimize the end-to-end latency by optimizing the task assignment and resource allocation of user tasks. To address the complex problem, we propose a new algorithm (named CAVE) with multiple key designs. We build an end-to-end network and compute simulator and conduct extensive simulation to evaluate the performance of the proposed algorithm.

cs.NI↗

Kinetics of Rayleigh-Taylor instability in van der Waals fluid: the influence of compressibility

Early studies on Rayleigh-Taylor instability (RTI) primarily relied on the Navier-Stokes (NS) model. As research progresses, it becomes increasingly evident that the kinetic information that the NS model failed to capture is of great value for identifying and even controlling the RTI process; simultaneously, the lack of analysis techniques for complex physical fields results in a significant waste of data information. In addition, early RTI studies mainly focused on the incompressible case and the weakly compressible case. In the case of strong compressibility, the density of the fluid from the upper layer (originally heavy fluid) may become smaller than that of the surrounding (originally light) fluid, thus invalidating the early method of distinguishing light and heavy fluids based on density. In this paper, tracer particles are incorporated into a single-fluid discrete Boltzmann method (DBM) model that considers the van der Waals potential. By using tracer particles to label the matter-particle sources, a careful study of the matter-mixing and energy-mixing processes of the RTI evolution is realized in the single-fluid framework. The effects of compressibility on the evolution of RTI are examined mainly through the analysis of bubble and spike velocities, the ratio of area occupied by heavy fluid, and various entropy generation rates of the system. It is demonstrated that: (1) compressibility has a suppressive effect on the spike velocity, and this suppressive impact diminishes as the Atwood number ($At$) increases. The influence of compressibility on bubble velocity shows a staged behavior with increasing $At$. (2) The impact of compressibility on the entropy production rate associated with the heat flow (${\dot{S}_{NOEF}}$) is related to the stages of RTI evolution.

physics.flu-dyn↗

Unveiling Energy Efficiency in Deep Learning: Measurement, Prediction, and Scoring across Edge Devices

Today, deep learning optimization is primarily driven by research focused on achieving high inference accuracy and reducing latency. However, the energy efficiency aspect is often overlooked, possibly due to a lack of sustainability mindset in the field and the absence of a holistic energy dataset. In this paper, we conduct a threefold study, including energy measurement, prediction, and efficiency scoring, with an objective to foster transparency in power and energy consumption within deep learning across various edge devices. Firstly, we present a detailed, first-of-its-kind measurement study that uncovers the energy consumption characteristics of on-device deep learning. This study results in the creation of three extensive energy datasets for edge devices, covering a wide range of kernels, state-of-the-art DNN models, and popular AI applications. Secondly, we design and implement the first kernel-level energy predictors for edge devices based on our kernel-level energy dataset. Evaluation results demonstrate the ability of our predictors to provide consistent and accurate energy estimations on unseen DNN models. Lastly, we introduce two scoring metrics, PCS and IECS, developed to convert complex power and energy consumption data of an edge device into an easily understandable manner for edge device end-users. We hope our work can help shift the mindset of both end-users and the research community towards sustainability in edge computing, a principle that drives our research. Find data, code, and more up-to-date information at https://amai-gsu.github.io/DeepEn2023.

cs.NI↗

Unleashing the True Power of Age-of-Information: Service Aggregation in Connected and Autonomous Vehicles

Connected and autonomous vehicles (CAVs) rely heavily upon time-sensitive information update services to ensure the safety of people and assets, and satisfactory entertainment applications. Therefore, the freshness of information is a crucial performance metric for CAV services. However, information from roadside sensors and nearby vehicles can get delayed in transmission due to the high mobility of vehicles. Our research shows that a CAV's relative distance and speed play an essential role in determining the Age-of-Information (AoI). With an increase in AoI, incremental service aggregation issues are observed with out-of-sequence information updates, which hampers the performance of low-latency applications in CAVs. In this paper, we propose a novel AoI-based service aggregation method for CAVs, which can process the information updates according to their update cycles. First, the AoI for sensors and vehicles is modeled, and a predictive AoI system is designed. Then, to reduce the overall service aggregation time and computational load, intervals are used for periodic AoI prediction, and information sources are clustered based on the AoI value. Finally, the system aggregates services for CAV applications using the predicted AoI. We evaluate the system performance based on data sequencing success rate (DSSR) and overall system latency. Lastly, we compare the performance of our proposed system with three other state-of-the-art methods. The evaluation and comparison results show that our proposed predictive AoI-based service aggregation system maintains satisfactory latency and DSSR for CAV applications and outperforms other existing methods.

eess.SY↗

Radio Galaxy Zoo: tagging radio subjects using text

RadioTalk is a communication platform that enabled members of the Radio Galaxy Zoo (RGZ) citizen science project to engage in discussion threads and provide further descriptions of the radio subjects they were observing in the form of tags and comments. It contains a wealth of auxiliary information which is useful for the morphology identification of complex and extended radio sources. In this paper, we present this new dataset, and for the first time in radio astronomy, we combine text and images to automatically classify radio galaxies using a multi-modal learning approach. We found incorporating text features improved classification performance which demonstrates that text annotations are rare but valuable sources of information for classifying astronomical sources, and suggests the importance of exploiting multi-modal information in future citizen science projects. We also discovered over 10,000 new radio sources beyond the RGZ-DR1 catalogue in this dataset.

astro-ph.GA↗

AdaMap: High-Scalable Real-Time Cooperative Perception at the Edge

Cooperative perception is the key approach to augment the perception of connected and automated vehicles (CAVs) toward safe autonomous driving. However, it is challenging to achieve real-time perception sharing for hundreds of CAVs in large-scale deployment scenarios. In this paper, we propose AdaMap, a new high-scalable real-time cooperative perception system, which achieves assured percentile end-to-end latency under time-varying network dynamics. To achieve AdaMap, we design a tightly coupled data plane and control plane. In the data plane, we design a new hybrid localization module to dynamically switch between object detection and tracking, and a novel point cloud representation module to adaptively compress and reconstruct the point cloud of detected objects. In the control plane, we design a new graph-based object selection method to un-select excessive multi-viewed point clouds of objects, and a novel approximated gradient descent algorithm to optimize the representation of point clouds. We implement AdaMap on an emulation platform, including realistic vehicle and server computation and a simulated 5G network, under a 150-CAV trace collected from the CARLA simulator. The evaluation results show that, AdaMap reduces up to 49x average transmission data size at the cost of 0.37 reconstruction loss, as compared to state-of-the-art solutions, which verifies its high scalability, adaptability, and computation efficiency.

cs.RO↗

Integrated Sensing and Communication based Outdoor Multi-Target Detection, Tracking and Localization in Practical 5G Networks

The 6th generation (6G) wireless networks will likely to support a variety of capabilities beyond communication, such as sensing and localization, through the use of communication networks empowered by advanced technologies. Integrated sensing and communication (ISAC) has been recognized as a critical technology as well as an usage scenario for 6G, as widely agreed by leading global standardization bodies. ISAC utilizes communication infrastructure and devices to provide the capability of sensing the environment with high resolution, as well as tracking and localizing moving objects nearby. Meeting both the requirements for communication and sensing simultaneously, ISAC based approaches celebrate the advantages of higher spectral and energy efficiency compared to two separate systems to serve two purposes, and potentially lower costs and easy deployment. A key step towards the standardization and commercialization of ISAC is to carry out comprehensive field trials in practical networks, such as the 5th generation (5G) network, to demonstrate its true capacities in practical scenarios. In this paper, an ISAC based outdoor multi-target detection, tracking and localization approach is proposed and validated in 5G networks. The proposed system comprises of 5G base stations (BSs) which serve nearby mobile users normally, while accomplishing the task of detecting, tracking and localizing drones, vehicles and pedestrians simultaneously. Comprehensive trial results demonstrate the relatively high accuracy of the proposed method in practical outdoor environment when tracking and localizing single targets and multiple targets.

cs.IT↗

Visualization of Mobility Digital Twin: Framework Design, Case Study, and Future Challenges

A Mobility Digital Twin is an emerging implementation of digital twin technology in the transportation domain, which creates digital replicas for various physical mobility entities, such as vehicles, drivers, and pedestrians. Although a few work have investigated the applications of mobility digital twin recently, the extent to which it can facilitate safer autonomous vehicles remains insufficiently explored. In this paper, we first propose visualization of mobility digital twin, which aims to augment the existing perception systems in connected and autonomous vehicles through twinning high-fidelity and manipulable geometry representations for causal traffic participants, such as surrounding pedestrians and vehicles, in the digital space. An end-to-end system framework, including image data crowdsourcing, preprocessing, offloading, and edge-assisted 3D geometry reconstruction, is designed to enable real-world development of the proposed visualization of mobility digital twin. We implement the proposed system framework and conduct a case study to assess the twinning fidelity and physical-to-digital synchronicity within different image sampling scenarios and wireless network conditions. Based on the case study, future challenges of the proposed visualization of mobility digital twin are discussed toward the end of the paper.

cs.NI↗

Counting differentials with fixed residues

We investigate the count of meromorphic differentials on the Riemann sphere possessing a single zero, multiple poles with prescribed orders, and fixed residues at each pole. Gendron and Tahar previously examined this problem with respect to general residues using flat geometry, while Sugiyama approached it from the perspective of fixed-point multipliers of polynomial maps in the case of simple poles. In our study, we employ intersection theory on compactified moduli spaces of differentials, enabling us to handle arbitrary residue conditions and provide a complete solution to this problem. We also determine interesting combinatorial properties of the solution formula.

math.AG↗

Filtration and splitting of the Hodge bundle on the non-varying strata of quadratic differentials

We describe the Harder--Narasimhan filtration of the Hodge bundle for Teichmüller curves in the non-varying strata of quadratic differentials appearing in [CM2]. Moreover, we show that the Hodge bundle on the non-varying strata away from the irregular components can split as a direct sum of line bundles. As applications, we determine all individual Lyapunov exponents of algebraically primitive Teichmüller curves in the non-varying strata and derive new results regarding the asymptotic behavior of Lyapunov exponents.

math.AG↗

Confidence-based federated distillation for vision-based lane-centering

A fundamental challenge of autonomous driving is maintaining the vehicle in the center of the lane by adjusting the steering angle. Recent advances leverage deep neural networks to predict steering decisions directly from images captured by the car cameras. Machine learning-based steering angle prediction needs to consider the vehicle's limitation in uploading large amounts of potentially private data for model training. Federated learning can address these constraints by enabling multiple vehicles to collaboratively train a global model without sharing their private data, but it is difficult to achieve good accuracy as the data distribution is often non-i.i.d. across the vehicles. This paper presents a new confidence-based federated distillation method to improve the performance of federated learning for steering angle prediction. Specifically, it proposes the novel use of entropy to determine the predictive confidence of each local model, and then selects the most confident local model as the teacher to guide the learning of the global model. A comprehensive evaluation of vision-based lane centering shows that the proposed approach can outperform FedAvg and FedDF by 11.3% and 9%, respectively.

cs.CV↗

A nearly optimal explicitly-sparse representation for oscillatory kernels with curvelet-like functions

A nearly optimal explicitly-sparse representation for oscillatory kernels is presented in this work by developing a curvelet based method. Multilevel curvelet-like functions are constructed as the transform of the original nodal basis. Then the system matrix in a new non-standard form is derived with respect to the curvelet basis, which would be nearly optimally sparse due to the directional low rank property of the oscillatory kernel. Its sparsity is further enhanced via a-posteriori compression. Finally its nearly optimial log-linear computational complexity with controllable accuracy is demonstrated with numerical results. This explicitly-sparse representation is expected to lay ground to future work related to fast direct solvers and effective preconditioners for high frequency problems. It may also be viewed as the generalization of wavelet based methods to high frequency cases, and used as a new wideband fast algorithm for wave problems.

math.NA↗

EPAM: A Predictive Energy Model for Mobile AI

Artificial intelligence (AI) has enabled a new paradigm of smart applications -- changing our way of living entirely. Many of these AI-enabled applications have very stringent latency requirements, especially for applications on mobile devices (e.g., smartphones, wearable devices, and vehicles). Hence, smaller and quantized deep neural network (DNN) models are developed for mobile devices, which provide faster and more energy-efficient computation for mobile AI applications. However, how AI models consume energy in a mobile device is still unexplored. Predicting the energy consumption of these models, along with their different applications, such as vision and non-vision, requires a thorough investigation of their behavior using various processing sources. In this paper, we introduce a comprehensive study of mobile AI applications considering different DNN models and processing sources, focusing on computational resource utilization, delay, and energy consumption. We measure the latency, energy consumption, and memory usage of all the models using four processing sources through extensive experiments. We explain the challenges in such investigations and how we propose to overcome them. Our study highlights important insights, such as how mobile AI behaves in different applications (vision and non-vision) using CPU, GPU, and NNAPI. Finally, we propose a novel Gaussian process regression-based general predictive energy model based on DNN structures, computation resources, and processors, which can predict the energy for each complete application cycle irrespective of device configuration and application. This study provides crucial facts and an energy prediction mechanism to the AI research community to help bring energy efficiency to mobile AI applications.

cs.LG↗