Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777800
F. Yousuf, Z. Zaman, Naveed Ikram
Global software development (GSD) is an emerging trend of software engineering. Seeking lower cost and accessing global resources pool are the main factors towards globalization of software development. GSD exhibits certain characteristics such as distance, time zone and cross-cultural differences that differentiate global software development from co-located software development. GSD makes many activities of software development difficult so as Requirements validation. Requirements validation can only be performed against the user's intention; thus the user's participation in the validation techniques is paramount. Traditional requirements validation techniques do not fit into issues imposed by GSD because of their inherent characteristics and shortcomings. In essence, they are designed for co-located development. This paper examines the existing requirements validation techniques, describes the issues in GSD, and evaluates them as well. The results show that some of the existing requirement validation techniques require extensive informal communication that is not convenient in GSD while other techniques which can be applied effectively in GSD are not very mature yet.
{"title":"Requirements validation techniques in GSD: A survey","authors":"F. Yousuf, Z. Zaman, Naveed Ikram","doi":"10.1109/INMIC.2008.4777800","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777800","url":null,"abstract":"Global software development (GSD) is an emerging trend of software engineering. Seeking lower cost and accessing global resources pool are the main factors towards globalization of software development. GSD exhibits certain characteristics such as distance, time zone and cross-cultural differences that differentiate global software development from co-located software development. GSD makes many activities of software development difficult so as Requirements validation. Requirements validation can only be performed against the user's intention; thus the user's participation in the validation techniques is paramount. Traditional requirements validation techniques do not fit into issues imposed by GSD because of their inherent characteristics and shortcomings. In essence, they are designed for co-located development. This paper examines the existing requirements validation techniques, describes the issues in GSD, and evaluates them as well. The results show that some of the existing requirement validation techniques require extensive informal communication that is not convenient in GSD while other techniques which can be applied effectively in GSD are not very mature yet.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"94 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":"124062403","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.4777804
B. Vaseghi, S. Alirezaee, M. Ahmadi, R. Amirfattahi
In this paper a Farsi handwritten word recognition system for reading city names in postal addresses is presented. The method is based on vector quantization (VQ) and hidden Markov model (HMM). The sliding right to left window is used to extract the proper features(we have proposed four features). After feature extraction, K-means clustering is used for generation a codebook and VQ generates a codeword for each word image. In the next stage, HMM is trained by Baum Welch algorithm for each city name. A test image is recognized by finding the best match (likelihood) between the image and all of the HMM words models using forward algorithm. Experimental results show the advantages of using VQ/HMM recognizer engine instead of conventional discrete HMM.
{"title":"Off-line Farsi / arabic handwritten word recognition using vector quantization and hidden Markov model","authors":"B. Vaseghi, S. Alirezaee, M. Ahmadi, R. Amirfattahi","doi":"10.1109/INMIC.2008.4777804","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777804","url":null,"abstract":"In this paper a Farsi handwritten word recognition system for reading city names in postal addresses is presented. The method is based on vector quantization (VQ) and hidden Markov model (HMM). The sliding right to left window is used to extract the proper features(we have proposed four features). After feature extraction, K-means clustering is used for generation a codebook and VQ generates a codeword for each word image. In the next stage, HMM is trained by Baum Welch algorithm for each city name. A test image is recognized by finding the best match (likelihood) between the image and all of the HMM words models using forward algorithm. Experimental results show the advantages of using VQ/HMM recognizer engine instead of conventional discrete HMM.","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":"128648362","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.4777743
Nadir Shah, D. Qian, K. Iqbal
Mobile ad hoc networks (MANETs) are networks where the nodes are mobile, communicating via wireless link, operating without fixed infrastructure and each node act as a router (forwarding the in transit packets) as well as an end host. The movement of nodes is different in different scenario depending upon applications. Several routing protocols have been proposed by researchers for mobile ad hoc networks. They perform different in different scenarios. The mobility model is one of the main aspects for testing the performance of MANETs routing protocols. We evaluate the performance of multiple routing protocols (DSDV, DSR, OLSR and AODV) using most common mobility models ( random walk, random direction, random way point) for mobile ad hoc networks. We draw the conclusions at the end from the results which will provide the idea of using routing protocol in implementation according to the mobility characteristics of underline scenario. Also we elaborate the weakness and advantages of these routing protocols.
{"title":"Performance evaluation of multiple routing protocols using multiple mobility models for mobile ad hoc networks","authors":"Nadir Shah, D. Qian, K. Iqbal","doi":"10.1109/INMIC.2008.4777743","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777743","url":null,"abstract":"Mobile ad hoc networks (MANETs) are networks where the nodes are mobile, communicating via wireless link, operating without fixed infrastructure and each node act as a router (forwarding the in transit packets) as well as an end host. The movement of nodes is different in different scenario depending upon applications. Several routing protocols have been proposed by researchers for mobile ad hoc networks. They perform different in different scenarios. The mobility model is one of the main aspects for testing the performance of MANETs routing protocols. We evaluate the performance of multiple routing protocols (DSDV, DSR, OLSR and AODV) using most common mobility models ( random walk, random direction, random way point) for mobile ad hoc networks. We draw the conclusions at the end from the results which will provide the idea of using routing protocol in implementation according to the mobility characteristics of underline scenario. Also we elaborate the weakness and advantages of these routing protocols.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"8 8 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":"130481421","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.4777802
A.A. Zaidi, F. Kupzog
The balance of supply and demand in a microgrid is traditionally maintained by exploiting the reserves on generation side, which is capital intensive. However, approaches of on-line energy management including peak-load reduction and control energy provision by the demand side can support to reduce the demand during the situation of energy imbalance. This article discusses a new approach of modeling an intelligent and self-configurable microgrid system using automated demand side management, i.e. automated load management. In this system, microgrid central controller (MGCC) can communicate with the loads and directs them to isolate from the grid in real-time to reduce overall demand load on the system especially during peak-load hours. For this purpose, each load is coupled with a control node to become an intelligent load. Control node is a simple controlling circuitry, consisting of a communication node, power measuring device and a switch that can isolate the load from the grid under the management of central controller. MGCC takes decisions on the basis of control algorithms, which are implemented in it. Proposed system increases the reliability of consistent energy supply and considerably reduces the installation and maintenance costs of a microgrid.
{"title":"Microgrid automation - a self-configuring approach","authors":"A.A. Zaidi, F. Kupzog","doi":"10.1109/INMIC.2008.4777802","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777802","url":null,"abstract":"The balance of supply and demand in a microgrid is traditionally maintained by exploiting the reserves on generation side, which is capital intensive. However, approaches of on-line energy management including peak-load reduction and control energy provision by the demand side can support to reduce the demand during the situation of energy imbalance. This article discusses a new approach of modeling an intelligent and self-configurable microgrid system using automated demand side management, i.e. automated load management. In this system, microgrid central controller (MGCC) can communicate with the loads and directs them to isolate from the grid in real-time to reduce overall demand load on the system especially during peak-load hours. For this purpose, each load is coupled with a control node to become an intelligent load. Control node is a simple controlling circuitry, consisting of a communication node, power measuring device and a switch that can isolate the load from the grid under the management of central controller. MGCC takes decisions on the basis of control algorithms, which are implemented in it. Proposed system increases the reliability of consistent energy supply and considerably reduces the installation and maintenance costs of a microgrid.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"24 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":"131091446","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.4777700
Abolfazl Jalilvand, A. Safari, R. Aghmasheh
In this paper an optimal state feedback design as a power system stabilizer (PSS) using particle swarm optimization (PSO) is presented. The problem of selecting the parameters of the state feedback PSS for a multi machine power system is converted to an optimization problem solved by PSO with the eigenvalue-based objective functions. Both the relative stability of low-frequency modes and the practical implementation of PSSs as Considerations for a stable system are included in the constraints. The locally measured states are fed back at the AVR reference input of each machine after multiplication by suitable feedback gains. The obtained stabilizer is confirmed by eigenvalue analysis and simulation results of a multi machine power system under different operating conditions and exposed to small disturbances.
{"title":"Design of state feedback stabilizer for multi machine power system using PSO algorithm","authors":"Abolfazl Jalilvand, A. Safari, R. Aghmasheh","doi":"10.1109/INMIC.2008.4777700","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777700","url":null,"abstract":"In this paper an optimal state feedback design as a power system stabilizer (PSS) using particle swarm optimization (PSO) is presented. The problem of selecting the parameters of the state feedback PSS for a multi machine power system is converted to an optimization problem solved by PSO with the eigenvalue-based objective functions. Both the relative stability of low-frequency modes and the practical implementation of PSSs as Considerations for a stable system are included in the constraints. The locally measured states are fed back at the AVR reference input of each machine after multiplication by suitable feedback gains. The obtained stabilizer is confirmed by eigenvalue analysis and simulation results of a multi machine power system under different operating conditions and exposed to small disturbances.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"40 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":"133747009","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.4777704
M. Rezanezhad, M. Dargahi, S. Lesan, A.R. Noee
In this paper, a modified power factor correction (PFC) converter based on Sheppard-Taylor PFC converter is proposed, and operation principle of this converter is studied. Compared with conventional Sheppard-Taylor converter, proposed converter has many advantages such as less ripple of input current and increased output voltage, which improves Sheppard-Taylor converter operation considerably. Finally, sliding mode control is applied to proposed converter and obtained results are studied.
{"title":"Sliding mode control of modified Sheppard-Taylor PFC converter","authors":"M. Rezanezhad, M. Dargahi, S. Lesan, A.R. Noee","doi":"10.1109/INMIC.2008.4777704","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777704","url":null,"abstract":"In this paper, a modified power factor correction (PFC) converter based on Sheppard-Taylor PFC converter is proposed, and operation principle of this converter is studied. Compared with conventional Sheppard-Taylor converter, proposed converter has many advantages such as less ripple of input current and increased output voltage, which improves Sheppard-Taylor converter operation considerably. Finally, sliding mode control is applied to proposed converter and obtained results are studied.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"80 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":"125167289","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.5307286
S. Lesan, M. Rezanezhad, M. Dargahi, A.R. Noee
In this paper, a modified power factor correction (PFC) converter based on Sheppard-Taylor PFC converter is proposed, and operation principle of this converter is studied. Compared with conventional Sheppard-Taylor converter, the proposed converter has many advantages such as less ripple of input current that can considerably improve Sheppard-Taylor converter operation. Then sliding mode control is applied to proposed converter and obtained results are studied.
{"title":"Correction to: sliding mode control of modified sheppard-taylor PFC converter","authors":"S. Lesan, M. Rezanezhad, M. Dargahi, A.R. Noee","doi":"10.1109/INMIC.2008.5307286","DOIUrl":"https://doi.org/10.1109/INMIC.2008.5307286","url":null,"abstract":"In this paper, a modified power factor correction (PFC) converter based on Sheppard-Taylor PFC converter is proposed, and operation principle of this converter is studied. Compared with conventional Sheppard-Taylor converter, the proposed converter has many advantages such as less ripple of input current that can considerably improve Sheppard-Taylor converter operation. Then sliding mode control is applied to proposed converter and obtained results are studied.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"96 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":"134281207","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.4777726
A. Jalal-Karim, W. Balachandran
Sharing electronic health record (EHR) between various healthcare locations is a significant challenge: patient's healthcare information are split across several information sources, and often owned by various healthcare organizations. Throughout the last decade, there have been various regional, national and international plans concentrated on the development of healthcare network architecture for secure access and sharing of federated patient information. This paper consists of two main segments: first it will start by reviewing the issues regarding the EHR architectures and networking approaches and how it influences the quality and efficiency of service provided, and second we simulate the performance of those approaches based on OPNET system in order to approve on an optimal approach with highest performance. OPNET will compare the efficiency of those approaches with a synchronously access the system functions regardless of the location.
{"title":"The optimal network model's performance for sharing Electronic Health Record","authors":"A. Jalal-Karim, W. Balachandran","doi":"10.1109/INMIC.2008.4777726","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777726","url":null,"abstract":"Sharing electronic health record (EHR) between various healthcare locations is a significant challenge: patient's healthcare information are split across several information sources, and often owned by various healthcare organizations. Throughout the last decade, there have been various regional, national and international plans concentrated on the development of healthcare network architecture for secure access and sharing of federated patient information. This paper consists of two main segments: first it will start by reviewing the issues regarding the EHR architectures and networking approaches and how it influences the quality and efficiency of service provided, and second we simulate the performance of those approaches based on OPNET system in order to approve on an optimal approach with highest performance. OPNET will compare the efficiency of those approaches with a synchronously access the system functions regardless of the location.","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":"134323103","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.4777731
U. Qayyum
This paper presents a novel scheme for face recognition application, by utilizing curved singularities obtained from curvelet transform and trained on phase efficient neural network. The phase efficient neural network is formed by processing the statistical descriptor and smooth coefficients of curvelet transform with neural network and then post-process with phase only correlation (POC). Neural network minimizes the search space of face subjects by yielding the response values to POC. The match/mismatch recognition accuracy is based upon the peak detection from the POC surface. The amalgamation of two recognition techniques on curvelet features have enabled us to look into the new dimension of not only improving the accuracy of neural network but also to decrease the computational and time cost of phase only correlation.
{"title":"Phase efficient neural network using Curvelet features for face recognition","authors":"U. Qayyum","doi":"10.1109/INMIC.2008.4777731","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777731","url":null,"abstract":"This paper presents a novel scheme for face recognition application, by utilizing curved singularities obtained from curvelet transform and trained on phase efficient neural network. The phase efficient neural network is formed by processing the statistical descriptor and smooth coefficients of curvelet transform with neural network and then post-process with phase only correlation (POC). Neural network minimizes the search space of face subjects by yielding the response values to POC. The match/mismatch recognition accuracy is based upon the peak detection from the POC surface. The amalgamation of two recognition techniques on curvelet features have enabled us to look into the new dimension of not only improving the accuracy of neural network but also to decrease the computational and time cost of phase only correlation.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"54 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":"131403824","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/ICCITECHN.2008.4803113
A. Hussain, A. Shoeb, A.N. Bikas, M. Hasan
Grid computing is rapidly becoming a requirement for the modern days computing where needs large amount of data to be processed. The Gridbus broker focuses on the Data Grid and schedules jobs depending on data and compute resources. In the current scheduling process, a job is assigned to an executor depending on the compute resource and data resource available at the time of deployment. One major problem is, if there is an idle higher grade compute resource available after the scheduling, it doesn't take the advantage of that though there are unfinished job. As previous job completion history get privilege at the scheduling time so there is a high possibility for the slower one getting the more number of threads. Also if the last thread is assigned to the slower executor, both these cases create a bottleneck for the faster job completion. In many cases, the faster one remains idle for a long time after completing its last job. In this paper, we have proposed a technique to reassign a thread to higher grade executor by preempting the thread in lower grade executor. Here we used the data restoration technique which track the information of the thread so far ran on a lower rate compute resource. If there is an idle computer with higher resource after the scheduling, we assigned the thread on computer from the saved point of the job that has already done in the lower power compute resource. By this approach we have improved the performance as well as the reliability of the Grid in a considerable extent.
{"title":"Runtime thread rescheduling: An extended scheduling algorithm to enhance the performance of the Gridbus broker","authors":"A. Hussain, A. Shoeb, A.N. Bikas, M. Hasan","doi":"10.1109/ICCITECHN.2008.4803113","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803113","url":null,"abstract":"Grid computing is rapidly becoming a requirement for the modern days computing where needs large amount of data to be processed. The Gridbus broker focuses on the Data Grid and schedules jobs depending on data and compute resources. In the current scheduling process, a job is assigned to an executor depending on the compute resource and data resource available at the time of deployment. One major problem is, if there is an idle higher grade compute resource available after the scheduling, it doesn't take the advantage of that though there are unfinished job. As previous job completion history get privilege at the scheduling time so there is a high possibility for the slower one getting the more number of threads. Also if the last thread is assigned to the slower executor, both these cases create a bottleneck for the faster job completion. In many cases, the faster one remains idle for a long time after completing its last job. In this paper, we have proposed a technique to reassign a thread to higher grade executor by preempting the thread in lower grade executor. Here we used the data restoration technique which track the information of the thread so far ran on a lower rate compute resource. If there is an idle computer with higher resource after the scheduling, we assigned the thread on computer from the saved point of the job that has already done in the lower power compute resource. By this approach we have improved the performance as well as the reliability of the Grid in a considerable extent.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"81 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":"114616873","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
扫码关注我们
求助内容：
应助结果提醒方式：