Fully decentralized computation of aggregates over data streams

In several emerging applications, data is collected in massive streams at several distributed points of observation. A basic and challenging task is to allow every node to monitor a neighbourhood of interest by issuing continuous aggregate queries on the streams observed in its vicinity. This class of algorithms is fully decentralized and diffusive in nature: collecting all data at few central nodes of the network is unfeasible in networks of low capability devices or in the presence of massive data sets. The main difficulty in designing diffusive algorithms is to cope with duplicate detections. These arise both from the observation of the same event at several nodes of the network and/or receipt of the same aggregated information along multiple paths of diffusion. In this paper, we consider fully decentralized algorithms that answer locally continuous aggregate queries on the number of distinct events, total number of events and the second frequency moment in the scenario outlined above. The proposed algorithms use in the worst case or on realistic distributions sublinear space at every node. We also propose strategies that minimize the communication needed to update the aggregates when new events are observed. We experimentally evaluate for the efficiency and accuracy of our algorithms on realistic simulated scenarios

Unconditionally Secure Computation with Reduced Interaction

We study the question of how much interaction is needed for unconditionally secure multiparty computation. We first consider the number of messages that need to be sent to compute a Boolean function with semi-honest security, where all $n$ parties learn the result. We consider two classes of functions called $t$-difficult and $t$-very difficult functions, here $t$ refers to the number of corrupted players. One class is contained in the other. For instance, the AND of an input bit from each player is $t$-very difficult while the XOR is $t$-difficult but not $t$-very difficult. We show lower bounds on the message complexity of both types of functions, considering two notions of message complexity called conservative and liberal, where the conservative one is the more standard one. In all cases the bounds are $\Omega(nt)$. We also show upper bounds for $t=1$ and functions in deterministic log-space, as well as a stronger upper bound for the XOR function. This matches the lower bound for conservative complexity, so we find that the conservative message complexity of $1$-very difficult functions in deterministic log space is $2n$, while the conservative message complexity for XOR (and $t=1$) is $2n-1$. Next, we consider round complexity. It is a long-standing open problem to determine whether all efficiently computable functions can also be efficiently computed in constant-round with {\em unconditional} security. Motivated by this, we consider the question of whether we can compute any function securely, while minimizing the interaction of {\em some of} the players? And if so, how many players can this apply to? Note that we still want the standard security guarantees (correctness, privacy, termination) and we consider the standard communication model with secure point-to-point channels. We answer the questions as follows: for passive security, with $n=2t+1$ players and $t$ corruptions, up to $t$ players can have minimal interaction, i.e., they send 1 message in the first round to each of the $t+1$ remaining players and receive one message from each of them in the last round. Using our result on message complexity, we show that this is (unconditionally) optimal. For malicious security with $n=3t+1$ players and $t$ corruptions, up to $t$ players can have minimal interaction, and we show that this is also optimal

Age-Related Changes in the Daily Rhythm of Photoreceptor Functioning and Circuitry in a Melatonin-Proficient Mouse Strain

Retinal melatonin is involved in the modulation of many important retinal functions. Our previous studies have shown that the viability of photoreceptors and ganglion cells is reduced during aging in mice that lack melatonin receptor type 1. This demonstrates that melatonin signaling is important for the survival of retinal neurons. In the present study, we investigate the effects of aging on photoreceptor physiology and retinal organization in CH3-f+/+ mice, a melatonin proficient mouse strain. Our data indicate that the amplitude of the a and b waves of the scotopic and photopic electroretinogram decreases with age. Moreover, the daily rhythm in the amplitude of the a- and b- waves is lost during the aging process. Similarly, the scotopic threshold response is significantly affected by aging, but only when it is measured during the night. Interestingly, the changes observed in the ERGs are not paralleled by relevant changes in retinal morphological features, and administration of exogenous melatonin does not affect the ERGs in C3H-f+/+ at 12 months of age. This suggests that the responsiveness of the photoreceptors to exogenous melatonin is reduced during aging

Enhanced production yields of rVSV-SARS-CoV-2 vaccine using Fibra-Cel® macrocarriers

The COVID-19 pandemic has led to high global demand for vaccines to safeguard public health. To that end, our institute has developed a recombinant viral vector vaccine utilizing a modified vesicular stomatitis virus (VSV) construct, wherein the G protein of VSV is replaced with the spike protein of SARS-CoV-2 (rVSV-ΔG-spike). Previous studies have demonstrated the production of a VSV-based vaccine in Vero cells adsorbed on Cytodex 1 microcarriers or in suspension. However, the titers were limited by both the carrier surface area and shear forces. Here, we describe the development of a bioprocess for rVSV-ΔG-spike production in serum-free Vero cells using porous Fibra-Cel® macrocarriers in fixed-bed BioBLU®320 5p bioreactors, leading to high-end titers. We identified core factors that significantly improved virus production, such as the kinetics of virus production, the use of macrospargers for oxygen supply, and medium replenishment. Implementing these parameters, among others, in a series of GMP production processes improved the titer yields by at least two orders of magnitude (2e9 PFU/mL) over previously reported values. The developed process was highly effective, repeatable, and robust, creating potent and genetically stable vaccine viruses and introducing new opportunities for application in other viral vaccine platforms

SOX2 is an amplified lineage-survival oncogene in lung and esophageal squamous cell carcinomas

Lineage survival oncogenes are activated by somatic DNA alterations in cancers arising from the cell lineages in which these genes play a role in normal development.1,2 Here we show that a peak of genomic amplification on chromosome 3q26.33, found in squamous cell carcinomas (SCCs) of the lung and esophagus, contains the transcription factor gene SOX2—which is mutated in hereditary human esophageal malformations3 and necessary for normal esophageal squamous development4, promotes differentiation and proliferation of basal tracheal cells5 and co-operates in induction of pluripotent stem cells.6,7,8 SOX2 expression is required for proliferation and anchorage-independent growth of lung and esophageal cell lines, as shown by RNA interference experiments. Furthermore, ectopic expression of SOX2 cooperated with FOXE1 or FGFR2 to transform immortalized tracheobronchial epithelial cells. SOX2-driven tumors show expression of markers of both squamous differentiation and pluripotency. These observations identify SOX2 as a novel lineage survival oncogene in lung and esophageal SCC

A note on models for non-probabilistic analysis of packet switching networks

We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types of models, and between them and the set of sequences of packets that allow stability. We also consider the adaptive setting in which packets are injected with only their source and destination but without a prescribed path to follow.

Lower Bounds on the Amount of Randomness in Private Computation

We consider the amount of randomness necessary in information-theoretic private protocols. We prove that at least #ast n) random bits are necessary for the t-private computation of the function xor by n players, for any t 2