Genetic divergence and echolocation call frequency in cryptic species of Hipposideros larvatus s.l. (Chiroptera : Hipposideridae) from the Indo-Malayan region

The intermediate leaf-nosed bat (Hipposideros larvatus) is a medium-sized bat distributed throughout the Indo-Malay region. In north-east India, bats identified as H. larvatus captured at a single cave emitted echolocation calls with a bimodal distribution of peak frequencies, around either 85 kHz or 98 kHz. Individuals echolocating at 85 kHz had larger ears and longer forearms than those echolocating at 98 kHz, although no differences were detected in either wing morphology or diet, suggesting limited resource partitioning. A comparison of mitochondrial control region haplotypes of the two phonic types with individuals sampled from across the Indo-Malay range supports the hypothesis that, in India, two cryptic species are present. The Indian 98-kHz phonic bats formed a monophyletic clade with bats from all other regional populations sampled, to the exclusion of the Indian 85-kHz bats. In India, the two forms showed 12–13% sequence divergence and we propose that the name Hipposideros khasiana for bats of the 85-kHz phonic type. Bats of the 98-kHz phonic type formed a monophyletic group with bats from Myanmar, and corresponded to Hipposideros grandis, which is suggested to be a species distinct from Hipposideros larvatus. Differences in echolocation call frequency among populations did not reflect phylogenetic relationships, indicating that call frequency is a poor indicator of evolutionary history. Instead, divergence in call frequency probably occurs in allopatry, possibly augmented by character displacement on secondary contact to facilitate intraspecific communication.

Building indifferentiable compression functions from the PGV compression functions

Preneel, Govaerts and Vandewalle (PGV) analysed the security of single-block-length block cipher based compression functions assuming that the underlying block cipher has no weaknesses. They showed that 12 out of 64 possible compression functions are collision and (second) preimage resistant. Black, Rogaway and Shrimpton formally proved this result in the ideal cipher model. However, in the indifferentiability security framework introduced by Maurer, Renner and Holenstein, all these 12 schemes are easily differentiable from a fixed input-length random oracle (FIL-RO) even when their underlying block cipher is ideal. We address the problem of building indifferentiable compression functions from the PGV compression functions. We consider a general form of 64 PGV compression functions and replace the linear feed-forward operation in this generic PGV compression function with an ideal block cipher independent of the one used in the generic PGV construction. This modified construction is called a generic modified PGV (MPGV). We analyse indifferentiability of the generic MPGV construction in the ideal cipher model and show that 12 out of 64 MPGV compression functions in this framework are indifferentiable from a FIL-RO. To our knowledge, this is the first result showing that two independent block ciphers are sufficient to design indifferentiable single-block-length compression functions.

“Do I really need a nap?”: The role of sleep science in informing sleep practices in early childhood education and care settings

A compelling body of studies identifies the importance of sleep for children’s learning, behavioral regulation, and health. These studies have primarily focused on nighttime sleep or on total sleep duration. The independent contribution of daytime sleep, or napping, in childhood is an emerging research focus. Daytime sleep is particularly pertinent to the context of early childhood education and care (ECEC) where, internationally, allocation of time for naps is commonplace through to the time of school entry. The biological value of napping varies with neurological maturity and with individual circumstance. Beyond the age of 3 years, when monophasic sleep patterns become typical, there is an increasing disjuncture between children’s normative sleep requirements and ECEC practice. At this time, research evidence consistently identifies an association between napping and decreased quality and duration of night sleep. We assess the implications of this evidence for educational practice and health policy. We identify the need to distinguish the functions of napping from those of rest, and assert the need for evidence-based guidelines on sleep–rest practices in ECEC settings to accommodate individual variation in sleep needs. Given both the evidence on the impact of children’s nighttime sleep on long-term trajectories of health and well-being and the high rates of child attendance in ECEC programs, we conclude that policy and practice regarding naptime have significant implications for child welfare and ongoing public health.

Structural damage detection method using frequency response functions

Structural damage detection using measured dynamic data for pattern recognition is a promising approach. These pattern recognition techniques utilize artificial neural networks and genetic algorithm to match pattern features. In this study, an artificial neural network–based damage detection method using frequency response functions is presented, which can effectively detect nonlinear damages for a given level of excitation. The main objective of this article is to present a feasible method for structural vibration–based health monitoring, which reduces the dimension of the initial frequency response function data and transforms it into new damage indices and employs artificial neural network method for detecting different levels of nonlinearity using recognized damage patterns from the proposed algorithm. Experimental data of the three-story bookshelf structure at Los Alamos National Laboratory are used to validate the proposed method. Results showed that the levels of nonlinear damages can be identified precisely by the developed artificial neural networks. Moreover, it is identified that artificial neural networks trained with summation frequency response functions give higher precise damage detection results compared to the accuracy of artificial neural networks trained with individual frequency response functions. The proposed method is therefore a promising tool for structural assessment in a real structure because it shows reliable results with experimental data for nonlinear damage detection which renders the frequency response function–based method convenient for structural health monitoring.

