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.     

Exploring networks with traceroute-like probes: Theory and simulations

Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destination, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. In this paper, we explore these biases and provide a statistical analysis of their origin. We derive an analytical approximation for the probability of edge and vertex detection that exploits the role of the number of sources and targets and allows us to relate the global topological properties of the underlying network with the statistical accuracy of the sampled graph. In particular, we find that the edge and vertex detection probability depends on the betweenness centrality of each element. This allows us to show that shortest path routed sampling provides a better characterization of underlying graphs with broad distributions of connectivity. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in network models with different topologies. We show that sampled graphs provide a fair qualitative characterization of the statistical properties of the original networks in a fair range of different strategies and exploration parameters. Moreover, we characterize the level of redundancy and completeness of the exploration process as a function of the topological properties of the network. Finally, we study numerically how the fraction of vertices and edges discovered in the sampled graph depends on the particular deployements of probing sources. The results might hint the steps toward more efficient mapping strategies.     

Data-driven generation of spatio-temporal routines in human mobility

The generation of realistic spatio-temporal trajectories of human mobility is of fundamental importance in a wide range of applications, such as the developing of protocols for mobile ad-hoc networks or what-if analysis in urban ecosystems. Current generative algorithms fail in accurately reproducing the individuals’ recurrent schedules and at the same time in accounting for the possibility that individuals may break the routine during periods of variable duration. In this article we present Ditras (DIary-based TRAjectory Simulator), a framework to simulate the spatio-temporal patterns of human mobility. Ditras operates in two steps: the generation of a mobility diary and the translation of the mobility diary into a mobility trajectory. We propose a data-driven algorithm which constructs a diary generator from real data, capturing the tendency of individuals to follow or break their routine. We also propose a trajectory generator based on the concept of preferential exploration and preferential return. We instantiate Ditras with the proposed diary and trajectory generators and compare the resulting algorithm with real data and synthetic data produced by other generative algorithms, built by instantiating Ditras with several combinations of diary and trajectory generators. We show that the proposed algorithm reproduces the statistical properties of real trajectories in the most accurate way, making a step forward the understanding of the origin of the spatio-temporal patterns of human mobility.     

PET-Derived Radiomics and Artificial Intelligence in Breast Cancer: A Systematic Review

Breast cancer (BC) is a heterogeneous malignancy that still represents the second cause of cancer-related death among women worldwide. Due to the heterogeneity of BC, the correct identification of valuable biomarkers able to predict tumor biology and the best treatment approaches are still far from clear. Although molecular imaging with positron emission tomography/computed tomography (PET/CT) has improved the characterization of BC, these methods are not free from drawbacks. In recent years, radiomics and artificial intelligence (AI) have been playing an important role in the detection of several features normally unseen by the human eye in medical images. The present review provides a summary of the current status of radiomics and AI in different clinical settings of BC. A systematic search of PubMed, Web of Science and Scopus was conducted, including all articles published in English that explored radiomics and AI analyses of PET/CT images in BC. Several studies have demonstrated the potential role of such new features for the staging and prognosis as well as the assessment of biological characteristics. Radiomics and AI features appear to be promising in different clinical settings of BC, although larger prospective trials are needed to confirm and to standardize this evidence.