Effective storage of source code of the student’s projects in digital libraries

  • Authors

    • Rexline S.J
    • Albert William M
    2018-09-22
    https://doi.org/10.14419/ijet.v7i4.5.21162
  • Compression Ratio, Image Compression, Source Code, Text Compression, Text Transformation.

  • Abstract

    In higher educational institutions, the source code of the student's projects and their documentations should be submitted in both printed and electronic form. The electronic form of storage smooth the progress of computerized processing of the documents for purposes such as plagiarism detection and for future references. Considering the higher education system, there are several hundred theses added to the archive every year. The primary motivation for this paper was to reduce the storage requirements of the student's projects and their doc- mentation’s electronic archive in higher education institutions.

     

     

  • References

    1. [1] F. Awan and A. Mukherjee, “LIPT: A Lossless Text Transform to Improve Compression,†Proceedings of International Conference on Information and Theory:Coding and Computing, IEEE Comput- er Society, pp. 452-460, April 2001.

      [2] Abel,J, Teahan,W, “Universal Text Preprocessing for Data Com- pressionâ€,IEEE Trans.Computers,54(5)pp :497-507,2005.

      [3] M. Burrows and D.J. Wheeler, “A Block-Sorting Lossless Data Compression Algorithmâ€, SRC Research Report 124, Digital Sys- tems Research Center, Palo Alto, CA, 1994.

      [4] Chapin B, Tate SR.â€Higher Compression from the Burrows– Wheeler Transform by Modified Sortingâ€, In Storer JA, Cohn M, editors, Proceedings of the 1998 IEEE Data Compression Confer- ence, IEEE Computer Society Press, Los Alamitos, Califor- nia,pp.532,1998.

      [5] R. Franceschini, H. Kruse, N. Zhang, R. Iqbal, and A. Mukherjee, “Lossless, Reversible Transformations that Improve Text Compres- sion Ratio,†Project paper, University of Central Florida, USA. 2000.

      [6] V.K. Govindan, B.S. Shajee mohan, “IDBE – An Intelligent Dic- tionary Based Encoding Algorithm for Text Data Compression for High Speed Data Transmission Over Internetâ€, Proceeding of the International Conference on Intelligent Signal Processing and Ro- botics IIIT Allahabad February 2004.

      [7] Huffman, D.A.,†A method for the construction of minimum- redundancy codesâ€. Proc. Inst. Radio Eng., 40: pp: 1098- 1101.1952.

      [8] H. Kruse and A. Mukherjee, “Preprocessing Text to Improve Com- pression Ratiosâ€, Proceedings of Data Compression Conference, IEEE Computer Society, Snowbird Utah, pp. 556, 1998.

      [9] Paula Aguilera, “Comparison of different image compression for- matsâ€, Project Report.

      [10] Robert Franceschini, Amar Mukherjee, “ Data Compression Using Encrypted Text “,proceedings of the third forum on Research and Technology, Advances on Digital Libraries,ADL 96,pp .130-138, May 1996.

      [11] P. SkibiÅ„ski, Sz. Grabowski and S. Deorowicz. “Revisiting dic- tionary-based compressionâ€. Software–Practice and Experience, pp.1455-1476, 2005.

      [12] P. SkibiÅ„ski, “Improving HTML Compressionâ€, Informatica 33 (2009) 363–373, 2009.

      [13] Sun W, Mukherjee A, Zhang N. “A Dictionary-based Multi- Corpora Text Compression Systemâ€. In Storer JA, Cohn M, edi- tors, Proceedings of the 2003 IEEE Data Compression Conference, IEEE Computer Society Press, Los Alamitos, California, pp .448 2003.

      [14] Witten, I.H., R.M. Neal and J.G. Cleary, “Arithmetic coding for data compressionâ€,Commun.ACM, 30: pp : 520-540.,1987.

      [15] Md. Ziaul Karim Zia, Dewan Md. Fayzur Rahman, and Chowdhury Mofizur Rahman, “Two-Level Dictionary-Based Text Compression Schemeâ€, Proceedings of 11th International Conference on Com- puter and Information Technology, Khulna, Bangladesh.,pp.25-27 December, 2008.

  • Downloads

  • How to Cite

    S.J, R., & William M, A. (2018). Effective storage of source code of the student’s projects in digital libraries. International Journal of Engineering & Technology, 7(4.5), 583-586. https://doi.org/10.14419/ijet.v7i4.5.21162

    Received date: 2018-10-07

    Accepted date: 2018-10-07

    Published date: 2018-09-22