Pub Date : 2019-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2019.13.1.3
F. Saputra, Taufik Djatna, L. T. Handoko
Individual expert selection and ranking is a challenging research topic that has received a lot attention in recent years because of its importance related to referencing experts in particular domains and research fund allocation and management. In this work, scientific articles were used as the most common source for ranking expertise in particular domains. Previous studies only considered title and abstract content using language modeling. This study used the whole content of scientific documents obtained from Aminer citation data. The modified weighted language model (MWLM) is proposed that combines document length and number of citations as prior document probability to improve precision. Also, the author’s dominance in a single document is computed using the Learning-to-Rank (L2R) method. The evaluation results using p@n, MAP, MRR, r-prec, and bpref showed a precision enhancement. MWLM improved the weighted language model (WLM) by p@n (4%), MAP (22.5%), and bpref (1.7%). MWLM also improved the precision of a model that used author dominance by MAP (4.3%), r-prec (8.2%), and bpref (2.1%).
{"title":"Individual Expert Selection and Ranking of Scientific Articles Using Document Length","authors":"F. Saputra, Taufik Djatna, L. T. Handoko","doi":"10.5614/ITBJ.ICT.RES.APPL.2019.13.1.3","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2019.13.1.3","url":null,"abstract":"Individual expert selection and ranking is a challenging research topic that has received a lot attention in recent years because of its importance related to referencing experts in particular domains and research fund allocation and management. In this work, scientific articles were used as the most common source for ranking expertise in particular domains. Previous studies only considered title and abstract content using language modeling. This study used the whole content of scientific documents obtained from Aminer citation data. The modified weighted language model (MWLM) is proposed that combines document length and number of citations as prior document probability to improve precision. Also, the author’s dominance in a single document is computed using the Learning-to-Rank (L2R) method. The evaluation results using p@n, MAP, MRR, r-prec, and bpref showed a precision enhancement. MWLM improved the weighted language model (WLM) by p@n (4%), MAP (22.5%), and bpref (1.7%). MWLM also improved the precision of a model that used author dominance by MAP (4.3%), r-prec (8.2%), and bpref (2.1%).","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2019-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70736726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2019.13.1.1
H. Hendrawan
In this paper, an algorithm for predicting accessibility performance on an LTE/SAE network based on relevant historical key performance indicator (KPI) data is proposed. Since there are three KPIs related to accessibility, each representing different segments, a method to map these three KPI values onto the status of accessibility performance is proposed. The network conditions are categorized as high , acceptable or low for each time interval of observation. The first state shows that the system is running optimally, while the second state shows that the system has deteriorated and needs full attention, and the third state indicates that the system has gone into degraded conditions that cannot be tolerated. After the state sequence has been obtained, a transition probability matrix can be derived, which can be used to predict future conditions using a DTMC model. The results obtained are system predictions in terms of probability values for each state for a specific future time. These prediction values are required for proactive health monitoring and fault management. Accessibility degradation prediction is then conducted by using measurement data derived from an eNodeB in the LTE network for a period of one month.
{"title":"Accessibility Degradation Prediction on LTE/SAE Network Using Discrete Time Markov Chain (DTMC) Model","authors":"H. Hendrawan","doi":"10.5614/ITBJ.ICT.RES.APPL.2019.13.1.1","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2019.13.1.1","url":null,"abstract":"In this paper, an algorithm for predicting accessibility performance on an LTE/SAE network based on relevant historical key performance indicator (KPI) data is proposed. Since there are three KPIs related to accessibility, each representing different segments, a method to map these three KPI values onto the status of accessibility performance is proposed. The network conditions are categorized as high , acceptable or low for each time interval of observation. The first state shows that the system is running optimally, while the second state shows that the system has deteriorated and needs full attention, and the third state indicates that the system has gone into degraded conditions that cannot be tolerated. After the state sequence has been obtained, a transition probability matrix can be derived, which can be used to predict future conditions using a DTMC model. The results obtained are system predictions in terms of probability values for each state for a specific future time. These prediction values are required for proactive health monitoring and fault management. Accessibility degradation prediction is then conducted by using measurement data derived from an eNodeB in the LTE network for a period of one month.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2019-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43581378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2019.13.1.2
Lee Kong Weng, Sze San Nah
In many industries, manpower shift scheduling poses problems that require immediate solutions. The fundamental need in this domain is to ensure that all shifts are assigned to cover all or as many jobs as possible. The shifts should additionally be planned with minimum manpower utilization, minimum manpower idleness and enhanced adaptability of employee schedules. The approach used in this study was to utilize an existing manpower prediction method to decide the minimum manpower required to complete all jobs. Based on the minimum manpower number and shift criteria, the shifts were assigned to form schedules using random pick and criteria-based selection methods. The potential schedules were then optimized and the best ones selected. Based on several realistic test instances, the proposed heuristic approach appears to offer promising solutions for shift scheduling as it improves shift idle time, complies with better shift starting time and significantly reduces the manpower needed and the time spent on creating schedules, regardless of data size.
{"title":"Real-Life Optimum Shift Scheduling Design","authors":"Lee Kong Weng, Sze San Nah","doi":"10.5614/ITBJ.ICT.RES.APPL.2019.13.1.2","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2019.13.1.2","url":null,"abstract":"In many industries, manpower shift scheduling poses problems that require immediate solutions. The fundamental need in this domain is to ensure that all shifts are assigned to cover all or as many jobs as possible. The shifts should additionally be planned with minimum manpower utilization, minimum manpower idleness and enhanced adaptability of employee schedules. The approach used in this study was to utilize an existing manpower prediction method to decide the minimum manpower required to complete all jobs. Based on the minimum manpower number and shift criteria, the shifts were assigned to form schedules using random pick and criteria-based selection methods. The potential schedules were then optimized and the best ones selected. Based on several realistic test instances, the proposed heuristic approach appears to offer promising solutions for shift scheduling as it improves shift idle time, complies with better shift starting time and significantly reduces the manpower needed and the time spent on creating schedules, regardless of data size.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2019-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43516857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2019.13.1.6
K. Devi, R. Ganesan
Wireless sensor networks (WSNs) are placed in open environments for the collection of data and are vulnerable to external and internal attacks. The cryptographic mechanisms implemented so far, such as authorization and authentication, are used to restrict external sensor node attacks but cannot prevent internal node attacks. In order to evade internal attacks trust mechanisms are used. In trust mechanisms, firstly, the sensor nodes are monitored using the popular Watchdog mechanism. However, traditional trust models do not pay much attention to selective forwarding and consecutive packet dropping. Sometimes, sensitive data are dropped by internal attackers. This problem is addressed in our proposed model by detecting selective forwarding and consecutive failure of sending packets using the Beta probability density function model.
{"title":"Trust-based Selfish Node Detection Mechanism using Beta Distribution in Wireless Sensor Network","authors":"K. Devi, R. Ganesan","doi":"10.5614/ITBJ.ICT.RES.APPL.2019.13.1.6","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2019.13.1.6","url":null,"abstract":"Wireless sensor networks (WSNs) are placed in open environments for the collection of data and are vulnerable to external and internal attacks. The cryptographic mechanisms implemented so far, such as authorization and authentication, are used to restrict external sensor node attacks but cannot prevent internal node attacks. In order to evade internal attacks trust mechanisms are used. In trust mechanisms, firstly, the sensor nodes are monitored using the popular Watchdog mechanism. However, traditional trust models do not pay much attention to selective forwarding and consecutive packet dropping. Sometimes, sensitive data are dropped by internal attackers. This problem is addressed in our proposed model by detecting selective forwarding and consecutive failure of sending packets using the Beta probability density function model.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2019-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43386092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2019.13.1.4
A. Muradova
This paper shows the modeling of decision-making processes to ensure stable operation of multiservice communication networks (MCNs) using the mathematical apparatus of fuzzy logic models. A classification of the main factors affecting the stability of an MCN is given. The main factors affecting the structural stability of MCNs are external factors, internal factors, energy factors, and maintenance factors. A decision-making strategy (DM) was chosen. The main factors that affect the stability of the functioning of an MCN are characterized by heterogeneity. Therefore, the task of the DM to ensure stability of the functioning of the MCN was reduced to producing a sequential solution of the following interrelated tasks: identification of the MCN by a systematic analysis of the main factors affecting the stability of the MCN, ranking the states of the MCN, and definition of the decision-making criteria. The first point is implemented by setting up a complex model of the MCN based on integration of the principles of fuzzy set theory (FST). A promising method for choosing a rational alternative is the method of non-dominated alternatives (MNDA), based on the aggregation of fuzzy information to characterize the relationship between the alternatives according to certain criteria.
{"title":"Modeling of Decision-making Processes to Ensure Sustainable Operation of Multiservice Communication Network","authors":"A. Muradova","doi":"10.5614/ITBJ.ICT.RES.APPL.2019.13.1.4","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2019.13.1.4","url":null,"abstract":"This paper shows the modeling of decision-making processes to ensure stable operation of multiservice communication networks (MCNs) using the mathematical apparatus of fuzzy logic models. A classification of the main factors affecting the stability of an MCN is given. The main factors affecting the structural stability of MCNs are external factors, internal factors, energy factors, and maintenance factors. A decision-making strategy (DM) was chosen. The main factors that affect the stability of the functioning of an MCN are characterized by heterogeneity. Therefore, the task of the DM to ensure stability of the functioning of the MCN was reduced to producing a sequential solution of the following interrelated tasks: identification of the MCN by a systematic analysis of the main factors affecting the stability of the MCN, ranking the states of the MCN, and definition of the decision-making criteria. The first point is implemented by setting up a complex model of the MCN based on integration of the principles of fuzzy set theory (FST). A promising method for choosing a rational alternative is the method of non-dominated alternatives (MNDA), based on the aggregation of fuzzy information to characterize the relationship between the alternatives according to certain criteria.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2019-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48319689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-31DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.3.6
Jirawan Charoensuk, O. Sornil
Emotion classification is an interesting problem in affective computing that can be applied in various tasks, such as speech synthesis, image processing and text processing. With the increasing amount of textual data on the Internet, especially reviews of customers that express opinions and emotions about products. These reviews are important feedback for companies. Emotion classification aims to identify an emotion label for each review. This research investigated three approaches for emotion classification of opinions in the Thai language, written in unstructured format, free form or informal style. Different sets of features were studied in detail and analyzed. The experimental results showed that a hierarchical approach, where the subjectivity of the review is determined first, then the polarity of opinion is identified and finally the emotional label is calculated, yielded the highest performance, with precision, recall and F-measure at 0.691, 0.743 and 0.709, respectively.
{"title":"A Hierarchical Emotion Classification Technique for Thai Reviews","authors":"Jirawan Charoensuk, O. Sornil","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.3.6","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.3.6","url":null,"abstract":"Emotion classification is an interesting problem in affective computing that can be applied in various tasks, such as speech synthesis, image processing and text processing. With the increasing amount of textual data on the Internet, especially reviews of customers that express opinions and emotions about products. These reviews are important feedback for companies. Emotion classification aims to identify an emotion label for each review. This research investigated three approaches for emotion classification of opinions in the Thai language, written in unstructured format, free form or informal style. Different sets of features were studied in detail and analyzed. The experimental results showed that a hierarchical approach, where the subjectivity of the review is determined first, then the polarity of opinion is identified and finally the emotional label is calculated, yielded the highest performance, with precision, recall and F-measure at 0.691, 0.743 and 0.709, respectively.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42984024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-31DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.3.2
A. Al-Shaikh, Hebatallah Khattab, S. Al-Sharaeh
Wireless Sensor Networks (WSNs) draw the attention of researchers due to the diversity of applications that use them. Basically, a WSN comprises many sensor nodes that are supplied with power by means of a small battery installed in the node itself; the node can also be self-charged by a solar cell. Sometimes it is impossible to change the power supply of battery-operated nodes. This dictates that sensor nodes must utilize the energy they have in an optimal manner. Data communication is the main cause of energy dissipation. In this context, designing protocols for WSNs demands more attention to the design of energy-efficient routing protocols that allow communications between sensor nodes and their base station (BS) with the least cost. LEACH is a prominent hierarchical cluster-based routing protocol. It groups sensor nodes into clusters to reduce energy dissipation. On the other hand, LEACH-C is a protocol based on LEACH that claims to improve energy dissipation over LEACH. In this paper, a successful attempt was made to compare these two protocols using MATLAB. The results show that LEACH-C has better performance than LEACH in terms of power dissipation.
{"title":"Performance Comparison of LEACH and LEACH-C Protocols in Wireless Sensor Networks","authors":"A. Al-Shaikh, Hebatallah Khattab, S. Al-Sharaeh","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.3.2","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.3.2","url":null,"abstract":"Wireless Sensor Networks (WSNs) draw the attention of researchers due to the diversity of applications that use them. Basically, a WSN comprises many sensor nodes that are supplied with power by means of a small battery installed in the node itself; the node can also be self-charged by a solar cell. Sometimes it is impossible to change the power supply of battery-operated nodes. This dictates that sensor nodes must utilize the energy they have in an optimal manner. Data communication is the main cause of energy dissipation. In this context, designing protocols for WSNs demands more attention to the design of energy-efficient routing protocols that allow communications between sensor nodes and their base station (BS) with the least cost. LEACH is a prominent hierarchical cluster-based routing protocol. It groups sensor nodes into clusters to reduce energy dissipation. On the other hand, LEACH-C is a protocol based on LEACH that claims to improve energy dissipation over LEACH. In this paper, a successful attempt was made to compare these two protocols using MATLAB. The results show that LEACH-C has better performance than LEACH in terms of power dissipation.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44527125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-31DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.3.5
J. T. Tarigan, E. M. Zamzami, C. L. Ginting
The Java programming language provides binary floating-point primitive data types such as float and double to represent decimal numbers. However, these data types cannot represent decimal numbers with complete accuracy, which may cause precision errors while performing calculations. To achieve better precision, Java provides the BigDecimal class. Unlike float and double, which use approximation, this class is able to represent the exact value of a decimal number. However, it comes with a drawback: BigDecimal is treated as an object and requires additional CPU and memory usage to operate with. In this paper, statistical data are presented of performance impact on using BigDecimal compared to the double data type. As test cases, common mathematical processes were used, such as calculating mean value, sorting, and multiplying matrices.
{"title":"Performance Analysis of BigDecimal Arithmetic Operation in Java","authors":"J. T. Tarigan, E. M. Zamzami, C. L. Ginting","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.3.5","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.3.5","url":null,"abstract":"The Java programming language provides binary floating-point primitive data types such as float and double to represent decimal numbers. However, these data types cannot represent decimal numbers with complete accuracy, which may cause precision errors while performing calculations. To achieve better precision, Java provides the BigDecimal class. Unlike float and double, which use approximation, this class is able to represent the exact value of a decimal number. However, it comes with a drawback: BigDecimal is treated as an object and requires additional CPU and memory usage to operate with. In this paper, statistical data are presented of performance impact on using BigDecimal compared to the double data type. As test cases, common mathematical processes were used, such as calculating mean value, sorting, and multiplying matrices.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42366488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-31DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.3.1
E. Jose, S. Veni
Parking information systems have become very important, especially in metropolitan areas as they help to save time, effort and fuel when searching for parking. This paper offers a novel low-cost deep learning approach to easily implement vacancy detection at outdoor parking spaces with CCTV surveillance. The proposed method also addresses issues due to perspective distortion in CCTV images. The architecture consists of three classifiers for checking the availability of parking spaces. They were developed on the TensorFlow platform by re-training MobileNet (a pre-trained Convolutional Neural Network (CNN)) model using the transfer learning technique. A performance analysis showed 88% accuracy for vacancy detection. An end-to-end application model with Internet of Things (IoT) and an Android application is also presented. Users can interact with the cloud using their Android application to get real-time updates on parking space availability and the parking location. In the future, an autonomous car could use this system as a V2I (Vehicle to Infrastructure) application in deciding the nearest parking space.
{"title":"Vacant Parking Lot Information System Using Transfer Learning and IoT","authors":"E. Jose, S. Veni","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.3.1","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.3.1","url":null,"abstract":"Parking information systems have become very important, especially in metropolitan areas as they help to save time, effort and fuel when searching for parking. This paper offers a novel low-cost deep learning approach to easily implement vacancy detection at outdoor parking spaces with CCTV surveillance. The proposed method also addresses issues due to perspective distortion in CCTV images. The architecture consists of three classifiers for checking the availability of parking spaces. They were developed on the TensorFlow platform by re-training MobileNet (a pre-trained Convolutional Neural Network (CNN)) model using the transfer learning technique. A performance analysis showed 88% accuracy for vacancy detection. An end-to-end application model with Internet of Things (IoT) and an Android application is also presented. Users can interact with the cloud using their Android application to get real-time updates on parking space availability and the parking location. In the future, an autonomous car could use this system as a V2I (Vehicle to Infrastructure) application in deciding the nearest parking space.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41370223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-31DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.3.3
F. A. Yulianto, K. Kuspriyanto, Teguh Nurhadi Suharsono
A computing strategy called Double Track–Most Significant Operation First (DT-MSOF) is proposed. The goal of this strategy is to reduce computation time by reducing the number of operations that need to be executed, while maintaining a correct final result. Executions are conducted on a sequence of computing operations that have previously been sorted based on significance. Computation will only run until the result meets the needs of the user. In this study, the DT-MSOF strategy was used to modify the Analytic Hierarchy Process (AHP) algorithm into MD-AHP in order to reduce the number of operations that need to be done. The conventional AHP uses a run-to-completion approach, in which decisions can only be obtained after all of the operations have been completed. On the other hand, the calculations in MD-AHP are carried out iteratively only until the conditions are reached where a decision can be made. The simulation results show that MD-AHP can reduce the number of operations that need to be done to obtain the same results (decisions) as obtained by conventional AHP. It was also found that the more uneven the distribution of priority values, the more the number of operations could be reduced.
{"title":"DT-MSOF Strategy and its Application to Reduce the Number of Operations in AHP","authors":"F. A. Yulianto, K. Kuspriyanto, Teguh Nurhadi Suharsono","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.3.3","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.3.3","url":null,"abstract":"A computing strategy called Double Track–Most Significant Operation First (DT-MSOF) is proposed. The goal of this strategy is to reduce computation time by reducing the number of operations that need to be executed, while maintaining a correct final result. Executions are conducted on a sequence of computing operations that have previously been sorted based on significance. Computation will only run until the result meets the needs of the user. In this study, the DT-MSOF strategy was used to modify the Analytic Hierarchy Process (AHP) algorithm into MD-AHP in order to reduce the number of operations that need to be done. The conventional AHP uses a run-to-completion approach, in which decisions can only be obtained after all of the operations have been completed. On the other hand, the calculations in MD-AHP are carried out iteratively only until the conditions are reached where a decision can be made. The simulation results show that MD-AHP can reduce the number of operations that need to be done to obtain the same results (decisions) as obtained by conventional AHP. It was also found that the more uneven the distribution of priority values, the more the number of operations could be reduced.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49310055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：