We present three different approaches for multi-step prediction using the fuzzy Markov predictor (FMP). The FMP is a modification of the hidden Markov model in order to enable it to predict numerical values. In the fi...
详细信息
We present three different approaches for multi-step prediction using the fuzzy Markov predictor (FMP). The FMP is a modification of the hidden Markov model in order to enable it to predict numerical values. In the first approach, the one normally used in neural networks, past predictions are used as input for the next predictions. The second and third approaches follow the standard way of making multi-step prediction in a dynamic Bayesian network. FMP using these three approaches is applied to the task of monthly electric load multi-step forecasting and successfully compared with two Kalman filter models, BATS and STAMP, and two traditional forecasting methods, Box-Jenkins and Winters exponential smoothing.
In this paper, we assess the performance of DSMIO cachecoherence algorithm implemented in a parallel object-based database management system (ODBMS). The distinguishing feature of DSMIO is its use of the lazy release ...
详细信息
We present two new versions of the fuzzy Markov predictor (FMP) with different dependences among the inputs: first-order and second-order dependences. The FMP is a modification of the hidden Markov model in order to e...
详细信息
We present two new versions of the fuzzy Markov predictor (FMP) with different dependences among the inputs: first-order and second-order dependences. The FMP is a modification of the hidden Markov model in order to enable it to predict numerical values. The FMP can be seen as an extension of the fuzzy Bayes predictor. These hybrid systems are applied to the task of monthly electric load forecasting and successfully compared with one fuzzy system, and two traditional forecasting methods: Box-Jenkins and Winters exponential smoothing.
We present the fuzzy Markov predictor (FMP), a hybrid system that is applied to the task of monthly electric load forecasting. The FMP is a modification we introduce in the hidden Markov model in order to enable it to...
详细信息
We present the fuzzy Markov predictor (FMP), a hybrid system that is applied to the task of monthly electric load forecasting. The FMP is a modification we introduce in the hidden Markov model in order to enable it to predict numerical values. The FMP can be seen as an extension of the fuzzy Bayes predictor (FBP) that was modified from the naive Bayes classifier. For verifying the efficiency of the FMP's prediction, we compare it with the FBP, one fuzzy system and two traditional forecasting methods, Box-Jenkins and Winters exponential smoothing.
This work introduces a new technique that enables SDSMs to categorize dynamically and accurately memory sharing patterns in both classes of regular and irregular applications. The categorization is carried out automat...
详细信息
We present the fuzzy Bayes predictor (FBP), a hybrid system for the task of monthly electric load forecasting. The FBP is a modification we introduce in the naive Bayes classifier in order to enable it to predict nume...
详细信息
ISBN:
(纸本)0780370449
We present the fuzzy Bayes predictor (FBP), a hybrid system for the task of monthly electric load forecasting. The FBP is a modification we introduce in the naive Bayes classifier in order to enable it to predict numerical values. We consider three versions of the FBP, each one with a different dependence among the input data: independence, first-order and second-order dependence. For verifying the efficiency of the FBP's prediction, we compare it with two fuzzy systems and two traditional forecasting methods, Box-Jenkins and Winters exponential smoothing.
This work intends to present and to analyze a new penalty method that purposes to solve the general nonlinear programming problem subject to inequality constraints. The proposed method has the important feature of bei...
详细信息
This work intends to present and to analyze a new penalty method that purposes to solve the general nonlinear programming problem subject to inequality constraints. The proposed method has the important feature of being completely differentiable and combines features of both exterior and interior penalty methods. Numerical results for some problems are commented on. International Federation of Operational Research Societies 2001.
This work introduces a new technique that enables SDSMs to categorize dynamically and accurately memory sharing patterns in both classes of regular and irregular applications. The categorization is carried out automat...
详细信息
ISBN:
(纸本)0769509908
This work introduces a new technique that enables SDSMs to categorize dynamically and accurately memory sharing patterns in both classes of regular and irregular applications. The categorization is carried out automatically at run-time on a per-page basis, requiring no user or compiler assistance. We evaluate the potential benefits of our technique using execution-driven simulations of 8 applications running on TrendMarks on a network of 8 workstations. Surprisingly, we found that producer-consumer(s) and migratory are the dominant patterns even in irregular applications. Preliminary results suggest that the categorization technique we propose is a promising option to further improve the performance of current adaptive SDSM systems.
The original proposal of active contour models, also called snakes, for image segmentation, suffers from a strong sensitivity to its initial position and can not deal with topological changes. The sensitivity to initi...
详细信息
The original proposal of active contour models, also called snakes, for image segmentation, suffers from a strong sensitivity to its initial position and can not deal with topological changes. The sensitivity to initialization can be addressed by dynamic programming (DP) techniques which have the advantage of guaranteeing the global minimum and of being more stable numerically than the variational approaches. Their disadvantages are the storage requirements and computational complexity. In this paper we address these limitations of DP by reducing the region of interest (search space) through the use of the Dual-T-Snake approach. The solution of this method consists of two curves enclosing each object boundary which allows the definition of a more efficient search space for a DP technique. The resulting method (Dual-T-Snake plus DP) inherits the capability of changing the topology and avoiding local minima from the Dual-T-Snake and the global optimal properties of the dynamic programming. It can be also extended for 3D.
In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two vers...
详细信息
暂无评论