Urban life: a model of people and places.

We introduce the Urban Life agent-based simulation used by the Ground Truth program to capture the innate needs of a human-like population and explore how such needs shape social constructs such as friendship and wealth. Urban Life is a spatially explicit model to explore how urban form impacts agents' daily patterns of life. By meeting up at places agents form social networks, which in turn affect the places the agents visit. In our model, location and co-location affect all levels of decision making as agents prefer to visit nearby places. Co-location is necessary (but not sufficient) to connect agents in the social network. The Urban Life model was used in the Ground Truth program as a virtual world testbed to produce data in a setting in which the underlying ground truth was explicitly known. Data was provided to research teams to test and validate Human Domain research methods to an extent previously impossible. This paper summarizes our Urban Life model's design and simulation along with a description of how it was used to test the ability of Human Domain research teams to predict future states and to prescribe changes to the simulation to achieve desired outcomes in our simulated world.

A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering.

Persistence diagrams have been widely used to quantify the underlying features of filtered topological spaces in data visualization. In many applications, computing distances between diagrams is essential; however, computing these distances has been challenging due to the computational cost. In this paper, we propose a persistence diagram hashing framework that learns a binary code representation of persistence diagrams, which allows for fast computation of distances. This framework is built upon a generative adversarial network (GAN) with a diagram distance loss function to steer the learning process. Instead of using standard representations, we hash diagrams into binary codes, which have natural advantages in large-scale tasks. The training of this model is domain-oblivious in that it can be computed purely from synthetic, randomly created diagrams. As a consequence, our proposed method is directly applicable to various datasets without the need for retraining the model. These binary codes, when compared using fast Hamming distance, better maintain topological similarity properties between datasets than other vectorized representations. To evaluate this method, we apply our framework to the problem of diagram clustering and we compare the quality and performance of our approach to the state-of-the-art. In addition, we show the scalability of our approach on a dataset with 10k persistence diagrams, which is not possible with current techniques. Moreover, our experimental results demonstrate that our method is significantly faster with the potential of less memory usage, while retaining comparable or better quality comparisons.

Persistent Homology for the Quantitative Evaluation of Architectural Features in Prostate Cancer Histology.

The current system for evaluating prostate cancer architecture is the Gleason grading system which divides the morphology of cancer into five distinct architectural patterns, labeled 1 to 5 in increasing levels of cancer aggressiveness, and generates a score by summing the labels of the two most dominant patterns. The Gleason score is currently the most powerful prognostic predictor of patient outcomes; however, it suffers from problems in reproducibility and consistency due to the high intra-observer and inter-observer variability amongst pathologists. In addition, the Gleason system lacks the granularity to address potentially prognostic architectural features beyond Gleason patterns. We evaluate prostate cancer for architectural subtypes using techniques from topological data analysis applied to prostate cancer glandular architecture. In this work we demonstrate the use of persistent homology to capture architectural features independently of Gleason patterns. Specifically, using persistent homology, we compute topological representations of purely graded prostate cancer histopathology images of Gleason patterns 3,4 and 5, and show that persistent homology is capable of clustering prostate cancer histology into architectural groups through a ranked persistence vector. Our results indicate the ability of persistent homology to cluster prostate cancer histopathology images into unique groups with dominant architectural patterns consistent with the continuum of Gleason patterns. In addition, of particular interest, is the sensitivity of persistent homology to identify specific sub-architectural groups within single Gleason patterns, suggesting that persistent homology could represent a robust quantification method for prostate cancer architecture with higher granularity than the existing semi-quantitative measures. The capability of these topological representations to segregate prostate cancer by architecture makes them an ideal candidate for use as inputs to future machine learning approaches with the intent of augmenting traditional approaches with topological features for improved diagnosis and prognosis.

Conserved disulfide bond is not essential for the adenosine A2A receptor: Extracellular cysteines influence receptor distribution within the cell and ligand-binding recognition.

G protein-coupled receptors (GPCRs) are integral membrane proteins involved in cellular signaling and constitute major drug targets. Despite their importance, the relationship between structure and function of these receptors is not well understood. In this study, the role of extracellular disulfide bonds on the trafficking and ligand-binding activity of the human A2A adenosine receptor was examined. To this end, cysteine-to-alanine mutations were conducted to replace individual and both cysteines in three disulfide bonds present in the first two extracellular loops. Although none of the disulfide bonds were essential for the formation of plasma membrane-localized active GPCR, loss of the disulfide bonds led to changes in the distribution of the receptor within the cell and changes in the ligand-binding affinity. These results indicate that in contrast to many class A GPCRs, the extracellular disulfide bonds of the A2A receptor are not essential, but can modulate the ligand-binding activity, by either changing the conformation of the extracellular loops or perturbing the interactions of the transmembrane domains.

