We describe a cutting plane algorithm for solving linear ordering problems. The algorithm uses a primal-dual interior point method to solve the rst few relaxations and then switches to a simplex method to solve the last few relaxations. The simplex method uses CPLEX 4.0. We compare the algorithm with one that uses only an interior point method and with one that uses only a simplex method. We so...

This paper discusses the application of evolutionary multi-objective optimization algorithms namely Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Modified NSGA-II (MNSGA-II) for solving the Combined Economic Emission Dispatch (CEED) problem with valvepoint loading. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED prob...

In this paper, we propose a novel parallel architecture for fast hardware implementation of elliptic curve point multiplication (ECPM), which is the key operation of an elliptic curve cryptography processor. The point multiplication over binary fields is synthesized on both FPGA and ASIC technology by designing fast elliptic curve group operations in Jacobian projective coordinates. A novel com...

Center for Endocrinology (A.M.B., J.P.M.), William Harvey Research Institute, St. Bartholomew’s Hospital, Queen Mary, University of London, London EC1A 7BE, United Kingdom; Department of Clinical Biochemistry (N.F.T.), King’s College Hospital, London SE5 9RS, United Kingdom; Department of Medical Oncology (J.H.S., M.E.G., T.A.), Royal Marsden Hospital, London SW3 6JJ, United Kingdom; Institute ...

Truncated multiplication can be used to significantly reduce power dissipation for applications that do not require correctly rounded results. This paper presents a power efficient method for designing floating point multipliers that can perform either correctly rounded IEEE compliant multiplication or truncated multiplication, based on an input control signal. Compared to conventional IEEE flo...

A new procedure for calculating eld points with the boundary element method (BEM) is outlined. In the conventional BEM (CBEM) eld points are computed as post{processing by recurrently solving the boundary integral equation with known boundary data for every eld point of interest. This procedure is very time-consuming. On the other hand, newly developed hybrid boundary element formulations (HBEM...

In this paper, we propose an architecture/methodology for making FPGAs suitable for integer as well as variable precision floating point multiplication. The proposed work will of great importance in applications which requires variable precision floating point multiplication such as multi-media processing applications. In the proposed architecture/methodology, we propose the replacement of exis...

In the present paper, a solution scheme is proposed for frictionless contact problems of linear elastic bodies, which are discretized using the finite element method with lower order elements. An approach combining the interior-point method and the semismooth Newton method is proposed. In this method, an initial active set for the semismooth Newton method is obtained from the approximate optima...

Implicit methods for Hamilton Jacobi Bellman (HJB) partial differential equations give rise to highly nonlinear discretized algebraic equations. The classic policy iteration approach may not be efficient in many circumstances. In this article, we derive sufficient conditions to ensure convergence of a combined fixed point-policy iteration scheme for solution of the discretized equations. Numeri...