Searcharxiv⌕ Search

arXiv subjects

Yu Jiang

Publications and source records attributed to Yu Jiang.

At least 163 records · Page 9Linked to original sources

Robust Bayesian variable selection for gene-environment interactions

Gene-environment (G$\times$E) interactions have important implications to elucidate the etiology of complex diseases beyond the main genetic and environmental effects. Outliers and data contamination in disease phenotypes of G$\times$E studies have been commonly encountered, leading to the development of a broad spectrum of robust regularization methods. Nevertheless, within the Bayesian framework, the issue has not been taken care of in existing studies. We develop a fully Bayesian robust variable selection method for G$\times$E interaction studies. The proposed Bayesian method can effectively accommodate heavy-tailed errors and outliers in the response variable while conducting variable selection by accounting for structural sparsity. In particular, for the robust sparse group selection, the spike-and-slab priors have been imposed on both individual and group levels to identify important main and interaction effects robustly. An efficient Gibbs sampler has been developed to facilitate fast computation. Extensive simulation studies and analysis of both the diabetes data with SNP measurements from the Nurses' Health Study and TCGA melanoma data with gene expression measurements demonstrate the superior performance of the proposed method over multiple competing alternatives.

stat.ME↗

Joint Optimization of Transfer Location and Capacity in a Multimodal Transport Network: Bilevel Modeling and Paradoxes

With the growing attention towards developing the multimodal transport system to enhance urban mobility, there is an increasing need to construct new, rebuild or expand existing infrastructure to facilitate existing and accommodate newly generated travel demand. Therefore, this paper develops a bilevel model to simultaneously determine the location and capacity of the transfer infrastructure to be built considering elastic demand in a multimodal transport network. The upper level problem is formulated as a mixed integer linear programming problem, while the lower level problem is the capacitated combined trip distribution assignment model that depicts both destination and route choices of travelers via the multinomial logit formula. To solve the model, the paper develops a matheuristics algorithm that integrates a Genetic Algorithm and a successive linear programming solution approach. Numerical studies are conducted to demonstrate the existence and examine two Braess like paradox phenomena in a multimodal transport network. The first one states that under fixed demand constructing parking spaces to stimulate the usage of Park and Ride service could deteriorate the system performance, measured by the total passengers travel time, while the second one reveals that under variable demand increasing the parking capacity for the Park and Ride services to promote the usages may fail, represented by the decline in its modal share. Meanwhile, the last experiment suggests that constructing transfer infrastructures at distributed stations outperforms building a large transfer center in terms of attracting travelers using sustainable transit modes.

math.OC↗

Equitable Transit Network Design Under Uncertainty

This paper proposes a bilevel transit network design problem considering supply side uncertainty. The upper level problem determines frequency settings to simultaneously maximize the efficiency and equity measures, which are defined by the reduction in the total effective travel cost and the minimum reduction in the effective travel cost of all OD pairs, respectively. The lower level problem is the reliability based transit assignment problem that captures the effects of supply-side uncertainty on passengers route choice behavior.Numerical studies demonstrate that 1) the Pareto frontier may not be convex; 2) it is possible to improve the efficiency and equity objectives simultaneously; 3) increasing the frequency could worsen the equity measure; 4) passengers risk attitude affects the rate of substitution between the two objectives.

physics.soc-ph↗

Prediction and analysis of Coronavirus Disease 2019

In December 2019, a novel coronavirus was found in a seafood wholesale market in Wuhan, China. WHO officially named this coronavirus as COVID-19. Since the first patient was hospitalized on December 12, 2019, China has reported a total of 78,824 confirmed CONID-19 cases and 2,788 deaths as of February 28, 2020. Wuhan's cumulative confirmed cases and deaths accounted for 61.1% and 76.5% of the whole China mainland , making it the priority center for epidemic prevention and control. Meanwhile, 51 countries and regions outside China have reported 4,879 confirmed cases and 79 deaths as of February 28, 2020. COVID-19 epidemic does great harm to people's daily life and country's economic development. This paper adopts three kinds of mathematical models, i.e., Logistic model, Bertalanffy model and Gompertz model. The epidemic trends of SARS were first fitted and analyzed in order to prove the validity of the existing mathematical models. The results were then used to fit and analyze the situation of COVID-19. The prediction results of three different mathematical models are different for different parameters and in different regions. In general, the fitting effect of Logistic model may be the best among the three models studied in this paper, while the fitting effect of Gompertz model may be better than Bertalanffy model. According to the current trend, based on the three models, the total number of people expected to be infected is 49852-57447 in Wuhan,12972-13405 in non-Hubei areas and 80261-85140 in China respectively. The total death toll is 2502-5108 in Wuhan, 107-125 in Non-Hubei areas and 3150-6286 in China respetively. COVID-19 will be over p robably in late-April, 2020 in Wuhan and before late-March, 2020 in other areas respectively.

