Any Boolean expressions may be converted into positive-form, which has only union and intersection operators. Let E be a positive-form expression with n literals. Assume that the truth-values of the literals are read one at a time. The numbers s(n) of steps (operations) and b(n) of working memory bits (footprint) needed to evaluate E depend on E and on the evaluation technique. A recursive eval...

Network providers aim to offer a high level of service quality in order to satify their customers’ requirements. One of the key factors to fulfil this requirement is a careful network design providing enough available transmission capacity. As data traffic tends to increase continuously, network operators regularly face the necessity to upgrade their network to match the growing demands. In thi...

We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs (e.g. disk data). The term \indirect" indicates that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk databases that are indexed using the suux arr...

Based on a Bayesian decision theoretic approach, we optimize frequentist single- and adaptive two-stage trial designs for the development of targeted therapies, where in addition to an overall population, a pre-defined subgroup is investigated. In such settings, the losses and gains of decisions can be quantified by utility functions that account for the preferences of different stakeholders. I...

I discuss optimized data analysis and Monte Carlo methods. Reweighting methods are discussed through examples, like Lee-Yang zeroes in the Ising model and the absence of deconfinement in QCD. I discuss reweighted data analysis and multi-hystogramming. I introduce Simulated Tempering, and as an example its application to the Random Field Ising Model. I illustrate Parallel Tempering, and discuss ...

Verification and validation are the major tasks during the design of digital hardware/software systems. Often more than 70% of the development time is spent for locating and correcting errors in the design. Therefore, many techniques have been developed to support the debugging process. Recently, simulation and test methods have been accompanied by formal methods such as equivalence checking an...

This paper describes a new, experimentally verified, noise analysis and the design considerations of the dynamic characteristics of silicon radiometers. Transimpedance gain, loop gain, and voltage gain were optimized versus frequency for photodiode current meters measuring ac and dc optical radiation. Silicon radiometers with improved dynamic characteristics were built and tested. The frequency...

Although shadow mapping has found widespread adoption among those who seek realistic and believable lighting, the algorithm possesses an aliasing issue that is difficult to control. Recent insights have spurred a flurry of activity and bred a number of novel heuristic approaches to such control. Unfortunately, many of the proffered heuristics, while improving shadow quality for certain scenes, ...

In a conventional PBS, each crewmember sends in his bid (i.e. preferences) without knowing the preferences of other crewmembers. He is bidding "blind". As a consequence, conflicts result: some trips are desired by (i.e. fulfill the preferences of) too many crewmembers and some are desired by no crewmembers. In the post-bid optimization process, the global optimizer attempts to reconcile conflic...

In this paper we develop an alternative method to derive finite difference approximations of derivatives. The purpose is to find schemes which work for a broader range of frequencies than the usual approximations based on polynomial fitting and Taylor’s Theorem to the expense of less accuracy for low frequencies. The numerical schemes are obtained as solutions to constrained optimizations probl...