962 resultados para Trigonometric Korovkin Theorem
Resumo:
In [Haiyin Gao, Ke Wang, Fengying Wei, Xiaohua Ding, Massera-type theorem and asymptotically periodic Logistic equations, Nonlinear Analysis: Real World Applications 7 (2006) 1268-1283, Lemma 2.1] it is established that a scalar S-asymptotically to-periodic function (that is, a continuous and bounded function f : [0, infinity) -> R such that lim(t ->infinity)(f (t + omega) - f (t)) = 0) is asymptotically omega-periodic. In this note we give two examples to show that this assertion is false. (C) 2008 Elsevier Ltd. Ail rights reserved.
Resumo:
We discuss the expectation propagation (EP) algorithm for approximate Bayesian inference using a factorizing posterior approximation. For neural network models, we use a central limit theorem argument to make EP tractable when the number of parameters is large. For two types of models, we show that EP can achieve optimal generalization performance when data are drawn from a simple distribution.
Resumo:
Motivated by the unconventional properties and rich phase diagram of NaxCoO2 we consider the electronic and magnetic properties of a two-dimensional Hubbard model on an isotropic triangular lattice doped with electrons away from half-filling. Dynamical mean-field theory (DMFT) calculations predict that for negative intersite hopping amplitudes (t < 0) and an on-site Coulomb repulsion, U, comparable to the bandwidth, the system displays properties typical of a weakly correlated metal. In contrast, for t > 0 a large enhancement of the effective mass, itinerant ferromagnetism, and a metallic phase with a Curie-Weiss magnetic susceptibility are found in a broad electron doping range. The different behavior encountered is a consequence of the larger noninteracting density of states (DOS) at the Fermi level for t > 0 than for t < 0, which effectively enhances the mass and the scattering amplitude of the quasiparticles. The shape of the DOS is crucial for the occurrence of ferromagnetism as for t > 0 the energy cost of polarizing the system is much smaller than for t < 0. Our observation of Nagaoka ferromagnetism is consistent with the A-type antiferromagnetism (i.e., ferromagnetic layers stacked antiferromagnetically) observed in neutron scattering experiments on NaxCoO2. The transport and magnetic properties measured in NaxCoO2 are consistent with DMFT predictions of a metal close to the Mott insulator and we discuss the role of Na ordering in driving the system towards the Mott transition. We propose that the Curie-Weiss metal phase observed in NaxCoO2 is a consequence of the crossover from a bad metal with incoherent quasiparticles at temperatures T > T-* and Fermi liquid behavior with enhanced parameters below T-*, where T-* is a low energy coherence scale induced by strong local Coulomb electron correlations. Our analysis also shows that the one band Hubbard model on a triangular lattice is not enough to describe the unusual properties of NaxCoO2 and is used to identify the simplest relevant model that captures the essential physics in NaxCoO2. We propose a model which allows for the Na ordering phenomena observed in the system which, we propose, drives the system close to the Mott insulating phase even at large dopings.
Resumo:
We identify a test of quantum mechanics versus macroscopic local realism in the form of stochastic electrodynamics. The test uses the steady-state triple quadrature correlations of a parametric oscillator below threshold.
Resumo:
A program can be refined either by transforming the whole program or by refining one of its components. The refinement of a component is, for the main part, independent of the remainder of the program. However, refinement of a component can depend on the context of the component for information about the variables that are in scope and what their types are. The refinement can also take advantage of additional information, such as any precondition the component can assume. The aim of this paper is to introduce a technique, which we call program window inference, to handle such contextual information during derivations in the refinement calculus. The idea is borrowed from a technique, called window inference, for handling context in theorem proving. Window inference is the primary proof paradigm of the Ergo proof editor. This tool has been extended to mechanize refinement using program window inference. (C) 1997 Elsevier Science B.V.
Resumo:
This paper offers a defense of backwards in time causation models in quantum mechanics. Particular attention is given to Cramer's transactional account, which is shown to have the threefold virtue of solving the Bell problem, explaining the complex conjugate aspect of the quantum mechanical formalism, and explaining various quantum mysteries such as Schrodinger's cat. The question is therefore asked, why has this model not received more attention from physicists and philosophers? One objection given by physicists in assessing Cramer's theory was that it is not testable. This paper seeks to answer this concern by utilizing an argument that backwards causation models entail a fork theory of causal direction. From the backwards causation model together with the fork theory one can deduce empirical predictions. Finally, the objection that this strategy is questionable because of its appeal to philosophy is deflected.
Resumo:
A k-star is the graph K-1,K-k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (K-q)(S) of a complete graph with prime power order q, products C-r1 x C-r2 x ... x C-rk of k cycles of arbitrary lengths, and any power (C-r)(S) of a cycle of arbitrary length. (C) 2001 John Wiley & Sons, Inc.
Resumo:
Whether contemporary human populations are still evolving as a result of natural selection has been hotly debated. For natural selection to cause evolutionary change in a trait, variation in the trait must be correlated with fitness and be genetically heritable and there must be no genetic constraints to evolution. These conditions have rarely been tested in human populations. In this study, data from a large twin cohort were used to assess whether selection Will cause a change among women in contemporary Western population for three life-history traits: age at menarche, age at first reproduction, and age at menopause. We control for temporal variation in fecundity (the baby boom phenomenon) and differences between women in educational background and religious affiliation. University-educated women have 35% lower fitness than those with less than seven years education, and Roman Catholic women have about 20% higher fitness than those of other religions. Although these differences were significant, education and religion only accounted for 2% and 1% of variance in fitness, respectively. Using structural equation modeling, we reveal significant genetic influences for all three life-history traits, with heritability estimates of 0.50, 0.23, and 0.45, respectively. However, strong genetic covariation with reproductive fitness could only be demonstrated for age at first reproduction, with much weaker covariation for age at menopause and no significant covariation for age at menarche. Selection may, therefore, lead to the evolution of earlier age at first reproduction in this population. We also estimate substantial heritable variation in fitness itself, with approximately 39% of the variance attributable to additive genetic effects, the remainder consisting of unique environmental effects and small effects from education and religion. We discuss mechanisms that could be maintaining such a high heritability for fitness. Most likely is that selection is now acting on different traits from which it did in pre-industrial human populations.
Resumo:
1. Parasitoids are predicted to spend longer in patches with more hosts, but previous work on Cotesia rubecula (Marshall) has not upheld this prediction, Tests of theoretical predictions may be affected by the definition of patch leaving behaviour, which is often ambiguous. 2. In this study whole plants were considered as patches and assumed that wasps move within patches by means of walking or flying. Within-patch and between-patch flights were distinguished based on flight distance. The quality of this classification was tested statistically by examination of log-survivor curves of flight times. 3. Wasps remained longer in patches with higher host densities, which is consistent with predictions of the marginal value theorem (Charnov 1976). tinder the assumption that each flight indicates a patch departure, there is no relationship between host density and leaving tendency. 4. Oviposition influences the patch leaving behaviour of wasps in a count down fashion (Driessen et al. 1995), as predicted by an optimal foraging model (Tenhumberg, Keller & Possingham 2001). 5. Wasps spend significantly longer in the first patch encountered following release, resulting in an increased rate of superparasitism.
Resumo:
Applied econometricians often fail to impose economic regularity constraints in the exact form economic theory prescribes. We show how the Singular Value Decomposition (SVD) Theorem and Markov Chain Monte Carlo (MCMC) methods can be used to rigorously impose time- and firm-varying equality and inequality constraints. To illustrate the technique we estimate a system of translog input demand functions subject to all the constraints implied by economic theory, including observation-varying symmetry and concavity constraints. Results are presented in the form of characteristics of the estimated posterior distributions of functions of the parameters. Copyright (C) 2001 John Wiley Sons, Ltd.
Resumo:
In this paper, we present a new unified approach and an elementary proof of a very general theorem on the existence of a semicontinuous or continuous utility function representing a preference relation. A simple and interesting new proof of the famous Debreu Gap Lemma is given. In addition, we prove a new Gap Lemma for the rational numbers and derive some consequences. We also prove a theorem which characterizes the existence of upper semicontinuous utility functions on a preordered topological space which need not be second countable. This is a generalization of the classical theorem of Rader which only gives sufficient conditions for the existence of an upper semicontinuous utility function for second countable topological spaces. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
In this paper we investigate the structure of non-representable preference relations. While there is a vast literature on different kinds of preference relations that can be represented by a real-valued utility function, very little is known or understood about preference relations that cannot be represented by a real-valued utility function. There has been no systematic analysis of the non-representation problem. In this paper we give a complete description of non-representable preference relations which are total preorders or chains. We introduce and study the properties of four classes of non-representable chains: long chains, planar chains, Aronszajn-like chains and Souslin chains. In the main theorem of the paper we prove that a chain is non-representable if and only it is a long chain, a planar chain, an Aronszajn-like chain or a Souslin chain. (C) 2002 Published by Elsevier Science B.V.
Resumo:
We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg G less than or equal to n-2/2 or deg G greater than or equal to n-2/2 + 2g then the state complexity of C-L(D, G) is equal to the Wolf bound. For deg G is an element of [n-1/2, n-3/2 + 2g], we use Clifford's theorem to give a simple lower bound on the state complexity of C-L(D, G). We then derive two further lower bounds on the state space dimensions of C-L(D, G) in terms of the gonality sequence of F/F-q. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of C-L(D, G) and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.