Introduction
The objective of the software engineering research unit/group (SERG) in the college is to conduct research and projects in the contemporary topics of Information Technology. SERG works towards enhancing the research skills among the academic faculty and graduate students. The main areas of current research includes the automation of UML models, improving some selected algorithms and developing UML diagrams using Natural Language Processing tools.
Objectives of SERG
Facilitate research in the college, encourage scientific research among academic staff and students, enable staff and students mastering scientific research skills, facilitate publishing papers, Coordinate research efforts between the unit and other research units, the establishment of a scientific partnership with other domestic and international research centers.
Research Group
Research Assistants
- Sari Jabareen
- Ibrahim Nassar
Current research initiatives
Software engineering research group is conducting research:
- Automating UML models generation such as Use Case diagrams, Activity diagrams, and Sequence Diagrams, using Arabic Natural Language Processing tools.
- Improving various algorithms especially graph algorithms
Research themes
- Analysis of UML models
- Testing Applications
- Analysis of Arabic text used in UML models
- Improving algorithms especially graph algorithms
Funded Projects
Researches are currently working on a project funded by the Ministry of Higher Education/ Palestine. The project is about the improvements of shortest paths algorithms using some proposed and implemented heuristics“
Publications
[1] F. Khamayseh and N. Arman, “Comparing the Approaches of Graph Reduction and Landmark Shortest-Paths”, The International Arab Journal of Information Technology, JATIT & LLS, Jan, 2016. Vol. 83.
[2] N. Arman and F. Khamayseh, “A Comparison between Graph-Compression and Landmark Shortest-Path Approaches”. The 4th Palestinian International Conference on Computer and Information Technology (PICCIT 2015). Hebron, Palestine October 7-8, 2015.
[3] N. Arman and F. Khamayseh," A Path-Compression Approach for Improving Shortest-Path Algorithms”, International Journal of Electrical and Computer Engineering (IJECE), Vol.5, No.4, September 2015. http://www.iaesjournal.com/online/index.php/IJECE/article/view/7742. DOI:10.11591/ijece.v5i4.7742
[4] Jabbarin, S. and Arman, N, “Constructing Use Case Models from Arabic User Requirements in a Semi-Automated Approach," Proceedings of the International Conference on Requirements Engineering (ICRE’2014), January 17-19 Hammamet, Tunisia, 2014 (Indexed in IEEE Xplore).
[5] Arman, N. and Sari Jabbarin “Generating Use Case Models from Arabic User Requirements in a Semiautomated Approach Using a Natural Language Processing Tool," Journal of Intelligent Systems (JISYS), Vo1. 24, No. 2, pp. 277-286, 2015.
[6] F. Khamayseh and N. Arman."Improvement of Shortest-Path Algorithms Using Subgraphs' Heuristics", Journal of Theoretical and Applied Information Technology, JATIT & LLS, 2015. Vol. 76, No.1. http://www.jatit.org/volumes/Vol76No1/13Vol76No1.pdf
[7] Khamayseh F. and Nassar I. A Semi-Automated Generation of Activity Diagrams from Arabic User Requirements. NNGT Int. J. on Software Engineering (IJSE), Vol. 2, Feb 2015.
[8] Khamayseh F. and Nassar I. Constructing Activity Diagrams from Arabic User Requirements using Natural Language Processing Tool. The 6th International Conference on Information and Communication Systems. ICICS 2015, Amman, Jordan, April 7-9, 2015. Published in: IEEE Explore http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=7103200. DOI: 10.1109/IACS.2015.7103200.
[9] Khamayseh, Faisal. and Arman, Nabil. An Efficient Multiple Source Single Destination (MSSD) Heuristic Algorithm Using Nodes Exclusions. International Journal of Soft Computing, Vol. 10, No. 5, 2015. DOI: 10.3923/ijscomp.2015.301.306, URL: http://medwelljournals.com/abstract/?doi=ijscomp.2015.301.306, Full text PDF: http://docsdrive.com/pdfs/medwelljournals/ijscomp/2015/301-306.pdf
[10] Khamayseh, Faisal. and Arman Nabil. An Efficient Heuristic Shortest Path Algorithm Using Candidate Subgraphs. Proceedings of the International Conference on Intelligent Systems and Applications (ICISA'2014), March 22-24 Hammamet, Tunisia; 2014.
