Analysing the effect of technical change on individual outputs using modified quasi-Malmquist indexes

Malmquist indexes can be used to estimate technical change over time. The index generally represents the average effect of technical change on all outputs in a multi-output firm. However, changes in technology do not necessarily affect all outputs involved in the analysis equally. In this paper, a method for estimating the effect of technical change on each of the different outputs is proposed. This estimation is done by a modification of quasi-Malmquist indexes. An artificial data set has been used to validate the method proposed in this paper.     

Crossdocking—JIT scheduling with time windows

In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver.     

A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

A Characterisation of Posets that Are nearly Antichains

We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain. This revised version was published online in September 2006 with corrections to the Cover Date.     

An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.     

Analysis of end point vibrations of a two-link manipulator by integrated CAD/CAE procedures

In this work, the effect of flexibility on the trajectory of a planar two-link manipulator is studied using integrated computer-aided design/analysis (CAD/CAE) procedures. The solid models and finite element models of the parts of the manipulator are created by using the CAD/CAE software I-DEAS. The assembly is defined, and knowing the payload and the end point trajectory, the velocities and accelerations of the parts, joint forces and driving torques are calculated using the rigid body dynamics. All the time dependent nodal forces acting on the parts including distributed gravity and inertia forces are created in files with the I-DEAS program file format. The finite element vibration analysis of the parts is performed by I-DEAS. The end point vibrations and the deviations from the rigid-body trajectory are analyzed for different types of end point acceleration curves. A circular trajectory is considered as an example. It is observed that the precision of the manipulator can be increased by testing different end point acceleration curves without changing the trajectory and the duration of the end point work. The procedure explained in this work can be used for this purpose successfully.     

On a class of preconditioners for solving the Helmholtz equation

In 1983, a preconditioner was proposed [J. Comput. Phys. 49 (1983) 443] based on the Laplace operator for solving the discrete Helmholtz equation efficiently with CGNR. The preconditioner is especially effective for low wavenumber cases where the linear system is slightly indefinite. Laird [Preconditioned iterative solution of the 2D Helmholtz equation, First Year's Report, St. Hugh's College, Oxford, 2001] proposed a preconditioner where an extra term is added to the Laplace operator. This term is similar to the zeroth order term in the Helmholtz equation but with reversed sign. In this paper, both approaches are further generalized to a new class of preconditioners, the so-called “shifted Laplace” preconditioners of the form Δφ−k²φ with . Numerical experiments for various wavenumbers indicate the effectiveness of the preconditioner. The preconditioner is evaluated in combination with GMRES, Bi-CGSTAB, and CGNR.