lanczos-type algorithms are well known for their inherent instability. they typically breakdown occurs when relevant orthogonal polynomials do not exist. current approaches to curing breakdown rely on jumping over the non-existent polynomials to resume computation. this may have to be used many times during the solution process. we suggest an alternative to jumping, which consists of restarting...

A major problem in an isolated DC/DC converters operating at high switching frequencies is the attendant switching losses in the semiconductor devices. This can be reduced by introducing either zero-voltage switching (ZVS) or zero-current switching (ZCS) of the semiconductor switches. This paper deals with the simulation, design, fabrication and experimental evaluation of a novel soft-switching...

Although the contribution of immigration and religious switching to the changing religious landscape in Canada seems well established, we lack knowledge on the religious switching of immigrants. In this study we address if and to what extent immigrants to Canada change religion after their arrival. We use data on religious affiliation and other demographic characteristics from the 1981, 1991 an...

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract Multithreaded distributed{memory multiprocessor architectures ar...

In this paper, we propose a new Tree Switching Protocol (TSP) to reduce multicast routing states required for a forest of multicast trees. The protocol accomplishes this goal by selecting a base multicast tree and " switching '' other multicast trees to the base tree. This results in more overlapping among the multicast trees and a net reduction in multicast state. A further reduction in the st...

Instruction level multithreading is a technique for tolerating long– latency operations (e.g., cache misses) by switching the processor to another thread instead of waiting for the completion of a lengthy operation. In block multithreading, context switching occurs for each initiated long–latency operation. However, processor cycles during pipeline stalls as well as during context switching are...

We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative results.

Data minimisation is a privacy enhancing principle, stating that personal data collected should be no more than necessary for the specific purpose consented by the user. Checking that a program satisfies the data minimisation principle is not easy, even for the simple case when considering deterministic programs-as-functions. In this paper we prove (im)possibility results concerning runtime mon...