Cobb-Douglas Production Function was widely used in economics and productivity studies across many sectors. The function's quantitative modeling of resource inputs and production outputs is appealing to the research domain of construction management. In this thesis we explored this function's application in construction schedule crashing and project risk analysis related to duration of construc...

This paper investigates a risk-averse inventory model by balancing the expected profit and conditional value-at-risk (CVaR) in a newsvendor model setting. We find out that: i) The optimal order quantity is increasing in the shortage cost for both the CVaR only criterion and the tradeoff objective. ii) For the case of zero shortage cost, the optimal order quantity to the CVaR criterion or tradeo...

In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure the user can select from a spectrum of algorithms, the one that best meets a given time-space specification. T...

We study constructions that convert arbitrary deterministic Turing machines to reversible machines; i.e. reversible simulations. Specifically, we study space-efficient simulations; that is, the resulting reversible machine uses O(f(S)) space, where S is the space usage of the original machine and f is very close to linear (say, n log n or smaller). We generalize the previous results on this rev...

At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time Õ(2) and memory Õ(2), thereby improving a 30-year old algorithm by Shamir and Schroeppel. In this paper we extend the Howgrave-Graham– Joux technique to get an algorithm with running time down to Õ(2). An implementation shows the practicability of the technique. Another ch...

We obtain the first non-trivial time-space tradeoff lower bound for functions f : {0, 1}n → {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1 + ǫ)n, for some constant ǫ > 0. We also give the first separation result between the syntactic and semantic read-k models [BRS93] for k > 1 by showin...

Trade-offs occur frequently within sociotechnical systems and allow the system to maintain its output in the face of the variable performance of its constituent components. Trade-offs also occur between systems that must interact with each other. Some of these intersystemic tradeoffs may threaten the integrity of one or both systems particularly if the allowable magnitude of the trade-off is no...

Since the original publication of Martin Hellman’s cryptanalytic time-memory trade-off, a few improvements on the method have been suggested. In all these variants, the cryptanalysis time decreases with the square of the available memory. However, a large amount of work is wasted during the cryptanalysis process due to so-called “false alarms”. In this paper we present a method of detection of ...

Cap and trade remains attractive to many state governments because it provides a much-needed source of additional revenue when greenhouse gas emission allowances are auctioned to the highest bidder. We analyze the income distribution impacts of the California Global Warming Solutions Act under alternative policy designs. These include the free allocation of emission allowances versus recycling ...

Recent compressed suffix trees targeted to highly repetitive text collections reach excellent compression performance, but operation times in the order of milliseconds. We design a new suffix tree representation for this scenario that still achieves very low space usage, only slightly larger than the best previous one, but supports the operations within microseconds. This puts the data structur...