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.

An Introduction to Constrained Control

An ubiquitous problem in control system design is that the system must operate subject to various constraints. Although the topic of constrained control has a long history in practice, there have been recent significant advances in the supporting theory. In this chapter, we give an introduction to constrained control. In particular, we describe contemporary work which shows that the constrained optimal control problem for discrete-time systems has an interesting geometric structure and a simple local solution. We also discuss issues associated with the output feedback solution to this class of problems, and the implication of these results in the closely related problem of anti-windup. As an application, we address the problem of rudder roll stabilization for ships.

On optimal control of constrained linear systems with imperfect state information and stochastic disturbances

We address the problem of finite horizon optimal control of discrete-time linear systems with input constraints and uncertainty. The uncertainty for the problem analysed is related to incomplete state information (output feedback) and stochastic disturbances. We analyse the complexities associated with finding optimal solutions. We also consider two suboptimal strategies that could be employed for larger optimization horizons.

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.

Letters & Numbers : a vehicle to illustrate mathematical and computing fundamentals

The television quiz program Letters and Numbers, broadcast on the SBS network, has recently become quite popular in Australia. This paper explores the potential of this game to illustrate and engage student interest in a range of fundamental concepts of computer science and mathematics. The Numbers Game in particular has a rich mathematical structure whose analysis and solution involves concepts of counting and problem size, discrete (tree) structures, language theory, recurrences, computational complexity, and even advanced memory management. This paper presents an analysis of these games and their teaching applications, and presents some initial results of use in student assignments.

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.

An assessment of the geographical scale of recurrent gene flow in wild populations of two species of Mekong River carps (Henicorhynchus spp.)

The Mekong is the most productive river fishery in the world, and such as, the Mekong River Basin (MRB) is very important to very large human populations across the region as a source of revenue (through fishing and marketing of aquatic resources products) and as the major source for local animal protein. Threats to biodiversity in the MRB, either to the fishery sector itself or to other sectors are a major concern, even though currently, fisheries across this region are still very productive. If not managed properly however, fish population declines will cause significant economic impact and affect livelihoods of local people and will have a major impact on food security and nutrition. Biodiversity declines will undoubtedly affect food security, income and socio-economic status of people in the MRB that depend on aquatic resources. This is an indicator of unsustainable development and hence should be avoided. Genetic diversity (biodiversity) that can be measured using techniques based on DNA markers; refers to variation within and among populations within the same species or reproductive units. In a population, new genetic variation is generated by sexual recombination contributed by individuals with mutations in genes and chromosomes. Over time, populations of a species that are not reproducing together will diverge as differential impacts of selection and genetic drift change their genetic attributes. For mud carp (Henicorhynchus spp.), understanding the status of breeding units in the MRB will be important for their long term persistence, sustainability and for implementing effective management strategies. Earlier analysis of stock structure in two economically important mud carp species (Henicorhynchus siamensis and H. lobatus) in the MRB completed with mtDNA markers identified a number of populations of both species where gene flow had apparently been interrupted or reduced but applying these data directly to management unit identification is potentially compromised because information was only available about female dispersal patterns. The current study aimed to address this problem and to fully assess the extent of current gene flow (nDNA) and reproductive exchange among selected wild populations of two species of carp (Henicorhynchus spp.) of high economic importance in the MRB using combined mtDNA and nDNA markers. In combination, the data can be used to define effective management units for each species. In general, nDNA diversity for H. lobatus (with average allelic richness (A) 7.56 and average heterozygosity (Ho) 0.61) was very similar to that identified for H. siamensis (A = 6.81 and Ho = 0.75). Both mud carp species show significant but low FST estimates among populations as a result of lower genetic diversity among sampled populations compared with genetic diversity within populations that may potentially mask any 'real' population structure. Overall, population genetic structure patterns from mtDNA and nDNA in both Henicorhynchus species were largely congruent. Different population structures however, were identified for the two Henicorhynchus species across the same geographical area. Apparent co-similarity in morphology and co-distribution of these two relatively closely related species does not apparently imply parallel evolutionary histories. Differences in each species population structure likely reflect historical drainage rearrangement of the Mekong River. The data indicate that H. siamensis is likely to have occupied the Mekong system for much longer than has H. lobatus in the past. Two divergent stocks were identified for H. lobatus in the MRB below the Khone Falls while a single stock had been evident in the earlier mtDNA study. This suggests that the two Henicorhynchus species may possess different life history traits and that different patterns of gene flow has likely influenced modern genetic structure in these close congeners. In combination, results of the earlier mtDNA and the current study have implications for effective management of both Henicorhynchus species across the MRB. Currently, both species are essentially treated as a single management unit in this region. This strategy may be appropriate for H. lobatus as a single stock was evident in the main stream of the MRB, but may not be appropriate for H. siamensis as more than a single stock was identified across the same range for this species. Management strategies should consider this difference to conserve overall biodiversity (local discrete populations) and this will include maintaining natural habitat and migration pathways, provision of fish sanctuaries (refuges) and may also require close monitoring of any stock declines, a signal that may require effective recovery strategies.

