Simple tableau algorithms are given for the noniterative instrumental variable (FABIN 2) and two stage regression (FABIN 3) factor loading estimates of Hägglund. Corresponding generalized least squares estimates of factor covariances and unique variances are introduced. An example is given for the purpose of illustration and comparison.

For several decades, simulation and analysis of mechanisms have been performed with dedicated computer-aided engineering software that implements general dynamic formulations, known in the literature as multi-body systems (MBS) formulations. The MBS name is related to the structure of the mechanism, which is often considered to be a collection of bodies interconnected by mechanical joints (pairs). Nevertheless, only a few formulations are really based on a true multi-body mechanical model, while many others instantiate mathematically quite different mechanical concepts. This paper aims to identify and discuss the mechanical models that fundament the main multi-body mathematical formulations known in the literature. The main features of each model are outlined, based on a detailed presentation of the structure and equations of motion, together with their link with the kinematic and dynamic formulations. A comparative study related to computational efficiency is then presented for the identified main models, based on a test mechanism. Comparative advantages and disadvantages are discussed at the end, considering the identified mechanical models.

Even though null definite objects are usually ungrammatical in English, they are widely used in certain special registers. This paper investigates object drop in the recipe and, to a lesser extent, match broadcasting registers in English, contributing an analysis of a substantial set of naturally occuring data, hence making it possible to verify observations from previous syntactic studies of the phenomenon, which were based on a restricted array of isolated sentences. Having shown that the data support the assumption that the unrealised object is syntactically active, I propose a novel analysis of missing objects in special registers, guided by recent developments in the generative linguistic theory. Null realisation of the object is considered as an issue of externalisation and intralinguistic variation is attributed to the rules operating at the SM interface which make it possible to extend the application of copy deletion, as assumed within the copy theory of movement

We propose an efficient semi-numerical approach to compute the steady-state probability distribution for the number of requests at arbitrary and at arrival time instants in PH/M/c-like systems with homogeneous servers in which the inter-arrival time distribution is represented by an acyclic set of memoryless phases. Our method is based on conditional probabilities and results in a simple computationally stable recurrence. It avoids the explicit manipulation of potentially large matrices and involves no iteration. Owing to the use of conditional probabilities, it delays the onset of numerical issues related to floating-point underflow as the number of servers and/or phases increases. For generalized Coxian distributions, the computational complexity of the proposed approach grows linearly with the number of phases in the distribution.

In order to model the dispersal of volcanic particles in the atmosphere and their deposition on the ground, one has to simulate an advection-diffusion-sedimentation process on a large spatial area. Here we compare a Lattice Boltzmann and a Cellular Automata approach. Our results show that for high Peclet regimes, the cellular automata model produce results that are as accurate as the lattice Boltzmann model and is computationally more effective.

This paper presents a recursive approach for solving kinematic and dynamic problems in snake-like robots using Kane's equations. An n-link model with n-nonholonomic constraints is used as the snake robot model in our analysis. The proposed algorithm which is used to derive kinematic and dynamic equations recursively, enhances the computational efficiency of our analysis. Using this method we can determine the number of additions and multiplications as a function of n. The proposed method is compared with the Lagrange and Newton-Euler's method in three different aspects: Number of operations, CPU time and error in the computational procedures.