q-bio.PE↗

A Time Delay Dynamical Model for Outbreak of 2019-nCoV and the Parameter Identification

In this paper, we propose a novel dynamical system with time delay to describe the outbreak of 2019-nCoV in China. One typical feature of this epidemic is that it can spread in latent period, which is therefore described by the time delay process in the differential equations. The accumulated numbers of classified populations are employed as variables, which is consistent with the official data and facilitates the parameter identification. The numerical methods for the prediction of outbreak of 2019-nCoV and parameter identification are provided, and the numerical results show that the novel dynamic system can well predict the outbreak trend so far. Based on the numerical simulations, we suggest that the transmission of individuals should be greatly controlled with high isolation rate by the government.

q-bio.PE↗

A Time Delay Dynamic System with External Source for the Local Outbreak of 2019-nCoV

How to model the 2019 CoronaVirus (2019-nCov) spread in China is one of the most urgent and interesting problems in applied mathematics. In this paper, we propose a novel time delay dynamic system with external source to describe the trend of local outbreak for the 2019-nCoV. The external source is introduced in the newly proposed dynamic system, which can be considered as the suspected people travel to different areas. The numerical simulations exhibit the dynamic system with the external source is more reliable than the one without it, and the rate of isolation is extremely important for controlling the increase of cumulative confirmed people of 2019-nCoV. Based on our numerical simulation results with the public data, we suggest that the local government should have some more strict measures to maintain the rate of isolation. Otherwise the local cumulative confirmed people of 2019-nCoV might be out of control.

physics.soc-ph↗

End-to-End Vision-Based Adaptive Cruise Control (ACC) Using Deep Reinforcement Learning

This paper presented a deep reinforcement learning method named Double Deep Q-networks to design an end-to-end vision-based adaptive cruise control (ACC) system. A simulation environment of a highway scene was set up in Unity, which is a game engine that provided both physical models of vehicles and feature data for training and testing. Well-designed reward functions associated with the following distance and throttle/brake force were implemented in the reinforcement learning model for both internal combustion engine (ICE) vehicles and electric vehicles (EV) to perform adaptive cruise control. The gap statistics and total energy consumption are evaluated for different vehicle types to explore the relationship between reward functions and powertrain characteristics. Compared with the traditional radar-based ACC systems or human-in-the-loop simulation, the proposed vision-based ACC system can generate either a better gap regulated trajectory or a smoother speed trajectory depending on the preset reward function. The proposed system can be well adaptive to different speed trajectories of the preceding vehicle and operated in real-time.

cs.CV↗

LEOPARD: Identifying Vulnerable Code for Vulnerability Assessment through Program Metrics

Identifying potentially vulnerable locations in a code base is critical as a pre-step for effective vulnerability assessment; i.e., it can greatly help security experts put their time and effort to where it is needed most. Metric-based and pattern-based methods have been presented for identifying vulnerable code. The former relies on machine learning and cannot work well due to the severe imbalance between non-vulnerable and vulnerable code or lack of features to characterize vulnerabilities. The latter needs the prior knowledge of known vulnerabilities and can only identify similar but not new types of vulnerabilities. In this paper, we propose and implement a generic, lightweight and extensible framework, LEOPARD, to identify potentially vulnerable functions through program metrics. LEOPARD requires no prior knowledge about known vulnerabilities. It has two steps by combining two sets of systematically derived metrics. First, it uses complexity metrics to group the functions in a target application into a set of bins. Then, it uses vulnerability metrics to rank the functions in each bin and identifies the top ones as potentially vulnerable. Our experimental results on 11 real-world projects have demonstrated that, LEOPARD can cover 74.0% of vulnerable functions by identifying 20% of functions as vulnerable and outperform machine learning-based and static analysis-based techniques. We further propose three applications of LEOPARD for manual code review and fuzzing, through which we discovered 22 new bugs in real applications like PHP, radare2 and FFmpeg, and eight of them are new vulnerabilities.

cs.SE↗

On the symmetric and exterior powers of Young permutation modules

Let $n$ be a positive integer and $λ$ be a partition of $n$. Let $M^λ$ be the Young permutation module labelled by $λ$. In this paper, we study symmetric and exterior powers of $M^λ$ in positive characteristic case. We determine the symmetric and exterior powers of $M^λ$ that are projective. All the indecomposable exterior powers of $M^λ$ are also classified. We then prove some results for indecomposable direct summands that have the largest complexity in direct sum decompositions of some symmetric and exterior powers of $M^λ$. We end by parameterizing all the Scott modules that are isomorphic to direct summands of the symmetric or exterior square of $M^λ$ and determining their corresponding multiplicities explicitly.

math.RT↗

