T-Cell Receptors Binding Orientation over Peptide/MHC Class I Is Driven by Long-Range Interactions.

Crystallographic data about T-Cell Receptor - peptide - major histocompatibility complex class I (TCRpMHC) interaction have revealed extremely diverse TCR binding modes triggering antigen recognition. Understanding the molecular basis that governs TCR orientation over pMHC is still a considerable challenge. We present a simplified rigid approach applied on all non-redundant TCRpMHC crystal structures available. The CHARMM force field in combination with the FACTS implicit solvation model is used to study the role of long-distance interactions between the TCR and pMHC. We demonstrate that the sum of the coulomb interactions and the electrostatic solvation energies is sufficient to identify two orientations corresponding to energetic minima at 0° and 180° from the native orientation. Interestingly, these results are shown to be robust upon small structural variations of the TCR such as changes induced by Molecular Dynamics simulations, suggesting that shape complementarity is not required to obtain a reliable signal. Accurate energy minima are also identified by confronting unbound TCR crystal structures to pMHC. Furthermore, we decompose the electrostatic energy into residue contributions to estimate their role in the overall orientation. Results show that most of the driving force leading to the formation of the complex is defined by CDR1,2/MHC interactions. This long-distance contribution appears to be independent from the binding process itself, since it is reliably identified without considering neither short-range energy terms nor CDR induced fit upon binding. Ultimately, we present an attempt to predict the TCR/pMHC binding mode for a TCR structure obtained by homology modeling. The simplicity of the approach and the absence of any fitted parameters make it also easily applicable to other types of macromolecular protein complexes.

Influence of physico-chemical material characteristics on staphylococcal biofilm formation--a qualitative and quantitative in vitro analysis of five different calcium phosphate bone grafts.

Various compositions of synthetic calcium phosphates (CaP) have been proposed and their use has considerably increased over the past decades. Besides differences in physico-chemical properties, resorption and osseointegration, artificial CaP bone graft might differ in their resistance against biofilm formation. We investigated standardised cylinders of 5 different CaP bone grafts (cyclOS, chronOS (both β-TCP (tricalcium phosphate)), dicalcium phosphate (DCP), calcium-deficient hydroxyapatite (CDHA) and α-TCP). Various physico-chemical characterisations e.g., geometrical density, porosity, and specific surface area were investigated. Biofilm formation was carried out in tryptic soy broth (TSB) and human serum (SE) using Staphylococcus aureus (ATCC 29213) and S. epidermidis RP62A (ATCC 35984). The amount of biofilm was analysed by an established protocol using sonication and microcalorimetry. Physico-chemical characterisation showed marked differences concerning macro- and micropore size, specific surface area and porosity accessible to bacteria between the 5 scaffolds. Biofilm formation was found on all scaffolds and was comparable for α-TCP, chronOS, CDHA and DCP at corresponding time points when the scaffolds were incubated with the same germ and/or growth media, but much lower for cyclOS. This is peculiar because cyclOS had an intermediate porosity, mean pore size, specific surface area, and porosity accessible to bacteria. Our results suggest that biofilm formation is not influenced by a single physico-chemical parameter alone but is a multi-step process influenced by several factors in parallel. Transfer from in vitro data to clinical situations is difficult; thus, advocating the use of cyclOS scaffolds over the four other CaP bone grafts in clinical situations with a high risk of infection cannot be clearly supported based on our data.

Estimation of protein coding density in a corpus of DNA sequence data

A number of experimental methods have been reported for estimating the number of genes in a genome, or the closely related coding density of a genome, defined as the fraction of base pairs in codons. Recently, DNA sequence data representative of the genome as a whole have become available for several organisms, making the problem of estimating coding density amenable to sequence analytic methods. Estimates of coding density for a single genome vary widely, so that methods with characterized error bounds have become increasingly desirable. We present a method to estimate the protein coding density in a corpus of DNA sequence data, in which a ‘coding statistic’ is calculated for a large number of windows of the sequence under study, and the distribution of the statistic is decomposed into two normal distributions, assumed to be the distributions of the coding statistic in the coding and noncoding fractions of the sequence windows. The accuracy of the method is evaluated using known data and application is made to the yeast chromosome III sequence and to C.elegans cosmid sequences. It can also be applied to fragmentary data, for example a collection of short sequences determined in the course of STS mapping.

Leveraging explicitly disclosed location information to understand tourist dynamics: a case study

In recent years, the large deployment of mobile devices has led to a massiveincrease in the volume of records of where people have been and when they were there.The analysis of these spatio-temporal data can supply high-level human behaviorinformation valuable to urban planners, local authorities, and designer of location-basedservices. In this paper, we describe our approach to collect and analyze the history ofphysical presence of tourists from the digital footprints they publicly disclose on the web.Our work takes place in the Province of Florence in Italy, where the insights on thevisitors’ flows and on the nationalities of the tourists who do not sleep in town has beenlimited to information from survey-based hotel and museums frequentation. In fact, mostlocal authorities in the world must face this dearth of data on tourist dynamics. In thiscase study, we used a corpus of geographically referenced photos taken in the provinceby 4280 photographers over a period of 2 years. Based on the disclosure of the locationof the photos, we design geovisualizations to reveal the tourist concentration and spatiotemporalflows. Our initial results provide insights on the density of tourists, the points ofinterests they visit as well as the most common trajectories they follow.

