Search

Time-lapse images carry out important information about dynamic changes in Earth's interior which can be inferred using different Full Waveform Inversion (FWI) schemes. The estimation process is performed by manipulating more than one seismic dataset, associated with the baseline and monitors surveys. The time-lapse variations can be so minute and localised that quantifying the uncertainties becomes fundamental to assessing the reliability of the results. The Bayesian formulation of the FWI problem naturally provides confidence levels in the solution, but evaluating the uncertainty of time-lapse seismic inversion remains a challenge due to the ill-posedness and high dimensionality of the problem. The Hamiltonian Monte Carlo (HMC) can be used to effectively sample over high dimensional distributions with affordable computational efforts. In this context, we propose a probabilistic Bayesian sequential approach for time-lapse FWI using the HMC method. Our approach relies on the integration of the baseline survey information as prior knowledge in the monitor estimation. We compare the proposed methodology with a parallel scheme in perfect and perturbed acquisition geometry scenarios. We also investigate the correlation effect between baseline and monitor samples in the propagated uncertainties. The results show that our strategy provides accurate times-lapse estimates with errors of similar magnitude to the parallel methodology., Comment: 12 pages, 6 figures

An inherent problem of reinforcement learning is performing exploration of an environment through random actions, of which a large portion can be unproductive. Instead, exploration can be improved by initializing the learning policy with an existing (previously learned or hard-coded) oracle policy, offline data, or demonstrations. In the case of using an oracle policy, it can be unclear how best to incorporate the oracle policy's experience into the learning policy in a way that maximizes learning sample efficiency. In this paper, we propose a method termed Critic Confidence Guided Exploration (CCGE) for incorporating such an oracle policy into standard actor-critic reinforcement learning algorithms. More specifically, CCGE takes in the oracle policy's actions as suggestions and incorporates this information into the learning scheme when uncertainty is high, while ignoring it when the uncertainty is low. CCGE is agnostic to methods of estimating uncertainty, and we show that it is equally effective with two different techniques. Empirically, we evaluate the effect of CCGE on various benchmark reinforcement learning tasks, and show that this idea can lead to improved sample efficiency and final performance. Furthermore, when evaluated on sparse reward environments, CCGE is able to perform competitively against adjacent algorithms that also leverage an oracle policy. Our experiments show that it is possible to utilize uncertainty as a heuristic to guide exploration using an oracle in reinforcement learning. We expect that this will inspire more research in this direction, where various heuristics are used to determine the direction of guidance provided to learning., Comment: Under review at TMLR

Full-Waveform Inversion (FWI) is a high-resolution technique used in geophysics to evaluate the physical parameters and construct subsurface models in a noisy and limited data scenario. The ill-posed nature of the FWI turns this a challenging problem since more than one model can match the observations. In a probabilistic way, solving the FWI problem demands efficient sampling techniques to infer information on parameters and to estimate the uncertainties in high-dimensional model spaces. We investigate the feasibility of applying the Hamiltonian Monte Carlo (HMC) method in the acoustic FWI by a reflection setup containing different noise level data. We propose a new strategy for tuning the mass matrix based on the acquisition geometry of the seismic survey. Our methodology significantly improves the ability of the HMC method in reconstructing reasonable seismic models with affordable computational efforts., Comment: 10 pages, 6 figures

The present study investigates the effect of different reaction times on the crystallinity, surface morphology and size of iron oxide nanoparticles. In this synthetic system, aqueous iron (III) nitrate (Fe(NO$_3$)$_3\cdot9$H$_2$O) nonahydrate, provided the iron source and triethylamine was the precipitant and alkaline agent. The as-synthesised iron oxide nanoparticles were characterised by X-ray diffraction (XRD), Rietveld analysis, Scanning Electron Microscopy (SEM) and Fourier transform infrared spectroscopy (FTIR). Prolonged reaction times indicated the change on nanoparticle shape from elongated nanorods to finally distorted nanocubes. Analysis on the crystallinity of the iron oxide nanoparticles suggest that the samples mainly consist of two phases, which are Goethite ($\alpha$-FeOOH) and Hematite $(\alpha$-Fe$_2$O$_3$), respectively.

