Estimation of a probability in inverse binomial sampling under normalized linear-linear and inverse-linear loss

Sequential estimation of the success probability $p$ in inverse binomial sampling is considered in this paper. For any estimator $\hatvap$, its quality is measured by the risk associated with normalized loss functions of linear-linear or inverse-linear form. These functions are possibly asymmetric, with arbitrary slope parameters $a$ and $b$ for $\hatvap < p$ and $\hatvap > p$ respectively. Interest in these functions is motivated by their significance and potential uses, which are briefly discussed. Estimators are given for which the risk has an asymptotic value as $p \rightarrow 0$, and which guarantee that, for any $p \in (0,1)$, the risk is lower than its asymptotic value. This allows selecting the required number of successes, $\nnum$, to meet a prescribed quality irrespective of the unknown $p$. In addition, the proposed estimators are shown to be approximately minimax when $a/b$ does not deviate too much from $1$, and asymptotically minimax as $\nnum \rightarrow \infty$ when $a=b$.

Architectures for Video-on-Demand content distribution in managed networks

La demanda de contenidos de vídeo ha aumentado rápidamente en los últimos años como resultado del gran despliegue de la TV sobre IP (IPTV) y la variedad de servicios ofrecidos por los operadores de red. Uno de los servicios que se ha vuelto especialmente atractivo para los clientes es el vídeo bajo demanda (VoD) en tiempo real, ya que ofrece una transmisión (streaming) inmediata de gran variedad de contenidos de vídeo. El precio que los operadores tienen que pagar por este servicio es el aumento del tráfico en las redes, que están cada vez más congestionadas debido a la mayor demanda de contenidos de VoD y al aumento de la calidad de los propios contenidos de vídeo. Así, uno de los principales objetivos de esta tesis es encontrar soluciones que reduzcan el tráfico en el núcleo de la red, manteniendo la calidad del servicio en el nivel adecuado y reduciendo el coste del tráfico. La tesis propone un sistema jerárquico de servidores de streaming en el que se ejecuta un algoritmo para la ubicación óptima de los contenidos de acuerdo con el comportamiento de los usuarios y el estado de la red. Debido a que cualquier algoritmo óptimo de distribución de contenidos alcanza un límite en el que no se puede llegar a nuevas mejoras, la inclusión de los propios clientes del servicio (los peers) en el proceso de streaming puede reducir aún más el tráfico de red. Este proceso se logra aprovechando el control que el operador tiene en las redes de gestión privada sobre los equipos receptores (Set-Top Box) ubicados en las instalaciones de los clientes. El operador se reserva cierta capacidad de almacenamiento y streaming de los peers para almacenar los contenidos de vídeo y para transmitirlos a otros clientes con el fin de aliviar a los servidores de streaming. Debido a la incapacidad de los peers para sustituir completamente a los servidores de streaming, la tesis propone un sistema de streaming asistido por peers. Algunas de las cuestiones importantes que se abordan en la tesis son saber cómo los parámetros del sistema y las distintas distribuciones de los contenidos de vídeo en los peers afectan al rendimiento general del sistema. Para dar respuesta a estas preguntas, la tesis propone un modelo estocástico preciso y flexible que tiene en cuenta parámetros como las capacidades de enlace de subida y de almacenamiento de los peers, el número de peers, el tamaño de la biblioteca de contenidos de vídeo, el tamaño de los contenidos y el esquema de distribución de contenidos para estimar los beneficios del streaming asistido por los peers. El trabajo también propone una versión extendida del modelo matemático mediante la inclusión de la probabilidad de fallo de los peers y su tiempo de recuperación en el conjunto de parámetros del modelo. Estos modelos se utilizan como una herramienta para la realización de exhaustivos análisis del sistema de streaming de VoD asistido por los peers para la amplia gama de parámetros definidos en los modelos. Abstract The demand of video contents has rapidly increased in the past years as a result of the wide deployment of IPTV and the variety of services offered by the network operators. One of the services that has especially become attractive to the customers is real-time Video on Demand (VoD) because it offers an immediate streaming of a large variety of video contents. The price that the operators have to pay for this convenience is the increased traffic in the networks, which are becoming more congested due to the higher demand for VoD contents and the increased quality of the videos. Therefore, one of the main objectives of this thesis is finding solutions that would reduce the traffic in the core of the network, keeping the quality of service on satisfactory level and reducing the traffic cost. The thesis proposes a system of hierarchical structure of streaming servers that runs an algorithm for optimal placement of the contents according to the users’ behavior and the state of the network. Since any algorithm for optimal content distribution reaches a limit upon which no further improvements can be made, including service customers themselves (the peers) in the streaming process can further reduce the network traffic. This process is achieved by taking advantage of the control that the operator has in the privately managed networks over the Set-Top Boxes placed at the clients’ premises. The operator reserves certain storage and streaming capacity on the peers to store the video contents and to stream them to the other clients in order to alleviate the streaming servers. Because of the inability of the peers to completely substitute the streaming servers, the thesis proposes a system for peer-assisted streaming. Some of the important questions addressed in the thesis are how the system parameters and the various distributions of the video contents on the peers would impact the overall system performance. In order to give answers to these questions, the thesis proposes a precise and flexible stochastic model that takes into consideration parameters like uplink and storage capacity of the peers, number of peers, size of the video content library, size of contents and content distribution scheme to estimate the benefits of the peer-assisted streaming. The work also proposes an extended version of the mathematical model by including the failure probability of the peers and their recovery time in the set of parameters. These models are used as tools for conducting thorough analyses of the peer-assisted system for VoD streaming for the wide range of defined parameters.

