arXiv subjects

Zhe Yu

Publications and source records attributed to Zhe Yu.

At least 55 records · Page 3Linked to original sources

arXiv2024

Particle production during Inflation with a non-minimally coupled spectator scalar field

We study the inflationary model with a spectator scalar field $χ$ coupled to both the inflaton and Ricci scalar. The interaction between the $χ$ field and the gravity, denoted by $ξRχ^2$, can trigger the tachyonic instability of certain modes of the $χ$ field. As a result, the $χ$ field perturbations are amplified and serve as a gravitational wave (GW) source. When considering the backreaction of the $χ$ field, an upper bound on the coupling parameter $ξ$ must be imposed to ensure that inflation does not end prematurely. In this case, we find that the inflaton's evolution experiences a sudden slowdown due to the production of $χ$ particles, resulting in a unique oscillating structure in the power spectrum of curvature perturbations at specific scales. Moreover, the GW signal induced by the $χ$ field is more significant than primordial GWs at around its peak scale, leading to a noticeable bump in the overall energy spectrum of GWs. It's worth noting that this bump predicted in the slow-roll inflationary scenario is unlikely to be detected by LISA and Taiji, but there is a slim chance it might approach the detection limits of GW experiments like BBO and SKA if we devise distinctive inflatonary potentials.

gr-qc↗

arXiv2023

Comprehensive Evaluation of ChatGPT Reliability Through Multilingual Inquiries

ChatGPT is currently the most popular large language model (LLM), with over 100 million users, making a significant impact on people's lives. However, due to the presence of jailbreak vulnerabilities, ChatGPT might have negative effects on people's lives, potentially even facilitating criminal activities. Testing whether ChatGPT can cause jailbreak is crucial because it can enhance ChatGPT's security, reliability, and social responsibility. Inspired by previous research revealing the varied performance of LLMs in different language translations, we suspected that wrapping prompts in multiple languages might lead to ChatGPT jailbreak. To investigate this, we designed a study with a fuzzing testing approach to analyzing ChatGPT's cross-linguistic proficiency. Our study includes three strategies by automatically posing different formats of malicious questions to ChatGPT: (1) each malicious question involving only one language, (2) multilingual malicious questions, (3) specifying that ChatGPT responds in a language different from the prompts. In addition, we also combine our strategies by utilizing prompt injection templates to wrap the three aforementioned types of questions. We examined a total of 7,892 Q&A data points, discovering that multilingual wrapping can indeed lead to ChatGPT's jailbreak, with different wrapping methods having varying effects on jailbreak probability. Prompt injection can amplify the probability of jailbreak caused by multilingual wrapping. This work provides insights for OpenAI developers to enhance ChatGPT's support for language diversity and inclusion.

cs.SE↗

arXiv2023

A Data-driven Region Generation Framework for Spatiotemporal Transportation Service Management

MAUP (modifiable areal unit problem) is a fundamental problem for spatial data management and analysis. As an instantiation of MAUP in online transportation platforms, region generation (i.e., specifying the areal unit for service operations) is the first and vital step for supporting spatiotemporal transportation services such as ride-sharing and freight transport. Most existing region generation methods are manually specified (e.g., fixed-size grids), suffering from poor spatial semantic meaning and inflexibility to meet service operation requirements. In this paper, we propose RegionGen, a data-driven region generation framework that can specify regions with key characteristics (e.g., good spatial semantic meaning and predictability) by modeling region generation as a multi-objective optimization problem. First, to obtain good spatial semantic meaning, RegionGen segments the whole city into atomic spatial elements based on road networks and obstacles (e.g., rivers). Then, it clusters the atomic spatial elements into regions by maximizing various operation characteristics, which is formulated as a multi-objective optimization problem. For this optimization problem, we propose a multi-objective co-optimization algorithm. Extensive experiments verify that RegionGen can generate more suitable regions than traditional methods for spatiotemporal service management.

cs.LG↗

arXiv2023

Revisiting Emission-Line Measurement Methods for Narrow-Line Active Galactic Nuclei

