Piping in loose sands: the importance of geometrical fixity of grains

Piping is one of the possible failure mechanism for dams and levees with a sandy foundation. Water flowing through the foundation causes the onset of grain transport, due to which shallow pipes are formed at the interface of the sandy layer and an impermeable blanket layer. In the past, the mechanism has been investigated predominantly in densely packed sands, in which the process was observed to start at the downstream side (backward erosion). Recently performed experiments in loose sand (van Beek et al. 2009) showed a different failure mechanism (forward erosion). In this article additional experiments of piping in loose sands are described for investigating the relevance of the forward process for practice. In these experiments the type of process was found to be dependent on the presence of shear resistance between sand box cover and top sand grains, that causes grains to be fixed geometrically. Without this shear resistance the process was found to be forward, whereas with this shear resistance the process was found to be backward oriented. The change in degree of fixity and relative density as a result of loading is investigated with electrical density measurements. The experiments show that the forward process is not relevant for levees in practice, in which the cohesive blanket layer causes the sand grains to be fixed properly

Large Scale Evolution of Convolutional Neural Networks Using Volunteer Computing

This work presents a new algorithm called evolutionary exploration of augmenting convolutional topologies (EXACT), which is capable of evolving the structure of convolutional neural networks (CNNs). EXACT is in part modeled after the neuroevolution of augmenting topologies (NEAT) algorithm, with notable exceptions to allow it to scale to large scale distributed computing environments and evolve networks with convolutional filters. In addition to multithreaded and MPI versions, EXACT has been implemented as part of a BOINC volunteer computing project, allowing large scale evolution. During a period of two months, over 4,500 volunteered computers on the Citizen Science Grid trained over 120,000 CNNs and evolved networks reaching 98.32% test data accuracy on the MNIST handwritten digits dataset. These results are even stronger as the backpropagation strategy used to train the CNNs was fairly rudimentary (ReLU units, L2 regularization and Nesterov momentum) and these were initial test runs done without refinement of the backpropagation hyperparameters. Further, the EXACT evolutionary strategy is independent of the method used to train the CNNs, so they could be further improved by advanced techniques like elastic distortions, pretraining and dropout. The evolved networks are also quite interesting, showing "organic" structures and significant differences from standard human designed architectures.Comment: 17 pages, 13 figures. Submitted to the 2017 Genetic and Evolutionary Computation Conference (GECCO 2017

A Deep Cascade of Convolutional Neural Networks for MR Image Reconstruction

The acquisition of Magnetic Resonance Imaging (MRI) is inherently slow. Inspired by recent advances in deep learning, we propose a framework for reconstructing MR images from undersampled data using a deep cascade of convolutional neural networks to accelerate the data acquisition process. We show that for Cartesian undersampling of 2D cardiac MR images, the proposed method outperforms the state-of-the-art compressed sensing approaches, such as dictionary learning-based MRI (DLMRI) reconstruction, in terms of reconstruction error, perceptual quality and reconstruction speed for both 3-fold and 6-fold undersampling. Compared to DLMRI, the error produced by the method proposed is approximately twice as small, allowing to preserve anatomical structures more faithfully. Using our method, each image can be reconstructed in 23 ms, which is fast enough to enable real-time applications

Optical polarization rogue waves from supercontinuum generation in zero dispersion fiber pumped by dissipative soliton

Optical rogue waves emerge in nonlinear optical systems with extremely large amplitudes, and leave without a trace. In this work, we reveal the emergence of optical polarization rogue waves in supercontinuum generation from a zero-dispersion fiber, pumped by a dissipative soliton laser. Flat spectral broadening is achieved by modulation instability, followed by cascaded four-wave-mixing. In this process, we identify the emergence of optical polarization rogue waves, based on the probability density function of the relative distance among polarization states. Experimental results show that optical polarization rogue waves originate from vector multi-wave-mixing. Besides, we observe double peaks, and even triple peaks in the histogram of the state of polarization. This is a new and intriguing property, never observed so far in optical rogue waves, for example those emerging in the statistics of pulse intensities. Our polarization domain statistical analysis provides a new insight into the still debated topic of the mechanism for rogue wave generation in optical supercontinuum

Signaling equilibria for dynamic LQG games with asymmetric information

We consider a finite horizon dynamic game with two players who observe their types privately and take actions, which are publicly observed. Players' types evolve as independent, controlled linear Gaussian processes and players incur quadratic instantaneous costs. This forms a dynamic linear quadratic Gaussian (LQG) game with asymmetric information. We show that under certain conditions, players' strategies that are linear in their private types, together with Gaussian beliefs form a perfect Bayesian equilibrium (PBE) of the game. Furthermore, it is shown that this is a signaling equilibrium due to the fact that future beliefs on players' types are affected by the equilibrium strategies. We provide a backward-forward algorithm to find the PBE. Each step of the backward algorithm reduces to solving an algebraic matrix equation for every possible realization of the state estimate covariance matrix. The forward algorithm consists of Kalman filter recursions, where state estimate covariance matrices depend on equilibrium strategies