Deriving a dynamic programming algorithm for batch scheduling in the refinement calculus

Aktuğ, İrem
Refinement Calculus is a formalization of stepwise program construction.In this approach a program is derived from its specification by applying refinement rules.The Refinement Calculator,developed at TUCS,Finland,provides tool support for the Refinement Calculus.This thesis presents a case study aiming to evaluate the applicability of the theory and the performance of the tool.The Refinement Calculator is used for deriving a dynamic progaramming algorithm for a single-machine batch scheduling problem.A quadratic algoritm is derived by refining a formal specification of this problem into executable code.The need for stronger support for relevant domain theories and abstraction mechanisms in the target language have been noted.


Comparison of rough multi layer perceptron and rough radial basis function networks using fuzzy attributes
Vural, Hülya; Alpaslan, Ferda Nur; Department of Computer Engineering (2004)
The hybridization of soft computing methods of Radial Basis Function (RBF) neural networks, Multi Layer Perceptron (MLP) neural networks with back-propagation learning, fuzzy sets and rough sets are studied in the scope of this thesis. Conventional MLP, conventional RBF, fuzzy MLP, fuzzy RBF, rough fuzzy MLP, and rough fuzzy RBF networks are compared. In the fuzzy neural networks implemented in this thesis, the input data and the desired outputs are given fuzzy membership values as the fuzzy properties أlow...
Monte Carlo analysis of ridged waveguides with transformation media
Ozgun, Ozlem; Kuzuoğlu, Mustafa (Wiley, 2013-07-01)
A computational model is presented for Monte Carlo simulation of waveguides with ridges, by combining the principles of transformation electromagnetics and the finite methods (such as finite element or finite difference methods). The principle idea is to place a transformation medium around the ridge structure, so that a single and easy-to-generate mesh can be used for each realization of the Monte Carlo simulation. Hence, this approach leads to less computational resources. The technique is validated by me...
New montgomery modular multıplier architecture
Çiftçibaşı, Mehmet Emre; Yücel, Melek D; Department of Electrical and Electronics Engineering (2005)
This thesis is the real time implementation of the new, unified field, dualا radix Montgomery modular multiplier architecture presented by Savaş et al, for performance comparison with standard Montgomery multiplication algorithms. The unified field architecture operates in both GF(p) and GF(2n). The dual radix capability enables processing of two bits of the multiplier in every clock cycle in GF(2n) mode, while one bit of the multiplier is processed in GF(p) mode. The new architecture is implemented in a Xi...
Bayesian learning under nonnormality
Yılmaz, Yıldız Elif; Alpaslan, Ferda Nur; Department of Computer Engineering (2004)
Naive Bayes classifier and maximum likelihood hypotheses in Bayesian learning are considered when the errors have non-normal distribution. For location and scale parameters, efficient and robust estimators that are obtained by using the modified maximum likelihood estimation (MML) technique are used. In naive Bayes classifier, the error distributions from class to class and from feature to feature are assumed to be non-identical and Generalized Secant Hyperbolic (GSH) and Generalized Logistic (GL) distribut...
Pipelined design approach to microprocessor architectures a partial implementation : mips pıpelined architecture on fpga
Altıniğneli, Muzaffer Can; Güran, Hasan; Department of Electrical and Electronics Engineering (2005)
This thesis demonstrate how pipelining in a RISC processor is achieved by implementing a subset of MIPS R2000 instructions on FPGA. Pipelining, which is one of the primary concepts to speed up a microprocessor is emphasized throughout this thesis. Pipelining is fundamentally invisible for high level programming language user and this work reveals the internals of microprocessor pipelining and the potential problems encountered while implementing pipelining. The comparative and quantitative flow of this thes...
Citation Formats
İ. Aktuğ, “Deriving a dynamic programming algorithm for batch scheduling in the refinement calculus,” M.S. - Master of Science, Middle East Technical University, 2003.