Exact solvability of potentials with spatially dependent effective masses

We discuss the relationship between exact solvability of the Schroedinger equation, due to a spatially dependent mass, and the ordering ambiguity. Some examples show that, even in this case, one can find exact solutions. Furthermore, it is demonstrated that operators with linear dependence on the momentum are nonambiguous. (C) 2000 Elsevier Science B.V.

An effective wavelet method to detect and mitigate low-frequency multipath effects

To ensure high accuracy results from GPS relative positioning, the multipath effects have to be mitigated. Although the careful selection of antenna site and the use of especial antennas and receivers can minimize multipath, it cannot always be eliminated and frequently the residual multipath disturbance remains as the major error in GPS results. The high-frequency multipath from large delays can be attenuated by double difference (DD) denoising methods. But the low-frequency multipath from short delays is very difficult to be reduced or modeled. In this paper, it is proposed a method based on wavelet regression (WR), which can effectively detect and reduce the low-frequency multipath. The wavelet technique is firstly applied to decompose the DD residuals into the low-frequency bias and high-frequency noise components. The extracted bias components by WR are then directly applied to the DD observations to correct them from the trend. The remaining terms, largely characterized by the high-frequency measurement noise, are expected to give the best linear unbiased solutions from a least-squares (LS) adjustment. An experiment was carried out using objects placed close to the receiver antenna to cause, mainly, low-frequency multipath. The data were collected for two days to verify the multipath repeatability. The ground truth coordinates were computed with data collected in the absence of the reflector objects. The coordinates and ambiguity solution were compared with and without the multipath mitigation using WR. After mitigating the multipath, ambiguity resolution became more reliable and the coordinates were more accurate.

Optimal linear control to parametric uncertainties in a micro electro mechanical system

This paper, a micro-electro-mechanical systems (MEMS) with parametric uncertainties is considered. The non-linear dynamics in MEMS system is demonstrated with a chaotic behavior. We present the linear optimal control technique for reducing the chaotic movement of the micro-electromechanical system with parametric uncertainties to a small periodic orbit. The simulation results show the identification by linear optimal control is very effective. © 2013 Academic Publications, Ltd.

Times assíncronos inicializadores para o planejamento da expansão da transmissão de energia elétrica baseados no modelo híbrido linear

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Programação linear inteira aplicada ao aproveitamento do palhiço da cana-de-açúcar

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Um estudo da dependência do índice de refração linear com a composição dos vidros teluretos dos sistemas TeO2-Li2O-TiO2 e TeO2-Li2O-WO3

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Análise de novos modelos matemáticos para o problema de planejamento da expansão de sistemas de transmissão

Pós-graduação em Engenharia Elétrica - FEIS

Migração FD 3D em profundidade usando aproximação de Padé complexa

A implementação convencional do método de migração por diferenças finitas 3D, usa a técnica de splitting inline e crossline para melhorar a eficiência computacional deste algoritmo. Esta abordagem torna o algoritmo eficiente computacionalmente, porém cria anisotropia numérica. Esta anisotropia numérica por sua vez, pode levar a falsos posicionamentos de refletores inclinados, especialmente refletores com grandes ângulos de mergulho. Neste trabalho, como objetivo de evitar o surgimento da anisotropia numérica, implementamos o operador de extrapolação do campo de onda para baixo sem usar a técnica splitting inline e crossline no domínio frequência-espaço via método de diferenças finitas implícito, usando a aproximação de Padé complexa. Comparamos a performance do algoritmo iterativo Bi-gradiente conjugado estabilizado (Bi-CGSTAB) com o multifrontal massively parallel solver (MUMPS) para resolver o sistema linear oriundo do método de migração por diferenças finitas. Verifica-se que usando a expansão de Padé complexa ao invés da expansão de Padé real, o algoritmo iterativo Bi-CGSTAB fica mais eficientes computacionalmente, ou seja, a expansão de Padé complexa atua como um precondicionador para este algoritmo iterativo. Como consequência, o algoritmo iterativo Bi-CGSTAB é bem mais eficiente computacionalmente que o MUMPS para resolver o sistema linear quando usado apenas um termo da expansão de Padé complexa. Para aproximações de grandes ângulos, métodos diretos são necessários. Para validar e avaliar as propriedades desses algoritmos de migração, usamos o modelo de sal SEG/EAGE para calcular a sua resposta ao impulso.

Migração FFD 3D em profundidade usando aproximação de Padé complexa

Implementações dos métodos de migração diferença finita e Fourier (FFD) usam fatoração direcional para acelerar a performance e economizar custo computacional. Entretanto essa técnica introduz anisotropia numérica que podem erroneamente posicionar os refletores em mergulho ao longo das direções em que o não foi aplicado a fatoração no operador de migração. Implementamos a migração FFD 3D, sem usar a técnica do fatoração direcional, no domínio da frequência usando aproximação de Padé complexa. Essa aproximação elimina a anisotropia numérica ao preço de maior custo computacional buscando a solução do campo de onda para um sistema linear de banda larga. Experimentos numéricos, tanto no modelo homogêneo e heterogêneo, mostram que a técnica da fatoração direcional produz notáveis erros de posicionamento dos refletores em meios com forte variação lateral de velocidade. Comparamos a performance de resolução do algoritmo de FFD usando o método iterativo gradiente biconjugado estabilizado (BICGSTAB) e o multifrontal massively parallel direct solver (MUMPS). Mostrando que a aproximação de Padé complexa é um eficiente precondicionador para o BICGSTAB, reduzindo o número de iterações em relação a aproximação de Padé real. O método iterativo BICGSTAB é mais eficiente que o método direto MUMPS, quando usamos apenas um termo da expansão de Padé complexa. Para maior ângulo de abertura do operador, mais termos da série são requeridos no operador de migração, e neste caso, a performance do método direto é mais eficiente. A validação do algoritmo e as propriedades da evolução computacional foram avaliadas para a resposta ao impulso do modelo de sal SEG/EAGE.

