Search PubMed⌕ Search

Biomedical subjects

Vance Wong

Publications and source records attributed to Vance Wong.

3 recordsLinked to original sources

Geometry dependent features of optically induced forces between silver nanoparticles.

A recently devised, discrete-dipole approximation (DDA) based method for computing optical forces is used to explore geometry dependent aspects of the light induced interactions between pairs of silver nanoparticles, including the influence of particle shape, relative positioning of the particles, and incident field orientation. The interactions are observed to have a large degree of generic character, independent of the details of the particle shape. The size of the optical forces is also compared to estimates for the van der Waals forces, and the results are used to assess the potential importance of radiation forces on recent experiments demonstrating photoinduced self-assembly of triangular silver nanoprisms.

Journal Article↗

Self-assembly on multiple length scales: a Monte Carlo algorithm with data augmentation.

We present a Monte Carlo algorithm that allows simulations where portions of the system of variable size are moved. The algorithm requires the definition of an augmented space that contains information on the bonding between components of the system and is updated as the simulation proceeds. With this method it is possible to incorporate, within the same simulation, processes involving motion of smaller and larger portions of a given system. The algorithm is presented in general terms and illustrated for a simple one-dimensional lattice model.

Journal Article↗

An agent-based approach for modeling molecular self-organization.

Agent-based modeling is a technique currently used to simulate complex systems in computer science and social science. Here, we propose its application to the problem of molecular self-assembly. A system is allowed to evolve from a separated to an aggregated state following a combination of stochastic, deterministic, and adaptive rules. We consider the problem of packing rigid shapes on a lattice to verify that this algorithm produces more nearly optimal aggregates with less computational effort than comparable Monte Carlo simulations.

Algorithms↗