UCF Course Work
EEL 5708 High Performance Computer Architecture
The homework assignments and their submitted solutions can be found here.
EEL 5881 Software Engineering I
The class project was named as "Automata@HOME". The output is a distributed execution system that aims to solve a computationally large problem. Like in other @Home projects, the computationally intensive task in this project is solved by using CPU cycles contributed by the client systems. The radio data collected from space are broken up into small pieces which can be analyzed independently and sent to the clients. The data transmitted to the clients are small but they will require considerable amount of CPU time to be analyzed. The clients analyze the data and the result is sent back to the server.
The computationally large problem to be solved is an instance of Cellular Automata (CA). The type used in the project is “1D binary CA”, which involves a one dimensional array of cells. Each cell has a state, either 0 or 1. The CAs are in general irreversible. Given an ending state, it is generally not possible to predict the starting state, because of the rules leading to multiple states transitioning to the same state. This means that, to find a starting state that can reach the ending state within a limited number of time steps, the only method possible is brute force - exhaustive search through all possible start states and simulating them till the end state is reached or simulation limit is reached. This approach is very suitable to be implemented like SETI@HOME project since it has small data transmission, but high CPU requirements.
A research paper in Software Engineering is selected and presented in class. The final review report was the output of this work.
A UML (HW-1) and a programming (HW-2) homework were assigned. Solution-1 and Solution-2 were submitted.
EEL 6883 Software Engineering II
The class project was named as "Autonomous Rechargeable Sensor Network Simulator". All the work was prepared and presented by a team formed by two members. Two presentations (Project Progress Presentation and the Final Project Presentation) and a final report were prepared during the lifetime of the project..
All reviewed papers can be found at course webpage. The rar file containing M.Ilhan Akbas' reviews can be found here.
The papers that were presented can be found at course webpage. The rar file containing M.Ilhan Akbas' paper review presentations can be found here. The work was prepared and presented by the team formed by two members.
EEL 6897 Software Development for Real-Time Engineering Systems
A set of Crossbow Mica2 motes is used in this project. The TinyOs operating system and the NesC programming language are used for the project. The work was presented and a report was written at the end of the project.
EEL 6788 Advanced Topics in Wireless Networks
Using the YAES simulator, simulated the Autonomous Sensor Network presented by Dr. Olariu in the following paper: link
The sensor nodes are very small devices with limited power and functions. However, they can harvest and store some energy from the environment, i.e. rechargeable sensors.
The network consists of a large number of sensor nodes and a set of aggregation nodes that organize and manage the sensor nodes in their vicinity. The aggregation nodes have special equipment for long range communications and may be stationary or mobile.
A patrol vehicle moves around in the area of the network and communicates with the aggregation nodes. Based on the information obtained from the aggregation nodes, the patrol vehicle may change its course in order to avoid a threat, or to investigate something of interest that was reported by the sensor nodes. Things to measure:
Two presentations (Project Progress Presentation and the Final Project Presentation) and a final report were prepared during the lifetime of the project.
CDA 5530 Performance Models of Computers and Networks
There were two problem sets (HW-1 and HW-2) and four programming projects assigned.
COP 5537 Network Optimization
In the class project, PageRank algorithm proposed by L. Page and S. Brin is investigated. It is aimed to understand the graph model of the PageRank application, implementation of the algorithm, and the graph-theoretic problem being solved. A simple version of the algorithm is implemented and the graph theory is used to model and solve the problem of web-page rank determination.
Two reports ( interim and final ) and a presentation were prepared and presented for the project.
EEL 5542 Random Processes
Four problem sets were assigned.
© Mustafa Ilhan Akbas Last updated: January 30, 2010