We propose and analyze a general periodic-review model in which the firm has access to a set of potential suppliers, each with specific yield and price characteristics. Assuming that unsatisfied demand is backlogged, the firm incurs three types of costs: (i) procurement costs, (ii) inventory-carrying costs for units carried over from one period to the next, and (iii) backlogging costs. A procur...

This dissertation presents a new method for distributed caching to exploit the aggregate memory of networks of workstations in data-intensive applications. The approach is based on a detailed cost model to compute a good cache allocation. As the input parameters for the cost model are in general a-priori unkown and possibly evolve, we use specifically designed protocols to estimate and dissemin...

We build a theory of reference-dependent preferences based on adjustment costs in consumption. The main contribution of the theory is that it endogenizes the evolution of the reference point. The reference point generated by our model exhibits several features exogenously assumed in existing theories: it (1) re‡ects recent expectations, (2) depends on past consumption levels, and (3) diminishes...

We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, which occur frequently in practice. The system establishes a foundation for obtaining high query processing performance while pre-computing only limited aggregates. The paper shows how this reuse of aggregates is enabl...

It is well-known that the results of analyses of aggregate data, such as those provided as outputs from censuses, are dependent on the size and shape of the zones used to report the data. However, many users of aggregate census data do not consider how far the zones utilised in their analyses capture spatial information about the population sub-groups they are studying. In addition, future data...

We present the TreeScape system which, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results involving the kinds of irregular dimension hierarchies that occur frequently in practice. The system establishes a foundation for obtaining high-performance query processing while precomputing only few aggregates. It is demonstrated how this reuse of agg...

In relational learning, predictions for an individual are based not only on its own properties but also on the properties of a set of related individuals. Many systems use aggregates to summarize this set. Features thus introduced compare the result of an aggregate function to a threshold. We consider the case where the set to be aggregated is generated by a complex query and present a framewor...

This paper studies the dynamics of the traveler’s day-to-day route adjustment process in the general transportation network with fixed or elastic demand and homogeneous or heterogeneous users. Each traveler is assumed to adjust his/her route choice according to the excess travel cost between the instantaneous experienced travel cost and a certain referred level, which induces an aggregate path ...

In stereo matching, computing matching cost or similarity between pixels across different images is one of the main steps to get reliable results. More accurate and robust matching cost can be obtained by aggregating per-pixel raw matching cost within the predefined support area. Here, it is very important to aggregate only valid supports from neighbouring pixels. However, unfortunately, it is ...

nowadays generation capacity in traditional grid depends on fossil fuels and contributes significantly to the increase of pollution emission. in deregulated grids in addition to using demand response programs (drps) to reducing the cost of electricity production, peak clipping and improve reliability use of green plants such as hydro plant, wind plant become widespread. in a smart grid, end use...