Particle Swam Optimization is a population-based and gradient-free optimization method developed by mimicking social behaviour observed in nature. Its ability to optimize is not specifically implemented but emerges in the global level from local interactions. In its canonical version, there are three factors that govern a particle's trajectory: 1) inertia from its previous displacement; 2) attraction to its best experience; and 3) attraction to a given neighbour's best experience. The importance given to each of these factors is regulated by three coefficients: 1) the inertia; 2) the individuality; and 3) the sociality weights. Their settings rule the trajectory of the particle when pulled by these two attractors. Different speeds and forms of convergence of a particle towards its attractor(s) take place for different settings of the coefficients. A more general formulation is presented aiming for a better control of the embedded randomness. Guidelines to select the coefficients' settings to obtain the desired behaviour are offered. The convergence speed of the algorithm also depends on the speed of spread of information within the swarm. The latter is governed by the structure of the neighbourhood, whose study is beyond the scope of this paper. The objective here is to help understand the core of the PSO paradigm from the bottom up by offering some insight into the form of the particles' trajectories, and to provide some guidelines as to how to decide upon the settings of the coefficients in the particles' velocity update equation in the proposed formulation to obtain the type of behaviour desired for the problem at hand. General-purpose settings are also suggested. The relationship between the proposed formulation and both the classical and constricted PSO formulations are also provided., Comment: Preprint submitted to E. Dvorkin, M. Goldschmit, & M. Storti (Eds.), Mec\'anica Computacional: Computational Intelligence Techniques for Optimization and Data Modeling (B) (Vol. XXIX, pp. 9253-9269). Asociaci\'on Argentina de Mec\'anica Computacional, Buenos Aires, Argentina, 2010. Open access published version here: https://cimec.org.ar/ojs/index.php/mc/article/view/3666

Three basic factors govern the individual behaviour of a particle: the inertia from its previous displacement; the attraction to its own best experience; and the attraction to a given neighbour's best experience. The importance awarded to each factor is controlled by three coefficients: the inertia; the individuality; and the sociality weights. The social behaviour is ruled by the structure of the social network, which defines the neighbours that are to inform of their experiences to a given particle. This paper presents a study of the influence of different settings of the coefficients as well as of the combined effect of different settings and different neighbourhood topologies on the speed and form of convergence., Comment: Preprint submitted to Developments and Applications in Engineering Computational Technology

The penalization method is a popular technique to provide particle swarm optimizers with the ability to handle constraints. The downside is the need of penalization coefficients whose settings are problem-specific. While adaptive coefficients can be found in the literature, a different adaptive scheme is proposed in this paper, where coefficients are kept constant. A pseudo-adaptive relaxation of the tolerances for constraint violations while penalizing only violations beyond such tolerances results in a pseudo-adaptive penalization. A particle swarm optimizer is tested on a suite of benchmark problems for three types of tolerance relaxation: no relaxation; self-tuned initial relaxation with deterministic decrease; and self-tuned initial relaxation with pseudo-adaptive decrease. Other authors' results are offered as frames of reference., Comment: Preprint submitted to Proceedings of the tenth International Conference on Computational Structures Technology

The combining of a General-Purpose Particle Swarm Optimizer (GP-PSO) with Sequential Quadratic Programming (SQP) algorithm for constrained optimization problems has been shown to be highly beneficial to the refinement, and in some cases, the success of finding a global optimum solution. It is shown that the likely difference between leading algorithms are in their local search ability. A comparison with other leading optimizers on the tested benchmark suite, indicate the hybrid GP-PSO with implemented local search to compete along side other leading PSO algorithms., Comment: Preprint submitted to the 8th ASMO UK Conference on Engineering Design Optimization