Measuring broad emission-line widths in active galactic nuclei (AGN) is not straightforward owing to the complex nature of flux variability in these systems. Line-width measurements become especially challenging when signal-to-noise is low, profiles are narrower, or spectral resolution is low. We conducted an extensive correlation analysis between emission-line measurements from the optical spectra of Markarian 142 (Mrk 142; a narrow-line Seyfert galaxy) taken with the Gemini North Telescope (Gemini) at a spectral resolution of 185.6+\-10.2 km/s and the Lijiang Telescope (LJT) at 695.2+\-3.9 km/s to investigate the disparities in the measured broad-line widths from both telescope data. Mrk~142 posed a challenge due to its narrow broad-line profiles, which were severely affected by instrumental broadening in the lower-resolution LJT spectra. We discovered that allowing the narrow-line flux of permitted lines having broad and narrow components to vary during spectral fitting caused a leak in the narrow-line flux to the broad component, resulting in broader broad-line widths in the LJT spectra. Fixing the narrow-line flux ratios constrained the flux leak and yielded the Hydrogen-beta broad-line widths from LJT spectra $\sim$54\% closer to the Gemini Hydrogen-beta widths than with flexible narrow-line ratios. The availability of spectra at different resolutions presented this unique opportunity to inspect how spectral resolution affected emission-line profiles in our data and adopt a unique method to accurately measure broad-line widths. Reconsidering line-measurement methods while studying diverse AGN populations is critical for the success of future reverberation-mapping studies. Based on the technique used in this work, we offer recommendations for measuring line widths in narrow-line AGN.

astro-ph.GA↗

arXiv2023

Elliptic inequalities with nonlinear convolution and Hardy terms in cone-like domains

We study the inequality $ -Δu - \fracμ{|x|^2} u \geq (|x|^{-α} * u^p)u^q$ in an unbounded cone $\mathcal{C}_Ω^ρ\subset \mathbb{R}^N$ ($N\geq 2$) generated by a subdomain $Ω$ of the unit sphere $S^{N-1}\subset \mathbb{R}^N,$ $p, q, ρ>0$, $μ\in \mathbb{R}$ and $0\leq α< N$. In the above, $|x|^{-α} * u^p$ denotes the standard convolution operator in the cone $\mathcal{C}_Ω^ρ$. We discuss the existence and nonexistence of positive solutions in terms of $N, p, q, α, μ$ and $Ω$. Extensions to systems of inequalities are also investigated.

math.AP↗

arXiv2022

An Argumentation-Based Legal Reasoning Approach for DL-Ontology

Ontology is a popular method for knowledge representation in different domains, including the legal domain, and description logics (DL) is commonly used as its description language. To handle reasoning based on inconsistent DL-based legal ontologies, the current paper presents a structured argumentation framework particularly for reasoning in legal contexts on the basis of ASPIC+, and translates the legal ontology into formulas and rules of an argumentation theory. With a particular focus on the design of autonomous vehicles from the perspective of legal AI, we show that using this combined theory of formal argumentation and DL-based legal ontology, acceptable assertions can be obtained based on inconsistent ontologies, and the traditional reasoning tasks of DL ontologies can also be accomplished. In addition, a formal definition of explanations for the result of reasoning is presented.

cs.AI↗

arXiv2022

Assessing Expert System-Assisted Literature Reviews With a Case Study

Given the large number of publications in software engineering, frequent literature reviews are required to keep current on work in specific areas. One tedious work in literature reviews is to find relevant studies amongst thousands of non-relevant search results. In theory, expert systems can assist in finding relevant work but those systems have primarily been tested in simulations rather than in application to actual literature reviews. Hence, few researchers have faith in such expert systems. Accordingly, using a realistic case study, this paper assesses how well our state-of-the-art expert system can help with literature reviews. The assessed literature review aimed at identifying test case prioritization techniques for automated UI testing, specifically from 8,349 papers on IEEE Xplore. This corpus was studied with an expert system that incorporates an incrementally updated human-in-the-loop active learning tool. Using that expert system, in three hours, we found 242 relevant papers from which we identified 12 techniques representing the state-of-the-art in test case prioritization when source code information is not available. These results were then validated by six other graduate students manually exploring the same corpus. Without the expert system, this task would have required 53 hours and would have found 27 additional papers. That is, our expert system achieved 90% recall with 6% of the human effort cost when compared to a conventional manual method. Significantly, the same 12 state-of-the-art test case prioritization techniques were identified by both the expert system and the manual method. That is, the 27 papers missed by the expert system would not have changed the conclusion of the literature review. Hence, if this result generalizes, it endorses the use of our expert system to assist in literature reviews.

cs.SE↗

arXiv2021

On the Documentation of Refactoring Types

