Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 16
Encontrada(s) 1 página(s)

BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Fast One-dimensional Finite Element Approximation of Geophysical Measurements

  • Shahriari, M.
There exist a wide variety of geophysical prospection methods. In this work, we focus on resistivity methods. We categorize these resistivity prospection methods according to their acquisition location as (a) on the surface, such as the ones obtained using Controlled Source Electromagnetics (CSEM) and magnetotelluric, and (b) in the borehole, such as the ones obtained using Logging-While-Drilling (LWD) devices. LWD devices are useful both for reservoir characterization and geosteering purposes, which is the act of adjusting the tool direction to travel within a specific zone. When inverting LWD resistivity measurements, it is a common practice to consider a one-dimensional (1D) layered media to reduce the problem dimensionality using a Hankel transform. Using orthogonality of Bessel functions, we arrive at a system of Ordinary Differential Equations (ODEs); one system of ODEs per Hankel mode. The dimensionality of the resulting problem is referred to as 1.5D since the computational cost to resolve it is in between that needed to solve a 1D problem and a 2D problem. When material properties (namely, resistivity, permittivity, and magnetic permeability) are piecewise-constant, we can solve the resulting ODEs either (a) analytically, which leads to a so-called semi-analytic method after performing a numerical inverse Hankel transform or (b) numerically. Semi-analytic methods are faster, but they also have important limitations, for example, (a) the analytical solution can only account for piecewise constant material properties, and other resistivity distributions cannot be solved analytically, which prevents to accurately model, for example, an Oil-Water Transition (OWT) zone when fluids are considered to be immiscible; (b) a specific set of cumbersome formulas has to be derived for each physical process (e.g., electromagnetism, elasticity, etc.), anisotropy type, etc.; (c) analytical derivatives of specific models (e.g., cross-bedded formations, or derivatives with respect to the bed boundary positions) are often difficult to obtain and have not been published to the best of our knowledge. In view of the above limitations, we propose to solve our forward problems using a numerical solver. A traditional Finite Element Method (FEM) is slow, which makes it unfeasible for our application. To achieve high performance, we developed a multiscale FEM that pre-computes a set of optimal local basis functions that are used at all logging positions. The resulting method is slow when compared to a semi-analytic approach for a single logging position, but it becomes highly competitive for a large number of logging positions, as needed for LWD geosteering applications. Moreover, we can compute the derivatives using an adjoint state method at almost zero additional cost in time. We describe an adjoint-based formulation for computing the derivatives of the electromagnetic fields with respect to the bed boundary positions. The key idea to obtain this adjoint-based formulation is to separate the tangential and normal components of the field, and treat them differently. We then apply this method to a 1.5D borehole resistivity problem. Moreover, we compute the adjoint-state formulation to compute the derivative of the magnetic field with respect to the resistivity value of each layer. We verify the accuracy of our formulations via synthetic examples. When simulating borehole resistivity measurements in a reservoir, it is common to consider an Oil-Water Contact (OWC) planar interface. However, this consideration can lead to an unrealistic model since, in the presence of capillary pressure, the mix of two immiscible fluids (oil and water) often appears as an OWT zone. These transition zones may be large in the vertical direction (20 meters or above), and in context of geosteering, an efficient method to simulate an OWT zone can maximize the production of an oil reservoir. In this work, we prove that by using our proposed 1.5D numerical method, we can easily consider arbitrary resistivity distributions in the vertical direction, as it occurs in an OWT zone. Numerical results on synthetic examples demonstrate significant differences between the results recorded by a geosteering device when considering a realistic OWT zone vs. an OWC sharp interface. As an additional piece of work of this Ph.D. Dissertation, we explore the possibility of using a Deep Neural Network (DNN) to perform a rapid inversion of borehole resistivity measurements. Herein, we build a DNN that approximates the following inverse problem: given a set of borehole resistivity measurements, the DNN is designed to deliver a physically meaningful and data-consistent piecewise one-dimensional layered model of the surrounding subsurface. Once the DNN is built, the actual inversion of the field measurements is efficiently performed in real time. We illustrate the performance of a DNN designed to invert LWD measurements acquired on high-angle wells via synthetic examples.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Asymptotic behaviour of some nonlocal equations in mathematical biology and kinetic theory

  • Havva, Y.
