Development and application of a multiple linear regression model to consider the impact of weekly waste container capacity on the yield from kerbside recycling programmes

The paper describes the development and application of a multiple linear regression model to identify how the key elements of waste and recycling infrastructure, namely container capacity and frequency of collection affect the yield from municipal kerbside recycling programmes. The overall aim of the research was to gain an understanding of the factors affecting the yield from municipal kerbside recycling programmes in Scotland. The study isolates the principal kerbside collection service offered by 32 councils across Scotland, eliminating those recycling programmes associated with flatted properties or multi occupancies. The results of a regression analysis model has identified three principal factors which explain 80% of the variability in the average yield of the principal dry recyclate services: weekly residual waste capacity, number of materials collected and the weekly recycling capacity. The use of the model has been evaluated and recommendations made on ongoing methodological development and the use of the results in informing the design of kerbside recycling programmes. The authors hope that the research can provide insights for the ongoing development of methods to optimise the design and operation of kerbside recycling programmes.

Temporal constraints on linear BRDF model parameters

Linear models of bidirectional reflectance distribution are useful tools for understanding the angular variability of surface reflectance as observed by medium-resolution sensors such as the Moderate Resolution Imaging Spectrometer. These models are operationally used to normalize data to common view and illumination geometries and to calculate integral quantities such as albedo. Currently, to compensate for noise in observed reflectance, these models are inverted against data collected during some temporal window for which the model parameters are assumed to be constant. Despite this, the retrieved parameters are often noisy for regions where sufficient observations are not available. This paper demonstrates the use of Lagrangian multipliers to allow arbitrarily large windows and, at the same time, produce individual parameter sets for each day even for regions where only sparse observations are available.

Fock space for fermion-like lattices and the linear Glauber model

The concept of Fock space representation is developed to deal with stochastic spin lattices written in terms of fermion operators. A density operator is introduced in order to follow in parallel the developments of the case of bosons in the literature. Some general conceptual quantities for spin lattices are then derived, including the notion of generating function and path integral via Grassmann variables. The formalism is used to derive the Liouvillian of the d-dimensional Linear Glauber dynamics in the Fock-space representation. Then the time evolution equations for the magnetization and the two-point correlation function are derived in terms of the number operator. (C) 2008 Elsevier B.V. All rights reserved.

Accelerating linear causal model discovery using hoeffding bounds

Efficiently inducing precise causal models accurately reflecting given data sets is the ultimate goal of causal discovery. The algorithms proposed by Dai et al. has demonstrated the ability of the Minimum Message Length (MML) principle in discovering Linear Causal Models from training data. In order to further explore ways to improve efficiency, this paper incorporates the Hoeffding Bounds into the learning process. At each step of causal discovery, if a small number of data items is enough to distinguish the better model from the rest, the computation cost will be reduced by ignoring the other data items. Experiments with data set from related benchmark models indicate that the new algorithm achieves speedup over previous work in terms of learning efficiency while preserving the discovery accuracy.

Linear causal model discovery using the MML criterion

Determining the causal structure of a domain is a key task in the area of Data Mining and Knowledge Discovery.The algorithm proposed by Wallace et al. [15] has demonstrated its strong ability in discovering Linear Causal Models from given data sets. However, some experiments showed that this algorithm experienced difficulty in discovering linear relations with small deviation, and it occasionally gives a negative message length, which should not be allowed. In this paper, a more efficient and precise MML encoding scheme is proposed to describe the model structure and the nodes in a Linear Causal Model. The estimation of different parameters is also derived. Empirical results show that the new algorithm outperformed the previous MML-based algorithm in terms of both speed and precision.

Discovering linear causal model from incomplete data

One common drawback in algorithms for learning Linear Causal Models is that they can not deal with incomplete data set. This is unfortunate since many real problems involve missing data or even hidden variable. In this paper, based on multiple imputation, we propose a three-step process to learn linear causal models from incomplete data set. Experimental results indicate that this algorithm is better than the single imputation method (EM algorithm) and the simple list deletion method, and for lower missing rate, this algorithm can even find models better than the results from the greedy learning algorithm MLGS working in a complete data set. In addition, the method is amenable to parallel or distributed processing, which is an important characteristic for data mining in large data sets.

Encoding, ensemble and accelerating strategies for linear causal model discovery

This thesis made outstanding contribution in automating the discovery of linear causal models. It introduced a highly efficient discovery algorithm, which implements new encoding, ensemble and accelerating strategies. Theoretic research and experimental work showed that this new discovery algorithm outperforms the previous system in both accuracy and efficiency.

On local analysis of oscillations of a non-ideal and non-linear mechanical model

It is of major importance to consider non-ideal energy sources in engineering problems. They act on an oscillating system and at the same time experience a reciprocal action from the system. Here, a non-ideal system is studied. In this system, the interaction between source energy and motion is accomplished through a special kind of friction. Results about the stability and instability of the equilibrium point of this system are obtained. Moreover, its bifurcation curves are determined. Hopf bifurcations are found in the set of parameters of the oscillating system.

Ghost poles in the nucleon propagator in the linear sigma model approach and its role in pi N low-energy theorems

Complex mass poles, or ghost poles, are present in the Hartree-Fock solution of the Schwinger-Dyson equation for the nucleon propagator in renormalizable models with Yukawa-type meson-nucleon couplings, as shown many years ago by Brown, Puff and Wilets (BPW), These ghosts violate basic theorems of quantum field theory and their origin is related to the ultraviolet behavior of the model interactions, Recently, Krein et.al, proved that the ghosts disappear when vertex corrections are included in a self-consistent way, softening the interaction sufficiently in the ultraviolet region. In previous studies of pi N scattering using ''dressed'' nucleon propagator and bare vertices, did by Nutt and Wilets in the 70's (NW), it was found that if these poles are explicitly included, the value of the isospin-even amplitude A((+)) is satisfied within 20% at threshold. The absence of a theoretical explanation for the ghosts and the lack of chiral symmetry in these previous studies led us to re-investigate the subject using the approach of the linear sigma-model and study the interplay of low-energy theorems for pi N scattering and ghost poles. For bare interaction vertices we find that ghosts are present in this model as well and that the A((+)) value is badly described, As a first approach to remove these complex poles, we dress the vertices with phenomenological form factors and a reasonable agreement with experiment is achieved, In order to fix the two cutoff parameters, we use the A((+)) value for the chiral limit (m(pi) --> 0) and the experimental value of the isoscalar scattering length, Finally, we test our model by calculating the phase shifts for the S waves and we find a good agreement at threshold. (C) 1997 Elsevier B.V. B.V.

A log-linear regression model for the beta-Birnbaum-Saunders distribution with censored data

The beta-Birnbaum-Saunders (Cordeiro and Lemonte, 2011) and Birnbaum-Saunders (Birnbaum and Saunders, 1969a) distributions have been used quite effectively to model failure times for materials subject to fatigue and lifetime data. We define the log-beta-Birnbaum-Saunders distribution by the logarithm of the beta-Birnbaum-Saunders distribution. Explicit expressions for its generating function and moments are derived. We propose a new log-beta-Birnbaum-Saunders regression model that can be applied to censored data and be used more effectively in survival analysis. We obtain the maximum likelihood estimates of the model parameters for censored data and investigate influence diagnostics. The new location-scale regression model is modified for the possibility that long-term survivors may be presented in the data. Its usefulness is illustrated by means of two real data sets. (C) 2011 Elsevier B.V. All rights reserved.