Cryptographic hash functions

Cryptographic hash functions are an important tool of cryptography and play a fundamental role in efficient and secure information processing. A hash function processes an arbitrary finite length input message to a fixed length output referred to as the hash value. As a security requirement, a hash value should not serve as an image for two distinct input messages and it should be difficult to find the input message from a given hash value. Secure hash functions serve data integrity, non-repudiation and authenticity of the source in conjunction with the digital signature schemes. Keyed hash functions, also called message authentication codes (MACs) serve data integrity and data origin authentication in the secret key setting. The building blocks of hash functions can be designed using block ciphers, modular arithmetic or from scratch. The design principles of the popular Merkle–Damgård construction are followed in almost all widely used standard hash functions such as MD5 and SHA-1.

On hash functions using checksums

We analyse the security of iterated hash functions that compute an input dependent checksum which is processed as part of the hash computation. We show that a large class of such schemes, including those using non-linear or even one-way checksum functions, is not secure against the second preimage attack of Kelsey and Schneier, the herding attack of Kelsey and Kohno and the multicollision attack of Joux. Our attacks also apply to a large class of cascaded hash functions. Our second preimage attacks on the cascaded hash functions improve the results of Joux presented at Crypto’04. We also apply our attacks to the MD2 and GOST hash functions. Our second preimage attacks on the MD2 and GOST hash functions improve the previous best known short-cut second preimage attacks on these hash functions by factors of at least 226 and 254, respectively. Our herding and multicollision attacks on the hash functions based on generic checksum functions (e.g., one-way) are a special case of the attacks on the cascaded iterated hash functions previously analysed by Dunkelman and Preneel and are not better than their attacks. On hash functions with easily invertible checksums, our multicollision and herding attacks (if the hash value is short as in MD2) are more efficient than those of Dunkelman and Preneel.

On the Collision and Preimage Resistance of Certain Two-Call Hash Functions

In this paper we present concrete collision and preimage attacks on a large class of compression function constructions making two calls to the underlying ideal primitives. The complexity of the collision attack is above the theoretical lower bound for constructions of this type, but below the birthday complexity; the complexity of the preimage attack, however, is equal to the theoretical lower bound. We also present undesirable properties of some of Stam’s compression functions proposed at CRYPTO ’08. We show that when one of the n-bit to n-bit components of the proposed 2n-bit to n-bit compression function is replaced by a fixed-key cipher in the Davies-Meyer mode, the complexity of finding a preimage would be 2 n/3. We also show that the complexity of finding a collision in a variant of the 3n-bits to 2n-bits scheme with its output truncated to 3n/2 bits is 2 n/2. The complexity of our preimage attack on this hash function is about 2 n . Finally, we present a collision attack on a variant of the proposed m + s-bit to s-bit scheme, truncated to s − 1 bits, with a complexity of O(1). However, none of our results compromise Stam’s security claims.

On Randomizing Hash Functions to Strengthen the Security of Digital Signatures

Halevi and Krawczyk proposed a message randomization algorithm called RMX as a front-end tool to the hash-then-sign digital signature schemes such as DSS and RSA in order to free their reliance on the collision resistance property of the hash functions. They have shown that to forge a RMX-hash-then-sign signature scheme, one has to solve a cryptanalytical task which is related to finding second preimages for the hash function. In this article, we will show how to use Dean’s method of finding expandable messages for finding a second preimage in the Merkle-Damgård hash function to existentially forge a signature scheme based on a t-bit RMX-hash function which uses the Davies-Meyer compression functions (e.g., MD4, MD5, SHA family) in 2 t/2 chosen messages plus 2 t/2 + 1 off-line operations of the compression function and similar amount of memory. This forgery attack also works on the signature schemes that use Davies-Meyer schemes and a variant of RMX published by NIST in its Draft Special Publication (SP) 800-106. We discuss some important applications of our attack.

Cryptographic Hash Functions

In the modern era of information and communication technology, cryptographic hash functions play an important role in ensuring the authenticity, integrity, and nonrepudiation goals of information security as well as efficient information processing. This entry provides an overview of the role of hash functions in information security, popular hash function designs, some important analytical results, and recent advances in this field.

Adaptive online gradient descent

We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori knowledge of the lower bound on the second derivatives of the observed functions. We then provide an algorithm, Adaptive Online Gradient Descent, which interpolates between the results of Zinkevich for linear functions and of Hazan et al for strongly convex functions, achieving intermediate rates between [square root T] and [log T]. Furthermore, we show strong optimality of the algorithm. Finally, we provide an extension of our results to general norms.

Efficient minimax strategies for square loss games

