Searcharxiv⌕ Search

arXiv subjects

Yu Chen

Publications and source records attributed to Yu Chen.

At least 361 records · Page 20Linked to original sources
arXiv2023

You Don't Know When I Will Arrive: Unpredictable Controller Synthesis for Temporal Logic Tasks

In this paper, we investigate the problem of synthesizing controllers for temporal logic specifications under security constraint. We assume that there exists a passive intruder (eavesdropper) that can partially observe the behavior of the system. For the purpose of security, we require that the system's behaviors are unpredictable in the sense that the intruder cannot determine for sure that the system will exactly accomplish the task in $K$ steps ahead. This problem is particularly challenging since future information is involved in the synthesis process. We propose a novel information structure that predicts the effect of control in the future. A sound and complete algorithm is developed to synthesize a controller which ensures both task completion and security guarantee. The proposed approach is illustrated by a case study of robot task planning.

eess.SY↗
arXiv2023

The Structure and Origin of Switchbacks: Parker Solar Probe Observations

Switchbacks are rapid magnetic field reversals that last from seconds to hours. Current Parker Solar Probe (PSP) observations pose many open questions in regard to the nature of switchbacks. For example, are they stable as they propagate through the inner heliosphere, and how are they formed? In this work, we aim to investigate the structure and origin of switchbacks. In order to study the stability of switchbacks, we suppose the small-scale current sheets therein are generated by magnetic braiding, and they should work to stabilize the switchbacks. With more than one thousand switchbacks identified with PSP observations in seven encounters, we find many more current sheets inside than outside switchbacks, indicating that these microstructures should work to stabilize the S-shaped structures of switchbacks. Additionally, we study the helium variations to trace the switchbacks to their origins. We find both helium-rich and helium-poor populations in switchbacks, implying that the switchbacks could originate from both closed and open magnetic field regions in the Sun. Moreover, we observe that the alpha-proton differential speeds also show complex variations as compared to the local Alfvén speed. The joint distributions of both parameters show that low helium abundance together with low differential speed is the dominant state in switchbacks. The presence of small-scale current sheets in switchbacks along with the helium features are in line with the hypothesis that switchbacks could originate from the Sun via interchange reconnection process. However, other formation mechanisms are not excluded.

physics.space-ph↗
arXiv2023

BrutePrint: Expose Smartphone Fingerprint Authentication to Brute-force Attack

Fingerprint authentication has been widely adopted on smartphones to complement traditional password authentication, making it a tempting target for attackers. The smartphone industry is fully aware of existing threats, and especially for the presentation attack studied by most prior works, the threats are nearly eliminated by liveness detection and attempt limit. In this paper, we study the seemingly impossible fingerprint brute-force attack on off-the-shelf smartphones and propose a generic attack framework. We implement BrutePrint to automate the attack, that acts as a middleman to bypass attempt limit and hijack fingerprint images. Specifically, the bypassing exploits two zero-day vulnerabilities in smartphone fingerprint authentication (SFA) framework, and the hijacking leverages the simplicity of SPI protocol. Moreover, we consider a practical cross-device attack scenario and tackle the liveness and matching problems with neural style transfer (NST). We also propose a method based on neural style transfer to generate valid brute-forcing inputs from arbitrary fingerprint images. A case study shows that we always bypasses liveness detection and attempt limit while 71% spoofs are accepted. We evaluate BrutePrint on 10 representative smartphones from top-5 vendors and 3 typical types of applications involving screen lock, payment, and privacy. As all of them are vulnerable to some extent, fingerprint brute-force attack is validated on on all devices except iPhone, where the shortest time to unlock the smartphone without prior knowledge about the victim is estimated at 40 minutes. Furthermore, we suggest software and hardware mitigation measures.

cs.CR↗
arXiv2023

On the nature of X(3960)

A near-threshold enhancement in the $D_s^+ D_s^-$ system, dubbed as $X(3960)$, is observed by the LHCb collaboration recently. A combined analysis on $χ_{c0}(3930)~(\to D^+ D^-)$, $X(3960)~(\to D_s^+ D_s^-)$, and $X(3915)~(\to J/ψω)$ is performed using both a $K$-matrix approach of $D_{(s)}\bar{D}_{(s)}$ four-point contact interactions and a model of Flatté-like parameterizations. The use of the pole counting rule and spectral density function sum rule indicate, under current statistics, that this $D_s^+ D_s^-$ near-threshold state has probably the mixed nature of a $c\bar{c}$ confining state and $D_s^+ D_s^-$ continuum.

