arXiv subjects

Jun Yang

Publications and source records attributed to Jun Yang.

At least 181 records · Page 10Linked to original sources

arXiv2024

Safety-critical Control with Control Barrier Functions: A Hierarchical Optimization Framework

The control barrier function (CBF) has become a fundamental tool in safety-critical systems design since its invention. Typically, the quadratic optimization framework is employed to accommodate CBFs, control Lyapunov functions (CLFs), other constraints and nominal control design. However, the constrained optimization framework involves hyper-parameters to tradeoff different objectives and constraints, which, if not well-tuned beforehand, impact system performance and even lead to infeasibility. In this paper, we propose a hierarchical optimization framework that decomposes the multi-objective optimization problem into nested optimization sub-problems in a safety-first approach. The new framework addresses potential infeasibility on the premise of ensuring safety and performance as much as possible and applies easily in multi-certificate cases. With vivid visualization aids, we systematically analyze the advantages of our proposed method over existing QP-based ones in terms of safety, feasibility and convergence rates. Moreover, two numerical examples are provided that verify our analysis and show the superiority of our proposed method.

math.OC↗

arXiv2024

Gaussian Approximation and Output Analysis for High-Dimensional MCMC

The widespread use of Markov Chain Monte Carlo (MCMC) methods for high-dimensional applications has motivated research into the scalability of these algorithms with respect to the dimension of the problem. Despite this, numerous problems concerning output analysis in high-dimensional settings have remained unaddressed. We present novel quantitative Gaussian approximation results for a broad range of MCMC algorithms. Notably, we analyse the dependency of the obtained approximation errors on the dimension of both the target distribution and the feature space. We demonstrate how these Gaussian approximations can be applied in output analysis. This includes determining the simulation effort required to guarantee Markov chain central limit theorems and consistent estimation of the variance and effective sample size in high-dimensional settings. We give quantitative convergence bounds for termination criteria and show that the termination time of a wide class of MCMC algorithms scales polynomially in dimension while ensuring a desired level of precision. Our results offer guidance to practitioners for obtaining appropriate standard errors and deciding the minimum simulation effort of MCMC algorithms in both multivariate and high-dimensional settings.

stat.CO↗

arXiv2024

Selective-Memory Meta-Learning with Environment Representations for Sound Event Localization and Detection

Environment shifts and conflicts present significant challenges for learning-based sound event localization and detection (SELD) methods. SELD systems, when trained in particular acoustic settings, often show restricted generalization capabilities for diverse acoustic environments. Furthermore, obtaining annotated samples for spatial sound events is notably costly. Deploying a SELD system in a new environment requires extensive time for re-training and fine-tuning. To overcome these challenges, we propose environment-adaptive Meta-SELD, designed for efficient adaptation to new environments using minimal data. Our method specifically utilizes computationally synthesized spatial data and employs Model-Agnostic Meta-Learning (MAML) on a pre-trained, environment-independent model. The method then utilizes fast adaptation to unseen real-world environments using limited samples from the respective environments. Inspired by the Learning-to-Forget approach, we introduce the concept of selective memory as a strategy for resolving conflicts across environments. This approach involves selectively memorizing target-environment-relevant information and adapting to the new environments through the selective attenuation of model parameters. In addition, we introduce environment representations to characterize different acoustic settings, enhancing the adaptability of our attenuation approach to various environments. We evaluate our proposed method on the development set of the Sony-TAu Realistic Spatial Soundscapes 2023 (STARSS23) dataset and computationally synthesized scenes. Experimental results demonstrate the superior performance of the proposed method compared to conventional supervised learning methods, particularly in localization.

eess.AS↗

arXiv2024

AmpAgent: An LLM-based Multi-Agent System for Multi-stage Amplifier Schematic Design from Literature for Process and Performance Porting

