High-level languages offer abstraction mechanisms that can reduce development time and improve software quality. But abstraction mechanisms often have an accumulative runtime overhead that can discourage their use. Multi-stage programming (MSP) languages offer constructs that make it possible to use abstraction mechanisms without paying a runtime overhead. This paper studies applying MSP to imp...

this paper presents a new multi-sensor data fusion method based on the combination of wavelettransform (wt) and extended kalman filter (ekf). input data are first filtered by a wavelettransform via daubechies wavelet “db4” functions and the filtered data are then fused based onvariance weights in terms of minimum mean square error. the fused data are finally treated byextended kalman filter for...

Several other methods of achieving dynamic range control were also discussed in the previous chapter. These methods are typically unsharp mask filters with large kernel sizes, and multi-scale approaches such as multi scale image contrast amplification (MUSICA) developed by the Agfa-Gevaert company (Vuylsteke & Schoeters, 1999). In achieving their goal of dynamic range control, these methods alt...

The curse of dimensionality and computational time cost are a great challenge to operation of large-scale hydropower systems (LSHSs) in China because computer memory and computational time increase exponentially with increasing number of reservoirs. Discrete differential dynamic programming (DDDP) is one of the most classical algorithms for alleviating the dimensionality problem for operation o...

The objective of this work is to investigate market power issues in bid-based hydrothermal scheduling. Initially, market power was simulated with a single stage Cournot–Nash equilibrium model. In this static model the equilibrium was calculated analytically. It was shown that the total production of N strategic agents is smaller than the least-cost solution by a factor of (N/(N +1)). Market pow...

This paper proposes a distributed solution approach to a certain class of dynamic resource allocation problems and develops a dynamic programming-based multiagent decision-making, learning, and communication mechanism. In the class of dynamic resource allocation problems we consider, a set of reusable resources of different types has to be assigned to tasks that arrive randomly over time. The a...