hep-ph↗
arXiv2023

Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics

We consider the design of sublinear space and query complexity algorithms for estimating the cost of a minimum spanning tree (MST) and the cost of a minimum traveling salesman (TSP) tour in a metric on $n$ points. We first consider the $o(n)$-space regime and show that, when the input is a stream of all $\binom{n}{2}$ entries of the metric, for any $α\ge 2$, both MST and TSP cost can be $α$-approximated using $\tilde{O}(n/α)$ space, and that $Ω(n/α^2)$ space is necessary for this task. Moreover, we show that even if the streaming algorithm is allowed $p$ passes over a metric stream, it still requires $\tildeΩ(\sqrt{n/αp^2})$ space. We next consider the semi-streaming regime, where computing even the exact MST cost is easy and the main challenge is to estimate TSP cost to within a factor that is strictly better than $2$. We show that, if the input is a stream of all edges of the weighted graph that induces the underlying metric, for any $\varepsilon > 0$, any one-pass $(2-\varepsilon)$-approximation of TSP cost requires $Ω(\varepsilon^2 n^2)$ space; on the other hand, there is an $\tilde{O}(n)$ space two-pass algorithm that approximates the TSP cost to within a factor of 1.96. Finally, we consider the query complexity of estimating metric TSP cost to within a factor that is strictly better than $2$, when the algorithm is given access to a matrix that specifies pairwise distances between all points. For MST estimation in this model, it is known that a $(1+\varepsilon)$-approximation is achievable with $\tilde{O}(n/\varepsilon^{O(1)})$ queries. We design an algorithm that performs $\tilde{O}(n^{1.5})$ distance queries and achieves a strictly better than $2$-approximation when either the metric is known to contain a spanning tree supported on weight-$1$ edges or the algorithm is given access to a minimum spanning tree of the graph.

cs.DS↗
arXiv2023

A Distribution Evolutionary Algorithm for the Graph Coloring Problem

Graph coloring is a challenging combinatorial optimization problem with a wide range of applications. In this paper, a distribution evolutionary algorithm based on a population of probability model (DEA-PPM) is developed to address it efficiently. Unlike existing estimation of distribution algorithms where a probability model is updated by generated solutions, DEA-PPM employs a distribution population based on a novel probability model, and an orthogonal exploration strategy is introduced to search the distribution space with the assistance of an refinement strategy. By sampling the distribution population, efficient search in the solution space is realized based on a tabu search process. Meanwhile, DEA-PPM introduces an iterative vertex removal strategy to improve the efficiency of $k$-coloring, and an inherited initialization strategy is implemented to address the chromatic problem well. The cooperative evolution of the distribution population and the solution population leads to a good balance between exploration and exploitation. Numerical results demonstrate that the DEA-PPM of small population size is competitive to the state-of-the-art metaheuristics.utes to its competitiveness to the state-of-the-art metaheuristics.

cs.NE↗
arXiv2023

Print Your Money: Cash-Like Experiences with Digital Money

The use of digital money has become increasingly popular, but it comes with certain drawbacks. For instance, it can be challenging to make payments during power outages or internet failures. Additionally, some groups may find it difficult to use digital money. To address these concerns, we propose a design for a central bank digital currency (CBDC) similar to physical cash but also integrates with digital payment systems. This would enable users to access digital money without needing a third party. Our design also addresses technical and security concerns by implementing a trust-level model and ensuring that the system meets users' security needs. Ultimately, our design has the potential to replace physical banknotes and coins.

cs.HC↗
arXiv2023

Toward Subgraph-Guided Knowledge Graph Question Generation with Graph Neural Networks

