Engineering Commons^™

Approximate Techniques In Solving Optimal Camera Placement Problems, Jian Zhao, Ruriko Yoshida, Sen-Ching Samson Cheung, David Haws

Statistics Faculty Publications

While the theoretical foundation of the optimal camera placement problem has been studied for decades, its practical implementation has recently attracted significant research interest due to the increasing popularity of visual sensor networks. The most flexible formulation of finding the optimal camera placement is based on a binary integer programming (BIP) problem. Despite the flexibility, most of the resulting BIP problems are NP-hard and any such formulations of reasonable size are not amenable to exact solutions. There exists a myriad of approximate algorithms for BIP problems, but their applications, efficiency, and scalability in solving camera placement are poorly understood. Thus, …

Lectures In Computational Fluid Dynamics Of Incompressible Flow: Mathematics, Algorithms And Implementations, James M. Mcdonough

Mechanical Engineering Textbook Gallery

From Prologue:

The present lecture notes are written to emphasize the mathematics of the Navier–Stokes (N.–S.) equations of incompressible flow and the algorithms that have been developed over the past 30 years for solving them.