A coupled hydro-mechanical analysis for prediction of hydraulic fracture propagation in saturated porous media using EFG mesh-less method

The details of the Element Free Galerkin (EFG) method are presented with the method being applied to a study on hydraulic fracturing initiation and propagation process in a saturated porous medium using coupled hydro-mechanical numerical modelling. In this EFG method, interpolation (approximation) is based on nodes without using elements and hence an arbitrary discrete fracture path can be modelled.The numerical approach is based upon solving two governing partial differential equations of equilibrium and continuity of pore water simultaneously. Displacement increment and pore water pressure increment are discretized using the same EFG shape functions. An incremental constrained Galerkin weak form is used to create the discrete system of equations and a fully implicit scheme is used for discretization in the time domain. Implementation of essential boundary conditions is based on the penalty method. In order to model discrete fractures, the so-called diffraction method is used.Examples are presented and the results are compared to some closed-form solutions and FEM approximations in order to demonstrate the validity of the developed model and its capabilities. The model is able to take the anisotropy and inhomogeneity of the material into account. The applicability of the model is examined by simulating hydraulic fracture initiation and propagation process from a borehole by injection of fluid. The maximum tensile strength criterion and Mohr-Coulomb shear criterion are used for modelling tensile and shear fracture, respectively. The model successfully simulates the leak-off of fluid from the fracture into the surrounding material. The results indicate the importance of pore fluid pressure in the initiation and propagation pattern of fracture in saturated soils. © 2013 Elsevier Ltd.

The stochastic implicit Euler method - A stable coupling scheme for Monte Carlo burnup calculations

Existing Monte Carlo burnup codes use various schemes to solve the coupled criticality and burnup equations. Previous studies have shown that the coupling schemes of the existing Monte Carlo burnup codes can be numerically unstable. Here we develop the Stochastic Implicit Euler method - a stable and efficient new coupling scheme. The implicit solution is obtained by the stochastic approximation at each time step. Our test calculations demonstrate that the Stochastic Implicit Euler method can provide an accurate solution to problems where the methods in the existing Monte Carlo burnup codes fail. © 2013 Elsevier Ltd. All rights reserved.

Alternating spatial patterns for coordinated group motion

Motivated by recent observations of fish schools, we study coordinated group motion for individuals with oscillatory speed. Neighbors that have speed oscillations with common frequency, amplitude and average but different phases, move together in alternating spatial patterns, taking turns being towards the front, sides and back of the group. We propose a model and control laws to investigate the connections between these spatial dynamics, communication when sensing is range or direction limited, and convergence of coordinated group motions. ©2007 IEEE.

Fast Hands-free Writing by Gaze Direction

We describe a method for text entry based on inverse arithmetic coding that relies on gaze direction and which is faster and more accurate than using an on-screen keyboard. These benefits are derived from two innovations: the writing task is matched to the capabilities of the eye, and a language model is used to make predictable words and phrases easier to write.

Streaming covariance selection with applications to adaptive querying in sensor networks

Sensor networks can be naturally represented as graphical models, where the edge set encodes the presence of sparsity in the correlation structure between sensors. Such graphical representations can be valuable for information mining purposes as well as for optimizing bandwidth and battery usage with minimal loss of estimation accuracy. We use a computationally efficient technique for estimating sparse graphical models which fits a sparse linear regression locally at each node of the graph via the Lasso estimator. Using a recently suggested online, temporally adaptive implementation of the Lasso, we propose an algorithm for streaming graphical model selection over sensor networks. With battery consumption minimization applications in mind, we use this algorithm as the basis of an adaptive querying scheme. We discuss implementation issues in the context of environmental monitoring using sensor networks, where the objective is short-term forecasting of local wind direction. The algorithm is tested against real UK weather data and conclusions are drawn about certain tradeoffs inherent in decentralized sensor networks data analysis. © 2010 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.