Authenticating Multicast Streams in Lossy Channels Using Threshold Techniques

We first classify the state-of-the-art stream authentication problem in the multicast environment and group them into Signing and MAC approaches. A new approach for authenticating digital streams using Threshold Techniques is introduced. The new approach main advantages are in tolerating packet loss, up to a threshold number, and having a minimum space overhead. It is most suitable for multicast applications running over lossy, unreliable communication channels while, in same time, are pertain the security requirements. We use linear equations based on Lagrange polynomial interpolation and Combinatorial Design methods.

Problem Solving with Delphi

The purpose of the book is to use Delphi as a vehicle to introduce some fundamental algorithms and to illustrate several mathematical and problem-solving techniques. This book is therefore intended to be more of a reference for problem-solving, with the solution expressed in Delphi. It introduces a somewhat eclectic collection of material, much of which will not be found in a typical book on Pascal or Delphi. Many of the topics have been used by the author over a period of about ten years at Bond University, Australia in various subjects from 1993 to 2003. Much of the work was connected with a data structures subject (second programming course) conducted variously in MODULA-2, Oberon and Delphi, at Bond University, however there is considerable other, more recent material, e.g., a chapter on Sudoku.

Cheating prevention in linear secret sharing

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.

Finding good differential patterns for attacks on SHA-1

In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code. Finally, we present a number of patterns of different lengths suitable for finding collisions and near-collisions and discuss some bounds on minimal weights of them.

Distinguishing attack on SOBER-128 with linear masking

We present a distinguishing attack against SOBER-128 with linear masking. We found a linear approximation which has a bias of 2^− − 8.8 for the non-linear filter. The attack applies the observation made by Ekdahl and Johansson that there is a sequence of clocks for which the linear combination of some states vanishes. This linear dependency allows that the linear masking method can be applied. We also show that the bias of the distinguisher can be improved (or estimated more precisely) by considering quadratic terms of the approximation. The probability bias of the quadratic approximation used in the distinguisher is estimated to be equal to O(2^− − 51.8), so that we claim that SOBER-128 is distinguishable from truly random cipher by observing O(2^103.6) keystream words.

Amplitude equations and asymptotic expansions for multi-scale problems

In this paper we introduce a new technique to obtain the slow-motion dynamics in nonequilibrium and singularly perturbed problems characterized by multiple scales. Our method is based on a straightforward asymptotic reduction of the order of the governing differential equation and leads to amplitude equations that describe the slowly-varying envelope variation of a uniformly valid asymptotic expansion. This may constitute a simpler and in certain cases a more general approach toward the derivation of asymptotic expansions, compared to other mainstream methods such as the method of Multiple Scales or Matched Asymptotic expansions because of its relation with the Renormalization Group. We illustrate our method with a number of singularly perturbed problems for ordinary and partial differential equations and recover certain results from the literature as special cases. © 2010 - IOS Press and the authors. All rights reserved.

Reduction of amplitude equations by the renormalization group approach

This article elucidates and analyzes the fundamental underlying structure of the renormalization group (RG) approach as it applies to the solution of any differential equation involving multiple scales. The amplitude equation derived through the elimination of secular terms arising from a naive perturbation expansion of the solution to these equations by the RG approach is reduced to an algebraic equation which is expressed in terms of the Thiele semi-invariants or cumulants of the eliminant sequence { Zi } i=1 . Its use is illustrated through the solution of both linear and nonlinear perturbation problems and certain results from the literature are recovered as special cases. The fundamental structure that emerges from the application of the RG approach is not the amplitude equation but the aforementioned algebraic equation. © 2008 The American Physical Society.

The subset sum problem in Keno modelling

Aspects of Keno modelling throughout the Australian states of Queensland, New South Wales and Victoria are discussed: the trivial Heads or Tails and the more interesting Keno Bonus, which leads to consideration of the subset sum problem. The most intricate structure is where Heads or Tails and Keno Bonus are combined, and here, the issue of independence arises. Closed expressions for expected return to player are presented in each case.

A review of Deeds of Company Arrangement

Deeds of company arrangement ('DOCAs') under Part 5.3A of the Corporations Act appear be something of a limited success. However, the use and outcomes of DOCAs raise legitimate questions as to whether the level of returns currently being achieved for creditors might be improved by legislative reform. The 2013 ARITA Terry Taylor Scholarship project entailed a review of a random sample of executed DOCAs effectuated between 1 August 2012 and 31 July 2013. This review was undertaken with the intention of producing a ‘snapshot’ of current trends and outcomes of the use of DOCAs in practice – ie, average (or typical) rates of dividends paid, what DOCAs customarily achieve, the profile of the companies executing DOCAs and the average duration of DOCAs. The purpose of this review was to empirically assess the use and effectiveness of DOCAs in order to inform the ongoing debate about the success or otherwise of Australia’s Part 5.3A voluntary administration regime (which recently marked its 20 year anniversary).

A sample review of Deeds of Company Arrangement under Part 5.3A of the Corporations Act