We study the long-time behaviour of solutions to some partial differential equations arising in modeling of several biological and physical phenomena. In this work, the type of the equations we consider is mainly nonlocal, in the sense that they involve integral operators. %In order to check if the equation is valid at one point, we need an information about the region far from that point. Moreover, the equations we consider describe the time evolution of either some populations structured by several traits like age, elapsed-time and size or the distribution of the dynamical states of a single particle, depending on time, space and velocity. In the latter case, they are called kinetic equations. We are interested in showing quantitatively the asynchronous behaviour of interacting neuron populations which are composed of large and fully connected networks. Neurons undergo a charging period followed by a sudden discharge in the form of firing a spike. We consider two nonlinear models structured by the time elapsed since the last discharge and nonlinearity comes from the dependence of firing rate on the total neural activity at a time. In the second model, there is an addition of a fragmentation term to include the effect of the past activity of neurons by displaying adaptation and fatigue. With this addition, the equation shares many common properties with another class of integro-partial differential equations called the growth-fragmentation equation. This is the second type of equation we look at the convergence rate to a universal profile in a quantitative way. The growth-fragmentation equation describes a system of growing and dividing particles which may be used as a model for many processes in ecology, neuroscience, telecommunications and cell biology. We consider two types of fragmentation processes, namely mitosis and constant fragmentation and include nonconservative cases where eigenelements cannot be computed explicitly. We present quantitative exponential convergence speeds in the weighted total variation norm. Furthermore, we also study hypocoercivity of some space inhomogeneous linear kinetic equations including linear relaxation Boltzmann(linear BGK) and linear Boltzmann equations which are posed either on the torus or on the whole space with a confining potential. We prove exponential convergence in the torus or on the whole space with a potential growing quadratically at infinity. Moreover, for the weaker confining potentials (subquadratic) we present subgeometric convergence rates quantitatively. The physiologically structured population models and the space inhomogeneous linear kinetic equations we deal with in this work are well-studied from various aspects in the already-existing literature. We provide the references later. What differs from the past plentiful studies on the asymptotic behaviour of these equations is the techniques we use here. We consider a probabilistic approach which is first developed for studying ergodic properties of discrete-time Markov processes. The method is due to Doeblin and Harris; based on establishing a combination of a minorisation (irreducibility) and a geometric drift (Lyapunov) conditions for a Markovian process. This method gives a quantitative convergence speed and existence of a unique steady state even without having to calculate it explicitly. Application of Harris's Theorem into the aforementioned partial differential equations to study the long-time behaviour of solutions is the core of this thesis., la Caixa Foundation
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Stochastic processes for anomalous diffusion

  • Molina-Garcia, D.
Anomalous diffusion is a diffusion process which Mean Square Displacement (MSD) is not a linear funtion of time, what is known as normal diffusion. When the relation is faster than linear, it is called superdiffusion and when it is slower, subdiffusion. Physically, the MSD is a measure of the deviation of the position of the particles over time. It can be thought as the amount of space the particles have explored in the system. On the one hand, anomalous diffusion has been shown to appear extensively in nature and, consecuently, scientists have developed several and different models that can effectively reproduce it. However, the underlying physics of a plethora of experiments is still not well-understood. This is the case of the motion of mRNA molecules inside living E. coli cells, where stochastic processes as the continuous-time random walk can explain non-ergodicity but an alternative like the fractional Brownian motion is needed to reproduce p-variation. We find that a family of stochastic processes known as generalised grey Brownian motion can fit correctly that observation. In addition, we also use an explicit time-dependent factor to model non-stationarity, usually referred to aging in the specialized literature. In agreement with our computational results, we were able to obtain analytical expressions for a list of observables too, including temporal and ensemble-average MSD, Ergodicity Breaking parameter, one-point one-time probability density function and p-variation. On the other hand, many experiments show a characteristic crossover from anomalous to normal diffusion. For example, it happens in viscoelastic systems such as the motion of lipid molecules in lipid bilayer membranes. We studied the motion of particles driven by tempered fractional Gaussian noise which power-law correlations present a cutoff at some mesoscopic time scale. Deriving analytical expressions of the MSD for the overdamped Langevin equation and the fractional Langevin equation, we find that when the truncation is strongly done, the mentioned crossover appears. When the truncation is done by a weak power-law truncation, we also got a different crossover behaviour from faster to slower superdiffusion and from slower to faster subdiffusion. We were also interested in another process defined through a tempering directly done in the fractional Brownion motion definition. It is known as tempered fractional Brownian motion and, surprisingly, it does not arrive to the same behaviours than our models. Instead, at long times it exhibits localization as Ornstein-Uhlenbeck. We compare both of them. When the derivative of this tempered fractional Brownian motion is used in the fractional Langevin equation, it leads to ballistic diffusion at long times. In the last part, we were interested in the state of the art in spatial neutral theory of Ecology, which problems sound familiar to experts in Statistical Physics. In fact, ecosystems display a complex spatial organization that ecologists have tried to characterize by observing patterns of biodiversity at different spatial scales. Linking those measures with the causes that originate them is arguably the central problem in Ecology. Ecological neutral theory, which underscores the role of stochastic demographic fluctuations and neglects deterministic effects stemming from fitness differences, has predicted the empirical patterns in communities of competing species. We study non-trivial scaling laws arising at the critical dimension (2D) of spatial neutral models, which are poorly understood. We conclude by discussing models that support non-neutral features.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Advanced Mathematical Modelling of Pancreatic β-Cells

  • Marinelli, I.
