{"title":"A novel technique to protect multicast communication over WDM mesh networks","authors":"S. Barat, T. De","doi":"10.1109/ICRCICN.2016.7813642","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813642","url":null,"abstract":"Protecting communication from network failure is a major concern in current days. Here we have proposed an efficient algorithm which provides full protection over single link failure in a WDM optical fiber network with limited wavelength channels and reduces blocking probability by reducing backup wavelength channel requirement, thus it maximizes throughput. In this paper at first we have formulated the multicast protection problem and then proposed our algorithm which reduces the wavelength channel requirement by scatter minimization technique. Finally, we have shown the efficiency of the proposed technique through simulation over physical optical fiber mesh network model.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121440416","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":"Single electron threshold logic based Feynman gate implementation","authors":"Arpita Ghosh, A. Jain, N. Singh, S. Sarkar","doi":"10.1109/ICRCICN.2016.7813668","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813668","url":null,"abstract":"The paper presents design and simulation of, one of the quantum reversible gates, the Feynman gate, using the single electron threshold logic gate. One of the most emerging areas in quantum computing is the application of reversible gates in computational circuits for increasing the computational efficiency. Here the presented approach combines the advantages of the single electron threshold logic as well as the properties of the reversible gate. The stability of the circuit is also discussed.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129877337","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":"Reflective SIFT for improving the detection of copy-move image forgery","authors":"Vanita Agarwal, V. Mane","doi":"10.1109/ICRCICN.2016.7813636","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813636","url":null,"abstract":"Due to technology advancement the digital images are losing authenticity. Because of this different detection techniques are put forward. They check for the Genuinity of the images. We need to take care of image forgery. The images can be scaled, rotated, and flipped (mirror reflected). SIFT (Scale invariant feature transform) is mostly used to match images. But it fails for flipped images. A framework, mirror-reflection invariant feature transform (MIFT) is presented. Here, we will learn how MIFT improvise SIFT. The performance evaluation is demonstrated on various databases such as MICC-F2000 and CASIA V2.0.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132061526","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":"Cuckoo search algorithm for constraint satisfaction and optimization","authors":"D. Majumdar, Subhasis Mallick","doi":"10.1109/ICRCICN.2016.7813662","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813662","url":null,"abstract":"This paper presents new approach to apply population based Cuckoo search algorithm to a Constraint Satisfaction Problem (CSP). CSP is a powerful paradigm which includes many complex combinatorial optimization problems like scheduling, planning or configuration problems. These problems are defined by a set of variables and a set of constraints. We have considered a real world application Course Timetabling (CTT) problem which is a well-known Constraint Satisfaction Problem. CTT requires scheduling number of subjects, teachers and rooms to pre-specified time slots in order to satisfy several constraints. There are few hard constrains which must satisfy by the feasible solutions and then it will try to optimize the solution by satisfying maximum soft constraints. In this paper CTT problem is solved by Cuckoo search algorithm and compare with heuristic local search techniques Hill Climbing. Our approach for CTT problem is able to solve large problems quickly by returning a roster if it is feasible and the techniques are fundamentally more general than the specific problem studied here.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130090766","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":"Proposal for ranking nodes of neural network using activity index","authors":"Sayan Biswas","doi":"10.1109/ICRCICN.2016.7813660","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813660","url":null,"abstract":"Neuron form the basic computation unit of brain. These cells form connection with one another in the brain and form network in which information is processed. Immense information processing ability of neural network is attributed to its exceptional parallel processing. Neuron in network fires spikes which travels and effect other neurons in the network as well. Brain cultures of rat embryos are made on multi electrode array dish. MEA dish facilitates study of network topology as it allows recording from population of neuron. Time of spike occurrences in the network was recorded along with the electrode from which activity was recorded. For analysis of network related activity of dynamic network of neurons, the proposed framework ranks nodes of network based on two paradigms and defines a parameter activity index. Activity index takes into account the activity of neuron and reports the changing of activity hub of the neuron network with time. A comparative study is done on the result of two paradigms.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"20 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114121119","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 handwritten bengali consonants recognition scheme based on the detection of pattern primitives","authors":"Priyanka Das, Tanmoy Dasgupta, S. Bhattacharya","doi":"10.1109/ICRCICN.2016.7813634","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813634","url":null,"abstract":"The present work demonstrates a novel scheme for recognising Bengali handwritten consonants by exploring the primitive set of strokes that construct the characters. The Bengali consonants are first manually analysed in order to decompose them into their constituent pattern primitives. Once an exhaustive list of such primitives are prepared, a scheme based on mathematical morphology is devised to identify their existence in the scanned images of the handwritten characters. The characters are identified on the basis of the detected set of primitives. Although, the scheme involves multiple iterations, it runs reasonably fast and doesn't require any kind of training.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124259558","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}