Molecular design of the Calphabeta interface favors specific pairing of introduced TCRalphabeta in human T cells.

A promising approach to adoptive transfer therapy of tumors is to reprogram autologous T lymphocytes by TCR gene transfer of defined Ag specificity. An obstacle, however, is the undesired pairing of introduced TCRalpha- and TCRbeta-chains with the endogenous TCR chains. These events vary depending on the individual endogenous TCR and they not only may reduce the levels of cell surface-introduced TCR but also may generate hybrid TCR with unknown Ag specificities. We show that such hybrid heterodimers can be generated even by the pairing of human and mouse TCRalpha- and TCRbeta-chains. To overcome this hurdle, we have identified a pair of amino acid residues in the crystal structure of a TCR that lie at the interface of associated TCR Calpha and Cbeta domains and are related to each other by both a complementary steric interaction analogous to a "knob-into-hole" configuration and the electrostatic environment. We mutated the two residues so as to invert the sense of this interaction analogous to a charged "hole-into-knob" configuration. We show that this inversion in the CalphaCbeta interface promotes selective assembly of the introduced TCR while preserving its specificity and avidity for Ag ligand. Noteworthily, this TCR modification was equally efficient on both a Mu and a Hu TCR. Our data suggest that this approach is generally applicable to TCR independently of their Ag specificity and affinity, subset distribution, and species of origin. Thus, this strategy may optimize TCR gene transfer to efficiently and safely reprogram random T cells into tumor-reactive T cells.

Omnidirectional Depth Computation from a Single Image

Omnidirectional cameras offer a much wider field of view than the perspective ones and alleviate the problems due to occlusions. However, both types of cameras suffer from the lack of depth perception. A practical method for obtaining depth in computer vision is to project a known structured light pattern on the scene avoiding the problems and costs involved by stereo vision. This paper is focused on the idea of combining omnidirectional vision and structured light with the aim to provide 3D information about the scene. The resulting sensor is formed by a single catadioptric camera and an omnidirectional light projector. It is also discussed how this sensor can be used in robot navigation applications

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Constraints on the upper Permian to upper Triassic marine carbon isotope curve : case studies from the Tethys

Secular variations of the seawater carbon isotopic composition provide evidence for paleoceanographic and paleoclimatic changes and may serve for chemiostratigraphic correlations. The present study aimed to improve the current knowledge on the Upper Permian and Triassic segment of the Phanerozoic marine carbon isotope curve, whose Triassic part was poorly constrained by previous studies. Profiles of inorganic carbon isotopes are provided for sections from Himalaya (Salt Range, Kashmir, Spiti and Nepal), Oman and North Dobrogea (Romania) on the basis of whole-rock carbonate analysis. The data acquired, together with a literature compilation confirmed that most of the Upper Permian is characterized by high δ13C values (averaging +40/00) but failed to detect a positive excursion as suggested by recent compilations. In the light of these observations, the large drop in δ13C values associated with the end-Permian mass extinction appears to be driven by a sudden transfer of previously stocked 13C depleted carbon, rather than by the overturn of a Late Permian stratified ocean. The Triassic data-set outlines significant secular variations. The best documented is a carbon isotope positive excursion just across the Lower-Middle Triassic boundary, globally developed since it was detected in various paleogeographic settings. It is interpreted to reflect variations in surface ocean chemistry, possibly related to increased primary productivity, at times when the biotic recovery after the end-Permian mass-extinction began to accelerate significantly and when a sharp rise in seawater δ34S values occurred globally. Strontium isotope data obtained from well preserved biogenic phosphates allow a refinement of the Middle Triassic segment of the seawater strontium isotope curve and show a major inflexion point of the seawater strontium isotope curve also near the Lower Triassic - Middle Triassic boundary. These facts suggest that the transition from the Early to the Middle Triassic was a time of revolutionary global change which represented an important step in the evolution of Mesozoic marine environments. A tentative carbon isotope curve for the Upper Permian to Upper Triassic time interval is proposed. Its major features are: ? high but constant δ13C values during the Late Permian ? a sharp drop in δ13C values in the latest Permian ? subsequent recovery of δ13C values ? a short-lived positive excursion across the Early-Middle Triassic boundary ? a gradual rise in δ13C values starting in the Late Ladinian or in the Early Carnian It is foreseen that these fluctuations of the carbon isotope curve may serve as chronostratigraphic markers and further assist in the correlation of Permian and Triassic carbonate deposits.