Particle Swarm Optimization is a global optimizer in the sense that it has the ability to escape poor local optima. However, if the spread of information within the population is not adequately performed, premature convergence may occur. The convergence speed and hence the reluctance of the algorithm to getting trapped in suboptimal solutions are controlled by the settings of the coefficients in the velocity update equation as well as by the neighbourhood topology. The coefficients settings govern the trajectories of the particles towards the good locations identified, whereas the neighbourhood topology controls the form and speed of spread of information within the population (i.e. the update of the social attractor). Numerous neighbourhood topologies have been proposed and implemented in the literature. This paper offers a numerical comparison of the performances exhibited by five different neighbourhood topologies combined with four different coefficients' settings when optimizing a set of benchmark unconstrained problems. Despite the optimum topology being problem-dependent, it appears that dynamic neighbourhoods with the number of interconnections increasing as the search progresses should be preferred for a non-problem-specific optimizer., Comment: Preprint submitted to the 8th ASMO UK Conference on Engineering Design Optimization

This thesis is concerned with continuous, static, and single-objective optimization problems subject to inequality constraints. Nevertheless, some methods to handle other kinds of problems are briefly reviewed. The particle swarm optimization paradigm was inspired by previous simulations of the cooperative behaviour observed in social beings. It is a bottom-up, randomly weighted, population-based method whose ability to optimize emerges from local, individual-to-individual interactions. As opposed to traditional methods, it can deal with different problems with few or no adaptation due to the fact that it does profit from problem-specific features of the problem at issue but performs a parallel, cooperative exploration of the search-space by means of a population of individuals. The main goal of this thesis consists of developing an optimizer that can perform reasonably well on most problems. Hence, the influence of the settings of the algorithm's parameters on the behaviour of the system is studied, some general-purpose settings are sought, and some variations to the canonical version are proposed aiming to turn it into a more general-purpose optimizer. Since no termination condition is included in the canonical version, this thesis is also concerned with the design of some stopping criteria which allow the iterative search to be terminated if further significant improvement is unlikely, or if a certain number of time-steps are reached. In addition, some constraint-handling techniques are incorporated into the canonical algorithm to handle inequality constraints. Finally, the capabilities of the proposed general-purpose optimizers are illustrated by optimizing a few benchmark problems., Comment: MSc Thesis

The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature. While particle swarm optimizers share such advantages, they outperform evolutionary algorithms in that they require lower computational cost and easier implementation, involving no operator design and few coefficients to be tuned. However, even marginal variations in the settings of these coefficients greatly influence the dynamics of the swarm. Since this paper does not intend to study their tuning, general-purpose settings are taken from previous studies, and virtually the same algorithm is used to optimize a variety of notably different problems. Thus, following a review of the paradigm, the algorithm is tested on a set of benchmark functions and engineering problems taken from the literature. Later, complementary lines of code are incorporated to adapt the method to combinatorial optimization as it occurs in scheduling problems, and a real case is solved using the same optimizer with the same settings. The aim is to show the flexibility and robustness of the approach, which can handle a wide variety of problems., Comment: Preprint submitted to Trends in Engineering Computational Technology. arXiv admin note: text overlap with arXiv:2101.10933

Population-based methods can cope with a variety of different problems, including problems of remarkably higher complexity than those traditional methods can handle. The main procedure consists of successively updating a population of candidate solutions, performing a parallel exploration instead of traditional sequential exploration. While the origins of the PSO method are linked to bird flock simulations, it is a stochastic optimization method in the sense that it relies on random coefficients to introduce creativity, and a bottom-up artificial intelligence-based approach in the sense that its intelligent behaviour emerges in a higher level than the individuals' rather than deterministically programmed. As opposed to EAs, the PSO involves no operator design and few coefficients to be tuned. Since this paper does not intend to study such tuning, general-purpose settings are taken from previous studies. The PSO algorithm requires the incorporation of some technique to handle constraints. A popular one is the penalization method, which turns the original constrained problem into unconstrained by penalizing infeasible solutions. Other techniques can be specifically designed for PSO. Since these strategies present advantages and disadvantages when compared to one another, there is no obvious best constraint-handling technique (CHT) for all problems. The aim here is to develop and compare different CHTs suitable for PSOs, which are incorporated to an algorithm with general-purpose settings. The comparisons are performed keeping the remaining features of the algorithm the same, while comparisons to other authors' results are offered as a frame of reference for the optimizer as a whole. Thus, the penalization, preserving feasibility and bisection methods are discussed, implemented, and tested on two suites of benchmark problems. Three neighbourhood sizes are also considered in the experiments., Comment: Preprint submitted to the 7th ASMO UK Conference on Engineering Design Optimization

