A linear programming formulation of the page replacement problem is used for proving the opti-mality of the MIN algorithm in a novel way. We describe an algorithm for constructing a solution for the dual problem such that the cost of this solution equals the cost of the MIN solution for the primal problem, thus proving the optimality of the MIN solution for paging, and the optimality of our alg...

The Stanford Linear Accelerator Center (SLAC) operates a high energy (up to 33 GeV) linear accelerator delivering pulses up to a few microseconds wide. The pulsed nature of the electron beam creates problems in the detection and measurement of radiation both from the accelerator beam and the klystrons that provide the RF power for the accelerator. Hence, a pulsed x-ray facility has been built a...

We discuss techniques for Model-Independent Analysis (MIA) of a beamline using correlation matrices of physical variables and Singular Value Decomposition (SVD) of a beamline BPM matrix. The beamline matrix is formed from BPM readings for a large number of pulses. The method has been applied to the Linear Accelerator of the SLAC Linear Collider (SLC). submitted to Sixth European Particle Accele...

We consider the Distributer's Pallet Packing Problem. This problem is to pack a set of distinct products with given quantities in greater volumes (pallets, containers) and to minimize the number of used volumes. The theoretical objective of nding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability asp...

We propose a successive linear programming (SLP) approach to solve the alternating current optimal power flow (ACOPF) problem, which we refer to as the SLP IV-ACOPF algorithm. Our goal is to develop an ACOPF linearization that can be readily extended and integrated into more complex decision processes, e.g. unit commitment, transmission switching. We demonstrate the computational performance an...

In this paper we consider properties of the central path and the analytic center of the optimal face in the context of parametric linear programming. We rst show that if the right-hand side vector of a standard linear program is perturbed, then the analytic center of the optimal face is one-side di erentiable with respect to the perturbation parameter. In that case we also show that the whole a...

Objective: Using Megavoltage photons generated by medical linear accelerator is a common modality for the treatment of malignant. The crucial problem for using photon beams >8MV is the photoneutron yields that increase the risk of secondary cancer that treated with high-energy photon beams. The contaminated neutrons produced in different components of the accelerator head and rely on many param...

Objective: Using Megavoltage photons generated by medical linear accelerator is a common modality for the treatment of malignant. The crucial problem for using photon beams >8MV is the photoneutron yields that increase the risk of secondary cancer that treated with high-energy photon beams. The contaminated neutrons produced in different components of the accelerator head and rely on many param...