Commit messages are the atomic level of software documentation. They provide a natural language description of the code change and its purpose. Messages are critical for software maintenance and program comprehension. Unlike documenting feature updates and bug fixes, little is known about how developers document their refactoring activities. Developers can perform multiple refactoring operations, including moving methods, extracting classes, for various reasons. Yet, there is no systematic study that analyzes the extent to which the documentation of refactoring accurately describes the refactoring operations performed at the source code level. Therefore, this paper challenges the ability of refactoring documentation to adequately predict the refactoring types, performed at the commit level. Our analysis relies on the text mining of commit messages to extract the corresponding features that better represent each class. The extraction of text patterns, specific to each refactoring allows the design of a model that verifies the consistency of these patterns with their corresponding refactoring. Such verification process can be achieved via automatically predicting the method-level type of refactoring being applied, namely Extract Method, Inline Method, Move Method, Pull-up Method, Push-down Method, and Rename Method. We compared various classifiers, and a baseline keyword-based approach, in terms of their prediction performance, using a dataset of 5,004 commits. Our main findings show that the complexity of refactoring type prediction varies from one type to another. Rename method and Extract method were found to be the best documented refactoring activities, while Pull-up Method and Push-down Method were the hardest to be identified via textual descriptions. Such findings bring the attention of developers to the necessity of paying more attention to the documentation of these types.

cs.SE↗

arXiv2021

Reverberation Mapping of Two Luminous Quasars: the Broad-line Region Structure and Black Hole Mass

We report the results of a multi-year spectroscopic and photometric monitoring campaign of two luminous quasars, PG~0923+201 and PG~1001+291, both located at the high-luminosity end of the broad-line region (BLR) size-luminosity relation with optical luminosities above $10^{45}~{\rm erg~s^{-1}}$. PG~0923+201 is for the first time monitored, and PG~1001+291 was previously monitored but our campaign has a much longer temporal baseline. We detect time lags of variations of the broad H$β$, H$γ$, Fe {\sc ii} lines with respect to those of the 5100~Å continuum. The velocity-resolved delay map of H$β$ in PG~0923+201 indicates a complicated structure with a mix of Keplerian disk-like motion and outflow, and the map of H$β$ in PG~1001+291 shows a signature of Keplerian disk-like motion. Assuming a virial factor of $f_{\rm BLR}=1$ and FWHM line widths, we measure the black hole mass to be $118_{-16}^{+11}\times 10^7 M_{\odot}$ for PG~0923+201 and $3.33_{-0.54}^{+0.62}\times 10^7 M_{\odot}$ for PG~1001+291. Their respective accretion rates are estimated to be $0.21_{-0.07}^{+0.06} \times L_{\rm Edd}\,c^{-2}$ and $679_{-227}^{+259}\times L_{\rm Edd}\,c^{-2}$, indicating that PG~0923+201 is a sub-Eddington accretor and PG~1001+291 is a super-Eddington accretor. While the H$β$ time lag of PG~0923+201 agrees with the size-luminosity relation, the time lag of PG~1001+291 shows a significant deviation, confirming that in high-luminosity AGN the BLR size depends on both luminosity and Eddington ratio. Black hole mass estimates from single AGN spectra will be over-estimated at high luminosities and redshifts if this effect is not taken into account.

astro-ph.GA↗

arXiv2021

Learning to Recognize Actionable Static Code Warnings (is Intrinsically Easy)

Static code warning tools often generate warnings that programmers ignore. Such tools can be made more useful via data mining algorithms that select the "actionable" warnings; i.e. the warnings that are usually not ignored. In this paper, we look for actionable warnings within a sample of 5,675 actionable warnings seen in 31,058 static code warnings from FindBugs. We find that data mining algorithms can find actionable warnings with remarkable ease. Specifically, a range of data mining methods (deep learners, random forests, decision tree learners, and support vector machines) all achieved very good results (recalls and AUC (TRN, TPR) measures usually over 95% and false alarms usually under 5%). Given that all these learners succeeded so easily, it is appropriate to ask if there is something about this task that is inherently easy. We report that while our data sets have up to 58 raw features, those features can be approximated by less than two underlying dimensions. For such intrinsically simple data, many different kinds of learners can generate useful models with similar performance. Based on the above, we conclude that learning to recognize actionable static code warnings is easy, using a wide range of learning algorithms, since the underlying data is intrinsically simple. If we had to pick one particular learner for this task, we would suggest linear SVMs (since, at least in our sample, that learner ran relatively quickly and achieved the best median performance) and we would not recommend deep learning (since this data is intrinsically very simple).