Insulin-secreting pancreatic $\beta$-cells are responsible for maintaining the whole body glucose homeostasis. Dysfunction or loss of $\beta$-cell mass results in impaired insulin secretion and, in some cases, diabetes. Many of the factors that influence $\beta$-cell function or insulin exocytosis, however, are not fully understood. To support the investigation, mathematical models have been developed and used to design experiments. In this dissertation, we present the Integrated Oscillator Model (IOM) that is one of the mathematical models used for the investigation of the mechanism behind the bursting activity that underlies intracellular Ca$^{2+}$ oscillations and pulsatile insulin secretion. The IOM describes the interaction of the cellular electrical activity and intracellular Ca$^{2+}$ with glucose metabolism via numerous feedforward and feedback pathways. These interactions, in turn, produce metabolic oscillations with a sawtooth or pulsatile time course, reflecting different oscillation mechanisms. We determine conditions favorable to each type of oscillations, and show that the model accounts for key experimental findings of $\beta$-cell activity. We propose several extensions of the model to include all the main elements involved in the insulin secretion. The latest and most sophisticated model describes the complex metabolism in the mitochondria and the several biological processes in the insulin exocytosis cascade. The model, also, captures the changes in the $\beta$-cell activity and the resulting amount of secreted insulin in response to different concentrations of glucose in the blood. The model predictions, in agreement with findings reported in the experimental literature, show an increase of insulin secretion when the glucose level is high and a basal-low insulin concentration when the glucose level decreases. Finally, we use the new model to simulate the interaction among $\beta$-cells (through gap junction) within the same islet. The simulations show that the electrical coupling is sufficient to synchronize the $\beta$-cells within an islet. We also show that the amplitude of the oscillations in the insulin secretion rate is bigger when the $\beta$-cells synchronize. This suggests a more efficient secretion of insulin in the bloodstream when the cells burst in unison, as it has been observed experimentally.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

A General Framework for Prediction in Generalized Additive Models

  • Carballo, A.
