A short-term load prediction algorithm for dynamic economic dispatch

Download

015557.pdf

Date

1991

Author

Adanır, Tamer

Metadata

Show full item record

Item Usage Stats

108
views

0
downloads

URI

https://hdl.handle.net/11511/8529

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A SHORT-TERM LOAD PREDICTION ALGORITHM FOR DYNAMIC ECONOMIC-DISPATCH Erkmen, İsmet; ADANIR, T (1994-04-14)
A shape deformation algorithm for constrained multidimensional scaling Sahillioğlu, Yusuf (2015-12-01) We present a new Euclidean embedding technique based on volumetric shape registration. Extrinsic representation of the intrinsic geometry of a shape is preferable in various computer graphics applications as it poses only a small degrees of freedom to deal with during processing. A popular Euclidean embedding approach to achieve such a representation is multidimensional scaling (MDS), which, however, distorts the original geometric details drastically. Our method introduces a constraint on the original MDS ...
A Distributed Fault-Tolerant Topology Control Algorithm for Heterogeneous Wireless Sensor Networks Bagci, Hakki; KÖRPEOĞLU, İBRAHİM; Yazıcı, Adnan (Institute of Electrical and Electronics Engineers (IEEE), 2015-04-01) This paper introduces a distributed fault-tolerant topology control algorithm, called the Disjoint Path Vector (DPV), for heterogeneous wireless sensor networks composed of a large number of sensor nodes with limited energy and computing capability and several supernodes with unlimited energy resources. The DPV algorithm addresses the k-degree Anycast Topology Control problem where the main objective is to assign each sensor's transmission range such that each has at least k-vertex-disjoint paths to superno...
A binomial noised model for cluster validation Toledano-Kitai, Dvora; Avros, Renata; Volkovich, Zeev; Weber, Gerhard Wilhelm; Yahalom, Orly (IOS Press, 2013-01-01) Cluster validation is the task of estimating the quality of a given partition of a data set into clusters of similar objects. Normally, a clustering algorithm requires a desired number of clusters as a parameter. We consider the cluster validation problem of determining the optimal ("true") number of clusters. We adopt the stability testing approach, according to which, repeated applications of a given clustering algorithm provide similar results when the specified number of clusters is correct. To implemen...
A heuristic algorithm for hierarchical representation of form documents Duygulu, P; Atalay, Mehmet Volkan; Dincel, E (1998-08-20) In this paper our aim is to develop a logical representation for form documents. We propose a hierarchical structure to represent the logical layout of a form by using lines. The approach is top-down and no domain knowledge such as the preprinted data or filled-in data is used. Logically same but physically different forms are associated to the same hierarchical tree. This representation can handle geometrical modifications and slight variations.(1).

Citation Formats

T. Adanır, “A short-term load prediction algorithm for dynamic economic dispatch,” Middle East Technical University, 1991.