A graph is called a strong ( resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a -thick vertical line connecting them that intersects at most one other bar. We explore the relation among weak (resp. strong) bar 1-visibility graphs and other nearly pl...

Planar lung ventilation/perfusion scintigraphy (V/P(PLANAR)) is a standard method for diagnosis of pulmonary embolism (PE). The goals of this study were to test whether the diagnostic information of ventilation/perfusion tomography (V/P(SPET)) applied in clinical routine might enhance information compared with V/P(PLANAR) and to streamline data processing for the demands of clinical routine. Th...

Structural defects in zinc oxide (ZnO) nanoparticles are complex and hard to be controlled during the synthesis, however, diversifying the chemical and physical performances. Here we report a rapid and low-temperature deposition method to fabricate planar-defect-rich ZnO nanoparticles on freestanding and aligned carbon nanotube films, different from common treatments which remove structural def...

The Drosophila scribble gene regulates apical-basal polarity and is implicated in control of cellular architecture and cell growth control. Mutations in mammalian Scrib (circletail; Crc mutant) also result in abnormalities suggestive of roles in planar cell polarity regulation. We show that Crc mutants develop heart malformations and cardiomyopathy attributable to abnormalities in cardiomyocyte...

Closure of donor site of the flap has special problems. Reduction of this site will decrease the morbidity of operation. In this study, we present our experience in donor site size reduction. METHODS Between 2006 and 2008, 15 patients with skin and soft tissue defects underwent operation. In all patients, coverage of defect was performed with various flaps. Substratum horizontal mat-tress sut...

A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, c...

A visibility representation of a graph maps vertices to horizontal segments and edges to vertical segments. For a weak-visibility representation, if the vertices of the original graph are adjacent, the corresponding segments will ’see’ each other. For a strong-visibility representation, the converse is true as well. Here we present a detailed step-by-step construction of a weak-visibility repre...

The technique of ultraviolet reflection ratio measurement is modified from the traditional albedo measurement in order to compensate for unusual inflation of the reflection ratio found previously in non-horizontal surface ultraviolet reflection studies. Data collected to test this method of reflection ratio collection shows there is significant reduction in the inflation. In order to collect UV...

This paper deals with offline handwriting signature verification. We propose a planar neuronal model of signature image. Planar models are generally based on delimiting homogenous zones of images; we propose in this paper an automatic segmentation approach into bands of signature images. Signature image is modeled by a planar neuronal model with horizontal secondary models and a vertical princi...

An orthogonal drawing of a graph is a planar drawing where each edge is drawn as a sequence of horizontal and vertical line segments. Finding a bend-minimized orthogonal drawing of a planar graph of maximum degree 4 is NP-hard. The problem becomes tractable for planar graphs of maximum degree 3, and the fastest known algorithm takes O(n5 logn) time. Whether a faster algorithm exists has been a ...