We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t
A real time algorithm for the location search of discontinuous conductivities with one measurement
✍ Scribed by Ohin Kwon; Jin Keun Seo; Jeong-Rock Yoon
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 292 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0010-3640
- DOI
- 10.1002/cpa.3009
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We consider an inverse problem for finding the anomaly of discontinuous electrical conductivity by one current‐voltage observation. We develop a real time algorithm for determining the location of the anomaly. This new idea is based on the observation of the pattern of a simple weighted combination of the input current and the output voltage. Combined with the size estimation result, this algorithm gives a good initial guess for Newton‐type schemes. We give the rigorous proof for the location search algorithm. Both the mathematical analysis and its numerical implementation indicate our location search algorithm is very fast, stable and efficient. © 2001 John Wiley & Sons, Inc.
📜 SIMILAR VOLUMES