Smoothing techniques have become one of the most popular modelling approaches in the unidimensional and multidimensional setting. However, out-of-sample prediction in the context of smoothing models is still an open problem that can significantly widen the use of these models in many areas of knowledge. The objective of this thesis is to propose a general framework for prediction in penalized regression, particularly in the P-splines context. To that end, Chapter 1 includes a review of the different proposals available in the litera- ture, and results useful and necessary along the document, the formulation of a P-spline model and its reparameterization as a mixed model. In Chapter 2, we generalize the approach given by Currie et al. (2004) to predict with any regression basis and quadratic penalty. For the particular case of penalties based on differences between adjacent coefficients, we reparameterize the extended P-spline model as a mixed model and we prove that the fit remains the same as the result we obtain only fitting the data and show the crucial role of the penalty order, since it determines the shape of the prediction. Moreover, we adapt available methods in contexts such as mixed models (Gilmour et al. 2004) or global optimization (Sacks et al. 1989) to predict in the context of penalized regression and prove their equivalence for the particular case of P- splines. An extensive section of examples illustrates the application of the methodology. We use three real datasets with particular characteristics: one of them on aboveground biomass allow us to show that prediction can also be performed to the left of the data; other of them, on monthly sulphur dioxide levels, illustrates how prediction can take into account the temporal trends and seasonal effects by using the smooth modulation model based on P-splines suggested by Eilers et al. (2008); and other, on yearly sea level, shows that prediction can also be carried out in the case of correlated errors. We also introduce the concept of “memory of a P-spline” as a tool to know how much of the known information we use to predict new values. In the third chapter, we propose a general framework for prediction in multidimensional smoothing, we extend the proposal of Currie et al. (2004) to predict when more than one covariate is extended. The extension of the prediction method to the multidimensional case is not straightforward in the sense that, in this context, the fit changes when the fit and the prediction are carried out simultaneously. To overcome this problem we propose an easy but elegant solution, based on Lagrange multipliers. The first part of the chapter is dedicated to show how out-of-sample predictions can be carried out in the context of multidimensional P-splines and the properties satisfied, under certain conditions, by the coefficients that determine the prediction. We also propose the use of restrictions to maintain the fit, and in general, to incorporate any known information about the prediction. The second part of the chapter is dedicated to extend the methodology to the smooth mixed model framework. It is known that when a P-spline model is reparameterized as a mixed model, the structure of the coefficients is lost, that is, they are not ordered according to the position of the knots. This fact is not relevant when we fit the data, but if we predict and impose restrictions over the coefficients, we need to differentiate between the coefficients that determine the fit and the coefficients that determine the prediction. In order to do that, we define a particular transformation matrix that preserves the original model matrices. The prediction method and the use of restrictions is illustrated with one real data example on log mortality rates of US male population. We show how to solve the crossover problem of adjacent ages when mortality tables are forecasted and compare the results with the well-known method developed in Delwarde et al. (2007). The research in Chapter 4, is motivated by the need to extend the prediction methodol- ogy in the multidimensional case to more flexible models, the so-called Smooth-ANOVA models, which allow us to include interaction terms that can be decomposed as a sum of several smooth functions. The construction of these models through B-splines basis suffer from identifiability problems. There are several alternatives to solve this problem, here we follow Lee and Durb ́an (2011) and reparameterize them as mixed models. The first two sections of the chapter are dedicated to introduce the Smooth-ANOVA models and to show how out-of-sample prediction can be carried out in these models. We illustrate the prediction with Smooth-ANOVA models reanalyzing the dataset on aboveground biomass. Now, the Smooth-ANOVA model allows us to represent the smooth function as the sum of a smooth function for the height, a smooth function for the diameter of a tree, and a smooth term for the height-diameter interaction. At the end of this chapter, we provide a simulation study in order to evaluate the accuracy of the 2D interaction P-spline models and Smooth-ANOVA models, with and without imposing invariance of the fit. From the results of the simulation study, we conclude that in most situations the constrained S-ANOVA model behaves better in the fit and out-of-sample predictions,however, results depend on the simulation scenario and on the number of dimensions in which the prediction is carried out (one or both dimensions). In the fifth chapter we generalize the developed methodology for generalized linear mod- els (GLMs) in the context of P-splines (P-GLMs) and mixed models (P-GLMMs). In both frameworks, the coefficients and parameters estimation procedures involve nonlinear equations. To solve them iterative algorithms based on the Newton-Raphson methods are used, regardless of the estimation criterion used (for instance, in the GLMMs context we can maximize the residual maximum likelihood (REML) or an approximate REML (based on Laplace approximation)). These iterative algorithms are based on a working normal theory model or a set of pseudodata and weights. Based on this idea, we ex- tend the Penalized Quasilikelihood method (PQL) to fit and predict simultaneously in the context of GLMM. We highlight that, in the context of mixed models (even in the univariate case), to maintain the fit a transformation that preserves the original model matrices has to be used, since different transformations deal with different working vec- tors and therefore with different solutions. We also show how restrictions can be imposed in P-GLMs and P-GLMMs models. To illustrate the procedures we use a real dataset to predict deaths due to respiratory disease through 2D interaction P-splines and S-ANOVA models (both with and without the restriction the fit has to be maintained). Finally, Chapter 6 is devoted to summarize the main conclusions and pose a list of future lines of work.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Vortex Filament Equation for some Regular Polygonal Curves

  • Kumar, S.
