Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723911
Md. Shohrab Hossain, Mohammed Atiquzzaman, W. Ivancic
Mobile networks can be formed in bus, train, aircrafts, satellites with a wide variety of on-board IP-enable devices and Network Mobility (NEMO) protocols are required to support uninterrupted services to ongoing sessions. Node mobility has a direct impact on the performance evaluation of various NEMO protocols. However, most of the analysis on mobility protocols used random waypoint mobility model which does not always represent real-world movement patterns in city streets. In this paper, we have used city section mobility model, a realistic street mobility model, to analyze the performance of the basic network-mobility protocol. We have used ns-2 simulation to compare the performance of NEMO using city section and random waypoint models. Results have been obtained for average throughput, packet drop probability, end-to-end delay, handoff frequency, and signaling overhead and show significant deviation between the mobility models. Our analysis thus can help in estimating the various performance metrics of mobile network deployed in city streets.
{"title":"Performance analysis of NEMO using city section mobility model","authors":"Md. Shohrab Hossain, Mohammed Atiquzzaman, W. Ivancic","doi":"10.1109/ICCITECHN.2010.5723911","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723911","url":null,"abstract":"Mobile networks can be formed in bus, train, aircrafts, satellites with a wide variety of on-board IP-enable devices and Network Mobility (NEMO) protocols are required to support uninterrupted services to ongoing sessions. Node mobility has a direct impact on the performance evaluation of various NEMO protocols. However, most of the analysis on mobility protocols used random waypoint mobility model which does not always represent real-world movement patterns in city streets. In this paper, we have used city section mobility model, a realistic street mobility model, to analyze the performance of the basic network-mobility protocol. We have used ns-2 simulation to compare the performance of NEMO using city section and random waypoint models. Results have been obtained for average throughput, packet drop probability, end-to-end delay, handoff frequency, and signaling overhead and show significant deviation between the mobility models. Our analysis thus can help in estimating the various performance metrics of mobile network deployed in city streets.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133920362","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723854
S. Ismail, Alam Shumon, M. Amin
Grid computing organizes geographically distributed resources under a single platform and let the users access this combined power. In this paper we have discussed the application of distributed memory caching system in the Grid computing environment to improve its computational environment. For our experiment, we used Alchemi, a .net based Grid computing framework and Memcached, a distributed memory caching technique. We completed couple of experiments in this environment and they demonstrated two very important outcomes. One of the outcomes outlined that distributed memory caching technique can provide fail safe computation for the Grid environment. The second result represented the reduction of the total computational time of the Grid applications. Based on the results of these current experiments and also previous experiments completed in our distributed computing laboratory we have proposed a new technique for the Grid computing environment that can provide performance improvement as well as the fail safe Grid computing environment.
{"title":"Distributed memory caching for the fail safe computation to improve the Grid performance","authors":"S. Ismail, Alam Shumon, M. Amin","doi":"10.1109/ICCITECHN.2010.5723854","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723854","url":null,"abstract":"Grid computing organizes geographically distributed resources under a single platform and let the users access this combined power. In this paper we have discussed the application of distributed memory caching system in the Grid computing environment to improve its computational environment. For our experiment, we used Alchemi, a .net based Grid computing framework and Memcached, a distributed memory caching technique. We completed couple of experiments in this environment and they demonstrated two very important outcomes. One of the outcomes outlined that distributed memory caching technique can provide fail safe computation for the Grid environment. The second result represented the reduction of the total computational time of the Grid applications. Based on the results of these current experiments and also previous experiments completed in our distributed computing laboratory we have proposed a new technique for the Grid computing environment that can provide performance improvement as well as the fail safe Grid computing environment.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129690880","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723833
Sanchita Mal-Sarkar, I. Sikder, V. Konangi
Real-time stream data is characterized by spatial and temporal variability and is subject to unbounded or constantly evolving entities. The challenge is how to aggregate these unbounded data streams at different spaces and times to provide effective decisions making in real-time. This paper proposes a rough set-based sliding window framework for stream data aggregation. Based on current data streams, it identifies interesting spatio-temporal patterns, and generates rough set If … Then decision rules. Proposed formalism has been tested on sea surface temperature data from NOAA's TAO/TRITON project. Such a pattern-based data aggregation scheme has the potential to significantly reduce data communications in decision making.
{"title":"Spatio-temporal template discovery using rough set theory","authors":"Sanchita Mal-Sarkar, I. Sikder, V. Konangi","doi":"10.1109/ICCITECHN.2010.5723833","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723833","url":null,"abstract":"Real-time stream data is characterized by spatial and temporal variability and is subject to unbounded or constantly evolving entities. The challenge is how to aggregate these unbounded data streams at different spaces and times to provide effective decisions making in real-time. This paper proposes a rough set-based sliding window framework for stream data aggregation. Based on current data streams, it identifies interesting spatio-temporal patterns, and generates rough set If … Then decision rules. Proposed formalism has been tested on sea surface temperature data from NOAA's TAO/TRITON project. Such a pattern-based data aggregation scheme has the potential to significantly reduce data communications in decision making.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115494541","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}
Wavelength division multiplexing (WDM) optical networks are attracting more and more attention because of their ability to provide increased capacity and flexibility. Optical add-drop multiplexer (OADM) become key components for add or drop wavelengths in high bit rate optical networks. Crosstalk in OADM degrades the performance of WDM system. In this article, we have developed a fiber Bragg-grating based OADM with low crosstalk. We have also developed analytical models for relative intensity noise (RIN), bit error rate (BER) and power penalty to study the performance limitations of this OADM. Results show that crosstalk, RIN and BER of the proposed OADM are lower and provide better performance than the existing OADMs.
{"title":"Performance limitations in fiber Bragg grating based optical add-drop multiplexer due to crosstalk","authors":"M. Mahiuddin, M. S. Islam","doi":"10.4304/jnw.7.3.450-455","DOIUrl":"https://doi.org/10.4304/jnw.7.3.450-455","url":null,"abstract":"Wavelength division multiplexing (WDM) optical networks are attracting more and more attention because of their ability to provide increased capacity and flexibility. Optical add-drop multiplexer (OADM) become key components for add or drop wavelengths in high bit rate optical networks. Crosstalk in OADM degrades the performance of WDM system. In this article, we have developed a fiber Bragg-grating based OADM with low crosstalk. We have also developed analytical models for relative intensity noise (RIN), bit error rate (BER) and power penalty to study the performance limitations of this OADM. Results show that crosstalk, RIN and BER of the proposed OADM are lower and provide better performance than the existing OADMs.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123503213","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723925
M. Islam
In this paper, a Gaussian multiple input multiple output multiple eavesdropper (MIMOME) channel is considered where a transmitter communicates to a receiver in the presence of an eavesdropper. We present a technique for determining the secrecy capacity of the multiple input multiple output (MIMO) channel under Gaussian noise. We transform the degraded MIMOME channel into multiple single input multiple output (SIMO) Gaussian wire-tap channels and then use scalar approach to convert it into two equivalent multiple input single output (MISO) channels. The secrecy capacity model is then developed for the condition where the channel state information (CSI) for main channel only is known to the transmitter. The results show that the secret communication is possible when the eavesdropper channel noise is greater than a cutoff noise level. The outage probability is also analyzed of secrecy capacity is also analyzed. The effect of fading and outage probability is also analyzed.
{"title":"Secret data communication in a degraded practical multiple input multiple output multiple eavesdropper channel","authors":"M. Islam","doi":"10.1109/ICCITECHN.2010.5723925","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723925","url":null,"abstract":"In this paper, a Gaussian multiple input multiple output multiple eavesdropper (MIMOME) channel is considered where a transmitter communicates to a receiver in the presence of an eavesdropper. We present a technique for determining the secrecy capacity of the multiple input multiple output (MIMO) channel under Gaussian noise. We transform the degraded MIMOME channel into multiple single input multiple output (SIMO) Gaussian wire-tap channels and then use scalar approach to convert it into two equivalent multiple input single output (MISO) channels. The secrecy capacity model is then developed for the condition where the channel state information (CSI) for main channel only is known to the transmitter. The results show that the secret communication is possible when the eavesdropper channel noise is greater than a cutoff noise level. The outage probability is also analyzed of secrecy capacity is also analyzed. The effect of fading and outage probability is also analyzed.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123459305","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723840
M. Rahman, S. Mondal, S. K. Ghosh, M. Rahman
Multicasting is a challenging task that facilitates group communication among the nodes using the most efficient strategy to deliver the messages over each link of the network. In spite of significant research achievements in recent years, efficient and extendable multicast routing in Mobile Ad Hoc Networks (MANETs) is still a difficult issue. To enhance performance and to enable scalability we have proposed a domain-based Extendable Multicast Routing Protocol (EMRP) for hierarchical multicasting in MANET environments. In the proposed technique, each domain has a sub-source that reduces the path length between the original source and intended receiver which solute the scalability issue. We have analyzed the performance with respect to a variety of parameters for different mobility speed and group sizes. Results obtained through simulations demonstrate enhanced performance in packet delivery ratio and end-to-end delay of the proposed technique as compared to the existing ones.
{"title":"A new approach of Extendable Multicast Routing Protocol in Mobile Ad Hoc Networks","authors":"M. Rahman, S. Mondal, S. K. Ghosh, M. Rahman","doi":"10.1109/ICCITECHN.2010.5723840","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723840","url":null,"abstract":"Multicasting is a challenging task that facilitates group communication among the nodes using the most efficient strategy to deliver the messages over each link of the network. In spite of significant research achievements in recent years, efficient and extendable multicast routing in Mobile Ad Hoc Networks (MANETs) is still a difficult issue. To enhance performance and to enable scalability we have proposed a domain-based Extendable Multicast Routing Protocol (EMRP) for hierarchical multicasting in MANET environments. In the proposed technique, each domain has a sub-source that reduces the path length between the original source and intended receiver which solute the scalability issue. We have analyzed the performance with respect to a variety of parameters for different mobility speed and group sizes. Results obtained through simulations demonstrate enhanced performance in packet delivery ratio and end-to-end delay of the proposed technique as compared to the existing ones.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122725036","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723876
A. K. Mandal, M. D. Hossain, M. Nadim
Finding desire information from a large text database is one of the most important issues of modern information processing systems. In this regard different types of searching techniques are used. Though some of them are vary useful, they frequently fail to show appropriate performance when a user enters misspelled data as searching keyword. In this paper we have developed an efficient search suggestion generator using Phonetic algorithm namely, Double Metaphone Algorithm. Here we use a technique to reduce total searching comparisons by creating an index on a specific field, we have defined it as keyCode field, in a table of our database where all of the values of Code field are produced by that algorithm acted on records. Results show that generator not only quickly finds the required information but provides possible search suggestion avoiding the misspelled words entered as search key.
{"title":"Developing an efficient search suggestion generator, ignoring spelling error for high speed data retrieval using Double Metaphone Algorithm","authors":"A. K. Mandal, M. D. Hossain, M. Nadim","doi":"10.1109/ICCITECHN.2010.5723876","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723876","url":null,"abstract":"Finding desire information from a large text database is one of the most important issues of modern information processing systems. In this regard different types of searching techniques are used. Though some of them are vary useful, they frequently fail to show appropriate performance when a user enters misspelled data as searching keyword. In this paper we have developed an efficient search suggestion generator using Phonetic algorithm namely, Double Metaphone Algorithm. Here we use a technique to reduce total searching comparisons by creating an index on a specific field, we have defined it as keyCode field, in a table of our database where all of the values of Code field are produced by that algorithm acted on records. Results show that generator not only quickly finds the required information but provides possible search suggestion avoiding the misspelled words entered as search key.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"36 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120929406","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723920
Md. Akbar Hossain, S. Haque
Next generation wireless networks will be heterogeneous, where several primary users (PU e.g. licensed users) and secondary users (SU e.g. unlicensed users) can operate in the same dynamic and reconfigurable networks at a given time. The major challenge in this heterogeneous radio environment is to enable the coexistence between PU and SU which will further improve the efficient use of radio spectrum. Most of the existing coexistence techniques encounter with challenges due to lack of a priori knowledge about the primary system. Therefore Cognitive pilot channel (CPC) is a proposed approach which could enhance the coexistence by conveying some priori information. However, to achieve a peaceful coexistence it is essential to adopt a mitigation technique according to the CPC information. There is no algorithm has been described so far to integrate the CPC information with existing mitigation technique. In this paper, we proposed a novel power adaptation and integrated zone model (PAIZM) CPC algorithm for peaceful coexistence in heterogeneous networks. Moreover we have implemented and evaluated the PAIZM-CPC model as a coexistence enabler. The results show an enhancement compared with the existing coexistence techniques.
{"title":"PAIZM-CPC: Enhancement of spectrum co-existence in wireless networks","authors":"Md. Akbar Hossain, S. Haque","doi":"10.1109/ICCITECHN.2010.5723920","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723920","url":null,"abstract":"Next generation wireless networks will be heterogeneous, where several primary users (PU e.g. licensed users) and secondary users (SU e.g. unlicensed users) can operate in the same dynamic and reconfigurable networks at a given time. The major challenge in this heterogeneous radio environment is to enable the coexistence between PU and SU which will further improve the efficient use of radio spectrum. Most of the existing coexistence techniques encounter with challenges due to lack of a priori knowledge about the primary system. Therefore Cognitive pilot channel (CPC) is a proposed approach which could enhance the coexistence by conveying some priori information. However, to achieve a peaceful coexistence it is essential to adopt a mitigation technique according to the CPC information. There is no algorithm has been described so far to integrate the CPC information with existing mitigation technique. In this paper, we proposed a novel power adaptation and integrated zone model (PAIZM) CPC algorithm for peaceful coexistence in heterogeneous networks. Moreover we have implemented and evaluated the PAIZM-CPC model as a coexistence enabler. The results show an enhancement compared with the existing coexistence techniques.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121333392","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723859
Faisal Mohsin
For various reasons in recent years the interest in building quantum computers has increased gradually. To do the calculations in quantum computer we need quantum arithmetic logic unit (ALU). The building block of quantum ALU is quantum adder. In quantum computer multivalued logic is possible. In this paper a generalized circuit has been proposed to build odd base multivalued quantum full adder. A novel approach has been taken to minimize the total no. of gates. Muthukrishnan-Stroud gates and quantum shift gates have been combined to achieve the minimal circuit.
{"title":"A novel method for the synthesis of odd base quantum full adder","authors":"Faisal Mohsin","doi":"10.1109/ICCITECHN.2010.5723859","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723859","url":null,"abstract":"For various reasons in recent years the interest in building quantum computers has increased gradually. To do the calculations in quantum computer we need quantum arithmetic logic unit (ALU). The building block of quantum ALU is quantum adder. In quantum computer multivalued logic is possible. In this paper a generalized circuit has been proposed to build odd base multivalued quantum full adder. A novel approach has been taken to minimize the total no. of gates. Muthukrishnan-Stroud gates and quantum shift gates have been combined to achieve the minimal circuit.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126938715","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723823
Md. Kowsar Hossain, Md. Amjad Hossain, M. Hashem, Md. Mohsin Ali
Quantum Evolutionary Algorithm (QEA) is an optimization algorithm based on the concept of quantum computing and Particle Swarm Optimization (PSO) algorithm is a population based intelligent search technique. Both these techniques have good performance to solve optimization problems. PSEQEA combines the PSO with QEA to improve the performance of QEA and it can solve single objective optimization problem efficiently and effectively. In this paper, PSEQEA is studied to solve multi-objective Optimization (MO) problems. Some well-known non-trivial functions are used to observe the performance of PSEQEA to detect the Pareto optimal points and the shape of the Pareto front using both Fixed Weighted Aggregation method and Adaptive Weighted Aggregation method. Moreover, Vector Evaluated PSEQEA (VEPSEQEA) borrows concept from Schaffer's Vector Evaluated Genetic Algorithm (VEGA) that can also cope with MO problems. Simulation results show that PSEQEA and VEPSEQEA perform better than PSO and VEPSO to discover the Pareto frontier.
{"title":"Quantum Evolutionary Algorithm based on Particle Swarm theory in multiobjective problems","authors":"Md. Kowsar Hossain, Md. Amjad Hossain, M. Hashem, Md. Mohsin Ali","doi":"10.1109/ICCITECHN.2010.5723823","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723823","url":null,"abstract":"Quantum Evolutionary Algorithm (QEA) is an optimization algorithm based on the concept of quantum computing and Particle Swarm Optimization (PSO) algorithm is a population based intelligent search technique. Both these techniques have good performance to solve optimization problems. PSEQEA combines the PSO with QEA to improve the performance of QEA and it can solve single objective optimization problem efficiently and effectively. In this paper, PSEQEA is studied to solve multi-objective Optimization (MO) problems. Some well-known non-trivial functions are used to observe the performance of PSEQEA to detect the Pareto optimal points and the shape of the Pareto front using both Fixed Weighted Aggregation method and Adaptive Weighted Aggregation method. Moreover, Vector Evaluated PSEQEA (VEPSEQEA) borrows concept from Schaffer's Vector Evaluated Genetic Algorithm (VEGA) that can also cope with MO problems. Simulation results show that PSEQEA and VEPSEQEA perform better than PSO and VEPSO to discover the Pareto frontier.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126672350","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
扫码关注我们
求助内容：
应助结果提醒方式：