If d = 1, we can simply sort the points and do a binary search; so we can answer the query in time O(log n). We can extend this idea to d dimensions; this leads to famous data structures known as k-d trees and quad trees. Unfortunately, the memory that we need for any of these data structures grows exponentially in d, i.e., n. So, even if d is about 30 it is impossible to run these algorithms o...

In this article a novel nonlinear model predictive control (NMPC) scheme is derived, which tailored to the underlying structure of intrinsic description geometrically exact beams (in velocities and strains are primary variables). This an important class partial differential equation (PDE) models whose behavior fundamental performance flexible structural systems (e.g., wind turbines, high-altitu...

Coordination polymer particles have attracted a great deal of attention due to their characteristic properties and diverse applications in the fields of gas storage, catalysis, optics, sensing, electronics, photochemistry, and biology. Herein, we investigated shape transformation reactions of zinc 5, 10, 15, 20-tetra(4-pyridyl)-21 H, 23 H-porphine (ZnTPyP)-containing coordination polymer partic...

It is generally believed that base-pair stacking interaction in DNA double helix is one of the strongest interactions that governs sequence directed structural variability. However, X-ray crystal structures of some base-paired doublet sequences have been seen to adopt different structures when flanked by different base-pairs. DNA crystal database, however, is still too small to make good statis...