1993 Publications

For further information, contact Prof. Taghi M. Khoshgoftaar, Dept. of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33432, phone: (561)297-3994, fax: (561)297-2800, email: taghi@cse.fau.edu.

[1]K. Ganesan. One-way functions and the isomorphism conjecture. In Rudrapatna Shyamasundar, editor, Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 152--163. Springer-Verlag, December 1992.

[2]K. Ganesan, Stanley E. Dunn, C. Vasudevan, and G. J. S. Rae. Annotated maps for autonomous underwater vehicles. In Proceedings of the Eighteenth Meeting of the US/Japan Marine Facilities Panel of UJNR, Washington, DC USA, October 1992.

[3]K. Ganesan and Steven Homer. Complete problems and strong polynomial reducibilities. In B. Monien and R. Cori, editors, Proceedings of the Sixth Annual Symposium on Theoretical Aspects of Computer Science, volume 349 of Lecture Notes in Computer Science, pages 240--250. Springer-Verlag, February 1989.

[4]K. Ganesan and Steven Homer. Complete problems and strong polynomial reducibilities. SIAM Journal on Computing, 21(4):733--742, August 1992.

[5]Rattikorn Hewett and K. Ganesan. Consistent linear speedup in parallel alpha-beta search. In Proceedings of the Fourth International Conference on Computing and Information, pages 237--240, Toronto, ON Canada, May 1992. IEEE Computer Society.

[6]Khoa D. Huynh, Taghi M. Khoshgoftaar, and G. Marazas. A high-level performance analysis of the IBM subsystem control block (SCB) architecture. Microprocessing and Microprogramming: Euromicro Journal, 36:109--125, 1993.

[7]Prashanth Jade. High level communication for distributed processing in AUVs. Master's thesis, Florida Atlantic University, Boca Raton, FL, April 1992. Advised by K. Ganesan.

[8]Prashanth Jade and K. Ganesan. High level communication for distributed processing in autonomous underwater vehicles. In Proceedings of the Summer Computer Simulation Conference, pages 750--755, Baltimore, MD USA, July 1991.

[9]Taghi M. Khoshgoftaar, Bibhuti B. Bhattacharyya, and Gary D. Richardson. Predicting software errors during development using nonlinear regression models: A comparative study. IEEE Transactions on Reliability, 41(3):390--395, September 1992.

[10]Taghi M. Khoshgoftaar, David L. Lanning, and Abhijit S. Pandya. A neural network modeling methodology for detection of high-risk programs. In Proceedings of the Fourth International Symposium on Software Reliability Engineering, pages 302--309, Denver, CO, November 1993. IEEE Computer Society.

[11]Taghi M. Khoshgoftaar and John C. Munson. The use of a relative complexity metric to compare software designs: An empirical investigation. In Proceedings of the ISMM International Conference on Intelligent Distributed Processing, pages 69--72, Fort Lauderdale, FL, 1989.

[12]Taghi M. Khoshgoftaar and John C. Munson. Predicting software development errors using software complexity metrics. IEEE Journal on Selected Areas in Communications, 8(2):253--261, February 1990.

[13]Taghi M. Khoshgoftaar and John C. Munson. Applications of a relative complexity metric for predicting source code complexity at the design phase. In Proceedings of the Second Software Engineering Research Forum, pages 191--198, Melbourne, FL, November 1992.

[14]Taghi M. Khoshgoftaar and John C. Munson. Applications of a relative complexity metric for predicting source code complexity at the design phase. In Proceedings of the Annual Oregon Workshop on Software Metrics, Silver Falls, Oregon, March 1992. Oregon Center for Advanced Technology Education, Portland State University.

[15]Taghi M. Khoshgoftaar and John C. Munson. A measure of software system complexity and its relationship to faults. In Proceedings of the 1992 International Simulation Technology Conference and 1992 Workshop on Neural Networks, pages 267--272, Clear Lake, TX, November 1992. Society for Computer Simulation. Also known as SimTec '92 and WNN '92.

[16]Taghi M. Khoshgoftaar, John C. Munson, Bibhuti B. Bhattacharya, and Gary D. Richardson. Predictive modeling techniques of software quality from software measures. IEEE Transactions on Software Engineering, 18(11):979--987, November 1992.

[17]Taghi M. Khoshgoftaar, John C. Munson, and David L. Lanning. Alternative approaches for the use of metrics to order programs by complexity. In Proceedings of the Annual Oregon Workshop on Software Metrics, Silver Falls, Oregon, March 1993. Oregon Center for Advanced Technology Education, Portland State University.