One of the most interesting phenomena in fluid literature is the occurrence and evolution of vortex filaments. Some of their examples in the real world are smoke rings, whirlpools, and tornadoes. For an ideal fluid, there have been several models and governing equations to describe this evolution; however, due to its simplicity and geometric properties, the vortex filament equation (VFE) has recently gained attention. As an approximation of the dynamics of a vortex filament, the equation first appeared in the work of Da Rios at the beginning of the twentieth century. This model is usually known as the local induction approximation (LIA). In this work, we examine the evolution of VFE for regular polygonal curves both from a numerical and theoretical point of view in the Euclidean as well as hyperbolic geometry. In the first part of the thesis, we observe the evolution of the Vortex Filament equation taking $M$-sided regular polygons with nonzero torsion as initial data in the Euclidean space. Using algebraic techniques, backed by numerical simulations, we show that the solutions are polygons at rational times, as in the zero-torsion case. However, unlike in that case, the evolution is not periodic in time; moreover, the multifractal trajectory of the point X(0, t) is not planar and appears to be a helix for large times. These new solutions of VFE can be used to illustrate numerically that the smooth solutions of VFE given by helices and straight lines share the same instability as the one already established for circles. This is accomplished by showing the existence of variants of the so-called Riemann’s non-differentiable function that are as close to smooth curves as desired when measured in the right topology. This topology is motivated by some recent results on the well-posedness of VFE, which prove that the self-similar solutions of VFE have finite renormalized energy. In the rest of the work, we delve into the hyperbolic setting and examine the evolution of VFE for a planar $l$-polygon, i.e., a regular planar polygon in the Minkowski 3-space $\mathbb{R}^{1,2}$. Unlike in the Euclidean case, a planar $l$-polygon is open which makes the problem more challenging from a numerical point of view. After trying several numerical methods, we conclude that a finite-difference discretization in space combined with an explicit Runge--Kutta method in time, gives the best numerical results both in terms of efficiency and accuracy. On the other hand, using theoretical arguments, we recover the evolution algebraically, and thus, we show the agreement between the two approaches. During the numerical evolution, it has been observed that the trajectory of a corner is multifractal and as the parameter $l$ goes to zero, it converges to the Riemann’s non-differentiable function. Furthermore, as in the Euclidean case, we provide strong numerical evidence to show that at infinitesimal times, the evolution of VFE for a planar $l$-polygon as an initial datum can be described as a superposition of several one-corner initial data. As a consequence, not only we can compute the speed of the center of mass of the planar $l$-polygon theoretically, the relationship also reveals important properties of the trajectory of its corners which we compare with its equivalent in the Euclidean case. Finally, a nonzero torsion in the hyperbolic case, yields two different kinds of helical polygonal curves, however, with the numerical and theoretical techniques developed so far, we are able to address them as well. This remains part of the future work of the thesis.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

A geometric and physical study of Riemann's non-differentiable function

  • Eceizabarrena, D.
Riemann's non-differentiable function is a classic example of a continuous but almost nowhere differentiable function, whose analytic regularity has been widely studied since it was proposed in the second half of the 19th century. But recently, strong evidence has been found that one of its generalisation to the complex plane can be regarded as the trajectory of a particle in the context of the evolution of vortex filaments. It can, thus, be given a physical and geometric interpretation, and many questions arise in these settings accordingly. It is the purpose of this dissertation to describe, study and prove geometrically and physically motivated properties of Riemann's non-differentiable function. In this direction, a geometric analysis of concepts such as the Hausdorff dimension, geometric differentiability and tangents will be carried out, and the relationship with physical phenomena such as the Talbot effect, turbulence, intermittency and multifractality will be explained., Ministerio de Educación, Cultura y Deporte - FPU15/03078
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

The Schrödinger equation and Uncertainty Principles

  • Aguirre, M.
The main task of this thesis is the analysis of the initial data u0 of Schrödinger’s initial value problem in order to determine certain properties of its dynamical evolution. First we consider the elliptic Schrödinger problem in its perturbative form. The idea is to find lower bounds for the solution giving conditions at time t = 0 together with a size condition on the potential. After analyzing the elliptic case we give a similar result for the hyperbolic Schrödinger operator. Next we focus on the free particle case, this is, the case where no potential is involved. The goal here is to quantify the L2 norm of the solution in a space-time cylinder. Following the same idea as before we want to find conditions at time t = 0 to ensure this. To carry out this task we define the Σδ space where δ is a parameter on the interval (0,1]. We see that if u0 belongs in this space then so does its evolution in time and use this fact to give lower bounds for the L2 norm of the solution. For δ = 1 we give a different approach and make use of the Virial Theorem. We will see that this case has particular properties. Finally we study dynamical uncertainty principles derived from the previous study. The key point will be to write the solution as u = ρeiθ, where ρ and θ are real functions. Thus we give uncertainty principles in terms of these functions and find explicit expressions for them so that u becomes a minimizer of the problem.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Generalized Poincaré-Sobolev inequalities

  • Martínez-Perales, J.
