We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.

A measurement of the flux of neutrino-induced muons using the MACRO detector is presented. Different event topologies, corresponding to different neutrino parent energies can be detected. The upward throughgoing muon sample is the larger event sample. For this sample, produced by neutrinos having an average energy around 100 GeV, the ratio of the number of observed to expected events integrated...

Recent increases in the use of hydraulic fracturing (HF) to aid extraction of oil and gas from black shales have raised concerns regarding potential environmental effects associated with predictions of upward migration of HF fluid and brine. Some recent studies have suggested that such upward migration can be large and that timescales for migration can be as short as a few years. In this articl...

An estimate of the energy of neutrino-induced muons in MACRO is provided by a multiple Coulomb scattering measurement. The MACRO original upward-muon data sample has been subdivided according to the reconstructed muon energy. Data in each subset are then compared with expected fluxes from atmospheric neutrinos. The results are interpreted in terms of neutrino oscillations.

ion, this results in an inherent asymmetry of upward vs. downward events. The properties of downward events described in the previous section do not hold for upward events; in fact the properties of upward events are essentially complementary to those of downward events: 1. Upward events need not be yielding. While the simple formulation of Handler in Section 2 does cause the lower level to yie...

The upward planarity testing problem is known to be NPhard. We describe an O(n)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.

An upward drawing of a rooted tree is a drawing such that no parents are below their children. It is ordered if the edges to children appear in prescribed order around each vertex. It is well-known that any tree has an upward (unordered) drawing with width log(n+ 1). For ordered drawings, the best-known bounds for the width for binary trees is O(logn), while for arbitrary trees it is O(2 √ ). W...

The globalization of work within organizations has generated a greater need for all type of workers to exert interpersonal influence through technology-mediated communication tools. This paper sheds light on the analysis of interpersonal relations in virtual environments from a specific perspective: the choice of upward influence tactics. We propose that virtual work settings may impact the upw...