Analysis of the influence of the different variables involved in a damage progression probability model

Motivated by these difficulties, Castillo et al. (2012) made some suggestions on how to build consistent stochastic models avoiding the selection of easy to use mathematical functions, which were replaced by those resulting from a set of properties to be satisfied by the model.

Type-I intermittency with discontinuous reinjection probability density in a truncation model of the derivative nonlinear Schrödinger equation

In previous papers, the type-I intermittent phenomenon with continuous reinjection probability density (RPD) has been extensively studied. However, in this paper type-I intermittency considering discontinuous RPD function in one-dimensional maps is analyzed. To carry out the present study the analytic approximation presented by del Río and Elaskar (Int. J. Bifurc. Chaos 20:1185-1191, 2010) and Elaskar et al. (Physica A. 390:2759-2768, 2011) is extended to consider discontinuous RPD functions. The results of this analysis show that the characteristic relation only depends on the position of the lower bound of reinjection (LBR), therefore for the LBR below the tangent point the relation {Mathematical expression}, where {Mathematical expression} is the control parameter, remains robust regardless the form of the RPD, although the average of the laminar phases {Mathematical expression} can change. Finally, the study of discontinuous RPD for type-I intermittency which occurs in a three-wave truncation model for the derivative nonlinear Schrodinger equation is presented. In all tests the theoretical results properly verify the numerical data

Interval-based ranking in noisy evolutionary multiobjective optimization

As one of the most competitive approaches to multi-objective optimization, evolutionary algorithms have been shown to obtain very good results for many realworld multi-objective problems. One of the issues that can affect the performance of these algorithms is the uncertainty in the quality of the solutions which is usually represented with the noise in the objective values. Therefore, handling noisy objectives in evolutionary multi-objective optimization algorithms becomes very important and is gaining more attention in recent years. In this paper we present ?-degree Pareto dominance relation for ordering the solutions in multi-objective optimization when the values of the objective functions are given as intervals. Based on this dominance relation, we propose an adaptation of the non-dominated sorting algorithm for ranking the solutions. This ranking method is then used in a standardmulti-objective evolutionary algorithm and a recently proposed novel multi-objective estimation of distribution algorithm based on joint variable-objective probabilistic modeling, and applied to a set of multi-objective problems with different levels of independent noise. The experimental results show that the use of the proposed method for solution ranking allows to approximate Pareto sets which are considerably better than those obtained when using the dominance probability-based ranking method, which is one of the main methods for noise handling in multi-objective optimization.