Poincaré-Sobolev inequalities are very powerful tools in mathematical analysis which have been extensively used for the study of differential equations and their validity is intimately related with the geometry of the underlying space. In particular, and since their applicability as part of the Moser iteration method, their weighted counterparts are of interest for applications. The goal of this dissertation is to present a self-contained study of Poincaré-Sobolev inequalities, weights and the combination of both under the framework of the abstract theory of generalized Poincaré-Sobolev inequalities. To this end, the basic aspects on the theory of Poincaré-Sobolev inequalities and the theory of Muckenhoupt weights is presented. In relation with these, the class of functions with bounded mean oscillations is studied, together with a new characterization of it through some boundedness properties of commutators of fractional integrals. A unified study of classical and fractional weighted Poincaré-Sobolev inequalities, as well as a study of Muckenhoupt weights in relation with functions with bounded mean oscillations is carried out by using new self-improving techniques., BERC 2014-2017, SEV-2013-0323
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Reflection maps

  • Peñafort, G.
Given a reflection group G acting on a complex vector space V , a reflection map is the composition of an embedding X → V with the quotient map V → Cp of G. We show how these maps, which can highly singular, may be studied in terms of the group action. We give obstructions to A-stability and A-finiteness of reflection maps and produce, in the unobstructed cases, infinite families of finitely determined map-germs of any corank. We relate these maps to conjectures of Lê, Mond and Ruas.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Mathematical models for glioma growth and migration inside the brain

  • Conte, M.
Gliomas are the most prevalent, aggressive, and invasive subtype of primary brain tumors, characterized by rapid cell proliferation and great infiltration capacity. De- spite the advances of clinical research, these tumors are often resistant to treatment, the median survival ranges between 9 and 12 months, and recurrence is the main cause of mortality. Glioma migration and invasion into the brain tissue is a complex phenomenon and little is still known about the underlying mechanisms that lead to tumor progression. In this thesis, we propose several mathematical models studying various aspects of glioma progression in relation to the microscopic and macroscopic scales charac- terizing this process. Exploiting the inherently multiscale nature of glioma evolution allows to define models based on dynamical systems, kinetic equations, and macro- scopic PDEs with different roles depending on the considered phenomena. The in- tegration of biological and clinical data with the mathematical models is one of the key objectives of this thesis. The experimental data at hand are obtained from mag- netic resonance and diffusion tensor images of the human brain and from in-vivo im- munofluorescence analysis of protein distributions in Drosophila, a reliable model for the study of glioblastoma dynamics. We analyze the anisotropic characteristics of the brain tissue, using the diffusion tensor data, and the influence of the fiber structures on tumor cell dynamics. We show how the fiber network directs cell migration along preferential paths, reproducing the branched and heterogeneous patterns typical of glioma evolution, and how multi- modal treatments can reduce this behavior. We study the interdependency of microenvironmental acidity and vasculature in tumor angiogenesis, defining a model capable of reproducing their influence on the emergence of phenotypic heterogeneity and hypoxia-related features (like necrosis) typical of glioma progression. This study enables the testing of a necrosis-based tumor grading and the investigation of multi-modal therapies with anti-angiogenic effects. We investigated the role of cell protrusions from a non-local perspective. We ex- plore their influence on the contact guidance phenomenon and on the emergence of collaborative or competitive effects between two cues driving cell velocity changes. Using the experimental analysis of protein distributions, we evaluate cell protru- sion relationship with integrins and proteases as leading mechanisms of glioblastoma progression. We show how the biochemical and biomechanical interactions of these agents result in the emergence of tumor propagation fronts, which can feature a dy- namical and heterogenous evolution in relation to environmental changes., European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 713673. ”la Caixa” Foundation (ID 100010434), with fellowship code LCF/BQ/IN17/11620056.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Algorithms for Large Orienteering Problems

  • Kobeaga, G.
In this thesis, we have developed algorithms to solve large-scale Orienteering Problems. The Orienteering Problem is a combinatorial optimization problem were given a weighted complete graph with vertex profits and a maximum distance constraint, the goal is to find the simple cycle which maximizes the sum of the profits of the visited vertices. To solve the Orienteering Problem, we have developed an evolutionary algorithm and an Branch-and-Cut algorithm. One of the key characteristics of the evolutionary algorithm is to work with unfeasible solutions. From the point of view of genetic operators, the main contribution has been the development of the Edge Recombination Crossover for the Orienteering Problem, which in a wider context it is also valid for any cycle problem. Another contribution has been the developed local search to handle large problems. The Branch-and-Cut algorithm includes new contributions in the separation algorithms of inequalities stemming from the cycle problem, in the separation loop, in the variables pricing, and in the calculation of the lower and upper bounds of the problem. At the same time, we have generalized for cycle problems the support graph shrinking techniques and procedures to speed up the exact separation algorithms for subcycle elimination constraints. The experiments carried out in large-sized instances, up to 7393 nodes, show that both algorithms achieve outstanding results, both in terms of the quality of solutions and in terms of the execution time., BERC.2014-2017 SEV-2013-0323 PID2019-104933GB-I00 MTM2015-65317-P
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Efficient meta-heuristics for spacecraft trajectory optimization

  • Shirazi, A.