How do coil configuration and packing density influence intra-aneurysmal hemodynamics?

Endovascular coiling is a well-established therapy for treating intracranial aneurysms. Nonetheless, postoperative hemodynamic changes induced by this therapy remain not fully understood. The purpose of this work is to assess the influence of coil configuration and packing density on intra-aneurysmal hemodynamics

Informed Control Over Inputs and Extent of Industrial Processing, June 2005

Stylized facts regarding the industrial process include emphases on obtaining information about and control over the quality of raw materials. We provide a model that establishes conditions under which informed control involves ensuring uniformity in inputs and increased uniformity encourages more extensive processing. We show when the Boltzmann-Shannon entropy statistic is an appropriate measure of uniformity.

Report of Recommendations to the Iowa Department of Administrative Services on the Review of General and Application Controls over the HRIS and Payroll Systems, May 10, 2004 through June 4, 2004

State Audit Reports

Low-density parity-check codes for nonergodic block-fading channels

We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not performwell under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels.

Report of Recommendations to Iowa State University of Science and Technology on the Review of Selected General and Application Controls over the University's Accounts Payable and Purchasing Systems, March 28 through April 28, 2005

State University Audit Report

[Archives de la Parole]. , Don durang : sung at the making over of the bride (Hō song) ; Aṛandi Durang : marriage song sung at the first day of the marriage feast, when the bride is about to leave her parents (Hō song) / [Sir George Grierson], éd. ; Linguistic survey of India ; Choeur de femmes, chant ; accompagnement de percussions

[Traditions. Asie. Inde. Chotā Nāgpur]

Goal recognition over POMDPs: inferring the intention of a POMDP agent

Plan recognition is the problem of inferring the goals and plans of an agent from partial observations of her behavior. Recently, it has been shown that the problem can be formulated and solved usingplanners, reducing plan recognition to plan generation.In this work, we extend this model-basedapproach to plan recognition to the POMDP setting, where actions are stochastic and states are partially observable. The task is to infer a probability distribution over the possible goals of an agent whose behavior results from a POMDP model. The POMDP model is shared between agent and observer except for the true goal of the agent that is hidden to the observer. The observations are action sequences O that may contain gaps as some or even most of the actions done by the agent may not be observed. We show that the posterior goal distribution P(GjO) can be computed from the value function VG(b) over beliefs b generated by the POMDPplanner for each possible goal G. Some extensionsof the basic framework are discussed, and a numberof experiments are reported.

Generalized low-density codes with BCH constituents for full-diversity near-outage performance

A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. Aclassical GLD code for ergodic channels (e.g., the AWGN channel,the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.

Full diversity product codes for block erasure and block fading channels

We show how to build full-diversity product codes under both iterative encoding and decoding over non-ergodic channels, in presence of block erasure and block fading. The concept of a rootcheck or a root subcode is introduced by generalizing the same principle recently invented for low-density parity-check codes. We also describe some channel related graphical properties of the new family of product codes, a familyreferred to as root product codes.

ClubADSL: When your neighbors are your friends

ADSL is becoming the standard form of residential and small-business broadband Internet access due to, primarily, its low deployment cost. These ADSL residential lines are often deployed with 802.11 Access Points (AP) that providewireless connectivity. Given the density of ADSL deployment, it is often possible for a residential wireless client to be in range of several other APs, belonging to neighbors, with ADSL connectivity. While the ADSL technology has showed evident limits in terms of capacity (with speeds ranging 1-10 Mbps), the short-range wireless communication can guarantee a muchhigher capacity (up to 20 Mbps). Furthermore, the ADSL links in the neighborhood are generally under-utilized, since ADSL subscribers do not connect 100% of the time. Therefore, it is possible for a wireless client to simultaneously connect to several APs in range and effectively aggregate their available ADSL bandwidth.In this paper, we introduce ClubADSL, a wireless client that can simultaneously connect to several APs in range on different frequencies and aggregate both their downlink and uplink capacity. ClubADSL is a software that runs locally on the client-side, and it requires neither modification to the existing Internet infrastructure, nor any hardware/protocol upgradesto the 802.11 local area network. We show the feasibility of ClubADSL in seamlessly transmitting TCP traffic, and validate its implementation both in controlled scenarios and with current applications over real ADSL lines. In particular we show that a ClubADSL client can greatly benefit from the aggregated download bandwidth in the case of server-client applications such as video streaming, but can also take advantage of the increased upload bandwidth greatly reducing download times with incentive-based P2P applications such as BitTorrent.

Outage thresholds of LDPC codes over nonergodic block-fading channels

This paper derives approximations allowing the estimation of outage probability for standard irregular LDPC codes and full-diversity Root-LDPC codes used over nonergodic block-fading channels. Two separate approaches are discussed: a numerical approximation, obtained by curve fitting, for both code ensembles, and an analytical approximation for Root-LDPC codes, obtained under the assumption that the slope of the iterative threshold curve of a given code ensemble matches the slope of the outage capacity curve in the high-SNR regime.