Large Decrease of Fluctuations for Supercooled Water in Hydrophobic Nanoconfinement

Using Monte Carlo simulations we study a coarse­grained model of a water layer confined in a fixed disordered matrix of hydrophobic nanoparticles at different particle concentrations c. For c = 0 we find a 1st order liquid­liquid phase transition (LLPT) ending in one critical point at low pressure P. For c > 0 our simulations are consistent with a LLPT line ending in two critical points at low and high pressure. For c = 25% at high P and low temperature T we find a dramatic decrease of compressibility, thermal expansion coefficient, and specific heat. Surprisingly, the effect is present also for c as low as 2.4%. We conclude that even a small presence of nanoscopic hydrophobes can drastically suppress thermodynamic fluctuations, making the detection of the LLPT more difficult.

Automated Placement of Cameras in a Floorplan to Satisfy Task-Specific Constraints

In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant solutions for some sensor location problem classes. Unfortunately, these solutions utilize unrealistic assumptions about the cameras' capabilities that make these algorithms unsuitable for many real-world computer vision applications: unlimited field of view, infinite depth of field, and/or infinite servo precision and speed. In this paper, the general camera placement problem is first defined with assumptions that are more consistent with the capabilities of real-world cameras. The region to be observed by cameras may be volumetric, static or dynamic, and may include holes that are caused, for instance, by columns or furniture in a room that can occlude potential camera views. A subclass of this general problem can be formulated in terms of planar regions that are typical of building floorplans. Given a floorplan to be observed, the problem is then to efficiently compute a camera layout such that certain task-specific constraints are met. A solution to this problem is obtained via binary optimization over a discrete problem space. In preliminary experiments the performance of the resulting system is demonstrated with different real floorplans.