Personal Home Page
Reserch intrests:
Computational Geometry, Algorithms, Complier Design
Honors:
MS Project: Visiting Weighted Polygons
Superviser: Dr. Ghodsi [Sharif University]
Summary: The goal is to present an algorithm to find the shortest path visiting several weighted polygons on the plane. An approximation algorithm was proposed and some other problems on weighted region have been solved for this project.
BS Project: Asserted LALR(1)
Superviser: Dr. Jaberipur [Shahid Beheshti University]
Summary: Asserted LALR(1) is an extention for LALR(1) algorithm allowing it to parse some of the ambiguous grammars using external information provided to reduce the extra shifts and reductions. The goal of the project was to analize and investigate the algorithm and fix some of its flaws.
Courses that I have been TA:
Some of my University Projects:
Computational Geometry, Algorithms, Complier Design
Honors:
- Silver Medal(Second Place) in Iran National Olympiads of Computer
- Rank 4 in Computer Scince and 11th Place in Iran in Computer Engineering on MS Entrance Exams
- Rank 5 in Natianal Students Computer Engineering Olympiads
- Rank 7, 9, and 12 in ACM Programming Contest (West Asia Region) [Best Team of University each]
- Rank 4 in Robocup Soccer Simulation (Padova Italy)
MS Project: Visiting Weighted Polygons
Superviser: Dr. Ghodsi [Sharif University]
Summary: The goal is to present an algorithm to find the shortest path visiting several weighted polygons on the plane. An approximation algorithm was proposed and some other problems on weighted region have been solved for this project.
BS Project: Asserted LALR(1)
Superviser: Dr. Jaberipur [Shahid Beheshti University]
Summary: Asserted LALR(1) is an extention for LALR(1) algorithm allowing it to parse some of the ambiguous grammars using external information provided to reduce the extra shifts and reductions. The goal of the project was to analize and investigate the algorithm and fix some of its flaws.
Courses that I have been TA:
- Languages and Automata Theory, 4 Semesters with Dr. Jeberipur (Shahid Beheshti University), 1 Semester Dr. Gavamizadeh (Shahid Beheshti University)
- Graph Theory, Dr. Haj Abolhassani(Shahid Beheshti University, Scince Faculty), Dr. Gavamizadeh (Shahid Beheshti)
- Algorithms Design, Dr. Gavamizadeh (Shahid Beheshti University)
- Computer Networks, Dr. Abbaspure (Shahid Beheshti University)
- Compiler Design, Dr. Jaberipur (Sharif University)
- Applying Fuzzy Relations in Role-Based Access Control
- Touring a Sequence of Polygons in Weighted Regions
- An Optimal Parallel Algorithm for Computing the Visibility Complex
- Touring a Sequence of Weighted Polygons
Some of my University Projects:
-
My compiler projects, writen using Bison and Lex. A language simmilar to Delphi.
Download Here
-
A simple client/server serving simmilar to ftp. A part of network course project.
Download Here
-
A Simple chat Client/Server. Serving abilities simmilar to IRC. A part of network course project.
Download Here
-
My DB project, some parts of code and sql commands for Oracle.
Download Here
-
A Neural Network Designer for patern recognition Course.
DownLoad Here
-
Advanced Operating System Projects. (A kernel based netsniffer, Process Hider, and Keylogger).
Download Here
-
A demo showing for the set of points which the sum of their distances from given set of points is equal.
Download Here
-
A demo for Clustering algorithms (including KNN, and Prime algorithms). Other algorithms are addable.
Download Here
-
A virtual filesystem for linux. The folders are devisor of given parameter(default 42).
Download Here
-
A demo for drawing a function. A Part of Graphic Course.
Download Here
-
Information Storage and Reterval Project.
Download Here
-
A program to convert vcg files generated by bison to dot files. I used it for generating LALR diagrams for my BS project Thesis.
Download Here