Meta-heuristics has a long tradition in computer science. During the past few years, different types of meta-heuristics, specially evolutionary algorithms got noticeable attention in dealing with real-world optimization problems. Recent advances in this field along with rapid development of high processing computers, make it possible to tackle various engineering optimization problems with relative ease, omitting the barrier of unknown global optimal solutions due to the complexity of the problems. Following this rapid advancements, scientific communities shifted their attention towards the development of novel algorithms and techniques to satisfy their need in optimization. Among different research areas, astrodynamics and space engineering witnessed many trends in evolutionary algorithms for various types of problems. By having a look at the amount of publications regarding the development of meta-heuristics in aerospace sciences, it can be seen that a high amount of efforts are dedicated to develop novel stochastic techniques and more specifically, innovative evolutionary algorithms on a variety of subjects. In the past decade, one of the challenging problems in space engineering, which is tackled mainly by novel evolutionary algorithms by the researchers in the aerospace community is spacecraft trajectory optimization. Spacecraft trajectory optimization problem can be simply described as the discovery of a space trajectory for satellites and space vehicles that satisfies some criteria. While a space vehicle travels in space to reach a destination, either around the Earth or any other celestial body, it is crucial to maintain or change its flight path precisely to reach the desired final destination. Such travels between space orbits, called orbital maneuvers, need to be accomplished, while minimizing some objectives such as fuel consumption or the transfer time. In the engineering point of view, spacecraft trajectory optimization can be described as a black-box optimization problem, which can be constrained or unconstrained, depending on the formulation of the problem. In order to clarify the main motivation of the research in this thesis, first, it is necessary to discuss the status of the current trends in the development of evolutionary algorithms and tackling spacecraft trajectory optimization problems. Over the past decade, numerous research are dedicated to these subjects, mainly from two groups of scientific communities. The first group is the space engineering community. Having an overall look into the publications confirms that the focus in the developed methods in this group is mainly regarding the mathematical modeling and numerical approaches in dealing with spacecraft trajectory optimization problems. The majority of the strategies interact with mixed concepts of semi-analytical methods, discretization, interpolation and approximation techniques. When it comes to optimization, usually traditional algorithms are utilized and less attention is paid to the algorithm development. In some cases, researchers tried to tune the algorithms and make them more efficient. However, their efforts are mainly based on try-and-error and repetitions rather than analyzing the landscape of the optimization problem. The second group is the computer science community. Unlike the first group, the majority of the efforts in the research from this group has been dedicated to algorithm development, rather than developing novel techniques and approaches in trajectory optimization such as interpolation and approximation techniques. Research in this group generally ends in very efficient and robust optimization algorithms with high performance. However, they failed to put their algorithms in challenge with complex real-world optimization problems, with novel ideas as their model and approach. Instead, usually the standard optimization benchmark problems are selected to verify the algorithm performance. In particular, when it comes to solve a spacecraft trajectory optimization problem, this group mainly treats the problem as a black-box with not much concentration on the mathematical model or the approximation techniques. Taking into account the two aforementioned research perspectives, it can be seen that there is a missing link between these two schemes in dealing with spacecraft trajectory optimization problems. On one hand, we can see noticeable advances in mathematical models and approximation techniques on this subject, but with no efforts on the optimization algorithms. On the other hand, we have newly developed evolutionary algorithms for black-box optimization problems, which do not take advantage of novel approaches to increase the efficiency of the optimization process. In other words, there seems to be a missing connection between the characteristics of the problem in spacecraft trajectory optimization, which controls the shape of the solution domain, and the algorithm components, which controls the efficiency of the optimization process. This missing connection motivated us in developing efficient meta-heuristics for solving spacecraft trajectory optimization problems. By having the knowledge about the type of space mission, the features of the orbital maneuver, the mathematical modeling of the system dynamics, and the features of the employed approximation techniques, it is possible to adapt the performance of the algorithms. Knowing these features of the spacecraft trajectory optimization problem, the shape of the solution domain can be realized. In other words, it is possible to see how sensitive the problem is relative to each of its feature. This information can be used to develop efficient optimization algorithms with adaptive mechanisms, which take advantage of the features of the problem to conduct the optimization process toward better solutions. Such flexible adaptiveness, makes the algorithm robust to any changes of the space mission features. Therefore, within the perspective of space system design, the developed algorithms will be useful tools for obtaining optimal or near-optimal transfer trajectories within the conceptual and preliminary design of a spacecraft for a space mission. Having this motivation, the main goal in this research was the development of efficient meta-heuristics for spacecraft trajectory optimization. Regarding the type of the problem, we focused on space rendezvous problems, which covers the majority of orbital maneuvers, including long-range and short-range space rendezvous. Also, regarding the meta-heuristics, we concentrated mainly on evolutionary algorithms based on probabilistic modeling and hybridization. Following the research, two algorithms have been developed. First, a hybrid self adaptive evolutionary algorithm has been developed for multi-impulse long-range space rendezvous problems. The algorithm is a hybrid method, combined with auto-tuning techniques and an individual refinement procedure based on probabilistic distribution. Then, for the short-range space rendezvous trajectory optimization problems, an estimation of distribution algorithm with feasibility conserving mechanisms for constrained continuous optimization is developed. The proposed mechanisms implement seeding, learning and mapping methods within the optimization process. They include mixtures of probabilistic models, outlier detection algorithms and some heuristic techniques within the mapping process. Parallel to the development of algorithms, a simulation software is also developed as a complementary application. This tool is designed for visualization of the obtained results from the experiments in this research. It has been used mainly to obtain high-quality illustrations while simulating the trajectory of the spacecraft within the orbital maneuvers., La Caixa TIN2016-78365R PID2019-1064536A-I00 Basque Government consolidated groups 2019-2021 IT1244-19
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