Knowledge graph (KG) question generation (QG) aims to generate natural language questions from KGs and target answers. Previous works mostly focus on a simple setting which is to generate questions from a single KG triple. In this work, we focus on a more realistic setting where we aim to generate questions from a KG subgraph and target answers. In addition, most of previous works built on either RNN-based or Transformer based models to encode a linearized KG sugraph, which totally discards the explicit structure information of a KG subgraph. To address this issue, we propose to apply a bidirectional Graph2Seq model to encode the KG subgraph. Furthermore, we enhance our RNN decoder with node-level copying mechanism to allow directly copying node attributes from the KG subgraph to the output question. Both automatic and human evaluation results demonstrate that our model achieves new state-of-the-art scores, outperforming existing methods by a significant margin on two QG benchmarks. Experimental results also show that our QG model can consistently benefit the Question Answering (QA) task as a mean of data augmentation.

cs.CL↗
arXiv2023

A Lightweight Recurrent Learning Network for Sustainable Compressed Sensing

Recently, deep learning-based compressed sensing (CS) has achieved great success in reducing the sampling and computational cost of sensing systems and improving the reconstruction quality. These approaches, however, largely overlook the issue of the computational cost; they rely on complex structures and task-specific operator designs, resulting in extensive storage and high energy consumption in CS imaging systems. In this paper, we propose a lightweight but effective deep neural network based on recurrent learning to achieve a sustainable CS system; it requires a smaller number of parameters but obtains high-quality reconstructions. Specifically, our proposed network consists of an initial reconstruction sub-network and a residual reconstruction sub-network. While the initial reconstruction sub-network has a hierarchical structure to progressively recover the image, reducing the number of parameters, the residual reconstruction sub-network facilitates recurrent residual feature extraction via recurrent learning to perform both feature fusion and deep reconstructions across different scales. In addition, we also demonstrate that, after the initial reconstruction, feature maps with reduced sizes are sufficient to recover the residual information, and thus we achieved a significant reduction in the amount of memory required. Extensive experiments illustrate that our proposed model can achieve a better reconstruction quality than existing state-of-the-art CS algorithms, and it also has a smaller number of network parameters than these algorithms. Our source codes are available at: https://github.com/C66YU/CSRN.

cs.CV↗
arXiv2023

Design, construction and commissioning of the PandaX-30T liquid xenon management system

The PandaX-30T is a proposed next-generation experiment to study dark matter and neutrinos using a dual-phase time projection chamber with \textasciitilde30 tons of liquid xenon. An innovative xenon handling subsystem of the PandaX-30T, the First-X, is described in this paper. The First-X is developed to handle liquid xenon safely and efficiently, including liquefying and long-term storing xenon without losses or contamination, and transferring cryogenic liquid xenon between the storage module and the detector safely and effectively without venting out. The storage module of the First-X is five specially designed double-walled cylindrical vessels (Center Tanks) equipped with three heat exchangers each for pressure and temperature regulation. Each Center Tank is designed with a vacuum and multi-layer insulation and a maximum allowable working pressure of 7.1 MPa, allowing 6 tons of xenon to be stored at 165--178 K at 0.1--0.2 MPa in the liquid phase or up to 300 K and up to 6.95 MPa in the supercritical phase. High-pressure storage (\textgreater0.2 MPa) only occurs in case of long-term detector shutdown or lack of nitrogen, ensuring no-loss storage of 6 tons of xenon in the range 178--300 K. In this paper, the thermophysical performances of the First-X and innovative scenarios to conduct non-vented cryogen transportation were experimentally conducted and reported using liquid argon. The non-vented cryogenic liquid filling and pump-assisted cryogenic liquid recovery have been conducted with liquid argon at a mass flow rate of 1390 kg/h, corresponding to a xenon mass flow rate of 2140 kg/h. Compared with the PandaX-4T, the transportation of xenon between the detector and the storage module is conducted in the liquid phase rather than in the gaseous phase, and the filling rate and the recovery rate are increased by approximately 50 times and 30 times, respectively.

physics.ins-det↗
arXiv2023

Excitation and voltage-gated modulation of single-mode dynamics in a planar nano-gap spin Hall nano-oscillator

