948 resultados para Boltzmann s H theorem
Resumo:
We prove a characterization of the support of the law of the solution for a stochastic wave equation with two-dimensional space variable, driven by a noise white in time and correlated in space. The result is a consequence of an approximation theorem, in the convergence of probability, for equations obtained by smoothing the random noise. For some particular classes of coefficients, approximation in the Lp-norm for p¿1 is also proved.
Resumo:
A partir del análisis y crítica de algunos de los presupuestos básicos de la orientación dominante en psicologia cognitiva se discuten las posibilidades del planteamiento conexionista al cual atribuimos, en el marco de los distintos niveles explicativos posibles, el carácter de alternativa verdaderamente psicológica. Las argumentaciones centrales se basan en laspropiedades supuestamente atribuibles a las representaciones (particularmente, su carácter compuesto, sistemático y abstracto) y en la valoración de las posibilidades de aproximación a esas características desde el punto de vista conexionista. Se valora la posibilidad de complementar el enfoque microestructural propio del conexionismo con el análisis del comportamiento global del tip0 de redes implicadas. Esta dinámica global, analizable desde una perspectiva topológica a partir del concepto de estabilidad estructural, es susceptible de mostrar modifcaciones cualitativas que pueden asociarse con algunos fenómenos estudiados clásicarnente en la psicologia del pensamiento y en otros ámbitos
Resumo:
We study the possibility of splitting any bounded analytic function $f$ with singularities in a closed set $E\cup F$ as a sum of two bounded analytic functions with singularities in $E$ and $F$ respectively. We obtain some results under geometric restrictions on the sets $E$ and $F$ and we provide some examples showing the sharpness of the positive results.
Resumo:
We study the impact of sampling theorems on the fidelity of sparse image reconstruction on the sphere. We discuss how a reduction in the number of samples required to represent all information content of a band-limited signal acts to improve the fidelity of sparse image reconstruction, through both the dimensionality and sparsity of signals. To demonstrate this result, we consider a simple inpainting problem on the sphere and consider images sparse in the magnitude of their gradient. We develop a framework for total variation inpainting on the sphere, including fast methods to render the inpainting problem computationally feasible at high resolution. Recently a new sampling theorem on the sphere was developed, reducing the required number of samples by a factor of two for equiangular sampling schemes. Through numerical simulations, we verify the enhanced fidelity of sparse image reconstruction due to the more efficient sampling of the sphere provided by the new sampling theorem.
Resumo:
Let $\pi : \widetilde C \to C$ be an unramified double covering of irreducible smooth curves and let $P$ be the attached Prym variety. We prove the scheme-theoretic theta-dual equalities in the Prym variety $T(\widetilde C)=V^2$ and $T(V^2)=\widetilde C$, where $V^2$ is the Brill-Noether locus of $P$ associated to $\pi$ considered by Welters. As an application we prove a Torelli theorem analogous to the fact that the symmetric product $D^{(g)}$ of a curve $D$ of genus $g$ determines the curve.
Resumo:
By theorems of Ferguson and Lacey ($d=2$) and Lacey and Terwilleger ($d>2$), Nehari's theorem is known to hold on the polydisc $\D^d$ for $d>1$, i.e., if $H_\psi$ is a bounded Hankel form on $H^2(\D^d)$ with analytic symbol $\psi$, then there is a function $\varphi$ in $L^\infty(\T^d)$ such that $\psi$ is the Riesz projection of $\varphi$. A method proposed in Helson's last paper is used to show that the constant $C_d$ in the estimate $\|\varphi\|_\infty\le C_d \|H_\psi\|$ grows at least exponentially with $d$; it follows that there is no analogue of Nehari's theorem on the infinite-dimensional polydisc.
Resumo:
We report a Lattice-Boltzmann scheme that accounts for adsorption and desorption in the calculation of mesoscale dynamical properties of tracers in media of arbitrary complexity. Lattice Boltzmann simulations made it possible to solve numerically the coupled Navier-Stokes equations of fluid dynamics and Nernst-Planck equations of electrokinetics in complex, heterogeneous media. With the moment propagation scheme, it became possible to extract the effective diffusion and dispersion coefficients of tracers, or solutes, of any charge, e.g., in porous media. Nevertheless, the dynamical properties of tracers depend on the tracer-surface affinity, which is not purely electrostatic and also includes a species-specific contribution. In order to capture this important feature, we introduce specific adsorption and desorption processes in a lattice Boltzmann scheme through a modified moment propagation algorithm, in which tracers may adsorb and desorb from surfaces through kinetic reaction rates. The method is validated on exact results for pure diffusion and diffusion-advection in Poiseuille flows in a simple geometry. We finally illustrate the importance of taking such processes into account in the time-dependent diffusion coefficient in a more complex porous medium.
Resumo:
A Fortran77 program, SSPBE, designed to solve the spherically symmetric Poisson-Boltzmann equation using cell model for ionic macromolecular aggregates or macroions is presented. The program includes an adsorption model for ions at the aggregate surface. The working algorithm solves the Poisson-Boltzmann equation in the integral representation using the Picard iteration method. Input parameters are introduced via an ASCII file, sspbe.txt. Output files yield the radial distances versus mean field potentials and average molar ion concentrations, the molar concentration of ions at the cell boundary, the self-consistent degree of ion adsorption from the surface and other related data. Ion binding to ionic, zwitterionic and reverse micelles are presented as representative examples of the applications of the SSPBE program.
Resumo:
The ability of biomolecules to catalyze chemical reactions is due chiefly to their sensitivity to variations of the pH in the surrounding environment. The reason for this is that they are made up of chemical groups whose ionization states are modulated by pH changes that are of the order of 0.4 units. The determination of the protonation states of such chemical groups as a function of conformation of the biomolecule and the pH of the environment can be useful in the elucidation of important biological processes from enzymatic catalysis to protein folding and molecular recognition. In the past 15 years, the theory of Poisson-Boltzmann has been successfully used to estimate the pKa of ionizable sites in proteins yielding results, which may differ by 0.1 unit from the experimental values. In this study, we review the theory of Poisson-Boltzmann under the perspective of its application to the calculation of pKa in proteins.
Resumo:
This work consists of a theoretical part and an experimental one. The first part provides a simple treatment of the celebrated von Neumann minimax theorem as formulated by Nikaid6 and Sion. It also discusses its relationships with fundamental theorems of convex analysis. The second part is about externality in sponsored search auctions. It shows that in these auctions, advertisers have externality effects on each other which influence their bidding behavior. It proposes Hal R.Varian model and shows how adding externality to this model will affect its properties. In order to have a better understanding of the interaction among advertisers in on-line auctions, it studies the structure of the Google advertisements networ.k and shows that it is a small-world scale-free network.
Resumo:
Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.
Resumo:
This paper proves a new representation theorem for domains with both discrete and continuous variables. The result generalizes Debreu's well-known representation theorem on connected domains. A strengthening of the standard continuity axiom is used in order to guarantee the existence of a representation. A generalization of the main theorem and an application of the more general result are also presented.