Multi-stage amplifiers are widely applied in analog circuits. However, their large number of components, complex transfer functions, and intricate pole-zero distributions necessitate extensive manpower for derivation and param sizing to ensure their stability. In order to achieve efficient derivation of the transfer function and simplify the difficulty of circuit design, we propose AmpAgent: a multi-agent system based on large language models (LLMs) for efficiently designing such complex amplifiers from literature with process and performance porting. AmpAgent is composed of three agents: Literature Analysis Agent, Mathematics Reasoning Agent and Device Sizing Agent. They are separately responsible for retrieving key information (e.g. formulas and transfer functions) from the literature, decompose the whole circuit's design problem by deriving the key formulas, and address the decomposed problem iteratively. AmpAgent was employed in the schematic design of seven types of multi-stage amplifiers with different compensation techniques. In terms of design efficiency, AmpAgent has reduced the number of iterations by 1.32$ \sim $4${\times}$ and execution time by 1.19$ \sim $2.99${\times}$ compared to conventional optimization algorithms, with a success rate increased by 1.03$ \sim $6.79${\times}$. In terms of circuit performance, it has improved by 1.63$ \sim $27.25${\times}$ compared to the original literature. The findings suggest that LLMs could play a crucial role in the field of complex analog circuit schematic design, as well as process and performance porting.

cs.ET↗

arXiv2024

Bridging the Gap: GRB 230812B -- A Three-Second Supernova-Associated Burst Detected by the GRID Mission

GRB 230812B, detected by the Gamma-Ray Integrated Detectors (GRID) constellation mission, is an exceptionally bright gamma-ray burst (GRB) with a duration of only 3 seconds. Sitting near the traditional boundary ($\sim$ 2 s) between long and short GRBs, GRB 230812B is notably associated with a supernova (SN), indicating a massive star progenitor. This makes it a rare example of a short-duration GRB resulting from stellar collapse. Our analysis, using a time-evolving synchrotron model, suggests that the burst has an emission radius of approximately $10^{14.5}$~cm. We propose that the short duration of GRB 230812B is due to the combined effects of the central engine's activity time and the time required for the jet to break through the stellar envelope. Our findings provide another case that challenges the conventional view that short-duration GRBs originate exclusively from compact object mergers, demonstrating that a broader range of durations exists for GRBs arising from the collapse of massive stars.

astro-ph.HE↗

arXiv2024

NeB-SLAM: Neural Blocks-based Salable RGB-D SLAM for Unknown Scenes

Neural implicit representations have recently demonstrated considerable potential in the field of visual simultaneous localization and mapping (SLAM). This is due to their inherent advantages, including low storage overhead and representation continuity. However, these methods necessitate the size of the scene as input, which is impractical for unknown scenes. Consequently, we propose NeB-SLAM, a neural block-based scalable RGB-D SLAM for unknown scenes. Specifically, we first propose a divide-and-conquer mapping strategy that represents the entire unknown scene as a set of sub-maps. These sub-maps are a set of neural blocks of fixed size. Then, we introduce an adaptive map growth strategy to achieve adaptive allocation of neural blocks during camera tracking and gradually cover the whole unknown scene. Finally, extensive evaluations on various datasets demonstrate that our method is competitive in both mapping and tracking when targeting unknown environments.

cs.CV↗

arXiv2024

Exploring Hannan Limitation for 3D Antenna Array

Hannan Limitation successfully links the directivity characteristics of 2D arrays with the aperture gain limit, providing the radiation efficiency upper limit for large 2D planar antenna arrays. This demonstrates the inevitable radiation efficiency degradation caused by mutual coupling effects between array elements. However, this limitation is derived based on the assumption of infinitely large 2D arrays, which means that it is not an accurate law for small-size arrays. In this paper, we extend this theory and propose an estimation formula for the radiation efficiency upper limit of finite-sized 2D arrays. Furthermore, we analyze a 3D array structure consisting of two parallel 2D arrays. Specifically, we provide evaluation formulas for the mutual coupling strengths for both infinite and finite size arrays and derive the fundamental efficiency limit of 3D arrays. Moreover, based on the established gain limit of antenna arrays with fixed aperture sizes, we derive the achievable gain limit of finite size 3D arrays. Besides the performance analyses, we also investigate the spatial radiation characteristics of the considered 3D array structure, offering a feasible region for 2D phase settings under a given energy attenuation threshold. Through simulations, we demonstrate the effectiveness of our proposed theories and gain advantages of 3D arrays for better spatial coverage under various scenarios.

cs.IT↗

arXiv2024

Data-driven topology design based on principal component analysis for 3D structural design problems