Vector Boolean Functions: Applications in Symmetric Cryptography

Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa una función booleana vectorial se puede inicializar de manera muy flexible mediante diferentes estructuras de datas tales como la Tabla de verdad, la Representación de traza y la Forma algebraica normal entre otras. De esta manera VBF permite evaluar los criterios criptográficos más relevantes de los algoritmos de cifra en bloque y de stream, así como funciones hash: por ejemplo, proporciona la no-linealidad, la distancia lineal, el grado algebraico, las estructuras lineales, la distribución de frecuencias de los valores absolutos del espectro Walsh o del espectro de autocorrelación, entre otros criterios. Adicionalmente, VBF puede llevar a cabo operaciones entre funciones booleanas vectoriales tales como la comprobación de igualdad, la composición, la inversión, la suma, la suma directa, el bricklayering (aplicación paralela de funciones booleanas vectoriales como la empleada en el algoritmo de cifra Rijndael), y la adición de funciones coordenada. La tesis también muestra el empleo de la librería VBF en dos aplicaciones prácticas. Por un lado, se han analizado las características más relevantes de los sistemas de cifra en bloque. Por otro lado, combinando VBF con algoritmos de optimización, se han diseñado funciones booleanas cuyas propiedades criptográficas son las mejores conocidas hasta la fecha. ABSTRACT This thesis develops the theoretical foundations and designs an open collection of C++ classes, called VBF, designed for analyzing vector Boolean functions (functions that map a Boolean vector to another Boolean vector) from a cryptographic perspective. This new implementation uses the NTL library from Victor Shoup, adding new modules which complement the existing ones making VBF better suited for cryptography. The fundamental class representing a vector Boolean function can be initialized in a flexible way via several alternative types of data structures such as Truth Table, Trace Representation, Algebraic Normal Form (ANF) among others. This way, VBF allows the evaluation of the most relevant cryptographic criteria for block and stream ciphers as well as for hash functions: for instance, it provides the nonlinearity, the linearity distance, the algebraic degree, the linear structures, the frequency distribution of the absolute values of the Walsh Spectrum or the Autocorrelation Spectrum, among others. In addition, VBF can perform operations such as equality testing, composition, inversion, sum, direct sum, bricklayering (parallel application of vector Boolean functions as employed in Rijndael cipher), and adding coordinate functions of two vector Boolean functions. This thesis also illustrates the use of VBF in two practical applications. On the one hand, the most relevant properties of the existing block ciphers have been analysed. On the other hand, by combining VBF with optimization algorithms, new Boolean functions have been designed which have the best known cryptographic properties up-to-date.

Functions of the two glutamate transporters GLAST and GLT-1 in the retina

In the retina, the glutamate transporter GLAST is expressed in Müller cells, whereas the glutamate transporter GLT-1 is found only in cones and various types of bipolar cells. To investigate the functional role of this differential distribution of glutamate transporters, we have analyzed GLAST and GLT-1 mutant mice. In GLAST-deficient mice, the electroretinogram b-wave and oscillatory potentials are reduced and retinal damage after ischemia is exacerbated, whereas GLT-1-deficient mice show almost normal electroretinograms and mild increased retinal damage after ischemia. These results demonstrate that GLAST is required for normal signal transmission between photoreceptors and bipolar cells and that both GLAST and GLT-1 play a neuroprotective role during ischemia in the retina.

A rhodopsin-guanylyl cyclase gene fusion functions in visual perception in a fungus

Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.

Fluorescence-intensity distribution analysis and its application in biomolecular detection technology