Semi-parametric Bayesian variable selection for gene-environment interactions

Many complex diseases are known to be affected by the interactions between genetic variants and environmental exposures beyond the main genetic and environmental effects. Study of gene-environment (G$\times$E) interactions is important for elucidating the disease etiology. Existing Bayesian methods for G$\times$E interaction studies are challenged by the high-dimensional nature of the study and the complexity of environmental influences. Many studies have shown the advantages of penalization methods in detecting G$\times$E interactions in "large p, small n" settings. However, Bayesian variable selection, which can provide fresh insight into G$\times$E study, has not been widely examined. We propose a novel and powerful semi-parametric Bayesian variable selection model that can investigate linear and nonlinear G$\times$E interactions simultaneously. Furthermore, the proposed method can conduct structural identification by distinguishing nonlinear interactions from main-effects-only case within the Bayesian framework. Spike and slab priors are incorporated on both individual and group levels to identify the sparse main and interaction effects. The proposed method conducts Bayesian variable selection more efficiently than existing methods. Simulation shows that the proposed model outperforms competing alternatives in terms of both identification and prediction. The proposed Bayesian method leads to the identification of main and interaction effects with important implications in a high-throughput profiling study with high-dimensional SNP data.

stat.ME↗

A hybrid inversion scheme combining Markov chain Monte Carlo and iterative methods for determining optical properties of random media

Near-infrared spectroscopy (NIRS) including diffuse optical tomography is an imaging modality which makes use of diffuse light propagation in random media. When optical properties of a random medium is investigated from boundary measurements of reflected or transmitted light, iterative inversion schemes such as the Levenberg-Marquardt algorithm are known to fail when initial guesses are not close to the true value of the coefficient to be reconstructed. In this paper, we investigate how this weakness of iterative schemes is overcome by the use of Markov chain Monte Carlo. Using time-resolved measurements performed against a polyurethane-based phantom, we present a case that the Levenberg-Marquardt algorithm fails to work but the proposed hybrid method works well. Then with a toy model of diffuse optical tomography we illustrate that the evenberg-Marquardt method fails when it is trapped by a local minimum but the hybrid method can escape from local minima by using the Metropolis-Hastings Markov chain Monte Carlo algorithm until it reaches the valley of the global minimum. The proposed hybrid scheme can be applied to different inverse problems in NIRS which are solved iteratively. We find that for both numerical and phantom experiments optical properties such as the absorption and reduced scattering coefficients can be retrieved without being trapped by a local minimum when Monte Carlo simulation is run only about $100$ steps before switching to an iterative method. The hybrid method is compared with simulated annealing. Although the Metropolis-Hastings MCMC arrives at the steady state at about $10000$ Monte Carlo steps, in the hybrid method the Monte Carlo simulation can be stopped way before the burn-in time.

physics.comp-ph↗

Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty

Piecewise Barrier Tubes (PBT) is a new technique for flowpipe overapproximation for nonlinear systems with polynomial dynamics, which leverages a combination of barrier certificates. PBT has advantages over traditional time-step based methods in dealing with those nonlinear dynamical systems in which there is a large difference in speed between trajectories, producing an overapproximation that is time independent. However, the existing approach for PBT is not efficient due to the application of interval methods for enclosure-box computation, and it can only deal with continuous dynamical systems without uncertainty. In this paper, we extend the approach with the ability to handle both continuous and hybrid dynamical systems with uncertainty that can reside in parameters and/or noise. We also improve the efficiency of the method significantly, by avoiding the use of interval-based methods for the enclosure-box computation without loosing soundness. We have developed a C++ prototype implementing the proposed approach and we evaluate it on several benchmarks. The experiments show that our approach is more efficient and precise than other methods in the literature.

eess.SY↗

Online Predictive Optimization Framework for Stochastic Demand-Responsive Transit Services

This study develops an online predictive optimization framework for dynamically operating a transit service in an area of crowd movements. The proposed framework integrates demand prediction and supply optimization to periodically redesign the service routes based on recently observed demand. To predict demand for the service, we use Quantile Regression to estimate the marginal distribution of movement counts between each pair of serviced locations. The framework then combines these marginals into a joint demand distribution by constructing a Gaussian copula, which captures the structure of correlation between the marginals. For supply optimization, we devise a linear programming model, which simultaneously determines the route structure and the service frequency according to the predicted demand. Importantly, our framework both preserves the uncertainty structure of future demand and leverages this for robust route optimization, while keeping both components decoupled. We evaluate our framework using a real-world case study of autonomous mobility in a university campus in Denmark. The results show that our framework often obtains the ground truth optimal solution, and can outperform conventional methods for route optimization, which do not leverage full predictive distributions.

stat.ML↗

Towards VQA Models That Can Read

