Pub Date : 2016-01-01DOI: 10.1504/IJCSE.2016.10007955
Xiaoyun Xia, Xinsheng Lai, Chen Yi
TSP(1,2) problem is a special case of the travelling salesperson problem which is NP-hard. Many heuristics including evolutionary algorithms (EAs) are proposed to solve the TSP(1,2) problem. However, we know little about the performance of the EAs for the TSP(1,2) problem. This paper presents an approximation analysis of the (1+1) EA on this problem. It is shown that both the (1+1) EA and (µ + λ) EA can obtain 3/2 approximation ratio for this problem in expected polynomial runtime O(n3) and O ((µ/λ)n3 + n) , respectively. Furthermore, we prove that the (1+1) EA can provide a much tighter upper bound than a simple ACO on the TSP(1,2) problem.
{"title":"The analysis of evolutionary optimisation on the TSP(1,2) problem","authors":"Xiaoyun Xia, Xinsheng Lai, Chen Yi","doi":"10.1504/IJCSE.2016.10007955","DOIUrl":"https://doi.org/10.1504/IJCSE.2016.10007955","url":null,"abstract":"TSP(1,2) problem is a special case of the travelling salesperson problem which is NP-hard. Many heuristics including evolutionary algorithms (EAs) are proposed to solve the TSP(1,2) problem. However, we know little about the performance of the EAs for the TSP(1,2) problem. This paper presents an approximation analysis of the (1+1) EA on this problem. It is shown that both the (1+1) EA and (µ + λ) EA can obtain 3/2 approximation ratio for this problem in expected polynomial runtime O(n3) and O ((µ/λ)n3 + n) , respectively. Furthermore, we prove that the (1+1) EA can provide a much tighter upper bound than a simple ACO on the TSP(1,2) problem.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"216 1","pages":"261-268"},"PeriodicalIF":2.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74959518","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}
S. Yashaswini, Soumya Halagur, Fazil Khan, S. Rangaswamy
Transmitting data with water as the medium is called underwater communication. Electromagnetic signals are better attenuated in water than sound. Hence it is the most reliable and versatile means of communication underwater. The acoustic signals will be affected by ocean driven noise during transmission. Ambient noise is the background noise which has to be subtracted from the acoustic signal for smooth transmission. Hence the recognition and reduction of ambient noise is the essential part of underwater signal transmission. Studies and research are being carried out extensively in this area. There are many works reported and the research is still in progress. This literature survey presents the work done on the research front of ambient noise affecting acoustic signals.
{"title":"A Literature Survey on Ambient Noise Analysis For underwater Acoustic Signals","authors":"S. Yashaswini, Soumya Halagur, Fazil Khan, S. Rangaswamy","doi":"10.26472/IJCES.V1I7.37","DOIUrl":"https://doi.org/10.26472/IJCES.V1I7.37","url":null,"abstract":"Transmitting data with water as the medium is called underwater communication. Electromagnetic signals are better attenuated in water than sound. Hence it is the most reliable and versatile means of communication underwater. The acoustic signals will be affected by ocean driven noise during transmission. Ambient noise is the background noise which has to be subtracted from the acoustic signal for smooth transmission. Hence the recognition and reduction of ambient noise is the essential part of underwater signal transmission. Studies and research are being carried out extensively in this area. There are many works reported and the research is still in progress. This literature survey presents the work done on the research front of ambient noise affecting acoustic signals.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"1 1","pages":"1-9"},"PeriodicalIF":2.0,"publicationDate":"2015-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81391013","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}
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods.
无线传感器网络由多个分布式传感器节点组成。它用于几种环境应用、军事应用和与健康有关的应用。为了延长传感器节点的生命周期，设计高效的路由协议至关重要。在以数据为中心的无线传感器网络应用中，对节能数据采集的研究大多是由LEACH (Low energy Adaptive Clustering Hierarchy)方案推动的。它允许在传感器节点之间轮换簇头角色，并尝试在网络上分配能量消耗。这种角色旋转的传感器节点的选择对网络的能量效率有很大影响。一些路由协议的缺点是由于其局部簇头的随机旋转而导致集群分布不均匀。本文综述了无线传感器网络中现有的几种高效簇头选择方法。提出了一种节能的簇头选择方法，该方法减少了簇头选择和替换成本，最终提高了网络的生存期。与现有方法相比，该方法可提高网络的使用寿命。
{"title":"Cluster Head Selection for in Wireless Sensor Networks","authors":"A. S. Raval","doi":"10.26472/IJCES.V1I3.32","DOIUrl":"https://doi.org/10.26472/IJCES.V1I3.32","url":null,"abstract":"Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"10 1","pages":"6"},"PeriodicalIF":2.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84458571","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}
{"title":"A Survey of Image Based Steganography","authors":"V. Rabara, Aditya Goswami","doi":"10.26472/IJCES.V1I2.11","DOIUrl":"https://doi.org/10.26472/IJCES.V1I2.11","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"114 1","pages":"1"},"PeriodicalIF":2.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77143487","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}
{"title":"Image Steganography Techniques","authors":"R. Sheth, Rashmi M. Tank","doi":"10.26472/IJCES.V1I2.13","DOIUrl":"https://doi.org/10.26472/IJCES.V1I2.13","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"10 1","pages":"10"},"PeriodicalIF":2.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87241492","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}
{"title":"A Survey of Brain Chip with Functionality and Benefits","authors":"Kalsariya Pradip","doi":"10.26472/IJCES.V1I2.12","DOIUrl":"https://doi.org/10.26472/IJCES.V1I2.12","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"68 1","pages":"5"},"PeriodicalIF":2.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76336197","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}
The term "morphing" is used to describe the combination of generalized image warping with a crossdissolve between image elements. The term is derived from "image metamorphosis". Morphing is an image processing technique typically used as an animation tool for the metamorphosis from one image to another. The idea is to specify a warp that distorts the first image into the second. Its inverse will distort the second image into the first..The morph process consists of warping two images so that they have the same "shape", and then cross dissolving the resulting images. Cross- dissolving is the major problem as how to warp an image. In this paper I have concentrated on one of the methodology of image morphing named “Mesh Warping”.
{"title":"A Basic Knowledge of Image Morphing","authors":"Aakanksha Patel","doi":"10.26472/ijces.v1i2.21","DOIUrl":"https://doi.org/10.26472/ijces.v1i2.21","url":null,"abstract":"The term \"morphing\" is used to describe the combination of generalized image warping with a crossdissolve between image elements. The term is derived from \"image metamorphosis\". Morphing is an image processing technique typically used as an animation tool for the metamorphosis from one image to another. The idea is to specify a warp that distorts the first image into the second. Its inverse will distort the second image into the first..The morph process consists of warping two images so that they have the same \"shape\", and then cross dissolving the resulting images. Cross- dissolving is the major problem as how to warp an image. In this paper I have concentrated on one of the methodology of image morphing named “Mesh Warping”.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"21 1","pages":"4"},"PeriodicalIF":2.0,"publicationDate":"2015-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87357166","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}
Till now many algorithms are published for fingerprint recognition and these algorithms has different accuracy rate. This paper consists of information of about fingerprint (biometrics) recognition. The novel algorithm is considered for thinning process. Whole process of recognition is explained from image capturing to verification. The image captured is first converted to gray scale then image enrichment is done then thinning process take over charge which is main process then last process which is also equally important as thinning process is feature extraction which extracts ridge ending, bifurcation, and dot. The accuracy depends on the result of the three main process namely pre-processing, thinning process and feature extraction.
{"title":"A Study on Fingerprint (biometrics) Recognition","authors":"Urvik Patel","doi":"10.26472/IJCES.V1I2.22","DOIUrl":"https://doi.org/10.26472/IJCES.V1I2.22","url":null,"abstract":"Till now many algorithms are published for fingerprint recognition and these algorithms has different accuracy rate. This paper consists of information of about fingerprint (biometrics) recognition. The novel algorithm is considered for thinning process. Whole process of recognition is explained from image capturing to verification. The image captured is first converted to gray scale then image enrichment is done then thinning process take over charge which is main process then last process which is also equally important as thinning process is feature extraction which extracts ridge ending, bifurcation, and dot. The accuracy depends on the result of the three main process namely pre-processing, thinning process and feature extraction.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"20 1","pages":"6"},"PeriodicalIF":2.0,"publicationDate":"2015-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86071903","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}
Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.
{"title":"Comparative Analysis of Cryptographic Algorithms and Advanced Cryptographic Algorithms","authors":"Meghna H. Vekariya","doi":"10.26472/IJCES.V1I1.20","DOIUrl":"https://doi.org/10.26472/IJCES.V1I1.20","url":null,"abstract":"Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"102 1","pages":"1-8"},"PeriodicalIF":2.0,"publicationDate":"2015-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87661219","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}
Intrusion Detection Systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting malicious attacks over the network. Intrusion detection systems (IDSs) are designed and installed to aid in deterring or mitigating the damage that can be caused by hacking, or breaking into sensitive IT systems. . The attacks can come from outsider attackers on the Internet, authorized insiders who misuse the privileges that have been given them and unauthorized insiders who attempt to gain unauthorized privileges. IDSs cannot be used in isolation, but must be part of a larger framework of IT security measures. Essential to almost every intrusion detection system is the ability to search through packets and identify content that matches known attacks. Space and time efficient string matching algorithms are therefore important for identifying these packets at line rate. In this paper we examine string matching algorithm and their use for Intrusion Detection.
{"title":"Efficient String Matching Algorithm for Intrusion Detection","authors":"Bhargav B. Patel","doi":"10.26472/IJCES.V1I1.17","DOIUrl":"https://doi.org/10.26472/IJCES.V1I1.17","url":null,"abstract":"Intrusion Detection Systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting malicious attacks over the network. Intrusion detection systems (IDSs) are designed and installed to aid in deterring or mitigating the damage that can be caused by hacking, or breaking into sensitive IT systems. . The attacks can come from outsider attackers on the Internet, authorized insiders who misuse the privileges that have been given them and unauthorized insiders who attempt to gain unauthorized privileges. IDSs cannot be used in isolation, but must be part of a larger framework of IT security measures. Essential to almost every intrusion detection system is the ability to search through packets and identify content that matches known attacks. Space and time efficient string matching algorithms are therefore important for identifying these packets at line rate. In this paper we examine string matching algorithm and their use for Intrusion Detection.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"21 1","pages":"18-26"},"PeriodicalIF":2.0,"publicationDate":"2015-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86576814","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
扫码关注我们
求助内容：
应助结果提醒方式：