1,852 research outputs found
Note on improvement precision of recursive function simulation in floating point standard
An improvement on precision of recursive function simulation in IEEE floating
point standard is presented. It is shown that the average of rounding towards
negative infinite and rounding towards positive infinite yields a better result
than the usual standard rounding to the nearest in the simulation of recursive
functions. In general, the method improves one digit of precision and it has
also been useful to avoid divergence from a correct stationary regime in the
logistic map. Numerical studies are presented to illustrate the method.Comment: DINCON 2017 - Conferencia Brasileira de Dinamica, Controle e
Aplicacoes - Sao Jose do Rio Preto - Brazil. 8 page
Simulation of Chua's Circuit by Means of Interval Analysis
The Chua's circuit is a paradigm for nonlinear scientific studies. It is
usually simulated by means of numerical methods under IEEE 754-2008 standard.
Although the error propagation problem is well known, little attention has been
given to the relationship between this error and inequalities presented in
Chua's circuit model. Taking the average of round mode towards and
, we showed a qualitative change on the dynamics of Chua's circuit.Comment: 6th International Conference on Nonlinear Science and Complexity -
S\~ao Jos\'e dos Campos, 2016, p. 1-
A nonextensive insight to the stellar initial mass function
the present paper, we propose that the stellar initial mass distributions as
known as IMF are best fitted by -Weibulls that emerge within nonextensive
statistical mechanics. As a result, we show that the Salpeter's slope of
2.35 is replaced when a -Weibull distribution is used. Our results
point out that the nonextensive entropic index represents a new approach
for understanding the process of the star-forming and evolution of massive
stars.Comment: 5 pages, 2 figures, Accepted to EP
Strong evidences for a nonextensive behavior of the rotation period in Open Clusters
Time-dependent nonextensivity in a stellar astrophysical scenario combines
nonextensive entropic indices derived from the modified Kawaler's
parametrization, and , obtained from rotational velocity distribution. These
's are related through a heuristic single relation given by , where is the cluster age. In a nonextensive
scenario, these indices are quantities that measure the degree of
nonextensivity present in the system. Recent studies reveal that the index
is correlated to the formation rate of high-energy tails present in the
distribution of rotation velocity. On the other hand, the index is
determined by the stellar rotation-age relationship. This depends on the
magnetic field configuration through the expression , where
and denote the saturation level of the star magnetic field and its
topology, respectively. In the present study, we show that the connection
is also consistent with 548 rotation period data for single
main-sequence stars in 11 Open Clusters aged less than 1 Gyr. The value of
2.5 from our unsaturated model shows that the mean magnetic field
topology of these stars is slightly more complex than a purely radial field.
Our results also suggest that stellar rotational braking behavior affects the
degree of anti-correlation between and cluster age . Finally, we suggest
that stellar magnetic braking can be scaled by the entropic index .Comment: 6 pages and 2 figures, accepted to EPL on October 17, 201
Forgetting complex propositions
This paper uses possible-world semantics to model the changes that may occur
in an agent's knowledge as she loses information. This builds on previous work
in which the agent may forget the truth-value of an atomic proposition, to a
more general case where she may forget the truth-value of a propositional
formula. The generalization poses some challenges, since in order to forget
whether a complex proposition is the case, the agent must also lose
information about the propositional atoms that appear in it, and there is no
unambiguous way to go about this.
We resolve this situation by considering expressions of the form
, which quantify over all possible (but
minimal) ways of forgetting whether . Propositional atoms are modified
non-deterministically, although uniformly, in all possible worlds. We then
represent this within action model logic in order to give a sound and complete
axiomatization for a logic with knowledge and forgetting. Finally, some
variants are discussed, such as when an agent forgets (rather than
forgets whether ) and when the modification of atomic facts is done
non-uniformly throughout the model
- …