The range of applications of traditional optimization methods are limited by the features of the object variables, and of both the objective and the constraint functions. In contrast, population-based algorithms whose optimization capabilities are emergent properties, such as evolutionary algorithms and particle swarm optimization, present almost no restriction on those features and can handle different optimization problems with few or no adaptations. Their main drawbacks consist of their comparatively higher computational cost and difficulty in handling equality constraints. The particle swarm optimization method is sometimes viewed as an evolutionary algorithm because of their many similarities, despite not being inspired by the same metaphor: they evolve a population of individuals taking into account previous experiences and using stochastic operators to introduce new responses. The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature for decades. While the particle swarm optimizers share such advantages, their main desirable features when compared to evolutionary algorithms are their lower computational cost and easier implementation, involving no operator design and few parameters to be tuned. However, even slight modifications of these parameters greatly influence the dynamics of the swarm. This paper deals with the effect of the settings of the parameters of the particles' velocity update equation on the behaviour of the system., Comment: submitted to the 7th World Congress on Structural and Multidisciplinary Optimization, COEX Seoul, 21 May - 25 May 2007, Korea. arXiv admin note: substantial text overlap with arXiv:2101.09835

Traditional methods present a very restrictive range of applications, mainly limited by the features of the function to be optimized and of the constraint functions. In contrast, evolutionary algorithms present almost no restriction to the features of these functions, although the most appropriate constraint-handling technique is still an open question. The particle swarm optimization (PSO) method is sometimes viewed as another evolutionary algorithm because of their many similarities, despite not being inspired by the same metaphor. Namely, they evolve a population of individuals taking into consideration previous experiences and using stochastic operators to introduce new responses. The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature for decades. While all such advantages are valid when comparing the PSO paradigm to traditional methods, its main advantages with respect to evolutionary algorithms consist of its noticeably lower computational cost and easier implementation. In fact, the plain version can be programmed in a few lines of code, involving no operator design and few parameters to be tuned. This paper deals with three important aspects of the method: the influence of the parameters' tuning on the behaviour of the system; the design of stopping criteria so that the reliability of the solution found can be somehow estimated and computational cost can be saved; and the development of appropriate techniques to handle constraints, given that the original method is designed for unconstrained optimization problems., Comment: 6th ASMO UK / ISSMO conference. Oxford, 3rd-4th July 2006

In this work, a novel high-speed railway fastener detector is introduced. This fully convolutional network, dubbed FasteNet, foregoes the notion of bounding boxes and performs detection directly on a predicted saliency map. Fastenet uses transposed convolutions and skip connections, the effective receptive field of the network is 1.5$\times$ larger than the average size of a fastener, enabling the network to make predictions with high confidence, without sacrificing output resolution. In addition, due to the saliency map approach, the network is able to vote for the presence of a fastener up to 30 times per fastener, boosting prediction accuracy. Fastenet is capable of running at 110 FPS on an Nvidia GTX 1080, while taking in inputs of 1600$\times$512 with an average of 14 fasteners per image. Our source is open here: https://github.com/jjshoots/DL\_FasteNet.git, Comment: 8 pages

