Service time distributions at computer processing units are often nonexponential. Empirical studies show that different programs may have markedly different processing time requirements. When queuing disciplines are first come, first served, preemptive priority or nonpreemptive priority, models reflecting these characteristics are difficult to analyze exactly. Available approximate techniques a...

MOTIVATION Biopathways are often modeled as systems of ordinary differential equations (ODEs). Such systems will usually have many unknown parameters and hence will be difficult to calibrate. Since the data available for calibration will have limited precision, an approximate representation of the ODEs dynamics should suffice. One must, however, be able to efficiently construct such approximati...

Abstract. We present a method for solving systems of nonlinear equations suitable for problems where convergence of an approximate Newton method is initially slow. The method, nonlinear elimination (NIEm), eliminates the nonlinear equations and appropriate variables deemed to be causing the problem. An analysis of the method is given and leads to a detailed algorithm that reduces automatically ...

This paper describes the design of a visual analysis tool for our Inclusion Processing Framework, called IPFViewer. The tool has been designed in cooperation with a large German steel production facility in order to acquire knowledge from data collected about nonmetallic inclusions and other defects in steel samples. We have highlighted parts of the framework in previous publications in interdi...

An approximate iterative technique for the analysis of complex queuing networks with general service times is presented. The technique is based on an application of Norton’s theorem from electrical circuit theory to queuing networks which obey local balance. The technique determines approximations of the queue length and waiting time distributions for each queue in the network. Comparison of re...

Knowledge compilat ion is the process by which an in i t ia l theory w i th respect to which inference is intractable is transformed into one or more "approximate" or equivalent theories w i th respect to which inference can be performed efficiently. Selman and Kautz introduced Horn lowest upper bound (LUB) approximations in [SK91], and generalized them in [KS91; SK95] to a number of target lan...

It is normal to expect the processor to produce a correct result. But it may be the case that a software application does not need ”strict” correctness, but rather limited correctness. The goal of this project is to search for potential definition of ”non-strict” correctness, as well as investigate the improvements in performance and power consumption that can be achieved in this new model. Thi...

The discrete cosine transform (DCT) has a variety of applications in image and speech processing. The idea of the subband{DFT (SB{DFT) [1], [2] is applied in [3] to the DCT. In this paper the basic idea of the SB{DCT is discussed which is based on subband decomposition of the input sequence. Approximation is done by discarding the computations of bands of little energy. The complexity of this f...

We explore the feasibility of using only unsupervised means to identify non-words, i.e. typos, in a frequency list derived from a large corpus of Dutch and to distinguish between these non-words and real-words in the language. We call the system we built and evaluate in this paper CICCL, which stands for ‘Corpus-Induced Corpus Clean-up’. The algorithm on which CICCL is primarily based is the an...