The SOS screen in Arabidopsis: a search for functions involved in DNA metabolism

The SOS screen, as originally described by Perkins et al. (1999), was setup with the aim of identifying Arabidopsis functions that might potentially be involved in the DNA metabolism. Such functions, when expressed in bacteria, are prone to disturb replication and thus trigger the SOS response. Consistently, expression of AtRAD51 and AtDMC1 induced the SOS response in bacteria, even affecting E. coli viability. 100 SOS-inducing cDNAs were isolated from a cDNA library constructed from an Arabidopsis cell suspension that was found to highly express meiotic genes. A large proportion of these SOS+ candidates are clearly related to the DNA metabolism, others could be involved in the RNA metabolism, while the remaining cDNAs encode either totally unknown proteins or proteins that were considered as irrelevant. Seven SOS+ candidate genes are induced following gamma irradiation. The in planta function of several of the SOS-inducing clones was investigated using T-DNA insertional mutants or RNA interference. Only one SOS+ candidate, among those examined, exhibited a defined phenotype: silenced plants for DUT1 were sensitive to 5-fluoro-uracil (5FU), as is the case of the leaky dut-1 mutant in E. coli that are affected in dUTPase activity. dUTPase is essential to prevent uracil incorporation in the course of DNA replication.

Higher order universal one-way hash functions from the subset sum assumption

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damgård domain extender. However, they did not provide any provably secure constructions for higher order UOWHFs. We show that the subset sum hash function is a kth order Universal One-Way Hash Function (hashing n bits to m < n bits) under the Subset Sum assumption for k = O(log m). Therefore we strengthen a previous result of Impagliazzo and Naor, who showed that the subset sum hash function is a UOWHF under the Subset Sum assumption. We believe our result is of theoretical interest; as far as we are aware, it is the first example of a natural and computationally efficient UOWHF which is also a provably secure higher order UOWHF under the same well-known cryptographic assumption, whereas this assumption does not seem sufficient to prove its collision-resistance. A consequence of our result is that one can apply the Merkle-Damgård extender to the subset sum compression function with ‘extension factor’ k+1, while losing (at most) about k bits of UOWHF security relative to the UOWHF security of the compression function. The method also leads to a saving of up to m log(k+1) bits in key length relative to the Shoup XOR-Mask domain extender applied to the subset sum compression function.

Homogeneous bent functions of degree n in 2n variables do not exist for n>3

We prove that homogeneous bent functions f:GF(2)^2n --> GF(2) of degree n do not exist for n>3. Consequently homogeneous bent functions must have degree 3.

The eight variable homogeneous degree three bent functions

We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups. We provide a partial verification of the enumeration of eight variable degree three homogeneous bent functions obtained by Meng et al. We determine the affine equivalence classes of these functions.

Plasma Nanoscience : Basic Concepts and Applications of Deterministic Nanofabrication

Filling the need for a single work specifically addressing how to use plasma for the fabrication of nanoscale structures, this book is the first to cover plasma deposition in sufficient depth. The author has worked with numerous R&D institutions around the world, and here he begins with an introductory overview of plasma processing at micro- and nanoscales, as well as the current problems and challenges, before going on to address surface preparation, generation and diagnostics, transport and the manipulation of nano units.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽tfunctions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Telomerase activity : detection and clinical implications in human cancer

Telomerase is an extremely important enzyme required for the immortalisation of tumour cells. Because the gene is activated in the vast majority of tumour tissues and remains unused in most somatic cells, it represents a marker with huge diagnostic, prognostic and treatment implications in cancer. This article summarises the basic structure and functions of telomerase and considers its clinical implications in colorectal and other cancers.

Digital image watermarking: its formal model, fundamental properties and possible attacks

While formal definitions and security proofs are well established in some fields like cryptography and steganography, they are not as evident in digital watermarking research. A systematic development of watermarking schemes is desirable, but at present their development is usually informal, ad hoc, and omits the complete realization of application scenarios. This practice not only hinders the choice and use of a suitable scheme for a watermarking application, but also leads to debate about the state-of-the-art for different watermarking applications. With a view to the systematic development of watermarking schemes, we present a formal generic model for digital image watermarking. Considering possible inputs, outputs, and component functions, the initial construction of a basic watermarking model is developed further to incorporate the use of keys. On the basis of our proposed model, fundamental watermarking properties are defined and their importance exemplified for different image applications. We also define a set of possible attacks using our model showing different winning scenarios depending on the adversary capabilities. It is envisaged that with a proper consideration of watermarking properties and adversary actions in different image applications, use of the proposed model would allow a unified treatment of all practically meaningful variants of watermarking schemes.

