Direct mass measurements of (68)Se and (80)Y

The masses of neutron-deficient nuclides near the N=Z line with A=64-80 have been determined using a direct time-of-flight technique which employed a cyclotron as a high-resolution spectrometer. The measured atomic masses for (68)Se and (80)Y were 67.9421(3) u and 79.9344(2) u, respectively. The new values agree with the 2003 Atomic Mass Evaluation. The result for (68)Se confirms that this nucleus is a waiting point of the rp-process, and that for (80)Y resolves the conflict between earlier measurements. Using the present results and the 2003 Atomic Mass Evaluation compilation, the empirical interaction between the last proton and the last neutron in N=Z nuclei has been revisited and extended.

Absorption of planar waves in a draining bathtub

We present an analysis of the absorption of acoustic waves by a black hole analogue in (2 + 1) dimensions generated by a fluid flow in a draining bathtub. We show that the low-frequency absorption length is equal to the acoustic hole circumference and that the high-frequency absorption length is 4 times the ergoregion radius. For intermediate values of the wave frequency, we compute the absorption length numerically and show that our results are in excellent agreement with the low-and high-frequency limits. We analyze the occurrence of superradiance, manifested as negative partial absorption lengths for corotating modes at low frequencies.

Automatic Network Fingerprinting through Single-Node Motifs

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs-a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.

Use of the q-Gaussian mutation in evolutionary algorithms

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.