MACRO can detect three topologies of neutrino induced events, corresponding to different parent neutrino energies. The most numerous sample is made of upward throughgoing muons induced by atmospheric neutrinos of average energy 100 GeV. The ratio of the observed over the expected events is 0.74 ± 0.036stat ± 0.046sys ± 0.13theor. The observed zenith distribution does not fit the expected one in...

Rooted trees are usually drawn planar and upward , i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.

Many studies have argued that relative income predicts individual well-being. More recently, it has been suggested that the relative rank of an individual’s income, rather than how that income compares to a mean or reference income, is important. Here the relative rank hypothesis is examined along with the additional hypothesis that individuals compare their incomes predominantly with those of ...

Rooted trees are usually drawn planar and upward, i.e., without crossings and without any parent placed below its child. In this paper we investigate the area requirement of planar upward drawings of rooted trees. We give tight upper and lower bounds on the area of various types of drawings, and provide linear-time algorithms for constructing optimal area drawings. Let T be a bounded-degree roo...

Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While st-orderings do extend to directed graphs, especially planar st-graphs, they do not offer the same properties as canonical orderings. In this work we extend the so called bitonic st-orderings to directed graphs. We...

Article history: Received 8 September 2011 Accepted 23 November 2012 Available online 27 November 2012 Communicated by D. Wagner

it has been proved that sphericity testing for digraphs is an np-complete problem. here, we investigate sphericity of 3-connected single source digraphs. we provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $o(n)$ time.

Upward communication strategies were investigated at six university presidential BBS in Taiwan. A 12 CMC upward influence strategies scheme was developed including demand, facts, questioning, comparing, hitchhiking, rational persuasion, feelings only, sarcasm, inspirational appeals, ingratiating, alliance, and threatening. Two major research questions were proposed asking about the differences ...