Zun-Jing Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zun-Jing Wang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Xiao-Feng Xie
Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong
7 shared publications - Daan Frenkel
Yusuf Hamied Department of Chemistry, University of Cambridge , Lensfield Road, Cambridge CB2 1EW
4 shared publications - Markus Deserno
Carnegie Mellon University
4 shared publications - Chantal Valeriani
Universidad Complutense de Madrid
2 shared publications Chen Min
Department of Engineering Mechanics, Tsinghua University, Beijing 100084
1 shared publication- Chun Yang
School of Mechanical and Aerospace Engineering Nanyang Technological University Singapore Singapore
1 shared publication
Latest Publications
- Open Access
Uncovering Urban Mobility and City Dynamics from Large-Scale Taxi Origin-Destination (O-D) Trips: Case Study in Washington DC Area
We perform a systematic analysis on the large-scale taxi trip data to uncover urban mobility and city dynamics in multimodal urban transportation environments. As a case study, we use the taxi origin-destination trip data and some additional data sources in Washington DC area. We first study basic characteristics of taxi trips, then focus on five important aspects. Three of them concern urban mobility, which are respectively mobility and cost including effect of traffic congestion, trip safety, and multimodal connectivity; the other two pertain to city dynamics, which are respectively transportation resilience and the relation between trip patterns and land use. For these aspects, we use appropriate statistical methods and geographic techniques to mine patterns and characteristics from taxi trip data for better understanding qualitative and quantitative impacts of the inputs from key stakeholders on available measures of effectiveness on urban mobility and city dynamics, where key stakeholders include road users, system operators, and city. Finally, we briefly summarize our findings and discuss some critical roles and implications of the uncovered patterns and characteristics from the relation between taxi system and key stakeholders. The results can support road users by providing evidence-based information of trip cost, mobility, safety, multimodal connectivity and transportation resilience, can assist taxi drivers and operators to deliver transportation services in a higher quality of mobility, safety and operational efficiency, and can also help city planners and policy makers to transform multimodal transportation and to manage urban resources in a more effective and better way.
Open AccessUncovering Urban Mobility and City Dynamics from Large-Scale Taxi Origin-Destination (O-D) Trips: Case Study in Washington DC Area
We perform a systematic analysis on the large-scale taxi trip data to uncover urban mobility and city dynamics in multimodal urban transportation environments. As a case study, we use the taxi origin-destination trip data and some additional data sources in Washington DC area. We first study basic characteristics of taxi trips, then focus on five important aspects. Three of them concern urban mobility, which are respectively mobility and cost including effect of traffic congestion, trip safety, and multimodal connectivity; the other two pertain to city dynamics, which are respectively transportation resilience and the relation between trip patterns and land use. For these aspects, we use appropriate statistical methods and geographic techniques to mine patterns and characteristics from taxi trip data for better understanding qualitative and quantitative impacts of the inputs from key stakeholders on available measures of effectiveness on urban mobility and city dynamics, where key stakeholders include road users, system operators, and city. Finally, we briefly summarize our findings and discuss some critical roles and implications of the uncovered patterns and characteristics from the relation between taxi system and key stakeholders. The results can support road users by providing evidence-based information of trip cost, mobility, safety, multimodal connectivity and transportation resilience, can assist taxi drivers and operators to deliver transportation services in a higher quality of mobility, safety and operational efficiency, and can also help city planners and policy makers to transform multimodal transportation and to manage urban resources in a more effective and better way.
- Open Access
Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application
In this paper, we present a method using AI techniques to solve a case of pure mathematics applications for finding narrow admissible tuples. The original problem is formulated into a combinatorial optimization problem. In particular, we show how to exploit the local search structure to formulate the problem landscape for dramatic reductions in search space and for non-trivial elimination in search barriers, and then to realize intelligent search strategies for effectively escaping from local minima. Experimental results demonstrate that the proposed method is able to efficiently find best known solutions. This research sheds light on exploiting the local problem structure for an efficient search in combinatorial landscapes as an application of AI to a new problem domain.
Open AccessExploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application
In this paper, we present a method using AI techniques to solve a case of pure mathematics applications for finding narrow admissible tuples. The original problem is formulated into a combinatorial optimization problem. In particular, we show how to exploit the local search structure to formulate the problem landscape for dramatic reductions in search space and for non-trivial elimination in search barriers, and then to realize intelligent search strategies for effectively escaping from local minima. Experimental results demonstrate that the proposed method is able to efficiently find best known solutions. This research sheds light on exploiting the local problem structure for an efficient search in combinatorial landscapes as an application of AI to a new problem domain.
- 22 October 2018
- Published by Taylor & Francis in Transportmetrica B: Transport Dynamics
- Vol. 7 (1) , 814-833
Combined traffic control and route choice optimization for traffic networks with disruptive changes
We present a combined traffic control and route choice optimization (CTCRCO) system to quickly find new traffic equilibrium solutions in urban road networks with significant changes. The system iteratively executes a control module which combines a traffic control system (TCS) and a traffic simulation manager (TSM) and an assignment module which combines a route set manager (RSM) and a route choice system (RCS), thus can optimize both traffic flows and route choices for minimizing average travel time of vehicles. We evaluate CTCRCO by testing various traffic scenarios in real-world road networks with significant changes. The results show that TCS and RCS are both significant for achieving a quick and low-cost convergence to an approximate equilibrium in a road network with significant changes. Approximate simulations not only accelerate convergence processes for non-congested cases, but also bypass potential gridlock states for over-congestion cases. The role of different path-finding procedures is also examined.
- 22 October 2018
- Published by Taylor & Francis in Transportmetrica B: Transport Dynamics
- Vol. 7 (1) , 814-833
Combined traffic control and route choice optimization for traffic networks with disruptive changes
We present a combined traffic control and route choice optimization (CTCRCO) system to quickly find new traffic equilibrium solutions in urban road networks with significant changes. The system iteratively executes a control module which combines a traffic control system (TCS) and a traffic simulation manager (TSM) and an assignment module which combines a route set manager (RSM) and a route choice system (RCS), thus can optimize both traffic flows and route choices for minimizing average travel time of vehicles. We evaluate CTCRCO by testing various traffic scenarios in real-world road networks with significant changes. The results show that TCS and RCS are both significant for achieving a quick and low-cost convergence to an approximate equilibrium in a road network with significant changes. Approximate simulations not only accelerate convergence processes for non-congested cases, but also bypass potential gridlock states for over-congestion cases. The role of different path-finding procedures is also examined.
- 1 May 2018
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 90, 181-197
SIV-DSS: Smart In-Vehicle Decision Support System for driving at signalized intersections with V2I communication
- 1 May 2018
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 90, 181-197
SIV-DSS: Smart In-Vehicle Decision Support System for driving at signalized intersections with V2I communication
- 1 January 2017
- Published by Elsevier in Applied Soft Computing
- Vol. 50, 223-234
Cooperative group optimization with ants (CGO-AS): Leverage optimization with mixed individual and social learning
- 1 January 2017
- Published by Elsevier in Applied Soft Computing
- Vol. 50, 223-234
Cooperative group optimization with ants (CGO-AS): Leverage optimization with mixed individual and social learning
- 17 March 2014
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 140 (11) , 115101
More than the sum of its parts: Coarse-grained peptide-lipid interactions from a simple cross-parametrization
Interfacial systems are at the core of fascinating phenomena in many disciplines, such as biochemistry, soft-matter physics, and food science. However, the parametrization of accurate, reliable, and consistent coarse-grained (CG) models for systems at interfaces remains a challenging endeavor. In the present work, we explore to what extent two independently developed solvent-free CG models of peptides and lipids—of different mapping schemes, parametrization methods, target functions, and validation criteria—can be combined by only tuning the cross-interactions. Our results show that the cross-parametrization can reproduce a number of structural properties of membrane peptides (for example, tilt and hydrophobic mismatch), in agreement with existing peptide-lipid CG force fields. We find encouraging results for two challenging biophysical problems: (i) membrane pore formation mediated by the cooperative action of several antimicrobial peptides, and (ii) the insertion and folding of the helix-forming peptide WALP23 in the membrane.
- 17 March 2014
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 140 (11) , 115101
More than the sum of its parts: Coarse-grained peptide-lipid interactions from a simple cross-parametrization
Interfacial systems are at the core of fascinating phenomena in many disciplines, such as biochemistry, soft-matter physics, and food science. However, the parametrization of accurate, reliable, and consistent coarse-grained (CG) models for systems at interfaces remains a challenging endeavor. In the present work, we explore to what extent two independently developed solvent-free CG models of peptides and lipids—of different mapping schemes, parametrization methods, target functions, and validation criteria—can be combined by only tuning the cross-interactions. Our results show that the cross-parametrization can reproduce a number of structural properties of membrane peptides (for example, tilt and hydrophobic mismatch), in agreement with existing peptide-lipid CG force fields. We find encouraging results for two challenging biophysical problems: (i) membrane pore formation mediated by the cooperative action of several antimicrobial peptides, and (ii) the insertion and folding of the helix-forming peptide WALP23 in the membrane.
- 21 June 2013
- Published by Springer Nature in Soft Computing
- Vol. 18 (3) , 469-495
A cooperative group optimization system
- 21 June 2013
- Published by Springer Nature in Soft Computing
- Vol. 18 (3) , 469-495
A cooperative group optimization system
- Open Access
- 1 September 2010
- Published by IOP Publishing in New Journal of Physics
- Vol. 12 (9) , 095004
Systematic implicit solvent coarse-graining of bilayer membranes: lipid and phase transferability of the force field
We study the lipid and phase transferability of our recently developed systematically coarse-grained solvent-free membrane model. The force field was explicitly parameterized to describe a fluid 1-palmitoyl-2-oleoyl-phosphatidylcholine (POPC) bilayer at 310 K with correct structure and area per lipid, while gaining at least three orders of magnitude in computational efficiency (see Wang and Deserno 2010 J. Phys. Chem. B 114 11207–20). Here, we show that exchanging CG tails, without any subsequent re-parameterization, creates reliable models of 1,2-dioleoylphosphatidylcholine (DOPC) and 1,2-dipalmitoylphosphatidylcholine (DPPC) lipids in terms of structure and area per lipid. Furthermore, all CG lipids undergo a liquid–gel transition upon cooling, with characteristics like those observed in experiments and all-atom simulations during phase transformation. These studies suggest a promising transferability of our force field parameters to different lipid species and thermodynamic state points, properties that are a prerequisite for even more complex systems, such as mixtures.
- 1 September 2010
- Published by IOP Publishing in New Journal of Physics
- Vol. 12 (9) , 095004
Open AccessSystematic implicit solvent coarse-graining of bilayer membranes: lipid and phase transferability of the force field
We study the lipid and phase transferability of our recently developed systematically coarse-grained solvent-free membrane model. The force field was explicitly parameterized to describe a fluid 1-palmitoyl-2-oleoyl-phosphatidylcholine (POPC) bilayer at 310 K with correct structure and area per lipid, while gaining at least three orders of magnitude in computational efficiency (see Wang and Deserno 2010 J. Phys. Chem. B 114 11207–20). Here, we show that exchanging CG tails, without any subsequent re-parameterization, creates reliable models of 1,2-dioleoylphosphatidylcholine (DOPC) and 1,2-dipalmitoylphosphatidylcholine (DPPC) lipids in terms of structure and area per lipid. Furthermore, all CG lipids undergo a liquid–gel transition upon cooling, with characteristics like those observed in experiments and all-atom simulations during phase transformation. These studies suggest a promising transferability of our force field parameters to different lipid species and thermodynamic state points, properties that are a prerequisite for even more complex systems, such as mixtures.
- Open Access
- 10 August 2010
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 114 (34) , 11207-11220
A Systematically Coarse-Grained Solvent-Free Model for Quantitative Phospholipid Bilayer Simulations
We present an implicit solvent coarse-grained (CG) model for quantitative simulations of 1-palmitoyl-2-oleoyl-sn-glycero-3-phosphocholine (POPC) bilayers. The absence of explicit solvent enables membrane simulations on large length and time scales at moderate computational expense. Despite improved computational efficiency, the model preserves chemical specificity and quantitative accuracy. The bonded and nonbonded interactions together with the effective cohesion mimicking the hydrophobic effect were systematically tuned by matching structural and mechanical properties from experiments and all-atom bilayer simulations, such as saturated area per lipid, radial distribution functions, density and pressure profiles across the bilayer, P2 order, etc. The CG lipid model is shown to self-assemble into a bilayer starting from a random dispersion. Its line tension and elastic properties, such as bending and stretching modulus, are semiquantitatively consistent with experiments. The effects of (i) reduced molecular friction and (ii) more efficient integration combine to an overall speed-up of 3−4 orders of magnitude compared to all-atom bilayer simulations. Our CG lipid model is especially useful for studies of large-scale phenomena in membranes that nevertheless require a fair description of chemical specificity, e.g., membrane patches interacting with movable and transformable membrane proteins and peptides.
- 10 August 2010
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 114 (34) , 11207-11220
Open AccessA Systematically Coarse-Grained Solvent-Free Model for Quantitative Phospholipid Bilayer Simulations
We present an implicit solvent coarse-grained (CG) model for quantitative simulations of 1-palmitoyl-2-oleoyl-sn-glycero-3-phosphocholine (POPC) bilayers. The absence of explicit solvent enables membrane simulations on large length and time scales at moderate computational expense. Despite improved computational efficiency, the model preserves chemical specificity and quantitative accuracy. The bonded and nonbonded interactions together with the effective cohesion mimicking the hydrophobic effect were systematically tuned by matching structural and mechanical properties from experiments and all-atom bilayer simulations, such as saturated area per lipid, radial distribution functions, density and pressure profiles across the bilayer, P2 order, etc. The CG lipid model is shown to self-assemble into a bilayer starting from a random dispersion. Its line tension and elastic properties, such as bending and stretching modulus, are semiquantitatively consistent with experiments. The effects of (i) reduced molecular friction and (ii) more efficient integration combine to an overall speed-up of 3−4 orders of magnitude compared to all-atom bilayer simulations. Our CG lipid model is especially useful for studies of large-scale phenomena in membranes that nevertheless require a fair description of chemical specificity, e.g., membrane patches interacting with movable and transformable membrane proteins and peptides.