Genome analysis reveals insights into physiology and longevity of the Brandt’s bat Myotis brandtii

Bats account for one-fifth of mammalian species, are the only mammals with powered flight, and are among the few animals that echolocate. The insect-eating Brandt’s bat (Myotis brandtii) is the longest-lived bat species known to date (lifespan exceeds 40 years) and, at 4–8 g adult body weight, is the most extreme mammal with regard to disparity between body mass and longevity. Here we report sequencing and analysis of the Brandt’s bat genome and transcriptome, which suggest adaptations consistent with echolocation and hibernation, as well as altered metabolism, reproduction and visual function. Unique sequence changes in growth hormone and insulin-like growth factor 1 receptors are also observed. The data suggest that an altered growth hormone/insulin-like growth factor 1 axis, which may be common to other long-lived bat species, together with adaptations such as hibernation and low reproductive rate, contribute to the exceptional lifespan of the Brandt’s bat.

Quantitative genetic parameters for body traits at different ages in a cultured stock of giant freshwater prawn (Macrobrachium rosenbergii) selected for fast growth

The aim of the current study was to estimate heritabilities and correlations for body traits at different ages (Weeks 10 and 18 after stocking) in a giant freshwater prawn (Macrobrachium rosenbergii) population selected for fast growth rate in Vietnam. The dataset consisted of 4650 body records (2432 and 2218 records collected at Weeks 10 and 18, respectively) in the full pedigree comprising a total of 18 387 records. Variance and covariance components were estimated using restricted maximum likelihood fitting a multi-trait animal model. Estimates of heritability for body traits (bodyweight, body length, cephalothorax length, abdominal length, cephalothorax width and abdominal width) were moderate and ranged from 0.06 to 0.11 and from 0.11 to 0.22 at Weeks 10 and 18, respectively. Body-trait heritabilities estimated at Week 10 were not significantly lower than at Week 18. Genetic correlations between body traits within age and genetic correlations for body traits between ages were generally high. Our results suggested that selection for high growth rate in GFP can be undertaken successfully before full market size has been reached.

A coding approach to the multicast stream authentication problem

We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead and computing efficiency are two parameters to be taken into account when designing a multicast stream protocol. In this paper, we propose to use two families of erasure codes to deal with this problem, namely, rateless codes and maximum distance separable codes. Our constructions will have the following advantages. First, our packet overhead will be small. Second, the number of signature verifications to be performed at the receiver is O(1). Third, every receiver will be able to recover all the original data packets emitted by the sender despite losses and injection occurred during the transmission of information.

A flexible optimisation model for the railway crew scheduling problem

Addressing the Crew Scheduling Problem (CSP) in transportation systems can be too complex to capture all details. The designed models usually ignore or simplify features which are difficult to formulate. This paper proposes an alternative formulation using a Mixed Integer Programming (MIP) approach to the problem. The optimisation model integrates the two phases of pairing generation and pairing optimisation by simultaneously sequencing trips into feasible duties and minimising total elapsed time of any duty. Crew scheduling constraints in which the crew have to return to their home depot at the end of the shift are included in the model. The flexibility of this model comes in the inclusion of the time interval of relief opportunities, allowing the crew to be relieved during a finite time interval. This will enhance the robustness of the schedule and provide a better representation of real-world conditions.

An algebraic analysis of trivium ciphers based on the boolean satisfiability problem

Trivium is a stream cipher candidate of the eStream project. It has successfully moved into phase three of the selection process under the hardware category. No attacks faster than the exhaustive search have so far been reported on Trivium. Bivium-A and Bivium-B are simplified versions of Trivium that are built on the same design principles but with two registers. The simplified design is useful in investigating Trivium type ciphers with a reduced complexity and provides insight into effective attacks which could be extended to Trivium. This paper focuses on an algebraic analysis which uses the boolean satisfiability problem in propositional logic. For reduced variants of the cipher, this analysis recovers the internal state with a minimal amount of keystream observations.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

Secure computation of the vector dominance problem

Suppose two parties, holding vectors A = (a 1,a 2,...,a n ) and B = (b 1,b 2,...,b n ) respectively, wish to know whether a i  > b i for all i, without disclosing any private input. This problem is called the vector dominance problem, and is closely related to the well-studied problem for securely comparing two numbers (Yao’s millionaires problem). In this paper, we propose several protocols for this problem, which improve upon existing protocols on round complexity or communication/computation complexity.

A novel route in bone tissue engineering : magnetic biomimetic scaffolds

In recent years, interest in tissue engineering and its solutions has increased considerably. In particular, scaffolds have become fundamental tools in bone graft substitution and are used in combination with a variety of bio-agents. However, a long-standing problem in the use of these conventional scaffolds lies in the impossibility of re-loading the scaffold with the bio-agents after implantation. This work introduces the magnetic scaffold as a conceptually new solution. The magnetic scaffold is able, via magnetic driving, to attract and take up in vivo growth factors, stem cells or other bio-agents bound to magnetic particles. The authors succeeded in developing a simple and inexpensive technique able to transform standard commercial scaffolds made of hydroxyapatite and collagen in magnetic scaffolds. This innovative process involves dip-coating of the scaffolds in aqueous ferrofluids containing iron oxide nanoparticles coated with various biopolymers. After dip-coating, the nanoparticles are integrated into the structure of the scaffolds, providing the latter with magnetization values as high as 15 emu g�1 at 10 kOe. These values are suitable for generating magnetic gradients, enabling magnetic guiding in the vicinity and inside the scaffold. The magnetic scaffolds do not suffer from any structural damage during the process, maintaining their specific porosity and shape. Moreover, they do not release magnetic particles under a constant flow of simulated body fluids over a period of 8 days. Finally, preliminary studies indicate the ability of the magnetic scaffolds to support adhesion and proliferation of human bone marrow stem cells in vitro. Hence, this new type of scaffold is a valuable candidate for tissue engineering applications, featuring a novel magnetic guiding option.

