Unification of the probe and singular sources methods for the inverse boundary value problem by the no-response test

In this article, we use the no-response test idea, introduced in Luke and Potthast (2003) and Potthast (Preprint) and the inverse obstacle problem, to identify the interface of the discontinuity of the coefficient gamma of the equation del (.) gamma(x)del + c(x) with piecewise regular gamma and bounded function c(x). We use infinitely many Cauchy data as measurement and give a reconstructive method to localize the interface. We will base this multiwave version of the no-response test on two different proofs. The first one contains a pointwise estimate as used by the singular sources method. The second one is built on an energy (or an integral) estimate which is the basis of the probe method. As a conclusion of this, the probe and the singular sources methods are equivalent regarding their convergence and the no-response test can be seen as a unified framework for these methods. As a further contribution, we provide a formula to reconstruct the values of the jump of gamma(x), x is an element of partial derivative D at the boundary. A second consequence of this formula is that the blow-up rate of the indicator functions of the probe and singular sources methods at the interface is given by the order of the singularity of the fundamental solution.

Ein inverses Rückstreuproblem der elektrischen Impedanztomographie

Die vorliegende Arbeit untersucht das inverse Hindernisproblem der zweidimensionalen elektrischen Impedanztomographie (EIT) mit Rückstreudaten. Wir präsentieren und analysieren das mathematische Modell für Rückstreudaten, diskutieren das inverse Problem für einen einzelnen isolierenden oder perfekt leitenden Einschluss und stellen zwei Rekonstruktionsverfahren für das inverse Hindernisproblem mit Rückstreudaten vor. Ziel des inversen Hindernisproblems der EIT ist es, Inhomogenitäten (sogenannte Einschlüsse) der elektrischen Leitfähigkeit eines Körpers aus Strom-Spannungs-Messungen an der Körperoberfläche zu identifizieren. Für die Messung von Rückstreudaten ist dafür nur ein Paar aus an der Körperoberfläche nahe zueinander angebrachten Elektroden nötig, das zur Datenerfassung auf der Oberfläche entlang bewegt wird. Wir stellen ein mathematisches Modell für Rückstreudaten vor und zeigen, dass Rückstreudaten die Randwerte einer außerhalb der Einschlüsse holomorphen Funktion sind. Auf dieser Grundlage entwickeln wir das Konzept des konvexen Rückstreuträgers: Der konvexe Rückstreuträger ist eine Teilmenge der konvexen Hülle der Einschlüsse und kann daher zu deren Auffindung dienen. Wir stellen einen Algorithmus zur Berechnung des konvexen Rückstreuträgers vor und demonstrieren ihn an numerischen Beispielen. Ferner zeigen wir, dass ein einzelner isolierender Einschluss anhand seiner Rückstreudaten eindeutig identifizierbar ist. Der Beweis dazu beruht auf dem Riemann'schen Abbildungssatz für zweifach zusammenhängende Gebiete und dient als Grundlage für einen Rekonstruktionsalgorithmus, dessen Leistungsfähigkeit wir an verschiedenen Beispielen demonstrieren. Ein perfekt leitender Einschluss ist hingegen nicht immer aus seinen Rückstreudaten rekonstruierbar. Wir diskutieren, in welchen Fällen die eindeutige Identifizierung fehlschlägt und zeigen Beispiele für unterschiedliche perfekt leitende Einschlüsse mit gleichen Rückstreudaten.

Analysis of Self-Organization

The dissertation is devoted to the study of problems in calculus of variation, free boundary problems and gradient flows with respect to the Wasserstein metric. More concretely, we consider the problem of characterizing the regularity of minimizers to a certain interaction energy. Minimizers of the interaction energy have a somewhat surprising relationship with solutions to obstacle problems. Here we prove and exploit this relationship to obtain novel regularity results. Another problem we tackle is describing the asymptotic behavior of the Cahn-Hilliard equation with degenerate mobility. By framing the Cahn-Hilliard equation with degenerate mobility as a gradient flow in Wasserstein metric, in one space dimension, we prove its convergence to a degenerate parabolic equation under the framework recently developed by Sandier-Serfaty.

Two-dimensional supersonic nonlinear Schrodinger flow past an extended obstacle

Supersonic flow of a superfluid past a slender impenetrable macroscopic obstacle is studied in the framework of the two-dimensional (2D) defocusing nonlinear Schroumldinger (NLS) equation. This problem is of fundamental importance as a dispersive analog of the corresponding classical gas-dynamics problem. Assuming the oncoming flow speed is sufficiently high, we asymptotically reduce the original boundary-value problem for a steady flow past a slender body to the one-dimensional dispersive piston problem described by the nonstationary NLS equation, in which the role of time is played by the stretched x coordinate and the piston motion curve is defined by the spatial body profile. Two steady oblique spatial dispersive shock waves (DSWs) spreading from the pointed ends of the body are generated in both half planes. These are described analytically by constructing appropriate exact solutions of the Whitham modulation equations for the front DSW and by using a generalized Bohr-Sommerfeld quantization rule for the oblique dark soliton fan in the rear DSW. We propose an extension of the traditional modulation description of DSWs to include the linear ""ship-wave"" pattern forming outside the nonlinear modulation region of the front DSW. Our analytic results are supported by direct 2D unsteady numerical simulations and are relevant to recent experiments on Bose-Einstein condensates freely expanding past obstacles.