An empirical review of the operation of Part 5.3A of the Corporations Act 2001 (Cth) is timely given that Australia’s corporate rescue regime marked its 20 year anniversary in 2013. The research project culminating in this report was funded by the 2013 ARITA Terry Taylor Scholarship and entailed a review of a random sample of 72 executed DOCAs (and associated reports and returns) which were effectuated between 1 August 2012 and 31 July 2013. This sample review of DOCAs was undertaken with the intention of producing a ‘snapshot’ of current practices and trends pertaining to DOCAs – ie, average (or typical) rate of dividends paid, the outcomes or goals which DOCAs customarily achieve (eg, genuine company rescues, workouts, enhanced asset realisations or ‘quasi-liquidations’), the profile of the companies executing DOCAs and the average term/duration of DOCAs. The purpose and value of this sample review was to empirically assess the use and effectiveness of one important aspect of Part 5.3A and to further inform consideration and debate as to whether changes are warranted to Australia’s voluntary administration regime.

A linear-elastic model of anisotropic tumour growth

This paper examines the effect of anisotropic growth on the evolution of mechanical stresses in a linear-elastic model of a growing, avascular tumour. This represents an important improvement on previous linear-elastic models of tissue growth since it has been shown recently that spatially-varying isotropic growth of linear-elastic tissues does not afford the necessary stress-relaxation for a steady-state stress distribution upon reaching a nutrient-regulated equilibrium size. Time-dependent numerical solutions are developed using a Lax-Wendroff scheme, which show the evolution of the tissue stress distributions over a period of growth until a steady-state is reached. These results are compared with the steady-state solutions predicted by the model equations, and key parameters influencing these steady-state distributions are identified. Recommendations for further extensions and applications of this model are proposed.

Computational strategies for surface fitting using thin plate spline finite element methods

Thin plate spline finite element methods are used to fit a surface to an irregularly scattered dataset [S. Roberts, M. Hegland, and I. Altas. Approximation of a Thin Plate Spline Smoother using Continuous Piecewise Polynomial Functions. SIAM, 1:208--234, 2003]. The computational bottleneck for this algorithm is the solution of large, ill-conditioned systems of linear equations at each step of a generalised cross validation algorithm. Preconditioning techniques are investigated to accelerate the convergence of the solution of these systems using Krylov subspace methods. The preconditioners under consideration are block diagonal, block triangular and constraint preconditioners [M. Benzi, G. H. Golub, and J. Liesen. Numerical solution of saddle point problems. Acta Numer., 14:1--137, 2005]. The effectiveness of each of these preconditioners is examined on a sample dataset taken from a known surface. From our numerical investigation, constraint preconditioners appear to provide improved convergence for this surface fitting problem compared to block preconditioners.

Correlates of perceiving human resource management as a 'problem' in smaller firms

In this paper we investigate factors likely to correlate with human resource management (HRM) being perceived as a problem in smaller firms. The owner-manager and firm characteristics identified recognise that managerial ‘problems’ can result from a firm’s phase of growth, as well as the way in which an owner-manager’s capacity and characteristics affect their interpretation of such. From a survey of 1200 smaller firms in south east Melbourne (Australia), we use logistic regression on data from 428 respondents to assess organisational and individual factors correlating with perceiving HRM, broadly defined, to be a problem. The highest odds of this occurring were associated with being a larger manufacturing firm which was in a phase of growth other than diversification and which had a long-tenured manager who based the firm’s competitive success on factors other than the quality of staff. Knowing these correlates means assistance to help solve the perceived ‘problem’ with HRM can be more effectively targeted.

Making meaning in mathematics problem solving using the Reciprocal Teaching approach

This paper examines the application of the Reciprocal Teaching instructional approach to Mathematical word problems in the middle years. The Reciprocal Teaching process is extended from the four traditional strategies of predicting, clarifying, questioning and summarising, to include further cognitive reading comprehension strategies applied to the context of solving Mathematical word problems.

Mission path planning of aerial survey tasks using hybrid game evolutionary algorithm

The work presented in this report is aimed to implement a cost-effective offline mission path planner for aerial inspection tasks of large linear infrastructures. Like most real-world optimisation problems, mission path planning involves a number of objectives which ideally should be minimised simultaneously. Understandably, the objectives of a practical optimisation problem are conflicting each other and the minimisation of one of them necessarily implies the impossibility to minimise the other ones. This leads to the need to find a set of optimal solutions for the problem; once such a set of available options is produced, the mission planning problem is reduced to a decision making problem for the mission specialists, who will choose the solution which best fit the requirements of the mission. The goal of this work is then to develop a Multi-Objective optimisation tool able to provide the mission specialists a set of optimal solutions for the inspection task amongst which the final trajectory will be chosen, given the environment data, the mission requirements and the definition of the objectives to minimise. All the possible optimal solutions of a Multi-Objective optimisation problem are said to form the Pareto-optimal front of the problem. For any of the Pareto-optimal solutions, it is impossible to improve one objective without worsening at least another one. Amongst a set of Pareto-optimal solutions, no solution is absolutely better than another and the final choice must be a trade-off of the objectives of the problem. Multi-Objective Evolutionary Algorithms (MOEAs) are recognised to be a convenient method for exploring the Pareto-optimal front of Multi-Objective optimization problems. Their efficiency is due to their parallelism architecture which allows to find several optimal solutions at each time