Professional Documents
Culture Documents
Potential Thesis Topics
Potential Thesis Topics
1. Data Mining
Implementation and evaluation of optimal and / or heuristic algorithms for
computing association rules. I have new ideas for devising a new algorithm. The
research includes formulation and implementation of a new algorithm and compares
its performance with other known algorithms.
My publications # 2,9, 13, and 20 are related to the above three topics
This topic deal with different techniques for designing intelligent interfaces for
database systems, which provides a paradigm for programming database without the
knowledge of SQL and tables. Ullman and Korth have formulated a theoretical model
of such interfaces, which is called the universal relation. The research includes
examining this model and building an intelligent interface based on this model.
My papers # 4, 6,7,10, and 12 are related to this topic. The new research project deals
with investigating the fault-tolerance properties of new classes of sorting networks
using simulation and theoretical analysis.
5. Hardware and/or High Speed Computer Arithmetic using the Residue
Number System
This topic requires good discrete math skills and basic knowledge of hardware
components. My papers # 3,11,14, 18, and 19 are related to this topic. The new
research project deals with designing new converters that are based on new moduli
and provides large dynamic range. Another possible topic is the implementation of
module operation of a large integer (or the exponentiation of an integer) represented
by a residue number system.
I have a new idea for developing new fast algorithms for one-way hashing functions.
The new research project deals with implementation and evaluation of new
algorithms.
This project includes surveying and evaluating different techniques for testing
embedded software systems. This project also includes evaluating several software
metrics for testing embedded systems.
This topic requires good discrete math skills and basic knowledge of hardware
components. In recent years, the ordered binary decision diagram (OBD) has became
very popular in representing very large Boolean functions. The project deals with
new methods for fault diagnoses and identification in Boolean functions represented
by OBD diagrams.
Extensive research has been published about optimization problem and rule-base
system of AI. However, a very limited research has been done on an optimization
problem subject to rule-based constrains. In this project methods for solving this
problem are investigated. As an application of the proposed problem, some selection
problems are formulated in terms of optimization problems subject to rule-based
constrains.
10. Period, Complexity, and Randomness Properties of Decimal and Binary
Sequences
My Paper #1 is related to this topic. The research deals with computing the period,
complexity and autocorrelation function of some composite sequences.