We experimentally study the dynamical modes excited by current-induced spin-orbit torque and its electrostatic gating effect in a 3-terminal planar nano-gap spin Hall nano-oscillator (SHNO) with a moderate interfacial perpendicular magnetic anisotropy (IPMA). Both quasilinear propagating spin-wave and localized "bullet" modes are achieved and controlled by varying the applied in-plane magnetic field and driving current. The minimum linewidth shows a linear dependence on the actual temperature of the active area, confirming single-mode dynamics based on the nonlinear theory of spin-torque nano-oscillation with a single mode. The observed electrostatic gating tuning oscillation frequency arises from voltage-controlled magnetic anisotropy and threshold current of SHNO via modification of the nonlinear damping and/or the interfacial spin-orbit coupling of the magnetic multilayer. In contrast to previously observed two-mode coexistence degrading the spectral purity in Py/Pt-based SHNOs with a negligible IPMA, a single coherent spin-wave mode with a low driven current can be achieved by selecting the ferromagnet layer with a suitable IPMA because the nonlinear mode coupling can be diminished by bringing in the PMA field to compensate the easy-plane shape anisotropy. Moreover, the simulations demonstrate that the experimentally observed current and gate-voltage modulation of auto-oscillation modes are also closely associated with the nonlinear damping and mode coupling, which are determined by the ellipticity of magnetization precession. The demonstrated nonlinear mode coupling mechanism and electrical control approach of spin-wave modes could provide the clue to facilitate the implementation of the mutual synchronization map for neuromorphic computing applications in SHNO array networks.

cond-mat.mes-hall↗
arXiv2023

Scalable Multiple Patterning Layout Decomposition Implemented by a Distribution Evolutionary Algorithm

As the feature size of semiconductor technology shrinks to 10 nm and beyond, the multiple patterning lithography (MPL) attracts more attention from the industry. In this paper, we model the layout decomposition of MPL as a generalized graph coloring problem, which is addressed by a distribution evolutionary algorithm based on a population of probabilistic model (DEA-PPM). DEA-PPM can strike a balance between decomposition results and running time, being scalable for varied settings of mask number and lithography resolution. Due to its robustness of decomposition results, this could be an alternative technique for multiple patterning layout decomposition in next-generation technology nodes.

cs.NE↗
arXiv2023

MMVC: Learned Multi-Mode Video Compression with Block-based Prediction Mode Selection and Density-Adaptive Entropy Coding

Learning-based video compression has been extensively studied over the past years, but it still has limitations in adapting to various motion patterns and entropy models. In this paper, we propose multi-mode video compression (MMVC), a block wise mode ensemble deep video compression framework that selects the optimal mode for feature domain prediction adapting to different motion patterns. Proposed multi-modes include ConvLSTM-based feature domain prediction, optical flow conditioned feature domain prediction, and feature propagation to address a wide range of cases from static scenes without apparent motions to dynamic scenes with a moving camera. We partition the feature space into blocks for temporal prediction in spatial block-based representations. For entropy coding, we consider both dense and sparse post-quantization residual blocks, and apply optional run-length coding to sparse residuals to improve the compression rate. In this sense, our method uses a dual-mode entropy coding scheme guided by a binary density map, which offers significant rate reduction surpassing the extra cost of transmitting the binary selection map. We validate our scheme with some of the most popular benchmarking datasets. Compared with state-of-the-art video compression schemes and standard codecs, our method yields better or competitive results measured with PSNR and MS-SSIM.

eess.IV↗
arXiv2023

Data-Driven Safe Controller Synthesis for Deterministic Systems: A Posteriori Method With Validation Tests

In this work, we investigate the data-driven safe control synthesis problem for unknown dynamic systems. We first formulate the safety synthesis problem as a robust convex program (RCP) based on notion of control barrier function. To resolve the issue of unknown system dynamic, we follow the existing approach by converting the RCP to a scenario convex program (SCP) by randomly collecting finite samples of system trajectory. However, to improve the sample efficiency to achieve a desired confidence bound, we provide a new posteriori method with validation tests. Specifically, after collecting a set of data for the SCP, we further collect another set of independent \emph{validate data} as posterior information to test the obtained solution. We derive a new overall confidence bound for the safety of the controller that connects the original sample data, the support constraints, and the validation data. The efficiency of the proposed approach is illustrated by a case study of room temperature control. We show that, compared with existing methods, the proposed approach can significantly reduce the required number of sample data to achieve a desired confidence bound.

