arXiv subjects

Yingying Liu

Publications and source records attributed to Yingying Liu.

17 recordsLinked to original sources

arXiv2026

OUTLETS: Output-Length Prediction from Speculative Decoding Backbones

The heavy-tailed distribution of output lengths in Large Language Model (LLM) serving poses major challenges for resource provisioning and cluster scheduling. Although output-length prediction can mitigate these issues, existing approaches have key drawbacks: external proxy models add substantial latency and often have limited fidelity, whereas internal state-based methods are efficient but rely on shallow probes of current model states. We identify a structural connection between speculative decoding (SD) and length prediction: latent representations produced by the draft decoder in advanced frameworks (e.g., EAGLE-3) encode signals that are predictive of generation length. Building on this insight, we introduce OUTLETS (Output-Length Prediction from Speculative Decoding Backbones), which repurposes the speculative backbone as a trajectory-aware length predictor. When its draft representations are already computed for speculative decoding, OUTLETS adds only a lightweight regression head and achieves lower MAE than the evaluated methods. Under saturated disaggregated serving, OUTLETS predictions enable standard scheduling policies to prioritize shorter requests and distribute requests more evenly across decoding instances, reducing short-request P99 latency by 34.8%.

cs.CL↗

arXiv2026

M3D-Stereo: A Multiple-Medium and Multiple-Degradation Dataset for Stereo Image Restoration

Image restoration under adverse conditions, such as underwater, haze or fog, and low-light environments, remains a highly challenging problem due to complex physical degradations and severe information loss. Existing datasets are predominantly limited to a single degradation type or heavily rely on synthetic data without stereo consistency, inherently restricting their applicability in real-world scenarios. To address this, we introduce M3D-Stereo, a stereo dataset with 7904 high-resolution image pairs for image restoration research acquired in multiple media with multiple controlled degradation levels. It encompasses four degradation scenarios: underwater scatter, haze/fog, underwater low-light, and haze low-light. Each scenario forms a subset, and is divided into six levels of progressive degradation, allowing fine-grained evaluations of restoration methods with increasing severity of degradation. Collected via a laboratory setup, the dataset provides aligned stereo image pairs along with their pixel-wise consistent clear ground truths. Two restoration tasks, single-level and mixed-level degradation, were performed to verify its validity. M3D-Stereo establishes a better controlled and more realistic benchmark to evaluate image restoration and stereo matching methods in complex degradation environments. It is made public under LGPLv3 license.

cs.CV↗

arXiv2026

Marking Data-Informativity and Data-Driven Supervisory Control of Discrete-Event Systems

In this paper we develop a data-driven approach for marking nonblocking supervisory control of discrete-event systems (DES). We consider a setup in which models of DES to be controlled are unknown, but a set of data concerning the behaviors of DES is available. We ask the question: Under what conditions of the available data set can a valid marking noblocking supervisor be designed for the unknown DES to satisfy a given specification? Answering this question, we identify and formalize a novel concept called marking data-informativity. Moreover, we design an algorithm for the verification of this concept. Next, if the data set fails to be marking informative, we propose two related new concepts of restricted marking data-informativity and marking informatizability. Finally, we develop an algorithm to compute the largest subset of control specification for which the data set is least restricted marking informative.

cs.FL↗

arXiv2025

An RGB-D Image Dataset for Lychee Detection and Maturity Classification for Robotic Harvesting

Lychee is a high-value subtropical fruit. The adoption of vision-based harvesting robots can significantly improve productivity while reduce reliance on labor. High-quality data are essential for developing such harvesting robots. However, there are currently no consistently and comprehensively annotated open-source lychee datasets featuring fruits in natural growing environments. To address this, we constructed a dataset to facilitate lychee detection and maturity classification. Color (RGB) images were acquired under diverse weather conditions, and at different times of the day, across multiple lychee varieties, such as Nuomici, Feizixiao, Heiye, and Huaizhi. The dataset encompasses three different ripeness stages and contains 11,414 images, consisting of 878 raw RGB images, 8,780 augmented RGB images, and 1,756 depth images. The images are annotated with 9,658 pairs of lables for lychee detection and maturity classification. To improve annotation consistency, three individuals independently labeled the data, and their results were then aggregated and verified by a fourth reviewer. Detailed statistical analyses were done to examine the dataset. Finally, we performed experiments using three representative deep learning models to evaluate the dataset. It is publicly available for academic

cs.CV↗

arXiv2025

Markov Clustering based Fully Automated Nonblocking Hierarchical Supervisory Control of Large-Scale Discrete-Event Systems