Microwave and magnetic (M(2) ) proteomics of the experimental autoimmune encephalomyelitis animal model of multiple sclerosis.

We hypothesized that quantitative MS/MS-based proteomics at multiple time points, incorporating rapid microwave and magnetic (M(2) ) sample preparation, could enable relative protein expression to be correlated to disease progression in the experimental autoimmune encephalomyelitis (EAE) animal model of multiple sclerosis. To test our hypothesis, microwave-assisted reduction/alkylation/digestion of proteins from brain tissue lysates bound to C8 magnetic beads and microwave-assisted isobaric chemical labeling were performed of released peptides, in 90 s prior to unbiased proteomic analysis. Disease progression in EAE was assessed by scoring clinical EAE disease severity and confirmed by histopathologic evaluation for central nervous system inflammation. Decoding the expression of 283 top-ranked proteins (p <0.05) at each time point relative to their expression at the peak of disease, from a total of 1191 proteins observed in four technical replicates, revealed a strong statistical correlation to EAE disease score, particularly for the following four proteins that closely mirror disease progression: 14-3-3ε (p = 3.4E-6); GPI (p = 2.1E-5); PLP1 (p = 8.0E-4); PRX1 (p = 1.7E-4). These results were confirmed by Western blotting, signaling pathway analysis, and hierarchical clustering of EAE risk groups. While validation in a larger cohort is underway, we conclude that M(2) proteomics is a rapid method to quantify putative prognostic/predictive protein biomarkers and therapeutic targets of disease progression in the EAE animal model of multiple sclerosis.

NeuronMetrics: software for semi-automated processing of cultured neuron images.

Using primary cell culture to screen for changes in neuronal morphology requires specialized analysis software. We developed NeuronMetrics for semi-automated, quantitative analysis of two-dimensional (2D) images of fluorescently labeled cultured neurons. It skeletonizes the neuron image using two complementary image-processing techniques, capturing fine terminal neurites with high fidelity. An algorithm was devised to span wide gaps in the skeleton. NeuronMetrics uses a novel strategy based on geometric features called faces to extract a branch number estimate from complex arbors with numerous neurite-to-neurite contacts, without creating a precise, contact-free representation of the neurite arbor. It estimates total neurite length, branch number, primary neurite number, territory (the area of the convex polygon bounding the skeleton and cell body), and Polarity Index (a measure of neuronal polarity). These parameters provide fundamental information about the size and shape of neurite arbors, which are critical factors for neuronal function. NeuronMetrics streamlines optional manual tasks such as removing noise, isolating the largest primary neurite, and correcting length for self-fasciculating neurites. Numeric data are output in a single text file, readily imported into other applications for further analysis. Written as modules for ImageJ, NeuronMetrics provides practical analysis tools that are easy to use and support batch processing. Depending on the need for manual intervention, processing time for a batch of approximately 60 2D images is 1.0-2.5 h, from a folder of images to a table of numeric data. NeuronMetrics' output accelerates the quantitative detection of mutations and chemical compounds that alter neurite morphology in vitro, and will contribute to the use of cultured neurons for drug discovery.

Geometric algorithms for the analysis of 2D-electrophoresis gels.

In proteomics, two-dimensional gel electrophoresis (2-DE) is a separation technique for proteins. The resulting protein spots can be identified either by using picking robots and subsequent mass spectrometry or by visual cross inspection of a new gel image with an already analyzed master gel. Difficulties especially arise from inherent noise and irregular geometric distortions in 2-DE images. Aiming at the automated analysis of large series of 2-DE images, or at the even more difficult interlaboratory gel comparisons, the bottleneck is to solve the two most basic algorithmic problems with high quality: Identifying protein spots and computing a matching between two images. For the development of the analysis software CAROl at Freie Universität Berlin, we have reconsidered these two problems and obtained new solutions which rely on methods from computational geometry. Their novelties are: 1. Spot detection is also possible for complex regions formed by several "merged" (usually saturated) spots; 2. User-defined landmarks are not necessary for the matching. Furthermore, images for comparison are allowed to represent different parts of the entire protein pattern, which only partially "overlap." The implementation is done in a client server architecture to allow queries via the internet. We also discuss and point at related theoretical questions in computational geometry.