The Partial Visibility Representation Extension Problem

For a graph $G$, a function $\psi$ is called a \emph{bar visibility representation} of $G$ when for each vertex $v \in V(G)$, $\psi(v)$ is a horizontal line segment (\emph{bar}) and $uv \in E(G)$ iff there is an unobstructed, vertical, $\varepsilon$-wide line of sight between $\psi(u)$ and $\psi(v)$. Graphs admitting such representations are well understood (via simple characterizations) and recognizable in linear time. For a directed graph $G$, a bar visibility representation $\psi$ of $G$, additionally, puts the bar $\psi(u)$ strictly below the bar $\psi(v)$ for each directed edge $(u,v)$ of $G$. We study a generalization of the recognition problem where a function $\psi'$ defined on a subset $V'$ of $V(G)$ is given and the question is whether there is a bar visibility representation $\psi$ of $G$ with $\psi(v) = \psi'(v)$ for every $v \in V'$. We show that for undirected graphs this problem together with closely related problems are \NP-complete, but for certain cases involving directed graphs it is solvable in polynomial time.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Actividad antibacteriana de alcaloides de Tabernaemontana catharinensis A.DC.

Se estudió la actividad antibacteriana de extractos secos metanólicos y fracción alcaloidea obtenidos de la cortezadel tronco de Tabernaemontana catharinensis A. DC., por el método de difusión de Kirby-Bauer.Se detectó actividad frente a Bacillus subtilis, Staphylococcus aureus, Escherichia coli, Staphylococcus aureus meticilinoresistentes, Streptococcus faecalis, Salmonella enteritidis, Shigella flexneri, Staphylococcus epidermidis, Acynetobacterlwoffii

Knuthian Drawings of Series-Parallel Flowcharts

Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends.Comment: Full versio

Early pathological gambling in co-occurrence with semantic variant primary progressive aphasia: A case report

We have comprehensively documented a case of semantic variant of primary progressive aphasia (sv-PPA) presenting with early-onset pathological gambling (PG). While a growing number of studies have shown the presence of behavioral alterations in patients with sv-PPA, PG has been observed only in the behavioral variant of frontotemporal dementia (bv-FTD). To date, no case of PG with the co-occurrence of prominent semantic deficits at the onset of the disease has been reported in the literature. Impulse disorders at onset may wrongly lead to a misdiagnosis (ie, psychiatric disorders). Therefore, a wider characterization of cognitive/aphasia symptoms in patients presenting impulse disorders and predominant language dysfunctions is recommended

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of max-degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two models and we also prove NP-hardness for a restricted version of the bendless drawing problem for both models. For planar graphs of higher degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Numerical Evidence for Spontaneously Broken Replica Symmetry in 3D Spin Glasses

By numerical simulations of the $3d$ Ising spin glass we find evidence that spontaneous replica symmetry breaking theory and not the droplet model describes with good accuracy the equilibrium behavior of the system.Comment: PHYSREV format, 2 .ps figures added with figure command in uufiles forma

The antibacterial activity of alkaloids obtained from Tabernaemontana catharinensis A.DC.

Se estudió la actividad antibacteriana de extractos secos metanólicos y fracción alcaloidea obtenidos de la corteza del tronco de Tabernaemontana catharinensis A. DC., por el método de difusión de Kirby-Bauer. Se detectó actividad frente a Bacillus subtilis, Staphylococcus aureus, Escherichia coli, Staphylococcus aureus meticilino resistentes, Streptococcus faecalis, Salmonella enteritidis, Shigella flexneri, Staphylococcus epidermidis, Acynetobacter lwoffii.In this work the antibacterial activity of dry methanol extracts and alkaloid fraction, obtained from the root bark of Tabernaemontana catharinensis A. DC. was studied in accordance with the standardized Kirby-Bauer technique. Antibacterial activity was detected against Bacillus subtilis, Staphylococcus aureus, Escherichia coli, methicillin-resistant Staphylococcus aureus, Streptococcus faecalis, Salmonella enteritidis, Shigella flexneri, Staphylococcus epidermidis, Acynetobacter lwoffii

Control de un sistema fotovoltaico con asistencia de red para la producción de hidrógeno

La capacidad de almacenamiento y transporte de energía de alta calidad hace del hidrógeno un excelente vector energético. Debido a que no se encuentra naturalmente aislado, este elemento requiere una determinada cantidad de energía para su extracción de diversas fuentes, las cuales se pueden clasificar en combustibles fósiles, biomasa o agua. Entre los diversos métodos de producción de hidrógeno existentes se destaca la electrólisis del agua, cuya principal ventaja es que admite la energía eléctrica generada a partir de fuentes renovables. El hidrógeno producido de esta manera queda exento de emisiones de carbono, condición necesaria para que este vector energético constituya una alternativa sustentable a los combustibles fósiles

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity

We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We establish a complexity dichotomy with respect to both the maximum degree and the level-width, that is, the maximum number of vertices that share a level. Our study of Ordered Level Planarity is motivated by connections to several other graph drawing problems. Geodesic Planarity asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a polygonal path composed of line segments with two adjacent directions from a given set $S$ of directions symmetric with respect to the origin. Our results on Ordered Level Planarity imply $NP$-hardness for any $S$ with $|S|\ge 4$ even if the given graph is a matching. Katz, Krug, Rutter and Wolff claimed that for matchings Manhattan Geodesic Planarity, the case where $S$ contains precisely the horizontal and vertical directions, can be solved in polynomial time [GD'09]. Our results imply that this is incorrect unless $P=NP$. Our reduction extends to settle the complexity of the Bi-Monotonicity problem, which was proposed by Fulek, Pelsmajer, Schaefer and \v{S}tefankovi\v{c}. Ordered Level Planarity turns out to be a special case of T-Level Planarity, Clustered Level Planarity and Constrained Level Planarity. Thus, our results strengthen previous hardness results. In particular, our reduction to Clustered Level Planarity generates instances with only two non-trivial clusters. This answers a question posed by Angelini, Da Lozzo, Di Battista, Frati and Roselli.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Molecular Basis of Phenylketonuria in Italy

n/