Topology optimization is a structural design methodology widely utilized to address engineering challenges. However, sensitivity-based topology optimization methods struggle to solve optimization problems characterized by strong non-linearity. Leveraging the sensitivity-free nature and high capacity of deep generative models, data-driven topology design (DDTD) methodology is considered an effective solution to this problem. Despite this, the training effectiveness of deep generative models diminishes when input size exceeds a threshold while maintaining high degrees of freedom is crucial for accurately characterizing complex structures. To resolve the conflict between the both, we propose DDTD based on principal component analysis (PCA). Its core idea is to replace the direct training of deep generative models with material distributions by using a principal component score matrix obtained from PCA computation and to obtain the generated material distributions with new features through the restoration process. We apply the proposed PCA-based DDTD to the problem of minimizing the maximum stress in 3D structural mechanics and demonstrate it can effectively address the current challenges faced by DDTD that fail to handle 3D structural design problems. Various experiments are conducted to demonstrate the effectiveness and practicability of the proposed PCA-based DDTD.

cs.LG↗

arXiv2024

A quasi-ohmic back contact achieved by inserting single-crystal graphene in flexible Kesterite solar cells

Flexible photovoltaics with a lightweight and adaptable nature that allows for deployment on curved surfaces and in building facades have always been a goal vigorously pursued by researchers in thin-film solar cell technology. The recent strides made in improving the sunlight-to-electricity conversion efficiency of kesterite Cu$_{2}$ZnSn(S, Se)$_{4}$ (CZTSSe) suggest it to be a perfect candidate. However, making use of rare Mo foil in CZTSSe solar cells causes severe problems in thermal expansion matching, uneven grain growth, and severe problems at the back contact of the devices. Herein, a strategy utilizing single-crystal graphene to modify the back interface of flexible CZTSSe solar cells is proposed. It will be shown that the insertion of graphene at the Mo foil/CZTSSe interface provides strong physical support for the subsequent deposition of the CZTSSe absorber layer, improving the adhesion between the absorber layer and the Mo foil substrate. Additionally, the graphene passivates the rough sites on the surface of the Mo foil, enhancing the chemical homogeneity of the substrate, and resulting in a more crystalline and homogeneous CZTSSe absorber layer on the Mo foil substrate. The detrimental reaction between Mo and CZTSSe has also been eliminated. Through an analysis of the electrical properties, it is found that the introduction of graphene at the back interface promotes the formation of a quasi-ohmic contact at the back contact, decreasing the back contact barrier of the solar cell, and leading to efficient collection of charges at the back interface. This investigation demonstrates that solution-based CZTSSe photovoltaic devices could form the basis of cheap and flexible solar cells.

cond-mat.mtrl-sci↗

arXiv2024

Ocean Circulation on Tide-locked Lava Worlds, Part II: Scalings

On tidally locked lava planets, magma ocean can form on the permanent dayside. The circulation of the magma ocean can be driven by stellar radiation and atmospheric winds. The strength of ocean circulation and the depth of the magma ocean depend on external forcings and the dominant balance of the momentum equation. In this study, we develop scaling laws for the magma ocean depth, oceanic current speed, and ocean heat transport convergence driven by stellar and wind forcings in three different dynamic regimes: non-rotating viscosity-dominant Regime I, non-rotating inviscid limit Regime II, and rotation-dominant Regime III. Scaling laws suggest that magma ocean depth, current speed, and ocean heat transport convergence are controlled by various parameters, including vertical diffusivity/viscosity, substellar temperature, planetary rotation rate, and wind stress. In general, scaling laws predict that magma ocean depth ranges from a few meters to a few hundred meters. For Regime I, results from scaling laws are further confirmed by numerical simulations. Considering the parameters of a typical lava super-Earth, we found that the magma ocean is most likely in the rotation-dominant Regime III.

astro-ph.EP↗

arXiv2024

Ocean Circulation on Tide-locked Lava Worlds, Part I: An Idealized 2D Numerical Model

