Modelling the performance of self-compacting SIFCON of cement slurries containing limestone powder using genetic programming technique

The paper explores the potential of applicability of Genetic programming approach (GP), adopted in this investigation, to model the combined effects of five independent variables to predict the mini-slump, the plate cohesion meter, the induced bleeding test, the J-fiber penetration value, and the compressive strength at 7 and 28 days of self-compacting slurry infiltrated fiber concrete (SIFCON). The variables investigated were the proportions of limestone powder (LSP) and sand, the dosage rates of superplasticiser (SP) and viscosity modifying agent (VMA), and water-to-binder ratio (W/B). Twenty eight mixtures were made with 10-50% LSP as replacement of cement, 0.02-0.06% VMA by mass of cement, 0.6-1.2% SP and 50-150% sand (% mass of binder) and 0.42-0.48 W/B. The proposed genetic models of the self-compacting SIFCON offer useful modelling approach regarding the mix optimisation in predicting the fluidity, the cohesion, the bleeding, the penetration, and the compressive strength.

A programming model for BSP with partitioned synchronisation

A BSP superstep is a distributed computation comprising a number of simultaneously executing processes which may generate asynchronous messages. A superstep terminates with a barrier which enforces a global synchronisation and delivers all ongoing communications. Multilevel supersteps can utilise barriers in which subsets of processes, interacting through shared memories, are locally synchronised (partitioned synchronisation). In this paper a state-based semantics, closely related to the classical sequential programming model, is derived for distributed BSP with partitioned synchronisation.

Maximum likelihood estimation of higher-order integer-valued autoregressive processes

In this article, we extend the earlier work of Freeland and McCabe [Journal of time Series Analysis (2004) Vol. 25, pp. 701–722] and develop a general framework for maximum likelihood (ML) analysis of higher-order integer-valued autoregressive processes. Our exposition includes the case where the innovation sequence has a Poisson distribution and the thinning is binomial. A recursive representation of the transition probability of the model is proposed. Based on this transition probability, we derive expressions for the score function and the Fisher information matrix, which form the basis for ML estimation and inference. Similar to the results in Freeland and McCabe (2004), we show that the score function and the Fisher information matrix can be neatly represented as conditional expectations. Using the INAR(2) speci?cation with binomial thinning and Poisson innovations, we examine both the asymptotic e?ciency and ?nite sample properties of the ML estimator in relation to the widely used conditional least
squares (CLS) and Yule–Walker (YW) estimators. We conclude that, if the Poisson assumption can be justi?ed, there are substantial gains to be had from using ML especially when the thinning parameters are large.

Maximum likelihood estimation of higher-order integer-valued autoregressive processes

Corrigendum Vol. 30, Issue 2, 259, Article first published online: 15 MAR 2009 to correct the order of authors names: Bu R., K. Hadri, and B. McCabe.