Incremental changes add new functionality and properties to software. They are the core of software evolution, maintenance, iterative development, agile development, and similar software processes. This paper presents a technique for unanticipated incremental software change and a case study. The technique uses programming concepts as the foundation, and contains steps of concept location, actu...

Abstract This paper presents an assessment of infill drilling opportunities in a complex multi-layered heterogeneous carbonate formation located Abu Dhabi offshore. The subject field was developed last century and is currently undergoing further development with line drive horizontal wells. being redeveloped for improved oil recovery at higher production rates long An process defined using sect...

In this paper, we propose an optimization technique that can be used to optimize the placements of reference nodes and improve the location determination performance for the multi-floor building. The proposed technique is based on Simulated Annealing algorithm (SA) and is called MSMR-M. The performance study in this work is based on simulation. We compare other node-placement techniques found i...

Views stored in a data warehouse need to be kept current. As recomputing the views is very expensive, incremental maintenance algorithms are required. Over recent years, several incremental maintenance algorithms have been proposed. None of the proposed algorithms handle the general case of relational expressions involving aggregate and outerjoin operators efficiently. In this article, we devel...

In this paper, a novel on-line incremental speaker adaptation technique is proposed for real time transcription applications such as automatic closed-captioning of live TV programs. Differently from previously proposed methods, our technique does not operate at utterance level but instead speaker change detection and clustering as well as speaker adaptation occur over a short chunk of the incom...

We present a new technique for visually comparing placement results through component coloring using partitioning and the Fiedler eigenvector. By coloring a placement result, we can quickly get insights on how to improve a placement tool and understand what matters and what does not to the placement quality. As a side effect, our coloring scheme may generate beautiful images, making this paper ...

The genetic technique for standard cell placement presented in [1] is a two-level, hierarchal random-search algorithm to find cell placements that have low routing cost. The lower level of the hierarchy consists of a genetic-based placement algorithm, taking a set of parameters and producing a locally optimal placement within the bounds of the parameters. The upper level is another genetic opti...

Successful implant placement at the time of extraction has been documented. Implant placement at the time of extraction was initially performed as a two-stage procedure often with barrier membranes and sophisticated second-stage surgical uncoverings. The authors describe the next generation of this technique, including atraumatic tooth removal with simultaneous root form, implant placement, and...

In the search for binary systems inspiral signal in interferometric gravitational waves detectors, one needs the generation and placement of a grid of templates. We present an original technique for the placement in the associated parameter space, that makes use of the variation of size of the isomatch ellipses in order to reduce the number of templates necessary to cover the parameter space. A...