In this paper we revisit the abstraction-based approach to synthesize a hierarchy of decentralized supervisors and coordinators for nonblocking control of large-scale discrete-event systems (DES), and augment it with a new clustering method for automatic and flexible grouping of relevant components during the hierarchical synthesis process. This method is known as Markov clustering, which not only automatically performs grouping but also allows flexible tuning the sizes of the resulting clusters using a single parameter. Compared to the existing abstraction-based approach that lacks effective grouping method for general cases, our proposed approach based on Markov clustering provides a fully automated and effective hierarchical synthesis procedure applicable to general large-scale DES. Moreover, it is proved that the resulting hierarchy of supervisors and coordinators collectively achieves global nonblocking (and maximally permissive) controlled behavior under the same conditions as those in the existing abstraction-based approach. Finally, a benchmark case study is conducted to empirically demonstrate the effectiveness of our approach.

eess.SY↗

arXiv2025

EchoONE: Segmenting Multiple echocardiography Planes in One Model

In clinical practice of echocardiography examinations, multiple planes containing the heart structures of different view are usually required in screening, diagnosis and treatment of cardiac disease. AI models for echocardiography have to be tailored for each specific plane due to the dramatic structure differences, thus resulting in repetition development and extra complexity. Effective solution for such a multi-plane segmentation (MPS) problem is highly demanded for medical images, yet has not been well investigated. In this paper, we propose a novel solution, EchoONE, for this problem with a SAM-based segmentation architecture, a prior-composable mask learning (PC-Mask) module for semantic-aware dense prompt generation, and a learnable CNN-branch with a simple yet effective local feature fusion and adaption (LFFA) module for SAM adapting. We extensively evaluated our method on multiple internal and external echocardiography datasets, and achieved consistently state-of-the-art performance for multi-source datasets with different heart planes. This is the first time that the MPS problem is solved in one model for echocardiography data. The code will be available at https://github.com/a2502503/EchoONE.

cs.CV↗

arXiv2024

Highly coherent grain boundaries induced by local pseudo-mirror symmetry in $β$-Ga2O3

Grain boundaries have extensive influence on the performance of crystal materials. However, the atomic-scale structure and its relation with local and crystallographic symmetries remain elusive in low-symmetry crystals. Herein, we find that the local pseudo-mirror-symmetric atomic layer is the common physical origin of a series of highly coherent grain boundaries in the low-symmetry $β$-Ga2O3 crystal. These include the (100) twin boundary and an emerging series of $(h-1'0'2)/(h+1'0'\bar{2})$ coherent asymmetric grain boundaries (CAGBs). Owing to the local pseudo-mirror symmetry and the special geometric relation of the $β$-Ga2O3 conventional cell, these CAGBs place 80% of the boundary atoms in pseudo-coincident sites, exhibiting high coherence under the coincident-site lattice model. With a combination of density functional theory calculations, Czochralski growth experiment, and atomic-scale characterizations, the structure and stability of the $(002)/(20\bar{2})$-A CAGB are confirmed, with a boundary energy density as low as 0.36 J/m2. This CAGB is responsible for the spontaneous formation of a twinned defect facet at the surface steps during the epitaxy growth of $β$-Ga2O3, warranting a substrate orientation selection rule for $β$-Ga2O3. Through this study, we provide insights into the grain boundary physics in the low-symmetry $β$-Ga2O3 crystal while emphasizing the importance of the local pseudo-symmetries in the low-symmetry crystals.

cond-mat.mtrl-sci↗

arXiv2023

To Transmit or Not to Transmit: Optimal Sensor Schedule for Remote State Estimation of Discrete-Event Systems

This paper considers the problem of optimal sensor schedules for remote state estimation of discrete-event systems. In this setting, the sensors observe information from the plant and transmit the observable information to the receiver or estimator selectively. A transmission mechanism decides whether the observable information is transmitted or not, according to an information transmission policy, such that the receiver has sufficient information to satisfy the purpose of decision-making. To construct such a transmission mechanism, we first construct a non-deterministic dynamic observer that contains all feasible information transmission policies. Then, we show that the information updating rule of the dynamic observer indeed yields the state estimate from the receiver's point of view. Finally, we propose an approach to extract a specific information transmission policy, realized by a finite-state automaton, from the dynamic observer while satisfying some desired observation properties. To reduce transmission-related costs, we also require that the sensors transmit events as few as possible. A running example is provided to illustrate the proposed procedures.

eess.SY↗

arXiv2023

Bile dynamics within the biliary tract and microfluidic-based bile component detection: A review

