The distributed development and maintenance paradigm for component delivery is fraught with problems. One wants a relationship between developers and clients that is autonomous and anonymous. Yet components written in languages such as C++ require the recompilation of all dependent subsystems when a new version of a component is released. The design of Java’s binary format has side-stepped this...

We show in this text how the idea of the Implicitly Restarted Arnoldi method can be generalised to the non-symmetric Lanczos algorithm, using the two-sided Gram-Schmidt process or using a Lanczos tridiagonalisation. The implicitly restarted Lanczos method can be combined with an implicit lter. It can also be used in case of breakdown and ooers an alternative for look-ahead.

We consider a repairable system such that different completeness degrees are possible for the repair (or corrective maintenance) that go from a `minimal' up to a `complete' repair. Our question is: to what extent must the system be repaired in case of failure for the long-run availability to be optimal? The system evolves in time according to a Markov process as long as it is running, whereas t...

PURPOSE Ten percent of U.S. patients with non-small cell lung cancer experience partial radiographic responses to erlotinib or gefitinib. Despite initial regressions, these patients develop acquired resistance to erlotinib or gefitinib. In these patients, we sought to assess changes in tumor metabolism and size after stopping and restarting erlotinib or gefitinib and to determine the effect of ...

CONTEXT Discontinuation of oral contraceptives often puts women at risk for unintended pregnancies. Understanding why a woman discontinued pill use can provide insight into her risk of discontinuation if she restarts use. METHODS Women younger than 25 obtaining oral contraceptives at three university health centers in 2003-2005 were recruited to participate in a randomized trial; 628 former u...

We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm for the Hamiltonian eigenvalue problem. This allows to easily implement a purging and locking strategy in order to improve the convergence properties of the symplectic Lanczos algorithm. The Krylov-Schur-like restarting is based on the SR algorithm. Some ingredients of the latter need to be adapt...

Recentering-restarting evolutionary algorithms have been used successfully to evolve epidemic networks. This study develops multiple variations of this algorithm for the purpose of evaluating its use for ordered-gene problems. These variations are called recentering or reanchoring-restarting evolutionary algorithms. Two different adaptive representations were explored that both use generating s...

The (Jacobi-)Davidson method, which is a popular preconditioned extension to the Arnoldi method for solving large eigenvalue problems, is often used with restarting. This has significant performance shortcomings, since important components of the invariant subspace may be discarded. One way of saving more information at restart is through “thick” restarting, a technique that involves keeping mo...