Far-from-equilibrium Ostwald ripening in electrostatically driven granular powders

We report the first experimental study of cluster size distributions in electrostatically driven granular submonolayers. The cluster size distribution in this far-from-equilibrium process exhibits dynamic scaling behavior characteristic of the (nearly equilibrium) Ostwald ripening, controlled by the attachment and detachment of the "gas" particles. The scaled size distribution, however, is different from the classical Wagner distribution obtained in the limit of a vanishingly small area fraction of the clusters. A much better agreement is found with the theory of Conti et al. [Phys. Rev. E 65, 046117 (2002)] which accounts for the cluster merger.Comment: 5 pages, to appear in PR

Outage probability for soliton transmission

PACS. 78.55.Qr – Amorphous materials; glasses and other disordered solids. PACS. 05.40.-a – Fluctuation phenomena, random processes, noise, and Brownian motion. Abstract. – We study the interplay between amplifier noise and birefringent disorder in the case of strongly nonlinear (soliton) type of transmission in optical fibers. Assuming both noise and disorder to be weak, we evaluate the probability distribution function (PDF) of the Bit-Error-Rate (BER) for the values of BER that are much larger than the typical (average) value. The PDFtail that describes probability of the system outage shows log-normal shape, strongly dependent on the fiber length. We also discuss a simple timing shift technique capable of the outage compensation. Nonlinear information transmission in optical fibers when elementary bits are represented by optical solitons constitutes a promising technology that has been a subject of intensive research over the past decades [1, 2]. In idealfibers, the information carried by the solitons would be transmitted without any loss. In practice, however, various impairments lead to information loss. Amplifier noise and birefringent disorder represent the two major impairments in both linear and nonlinear transmission regimes. The noise generated by spontaneous emissio

Conditional association between melanism and personality in Israeli barn owls

Capsule Boldness defines the extent to which animals are willing to take risks in the presence of a predator. Late, but not early, in the breeding season, Israeli nestling Barn Owls displaying larger black feather spots were more docile, feigned death longer and had a lower breathing rate when handled than smaller-spotted nestlings. Larger-spotted breeding females were less docile if heavy but more more docile if light. The covariation between personality (boldness vs. timid) and melanin-based colouration is therefore conditional on environmental factors

Discrete and surface solitons in photonic graphene nanoribbons

We analyze localization of light in honeycomb photonic lattices restricted in one dimension which can be regarded as an optical analog of (``armchair'' and ``zigzag'') graphene nanoribbons. We find the conditions for the existence of spatially localized states and discuss the effect of lattice topology on the properties of discrete solitons excited inside the lattice and at its edges. In particular, we discover a novel type of soliton bistability, the so-called geometry-induced bistability, in the lattices of a finite extent.Comment: three double-column pages, 5 figures, submitted for publicatio

Normal scaling in globally conserved interface-controlled coarsening of fractal clusters

Globally conserved interface-controlled coarsening of fractal clusters exhibits dynamic scale invariance and normal scaling. This is demonstrated by a numerical solution of the Ginzburg-Landau equation with a global conservation law. The sharp-interface limit of this equation is volume preserving motion by mean curvature. The scaled form of the correlation function has a power-law tail accommodating the fractal initial condition. The coarsening length exhibits normal scaling with time. Finally, shrinking of the fractal clusters with time is observed. The difference between global and local conservation is discussed.Comment: 4 pages, 3 eps figure

Distributed Symmetry Breaking in Hypergraphs

Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and $\Delta +1$-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in {\em hypergraphs}. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hypergraphs. In this paper, we study the distributed complexity of symmetry breaking in hypergraphs by presenting distributed randomized algorithms for a variety of fundamental problems under a natural distributed computing model for hypergraphs. We first show that MIS in hypergraphs (of arbitrary dimension) can be solved in $O(\log^2 n)$ rounds ($n$ is the number of nodes of the hypergraph) in the LOCAL model. We then present a key result of this paper --- an $O(\Delta^{\epsilon}\text{polylog}(n))$-round hypergraph MIS algorithm in the CONGEST model where $\Delta$ is the maximum node degree of the hypergraph and $\epsilon > 0$ is any arbitrarily small constant. To demonstrate the usefulness of hypergraph MIS, we present applications of our hypergraph algorithm to solving problems in (standard) graphs. In particular, the hypergraph MIS yields fast distributed algorithms for the {\em balanced minimal dominating set} problem (left open in Harris et al. [ICALP 2013]) and the {\em minimal connected dominating set problem}. We also present distributed algorithms for coloring, maximal matching, and maximal clique in hypergraphs.Comment: Changes from the previous version: More references adde

Convective rainfall in a dry climate: relations with synoptic systems and flash-flood generation in the Dead Sea region

Spatiotemporal patterns of rainfall are important characteristics that influence runoff generation and flash-flood magnitude and require high-resolution measurements to be adequately represented. This need is further emphasized in arid climates, where rainfall is scarce and highly variable. In this study, 24 years of corrected and gauge-adjusted radar rainfall estimates are used to (i) identify the spatial structure and dynamics of convective rain cells in a dry climate region in the Eastern Mediterranean, (ii) to determine their climatology, and (iii) to understand their relation with the governing synoptic systems and with flash-flood generation. Rain cells are extracted using a segmentation method and a tracking algorithm, and are clustered into three synoptic patterns according to atmospheric variables from the ERA-Interim reanalysis. On average, the cells are about 90 km2 in size, move 13 m s−1 from west to east, and live for 18 min. The Cyprus low accounts for 30 % of the events, the low to the east of the study region for 44 %, and the Active Red Sea Trough for 26 %. The Active Red Sea Trough produces shorter rain events composed of rain cells with higher rain intensities, longer lifetime, smaller area, and lower velocities. The area of rain cells is positively correlated with topographic height. The number of cells is negatively correlated with the distance from the shoreline. Rain-cell intensity is negatively correlated with mean annual precipitation. Flash-flood-related events are dominated by rain cells of large size, low velocity, and long lifetime that move downstream with the main axis of the catchments. These results can be further used for stochastic simulations of convective rain storms and serve as input for hydrological models and for flash-flood nowcasting systems

Separating Hierarchical and General Hub Labelings

In the context of distance oracles, a labeling algorithm computes vertex labels during preprocessing. An $s,t$ query computes the corresponding distance from the labels of $s$ and $t$ only, without looking at the input graph. Hub labels is a class of labels that has been extensively studied. Performance of the hub label query depends on the label size. Hierarchical labels are a natural special kind of hub labels. These labels are related to other problems and can be computed more efficiently. This brings up a natural question of the quality of hierarchical labels. We show that there is a gap: optimal hierarchical labels can be polynomially bigger than the general hub labels. To prove this result, we give tight upper and lower bounds on the size of hierarchical and general labels for hypercubes.Comment: 11 pages, minor corrections, MFCS 201