Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777776
Abolfazl Jalilvand, A. Kimiyaghalam, A. Ashouri, M. Mahdavi
PID parameter optimization is an important problem in control field. Particle swarm optimization (PSO) is powerful stochastic evolutionary algorithm that is used to find the global optimum solution in search space. However, it has been observed that the standard PSO algorithm has premature and local convergence phenomenon when solving complex optimization problem. To resolve this problem an advanced particle swarm optimization (APSO) is proposed in this paper. This new algorithm is proposed to augment the original PSO searching speed. This study proposes to use the (APSO) for its fast searching speed. These advanced particle swarm optimization to accelerate the convergence. The algorithms are simulated with MATLAB programming. The simulation result shows that the PID controller with (APSO) has a fast convergence rate and a better dynamic performance.
{"title":"Advanced particle swarm optimization-based PID controller parameters tuning","authors":"Abolfazl Jalilvand, A. Kimiyaghalam, A. Ashouri, M. Mahdavi","doi":"10.1109/INMIC.2008.4777776","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777776","url":null,"abstract":"PID parameter optimization is an important problem in control field. Particle swarm optimization (PSO) is powerful stochastic evolutionary algorithm that is used to find the global optimum solution in search space. However, it has been observed that the standard PSO algorithm has premature and local convergence phenomenon when solving complex optimization problem. To resolve this problem an advanced particle swarm optimization (APSO) is proposed in this paper. This new algorithm is proposed to augment the original PSO searching speed. This study proposes to use the (APSO) for its fast searching speed. These advanced particle swarm optimization to accelerate the convergence. The algorithms are simulated with MATLAB programming. The simulation result shows that the PID controller with (APSO) has a fast convergence rate and a better dynamic performance.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122108656","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777723
A. Jalal-Karim, W. Balachandran
Several nations around the world are utilizing diverse methods to integrate and communicate patient information created and stored at various healthcare locations. Consequently, excellent lessons can be discovered from each other, even with the variations in some issues such as politics, geographies, population density. Recently, various nations have introduced strategies for national electronic health record (EHR) systems. This paper discusses the development of national healthcare strategies among three selected countries: Canada, Australia and England, concentrating on the electronic health record (EHR) as the main component of the healthcare infrastructure.
{"title":"The national strategies for Electronic Health Record in three developed countries: General status","authors":"A. Jalal-Karim, W. Balachandran","doi":"10.1109/INMIC.2008.4777723","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777723","url":null,"abstract":"Several nations around the world are utilizing diverse methods to integrate and communicate patient information created and stored at various healthcare locations. Consequently, excellent lessons can be discovered from each other, even with the variations in some issues such as politics, geographies, population density. Recently, various nations have introduced strategies for national electronic health record (EHR) systems. This paper discusses the development of national healthcare strategies among three selected countries: Canada, Australia and England, concentrating on the electronic health record (EHR) as the main component of the healthcare infrastructure.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122151895","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777784
M.A.N. Bikas, A. Hussain, A. Shoeb, M. Hasan, M. Rabbi
Now a day, grid computing is considered as one of the emerging technology in which jobs are distributed across the network or Internet. Among the several software toolkits those help us to implement a grid environment, Alchemi is widely used and open source toolkit that runs on the Windows operating system in the .NET Framework. The node which requests an application to be performed is called owner. The node that receives the requested application and sends result back to the owner is called manager. An application is divided into many threads and theses threads are then submitted to other nodes called executor. The executors execute the thread(s) which is assigned to them and return the result to the Manager after successful completion of execution. During the execution, if any thread fails to complete, then the task is rescheduled to other executor from its initial state. But if we can save the last execution point as well as the results and transfer that information to the manager, we can complete the same job in less time. Based on this principle, in this paper, we have proposed file based grid thread implementation technique that stores the results of a thread during its execution. In case of any failure, the thread restarts from its last saved value rather than starting from its initial point.
{"title":"File based GRID thread implementation in the .NET-based Alchemi Framework","authors":"M.A.N. Bikas, A. Hussain, A. Shoeb, M. Hasan, M. Rabbi","doi":"10.1109/INMIC.2008.4777784","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777784","url":null,"abstract":"Now a day, grid computing is considered as one of the emerging technology in which jobs are distributed across the network or Internet. Among the several software toolkits those help us to implement a grid environment, Alchemi is widely used and open source toolkit that runs on the Windows operating system in the .NET Framework. The node which requests an application to be performed is called owner. The node that receives the requested application and sends result back to the owner is called manager. An application is divided into many threads and theses threads are then submitted to other nodes called executor. The executors execute the thread(s) which is assigned to them and return the result to the Manager after successful completion of execution. During the execution, if any thread fails to complete, then the task is rescheduled to other executor from its initial state. But if we can save the last execution point as well as the results and transfer that information to the manager, we can complete the same job in less time. Based on this principle, in this paper, we have proposed file based grid thread implementation technique that stores the results of a thread during its execution. In case of any failure, the thread restarts from its last saved value rather than starting from its initial point.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124732001","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777793
F. Ali, A. Bin Mansoor
Computer vision based scoring system can break the monopoly of other automatic scoring systems like shell shockwave amplitude system due to its ease of implementation and cost effectiveness. This paper presents a computer vision based automatic scoring method for the shooting targets. We perform morphological processing of the target image to thicken the boundaries of the bullet hits and then segment the target area by hysteresis thresholding. The impact of illumination variations is handled by adjustable thresholds. The bulls eye of the target is segmented by the help of distance transform to calculate the score inside the bulls eye. Thus, our method is capable of scoring inside and outside the bulls eye separately. The bullet hits are labeled after the segmentation of the target area and the overlapping bullets are also scored by defining a threshold pixel area for the bullet hits. The proposed algorithm is tested on 100 target images with varying number of bullets hit, resulting in bullet count accuracy of 98.3%.
{"title":"Computer Vision based Automatic Scoring of shooting targets","authors":"F. Ali, A. Bin Mansoor","doi":"10.1109/INMIC.2008.4777793","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777793","url":null,"abstract":"Computer vision based scoring system can break the monopoly of other automatic scoring systems like shell shockwave amplitude system due to its ease of implementation and cost effectiveness. This paper presents a computer vision based automatic scoring method for the shooting targets. We perform morphological processing of the target image to thicken the boundaries of the bullet hits and then segment the target area by hysteresis thresholding. The impact of illumination variations is handled by adjustable thresholds. The bulls eye of the target is segmented by the help of distance transform to calculate the score inside the bulls eye. Thus, our method is capable of scoring inside and outside the bulls eye separately. The bullet hits are labeled after the segmentation of the target area and the overlapping bullets are also scored by defining a threshold pixel area for the bullet hits. The proposed algorithm is tested on 100 target images with varying number of bullets hit, resulting in bullet count accuracy of 98.3%.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124752884","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777719
M. Akram, A. Tariq, S. Nasir
In automated diagnosis of diabetic retinopathy, retinal images are used. The retinal images of poor quality need to be enhanced before the extraction of features and abnormalities. Segmentation of retinal images is essential for this purpose. The segmentation is employed to smooth and strengthen images by separating the noisy area from the overall image thus resulting in retinal image enhancement and less processing time. In this paper, we present a novel automated approach for segmentation of colored retinal images, which involves two steps. In the first step, we create binary noise segmentation mask to segment the retinal image. Second step creates final segmentation mask by applying morphological techniques. We used standard retinal image databases Diaretdb0 and Diaretdb1 to test the validation of our segmentation technique. Experimental results indicate our approach is effective and can get higher segmentation accuracy.
{"title":"Retinal images: Noise segmentation","authors":"M. Akram, A. Tariq, S. Nasir","doi":"10.1109/INMIC.2008.4777719","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777719","url":null,"abstract":"In automated diagnosis of diabetic retinopathy, retinal images are used. The retinal images of poor quality need to be enhanced before the extraction of features and abnormalities. Segmentation of retinal images is essential for this purpose. The segmentation is employed to smooth and strengthen images by separating the noisy area from the overall image thus resulting in retinal image enhancement and less processing time. In this paper, we present a novel automated approach for segmentation of colored retinal images, which involves two steps. In the first step, we create binary noise segmentation mask to segment the retinal image. Second step creates final segmentation mask by applying morphological techniques. We used standard retinal image databases Diaretdb0 and Diaretdb1 to test the validation of our segmentation technique. Experimental results indicate our approach is effective and can get higher segmentation accuracy.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125197649","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777706
M. Iqbal, U. S. Awan
The reconfigurable processors are the leading platforms being under consideration as a role model for reconfigurable computing systems. An application can be greatly accelerated by placing its computationally intensive portions of algorithms onto the reconfigurable platform. The gains are realized because the reconfigurable computing combines the benefits of both; the software and the ASIC solutions. However, the advantages of reconfigurable computing do not come without a cost. By requiring multiple reconfigurations to complete a computation, the time required to reconfigure the hardware significantly degrades the performance of such systems. The emerging reconfigurable architectures are focusing the efficient solutions for the configuration unit designs. Configuration unit is responsible for managing all activities relevant to the system configuration and hence it plays a vital role in reconfigurable processors. In this research paper an efficient configuration unit design has been presented for a VLIW based reconfigurable processor. The presented configuration unit is expected to be one of the most efficient design alternatives being available for reconfigurable processors. The presented configuration unit design is capable of loading the minimum configuration streams with the most optimal configuration overheads and hence it leads to a dramatic enhancement in the performance of reconfigurable processor.
{"title":"An efficient configuration unit design for VLIW based reconfigurable processors","authors":"M. Iqbal, U. S. Awan","doi":"10.1109/INMIC.2008.4777706","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777706","url":null,"abstract":"The reconfigurable processors are the leading platforms being under consideration as a role model for reconfigurable computing systems. An application can be greatly accelerated by placing its computationally intensive portions of algorithms onto the reconfigurable platform. The gains are realized because the reconfigurable computing combines the benefits of both; the software and the ASIC solutions. However, the advantages of reconfigurable computing do not come without a cost. By requiring multiple reconfigurations to complete a computation, the time required to reconfigure the hardware significantly degrades the performance of such systems. The emerging reconfigurable architectures are focusing the efficient solutions for the configuration unit designs. Configuration unit is responsible for managing all activities relevant to the system configuration and hence it plays a vital role in reconfigurable processors. In this research paper an efficient configuration unit design has been presented for a VLIW based reconfigurable processor. The presented configuration unit is expected to be one of the most efficient design alternatives being available for reconfigurable processors. The presented configuration unit design is capable of loading the minimum configuration streams with the most optimal configuration overheads and hence it leads to a dramatic enhancement in the performance of reconfigurable processor.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"132 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126025904","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777786
M. Tufail, Saqib-ur-Rehman, B. Usmani
This study assesses the inter-annual variability of summer monsoon rainfall of Northern Hilly Area of Pakistan, which includes Balakot, Chitral, Murree, Gilgit, Skardu, Chilas, Muzaffarabad and Dir. The region receives a heavy rainfall, the total annual rainfall being 1000 mm or more. We attempt to model the rainfall process of the data from 1971-2000. Initially we use twelve predictors out of which only four, viz., sea surface temperature (SST-10a), temperature of Hyderabad city of Pakistan (HT-5) and pressure of Kakul (KP-10)and Lahore (LP-3), are selected with the help of stepwise multiple linear regression. The mean square error of the regression model is found to be 13.8%. Since the entire modeling procedure is based on selected predictors, we suggest that the selected predictors, which are selected here according to their correlation, should be refined by using more sophisticated technique such as principal component analysis, or nonlinear correlations.
{"title":"Modeling and simulation of summer monsoon rainfall for Northern Hilly Area of Pakistan","authors":"M. Tufail, Saqib-ur-Rehman, B. Usmani","doi":"10.1109/INMIC.2008.4777786","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777786","url":null,"abstract":"This study assesses the inter-annual variability of summer monsoon rainfall of Northern Hilly Area of Pakistan, which includes Balakot, Chitral, Murree, Gilgit, Skardu, Chilas, Muzaffarabad and Dir. The region receives a heavy rainfall, the total annual rainfall being 1000 mm or more. We attempt to model the rainfall process of the data from 1971-2000. Initially we use twelve predictors out of which only four, viz., sea surface temperature (SST-10a), temperature of Hyderabad city of Pakistan (HT-5) and pressure of Kakul (KP-10)and Lahore (LP-3), are selected with the help of stepwise multiple linear regression. The mean square error of the regression model is found to be 13.8%. Since the entire modeling procedure is based on selected predictors, we suggest that the selected predictors, which are selected here according to their correlation, should be refined by using more sophisticated technique such as principal component analysis, or nonlinear correlations.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127102135","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777707
S. Sarfraz
The edge roughness of lithographically defined resist features is an important aspect of micro fabrication of semiconductor devices. Previous work has demonstrated origin of line edge roughness due to polymer phase separation during the development step; influence of edge gradient on the morphology of edge roughness; effect of development technique and developer on surface roughness of large area features and also the correlation of surface roughness with edge roughness in poly(methylmethacrylate) PMMA. In this work the influence of developer and proximity effect on morphology of edge roughness in lithographically graded exposures using PMMA resist and atomic force microscopy (AFM) technique is investigated. Since for very steep edges, the AFM technique is unable to image the resist roughness close to the substrate due to shadowing by the higher parts of the resist. Features were defined lithographically by controlling the change in dose at the feature edge, allowing the edge roughness and its corresponding morphology for steep features to be determined by extrapolation from AFM measurements of relatively shallow exposure gradients.
{"title":"Influence of developer and proximity effect on morphology of edge roughness in lithographically graded exposures using PMMA","authors":"S. Sarfraz","doi":"10.1109/INMIC.2008.4777707","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777707","url":null,"abstract":"The edge roughness of lithographically defined resist features is an important aspect of micro fabrication of semiconductor devices. Previous work has demonstrated origin of line edge roughness due to polymer phase separation during the development step; influence of edge gradient on the morphology of edge roughness; effect of development technique and developer on surface roughness of large area features and also the correlation of surface roughness with edge roughness in poly(methylmethacrylate) PMMA. In this work the influence of developer and proximity effect on morphology of edge roughness in lithographically graded exposures using PMMA resist and atomic force microscopy (AFM) technique is investigated. Since for very steep edges, the AFM technique is unable to image the resist roughness close to the substrate due to shadowing by the higher parts of the resist. Features were defined lithographically by controlling the change in dose at the feature edge, allowing the edge roughness and its corresponding morphology for steep features to be determined by extrapolation from AFM measurements of relatively shallow exposure gradients.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127111555","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777761
Mohammad Hussein Saraee, Razieh Sadat Sadjady
Genetic programming (GP) is a branch of genetic algorithms (GA) that searches for the best operation or computer program in search space of operations. At the same time classification is a data mining technique used to build model of data classes which can be used to predict future trends. In this paper GP has been employed for the implementation of the classification technique. GP properties can facilitate generating new and optimized classification rules that are not discovered by the existing traditional classification techniques. In addition we will show that GA approach is superior to traditional methods in regard to performance both on time and space requirements for processing.
{"title":"Optimizing classification techniques using Genetic Programming approach","authors":"Mohammad Hussein Saraee, Razieh Sadat Sadjady","doi":"10.1109/INMIC.2008.4777761","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777761","url":null,"abstract":"Genetic programming (GP) is a branch of genetic algorithms (GA) that searches for the best operation or computer program in search space of operations. At the same time classification is a data mining technique used to build model of data classes which can be used to predict future trends. In this paper GP has been employed for the implementation of the classification technique. GP properties can facilitate generating new and optimized classification rules that are not discovered by the existing traditional classification techniques. In addition we will show that GA approach is superior to traditional methods in regard to performance both on time and space requirements for processing.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129605954","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 : 2008-12-01DOI: 10.1109/INMIC.2008.4777790
R. Ali, M.A. Khan, R. Ahmad
The rationale behind anaphora resolution in Pashto language is to make it easier for computer to comprehend and further process Pashto text accurately. This paper is focused on the implementation of the algorithm (Ali et al., 2007) and modifying few of its rules. It also adds some new rules and eliminates an undesirable one to enhance the accuracy and efficiency. The algorithm uses a rule-based approach for the resolution of strong personal pronouns of Pashto language in their direct, oblique, and possessive cases. It has been implemented in Visual C#.NET and tested on real world text taken from different genres. The modified algorithm increases the accuracy from 80% to 85.14%.
普什图语回指解析的基本原理是使计算机更容易准确地理解和进一步处理普什图语文本。本文的重点是该算法的实现(Ali et al.， 2007)，并修改了其中的一些规则。它还增加了一些新的规则，并消除了一些不需要的规则，以提高准确性和效率。该算法采用基于规则的方法对普什图语中直接、间接和所有格的强人称代词进行解析。它已经在Visual c#中实现。NET和测试了现实世界的文本从不同的体裁。改进后的算法将准确率从80%提高到85.14%。
{"title":"Implementation of the rule-based approach for the resolution of strong personal anaphora in Pashto discourse","authors":"R. Ali, M.A. Khan, R. Ahmad","doi":"10.1109/INMIC.2008.4777790","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777790","url":null,"abstract":"The rationale behind anaphora resolution in Pashto language is to make it easier for computer to comprehend and further process Pashto text accurately. This paper is focused on the implementation of the algorithm (Ali et al., 2007) and modifying few of its rules. It also adds some new rules and eliminates an undesirable one to enhance the accuracy and efficiency. The algorithm uses a rule-based approach for the resolution of strong personal pronouns of Pashto language in their direct, oblique, and possessive cases. It has been implemented in Visual C#.NET and tested on real world text taken from different genres. The modified algorithm increases the accuracy from 80% to 85.14%.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131748311","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
扫码关注我们
求助内容：
应助结果提醒方式：