High‐quality pagination for publishing

The problem of line breaking consists of finding the best way to split paragraphs into lines. It has been cleverly addressed by the total‐fit algorithm exposed by Knuth and Plass in a well‐known paper. Similarly, page‐breaking algorithms break the content flow of a document into page units. Formatting languages—such as the World Wide Web Consortium standard Extensible Stylesheet Language Formatting Objects (XSL‐FO)—allow users to set which content should be kept in the same page and how many isolated lines are acceptable at the beginning/end of each page. The strategies most formatters adopt to meet these requirements, however, are not satisfactory for many publishing contexts as they very often generate unpleasant empty areas. In that case, typographers are required to manually craft the results in order to completely fill pages. This paper presents a page‐breaking algorithm that extends the original Knuth and Plass line‐breaking approach and produces high‐quality documents without unwanted empty areas. The basic idea consists of delaying the definitive choice of breaks in the line‐breaking process in order to provide a larger set of alternatives to the actual pagination step. The algorithm also allows users to decide the set of properties to be adjusted for pagination and their variation ranges. An application of the algorithm to XSL‐FO is also presented, with an extension of the language that allows users to drive the pagination process. The tool, named FOP+, is a customized version of the open‐source Apache Formatting Objects Processor formatter. Copyright © 2011 John Wiley & Sons, Ltd.     

Succinct Representation of Labeled Graphs

In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our main results are the succinct representations of labeled and multi-labeled graphs (we consider planar triangulations, planar graphs and k-page graphs) to support various label queries efficiently. The additional space cost to store the labels is essentially the information-theoretic minimum. As far as we know, our representations are the first succinct representations of labeled graphs. We also have two preliminary results to achieve the main contribution. First, we design a succinct representation of unlabeled planar triangulations to support the rank/select of edges in ccw (counter clockwise) order in addition to the other operations supported in previous work. Second, we design a succinct representation for a k-page graph when k is large to support various navigational operations more efficiently. In particular, we can test the adjacency of two vertices in O(lg?k) time, while previous work uses O(k) time.     

Synthesis and characterization of ET(P)S-4 and ET(P)S-10

Phosphorus containing ET(P)S-4 and ET(P)S-10 were synthesized from gels of composition xNa₂O–0.6KF–0.2TiO₂–(1.28 − 4y)xHCl–yP₂O₅–1.49SiO₂–39.5H₂O at 190 °C for 3 days. The XRD patterns are almost identical to the corresponding ETS samples. The presence of phosphorus in the initial gel influences the kinetic parameters of the crystallization process, the morphology and the size of the crystals. The ³¹P-NMR of the samples show that part of the phosphorus is attached at the siliceous surface as dihydrogenophosphate SiOPO(OH)₂ groups and cannot be introduced in a tetrahedral or octahedral framework position.     

A spatial logic for concurrency (part I)

We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to composition, local name restriction, and a primitive fresh name quantifier. Properties can also be defined by recursion; a central aim of this paper is then the combination of a logical notion of freshness with inductive and coinductive definitions of properties.     

Structural insights into Alzheimer filament assembly pathways based on site-directed mutagenesis and S-glutathionylation of three-repeat neuronal Tau protein

Although Tau and MAP2 readily assemble into straight filaments (SFs), Tau's unique ability to form paired-helical filaments (PHFs) may offer clues as to why Tau's microtubule-binding region (MTBR) is the exclusive building block of the neurofibrillary tangles that accumulate during Alzheimer's disease. To learn more about the factors permitting Tau to form both SFs and PHFs, we investigated the microtubule binding, thiol oxidation, and polymerization reactions of the monomer and dimer forms of Tau and MAP2 MTBRs. This review focuses on electron microscopic evidence (1) that facilitated the identification of amino acid residues within 3-repeat Tau that promote PHF formation; and (2) provided experimental evidence for the polymerization of S-glutathionylated three-repeat Tau, a reaction that unambiguously demonstrates that disulfide-linked Tau-S-S-Tau dimer formation is not a compulsory step in filament assembly. We also consider these findings within the context of current views on the genetic and biochemical basis of Tau fibrillogenesis.     

First-Void Urine Microbiome in Women with Chlamydia trachomatis Infection

Background: Chlamydia trachomatis (CT) is the agent of the most common bacterial sexually transmitted infection worldwide. Until now, little information is available about the microbial composition of urine samples during CT urethritis. Therefore, in this study, we characterized the microbiome and metabolome profiles of first-void urines in a cohort of women with CT urethral infection attending an STI clinic. Methods: Based on CT positivity by nucleic acid amplification techniques on urine samples, the enrolled women were divided into two groups, i.e., “CT-negative” (n = 21) and “CT-positive” (n = 11). Urine samples were employed for (i) the microbiome profile analysis by means of 16s rRNA gene sequencing and (ii) the metabolome analysis by ¹H-NMR. Results: Irrespective of CT infection, the microbiome of first-void urines was mainly dominated by Lactobacillus, L. iners and L. crispatus being the most represented species. CT-positive samples were characterized by reduced microbial biodiversity compared to the controls. Moreover, a significant reduction of the Mycoplasmataceae family—in particular, of the Ureaplasma parvum species—was observed during CT infection. The Chlamydia genus was positively correlated with urine hippurate and lactulose. Conclusions: These data can help elucidate the pathogenesis of chlamydial urogenital infections, as well as to set up innovative diagnostic and therapeutic approaches.     

An efficient distributed algorithm for generating and updating multicast trees

As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distributed technique for dynamically updating the multicast tree. The approach proposed has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that the distributed algorithm performs as well as the centralized version, providing good levels of convergence time and communication complexity.