Rania Azad M. San Ahmed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rania Azad M. San Ahmed has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Rebwar Mala Nabi
Information Technology Department, Technical College of Informatics, Sulaimani Polytechnic University, Sulaimani, Iraq
3 shared publications - Sardasht M-Raouf Mahmood
Statistics and Computer Dept, University of Sulaimani
2 shared publications Beth Clausen
1 shared publication- Dana Lattef Hussein
IT Department, Computer Science Institute, Sulaimani Polytechnic University, Sulaymaniyah, Kurdistan Region, Iraq
1 shared publication Hamayoun Ghafoori
1 shared publication- Rebaz M. Nabi
Network Dept, Technical College of informatics, Sulaimani Polytechnic University , Kurdistan Technical Institute
1 shared publication
Latest Publications
- Open Access
- 29 August 2025
- Published by Elsevier in Data in Brief
- Vol. 62
KurdABSA: Kurdish aspect-based sentiment analysis dataset curation using few-shot learning
- 29 August 2025
- Published by Elsevier in Data in Brief
- Vol. 62
Open AccessKurdABSA: Kurdish aspect-based sentiment analysis dataset curation using few-shot learning
- Open Access
Improved AdaboostM1 for Stock Price Prediction Using Multi-layer Perceptron to Integrate Weak Learners
Investment in the stock market is currently very popular due to its economic gain. Therefore, numerous researchers and academicians work is focused on financial time series prediction due to its data availability and profitability. Based on the literature it can be seen that various versions of the AdaboostM1 algorithm have been applied in the stock market either by tuning the algorithm parameters or attempting various base learners but the accuracy has not yet reached to favorable and reliable level. Therefore, this study proposes an improved version of AdaboostM1(ADA), which is implemented in the Waikato Environment for Knowledge Analysis(WEKA) to predict stock market prices based on historical data. The improved AdaBoostM1 integrates the set of Multilayer Perceptron (MLP) predictors instead of using DecisionStumps, which is normally being applied. The enhanced AdaBoostM1 is named Adaboost with Multilayer Perceptron (ADA-MLP). As the result, the ADA-MLP was found to be outperforming the original ADA by 1.52%, in which the ADA-MLP achieved the CA of 100% on average while the ADA achieved 98.48%. Furthermore, the ADA-MLP was al
Open AccessImproved AdaboostM1 for Stock Price Prediction Using Multi-layer Perceptron to Integrate Weak Learners
Investment in the stock market is currently very popular due to its economic gain. Therefore, numerous researchers and academicians work is focused on financial time series prediction due to its data availability and profitability. Based on the literature it can be seen that various versions of the AdaboostM1 algorithm have been applied in the stock market either by tuning the algorithm parameters or attempting various base learners but the accuracy has not yet reached to favorable and reliable level. Therefore, this study proposes an improved version of AdaboostM1(ADA), which is implemented in the Waikato Environment for Knowledge Analysis(WEKA) to predict stock market prices based on historical data. The improved AdaBoostM1 integrates the set of Multilayer Perceptron (MLP) predictors instead of using DecisionStumps, which is normally being applied. The enhanced AdaBoostM1 is named Adaboost with Multilayer Perceptron (ADA-MLP). As the result, the ADA-MLP was found to be outperforming the original ADA by 1.52%, in which the ADA-MLP achieved the CA of 100% on average while the ADA achieved 98.48%. Furthermore, the ADA-MLP was al
- Open Access
- 1 January 2018
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 3 (1) , 27-33
The Impact of Teaching Materials on Learning Computer Programming Languages in Kurdistan Region Universities and Institutes
It is evident that learning and teaching computer programming are considered as one of the striking challenges in academic environments. Meanwhile, selecting the correct and appropriate materials can leave an enormous impact in learning computer programming languages. However, recently this argument has been put under scrutiny as to which types of materials motivate learners to learn computer programming languages as well as enhance learning outcomes. Therefore, the main objective of this study is to investigate the current teaching and learning materials of computer programming languages in Kurdistan region of Iraq universities. Additionally, another aim is to give a rigorous analysis of how materials help students to learn computer programming language. A further focus is to identify the difficulties of learning computer programming languages at undergraduate level which constitutes technical Diploma and Bachelor. The last but not the least, this paper examines new approaches to teaching programming languages as a cognitive model for programming education.
- 1 January 2018
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 3 (1) , 27-33
Open AccessThe Impact of Teaching Materials on Learning Computer Programming Languages in Kurdistan Region Universities and Institutes
It is evident that learning and teaching computer programming are considered as one of the striking challenges in academic environments. Meanwhile, selecting the correct and appropriate materials can leave an enormous impact in learning computer programming languages. However, recently this argument has been put under scrutiny as to which types of materials motivate learners to learn computer programming languages as well as enhance learning outcomes. Therefore, the main objective of this study is to investigate the current teaching and learning materials of computer programming languages in Kurdistan region of Iraq universities. Additionally, another aim is to give a rigorous analysis of how materials help students to learn computer programming language. A further focus is to identify the difficulties of learning computer programming languages at undergraduate level which constitutes technical Diploma and Bachelor. The last but not the least, this paper examines new approaches to teaching programming languages as a cognitive model for programming education.
- 1 January 2018
- Published by Project MUSE in portal: Libraries and the Academy
- Vol. 18 (2) , 243-249
Middle East Libraries in Focus
While I was the director of the campus library at Northwestern University in Qatar (NU-Q) in Doha, I fielded various questions about my experience. I tried answering questions with a tight "elevator speech," a summary of my experiences brief enough to deliver during a short elevator ride. About 20 seconds in, however, the listener's eyes would glaze over because I was not providing a hoped-for juicy or tantalizing answer. Instead, I often answered with something innocuous like "I like it" or lighthearted like "It is easy to travel to anywhere from there." Any brief answer was inadequate to describe fully the experience and how it transformed me professionally and personally.
- 1 January 2018
- Published by Project MUSE in portal: Libraries and the Academy
- Vol. 18 (2) , 243-249
Middle East Libraries in Focus
While I was the director of the campus library at Northwestern University in Qatar (NU-Q) in Doha, I fielded various questions about my experience. I tried answering questions with a tight "elevator speech," a summary of my experiences brief enough to deliver during a short elevator ride. About 20 seconds in, however, the listener's eyes would glaze over because I was not providing a hoped-for juicy or tantalizing answer. Instead, I often answered with something innocuous like "I like it" or lighthearted like "It is easy to travel to anywhere from there." Any brief answer was inadequate to describe fully the experience and how it transformed me professionally and personally.
- Open Access
- 27 August 2017
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 2 (3) , 25-31
Optimization Algorithm’s Problems: Comparison Study
Currently, in various fields and disciplines problem optimization are used commonly. In this concern, we have to define solutions which are two known concepts optimal or near optimal optimization problems in regards to some objects. Usually, it is surely difficult to sort problems out in only one step, but some processes can be followed by us which people usually call it problem solving. Frequently, the solution process is split into various steps which are accomplishing one after the other. Therefore, in this paper we consider some algorithms that help us to sort out problems, for exemplify, finding the shortest path, minimum spanning tree, maximum network flows and maximum matching. More importantly, the algorithm comparison will be presented. Additionally, the limitation of each algorithm. The last but not the least, the future research in this area will be approached.
- 27 August 2017
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 2 (3) , 25-31
Open AccessOptimization Algorithm’s Problems: Comparison Study
Currently, in various fields and disciplines problem optimization are used commonly. In this concern, we have to define solutions which are two known concepts optimal or near optimal optimization problems in regards to some objects. Usually, it is surely difficult to sort problems out in only one step, but some processes can be followed by us which people usually call it problem solving. Frequently, the solution process is split into various steps which are accomplishing one after the other. Therefore, in this paper we consider some algorithms that help us to sort out problems, for exemplify, finding the shortest path, minimum spanning tree, maximum network flows and maximum matching. More importantly, the algorithm comparison will be presented. Additionally, the limitation of each algorithm. The last but not the least, the future research in this area will be approached.
- Open Access
- 1 January 2016
- Published by The Science and Information Organization in International Journal of Advanced Computer Science and Applications
- Vol. 7 (1)
Modeling of Compensation in Long-Running Transactions
Nowadays, the most controversial issue is transaction in database systems or web services. Specifically, in the area of service-oriented computing, where business transactions always need long periods of time to finish. In the case of a failure rollback, which is the traditional method, it will not be enough and not suitable for handling errors during long running transactions. As a substitute, the most appropriate approach is compensation which is used as an error recovery mechanism. Therefore, transactions that need a long time to complete are programmed as a composition of a set of compensable transactions. This study attempts to design several compensation policies in the long running web transaction especially when the transaction has parallel threads. Meabwhile, one thread in sequence steps of the transaction may fail. This paper also describes and models many different ways to compensate to the thread. Moreover, this study proposes a system to implement creating long running transactions as well as simulating failures by using compensation policies.
- 1 January 2016
- Published by The Science and Information Organization in International Journal of Advanced Computer Science and Applications
- Vol. 7 (1)
Open AccessModeling of Compensation in Long-Running Transactions
Nowadays, the most controversial issue is transaction in database systems or web services. Specifically, in the area of service-oriented computing, where business transactions always need long periods of time to finish. In the case of a failure rollback, which is the traditional method, it will not be enough and not suitable for handling errors during long running transactions. As a substitute, the most appropriate approach is compensation which is used as an error recovery mechanism. Therefore, transactions that need a long time to complete are programmed as a composition of a set of compensable transactions. This study attempts to design several compensation policies in the long running web transaction especially when the transaction has parallel threads. Meabwhile, one thread in sequence steps of the transaction may fail. This paper also describes and models many different ways to compensate to the thread. Moreover, this study proposes a system to implement creating long running transactions as well as simulating failures by using compensation policies.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 519-525
State-of-the-Art in Handwritten Signature Verification System
Recently, handwritten signature verification (HSV) has become atremendously active area of research. Considerable results have been achieved in terms of accuracy and computation so far. Generally, biometrics can be divided into two types:Behavioral (signature verification, keystroke dynamics, etc.) and Physiological (iris characteristics, fingerprint, etc.). Signature verification is widely studied and discussed by using two approaches, on-line and offline approaches. Offline systems are more applicable and easy to use in comparison with on-line systems in many parts of the world. However, it is considered more difficult than on-line verification due to the lack of dynamic information. This paper presents State-of-Art about both types of HSV Systems. In this paper, we present recent methods used to capture data as well as different methods and techniques used in pre-processing steps. Additionally, current methods used for features extraction and approaches used for verification in signature systems are presented. Finally, we discuss approaches as well as techniques that have been used. In conclusion, we recommend encouraging ideas to be incorporated in the future.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 519-525
State-of-the-Art in Handwritten Signature Verification System
Recently, handwritten signature verification (HSV) has become atremendously active area of research. Considerable results have been achieved in terms of accuracy and computation so far. Generally, biometrics can be divided into two types:Behavioral (signature verification, keystroke dynamics, etc.) and Physiological (iris characteristics, fingerprint, etc.). Signature verification is widely studied and discussed by using two approaches, on-line and offline approaches. Offline systems are more applicable and easy to use in comparison with on-line systems in many parts of the world. However, it is considered more difficult than on-line verification due to the lack of dynamic information. This paper presents State-of-Art about both types of HSV Systems. In this paper, we present recent methods used to capture data as well as different methods and techniques used in pre-processing steps. Additionally, current methods used for features extraction and approaches used for verification in signature systems are presented. Finally, we discuss approaches as well as techniques that have been used. In conclusion, we recommend encouraging ideas to be incorporated in the future.