We investigate time-resolved charge transport through graphene nanoribbons supplemented with adsorbed impurity atoms. Depending on the location of the impurities with respect to the hexagonal carbon lattice, the transport properties of the system may become invisible to the impurity due to the symmetry properties of the binding mechanism. This motivates a chemical sensing device since dopants affecting the underlying sublattice symmetry of the pristine graphene nanoribbon introduce scattering. Using the time-dependent Landauer--B{\"u}ttiker formalism, we extend the stationary current-voltage picture to the transient regime, where we observe how the impurity invisibility takes place at sub-picosecond time scales further motivating ultrafast sensor technology. We further characterize time-dependent local charge and current profiles within the nanoribbons, and we identify rearrangements of the current pathways through the nanoribbons due to the impurities. We finally study the behavior of the transients with ac driving which provides another way of identifying the lattice-symmetry breaking caused by the impurities.

Nanowire networks are promising memristive architectures for neuromorphic applications due to their connectivity and neurosynaptic-like behaviours. Here, we demonstrate a self-similar scaling of the conductance of networks and the junctions that comprise them. We show this behavior is an emergent property of any junction-dominated network. A particular class of junctions naturally leads to the emergence of conductance plateaus and a "winner-takes-all" conducting path that spans the entire network, and which we show corresponds to the lowest-energy connectivity path. These results point to the possibility of independently addressing memory or conductance states in complex systems and is expected to have important implications for neuromorphic devices based on reservoir computing., Comment: Additional supporting media will be available in other publishing venues

The need for higher agricultural productivity has demanded the intensive use of pesticides. However, their correct use depends on assessment methods that can accurately predict how well the pesticides' spraying covered the intended crop region. Some methods have been proposed in the literature, but their high cost and low portability harm their widespread use. This paper proposes and experimentally evaluates a new methodology based on the use of a smartphone-based mobile application, named DropLeaf. Experiments performed using DropLeaf showed that, in addition to its versatility, it can predict with high accuracy the pesticide spraying. DropLeaf is a five-fold image-processing methodology based on: (i) color space conversion, (ii) threshold noise removal, (iii) convolutional operations of dilation and erosion, (iv) detection of contour markers in the water-sensitive card, and, (v) identification of droplets via the marker-controlled watershed transformation. The authors performed successful experiments over two case studies, the first using a set of synthetic cards and the second using a real-world crop. The proposed tool can be broadly used by farmers equipped with conventional mobile phones, improving the use of pesticides with health, environmental and financial benefits., Comment: Paper to be published on the 33rd ACM/SIGAPP Symposium On Applied Computing (SAC), 2018

Precise tunability of electronic properties of 2D nanomaterials is a key goal of current research in this field of materials science. Chemical modification of layered transition metal dichalcogenides leads to the creation of heterostructures of low-dimensional variants of these materials. In particular, the effect of oxygen-containing plasma treatment on molybdenum disulfide (MoS$_2$) has long been thought to be detrimental to the electrical performance of the material. Here we show that the mobility and conductivity of MoS$_2$ can be precisely controlled and improved by systematic exposure to oxygen:argon plasma, and characterise the material utilising advanced spectroscopy and microscopy. Through complementary theoretical modelling which confirms conductivity enhancement, we uncover the role of a two-dimensional phase of molybdenum trioxide (2D-MoO$_3$) in improving the electronic behaviour of the material. Deduction of the beneficial role of MoO$_3$ will serve to open the field to new approaches with regard to the tunability of 2D semiconductors by their low-dimensional oxides in nano-modified heterostructures., Comment: 11 pages, 5 figures

Renowned for its sensitivity to detect the presence of numerous substances, graphene is an excellent chemical sensor. Unfortunately, which general features a dopant must have in order to enter the list of substances detectable by graphene are not exactly known. Here we demonstrate with a simple model calculation implemented in three different ways that one of such features is the symmetry properties of the impurity binding to graphene. In particular, we show that electronic scattering is suppressed when dopants are bound symmetrically to both graphene sub-lattices, giving rise to impurity invisibility. In contrast, dopants that affect the two sublattices asymmetrically are more strongly scattered and therefore the most likely candidates to being chemically sensed by graphene. Furthermore, we demonstrate that impurity invisibility is lifted with the introduction of a symmetry-breaking perturbation such as uniaxial strain. In this case, graphene with sublattice-symmetric dopants will function as efficient strain sensors. We argue that by classifying dopants through their bonding symmetry leads to a more efficient way of identifying suitable components for graphene-based sensors., Comment: 9 pages, 6 figures