cs.SE↗

arXiv2020

Understanding Static Code Warnings: an Incremental AI Approach

Knowledge-based systems reason over some knowledge base. Hence, an important issue for such systems is how to acquire the knowledge needed for their inference. This paper assesses active learning methods for acquiring knowledge for "static code warnings". Static code analysis is a widely-used method for detecting bugs and security vulnerabilities in software systems. As software becomes more complex, analysis tools also report lists of increasingly complex warnings that developers need to address on a daily basis. Such static code analysis tools are usually over-cautious; i.e. they often offer many warnings about spurious issues. Previous research work shows that about 35% to 91% of warnings reported as bugs by SA tools are actually unactionable (i.e., warnings that would not be acted on by developers because they are falsely suggested as bugs). Experienced developers know which errors are important and which can be safely ignored. How can we capture that experience? This paper reports on an incremental AI tool that watches humans reading false alarm reports. Using an incremental support vector machine mechanism, this AI tool can quickly learn to distinguish spurious false alarms from more serious matters that deserve further attention. In this work, nine open-source projects are employed to evaluate our proposed model on the features extracted by previous researchers and identify the actionable warnings in a priority order given by our algorithm. We observe that our model can identify over 90% of actionable warnings when our methods tell humans to ignore 70 to 80% of the warnings.

cs.SE↗

arXiv2020

Evidence for Two Distinct Broad-Line Regions from Reverberation Mapping of PG 0026+129

We report on the results of a new spectroscopic monitoring campaign of the quasar PG 0026+129 at the Calar Alto Observatory 2.2m telescope from July 2017 to February 2020. Significant variations in the fluxes of the continuum and broad-emission lines, including H$β$ and He II, were observed in the first and third years, and clear time lags between them are measured. The broad H$β$ line profile consists of two Gaussian components: an intermediate-width H$β_{\rm IC}$ with a full width at half-maximum (FWHM) of 1964$\pm$18 $\rm km~s^{-1}$ and another very broad H$β_{\rm VBC}$ with a FWHM of 7570$\pm$83 $\rm km~s^{-1}$. H$β_{\rm IC}$ has long time lags of $\sim$40--60 days in the rest frame, while H$β_{\rm VBC}$ shows nearly zero time delay with respect to the optical continuum at 5100 Å. The velocity-resolved delays show consistent results: lags of $\sim$30--50 days at the core of the broad H$β$ line and roughly zero lags at the wings. H$β_{\rm IC}$ has a redshift of $\sim$400 $\rm km~s^{-1}$ which seems to be stable for nearly 30 years by comparing with archived spectra, and may originate from an infall. The root mean square (rms) spectrum of H$β_{\rm VBC}$ shows a double-peaked profile with brighter blue peak and extended red wing in the first year, which matches the signature of a thin disk. Both the double-peaked profile and the near-zero lag suggest that H$β_{\rm VBC}$ comes from a region associated with the part of the accretion disc that emits the optical continuum. Adopting the FWHM (in the rms spectrum) and the time lag measured for the total H$β$ line, and a virial factor of 1.5, we obtain a virial mass of $2.89_{-0.69}^{+0.60} \times10^7 M_{\odot}$ for the central black hole in this quasar.

astro-ph.GA↗

arXiv2020

Identifying Self-Admitted Technical Debts with Jitterbug: A Two-step Approach

Keeping track of and managing Self-Admitted Technical Debts (SATDs) are important to maintaining a healthy software project. This requires much time and effort from human experts to identify the SATDs manually. The current automated solutions do not have satisfactory precision and recall in identifying SATDs to fully automate the process. To solve the above problems, we propose a two-step framework called Jitterbug for identifying SATDs. Jitterbug first identifies the "easy to find" SATDs automatically with close to 100% precision using a novel pattern recognition technique. Subsequently, machine learning techniques are applied to assist human experts in manually identifying the remaining "hard to find" SATDs with reduced human effort. Our simulation studies on ten software projects show that Jitterbug can identify SATDs more efficiently (with less human effort) than the prior state-of-the-art methods.

cs.SE↗

arXiv2020

Fairway: A Way to Build Fair ML Software