eess.SY↗
arXiv2023

DBARF: Deep Bundle-Adjusting Generalizable Neural Radiance Fields

Recent works such as BARF and GARF can bundle adjust camera poses with neural radiance fields (NeRF) which is based on coordinate-MLPs. Despite the impressive results, these methods cannot be applied to Generalizable NeRFs (GeNeRFs) which require image feature extractions that are often based on more complicated 3D CNN or transformer architectures. In this work, we first analyze the difficulties of jointly optimizing camera poses with GeNeRFs, and then further propose our DBARF to tackle these issues. Our DBARF which bundle adjusts camera poses by taking a cost feature map as an implicit cost function can be jointly trained with GeNeRFs in a self-supervised manner. Unlike BARF and its follow-up works, which can only be applied to per-scene optimized NeRFs and need accurate initial camera poses with the exception of forward-facing scenes, our method can generalize across scenes and does not require any good initialization. Experiments show the effectiveness and generalization ability of our DBARF when evaluated on real-world datasets. Our code is available at \url{https://aibluefisher.github.io/dbarf}.

cs.CV↗
arXiv2023

Visual Studio Code in Introductory Computer Science Course: An Experience Report

Involving integrated development environments (IDEs) in introductory-level (CS1) programming courses is critical. However, it is difficult for instructors to find a suitable IDE that is beginner friendly and supports strong functionality. In this paper, we report the experience of using Visual Studio Code (VS Code) in a CS1 programming course. We describe our motivation for choosing VS Code and how we introduce it to students. We create comprehensive guidance with hierarchical indexing to help students with diverse programming backgrounds. We perform an experimental evaluation of students' programming experience of using VS Code and validate the VS Code together with guidance as a promising solution for CS1 programming courses.

cs.HC↗
arXiv2023

The JUNO experiment Top Tracker

The main task of the Top Tracker detector of the neutrino reactor experiment Jiangmen Underground Neutrino Observatory (JUNO) is to reconstruct and extrapolate atmospheric muon tracks down to the central detector. This muon tracker will help to evaluate the contribution of the cosmogenic background to the signal. The Top Tracker is located above JUNO's water Cherenkov Detector and Central Detector, covering about 60% of the surface above them. The JUNO Top Tracker is constituted by the decommissioned OPERA experiment Target Tracker modules. The technology used consists in walls of two planes of plastic scintillator strips, one per transverse direction. Wavelength shifting fibres collect the light signal emitted by the scintillator strips and guide it to both ends where it is read by multianode photomultiplier tubes. Compared to the OPERA Target Tracker, the JUNO Top Tracker uses new electronics able to cope with the high rate produced by the high rock radioactivity compared to the one in Gran Sasso underground laboratory. This paper will present the new electronics and mechanical structure developed for the Top Tracker of JUNO along with its expected performance based on the current detector simulation.

hep-ex↗
arXiv2023

JUNO sensitivity to $^7$Be, $pep$, and CNO solar neutrinos

The Jiangmen Underground Neutrino Observatory (JUNO), the first multi-kton liquid scintillator detector, which is under construction in China, will have a unique potential to perform a real-time measurement of solar neutrinos well below the few MeV threshold typical for Water Cherenkov detectors. JUNO's large target mass and excellent energy resolution are prerequisites for reaching unprecedented levels of precision. In this paper, we provide estimation of the JUNO sensitivity to 7Be, pep, and CNO solar neutrinos that can be obtained via a spectral analysis above the 0.45 MeV threshold. This study is performed assuming different scenarios of the liquid scintillator radiopurity, ranging from the most opti mistic one corresponding to the radiopurity levels obtained by the Borexino experiment, up to the minimum requirements needed to perform the neutrino mass ordering determination with reactor antineutrinos - the main goal of JUNO. Our study shows that in most scenarios, JUNO will be able to improve the current best measurements on 7Be, pep, and CNO solar neutrino fluxes. We also perform a study on the JUNO capability to detect periodical time variations in the solar neutrino flux, such as the day-night modulation induced by neutrino flavor regeneration in Earth, and the modulations induced by temperature changes driven by helioseismic waves.

hep-ex↗