We consider online prediction problems where the loss between the prediction and the outcome is measured by the squared Euclidean distance and its generalization, the squared Mahalanobis distance. We derive the minimax solutions for the case where the prediction and action spaces are the simplex (this setup is sometimes called the Brier game) and the \ell_2 ball (this setup is related to Gaussian density estimation). We show that in both cases the value of each sub-game is a quadratic function of a simple statistic of the state, with coefficients that can be efficiently computed using an explicit recurrence relation. The resulting deterministic minimax strategy and randomized maximin strategy are linear functions of the statistic.

Stability and convergence of a new finite volume method for a two-sided space-fractional diffusion equation

In this paper, we consider a two-sided space-fractional diffusion equation with variable coefficients on a finite domain. Firstly, based on the nodal basis functions, we present a new fractional finite volume method for the two-sided space-fractional diffusion equation and derive the implicit scheme and solve it in matrix form. Secondly, we prove the stability and convergence of the implicit fractional finite volume method and conclude that the method is unconditionally stable and convergent. Finally, some numerical examples are given to show the effectiveness of the new numerical method, and the results are in excellent agreement with theoretical analysis.

The O-specific polysaccharide structure and gene cluster of serotype O:12 of the Yersinia pseudotuberculosis complex, and the identification of a novel L-quinovose biosynthesis gene

A major virulence factor for Yersinia pseudotuberculosis is lipopolysaccharide, including O-polysaccharide (OPS). Currently, the OPS based serotyping scheme for Y. pseudotuberculosis includes 21 known O-serotypes, with genetic and structural data available for 17 of them. The completion of the OPS structures and genetics of this species will enable the visualization of relationships between O-serotypes and allow for analysis of the evolutionary processes within the species that give rise to new serotypes. Here we present the OPS structure and gene cluster of serotype O:12, thus adding one more to the set of completed serotypes, and show that this serotype is present in both Y. pseudotuberculosis and the newly identified Y. similis species. The O:12 structure is shown to include two rare sugars: 4-C[(R)-1-hydroxyethyl]-3,6-dideoxy-d-xylo-hexose (d-yersiniose) and 6-deoxy-l-glucopyranose (l-quinovose). We have identified a novel putative guanine diphosphate (GDP)-l-fucose 4-epimerase gene and propose a pathway for the synthesis of GDP-l-quinovose, which extends the known GDP-l-fucose pathway.

An upstream open reading frame is essential for feedback regulation of ascorbate biosynthesis in arabidopsis

Ascorbate (vitamin C) is an essential antioxidant and enzyme cofactor in both plants and animals. Ascorbate concentration is tightly regulated in plants, partly to respond to stress. Here, we demonstrate that ascorbate concentrations are determined via the posttranscriptional repression of GDP-l-galactose phosphorylase (GGP), a major control enzyme in the ascorbate biosynthesis pathway. This regulation requires a cis-acting upstream open reading frame (uORF) that represses the translation of the downstream GGP open reading frame under high ascorbate concentration. Disruption of this uORF stops the ascorbate feedback regulation of translation and results in increased ascorbate concentrations in leaves. The uORF is predicted to initiate at a noncanonical codon (ACG rather than AUG) and encode a 60- to 65-residue peptide. Analysis of ribosome protection data from Arabidopsis thaliana showed colocation of high levels of ribosomes with both the uORF and the main coding sequence of GGP. Together, our data indicate that the noncanonical uORF is translated and encodes a peptide that functions in the ascorbate inhibition of translation. This posttranslational regulation of ascorbate is likely an ancient mechanism of control as the uORF is conserved in GGP genes from mosses to angiosperms.

GPU accelerated algorithms for computing matrix function vector products with applications to exponential integrators and fractional diffusion

The efficient computation of matrix function vector products has become an important area of research in recent times, driven in particular by two important applications: the numerical solution of fractional partial differential equations and the integration of large systems of ordinary differential equations. In this work we consider a problem that combines these two applications, in the form of a numerical solution algorithm for fractional reaction diffusion equations that after spatial discretisation, is advanced in time using the exponential Euler method. We focus on the efficient implementation of the algorithm on Graphics Processing Units (GPU), as we wish to make use of the increased computational power available with this hardware. We compute the matrix function vector products using the contour integration method in [N. Hale, N. Higham, and L. Trefethen. Computing Aα, log(A), and related matrix functions by contour integrals. SIAM J. Numer. Anal., 46(5):2505–2523, 2008]. Multiple levels of preconditioning are applied to reduce the GPU memory footprint and to further accelerate convergence. We also derive an error bound for the convergence of the contour integral method that allows us to pre-determine the appropriate number of quadrature points. Results are presented that demonstrate the effectiveness of the method for large two-dimensional problems, showing a speedup of more than an order of magnitude compared to a CPU-only implementation.