Buscar
Mostrando ítems 11-20 de 4148
Ultimate bound minimisation by state feedback in discrete-time switched linear systems under arbitrary switching
(Elsevier, 2016-08)
We present a novel state feedback design method for perturbed discrete-time switched linear systems. The method aims at achieving (a) closed-loop stability under arbitrary switching and (b) minimisation of ultimate bounds ...
Efficient Tight Field Bounds Computation Based on Shape Predicates
(Springer, 2014-05)
Tight field bounds contribute to verifying the correctness of object oriented programs in bounded scenarios, by restricting the values that fields can take to feasible cases only, during automated analysis. Tight field ...
J/Ψ mass shift and J/Ψ-nuclear bound state
(2011-08-16)
We calculate mass shift of the J/Ψ meson in nuclear matter arising from the modification of DD, DD* and D*D* meson loop contributions to the J/Ψ self-energy. The estimate includes the in-medium D and D* meson masses ...
J/Ψ in nuclear matter
(2013-04-26)
We report on recent estimates of the J/Ψ mass shift in infinite nuclear matter and finite nuclei arising from in-medium D and D* meson loops. The density dependence of the J/Ψ mass shift is evaluated employing medium-modified ...
J/Ψ in nuclear matter
(2013-04-26)
We report on recent estimates of the J/Ψ mass shift in infinite nuclear matter and finite nuclei arising from in-medium D and D* meson loops. The density dependence of the J/Ψ mass shift is evaluated employing medium-modified ...
Trajectory of neutron-neutron-C-18 excited three-body state
(Elsevier B.V., 2008-02-28)
The trajectory of the first excited Efimov state is investigated by using a renormalized zero-range three-body model for a system with two bound and one virtual two-body subsystems. The approach is applied to n-n-C-18, ...
UNUSUALLY STRONG ATTRACTION IN THE PRESENCE OF CONTINUUM BOUND-STATE
(American Physical Soc, 2014)
Learning with bounded memory in games
(Academic Press Inc Elsevier Science, 2014-09)
We study learning with bounded memory in zero-sum repeated games with one-sided incomplete information. The uninformed player has only a fixed number of memory states available. His strategy is to choose a transition rule ...