A magma ocean is expected to exist on the dayside of tide-locked planets if surface temperature exceeds the melting temperature of typical crust. As highly prioritized targets for the James Webb Space Telescope (JWST), more information about the surface and atmosphere of lava planets will soon be available. In most previous studies of lava planets, the system is typically assumed to be vigorously convecting and isentropic. This implies a magma ocean depth reaching $O$($10^4$--$10^5$) m, determined by the adiabats and melting curves. In this study, we aim to simulate ocean circulation and ocean depth on tidally locked lava worlds using an idealized 2D (x-z) model developed by the authors. Our simulation results show that under zero or a small internal source, the maximum zonal current speed ranges from 0.1--1.0 m s$^{-1}$ and the magma ocean depth remains $O$(100) m, being more than 100 times shallower than that predicted in a fully convecting system. We demonstrate that the ocean heat transport divergence is consistently smaller than the stellar insolation by 1--2 orders of magnitude. Consequently, the impact of ocean circulation on the thermal phase curve of tidally locked lava worlds is minimal in observations.

astro-ph.EP↗

arXiv2024

ChipExpert: The Open-Source Integrated-Circuit-Design-Specific Large Language Model

The field of integrated circuit (IC) design is highly specialized, presenting significant barriers to entry and research and development challenges. Although large language models (LLMs) have achieved remarkable success in various domains, existing LLMs often fail to meet the specific needs of students, engineers, and researchers. Consequently, the potential of LLMs in the IC design domain remains largely unexplored. To address these issues, we introduce ChipExpert, the first open-source, instructional LLM specifically tailored for the IC design field. ChipExpert is trained on one of the current best open-source base model (Llama-3 8B). The entire training process encompasses several key stages, including data preparation, continue pre-training, instruction-guided supervised fine-tuning, preference alignment, and evaluation. In the data preparation stage, we construct multiple high-quality custom datasets through manual selection and data synthesis techniques. In the subsequent two stages, ChipExpert acquires a vast amount of IC design knowledge and learns how to respond to user queries professionally. ChipExpert also undergoes an alignment phase, using Direct Preference Optimization, to achieve a high standard of ethical performance. Finally, to mitigate the hallucinations of ChipExpert, we have developed a Retrieval-Augmented Generation (RAG) system, based on the IC design knowledge base. We also released the first IC design benchmark ChipICD-Bench, to evaluate the capabilities of LLMs across multiple IC design sub-domains. Through comprehensive experiments conducted on this benchmark, ChipExpert demonstrated a high level of expertise in IC design knowledge Question-and-Answer tasks.

cs.AR↗

arXiv2024

Tailoring Vaccine Messaging with Common-Ground Opinions

One way to personalize chatbot interactions is by establishing common ground with the intended reader. A domain where establishing mutual understanding could be particularly impactful is vaccine concerns and misinformation. Vaccine interventions are forms of messaging which aim to answer concerns expressed about vaccination. Tailoring responses in this domain is difficult, since opinions often have seemingly little ideological overlap. We define the task of tailoring vaccine interventions to a Common-Ground Opinion (CGO). Tailoring responses to a CGO involves meaningfully improving the answer by relating it to an opinion or belief the reader holds. In this paper we introduce TAILOR-CGO, a dataset for evaluating how well responses are tailored to provided CGOs. We benchmark several major LLMs on this task; finding GPT-4-Turbo performs significantly better than others. We also build automatic evaluation metrics, including an efficient and accurate BERT model that outperforms finetuned LLMs, investigate how to successfully tailor vaccine messaging to CGOs, and provide actionable recommendations from this investigation. Code and model weights: https://github.com/rickardstureborg/tailor-cgo Dataset: https://huggingface.co/datasets/DukeNLP/tailor-cgo

cs.CL↗

arXiv2024

Superpixel Semantics Representation and Pre-training for Vision-Language Task

The key to integrating visual language tasks is to establish a good alignment strategy. Recently, visual semantic representation has achieved fine-grained visual understanding by dividing grids or image patches. However, the coarse-grained semantic interactions in image space should not be ignored, which hinders the extraction of complex contextual semantic relations at the scene boundaries. This paper proposes superpixels as comprehensive and robust visual primitives, which mine coarse-grained semantic interactions by clustering perceptually similar pixels, speeding up the subsequent processing of primitives. To capture superpixel-level semantic features, we propose a Multiscale Difference Graph Convolutional Network (MDGCN). It allows parsing the entire image as a fine-to-coarse visual hierarchy. To reason actual semantic relations, we reduce potential noise interference by aggregating difference information between adjacent graph nodes. Finally, we propose a multi-level fusion rule in a bottom-up manner to avoid understanding deviation by mining complementary spatial information at different levels. Experiments show that the proposed method can effectively promote the learning of multiple downstream tasks. Encouragingly, our method outperforms previous methods on all metrics. Our code will be released upon publication.