Controle de dissociação molecular com ferramentas de dinâmica não linear

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Gestão ambiental aplicada a prevenção, controle e recuperação de erosão linear acelerada no município de Ipeúna-SP

The erosion is a natural process of detachment, transport and deposition of soil and rock particles from one place to another. Human activities with no previous planning may accelerate this process, causing several damages to the environment and to society. In order to control the acceleration of these erosion processes caused by humans, prevention and improvement initiatives emerge. Regarding works which interfere directly in some of the natural resources, these initiatives must respect the intrinsic physical properties of the area of interest, if they aim to obtain effective results. Based on this scenario, this work proposes a few methods of accelerated linear erosion prevention, control and recovery in a specific area of the municipal district of Ipeúna (SP). For that matter, this study is based on a method of physiographic compartmentalization of the area, considering and integrating soil, relief, geology and the use and land cover properties of the study area. Plus, a flowchart with general orientations regarding management of eroded areas was produced, focused on the control and recovery of linear erosion. The result demonstrates the importance of careful erosion control, respecting the physical properties of each physiographic unit. The vegetative and mechanical conservationists methods, and the discipline of water flow, have found wide applicability in the study area.

Avaliação do uso de técnicas digitais para caracterização de área degradada por empréstimo de solo: máxima verossimilhança x modelo linear de mistura espectral

Pós-graduação em Engenharia Civil - FEIS

Linear and undulating periodized strength plus aerobic training promote similar benefits and lead to improvement of insulin resistance on obese adolescents

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Short-term expansion planning of radial electrical distribution systems using mixed-integer linear programming

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Enhanced Mixed Integer Programming Techniques and Routing Problems

Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice. However, many questions are still open and not fully understood, and the mixed integer programming community is still more than active in trying to answer some of these questions. As a consequence, a huge number of papers are continuously developed and new intriguing questions arise every year. When dealing with MIPs, we have to distinguish between two different scenarios. The first one happens when we are asked to handle a general MIP and we cannot assume any special structure for the given problem. In this case, a Linear Programming (LP) relaxation and some integrality requirements are all we have for tackling the problem, and we are ``forced" to use some general purpose techniques. The second one happens when mixed integer programming is used to address a somehow structured problem. In this context, polyhedral analysis and other theoretical and practical considerations are typically exploited to devise some special purpose techniques. This thesis tries to give some insights in both the above mentioned situations. The first part of the work is focused on general purpose cutting planes, which are probably the key ingredient behind the success of the current generation of MIP solvers. Chapter 1 presents a quick overview of the main ingredients of a branch-and-cut algorithm, while Chapter 2 recalls some results from the literature in the context of disjunctive cuts and their connections with Gomory mixed integer cuts. Chapter 3 presents a theoretical and computational investigation of disjunctive cuts. In particular, we analyze the connections between different normalization conditions (i.e., conditions to truncate the cone associated with disjunctive cutting planes) and other crucial aspects as cut rank, cut density and cut strength. We give a theoretical characterization of weak rays of the disjunctive cone that lead to dominated cuts, and propose a practical method to possibly strengthen those cuts arising from such weak extremal solution. Further, we point out how redundant constraints can affect the quality of the generated disjunctive cuts, and discuss possible ways to cope with them. Finally, Chapter 4 presents some preliminary ideas in the context of multiple-row cuts. Very recently, a series of papers have brought the attention to the possibility of generating cuts using more than one row of the simplex tableau at a time. Several interesting theoretical results have been presented in this direction, often revisiting and recalling other important results discovered more than 40 years ago. However, is not clear at all how these results can be exploited in practice. As stated, the chapter is a still work-in-progress and simply presents a possible way for generating two-row cuts from the simplex tableau arising from lattice-free triangles and some preliminary computational results. The second part of the thesis is instead focused on the heuristic and exact exploitation of integer programming techniques for hard combinatorial optimization problems in the context of routing applications. Chapters 5 and 6 present an integer linear programming local search algorithm for Vehicle Routing Problems (VRPs). The overall procedure follows a general destroy-and-repair paradigm (i.e., the current solution is first randomly destroyed and then repaired in the attempt of finding a new improved solution) where a class of exponential neighborhoods are iteratively explored by heuristically solving an integer programming formulation through a general purpose MIP solver. Chapters 7 and 8 deal with exact branch-and-cut methods. Chapter 7 presents an extended formulation for the Traveling Salesman Problem with Time Windows (TSPTW), a generalization of the well known TSP where each node must be visited within a given time window. The polyhedral approaches proposed for this problem in the literature typically follow the one which has been proven to be extremely effective in the classical TSP context. Here we present an overall (quite) general idea which is based on a relaxed discretization of time windows. Such an idea leads to a stronger formulation and to stronger valid inequalities which are then separated within the classical branch-and-cut framework. Finally, Chapter 8 addresses the branch-and-cut in the context of Generalized Minimum Spanning Tree Problems (GMSTPs) (i.e., a class of NP-hard generalizations of the classical minimum spanning tree problem). In this chapter, we show how some basic ideas (and, in particular, the usage of general purpose cutting planes) can be useful to improve on branch-and-cut methods proposed in the literature.