Studies have shown that a dominant class of questions asked by visually impaired users on images of their surroundings involves reading text in the image. But today's VQA models can not read! Our paper takes a first step towards addressing this problem. First, we introduce a new "TextVQA" dataset to facilitate progress on this important problem. Existing datasets either have a small proportion of questions about text (e.g., the VQA dataset) or are too small (e.g., the VizWiz dataset). TextVQA contains 45,336 questions on 28,408 images that require reasoning about text to answer. Second, we introduce a novel model architecture that reads text in the image, reasons about it in the context of the image and the question, and predicts an answer which might be a deduction based on the text and the image or composed of the strings found in the image. Consequently, we call our approach Look, Read, Reason & Answer (LoRRA). We show that LoRRA outperforms existing state-of-the-art VQA models on our TextVQA dataset. We find that the gap between human performance and machine performance is significantly larger on TextVQA than on VQA 2.0, suggesting that TextVQA is well-suited to benchmark progress along directions complementary to VQA 2.0.

cs.CL↗

EnFuzz: Ensemble Fuzzing with Seed Synchronization among Diverse Fuzzers

Fuzzing is widely used for software vulnerability detection. There are various kinds of fuzzers with different fuzzing strategies, and most of them perform well on their targets. However, in industry practice and empirical study, the performance and generalization ability of those well-designed fuzzing strategies are challenged by the complexity and diversity of real-world applications. In this paper, inspired by the idea of ensemble learning, we first propose an ensemble fuzzing approach EnFuzz, that integrates multiple fuzzing strategies to obtain better performance and generalization ability than that of any constituent fuzzer alone. First, we define the diversity of the base fuzzers and choose those most recent and well-designed fuzzers as base fuzzers. Then, EnFuzz ensembles those base fuzzers with seed synchronization and result integration mechanisms. For evaluation, we implement EnFuzz , a prototype basing on four strong open-source fuzzers (AFL, AFLFast, AFLGo, FairFuzz), and test them on Google's fuzzing test suite, which consists of widely used real-world applications. The 24-hour experiment indicates that, with the same resources usage, these four base fuzzers perform variously on different applications, while EnFuzz shows better generalization ability and always outperforms others in terms of path coverage, branch coverage and crash discovery. Even compared with the best cases of AFL, AFLFast, AFLGo and FairFuzz, EnFuzz discovers 26.8%, 117%, 38.8% and 39.5% more unique crashes, executes 9.16%, 39.2%, 19.9% and 20.0% more paths and covers 5.96%, 12.0%, 21.4% and 11.1% more branches respectively.

cs.SE↗

EVMFuzz: Differential Fuzz Testing of Ethereum Virtual Machine

Ethereum Virtual Machine (EVM) is the run-time environment for smart contracts and its vulnerabilities may lead to serious problems to the Ethereum ecology. With lots of techniques being developed for the validation of smart contracts, the security problems of EVM have not been well-studied. In this paper, we propose EVMFuzz, aiming to detect vulnerabilities of EVMs with differential fuzz testing. The core idea of EVMFuzz is to continuously generate seed contracts for different EVMs' execution, so as to find as many inconsistencies among execution results as possible, eventually discover vulnerabilities with output cross-referencing. First, we present the evaluation metric for the internal inconsistency indicator, such as the opcode sequence executed and gas used. Then, we construct seed contracts via a set of predefined mutators and employ dynamic priority scheduling algorithm to guide seed contracts selection and maximize the inconsistency. Finally, we leverage different EVMs as crossreferencing oracles to avoid manual checking of the execution output. For evaluation, we conducted large-scale mutation on 36,295 real-world smart contracts and generated 253,153 smart contracts. Among them, 66.2% showed differential performance, including 1,596 variant contracts triggered inconsistent output among EVMs. Accompanied by manual root cause analysis, we found 5 previously unknown security bugs in four widely used EVMs, and all had been included in Common Vulnerabilities and Exposures (CVE) database.

cs.SE↗

QuanFuzz: Fuzz Testing of Quantum Program

Nowadays, quantum program is widely used and quickly developed. However, the absence of testing methodology restricts their quality. Different input format and operator from traditional program make this issue hard to resolve. In this paper, we present QuanFuzz, a search-based test input generator for quantum program. We define the quantum sensitive information to evaluate test input for quantum program and use matrix generator to generate test cases with higher coverage. First, we extract quantum sensitive information -- measurement operations on those quantum registers and the sensitive branches associated with those measurement results, from the quantum source code. Then, we use the sensitive information guided algorithm to mutate the initial input matrix and select those matrices which improve the probability weight for a value of the quantum register to trigger the sensitive branch. The process keeps iterating until the sensitive branch triggered. We tested QuanFuzz on benchmarks and acquired 20% - 60% more coverage compared to traditional testing input generation.

cs.SE↗