cs.CV↗

arXiv2024

PARQO: Penalty-Aware Robust Plan Selection in Query Optimization

The effectiveness of a query optimizer relies on the accuracy of selectivity estimates. The execution plan generated by the optimizer can be extremely poor in reality due to uncertainty in these estimates. This paper presents PARQO (Penalty-Aware Robust Plan Selection in Query Optimization), a novel system where users can define powerful robustness metrics that assess the expected penalty of a plan with respect to true optimal plans under uncertain selectivity estimates. PARQO uses workload-informed profiling to build error models, and employs principled sensitivity analysis techniques to identify human-interpretable selectivity dimensions with the largest impact on penalty. Experiments on three benchmarks demonstrate that PARQO finds robust, performant plans, and enables efficient and effective parametric optimization.

cs.DB↗

arXiv2024

Hashing Beam Training for Integrated Ground-Air-Space Wireless Networks

In integrated ground-air-space (IGAS) wireless networks, numerous services require sensing knowledge including location, angle, distance information, etc., which usually can be acquired during the beam training stage. On the other hand, IGAS networks employ large-scale antenna arrays to mitigate obstacle occlusion and path loss. However, large-scale arrays generate pencil-shaped beams, which necessitate a higher number of training beams to cover the desired space. These factors motivate our investigation into the IGAS beam training problem to achieve effective sensing services. To address the high complexity and low identification accuracy of existing beam training techniques, we propose an efficient hashing multi-arm beam (HMB) training scheme. Specifically, we first construct an IGAS single-beam training codebook for the uniform planar arrays. Then, the hash functions are chosen independently to construct the multi-arm beam training codebooks for each AP. All APs traverse the predefined multi-arm beam training codeword simultaneously and the multi-AP superimposed signals at the user are recorded. Finally, the soft decision and voting methods are applied to obtain the correctly aligned beams only based on the signal powers. In addition, we logically prove that the traversal complexity is at the logarithmic level. Simulation results show that our proposed IGAS HMB training method can achieve 96.4% identification accuracy of the exhaustive beam training method and greatly reduce the training overhead.

cs.IT↗

arXiv2024

When Automated Program Repair Meets Regression Testing -- An Extensive Study on 2 Million Patches

In recent years, Automated Program Repair (APR) has been extensively studied in academia and even drawn wide attention from industry. However, APR techniques can be extremely time consuming since (1) a large number of patches can be generated for a given bug, and (2) each patch needs to be executed on the original tests to ensure its correctness. In the literature, various techniques (e.g., based on learning, mining, and constraint solving) have been proposed/studied to reduce the number of patches. Intuitively, every patch can be treated as a software revision during regression testing; thus, traditional Regression Test Selection (RTS) techniques can be leveraged to only execute the tests affected by each patch (as the other tests would keep the same outcomes) to further reduce patch execution time. However, few APR systems actually adopt RTS and there is still a lack of systematic studies demonstrating the benefits of RTS and the impact of different RTS strategies on APR. To this end, this paper presents the first extensive study of widely-used RTS techniques at different levels (i.e., class/method/statement levels) for 12 state-of-the-art APR systems on over 2M patches. Our study reveals various practical guidelines for bridging the gap between APR and regression testing.

cs.SE↗

arXiv2024

Measuring the Spin of Black Hole Transient 4U 1543-47 Using Insight-HXMT

We provided a comprehensive study of the properties of the black hole in the low-mass X-ray binary system 4U 1543-47, specifically focusing on the 2021 outburst (MJD 59380-59470). Using observations from the \textit{Insight}-HXMT mission, we employed X-ray reflection fitting method and analyzed spectral data to estimate key black hole parameters. Through our investigation redbased on 6 out of the 52 available observations, we estimated the spin parameter of the black hole to be $0.902_{-0.053}^{+0.054}$ and the inclination angle of the accretion disk to be $28.91_{-1.24}^{+1.82}$ degrees (90\% confidence limits, statistical only), then we discussed the influence of high luminosity. Based on the \texttt{relxill} series models are not suitable for thick disk scenario, and in comparison with findings from other studies, we propose that our estimation of the spin value may be exaggerated.

astro-ph.HE↗