Open problem : adversarial multiarmed bandits with limited advice

Adversarial multiarmed bandits with expert advice is one of the fundamental problems in studying the exploration-exploitation trade-o. It is known that if we observe the advice of all experts on every round we can achieve O(√KTlnN) regret, where K is the number of arms, T is the number of game rounds, and N is the number of experts. It is also known that if we observe the advice of just one expert on every round, we can achieve regret of order O(√NT). Our open problem is what can be achieved by asking M experts on every round, where 1 < M < N.

Retooling Chinese primary school teachers to use technology creatively to promote innovation and problem solving skills in science classrooms

This paper reports on the initial phase of a Professional Learning Program (PLP) undertaken by 100 primary school teachers in China that aimed to facilitate the development of adaptive expertise in using technology to facilitate innovative science teaching and learning such as that envisaged by the Chinese Ministry of Education’s (2010-2020) education reforms. Key principles derived from literature about professional learning and scaffolding of learning informed the design of the PLP. The analysis of data revealed that the participants had made substantial progress towards the development of adaptive expertise. This was manifested not only by advances in the participants’ repertoires of Subject Matter Knowledge and Pedagogical Content Knowledge but also in changes to their levels of confidence and identities as teachers. By the end of the initial phase of the PLP, the participants had coalesced into a professional learning community that readily engaged in the sharing, peer review, reuse and adaption, and collaborative design of innovative science learning and assessment activities. The findings from the study indicate that those engaged in the development of PLPs for teachers in China need to take cognizance of certain cultural factors and traditions idiosyncratic to the Chinese educational system. A set of revised principles is then presented to inform the future design and implementation of PLPs for teachers in China.

Energy-based positioning control of underactuated vehicles using manifold regulation

In this paper, we consider the problem of position regulation of a class of underactuated rigid-body vehicles that operate within a gravitational field and have fully-actuated attitude. The control objective is to regulate the vehicle position to a manifold of dimension equal to the underactuation degree. We address the problem using Port-Hamiltonian theory, and reduce the associated matching PDEs to a set of algebraic equations using a kinematic identity. The resulting method for control design is constructive. The point within the manifold to which the position is regulated is determined by the action of the potential field and the geometry of the manifold. We illustrate the performance of the controller for an unmanned aerial vehicle with underactuation degree two-a quadrotor helicopter.

ICANN and the concept of democratic deficit

The Internet Corporation for Assigned Names and Numbers (ICANN) is an institution besieged. It has endeavored to be democratic but its attempts to do so have been disastrous. The typical explanation for this is that the problem is with ICANN: it fails to meet its democratic obligations. My view is that the problem is with our understanding of "democracy." Democracy is an empty concept that fails to describe few, if any, of our genuine political commitments. In the real world, the failings inherent in "democracy" have been papered over by some unusual characteristics of the physical political process. However, in online trans-national institutions like ICANN, democracy is exposed as a poor substitute for a number of other conceptions of our political commitments. This Article seeks to articulate these political commitments and to explain why democracy and ICANN are such a poor mix. It begins by charting the rise of ICANN and its attempts to be democratic. It then explains why democracy is an empty shell of a concept. It then explores some features of democracy and ICANN, explaining why the online world exposes limitations in implications of democracy such as the nature of the demos, the idea of constituencies, direct democracy, voting, and the like. It concludes that ICANN's example demonstrates that democracy is in fact anything but a coherent general theory of political action. We need to consider, then, whether we should continue to berate ICANN for its undemocratic actions.

Guest editorial : the body and the law

This issue of the Journal of Law and Medicine seeks to explore the law's relationship with the human body within a broad context of social, cultural and technological considerations. It does this both in terms of the ways in which the law constitutes the body (for example, by labelling it as property or otherwise), and in terms of the legal rules which regulate rights to bodies and body parts.

Globalising the body : globalisation and reproductive rights

Globalisation is a phenomenon of the contemporary world. Everywhere around us there seem to be signs of the power of the forces of globalisation: in our media and popular culture; in our international linkages across continents through international travel and telecommunications; in our globalised trade; and with the global movement of people, a process which itself ranges from the movement of international tourists to the international movement of refugees and other displaced persons. The processes of globalisation seem to simultaneously unify and divide us. There is no doubt that we live in a globalised world and that we are connected to others in previously unimaginable ways by transportation, telecommunications and economics. Yet, while this global context increasingly links us to others, there is also a very real sense in which separation, difference and the local have also gained a new significance; we are locked in a tension between the universal and the particular that has come to typify contemporary society. This article explores the meanings of globalisation and this dynamic – or tension – between the universal and the particular in terms of its implications for the body and, in particular, its significance for women and their reproductive rights.