Q
Qiang Yang
Researcher at Hong Kong University of Science and Technology
Publications - 1795
Citations - 96705
Qiang Yang is an academic researcher from Hong Kong University of Science and Technology. The author has contributed to research in topics: Computer science & Medicine. The author has an hindex of 112, co-authored 1117 publications receiving 71540 citations. Previous affiliations of Qiang Yang include University of London & Zhejiang University of Technology.
Papers
More filters
Journal ArticleDOI
Substrate-Switched Chemodivergent Pyrazole and Pyrazoline Synthesis: [3 + 2] Cycloaddition/Ring-Opening Rearrangement Reaction of Azadienes with Nitrile Imines.
TL;DR: In this paper , a new reaction model of benzofuran-derived azadienes (BDAs) was proposed to synthesize biologically important pyrazoles through a tandem [3 + 2] cycloaddition/ring-opening rearrangement reaction of BDAs with nitrile imines.
Journal ArticleDOI
Towards carbon neutrality by improving carbon efficiency - A system-GMM dynamic panel analysis for 131 countries’ carbon efficiency
TL;DR: In this paper , a dynamic panel data analysis with generalized method of moments (GMM) estimation was developed to investigate the effects of industrialization, and renewable energy on carbon emission efficiency, to uncover the interactive and influence channels among these influencing factors using 131 countries' panel data.
Proceedings ArticleDOI
ICT systems for managing medium voltage active distribution grids
Qiang Yang,Javier A. Barria +1 more
TL;DR: In this article, the authors present ICT system proposals for two example distribution grids with distinct structures (meshed and radial) and different voltage levels (33kV and 11kV), respectively.
Proceedings ArticleDOI
Ant colony optimization with shortest distance biased dispatch for visiting constrained multiple traveling salesmen problem
TL;DR: A shortest distance biased dispatch (SDBD) scheme based on the accessibility of cities and a pheromone diffusion strategy for ant colony optimization (ACO) to construct feasible solutions for the visiting constrained multiple traveling salesmen problem is proposed.
Journal ArticleDOI
Relating the performance of partial-order planning algorithms to domain features
Craig A. Knoblock,Qiang Yang +1 more
TL;DR: This paper shows, by directly comparing the above three planners, that the quest for an overall winner is doomed to fail, and suggests that the most appropriate algorithm will depend on the types of problems to be solved by the planner.