From habitat to management: a simulation framework for improving statistical methods in fisheries science

  • Citores Martínez, L.
Monte Carlo simulation consists of computer experiments that involve creating data by pseudo-random sampling and has shown to be a powerful tool for studying the performance of statistical methods. In this thesis Monte Carlo simulation was used to improve statistical methodology related to three different fields of fisheries science: 1) Species distribution models (SDM) field, where focusing on regression-based models, we proposed using shape-constrained generalised additive models (SC-GAMs) to build SDMs in agreement with the ecological niche theory imposing concavity constraints in the linear predictor scale and testing their performance trough Monte Carlo simulation, 2) stock assessment models field, where uncertainty estimation methods for statistical catch-at-age models with non-parametric effects on fishing mortality were compared through simulation in addition to the comparison of two available stock assessment models to an ad-hoc Bayesian approach, and 3) management advice field, where a full-feedback management strategy evaluation (MSE) was developed for the sardine in the Bay of Biscay, incorporating the official Stoch Synthesis assessment model within the Monte Carlo simulation, and introducing gradually different sources of uncertainty such as process, parameter and observation error in order to study their effect in management advice. Monte Carlo simulation was an adequate tool to accomplish the objectives of this thesis that definitely could not have been achieved using only available real data or analytical solutions.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Contributions to Time Series Classification: Meta-Learning and Explainability

  • Abanda, A.
This thesis includes 3 contributions of different types to the area of supervised time series classification, a growing field of research due to the amount of time series collected daily in a wide variety of domains. In this context, the number of methods available for classifying time series is increasing, and the classifiers are becoming more and more competitive and varied. Thus, the first contribution of the thesis consists of proposing a taxonomy of distance-based time series classifiers, where an exhaustive review of the existing methods and their computational costs is made. Moreover, from the point of view of a non-expert user (even from that of an expert), choosing a suitable classifier for a given problem is a difficult task. The second contribution, therefore, deals with the recommendation of time series classifiers, for which we will use a meta-learning approach. Finally, the third contribution consists of proposing a method to explain the prediction of time series classifiers, in which we calculate the relevance of each region of a series in the prediction. This method of explanation is based on perturbations, for which we will consider specific and realistic transformations for the time series., BES-2016-076890
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Time Dynamics in Quantum Field Theory Systems

  • LIll, S.
In this doctoral thesis, we develop and investigate new mathematical tools that are intended to allow for a rigorous description of non–perturbative quantum field theory (QFT) dynamics. Here, the term QFT is to be understood as describing a quantum system with particle creation and annihilation that can, but does not need to, comply with special relativity. The tools aim at cases where a formal Hamiltonian exists but is ill–defined., Wilhelm Schuler-Stiftung Tübingen, DAAD (Deutscher Akademischer Austauschdienst)