Mutigrid preconditioner for nonconforming discretization of elliptic problems with jump coefficients

In this paper, we present a multigrid preconditioner for solving the linear system arising from the piecewise linear nonconforming Crouzeix-Raviart discretization of second order elliptic problems with jump coe fficients. The preconditioner uses the standard conforming subspaces as coarse spaces. Numerical tests show both robustness with respect to the jump in the coe fficient and near-optimality with respect to the number of degrees of freedom.

Schwarz methods for a preconditioned WOPSIP method for elliptic problems

We construct and analyze non-overlapping Schwarz methods for a preconditioned weakly over-penalized symmetric interior penalty (WOPSIP) method for elliptic problems.

Transmission delays in residual computation

The design of control, estimation or diagnosis algorithms most often assumes that all available process variables represent the system state at the same instant of time. However, this is never true in current network systems, because of the unknown deterministic or stochastic transmission delays introduced by the communication network. During the diagnosing stage, this will often generate false alarms. Under nominal operation, the different transmission delays associated with the variables that appear in the computation form produce discrepancies of the residuals from zero. A technique aiming at the minimisation of the resulting false alarms rate, that is based on the explicit modelling of communication delays and on their best-case estimation is proposed

Modelling the cardiovascular system for automatic interpretation of the blood pressure curve

A four compartment model of the cardiovascular system is developed. To allow for easy interpretation and to minimise the number of parameters, an effort was made to keep the model as simple as possible. A sensitivity analysis is first carried out to determine which are the most important model parameters to characterise the blood pressure signal. A four stage process is then described which accurately determines all parameter values. This process is applied to data from three patients and good agreement is shown in all cases.

A Monte Carlo method for accelerating the computation of animated radiosity sequences

Realistic rendering animation is known to be an expensive processing task when physically-based global illumination methods are used in order to improve illumination details. This paper presents an acceleration technique to compute animations in radiosity environments. The technique is based on an interpolated approach that exploits temporal coherence in radiosity. A fast global Monte Carlo pre-processing step is introduced to the whole computation of the animated sequence to select important frames. These are fully computed and used as a base for the interpolation of all the sequence. The approach is completely view-independent. Once the illumination is computed, it can be visualized by any animated camera. Results present significant high speed-ups showing that the technique could be an interesting alternative to deterministic methods for computing non-interactive radiosity animations for moderately complex scenarios

Sex differences in the computation of traveling distance

Path integration is known to provide information to keep track of spatial location. Surprisingly, few investigations concerning sex differences in computation of the traveling distance have been done. This work was aimed at analyzing the reproduction of both passive and active linear displacements in women and men. To this end, the displacement of blindfolded subjects was done in a wheelchair, then on foot, three times in each condition for a fixed distance. Copies of passive and active traveling distance, distance estimations and pointing responses towards the starting point were analyzed. In passive condition and comparatively to men, women error was larger. Whereas traveling distance was generally underestimated in women, it was overestimated in men. In active condition, no sex differences were observed. When blindfolded subjects have to estimate the traveling distance, the female error was larger than the male one. But, when subjects were asked to indicate the visual cue corresponding to the traveling distance, the male error was larger than the female one. Finally, pointing to the starting point (0°) after a whole-body rotation showed a larger deviation from 0° in men than in women. These results suggest that sex of the subjects influence brain computation of path integration information.

Algorithm creation and optimization for the crew pairing problem

Algoritmo que optimiza y crea pairings para tripulaciones de líneas aéreas mediante la posterior programación en Java.

Identity based encription with tate pairing

L'objectiu principal del projecte és l'estudi, la implementació d'algoritmes i protocols amb criptografia basada en la identitat. Aquesta o Identity Based Encryption (IBE) s'utilitza per simplificar el procés de comunicacions segures, com per exemple el correu electrònic. IBE permet a les polítiques de seguretat ser codificades directament sense la necessitat d'usar certificats. Aquests esquemes van ser proposats inicialment per A. Shamir a l'any 1984 i han estat objecte d'estudi per D. Boneh, S. Galbraith, etc. En aquest farem l'estudi dels emparellaments de Werl i Tate a través de l'algorisme de Miller, que ens permetrà implementar aquests emparellaments sobre corbes el·líptiques supersingulars.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.