Pub Date : 2009-12-11DOI: 10.1109/ICET.2009.5353197
K. Iqbal
This paper exploits the concept of diversity using Omni-directional antenna at BS, where different users are communicating with BS from different locations but at same frequency in flat fading and frequency selective environments. The opportunistic communication method has been implemented using Matlab Rayleigh and Spatial channel model (SCM) developed by 3rd generation partnership project (3GPP). The main focus is on comparison of results using SCM and Matlab Rayleigh channel and is shown with the help of simulations that SCM provides an improvement in terms of bit error rate (BER) as compared to Matlab Rayleigh Channel. The BER performance of SCM systems is much better thereby showing an improvement of about 5dB in flat fading environment that happens because of exploitation of spatial diversity offered by SCM. In case of frequency selective fading environment there is an improvement of 2–3 dB for two users while using SCM as compared to Matlab Rayleigh channel by exploitation of diversity in spatial and time domain
本文利用BS全向天线的分集概念,在平坦衰落和频率选择的环境下,不同的用户从不同的位置以相同的频率与BS通信。利用Matlab Rayleigh和第三代合作伙伴计划(3GPP)开发的空间信道模型(SCM)实现了机会通信方法。主要重点是使用单片机和Matlab瑞利信道的结果的比较,并在仿真的帮助下显示,与Matlab瑞利信道相比,单片机在误码率(BER)方面提供了改进。利用单片机提供的空间分集,在平坦衰落环境下,系统的误码率提高了约5dB。在频率选择性衰落环境下,通过利用空间和时域的分集,使用单片机的两个用户比Matlab瑞利信道提高了2-3 dB
{"title":"Exploitation of multiuser diversity in spatial and time domain by opportunistic communication system using an Omni-directional antenna at BS","authors":"K. Iqbal","doi":"10.1109/ICET.2009.5353197","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353197","url":null,"abstract":"This paper exploits the concept of diversity using Omni-directional antenna at BS, where different users are communicating with BS from different locations but at same frequency in flat fading and frequency selective environments. The opportunistic communication method has been implemented using Matlab Rayleigh and Spatial channel model (SCM) developed by 3rd generation partnership project (3GPP). The main focus is on comparison of results using SCM and Matlab Rayleigh channel and is shown with the help of simulations that SCM provides an improvement in terms of bit error rate (BER) as compared to Matlab Rayleigh Channel. The BER performance of SCM systems is much better thereby showing an improvement of about 5dB in flat fading environment that happens because of exploitation of spatial diversity offered by SCM. In case of frequency selective fading environment there is an improvement of 2–3 dB for two users while using SCM as compared to Matlab Rayleigh channel by exploitation of diversity in spatial and time domain","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133526970","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353181
Nighat Noureen, Raisa Bano, H. Rashid
Acid-sensing ion channels (ASICs) of the epithelial sodium channel/degenerin (ENaC/DEG) gene family are protongated cation channels. ASICs have two transmembrane segments which are hydrophobic. Various proton-gated ion channels suggest that, ASIC and MDEG probably seems to be the first two members of this family and the genes for the new channels remain to be discovered. The presence of a large extracellular domain between two transmembrane alpha-helices and the short NH2 and COOH terminal cytoplasmic segments, characterizes these proteins. In order to relate the three-dimensional (3D) structure to their physiological function, channel proteins have been the focus of various computational approaches. On the basis of available X-ray structures, structural models of channels may be constructed by homology modeling. Here we present 3D structure of rat Amiloride-sensitive cation channel 1, neuronal isoform B through Comparative Modeling studies. Our studies will be useful in understanding the biochemical functions and interaction properties in detail.
{"title":"Comparative modeling studies of rat amiloride-sensitive cation channel 1, neuronal isoform b","authors":"Nighat Noureen, Raisa Bano, H. Rashid","doi":"10.1109/ICET.2009.5353181","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353181","url":null,"abstract":"Acid-sensing ion channels (ASICs) of the epithelial sodium channel/degenerin (ENaC/DEG) gene family are protongated cation channels. ASICs have two transmembrane segments which are hydrophobic. Various proton-gated ion channels suggest that, ASIC and MDEG probably seems to be the first two members of this family and the genes for the new channels remain to be discovered. The presence of a large extracellular domain between two transmembrane alpha-helices and the short NH2 and COOH terminal cytoplasmic segments, characterizes these proteins. In order to relate the three-dimensional (3D) structure to their physiological function, channel proteins have been the focus of various computational approaches. On the basis of available X-ray structures, structural models of channels may be constructed by homology modeling. Here we present 3D structure of rat Amiloride-sensitive cation channel 1, neuronal isoform B through Comparative Modeling studies. Our studies will be useful in understanding the biochemical functions and interaction properties in detail.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354957","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353131
Hasan Tahir, M. Javed
Wireless Sensor Networks possess unique characteristics because of their hostile deployment environment and their resource starved nature. Wireless Sensor Networks are now being deployed in a number of complex environments like battle fields, agriculture, hospitals and many more. Almost all the environments where wireless sensor networks are deployed need to sense events in their surroundings and report them to the collection points in an efficient and timely manner. Both of these requirements require a Quality of Service (QoS) based view of the entire network. In this paper we have explained why sensor networks need QoS and what are the QoS concerns in wireless sensor networks. We have also studied a number of architectures that contribute to the QoS requirements. A tradeoff regarding QoS has also been presented to explain the gains and losses of any architecture that tries to address the quality of service in wireless sensor networks.
{"title":"Service guarantees in wireless sensor networks","authors":"Hasan Tahir, M. Javed","doi":"10.1109/ICET.2009.5353131","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353131","url":null,"abstract":"Wireless Sensor Networks possess unique characteristics because of their hostile deployment environment and their resource starved nature. Wireless Sensor Networks are now being deployed in a number of complex environments like battle fields, agriculture, hospitals and many more. Almost all the environments where wireless sensor networks are deployed need to sense events in their surroundings and report them to the collection points in an efficient and timely manner. Both of these requirements require a Quality of Service (QoS) based view of the entire network. In this paper we have explained why sensor networks need QoS and what are the QoS concerns in wireless sensor networks. We have also studied a number of architectures that contribute to the QoS requirements. A tradeoff regarding QoS has also been presented to explain the gains and losses of any architecture that tries to address the quality of service in wireless sensor networks.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116226408","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353162
Abdul Hameed
The automatic video shot detection is receiving a great impact with the advances in the digital video technology and ever increasing accessibility of computing results. In this paper we describe a framework for extracting shot detection by using the threshold values of diverse statistical features for raw video frames. Two different types of sports videos viz. soccer and basketball are used for assessment. The approach exploits correlation, maximum histogram difference and running average difference as the classifiers. The results are evaluated by selection of appropriate threshold of these features after training of framework. The winner take-all selection scheme is applied if correlation coefficient and histogram difference features are unable to identify the shot detection. Experimental results on divergent set of test videos reveal the effectiveness of this shot detection approach.
{"title":"A novel framework of shot boundary detection for uncompressed videos","authors":"Abdul Hameed","doi":"10.1109/ICET.2009.5353162","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353162","url":null,"abstract":"The automatic video shot detection is receiving a great impact with the advances in the digital video technology and ever increasing accessibility of computing results. In this paper we describe a framework for extracting shot detection by using the threshold values of diverse statistical features for raw video frames. Two different types of sports videos viz. soccer and basketball are used for assessment. The approach exploits correlation, maximum histogram difference and running average difference as the classifiers. The results are evaluated by selection of appropriate threshold of these features after training of framework. The winner take-all selection scheme is applied if correlation coefficient and histogram difference features are unable to identify the shot detection. Experimental results on divergent set of test videos reveal the effectiveness of this shot detection approach.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121413733","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353142
S. Hussain, M. Qadir
Fault monitoring is one of the main activities of fault tolerant distributed systems. It is required to determine the suspected /crashed component and proactively take the recovery steps to keep the system alive. The main objective of the fault monitoring activity is to quickly and correctly identify the faults. A fault monitoring system which is quick to declare faults increases the chances of false alarms, i.e., declaration of a fault which is actually not a fault. Therefore, an ideal fault monitoring system needs to be as quick as possible in identification of faults without increasing the false alarms. Fault monitor typically detects faults by sending and receiving messages to remote objects and observing the time intervals between a message and its response. One of the major responsibilities of the monitor is to adapt these intervals according to the dynamic network and system conditions, and set them very close to the actual delays in the system. The adaptation of the delays, timeout and monitoring intervals, must not fluctuate with large amplitudes around the actual delays. Otherwise, the number of false alarms would increase or the identification of faults will be delayed. The adaptation should converge to the actual delays very fast. Adaptation of the monitoring interval in the same way as time outs adapt can not be defended. Sometimes, a distributed system (network or other components) may have abrupt change in their state for a very short duration (the transient behavior), the fault monitoring system should bypass these transients behavior, and otherwise the decisions taken on transients will have to be changed to other state very quickly which will add extra overheads both in taking the decision and then reverting it back. Our algorithm with the name of eACID (enhanced Adaptive Convergent Intelligent fault monitoring in Distributed systems), when compared with the best known algorithm, ADAPTATION [Sotama et al.], yielded 16% less false timeouts and 9% more utilization of responses. eACID adapts the timeout on the previous history which gives us a fair idea about the work load and we use it to our advantage. Our scheme does not take decisions on transient behaviors of the system.
{"title":"Extensive experimentation with eACID","authors":"S. Hussain, M. Qadir","doi":"10.1109/ICET.2009.5353142","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353142","url":null,"abstract":"Fault monitoring is one of the main activities of fault tolerant distributed systems. It is required to determine the suspected /crashed component and proactively take the recovery steps to keep the system alive. The main objective of the fault monitoring activity is to quickly and correctly identify the faults. A fault monitoring system which is quick to declare faults increases the chances of false alarms, i.e., declaration of a fault which is actually not a fault. Therefore, an ideal fault monitoring system needs to be as quick as possible in identification of faults without increasing the false alarms. Fault monitor typically detects faults by sending and receiving messages to remote objects and observing the time intervals between a message and its response. One of the major responsibilities of the monitor is to adapt these intervals according to the dynamic network and system conditions, and set them very close to the actual delays in the system. The adaptation of the delays, timeout and monitoring intervals, must not fluctuate with large amplitudes around the actual delays. Otherwise, the number of false alarms would increase or the identification of faults will be delayed. The adaptation should converge to the actual delays very fast. Adaptation of the monitoring interval in the same way as time outs adapt can not be defended. Sometimes, a distributed system (network or other components) may have abrupt change in their state for a very short duration (the transient behavior), the fault monitoring system should bypass these transients behavior, and otherwise the decisions taken on transients will have to be changed to other state very quickly which will add extra overheads both in taking the decision and then reverting it back. Our algorithm with the name of eACID (enhanced Adaptive Convergent Intelligent fault monitoring in Distributed systems), when compared with the best known algorithm, ADAPTATION [Sotama et al.], yielded 16% less false timeouts and 9% more utilization of responses. eACID adapts the timeout on the previous history which gives us a fair idea about the work load and we use it to our advantage. Our scheme does not take decisions on transient behaviors of the system.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122648836","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353200
A. Aslam, F. Bhatti
A new method for feeding Microstrip patch antenna with inset feed using the concept of coplanar waveguide feed line has been proposed and investigated for a printed antenna at X-Band frequency of 10GHz. The proposed antenna overcomes the problem of variations in resonant frequency with inset width and provides improved gain. The characteristics of the antenna are determined in terms of Return loss, VSWR, gain, radiation pattern etc. The measured and simulated results presented are found to be in good agreement.
{"title":"Matching technique for microstrip patch antenna using GCPW feed","authors":"A. Aslam, F. Bhatti","doi":"10.1109/ICET.2009.5353200","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353200","url":null,"abstract":"A new method for feeding Microstrip patch antenna with inset feed using the concept of coplanar waveguide feed line has been proposed and investigated for a printed antenna at X-Band frequency of 10GHz. The proposed antenna overcomes the problem of variations in resonant frequency with inset width and provides improved gain. The characteristics of the antenna are determined in terms of Return loss, VSWR, gain, radiation pattern etc. The measured and simulated results presented are found to be in good agreement.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122149912","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353125
M. U. Farooq, Muddassir Asif, N. Z. Azeemi
Tag identification and collision removal is the most critical issue which is limiting the performance of RFID systems. In this paper we test the performance of two classes of anti-collision protocols that is collision detection (pure aloha and slotted aloha) and collision avoidance (non-persistent CSMA and slotted non-persistent ISMA). To evaluate the performance of these classes of protocols we implement a simulation environment in MATLAB where we model single reader and multiple tags which run these protocols. We evaluate these protocols on the basis of two parameters i.e. tag throughput and collision rate. We found that the collision detection protocols suffer heavily due to packet collisions and results in reduced tag identifications. Whereas collision avoidance protocols reduce the collision among data packet due to carrier sense which increase the throughput. We evaluate the protocols in an environment where reader is not aware of the number of tags present in its interrogation zone. Also dense RFID environment is created to analyze collision removal property of these protocols.
{"title":"Enhancing tag identification in RFID systems using slotted non-persistent protocols","authors":"M. U. Farooq, Muddassir Asif, N. Z. Azeemi","doi":"10.1109/ICET.2009.5353125","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353125","url":null,"abstract":"Tag identification and collision removal is the most critical issue which is limiting the performance of RFID systems. In this paper we test the performance of two classes of anti-collision protocols that is collision detection (pure aloha and slotted aloha) and collision avoidance (non-persistent CSMA and slotted non-persistent ISMA). To evaluate the performance of these classes of protocols we implement a simulation environment in MATLAB where we model single reader and multiple tags which run these protocols. We evaluate these protocols on the basis of two parameters i.e. tag throughput and collision rate. We found that the collision detection protocols suffer heavily due to packet collisions and results in reduced tag identifications. Whereas collision avoidance protocols reduce the collision among data packet due to carrier sense which increase the throughput. We evaluate the protocols in an environment where reader is not aware of the number of tags present in its interrogation zone. Also dense RFID environment is created to analyze collision removal property of these protocols.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132435572","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353190
Lotfollah Jargani, M. Shahbazian, K. Salahshoor, V. Fathabadi
This paper investigates the application of multisensor data fusion (MSDF) technique to enhance the state estimation of a nonlinear plant. The proposed method is based on Kalman filters approach to improve the state estimation obtained by the novel adaptive unscented Kalman filter (AUKF). The common trend for the KF implementation assumes pre-specified fixed distribution matrices for both process and measurement noises. Here, however, the variance matrices for both process and measurement noise signals are assumed unknown a priori and thus incrementally estimated and updated using a sliding time window paradigm within which an estimation of the noise variance is calculated and adaptively updated each time the window is shifted forward. The proposed methodology is tested on a simulated continuous stirred tank reactor (CSTR) problem to estimate 4 states of this nonlinear plant. The simulation results demonstrate the superiority of the suggested method in state estimation compared with a previously reported approach.
{"title":"State estimation of nonlinear systems using novel adaptive unscented Kalman filter","authors":"Lotfollah Jargani, M. Shahbazian, K. Salahshoor, V. Fathabadi","doi":"10.1109/ICET.2009.5353190","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353190","url":null,"abstract":"This paper investigates the application of multisensor data fusion (MSDF) technique to enhance the state estimation of a nonlinear plant. The proposed method is based on Kalman filters approach to improve the state estimation obtained by the novel adaptive unscented Kalman filter (AUKF). The common trend for the KF implementation assumes pre-specified fixed distribution matrices for both process and measurement noises. Here, however, the variance matrices for both process and measurement noise signals are assumed unknown a priori and thus incrementally estimated and updated using a sliding time window paradigm within which an estimation of the noise variance is calculated and adaptively updated each time the window is shifted forward. The proposed methodology is tested on a simulated continuous stirred tank reactor (CSTR) problem to estimate 4 states of this nonlinear plant. The simulation results demonstrate the superiority of the suggested method in state estimation compared with a previously reported approach.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"7 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123729335","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353218
S. Hussain
ICTs have an immense potential to contribute to socio-economic development of Pakistan. ICT Education is a necessary pre-requisite, to enable Pakistanis to use ICTs to access online content and to generate it. However, 91% schools of Pakistan are not English medium, and only 10% of Pakistanis are English literate. In the context ICT education and use can only be effective in local languages. The current presentation highlights a recent project to qualitatively and quantitatively assess the significance of the language factor in ICT education in rural public schools. The results show an overwhelming need to localize ICTs and training to develop an inclusive knowledge society in Pakistan.
{"title":"Invited speeches: The language factor in ICT education: A case from rural Pakistan","authors":"S. Hussain","doi":"10.1109/ICET.2009.5353218","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353218","url":null,"abstract":"ICTs have an immense potential to contribute to socio-economic development of Pakistan. ICT Education is a necessary pre-requisite, to enable Pakistanis to use ICTs to access online content and to generate it. However, 91% schools of Pakistan are not English medium, and only 10% of Pakistanis are English literate. In the context ICT education and use can only be effective in local languages. The current presentation highlights a recent project to qualitatively and quantitatively assess the significance of the language factor in ICT education in rural public schools. The results show an overwhelming need to localize ICTs and training to develop an inclusive knowledge society in Pakistan.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126336307","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353201
M. A. Rigi, S. Mohammadi
Project scheduling has attracted many researchers in recent years. It is about single-item or small batch production where scarce resources have to be met when scheduling dependent activities over time. Because of high complexity of the problem uninformed search strategies cannot solve the problem optimally. This paper proposes a new evolutionary approach to resource constrained project scheduling problem. Hybrid genetic algorithm (GA)-constraint satisfaction problem (CSP) has been applied to solve resource constrained project scheduling (RCPS). GA's task is to find the best schedule. Discussed approach has used CSP in order to overcome the existing inconsistencies in activities precedence and resources conflicts. A full state CSP with min-conflict heuristic has been used for solving precedence conflicts. And a simple iterative CSP is used to resolve the resource conflicts.
{"title":"Finding a hybrid genetic algorithm-constraint satisfaction problem based solution for resource constrained project scheduling","authors":"M. A. Rigi, S. Mohammadi","doi":"10.1109/ICET.2009.5353201","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353201","url":null,"abstract":"Project scheduling has attracted many researchers in recent years. It is about single-item or small batch production where scarce resources have to be met when scheduling dependent activities over time. Because of high complexity of the problem uninformed search strategies cannot solve the problem optimally. This paper proposes a new evolutionary approach to resource constrained project scheduling problem. Hybrid genetic algorithm (GA)-constraint satisfaction problem (CSP) has been applied to solve resource constrained project scheduling (RCPS). GA's task is to find the best schedule. Discussed approach has used CSP in order to overcome the existing inconsistencies in activities precedence and resources conflicts. A full state CSP with min-conflict heuristic has been used for solving precedence conflicts. And a simple iterative CSP is used to resolve the resource conflicts.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126493076","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}