A methodology, fluorescence-intensity distribution analysis, has been developed for confocal microscopy studies in which the fluorescence intensity of a sample with a heterogeneous brightness profile is monitored. An adjustable formula, modeling the spatial brightness distribution, and the technique of generating functions for calculation of theoretical photon count number distributions serve as the two cornerstones of the methodology. The method permits the simultaneous determination of concentrations and specific brightness values of a number of individual fluorescent species in solution. Accordingly, we present an extremely sensitive tool to monitor the interaction of fluorescently labeled molecules or other microparticles with their respective biological counterparts that should find a wide application in life sciences, medicine, and drug discovery. Its potential is demonstrated by studying the hybridization of 5′-(6-carboxytetramethylrhodamine)-labeled and nonlabeled complementary oligonucleotides and the subsequent cleavage of the DNA hybrids by restriction enzymes.

Cysteine String Protein Functions Directly in Regulated Exocytosis

Cysteine string protein (Csp) is essential for neurotransmitter release in Drosophila. It has been suggested that Csp functions by regulating the activity of presynaptic Ca2+ channels, thus controlling exocytosis. We have examined the effect of overexpressing Csp1 in PC12 cells, a neuroendocrine cell line. PC12 cell clones overexpressing Csp1 did not show any changes in morphology, granule number or distribution, or in the levels of other key exocytotic proteins. This overexpression did not affect intracellular Ca2+ signals after depolarization, suggesting that Csp1 has no gross effect on Ca2+ channel activity in PC12 cells. In contrast, we show that Csp1 overexpression enhances the extent of exocytosis from permeabilized cells in response to Ca2+ or GTPγS in the absence of Ca2+. Because secretion from permeabilized cells is not influenced by Ca2+ channel activity, this represents the first demonstration that Csp has a direct role in regulated exocytosis.

Differential Distribution of Dynamin Isoforms in Mammalian Cells

Dynamins are 100-kDa GTPases that are essential for clathrin-coated vesicle formation during receptor-mediated endocytosis. To date, three different dynamin genes have been identified, with each gene expressing at least four different alternatively spliced forms. Currently, it is unclear whether these different dynamin gene products perform distinct or redundant cellular functions. Therefore, the focus of this study was to identify additional spliced variants of dynamin from rat tissues and to define the distribution of the dynamin family members in a cultured rat epithelial cell model (Clone 9 cells). After long-distance reverse transcription (RT)-PCR of mRNA from different rat tissues, the full-length cDNAs encoding the different dynamin isoforms were sequenced and revealed four additional spliced variants for dynamin I and nine for dynamin III. Thus, in rat tissues there are a total of at least 25 different mRNAs produced from the three dynamin genes. Subsequently, we generated stably transfected Clone 9 cells expressing full-length cDNAs of six different spliced forms tagged with green fluorescent protein. Confocal or fluorescence microscopy of these transfected cells revealed that many of the dynamin proteins associate with distinct membrane compartments, which include clathrin-coated pits at the plasma membrane and the Golgi apparatus, and several undefined vesicle populations. These results indicate that the dynamin family is more extensive than was originally predicted and suggest that the different dynamin proteins are localized to distinct cytoplasmic or membrane compartments.

Estimating the probability for a protein to have a new fold: A statistical computational model

Structural genomics aims to solve a large number of protein structures that represent the protein space. Currently an exhaustive solution for all structures seems prohibitively expensive, so the challenge is to define a relatively small set of proteins with new, currently unknown folds. This paper presents a method that assigns each protein with a probability of having an unsolved fold. The method makes extensive use of protomap, a sequence-based classification, and scop, a structure-based classification. According to protomap, the protein space encodes the relationship among proteins as a graph whose vertices correspond to 13,354 clusters of proteins. A representative fold for a cluster with at least one solved protein is determined after superposition of all scop (release 1.37) folds onto protomap clusters. Distances within the protomap graph are computed from each representative fold to the neighboring folds. The distribution of these distances is used to create a statistical model for distances among those folds that are already known and those that have yet to be discovered. The distribution of distances for solved/unsolved proteins is significantly different. This difference makes it possible to use Bayes' rule to derive a statistical estimate that any protein has a yet undetermined fold. Proteins that score the highest probability to represent a new fold constitute the target list for structural determination. Our predicted probabilities for unsolved proteins correlate very well with the proportion of new folds among recently solved structures (new scop 1.39 records) that are disjoint from our original training set.

