947 resultados para Generalized entropy


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Considering the importance of the proper detection of bubbles in financial markets for policymakers and market agents, we used two techniques described in Diba and Grossman (1988b) and in Phillips, Shi, and Yu (2015) to detect periods of exuberance in the recent history of the Brazillian stock market. First, a simple cointegration test is applied. Secondly, we conducted several augmented, right-tailed Dickey-Fuller tests on rolling windows of data to determine the point in which there’s a structural break and the series loses its stationarity.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial distribution. In a classical walk, entropy increase can be regarded as a consequence of the majorization ordering of successive distributions. The Lorenz curves of successive distributions for a symmetric quantum walk reveal no majorization ordering in general. Nevertheless, entropy can increase, and computer experiments show that it does so on average. Varying the stages at which the quantum coin system is traced out leads to new quantum walks, including a symmetric walk for which majorization ordering is valid but the spreading rate exceeds that of the usual symmetric quantum walk.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis-Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The paper identifies the structural restrictions on preferences required for them to exhibit both translation homotheticity in particular direction and radial homotheticity. The results are illustrated by an application to an asset allocation problem in the absence of riskless asset.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We introduce a novel way of measuring the entropy of a set of values undergoing changes. Such a measure becomes useful when analyzing the temporal development of an algorithm designed to numerically update a collection of values such as artificial neural network weights undergoing adjustments during learning. We measure the entropy as a function of the phase-space of the values, i.e. their magnitude and velocity of change, using a method based on the abstract measure of entropy introduced by the philosopher Rudolf Carnap. By constructing a time-dynamic two-dimensional Voronoi diagram using Voronoi cell generators with coordinates of value- and value-velocity (change of magnitude), the entropy becomes a function of the cell areas. We term this measure teleonomic entropy since it can be used to describe changes in any end-directed (teleonomic) system. The usefulness of the method is illustrated when comparing the different approaches of two search algorithms, a learning artificial neural network and a population of discovering agents. (C) 2004 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Objective: Sertraline's efficacy and tolerability in treating generalized anxiety disorder were evaluated. Method: Adult outpatients with DSM-IV generalized anxiety disorder and a total score of 18 or higher on the Hamilton Anxiety Rating Scale were eligible. After a 1-week single-blind placebo lead-in, patients were randomly assigned to 12 weeks of double-blind treatment with placebo (N=188, mean baseline anxiety score=25) or flexible doses (50-150 mg/day) of sertraline (N=182, mean anxiety score=25). The primary outcome measure was baseline-to-endpoint change in the Hamilton anxiety scale total score. A secondary efficacy measure was the Clinical Global Impression (CGI) improvement score; response was defined as a score of 2 or less. Results: Sertraline patients had significantly greater improvement than placebo patients on all efficacy measures at week 4. Analysis of covariance of the intent-to-treat group at endpoint (with the last observation carried forward) showed a significant difference in the decrease from baseline of the least-square mean total score on the Hamilton anxiety scale between sertraline (mean=11.7) and placebo (mean=8.0). Significantly greater endpoint improvement with sertraline than placebo was obtained for mean scores on the Hamilton anxiety scale psychic factor (6.7 versus 4.1) and somatic factor (5.0 versus 3.9). The rate of responders, based on CGI improvement and last observation carried forward, was significantly higher for sertraline (63%) than placebo (37%). Sertraline was well tolerated; 8% of patients versus 10% for placebo dropped out because of adverse events. Conclusions: Sertraline appears to be efficacious and well tolerated in the treatment of generalized anxiety disorder.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal optimization and rare event simulation. The purpose of this tutorial is to give a gentle introduction to the CE method. We present the CE methodology, the basic algorithm and its modifications, and discuss applications in combinatorial optimization and machine learning. combinatorial optimization

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consider a network of unreliable links, modelling for example a communication network. Estimating the reliability of the network-expressed as the probability that certain nodes in the network are connected-is a computationally difficult task. In this paper we study how the Cross-Entropy method can be used to obtain more efficient network reliability estimation procedures. Three techniques of estimation are considered: Crude Monte Carlo and the more sophisticated Permutation Monte Carlo and Merge Process. We show that the Cross-Entropy method yields a speed-up over all three techniques.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The buffer allocation problem (BAP) is a well-known difficult problem in the design of production lines. We present a stochastic algorithm for solving the BAP, based on the cross-entropy method, a new paradigm for stochastic optimization. The algorithm involves the following iterative steps: (a) the generation of buffer allocations according to a certain random mechanism, followed by (b) the modification of this mechanism on the basis of cross-entropy minimization. Through various numerical experiments we demonstrate the efficiency of the proposed algorithm and show that the method can quickly generate (near-)optimal buffer allocations for fairly large production lines.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of estimating P(Yi + (...) + Y-n > x) by importance sampling when the Yi are i.i.d. and heavy-tailed. The idea is to exploit the cross-entropy method as a toot for choosing good parameters in the importance sampling distribution; in doing so, we use the asymptotic description that given P(Y-1 + (...) + Y-n > x), n - 1 of the Yi have distribution F and one the conditional distribution of Y given Y > x. We show in some specific parametric examples (Pareto and Weibull) how this leads to precise answers which, as demonstrated numerically, are close to being variance minimal within the parametric class under consideration. Related problems for M/G/l and GI/G/l queues are also discussed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The use of sirolimus as an alternative to calcineurin antagonists has enabled the continuation of immunosuppression in patients with renal impairment with preservation of kidney function. Sirolimus is generally well tolerated, with the main causes of cessation of therapy related to its effect on blood lipid profile as well as leukopenia and thrombocytopenia. We report a case of a debilitating ulcerating maculopapular rash necessitating cessation of the drug in a liver transplantation patient. A 56-year-old Caucasian liver transplantation patient presented with a diffuse, debilitating rash attributed to sirolimus use. This ultimately necessitated cessation of the immunosuppressant with subsequent resolution of her symptoms. From a review of the current literature, this is a highly unusual adverse reaction to sirolimus.