Physical inactivity remains the greatest public health problem of the 21st century : evidence, improved methods and solutions using the '7 investments that work' as a framework

In 2009, BJSM's first editorial argued that ‘Physical inactivity is the greatest public health problem of the 21st century’.1 The data supporting that claim have not yet been challenged. Now, 5 years after BJSM published its first dedicated ‘Physical Activity is Medicine’ theme issue (http://bjsm.bmj.com/content/43/1.toc) we are pleased to highlight 23 new contributions from six countries. This issue contains an analysis of the cost of physical inactivity from the US Centre for Diseases Control.2 We also report the cost-effectiveness of one particular physical activity intervention for adults.3

A meshfree model for plant tissue deformations during drying

Plant tissue has a complex cellular structure which is an aggregate of individual cells bonded by middle lamella. During drying processes, plant tissue undergoes extreme deformations which are mainly driven by moisture removal and turgor loss. Numerical modelling of this problem becomes challenging when conventional grid-based modelling techniques such as Finite Element Methods (FEM) and Finite Difference Methods (FDM) have grid-based limitations. This work presents a meshfree approach to model and simulate the deformations of plant tissues during drying. This method demonstrates the fundamental capabilities of meshfree methods in handling extreme deformations of multiphase systems. A simplified 2D tissue model is developed by aggregating individual cells while accounting for the stiffness of the middle lamella. Each individual cell is simply treated as consisting of two main components: cell fluid and cell wall. The cell fluid is modelled using Smoothed Particle Hydrodynamics (SPH) and the cell wall is modelled using a Discrete Element Method (DEM). During drying, moisture removal is accounted for by reduction of cell fluid and wall mass, which causes local shrinkage of cells eventually leading to tissue scale shrinkage. The cellular deformations are quantified using several cellular geometrical parameters and a favourably good agreement is observed when compared to experiments on apple tissue. The model is also capable of visually replicating dry tissue structures. The proposed model can be used as a step in developing complex tissue models to simulate extreme deformations during drying.

Simulation-based fully Bayesian experimental design for mixed effects models

In this paper, we present fully Bayesian experimental designs for nonlinear mixed effects models, in which we develop simulation-based optimal design methods to search over both continuous and discrete design spaces. Although Bayesian inference has commonly been performed on nonlinear mixed effects models, there is a lack of research into performing Bayesian optimal design for nonlinear mixed effects models that require searches to be performed over several design variables. This is likely due to the fact that it is much more computationally intensive to perform optimal experimental design for nonlinear mixed effects models than it is to perform inference in the Bayesian framework. In this paper, the design problem is to determine the optimal number of subjects and samples per subject, as well as the (near) optimal urine sampling times for a population pharmacokinetic study in horses, so that the population pharmacokinetic parameters can be precisely estimated, subject to cost constraints. The optimal sampling strategies, in terms of the number of subjects and the number of samples per subject, were found to be substantially different between the examples considered in this work, which highlights the fact that the designs are rather problem-dependent and require optimisation using the methods presented in this paper.