Core structure of EAS in 10(15) to 10(17) eV

With the use of Akeno calorimeter, the attenuation of particles in concrete is analyzed as the function of the shower size of 10 to the 5th power to 10 to the 7th power. The attenuation length does not depend much on the shower size but depends a little on the shower age. The average value is approx. 150 g/sq cm for s = 0.5 to 0.85 and approx. 40 g/sq cm for s = 0.85 to 1.15. These values and their fluctuations are consistent with the equi-intensity curves of extensive air showers (EAS)

On Minimizing Crossings in Storyline Visualizations

In a storyline visualization, we visualize a collection of interacting characters (e.g., in a movie, play, etc.) by $x$-monotone curves that converge for each interaction, and diverge otherwise. Given a storyline with $n$ characters, we show tight lower and upper bounds on the number of crossings required in any storyline visualization for a restricted case. In particular, we show that if (1) each meeting consists of exactly two characters and (2) the meetings can be modeled as a tree, then we can always find a storyline visualization with $O(n\log n)$ crossings. Furthermore, we show that there exist storylines in this restricted case that require $\Omega(n\log n)$ crossings. Lastly, we show that, in the general case, minimizing the number of crossings in a storyline visualization is fixed-parameter tractable, when parameterized on the number of characters $k$. Our algorithm runs in time $O(k!^2k\log k + k!^2m)$, where $m$ is the number of meetings.Comment: 6 pages, 4 figures. To appear at the 23rd International Symposium on Graph Drawing and Network Visualization (GD 2015

Magnetic monopole search by 130 m(2)sr He gas proportional counter

A search experiment for cosmic ray magnetic monopoles was performed by means of atomic induction mechanism by using He mixture gas proportional counters of the calorimeter (130 square meters sr) at the center of the Akeno air shower array. In 3,482 hours operation no monopole candidate was observed. The upper limit of the monopole flux is 1.44 x 10 to the minus 13th power cm-z, sec -1, sr-1 (90% C.L.) for the velocity faster than 7 x 0.0001 c

Probing the size of extra dimension with gravitational wave astronomy

In Randall-Sundrum II (RS-II) braneworld model, it has been conjectured according to the AdS/CFT correspondence that brane-localized black hole (BH) larger than the bulk AdS curvature scale $\ell$ cannot be static, and it is dual to a four dimensional BH emitting the Hawking radiation through some quantum fields. In this scenario, the number of the quantum field species is so large that this radiation changes the orbital evolution of a BH binary. We derived the correction to the gravitational waveform phase due to this effect and estimated the upper bounds on $\ell$ by performing Fisher analyses. We found that DECIGO/BBO can put a stronger constraint than the current table-top result by detecting gravitational waves from small mass BH/BH and BH/neutron star (NS) binaries. Furthermore, DECIGO/BBO is expected to detect 10$^5$ BH/NS binaries per year. Taking this advantage, we found that DECIGO/BBO can actually measure $\ell$ down to $\ell=0.33 \mu$m for 5 year observation if we know that binaries are circular a priori. This is about 40 times smaller than the upper bound obtained from the table-top experiment. On the other hand, when we take eccentricities into binary parameters, the detection limit weakens to $\ell=1.5 \mu$m due to strong degeneracies between $\ell$ and eccentricities. We also derived the upper bound on $\ell$ from the expected detection number of extreme mass ratio inspirals (EMRIs) with LISA and BH/NS binaries with DECIGO/BBO, extending the discussion made recently by McWilliams. We found that these less robust constraints are weaker than the ones from phase differences.Comment: 19 pages, 10 figures. Published in PRD, typos corrected, references and footnotes adde

Computing Storyline Visualizations with Few Block Crossings

Storyline visualizations show the structure of a story, by depicting the interactions of the characters over time. Each character is represented by an x-monotone curve from left to right, and a meeting is represented by having the curves of the participating characters run close together for some time. There have been various approaches to drawing storyline visualizations in an automated way. In order to keep the visual complexity low, rather than minimizing pairwise crossings of curves, we count block crossings, that is, pairs of intersecting bundles of lines. Partly inspired by the ILP-based approach of Gronemann et al. [GD 2016] for minimizing the number of pairwise crossings, we model the problem as a satisfiability problem (since the straightforward ILP formulation becomes more complicated and harder to solve). Having restricted ourselves to a decision problem, we can apply powerful SAT solvers to find optimal drawings in reasonable time. We compare this SAT-based approach with two exact algorithms for block crossing minimization, using both the benchmark instances of Gronemann et al. and random instances. We show that the SAT approach is suitable for real-world instances and identify cases where the other algorithms are preferable.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

800-km long N-S spreading system of the North Fiji Basin

International audienc