Bilestones are solid masses found in the gallbladder or biliary tract, which block the normal bile flow and eventually result in severe life-threatening complications. Studies have shown that bilestone formation may be related to bile flow dynamics and the concentration level of bile components. The bile flow dynamics in the biliary tract play a critical role in disclosing the mechanism of bile stasis and transportation. The concentration of bile composition is closely associated with processes such as nucleation and crystallization. Recently, microfluidic-based biosensors have been favored for multiple advantages over traditional bench-top detection assays for their less sample consumption, portability, low cost, and high sensitivity for real-time detection. Here, we reviewed the developments in bile dynamics study and microfluidics-based bile component detection methods. These studies may provide valuable insights into the bilestone formation mechanisms and better treatment, alongside our opinions on the future development of in vitro lithotriptic drug screening of bilestones and bile characterization tests.

physics.app-ph↗

arXiv2023

The Progress, Challenges, and Perspectives of Directed Greybox Fuzzing

Greybox fuzzing is a scalable and practical approach for software testing. Most greybox fuzzing tools are coverage-guided as reaching high code coverage is more likely to find bugs. However, since most covered codes may not contain bugs, blindly extending code coverage is less efficient, especially for corner cases. Unlike coverage-guided greybox fuzzing which increases code coverage in an undirected manner, directed greybox fuzzing (DGF) spends most of its time allocation on reaching specific targets (e.g., the bug-prone zone) without wasting resources stressing unrelated parts. Thus, DGF is particularly suitable for scenarios such as patch testing,bug reproduction, and special bug detection. For now, DGF has become an active research area. However, DGF has general limitations and challenges that are worth further studying. Based on the investigation of 42 state-of-the-art fuzzers that are closely related to DGF, we conduct the first in-depth study to summarize the empirical evidence on the research progress of DGF. This paper studies DGF from a broader view, which takes into account not only the location-directed type that targets specific code parts, but also the behavior-directed type that aims to expose abnormal program behaviors. By analyzing the benefits and limitations of DGF research, we try to identify gaps in current research, meanwhile, reveal new research opportunities, and suggest areas for further investigation.

cs.CR↗

arXiv2023

Molecular tuning of DNA framework-programmed silicification by cationic silica cluster attachment

The organizational complexity of biominerals has long fascinated scientists seeking to understand biological programming and implement new developments in biomimetic materials chemistry. Nonclassical crystallization pathways have been observed and analyzed in typical crystalline biominerals, involving the controlled attachment and reconfiguration of nanoparticles and clusters on organic templates. However, the understanding of templated amorphous silica mineralization remains limited, hindering the rational design of complex silica-based materials. Here, we present a systematic study on the stabilization of self-capping cationic silica cluster (CSC) and their assembly dynamics using DNA nanostructures as programmable attachment templates. By tuning the composition and structure of CSC, we demonstrate high-fidelity silicification at single-cluster resolution, revealing a process of adaptive templating involving cooperative adjustments of both the DNA framework and cluster morphology. Our results provide a unified model of silicification by cluster attachment and pave the way towards the molecular tuning of pre- and post-nucleation stages of sol-gel reactions. Overall, our findings provide new insights for the design of silica-based materials with controlled organization and functionality, bridging the gap between biomineralization principles and the rational design of biomimetic material.

physics.chem-ph↗

arXiv2023

FFPN: Fourier Feature Pyramid Network for Ultrasound Image Segmentation

Ultrasound (US) image segmentation is an active research area that requires real-time and highly accurate analysis in many scenarios. The detect-to-segment (DTS) frameworks have been recently proposed to balance accuracy and efficiency. However, existing approaches may suffer from inadequate contour encoding or fail to effectively leverage the encoded results. In this paper, we introduce a novel Fourier-anchor-based DTS framework called Fourier Feature Pyramid Network (FFPN) to address the aforementioned issues. The contributions of this paper are two fold. First, the FFPN utilizes Fourier Descriptors to adequately encode contours. Specifically, it maps Fourier series with similar amplitudes and frequencies into the same layer of the feature map, thereby effectively utilizing the encoded Fourier information. Second, we propose a Contour Sampling Refinement (CSR) module based on the contour proposals and refined features produced by the FFPN. This module extracts rich features around the predicted contours to further capture detailed information and refine the contours. Extensive experimental results on three large and challenging datasets demonstrate that our method outperforms other DTS methods in terms of accuracy and efficiency. Furthermore, our framework can generalize well to other detection or segmentation tasks.

eess.IV↗

arXiv2023

Deep Learning Methods for Small Molecule Drug Discovery: A Survey