[18]Taghi M. Khoshgoftaar, John C. Munson, and David L. Lanning. A comparative study of predictive models for program changes during system testing. In Proceedings of the International Conference on Software Maintenance, pages 72--79, Montreal, Quebec, Canada, September 1993. IEEE Computer Society.

[19]Taghi M. Khoshgoftaar, John C. Munson, and David L. Lanning. Dynamic system complexity. In Proceedings of First International Software Metrics Symposium, pages 129--140, Baltimore, MD, May 1993. IEEE Computer Society.

[20]Taghi M. Khoshgoftaar, John C. Munson, and David L. Lanning. An empirical analysis of software system environments. In Proceedings of the Software Engineering Research Forum, pages 147--156, Orlando, FL, November 1993.

[21]Taghi M. Khoshgoftaar, John C. Munson, and S. Ravichandran. Comparative aspects of software complexity metrics and program modules -- A multidimensional scaling approach. Software Quality Journal, 1(3):159--173, September 1992.

[22]Taghi M. Khoshgoftaar, Abhijit S. Pandya, and Hemant B. More. A neural network approach for predicting software development faults. In Proceedings of the Third International Symposium on Software Reliability Engineering, pages 83--89, Research Triangle Park, North Carolina, October 1992. IEEE Computer Society.

[23]Taghi M. Khoshgoftaar, Robert M. Szabo, and Anne de Gramont. An empirical study of program modification history during testing and maintenance. In Proceedings of the Third Software Engineering Research Forum, pages 83--92, Orlando, FL, November 1993.

[24]Taghi M. Khoshgoftaar and Timothy G. Woodcock. Software reliability model selection. Quality and Reliability Engineering International, 8(5):457--469, September 1992.

[25]K. B. Lakshmanan, B. Ravikumar, and K. Ganesan. Coping with erroneous information while sorting. IEEE Transactions on Computers, 40(9):1081--1084, September 1991.

[26]Anil Mandalia, R. Sudhakar, K. Ganesan, and Fumio Hamano. Low-level and high-level correlation for image registration. In Proceedings of the International Conference on Systems, Man, and Cybernetics, pages 206--209, Los Angeles, CA USA, November 1990. IEEE Systems, Man and Cybernetics Society.

[27]John C. Munson and Taghi M. Khoshgoftaar. The dimensionality of program complexity. In Proceedings of the Eleventh International Conference on Software Engineering, pages 245--253, Pittsburgh, PA, May 1989. IEEE Computer Society.

[28]John C. Munson and Taghi M. Khoshgoftaar. Applications of a relative complexity metric for software project management. Journal of Systems and Software, 12(3):283--291, July 1990.

[29]John C. Munson and Taghi M. Khoshgoftaar. Regression modelling of software quality: Empirical investigation. Journal of Information and Software Technology, 32(2):106--114, March 1990.

[30]John C. Munson and Taghi M. Khoshgoftaar. The relative software complexity metric: A validation study. In Proceedings of Software Engineering 90, pages 89--102, Brighton, England, July 1990.

[31]John C. Munson and Taghi M. Khoshgoftaar. Some primitive control flow metrics. In Proceedings of the Annual Oregon Workshop on Software Metrics, Silver Falls, OR, March 1991. Oregon Center for Advanced Technology Education, Portland State University.

[32]John C. Munson and Taghi M. Khoshgoftaar. The use of software complexity metrics in software reliability modeling. In Proceedings of the International Symposium on Software Reliability Engineering, pages 2--11, Austin, TX, May 1991. IEEE Computer Society.

[33]John C. Munson and Taghi M. Khoshgoftaar. The detection of fault-prone programs. IEEE Transactions on Software Engineering, 18(5):423--433, May 1992.

[34]John C. Munson and Taghi M. Khoshgoftaar. Measuring dynamic program complexity. IEEE Software, 9(6):48--55, November 1992.

[35]John C. Munson and Taghi M. Khoshgoftaar. Canonical complexity measures. In Proceedings of the Annual Oregon Workshop on Software Metrics, Silver Falls, OR, March 1993. Oregon Center for Advanced Technology Education, Portland State University.

[36]John C. Munson and Taghi M. Khoshgoftaar. Measurement of data structure complexity. Journal of Systems and Software, 20(2):217--225, March 1993.

[37]Bala Ravikumar, K. Ganesan, and K. B. Lakshmanan. On selecting the largest element in spite of erroneous information. In Proceedings of the Fourth Annual Symposium on Theoretical Aspects of Computer Science, volume 247 of Lecture Notes in Computer Science, pages 88--99, Passau, Germany, February 1987. Springer-Verlag.