Homogeneous renewal equation

Let F be a non-arithmetic distribution on the line , and W be the class of bounded functions w without discontinuity of the second kind such that

.In this paper, we show that the solution of the homogeneous renewal equation w = w F in the class W is a constant-function.     

Theoretical analysis of the onset of liquid entrainment for slots of finite width

The onset of liquid entrainment during discharge from large reservoirs containing a stratified mixture of two immiscible fluids through a side slot of a finite width is considered theoretically. A previously reported analysis in which the slot was approximated as a two-dimensional line sink has been extended to account for the finite width of the slot. The model resulting from the present analysis is expressed in terms of two simple algebraic equations suitable for hand calculations. According to the present results, the ratio of the critical height to the slot width is dependent only on the Froude number. Numerical results show that the present model approaches the correct physical limits at low Froude numbers and it converges to the predictions of the previously reported simple model at high Froude numbers.     

Cold compaction of ceramic powder: Computational analysis of the effect of pressing method and die shape

This paper deals with a computational analysis of the influence of the pressing method and part geometry on the final density distribution in the cold compaction process of ceramic alumina powders. The analysis is based on the explicit finite-element model proposed and validated in a previous study. The mechanical behavior of the processing material is described using a multisurface elastoplastic model, the modified Drucker-Prager/Cap model Published in Prikladnaya Mekhanika, Vol. 43, No. 10, pp. 129–134, October 2007.     

Asymptotic properties of computationally efficient alternative estimators for a class of multivariate normal models

Parameters of Gaussian multivariate models are often estimated using the maximum likelihood approach. In spite of its merits, this methodology is not practical when the sample size is very large, as, for example, in the case of massive georeferenced data sets. In this paper, we study the asymptotic properties of the estimators that minimize three alternatives to the likelihood function, designed to increase the computational efficiency. This is achieved by applying the information sandwich technique to expansions of the pseudo-likelihood functions as quadratic forms of independent normal random variables. Theoretical calculations are given for a first-order autoregressive time series and then extended to a two-dimensional autoregressive process on a lattice. We compare the efficiency of the three estimators to that of the maximum likelihood estimator as well as among themselves, using numerical calculations of the theoretical results and simulations.     

Lyapunov-type inequalities for nonlinear systems

In this paper, by using elementary analysis, we establish some new Lyapunov-type inequalities for nonlinear systems of differential equations, special cases of which contain the well-known equations such as Emden-Fowler-type and half-linear equations. The inequalities obtained here can be used as handy tools in the study of qualitative behaviour of solutions of the associated equations.     

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.