The Saccharomyces cerevisiae RNA-binding protein Rbp29 functions in cytoplasmic mRNA metabolism

Here we report that the Saccharomyces cerevisiae RBP29 (SGN1, YIR001C) gene encodes a 29-kDa cytoplasmic protein that binds to mRNA in vivo. Rbp29p can be co-immunoprecipitated with the poly(A) tail-binding protein Pab1p from crude yeast extracts in a dosageand RNA-dependent manner. In addition, recombinant Rbp29p binds preferentially to poly(A) with nanomolar binding affinity in vitro. Although RBP29 is not essential for cell viability, its deletion exacerbates the slow growth phenotype of yeast strains harboring mutations in the eIF4G genes TIF4631 and TIF4632. Furthermore, overexpression of RBP29 suppresses the temperaturesensitive growth phenotype of specific tif4631, tif4632, and pab1 alleles. These data suggest that Rbp29p is an mRNA-binding protein that plays a role in modulating the expression of cytoplasmic mRNA.

Independent functions of yeast Pcf11p in pre-mRNA 3' end processing and in transcription termination

Pcf11p, an essential subunit of the yeast cleavage factor IA, is required for pre‐mRNA 3′ end processing, binds to the C‐terminal domain (CTD) of the largest subunit of RNA polymerase II (RNAP II) and is involved in transcription termination. We show that the conserved CTD interaction domain (CID) of Pcf11p is essential for cell viability. Interestingly, the CTD binding and 3′ end processing activities of Pcf11p can be functionally uncoupled from each other and provided by distinct Pcf11p fragments in trans. Impaired CTD binding did not affect the 3′ end processing activity of Pcf11p and a deficiency of Pcf11p in 3′ end processing did not prevent CTD binding. Transcriptional run‐on analysis with the CYC1 gene revealed that loss of cleavage activity did not correlate with a defect in transcription termination, whereas loss of CTD binding did. We conclude that Pcf11p is a bifunctional protein and that transcript cleavage is not an obligatory step prior to RNAP II termination.

Melanopsin expressing intrinsically photosensitive Retinal Ganglion cells in retinal disease

Melanopsin containing intrinsically photosensitive Retinal Ganglion Cells (ipRGCs) are a class of photoreceptors with established roles in non-image forming processes. Their contributions to image forming vision may include the estimation of brightness. Animal models have been central for understanding the physiological mechanisms of ipRGC function and there is evidence of conservation of function across species. ipRGCs can be divided into 5 ganglion cell subtypes that show morphological and functional diversity. Research in humans has established that ipRGCs signal environmental irradiance to entrain the central body clock to the solar day for regulating circadian processes and sleep. In addition, ipRGCs mediate the pupil light reflex (PLR), making the PLR a readily accessible behavioural marker of ipRGC activity. Less is known about ipRGC function in retinal and optic nerve disease, with emerging research providing insight into their function in diabetes, retinitis pigmentosa, glaucoma and hereditary optic neuropathy. We briefly review the anatomical distributions, projections and basic physiological mechanisms of ipRGCs, their proposed and known functions in animals and humans with and without eye disease. We introduce a paradigm for differentiating inner and outer retinal inputs to the pupillary control pathway in retinal disease and apply this paradigm to patients with age-related macular degeneration (AMD). In these cases of patients with AMD, we provide the initial evidence that ipRGC function is altered, and that the dysfunction is more pronounced in advanced disease. Our perspective is that with refined pupillometry paradigms, the pupil light reflex can be extended to AMD assessment as a tool for the measurement of inner and outer retinal dysfunction.

A frontier functions approach to optimal scales of sustainable production

This paper translates the concepts of sustainable production to three dimensions of economic, environmental and ecological sustainability to analyze optimal production scales by solving optimizing problems. Economic optimization seeks input-output combinations to maximize profits. Environmental optimization searches for input-output combinations that minimize the polluting effects of materials balance on the surrounding environment. Ecological optimization looks for input-output combinations that minimize the cumulative destruction of the entire ecosystem. Using an aggregate space, the framework illustrates that these optimal scales are often not identical because markets fail to account for all negative externalities. Profit-maximizing firms normally operate at the scales which are larger than optimal scales from the viewpoints of environmental and ecological sustainability; hence policy interventions are favoured. The framework offers a useful tool for efficiency studies and policy implication analysis. The paper provides an empirical investigation using a data set of rice farms in South Korea.