Vision based obstacle detection for all-terrain robots

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

LADAR based mapping and obstacle detection system for service robots

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

A Bayesian network approach to the database serch problem in criminal proceedings

Background The 'database search problem', that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method's graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication.

Overcoming the problem of loss-in-capacity of calcium oxide in CO2 capture

Calcium oxide has been identified to be one of the best candidates for CO2 capture in zero-emission power-generation systems. However, it suffers a well-known problem of loss-in-capacity (i.e., its capacity of CO2 capture decreases after it undergoes cycles of carbonation/decarbonation). This problem is a potential obstacle to the adoption of the new technologies. This paper proposes a method of fabricating a CaO-based adsorbent without the problem of loss-in-capacity. An adsorbent was fabricated using the method and tested on a thermogravimetric analyzer. It was shown that the sorbent attained a utilization efficiency of more than 90% after 9 cycles of carbonation/decarbonation.

Nonlinear integral equation methods for the reconstruction of an acoustically sound-soft obstacle

The problem considered is that of determining the shape of a planar acoustically sound-soft obstacle from knowledge of the far-field pattern for one time-harmonic incident field. Two methods, which are based on the solution of a pair of integral equations representing the incoming wave and the far-field pattern, respectively, are proposed and investigated for finding the unknown boundary. Numerical resultsare included which show that the methods give accurate numerical approximations in relatively few iterations.

Reconstruction of an acoustically sound-soft obstacle from one incident field and the far field pattern

The problem considered is that of determining the shape of a plane acoustically sound-soft obstacle from the knowledge of the far-field pattern for one time-harmonic incident field. An iterative procedure is proposed based on two boundary integrals representing the incident field and the far-field pattern, respectively. Numerical examples are included which show that the procedure gives accurate numerical approximations in relatively few iterations.

Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.

Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.

Ecological Literacy And Beyond: Problem-based Learning For Future Professionals.

Ecological science contributes to solving a broad range of environmental problems. However, lack of ecological literacy in practice often limits application of this knowledge. In this paper, we highlight a critical but often overlooked demand on ecological literacy: to enable professionals of various careers to apply scientific knowledge when faced with environmental problems. Current university courses on ecology often fail to persuade students that ecological science provides important tools for environmental problem solving. We propose problem-based learning to improve the understanding of ecological science and its usefulness for real-world environmental issues that professionals in careers as diverse as engineering, public health, architecture, social sciences, or management will address. Courses should set clear learning objectives for cognitive skills they expect students to acquire. Thus, professionals in different fields will be enabled to improve environmental decision-making processes and to participate effectively in multidisciplinary work groups charged with tackling environmental issues.

Obstacle Crossing With Dual Tasking Is A Danger For Individuals With Alzheimer's Disease And For Healthy Older People.

The aim of this study was to analyze the effects of dual tasking on obstacle crossing during walking by individuals with Alzheimer's disease (AD) and by healthy older people. Thirty four elderly individuals (16 healthy subjects and 18 individuals with AD) were recruited to participate in this study. Three AD individuals and one control participant were excluded due to exclusion criteria. The participants were instructed to walk barefoot at their own speed along an 8 m long pathway. Each participant performed five trials for each condition (unobstructed walking, unobstructed walking with dual tasking, and obstacle crossing during walking with dual tasking). The trials were completely randomized for each participant. The mid-pathway stride was measured in the unobstructed walking trials and the stride that occurred during the obstacle avoidance was measured in the trials that involved obstacle crossing. The behavior of the healthy elderly subjects and individuals with AD was similar for obstacle crossing during walking with dual tasking. Both groups used the posture first strategy to prioritize stability and showed decreased attention to executive tasking while walking. Additionally, AD had a strong influence on the modifications that are made by the elderly while walking under different walking conditions.

A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.

O difícil acesso a serviços de média complexidade do SUS: o caso da cidade de São Paulo, Brasil

O acesso aos serviços de média complexidade tem sido apontado, por gestores e pesquisadores, como um dos entraves para a efetivação da integralidade do SUS. Este artigo teve o objetivo de avaliar mecanismos utilizados pela gestão do SUS, no município de São Paulo, para garantir acesso à assistência de média complexidade, durante o período de 2005 a 2008. Optou-se pela estratégia de estudo de caso, utilizando as seguintes fontes de evidência: entrevistas com gestores; grupo focal com usuários e observação participante. Utilizouas técnica de análise temática, a partir do referencial teórico da integralidade da assistência, na dimensão da organização de serviços. Buscou-se descrever os caminhos percorridos pelos usuários para acessar os serviços da média complexidade, a partir da visão dos gestores e dos próprios usuários. A média complexidade foi identificada, pelos gestores, como o "gargalo" do SUS e um dos principais obstáculos para a construção da integralidade. Para enfrentar essa situação, o gestor municipal investiu na informatização dos serviços, como medida isolada e, ainda, sem considerar a necessidade dos usuários. Sendo assim, essa incorporação tecnológica teve pouco impacto na melhoria do acesso, o que se confirmou no relato dos usuários. Discute-se que para o enfrentamento de um problema tão complexo são necessárias ações articuladas, tanto no âmbito da política de saúde, quanto da organização dos serviços, bem como a (re)organização do processo de trabalho em todos os níveis do sistema de saúde.