Chaos modified wall formula damping of the surface motion of a cavity undergoing fissionlike shape evolutions

The chaos weighted wall formula developed earlier for systems with partially chaotic single particle motion is applied to large amplitude collective motions similar to those in nuclear fission. Considering an ideal gas in a cavity undergoing fission-like shape evolutions, the irreversible energy transfer to the gas is dynamically calculated and compared with the prediction of the chaos weighted wall formula. We conclude that the chaos weighted wall formula provides a fairly accurate description of one body dissipation in dynamical systems similar to fissioning nuclei. We also find a qualitative similarity between the phenomenological friction in nuclear fission and the chaos weighted wall formula. This provides further evidence for one body nature of the dissipative force acting in a fissioning nucleus.Comment: 8 pages (RevTex), 7 Postscript figures, to appear in Phys.Rev.C., Section I (Introduction) is modified to discuss some other works (138 kb

Giant Octupole Resonance Simulation

Using a pseudo-particle technique we simulate large-amplitude isoscalar giant octupole excitations in a finite nuclear system. Dependent on the initial conditions we observe either clear octupole modes or over-damped octupole modes which decay immediately into quadrupole ones. This shows clearly a behavior beyond linear response. We propose that octupole modes might be observed in central collisions of heavy ions

Isovector dipole-resonance structure within the effective surface approximation

The nuclear isovector-dipole strength structure is analyzed in terms of the main and satellite (pygmy) peaks within the Fermi-liquid droplet model. Such a structure is sensitive to the value of the surface symmetry-energy constant obtained analytically for different Skyrme forces in the leptodermous effective surface approximation. Energies, sum rules and transition densities of the main and satellite peaks for specific Skyrme forces are qualitatively in agreement with the experimental data and other theoretical calculations.Comment: 6 pages, 2 figures, 1 tabl

Adaptive Regret Minimization in Bounded-Memory Games

Online learning algorithms that minimize regret provide strong guarantees in situations that involve repeatedly making decisions in an uncertain environment, e.g. a driver deciding what route to drive to work every day. While regret minimization has been extensively studied in repeated games, we study regret minimization for a richer class of games called bounded memory games. In each round of a two-player bounded memory-m game, both players simultaneously play an action, observe an outcome and receive a reward. The reward may depend on the last m outcomes as well as the actions of the players in the current round. The standard notion of regret for repeated games is no longer suitable because actions and rewards can depend on the history of play. To account for this generality, we introduce the notion of k-adaptive regret, which compares the reward obtained by playing actions prescribed by the algorithm against a hypothetical k-adaptive adversary with the reward obtained by the best expert in hindsight against the same adversary. Roughly, a hypothetical k-adaptive adversary adapts her strategy to the defender's actions exactly as the real adversary would within each window of k rounds. Our definition is parametrized by a set of experts, which can include both fixed and adaptive defender strategies. We investigate the inherent complexity of and design algorithms for adaptive regret minimization in bounded memory games of perfect and imperfect information. We prove a hardness result showing that, with imperfect information, any k-adaptive regret minimizing algorithm (with fixed strategies as experts) must be inefficient unless NP=RP even when playing against an oblivious adversary. In contrast, for bounded memory games of perfect and imperfect information we present approximate 0-adaptive regret minimization algorithms against an oblivious adversary running in time n^{O(1)}.Comment: Full Version. GameSec 2013 (Invited Paper

Chaoticity and Shell Effects in the Nearest-Neighbor Distributions

Statistics of the single-particle levels in a deformed Woods-Saxon potential is analyzed in terms of the Poisson and Wigner nearest-neighbor distributions for several deformations and multipolarities of its surface distortions. We found the significant differences of all the distributions with a fixed value of the angular momentum projection of the particle, more closely to the Wigner distribution, in contrast to the full spectra with Poisson-like behavior. Important shell effects are observed in the nearest neighbor spacing distributions, the larger the smaller deformations of the surface multipolarities.Comment: 10 pages and 9 figure