Drawing Planar Graphs with a Prescribed Inner Face

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 testing algorithm. If a drawing extension exists, it can be computed in the same running time

Production of the h_c and h_b and Implications for Quarkonium Spectroscopy

The recent observation of the h_c is an important test of QCD calculations and provides constraints on models of quarkonium spectroscopy. In this contribution I discuss some of these implications and describe methods to search for the h_c and h_b via radiative transitions and other means.Comment: Talk presented at the 1st Meeting of the APS Topical Group on Hadronic Physics (Fermilab, Oct 24-26, 2004), 4 pages, 1 figure, uses jpconf. References adde

Septal Pore Apparatus Ultrastructure in Tremella Foliacea Pers. Ex Fr. and Tremellodon Gelatinosum (Scop.) Pers.

SUMMARYMost Basidiomycetes are characterized by dolipores with parenthesomes that are multiperforate, imperforate or pauciperforate. Electron micrographs of Tremellae, however, show dolipore septa with banded material in the orifices and vesiculate parenthesomes. We have studied the fine structure of Tremella foliacea Pers. ex Fr. and Tremellodon gelatinosum (Scop.) Pers. In these two species we describe several considerable differences which question the phylogeny suggested by some authors, within the Basidiomycetes. Ultrastructural similarities found in the dolipore of Tremella foliacea and in the pore of a few Ascomycetes could suggest that the most primitive dolipore is the Tremella-type

Human Breast Milk: A Source of Potential Probiotic Candidates

This study focuses on the isolation of lactobacilli/bifidobacteria from human breast milk and their first characterization, in the perspective to find new probiotic candidates to be included in food products. More specifically, breast-milk-isolated strains demonstrated a very good aptitude to adhere to intestinal cells, in comparison with L. rhamnosus GG strain, taken as reference. The same behavior has been found for hydrophobicity/auto-aggregation properties. A remarkable antagonistic activity was detected for these isolates not only against spoilage and pathogenic species of food interest, but also against the principal etiological agents of intestinal infections. Indeed, isolated strains impaired spoilage and pathogenic species growth, as well as biofilm formation by gut pathogens. In addition, breast milk strains were characterized for their antibiotic susceptibility, displaying species-specific and strain-specific susceptibility patterns. Finally, to assess their technological potential, the fermentation kinetics and viability of breast milk strains in pasteurized milk were investigated, also including the study of the volatile molecule profiles. In this regard, all the strains pointed out the release of aroma compounds frequently associated with the sensory quality of several dairy products such as acetic acid, diacetyl, acetoin, acetaldehyde. Data here reported point up the high potential of breast-milk-isolated strains as probiotics

Planar Drawings of Fixed-Mobile Bigraphs

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 case, we show NP-hardness. For k=0 and under additional constraints on the positions of the fixed or mobile vertices, we either prove that the problem is polynomial-time solvable or prove that it belongs to NP. Finally, we present a polynomial-time testing algorithm for a certain type of "layered" 1-bend drawings

Robust Hyperproperty Preservation for Secure Compilation (Extended Abstract)

We map the space of soundness criteria for secure compilation based on the preservation of hyperproperties in arbitrary adversarial contexts, which we call robust hyperproperty preservation. For this, we study the preservation of several classes of hyperproperties and for each class we propose an equivalent "property-free" characterization of secure compilation that is generally better tailored for proofs. Even the strongest of our soundness criteria, the robust preservation of all hyperproperties, seems achievable for simple transformations and provable using context back-translation techniques previously developed for showing fully abstract compilation. While proving the robust preservation of hyperproperties that are not safety requires such powerful context back-translation techniques, for preserving safety hyperproperties robustly, translating each finite trace prefix back to a source context seems to suffice

Robustly Safe Compilation

Secure compilers generate compiled code that withstands many target-level attacks such as alteration of control flow, data leaks or memory corruption. Many existing secure compilers are proven to be fully abstract, meaning that they reflect and preserve observational equivalence. Fully abstract compilation is strong and useful but, in certain cases, comes at the cost of requiring expensive runtime constructs in compiled code. These constructs may have no relevance for security, but are needed to accommodate differences between the source and target languages that fully abstract compilation necessarily needs

How Listeria monocytogenes Shapes Its Proteome in Response to Natural Antimicrobial Compounds

The goal of this study was to investigate the adaptation of L. monocytogenes Scott A cells to treatments with sublethal doses of antimicrobials (ethanol, citral, carvacrol, E-2-hexenal and thyme essential oil). The survival of L. monocytogenes cells was not affected by the antimicrobials at the concentrations assayed, with the exception of ethanol (1% v/v) and thyme essential oil (100 mg/L), which decreased cell viability from 8.53 \ub1 0.36 to 7.20 \ub1 0.22 log CFU/mL (P = 0.04). We subsequently evaluated how L. monocytogenes regulates and shapes its proteome in response to antimicrobial compounds. Compared to the control cells grown under optimal conditions, L. monocytogenes treated for 1 h with the antimicrobial compounds showed increased or decreased ( 65 or 642-fold, respectively, P < 0.05) levels of protein synthesis for 223 protein spots. As shown multivariate clustering analysis, the proteome profiles differed between treatments. Adaptation and shaping of proteomes mainly concerned cell cycle control, cell division, chromosome, motility and regulatory related proteins, carbohydrate, pyruvate, nucleotide and nitrogen metabolism, cofactors and vitamins and stress response with contrasting responses for different stresses. Ethanol, citral (85 mg/l) or (E)-2-hexenal (150 mg/L) adapted cells increased survival during acid stress imposed under model (BHI) and food-like systems

β\beta-Stars or On Extending a Drawing of a Connected Subgraph

We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion of star complexity of a polygon and show that a drawing $\Gamma_H$ of an induced connected subgraph $H$ can be extended with at most $\min\{ h/2, \beta + \log_2(h) + 1\}$ bends per edge, where $\beta$ is the largest star complexity of a face of $\Gamma_H$ and $h$ is the size of the largest face of $H$. This result significantly improves the previously known upper bound of $72|V(H)|$ [5] for the case where $H$ is connected. We also show that our bound is worst case optimal up to a small additive constant. Additionally, we provide an indication of complexity of the problem of testing whether a star-shaped inner face can be extended to a straight-line drawing of the graph; this is in contrast to the fact that the same problem is solvable in linear time for the case of star-shaped outer face [9] and convex inner face [13].Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018