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. The results are interpreted in terms of neutrino oscillation

The scalar particle even imposes a constraint on the likelihood of its prejacent and the alternatives on which it operates. This semantic import of even restricts its distribution: even that associates with a weak predicate in its immediate surface scope – weak even, for short – is acceptable only if it is appropriately embedded (cf. Lahiri 1998). This paper investigates the occurrence of weak ...

An upward embedding of an embedded planar graph specifies, for each vertex v, which edges are incident on v “above” or “below” and, in turn, induces an upward orientation of the edges from bottom to top. In this paper we characterize the set of all upward embeddings and orientations of an embedded planar graph by using a simple flow model, which is related to that described by Bousset [3] to ch...

The model of the torus as a parallelogram in the plane with opposite sides identiied enables us to deene two families of parallel lines and to tessellate the torus, then to associate to each tessellation a toroidal map with an upward drawing. It is proved that a toroidal map has a tessellation representation if and only if its universal cover is 2-connected. Those graphs that admit such an embe...

We study compact straight-line embeddings of trees. show that perfect binary trees can be embedded optimally: a tree with n nodes drawn on $$\sqrt{n}$$ by grid. also testing whether given rooted has an upward embedding combinatorial in grid is NP-hard.

In a planar L-drawing of directed graph (digraph) each edge e is represented as polyline composed vertical segment starting at the tail and horizontal ending head e. Distinct edges may overlap, but not cross. Our main focus on bimodal graphs, i.e., digraphs admitting embedding in which incoming outgoing around vertex are contiguous. We show that every plane without 2-cycles admits L-drawing. Th...

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.

introduction:in this study, ecg signals have been embedded into medical images to create a novel blind watermarking method. the embedding is done when the original image is compressed using the ezw algorithm. the extraction process is performed at the decompression time of the watermarked image. materials and methods: the multi-resolution watermarking with a secret key algorithm developed in th...