A topological RNA structure is derived by fattening the edges of a contact structure into ribbons. The shape of a topological RNA structure is obtained by collapsing the stacks of the structure into single arcs and by removing any arcs of length one, as well as isolated vertices. A shape contains the key topological information of the molecular conformation and for fixed topological genus there...

Several studies report a right hemisphere advantage for visuospatial integration and a left hemisphere advantage for inferring conceptual knowledge from patterns of covariation. The present study examined hemispheric asymmetry in the implicit learning of new visual feature combinations. A split-brain patient and normal control participants viewed multishape scenes presented in either the right ...

A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We assume that G is planar and study the problem of finding, for a given k ≥ 0, a planar poly-line drawing of G with at most k bends per edge. In the most general ca...

Parking is often overlooked by urban researchers even though parking consumes large proportions of a city’s physical footprint and imposes significant impediment to more sustainable travel. Underpinning this lack attention suitable data methods capable capturing the complex dynamics parking. Here we redress gap drawing on an emergent source deploying empirical techniques unpack complexity. Data...

We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter ...

Given a plane graph G (i.e., a planar graph with a fixed planar embedding) and a simple cycle C in G whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of G. We characterize when this is possible in terms of simple necessary conditions, which we prove to be sufficient. This also leads to a linear-time te...

We study the complexity of two problems in simultaneous graph drawing. The first problem, GRACSIM DRAWING, asks for finding a simultaneous geometric embedding of two graphs such that only crossings at right angles are allowed. The second problem, K-SEFE, is a restricted version of the topological simultaneous embedding with fixed edges (SEFE) problem, for two planar graphs, in which every priva...

Abstract This paper aims to mobilize the way we think and write about fat bodies while drawing on Jean-Luc Nancy’s philosophy of body. I introduce approach body as an addition contemporary new materialism. His philosophy, so argue, offers a form materialism that allows for phenomenological exploration As such, it can help us understand lived experiences embodiment. Additionally, idea in terms “...

Recovering three-dimensional shape of an object from a single line drawing is a classical problem in computer vision. Methods proposed range from Huffman-Clowes junction labeling, to Kanade's gradient space and skew symmetry analysis, to Sugihara's necessary and sufficient condition for a realizable polyhedral object, to Marill's MSDA shape recovery procedure, and to the recent Leclerc-Fischler...