Distinctive growth requirements and gene expression patterns distinguish progenitor B cells from pre-B cells.

Long-term bone marrow cultures have been useful in determining gene expression patterns in pre-B cells and in the identification of cytokines such as interleukin 7 (IL-7). We have developed a culture system to selectively grow populations of B lineage restricted progenitors (pro-B cells) from murine bone marrow. Pro-B cells do not grow in response to IL-7, Steel locus factor (SLF), or a combination of the two. c-kit, the SLF receptor, and the IL-7 receptor are both expressed by pro-B cells, indicating that the lack of response is not simply due to the absence of receptors. Furthermore, SLF is not necessary for the growth of pro-B cells since they could be expanded on a stromal line derived from Steel mice that produces no SLF. IL-7 responsiveness in pre-B cells is associated with an increase in n-myc expression and is correlated with immunoglobulin (Ig) gene rearrangements. Although members of the ets family of transcription factors and the Pim-1 kinase are expressed by pro-B cells, n-myc is not expressed. Pro-B cells maintain Ig genes in the germline configuration, which is correlated with a low level of recombination activating genes 1 and 2 (Rag-1 and 2) mRNA expression, but high expression of sterile mu and terminal deoxynucleotidyl transferase. Pro-B cells are unable to grow separated from the stromal layer by a porous membrane, indicating that stromal contact is required for growth. These results suggest that pro-B cells are dependent on alternative growth signals derived from bone marrow stroma and can be distinguished from pre-B cells by specific patterns of gene expression

Design of a low cost earth resources system

The author has identified the following significant results. Survey results indicated that users of remote sensing data in the Southeastern U.S. were increasingly turning to digital processing techniques. All the states surveyed have had some involvement in projects using digitally processed data. Even those states which do not yet have in-house capabilities for digital processing were extremely interested in and were planning to develop such capabilities

Non-malleable codes for space-bounded tampering

Non-malleable codes—introduced by Dziembowski, Pietrzak and Wichs at ICS 2010—are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t. some class of tampering adversaries, result in a decoded value that is either identical or unrelated to the original message. Such codes are very useful for protecting arbitrary cryptographic primitives against tampering attacks against the memory. Clearly, non-malleability is hopeless if the class of tampering adversaries includes the decoding and encoding algorithm. To circumvent this obstacle, the majority of past research focused on designing non-malleable codes for various tampering classes, albeit assuming that the adversary is unable to decode. Nonetheless, in many concrete settings, this assumption is not realistic

Computer processing of peach tree decline data

There are no author-identified significant results in this report

Non-adiabatic dynamics of two strongly coupled nanomechanical resonator modes

The Landau-Zener transition is a fundamental concept for dynamical quantum systems and has been studied in numerous fields of physics. Here we present a classical mechanical model system exhibiting analogous behaviour using two inversely tuneable, strongly coupled modes of the same nanomechanical beam resonator. In the adiabatic limit, the anticrossing between the two modes is observed and the coupling strength extracted. Sweeping an initialized mode across the coupling region allows mapping of the progression from diabatic to adiabatic transitions as a function of the sweep rate

The microscopic theory of fission

Fission-fragment properties have been calculated for thermal neutron-induced fission on a $^{239}\textrm{Pu}$ target, using constrained Hartree-Fock-Bogoliubov calculations with a finite-range effective interaction. A quantitative criterion based on the interaction energy between the nascent fragments is introduced to define the scission configurations. The validity of this criterion is benchmarked against experimental measurements of the kinetic energies and of multiplicities of neutrons emitted by the fragments.Comment: 8 page, 4 figures, to be published in Proceedings of the 4th International Workshop on Fission and Fission Product Spectroscop

Development of large-internal-surface-area nickel-metal plaques third quarterly progress report, dec. 19, 1964 - mar. 18, 1965

Electrodes impregnated with cadmium for porosity and electrochemical evaluatio

The chaining lemma and its application

We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called “chain” of random variables, defined by a source distribution X(0)with high min-entropy and a number (say, t in total) of arbitrary functions (T1,…, Tt) which are applied in succession to that source to generate the chain (Formula presented). Intuitively, the Chaining Lemma guarantees that, if the chain is not too long, then either (i) the entire chain is “highly random”, in that every variable has high min-entropy; or (ii) it is possible to find a point j (1 ≤ j ≤ t) in the chain such that, conditioned on the end of the chain i.e. (Formula presented), the preceding part (Formula presented) remains highly random. We think this is an interesting information-theoretic result which is intuitive but nevertheless requires rigorous case-analysis to prove. We believe that the above lemma will find applications in cryptography. We give an example of this, namely we show an application of the lemma to protect essentially any cryptographic scheme against memory tampering attacks. We allow several tampering requests, the tampering functions can be arbitrary, however, they must be chosen from a bounded size set of functions that is fixed a prior

Efficient public-key cryptography with bounded leakage and tamper resilience

We revisit the question of constructing public-key encryption and signature schemes with security in the presence of bounded leakage and tampering memory attacks. For signatures we obtain the first construction in the standard model; for public-key encryption we obtain the first construction free of pairing (avoiding non-interactive zero-knowledge proofs). Our constructions are based on generic building blocks, and, as we show, also admit efficient instantiations under fairly standard number-theoretic assumptions. The model of bounded tamper resistance was recently put forward by Damgård et al. (Asiacrypt 2013) as an attractive path to achieve security against arbitrary memory tampering attacks without making hardware assumptions (such as the existence of a protected self-destruct or key-update mechanism), the only restriction being on the number of allowed tampering attempts (which is a parameter of the scheme). This allows to circumvent known impossibility results for unrestricted tampering (Gennaro et al., TCC 2010), while still being able to capture realistic tampering attack