977 resultados para Exact solution
Resumo:
An exact representation of N-wave solutions for the non-planar Burgers equation u(t) + uu(x) + 1/2ju/t = 1/2deltau(xx), j = m/n, m < 2n, where m and n are positive integers with no common factors, is given. This solution is asymptotic to the inviscid solution for Absolute value of x < square-root (2Q0 t), where Q0 is a function of the initial lobe area, as lobe Reynolds number tends to infinity, and is also asymptotic to the old age linear solution, as t tends to infinity; the formulae for the lobe Reynolds numbers are shown to have the correct behaviour in these limits. The general results apply to all j = m/n, m < 2n, and are rather involved; explicit results are written out for j = 0, 1, 1/2, 1/3 and 1/4. The case of spherical symmetry j = 2 is found to be 'singular' and the general approach set forth here does not work; an alternative approach for this case gives the large time behaviour in two different time regimes. The results of this study are compared with those of Crighton & Scott (1979).
Resumo:
We study the exact one-electron propagator and spectral function of a solvable model of interacting electrons due to Schulz and Shastry. The solution previously found for the energies and wave functions is extended to give spectral functions that turn out to be computable, interesting, and nontrivial. They provide one of the few examples of cases where the spectral functions are known asymptotically as well as exactly.
Exact internal controllability for a hyperbolic problem in a domain with highly oscillating boundary
Resumo:
In this paper, by using the Hilbert Uniqueness Method (HUM), we study the exact controllability problem described by the wave equation in a three-dimensional horizontal domain bounded at the bottom by a smooth wall and at the top by a rough wall. The latter is assumed to consist in a plane wall covered with periodically distributed asperities whose size depends on a small parameter epsilon > 0, and with a fixed height. Our aim is to obtain the exact controllability for the homogenized equation. In the process, we study the asymptotic analysis of wave equation in two setups, namely solution by standard weak formulation and solution by transposition method.
Resumo:
In this article, we present an exact theoretical analysis of an system, with arbitrary distribution of relative deadline for the end of service, operated under the first come first served scheduling policy with exact admission control. We provide an explicit solution to the functional equation that must be satisfied by the workload distribution, when the system reaches steady state. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. Finally, we compare this loss ratio with that of a similar system operating without admission control, in the cases of some common distributions of the relative deadline.
Resumo:
In this paper, we study the exact controllability of a second order linear evolution equation in a domain with highly oscillating boundary with homogeneous Neumann boundary condition on the oscillating part of boundary. Our aim is to obtain the exact controllability for the homogenized equation. The limit problem with Neumann condition on the oscillating boundary is different and hence we need to study the exact controllability of this new type of problem. In the process of homogenization, we also study the asymptotic analysis of evolution equation in two setups, namely solution by standard weak formulation and solution by transposition method.
Resumo:
We propose a method to treat the interfacial misfit dislocation array following the original Peierls-Nabarro's ideas. A simple and exact analytic solution is derived in the extended Peierls-Nabarro's model, and this solution reflects the core structure and the energy of misfit dislocation, which depend on misfit and bond strength. We also find that only with beta < 0.2 the structure of interface can be represented by an array of singular Volterra dislocations, which conforms to those of atomic simulation. Interfacial energy and adhesive work can be estimated by inputting ab initio calculation data into the model, and this shows the method can provide a correlation between the ab initio calculations and elastic continuum theory.
Resumo:
A new high-order refined shear deformation theory based on Reissner's mixed variational principle in conjunction with the state- space concept is used to determine the deflections and stresses for rectangular cross-ply composite plates. A zig-zag shaped function and Legendre polynomials are introduced to approximate the in-plane displacement distributions across the plate thickness. Numerical results are presented with different edge conditions, aspect ratios, lamination schemes and loadings. A comparison with the exact solutions obtained by Pagano and the results by Khdeir indicates that the present theory accurately estimates the in-plane responses.
Resumo:
In order to study quantitatively the effects of forced solution on crystal growth, we designed a new set of experimental equipment, in particular, a microchannel mixer was used as crystallization container so that the consumption of protein samples was much reduced and thus an exact syringe pump could be used for precise control of the flow rates. Since the mixer’s section was designed to be rectangular, the solution velocity in its center was steady and constant, and thus repeatable experiments were facilitated. Experimental results showed that the effects of forced solution on protein crystal growth were different under different levels of supersaturation, and new results were obtained for cases of high supersaturation. When the supersaturation is σ = 2.3, with increasing flow rates the growth rates of the lysozyme crystal’s (110) face hardly change when the flow rates are lower than 1300 μm/s, and decrease quickly afterwards. When the flow rate reaches 2000 μm/s, the crystal nearly ceases to grow. When the supersaturation is σ = 2.7, with increasing flow rates the (110) face growth rates increase at the beginning then reach the maximum values at 1700 μm/s – 1900 μm/s and decrease afterwards, approaching zero or so when the flow rate reaches 12000 μm/s. The higher the supersaturation, the larger the flow rate at which the crystal ceases to grow. © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
Resumo:
As is now well established, a first order expansion of the Hohenberg-Kohn total energy density functional about a trial input density, namely, the Harris-Foulkes functional, can be used to rationalize a non self consistent tight binding model. If the expansion is taken to second order then the energy and electron density matrix need to be calculated self consistently and from this functional one can derive a charge self consistent tight binding theory. In this paper we have used this to describe a polarizable ion tight binding model which has the benefit of treating charge transfer in point multipoles. This admits a ready description of ionic polarizability and crystal field splitting. It is necessary in constructing such a model to find a number of parameters that mimic their more exact counterparts in the density functional theory. We describe in detail how this is done using a combination of intuition, exact analytical fitting, and a genetic optimization algorithm. Having obtained model parameters we show that this constitutes a transferable scheme that can be applied rather universally to small and medium sized organic molecules. We have shown that the model gives a good account of static structural and dynamic vibrational properties of a library of molecules, and finally we demonstrate the model's capability by showing a real time simulation of an enolization reaction in aqueous solution. In two subsequent papers, we show that the model is a great deal more general in that it will describe solvents and solid substrates and that therefore we have created a self consistent quantum mechanical scheme that may be applied to simulations in heterogeneous catalysis.
Resumo:
Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Boolean games allow for an intuitive and more compact representation of the agents’ goals. So far, Boolean games have been mainly studied in the literature from the Knowledge Representation perspective, and less attention has been paid on the algorithmic issues underlying the computation of solution concepts. Although some suggestions for solving specific classes of Boolean games have been made in the literature, there is currently no work available on the practical performance. In this paper, we propose the first technique to solve general Boolean games that does not require an exponential translation to normal-form games. Our method is based on disjunctive answer set programming and computes solutions (equilibria) of arbitrary Boolean games. It can be applied to a wide variety of solution concepts, and can naturally deal with extensions of Boolean games such as constraints and costs. We present detailed experimental results in which we compare the proposed method against a number of existing methods for solving specific classes of Boolean games, as well as adaptations of methods that were initially designed for normal-form games. We found that the heuristic methods that do not require all payoff matrix entries performed well for smaller Boolean games, while our ASP based technique is faster when the problem instances have a higher number of agents or action variables.
Resumo:
Esta dissertação estuda essencialmente dois problemas: (A) uma classe de equações unidimensionais de reacção-difusão-convecção em meios não uniformes (dependentes do espaço), e (B) um problema elíptico não-linear e paramétrico ligado a fenómenos de capilaridade. A Análise de Perturbação Singular e a dinâmica de Hamilton-Jacobi são utilizadas na obtenção de expressões assimptóticas para a solução (com comportamento de frente) e para a sua velocidade de propagação. Os seguintes três métodos de decomposição, Adomian Decomposition Method (ADM), Decomposition Method based on Infinite Products (DIP), e New Iterative Method (NIM), são apresentados e brevemente comparados. Adicionalmente, condições suficientes para a convergência da solução em série, obtida pelo ADM, e uma aplicação a um problema da Telecomunicações por Fibras Ópticas, envolvendo EDOs não-lineares designadas equações de Raman, são discutidas. Um ponto de vista mais abrangente que unifica os métodos de decomposição referidos é também apresentado. Para subclasses desta EDP são obtidas soluções numa forma explícita, para diferentes tipos de dados e usando uma variante do método de simetrias de Bluman-Cole. Usando Teoria de Pontos Críticos (o teorema usualmente designado mountain pass) e técnicas de truncatura, prova-se a existência de duas soluções não triviais (uma positiva e uma negativa) para o problema elíptico não-linear e paramétrico (B). A existência de uma terceira solução não trivial é demonstrada usando Grupos Críticos e Teoria de Morse.
Resumo:
Os problemas de visibilidade têm diversas aplicações a situações reais. Entre os mais conhecidos, e exaustivamente estudados, estão os que envolvem os conceitos de vigilância e ocultação em estruturas geométricas (problemas de vigilância e ocultação). Neste trabalho são estudados problemas de visibilidade em estruturas geométricas conhecidas como polígonos, uma vez que estes podem representar, de forma apropriada, muitos dos objectos reais e são de fácil manipulação computacional. O objectivo dos problemas de vigilância é a determinação do número mínimo de posições para a colocação de dispositivos num dado polígono, de modo a que estes dispositivos consigam “ver” a totalidade do polígono. Por outro lado, o objectivo dos problemas de ocultação é a determinação do número máximo de posições num dado polígono, de modo a que quaisquer duas posições não se consigam “ver”. Infelizmente, a maior parte dos problemas de visibilidade em polígonos são NP-difíceis, o que dá origem a duas linhas de investigação: o desenvolvimento de algoritmos que estabelecem soluções aproximadas e a determinação de soluções exactas para classes especiais de polígonos. Atendendo a estas duas linhas de investigação, o trabalho é dividido em duas partes. Na primeira parte são propostos algoritmos aproximados, baseados essencialmente em metaheurísticas e metaheurísticas híbridas, para resolver alguns problemas de visibilidade, tanto em polígonos arbitrários como ortogonais. Os problemas estudados são os seguintes: “Maximum Hidden Vertex Set problem”, “Minimum Vertex Guard Set problem”, “Minimum Vertex Floodlight Set problem” e “Minimum Vertex k-Modem Set problem”. São também desenvolvidos métodos que permitem determinar a razão de aproximação dos algoritmos propostos. Para cada problema são implementados os algoritmos apresentados e é realizado um estudo estatístico para estabelecer qual o algoritmo que obtém as melhores soluções num tempo razoável. Este estudo permite concluir que as metaheurísticas híbridas são, em geral, as melhores estratégias para resolver os problemas de visibilidade estudados. Na segunda parte desta dissertação são abordados os problemas “Minimum Vertex Guard Set”, “Maximum Hidden Set” e “Maximum Hidden Vertex Set”, onde são identificadas e estudadas algumas classes de polígonos para as quais são determinadas soluções exactas e/ou limites combinatórios.
Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems
Resumo:
Tese dout., Matemática, Investigação Operacional, Universidade do Algarve, 2009
Resumo:
This paper proposes finite-sample procedures for testing the SURE specification in multi-equation regression models, i.e. whether the disturbances in different equations are contemporaneously uncorrelated or not. We apply the technique of Monte Carlo (MC) tests [Dwass (1957), Barnard (1963)] to obtain exact tests based on standard LR and LM zero correlation tests. We also suggest a MC quasi-LR (QLR) test based on feasible generalized least squares (FGLS). We show that the latter statistics are pivotal under the null, which provides the justification for applying MC tests. Furthermore, we extend the exact independence test proposed by Harvey and Phillips (1982) to the multi-equation framework. Specifically, we introduce several induced tests based on a set of simultaneous Harvey/Phillips-type tests and suggest a simulation-based solution to the associated combination problem. The properties of the proposed tests are studied in a Monte Carlo experiment which shows that standard asymptotic tests exhibit important size distortions, while MC tests achieve complete size control and display good power. Moreover, MC-QLR tests performed best in terms of power, a result of interest from the point of view of simulation-based tests. The power of the MC induced tests improves appreciably in comparison to standard Bonferroni tests and, in certain cases, outperforms the likelihood-based MC tests. The tests are applied to data used by Fischer (1993) to analyze the macroeconomic determinants of growth.
Resumo:
Introduction: Les instillations nasales de solution saline isotonique (INSS) chez les enfants sont recommandées par les pédiatres et des oto-rhino-laryngologistes de notre institution dans le but de prévenir les otites moyennes aigues à répétition (OMAr). Cependant, aucune étude dans la littérature ne vient corroborer ou infirmer cette pratique. Objectifs: Déterminer l’efficacité des INSS dans la prévention des OMAr. Méthode: Projet pilote d’un essai clinique randomisé. Les enfants diagnostiqués avec des OMAr étaient éligibles. Les patients recrutés ont été randomisés en 2 groupes. Seul le groupe traitement procède aux INSS. L’issue primaire est l’incidence d’OMAr pendant une période de 3 mois. Résultats: Vingt-neuf patients satisfaisant les critères d’inclusion et d’exclusion ont consenti à participer. Le taux d’OMAr était inférieur dans le groupe traitement (p=0.03, chi-carré) Conclusion: Les INSS semblent efficaces dans la prévention des OMAr. Une étude multicentrique est indiquée pour vérifier la validité externe et confirmer la sécurité.