Machine learning software is increasingly being used to make decisions that affect people's lives. But sometimes, the core part of this software (the learned model), behaves in a biased manner that gives undue advantages to a specific group of people (where those groups are determined by sex, race, etc.). This "algorithmic discrimination" in the AI software systems has become a matter of serious concern in the machine learning and software engineering community. There have been works done to find "algorithmic bias" or "ethical bias" in the software system. Once the bias is detected in the AI software system, the mitigation of bias is extremely important. In this work, we a)explain how ground-truth bias in training data affects machine learning model fairness and how to find that bias in AI software,b)propose a methodFairwaywhich combines pre-processing and in-processing approach to remove ethical bias from training data and trained model. Our results show that we can find bias and mitigate bias in a learned model, without much damaging the predictive performance of that model. We propose that (1) test-ing for bias and (2) bias mitigation should be a routine part of the machine learning software development life cycle. Fairway offers much support for these two purposes.

cs.SE↗

arXiv2020

A General-Purpose Dehazing Algorithm based on Local Contrast Enhancement Approaches

Dehazing is in the image processing and computer vision communities, the task of enhancing the image taken in foggy conditions. To better understand this type of algorithm, we present in this document a dehazing method which is suitable for several local contrast adjustment algorithms. We base it on two filters. The first filter is built with a step of normalization with some other statistical tricks while the last represents the local contrast improvement algorithm. Thus, it can work on both CPU and GPU for real-time applications. We hope that our approach will open the door to new ideas in the community. Other advantages of our method are first that it does not need to be trained, then it does not need additional optimization processing. Furthermore, it can be used as a pre-treatment or post-processing step in many vision tasks. In addition, it does not need to convert the problem into a physical interpretation, and finally that it is very fast. This family of defogging algorithms is fairly simple, but it shows promising results compared to state-of-the-art algorithms based not only on a visual assessment but also on objective criteria.

cs.CV↗

arXiv2020

NTIRE 2020 Challenge on NonHomogeneous Dehazing

This paper reviews the NTIRE 2020 Challenge on NonHomogeneous Dehazing of images (restoration of rich details in hazy image). We focus on the proposed solutions and their results evaluated on NH-Haze, a novel dataset consisting of 55 pairs of real haze free and nonhomogeneous hazy images recorded outdoor. NH-Haze is the first realistic nonhomogeneous haze dataset that provides ground truth images. The nonhomogeneous haze has been produced using a professional haze generator that imitates the real conditions of haze scenes. 168 participants registered in the challenge and 27 teams competed in the final testing phase. The proposed solutions gauge the state-of-the-art in image dehazing.

cs.CV↗

arXiv2020

Time Series Classification for Locating Forced Oscillation Sources

Forced oscillations are caused by sustained cyclic disturbances. This paper presents a machine learning (ML) based time-series classification method that uses the synchrophasor measurements to locate the sources of forced oscillations for fast disturbance removal. Sequential feature selection is used to identify the most informative measurements of each power plant so that multivariate time series (MTS) can be constructed. By training the Mahalanobis matrix, we measure and compare the distance between the MTSs. Templates for representing each class is constructed to reduce the size of training datasets and improve the online matching efficiency. Dynamic time warping (DTW) algorithm is used to align the out-of-sync MTSs to account for oscillation detection errors. The algorithm is validated on two test systems: the IEEE 39-bus system and the WECC 179-bus system. When a forced oscillation occurs, MTSs will be constructed by designated PMU measurements. Then, the MTSs will be classified by the trained classifiers, the class membership of which corresponds to the location of each oscillation source. Simulation results show that the proposed method can be used online to identify the forced oscillation sources with high accuracy. The robustness of the proposed algorithm in the presence of oscillation detection errors is also quantified.

eess.SY↗

arXiv2020

Better Data Labelling with EMBLEM (and how that Impacts Defect Prediction)

Standard automatic methods for recognizing problematic development commits can be greatly improved via the incremental application of human+artificial expertise. In this approach, called EMBLEM, an AI tool first explore the software development process to label commits that are most problematic. Humans then apply their expertise to check those labels (perhaps resulting in the AI updating the support vectors within their SVM learner). We recommend this human+AI partnership, for several reasons. When a new domain is encountered, EMBLEM can learn better ways to label which comments refer to real problems. Also, in studies with 9 open source software projects, labelling via EMBLEM's incremental application of human+AI is at least an order of magnitude cheaper than existing methods ($\approx$ eight times). Further, EMBLEM is very effective. For the data sets explored here, EMBLEM better labelling methods significantly improved $P_{opt}20$ and G-scores performance in nearly all the projects studied here.

cs.SE↗