Columnar distribution of serotonin-dependent plasticity within kitten striate cortex

Recent studies have identified the potential for an important role for serotonin (5-HT) receptors in the developmental plasticity of the kitten visual cortex. 5-HT2C receptors are transiently expressed in a patchy fashion in the visual cortex of kittens between 30–80 days of age complementary to patches demarcated by cytochrome oxidase staining. 5-HT, operating via 5-HT2C receptors, increases cortical synaptic plasticity as assessed both in brain slices and in vivo. Herein, we report that bath application of 5-HT substantially increases the probability of long-term potentiation within 5-HT2C receptor-rich zones of cortex, but this effect is not observed in the 5-HT2C receptor-poor zones. Instead, in these zones, 5-HT application increases the probability of long-term depression. These location-specific effects of 5-HT may promote the formation of compartment-specific cortical responses.

Occurrence of two somatostatin variants in the frog brain: characterization of the cDNAs, distribution of the mRNAs, and receptor-binding affinities of the peptides.

In tetrapods, only one gene encoding a somatostatin precursor has been identified so far. The present study reports the characterization of the cDNA clones that encode two distinct somatostatin precursors in the brain of the frog Rana ridibunda. The cDNAs were isolated by using degenerate oligonucleotides based on the sequence of the central region of somatostatin to screen a frog brain cDNA library. One of the cDNAs encodes a 115-amino acid protein (prepro-somatostatin-14; PSS1) that exhibits a high degree of structural similarity with the mammalian somatostatin precursor. The other cDNA encodes a 103-amino acid protein (prepro-[Pro2, Met13]somatostatin-14; PSS2) that contains the sequence of the somatostatin analog (peptide SS2) at its C terminus, but does not exhibit appreciable sequence similarity with PSS1 in the remaining region. In situ hybridization studies indicate differential expression of the PSS1 and PSS2 genes in the septum, the lateral part of the pallium, the amygdaloid complex, the posterior nuclei of the thalamus, the ventral hypothalamic nucleus, the torus semicircularis and the optic tectum. The somatostatin variant SS2 was significantly more potent (4-6 fold) than somatostatin itself in displacing [125I-Tyr0, D-Trp8] somatostatin-14 from its specific binding sites. The present study indicates that the two somatostatin variants could exert different functions in the frog brain and pituitary. These data also suggest that distinct genes encoding somatostatin variants may be expressed in the brain of other tetrapods.

cDNA structure, tissue distribution, and chromosomal localization of rat PC7, a novel mammalian proprotein convertase closest to yeast kexin-like proteinases.

By using reverse transcription-coupled PCR on rat anterior pituitary RNA, we isolated a 285-bp cDNA coding for a novel subtilisin/kexin-like protein convertase (PC), called rat (r) PC7. By screening rat spleen and PC12 cell lambda gt11 cDNA libraries, we obtained a composite 3.5-kb full-length cDNA sequence of rPC7. The open reading frame codes for a prepro-PC with a 36-amino acid signal peptide, a 104-amino acid prosegment ending with a cleavable RAKR sequence, and a 747-amino acid type I membrane-bound glycoprotein, representing the mature form of this serine proteinase. Phylogenetic analysis suggests that PC7 represents the most divergent enzyme of the mammalian convertase family and that it is the closest member to the yeast convertases krp and kexin. Northern blot analyses demonstrated a widespread expression with the richest source of rPC7 mRNA being the colon and lymphoid-associated tissues. In situ hybridization revealed a distinctive tissue distribution that sometimes overlaps with that of furin, suggesting that PC7 has widespread proteolytic functions. The gene for PC7 (Pcsk7) was mapped to mouse chromosome 9 by linkage analysis of an interspecific backcross DNA panel.