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. 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. 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. My publications # 2, , !", and 2# are related to the above three topics 2. Intelligent Interface for Database Systems This topic deal with different techni$ues for designing intelligent interfaces for database systems, which provides a paradigm for programming database without the knowledge of %&' and tables. (llman and )orth have formulated a theoretical model of such interfaces, which is called the universal relation. The research includes e*amining this model and building an intelligent interface based on this model. 3. Fault-Tolerant outing in Interconnection !et"or#s "ith Multiple Passes an$ Fi%e$ &ontrol 'ariables In my paper # +, I introduced a new mode of operation for multistage interconnection networks called dynamic access with fi*ed control values. The new mode provides fast and simple fault,tolerant routing in such networks. In my paper # -, I demonstrate the importance and feasibility of this new mode for two classes of networks. The new research pro.ect deals with investigating the new mode of operation for other classes of networks. (. Fault-Tolerance )nalysis of Sorting !et"or#s My papers # /, 0,+,!#, and !2 are related to this topic. The new research pro.ect deals with investigating the fault,tolerance properties of new classes of sorting networks using simulation and theoretical analysis.

*. +ar$"are an$,or +igh Spee$ &omputer )rithmetic using the esi$ue !umber System This topic re$uires good discrete math skills and basic knowledge of hardware components. My papers # ",!!,!/, !1, and ! are related to this topic. The new research pro.ect deals with designing new converters that are based on new moduli and provides large dynamic range. 2nother possible topic is the implementation of module operation of a large integer 3or the e*ponentiation of an integer4 represented by a residue number system. -. Implementation an$ ./aluation of Fast )lgorithms for 0ne-1ay +ashing Functions I have a new idea for developing new fast algorithms for one,way hashing functions. The new research pro.ect deals with implementation and evaluation of new algorithms. 2. Testing .mbe$$e$ Soft"are Systems This pro.ect includes surveying and evaluating different techni$ues for testing embedded software systems. This pro.ect also includes evaluating several software metrics for testing embedded systems. 3. Fault Diagnoses an$ I$entification in 4oolean Functions epresente$ by 0r$ere$ 4inary Decision Diagram This topic re$uires good discrete math skills and basic knowledge of hardware components. In recent years, the ordered binary decision diagram 35674 has became very popular in representing very large 6oolean functions. The pro.ect deals with new methods for fault diagnoses and identification in 6oolean functions represented by 567 diagrams. 5. 0ptimal Selection as an 0ptimi6ation Problem o/er ule-4ase$ &onstrains This topic re$uires good discrete math skills 8*tensive research has been published about optimi9ation problem and rule,base system of 2I. :owever, a very limited research has been done on an optimi9ation problem sub.ect to rule,based constrains. In this pro.ect methods for solving this problem are investigated. 2s an application of the proposed problem, some selection problems are formulated in terms of optimi9ation problems sub.ect to rule,based constrains.

17. Perio$8 &omple%ity8 an$ an$omness Properties of Decimal an$ 4inary Se9uences This topic re$uires good discrete math skills My ;aper #! is related to this topic. The research deals with computing the period, comple*ity and autocorrelation function of some composite se$uences.