iosr-JCE   Volume-11 ~ Issue-6

Abstract: This paper presents a fault prediction model using reliability relevant software metrics and fuzzy inference system. For this a new approach is discussed to develop fuzzy profile of software metrics which are more relevant for software fault prediction. The proposed model predicts the fault density at the end of each phase of software development using relevant software metrics. On the basis of fault density at the end of testing phase, total number of faults in the software is predicted. The model seems to useful for both software engineer as well as project manager to optimally allocate resources and achieve more reliable software within the time and cost constraints. To validate the prediction accuracy, the model results are validated using PROMISE Software Engineering Repository Data set.

Keywords: Reliability Relevant Software Metrics, Software Fault Prediction, Fault Density, Fuzzy profile, Fuzzy Inference System (FIS)

[1] ANSI/IEEE Standard Glossary of Software Engineering Terminology, IEEE STD-729, 1991.

[2] J. D. Musa, A. Iannino, K. Okumoto, Software Reliability: Measurement, Prediction, Application, McGraw-Hill Publishers, New York, 1987.

[3] C. Kaner, Software Engineering Metrics: What Do They Measure and How Do We Know, 10th International Software Metrics Symposium 2004.

[4] J. E. Gaffney, C. F. Davis, An Approach to Estimating Software Errors and Availability, Proceedings of 11th Minnow brook Workshop on Software Reliability 1988.

[5] J. E. Gaffney, J. Pietrolewiez, An Automated Model for Software Early Error Prediction(SWEEP), Proceedings of 13th Minnow brook Workshop on Software Reliability1990.

[6] Technical Report, Report Methodology for Software Reliability Prediction and Assessment, Rome Laboratory (RL) RL-TR-92-52, vol. 1 & 2, 1992

[7] W. W. Agresti, W. M. Evanco, Projecting Software Defects form Analyzing Ada Design, IEEE Transaction on Software Engineering, vol. 18, no. 11, pp. 988-997, 1992.

[8] T. J. Yu, V. Y. Shen, H. E. Dunsmore, (1988), An Analysis of Several Software Defect Models, IEEE Transaction on Software Engineering, vol. 14, no. 9, pp. 261-270, 1988.

[9] T. M. Khoshgoftaar, J. C. Munson, Predicting Software Development Errors Using Complexity Metrics, IEEE Journal on Selected Areas in Communication, vol. 8, no. 2, pp. 253-261, 1990.

[10] X. Zhang, H. Pham, An Analysis of Factors Affecting Software Reliability, The Journal of Systems and Software, vol. 50, no. 1, pp. 43-56, 2000.

Abstract: Data Compression is the technique through which, we can reduce the quantity of data, used to represent content without excessively reducing the quality of the content. This paper examines the performance of a set of lossless data compression algorithm, on different form of text data. A set of selected algorithms are implemented to evaluate the performance in compressing text data. A set of defined text file are used as test bed. The performance of different algorithms are measured on the basis of different parameter and tabulated in this article. The article is concluded by a comparison of these algorithms from different aspects.

Keywords - Encryption, Entropy Encoding, Dictionary Encoding, Compression Ratio, Compression time, Test Bed.

[1] Pu, I.M., 2006, Fundamental Data Compression, Elsevier, Britain.

[2] Kaufman, K. and T. Shmuel, 2005. Semi-lossless text compression, Intl. J. Foundations of Computer Sci., 16: 1167-1178.

[3] Kesheng, W., J. Otoo and S. Arie, 2006. Optimizing bitmap indices with efficient compression, ACM Trans. Database Systems, 31: 1-38.

[4] Introduction to Data Compression, Khalid Sayood, Ed Fox(Editor), March 2000

[5] Shannon, C.E. (July 1948). "A Mathematical Theory of Communication". Bell System Technical Journal 27: 379–423.

[6] Fano, R.M. (1949). "The transmission of information". Technical Report No. 65 (Cambridge (Mass.), USA: Research Laboratory of Electronics at MIT).

[7] Terry Welch, "A Technique for High-Performance Data Compression", IEEE Computer, June 1984, p. 8–19.

[8] Jacob Ziv and Abraham Lempel; Compression of Individual Sequences Via Variable-Rate Coding, IEEE Transactions on Information Theory, September 1978.

[9] Improved wordaligned binary compression for text indexing, Vo Ngoc and M. Alistair, 2006. IEEE Trans. Knowledge & Data Engineering, 18: 857-861.

[10] Data compression using dynamic Markov modeling, Cormak, V. and S. Horspool, 1987. Comput. J., 30: 541–550.

Abstract: Due to the huge development of computer science which was escorted by another vast development in the hiding techniques, which became of great possibilitiesin which it is difficult to break those techniques.Those techniques were classified depending on the method of embedding like inserting, replacing or exchange positions.

[1]. Refrence: book: ―DATA HIDING FUNDAMENTALS AND APPLICATRIONS‖ AUG-2004,HusrwSencar,
[2]. chin-Chen Chang, ― International Journal of Pattern Recognition and Artifitial Intelligence‖, Volume 16, Issue 04, June 2002.
[3]. ab Grady Booch,‖ Object-Oriented Analysis and Design with Applications‖, . Addison-Wesley, 2007, ISBN 0-201-89551-X, p. 51-52.
[4]. http://en,Wikipedia.org/wiki/Information_hiding.
[5]. Pahati, OJ (2001-11-29). "Confounding Carnivore: How to Protect Your Online Privacy". AlterNet.Archived from the original on 2007-07-16.http://web.archive.org/web/20070716093719/http://www.alternet.org/story/11986/. Retrieved 2008-09-02.
[6]. Chvarkova, Iryna; Tsikhanenka, Siarhei; Sadau, Vasili (15 February 2008). "Steganographic Data Embedding Security Schemes Classification".Steganography: Digital Data Embedding Techniques. Intelligent Systems Scientific Community, Belarus.http://scientist.by/index.php?option=com_content&view=article&id=37%3Asteganography-digital-data-embedding-techniques&catid=9&Itemid=27&limitstart=5. Retrieved 25 March 2011.
[7]. Joshua R. Smith and Barrett O. Comisky, ―Modulation and Information Hiding in Images‖, Cambridge, USA May 2009.