Clogging and Jamming of Colloidal Monolayers Driven Across a Disordered Landscape

We experimentally investigate the clogging and jamming of interacting paramagnetic colloids driven through a quenched disordered landscape of fixed obstacles. When the particles are forced to cross a single aperture between two obstacles, we find an intermittent dynamics characterized by an exponential distribution of burst size. At the collective level, we observe that quenched disorder decreases the particle ow, but it also greatly enhances the "faster is slower" effect, that occurs when increasing the particle speed. Further, we show that clogging events may be controlled by tuning the pair interactions between the particles during transport, such that the colloidal ow decreases for repulsive interactions, but increases for anisotropic attraction. We provide an experimental test-bed to investigate the crucial role of disorder on clogging and jamming in driven microscale matter

Superfluid Vortex Dynamics on Planar Sectors and Cones

We study the dynamics of vortices formed in a superfluid film adsorbed on the curved two-dimensional surface of a cone. To this aim, we observe that a cone can be unrolled to a sector on a plane with periodic boundary conditions on the straight sides. The sector can then be mapped conformally to the whole plane, leading to the relevant stream function. In this way, we show that a superfluid vortex on the cone precesses uniformly at fixed distance from the apex. The stream function also yields directly the interaction energy of two vortices on the cone. We then study the vortex dynamics on unbounded and bounded cones. In suitable limits, we recover the known results for dynamics on cylinders and planar annuli.Comment: 10 pages, 8 figure

Superstrings on AdS_4 x CP^3 from Supergravity

We derive from a general formulation of pure spinor string theory on type IIA backgrounds the specific form of the action for the AdS_4 x P^3 background. We provide a complete geometrical characterization of the structure of the superfields involved in the action.Comment: 32 pages, Latex, no figure

Quantized superfluid vortex dynamics on cylindrical surfaces and planar annuli

Superfluid vortex dynamics on an infinite cylinder differs significantly from that on a plane. The requirement that a condensate wave function be single valued upon once encircling the cylinder means that such a single vortex cannot remain stationary. Instead, it acquires one of a series of quantized translational velocities around the circumference, the simplest being $\pm \hbar/(2MR)$, with $M$ the mass of the superfluid particles and $R$ the radius of the cylinder. A generalization to a finite cylinder automatically includes these quantum-mechanical effects through the pairing of the single vortex and its image in either the top or bottom end of the surface. The dynamics of a single vortex on this surface provides a hydrodynamic analog of Laughlin pumping. The interaction energy for two vortices on an infinite cylinder is proportional to the classical stream function $\chi({\bf r}_{12})$, and it crosses over from logarithmic to linear when the intervortex separation ${\bf r}_{12}$ becomes larger than the cylinder radius. An Appendix summarizes the connection to an earlier study of Ho and Huang for one or more vortices on an infinite cylinder. A second Appendix reviews the topologically equivalent planar annulus, where such quantized vortex motion has no offset, but Laughlin pumping may be more accessible to experimental observation.Comment: 16 pages, 7 figures; published version, with thoroughly revised Appendice

Embracing Localization Inaccuracy: A Case Study

In recent years, indoor localization has become a hot research topic with some sophisticated solutions reaching accuracy on the order of ten centimeters. While certain classes of applications can justify the corresponding costs that come with these solutions, a wealth of applications have requirements that can be met at much lower cost by accepting lower accuracy. This paper explores one specific application for monitoring patients in a nursing home, showing that sufficient accuracy can be achieved with a carefully designed deployment of low-cost wireless sensor network nodes in combination with a simple RSSI-based localization technique. Notably our solution uses a single radio sample per period, a number that is much lower than similar approaches. This greatly eases the power burden of the nodes, resulting in a significant lifetime increase. This paper evaluates a concrete deployment from summer 2012 composed of fixed anchor motes throughout one floor of a nursing home and mobile units carried by patients. We show how two localization algorithms perform and demonstrate a clear improvement by following a set of simple guidelines to tune the anchor node placement. We show both quantitatively and qualitatively that the results meet the functional and non-functional system requirements

Grid Infrastructure for Domain Decomposition Methods in Computational ElectroMagnetics

The accurate and efficient solution of Maxwell's equation is the problem addressed by the scientific discipline called Computational ElectroMagnetics (CEM). Many macroscopic phenomena in a great number of fields are governed by this set of differential equations: electronic, geophysics, medical and biomedical technologies, virtual EM prototyping, besides the traditional antenna and propagation applications. Therefore, many efforts are focussed on the development of new and more efficient approach to solve Maxwell's equation. The interest in CEM applications is growing on. Several problems, hard to figure out few years ago, can now be easily addressed thanks to the reliability and flexibility of new technologies, together with the increased computational power. This technology evolution opens the possibility to address large and complex tasks. Many of these applications aim to simulate the electromagnetic behavior, for example in terms of input impedance and radiation pattern in antenna problems, or Radar Cross Section for scattering applications. Instead, problems, which solution requires high accuracy, need to implement full wave analysis techniques, e.g., virtual prototyping context, where the objective is to obtain reliable simulations in order to minimize measurement number, and as consequence their cost. Besides, other tasks require the analysis of complete structures (that include an high number of details) by directly simulating a CAD Model. This approach allows to relieve researcher of the burden of removing useless details, while maintaining the original complexity and taking into account all details. Unfortunately, this reduction implies: (a) high computational effort, due to the increased number of degrees of freedom, and (b) worsening of spectral properties of the linear system during complex analysis. The above considerations underline the needs to identify appropriate information technologies that ease solution achievement and fasten required elaborations. The authors analysis and expertise infer that Grid Computing techniques can be very useful to these purposes. Grids appear mainly in high performance computing environments. In this context, hundreds of off-the-shelf nodes are linked together and work in parallel to solve problems, that, previously, could be addressed sequentially or by using supercomputers. Grid Computing is a technique developed to elaborate enormous amounts of data and enables large-scale resource sharing to solve problem by exploiting distributed scenarios. The main advantage of Grid is due to parallel computing, indeed if a problem can be split in smaller tasks, that can be executed independently, its solution calculation fasten up considerably. To exploit this advantage, it is necessary to identify a technique able to split original electromagnetic task into a set of smaller subproblems. The Domain Decomposition (DD) technique, based on the block generation algorithm introduced in Matekovits et al. (2007) and Francavilla et al. (2011), perfectly addresses our requirements (see Section 3.4 for details). In this chapter, a Grid Computing infrastructure is presented. This architecture allows parallel block execution by distributing tasks to nodes that belong to the Grid. The set of nodes is composed by physical machines and virtualized ones. This feature enables great flexibility and increase available computational power. Furthermore, the presence of virtual nodes allows a full and efficient Grid usage, indeed the presented architecture can be used by different users that run different applications