With the development of computer-assisted techniques, research communities including biochemistry and deep learning have been devoted into the drug discovery field for over a decade. Various applications of deep learning have drawn great attention in drug discovery, such as molecule generation, molecular property prediction, retrosynthesis prediction, and reaction prediction. While most existing surveys only focus on one of the applications, limiting the view of researchers in the community. In this paper, we present a comprehensive review on the aforementioned four aspects, and discuss the relationships among different applications. The latest literature and classical benchmarks are presented for better understanding the development of variety of approaches. We commence by summarizing the molecule representation format in these works, followed by an introduction of recent proposed approaches for each of the four tasks. Furthermore, we review a variety of commonly used datasets and evaluation metrics and compare the performance of deep learning-based models. Finally, we conclude by identifying remaining challenges and discussing the future trend for deep learning methods in drug discovery.

cs.LG↗

arXiv2022

UltraFuzz: Towards Resource-saving in Distributed Fuzzing

Recent research has sought to improve fuzzing performance via parallel computing. However, researchers focus on improving efficiency while ignoring the increasing cost of testing resources. Parallel fuzzing in the distributed environment amplifies the resource-wasting problem caused by the random nature of fuzzing. In the parallel mode, owing to the lack of an appropriate task dispatching scheme and timely fuzzing status synchronization among different fuzzing instances, task conflicts and workload imbalance occur, making the resource-wasting problem severe. In this paper, we design UltraFuzz, a fuzzer for resource-saving in distributed fuzzing. Based on centralized dynamic scheduling, UltraFuzz can dispatch tasks and schedule power globally and reasonably to avoid resource-wasting. Besides, UltraFuzz can elastically allocate computing power for fuzzing and seed evaluation, thereby avoiding the potential bottleneck of seed evaluation that blocks the fuzzing process. UltraFuzz was evaluated using real-world programs, and the results show that with the same testing resource, UltraFuzz outperforms state-of-the-art tools, such as AFL, AFL-P, PAFL, and EnFuzz. Most importantly, the experiment reveals certain results that seem counter-intuitive, namely that parallel fuzzing can achieve ``super-linear acceleration'' when compared with single-core fuzzing. We conduct additional experiments to reveal the deep reasons behind this phenomenon and dig deep into the inherent advantages of parallel fuzzing over serial fuzzing, including the global optimization of seed energy scheduling and the escape of local optimal seed. Additionally, 24 real-world vulnerabilities were discovered using UltraFuzz.

cs.CR↗

arXiv2021

Supervisory Control of Multi-Agent Discrete-Event Systems with Partial Observation

In this paper we investigate multi-agent discrete-event systems with partial observation. The agents can be divided into several groups in each of which the agents have similar (isomorphic) state transition structures, and thus can be relabeled into the same template. Based on the template a scalable supervisor whose state size and computational cost are independent of the number of agents is designed for the case of partial observation. The scalable supervisor under partial observation does not need to be recomputed regardless of how many agents are added to or removed from the system. We generalize our earlier results to partial observation by proposing sufficient conditions for safety and maximal permissiveness of the scalable least restrictive supervisor on the template level. An example is provided to illustrate the proposed scalable supervisory synthesis.

eess.SY↗

arXiv2021

Time and Frequency Network for Human Action Detection in Videos

Currently, spatiotemporal features are embraced by most deep learning approaches for human action detection in videos, however, they neglect the important features in frequency domain. In this work, we propose an end-to-end network that considers the time and frequency features simultaneously, named TFNet. TFNet holds two branches, one is time branch formed of three-dimensional convolutional neural network(3D-CNN), which takes the image sequence as input to extract time features; and the other is frequency branch, extracting frequency features through two-dimensional convolutional neural network(2D-CNN) from DCT coefficients. Finally, to obtain the action patterns, these two features are deeply fused under the attention mechanism. Experimental results on the JHMDB51-21 and UCF101-24 datasets demonstrate that our approach achieves remarkable performance for frame-mAP.

cs.CV↗

arXiv2017

On Scalable Supervisory Control of Multi-Agent Discrete-Event Systems

In this paper we study multi-agent discrete-event systems where the agents can be divided into several groups, and within each group the agents have similar or identical state transition structures. We employ a relabeling map to generate a "template structure" for each group, and synthesize a scalable supervisor whose state size and computational process are independent of the number of agents. This scalability allows the supervisor to remain invariant (no recomputation or reconfiguration needed) if and when there are agents removed due to failure or added for increasing productivity. The constant computational effort for synthesizing the scalable supervisor also makes our method promising for handling large-scale multi-agent systems. Moreover, based on the scalable supervisor we design scalable local controllers, one for each component agent, to establish a purely distributed control architecture. Three examples are provided to illustrate our proposed scalable supervisory synthesis and the resulting scalable supervisors as well as local controllers.

eess.SY↗