<p>Potential Thesis Topics</p><p>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. </p><p> Implementation and evaluation of optimal and / or heuristic algorithms for generating optimal and near optimal classification trees. 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.</p><p> Implementation and evaluation of optimal and / or heuristic algorithms for generating clusters. 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.</p><p>My publications # 2,9, 13, and 20 are related to the above three topics</p><p>2. Intelligent Interface for Database Systems</p><p>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.</p><p>3. Fault-Tolerant Routing in Interconnection Networks with Multiple Passes and Fixed Control Variables</p><p>In my paper # 7, I introduced a new mode of operation for multistage interconnection networks called dynamic access with fixed control values. The new mode provides fast and simple fault-tolerant routing in such networks. In my paper # 5, I demonstrate the importance and feasibility of this new mode for two classes of networks. The new research project deals with investigating the new mode of operation for other classes of networks.</p><p>4. Fault-Tolerance Analysis of Sorting Networks</p><p>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</p><p>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.</p><p>6. Implementation and Evaluation of Fast Algorithms for One-Way Hashing Functions </p><p>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.</p><p>7. Testing Embedded Software Systems</p><p>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.</p><p>8. Fault Diagnoses and Identification in Boolean Functions Represented by Ordered Binary Decision Diagram</p><p>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.</p><p>9. Optimal Selection as an Optimization Problem over Rule-Based Constrains</p><p>This topic requires good discrete math skills</p><p>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</p><p>This topic requires good discrete math skills</p><p>My Paper #1 is related to this topic. The research deals with computing the period, complexity and autocorrelation function of some composite sequences.</p>