2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)最新文献_第2页

An antenna array for scanning applications in ISM band 一种用于ISM波段扫描应用的天线阵列

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813547

G. D. Suryachand, Ajay Kancharla, Zaheer Shaik

引用次数: 1

In-memory representations for mining big graphs 用于挖掘大图的内存表示

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813650

Shruti Goyal

引用次数: 0

Effect of equivalent circuit parameters on current-voltage characteristics in single electron transistor 等效电路参数对单电子晶体管电流-电压特性的影响

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813665

A. Deyasi, Ritabrata Chakraborty, Arkadeep Paul, S. Nayak

引用次数: 2

SLHAR: A supervised learning approach for homophone ambiguity reduction from speech recognition system 语音识别系统中同音字歧义减少的监督学习方法

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813543

P. Ghosh, T. S. Chingtham, M. Ghose

引用次数: 4

Image thresholding using LBP and GA-based optimal parameter selection for 2D Tsallis-Havrda-Charvat entropy 基于LBP和ga的二维Tsallis-Havrda-Charvat熵最优参数选择的图像阈值分割

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813637

Rakhi Tewari, S. Dhar, Hiranmoy Roy

{"title":"Image thresholding using LBP and GA-based optimal parameter selection for 2D Tsallis-Havrda-Charvat entropy","authors":"Rakhi Tewari, S. Dhar, Hiranmoy Roy","doi":"10.1109/ICRCICN.2016.7813637","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813637","url":null,"abstract":"In this paper, we propose an automatic thresholding method based on 2D Tsallis-Havrda-Charvat entropy and histogram of local binary patterns (LBP). Tsallis-Havrda-Charvat entropy is extracted from 2D histogram, which is calculated by using the LBP decimal value of a pixel and the average decimal value of its local neighborhood. Few parameters influenced the thresholding results. Therefore, an automatic optimal parameter selection using GA (Genetic algorithm) has been proposed here. Based on the optimal parameter selection for 2D Tsallis-Havrda-Charvat entropy using GA and maximizing the criterion function, we obtain the best possible threshold pair. LBP histogram is adopted to capture the texture information. LBP's high performance for texture characterization helps to make our method more suitable for thresholding the images enriched with texture information. Finally, GA improved the thresholding result by selecting optimal parameters. In this paper, we test the efficiency of our thresholding method when applied to some real-world images, and experiments show that our proposed method is promising and robust in terms of efficiency.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"43 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":"127875437","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}

引用次数: 4

Enhanced TCP WestwoodNR congestion avoidance mechanism (WestwoodNRBWP) in VANET VANET中增强的TCP WestwoodNR拥塞避免机制(WestwoodNRBWP)

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813546

Alpa Barad, Kaushika Patel, P. Patel

{"title":"Enhanced TCP WestwoodNR congestion avoidance mechanism (WestwoodNRBWP) in VANET","authors":"Alpa Barad, Kaushika Patel, P. Patel","doi":"10.1109/ICRCICN.2016.7813546","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813546","url":null,"abstract":"The Transmission Control Protocol (TCP) provides continuous, consistent, congestion restricted connections over the Internet. The research presented idea gives the performance of various existing transport layer protocol over Vehicular Ad hoc Network (vAnET). One version of TCP called TCP WestwoodNR that dynamically adjusts the congestion window. TCP WestwoodNR constantly estimate the end-to-end bandwidth based on ACK reception rate. These make TCP WestwoodNR more tough to random losses due to wireless channel problems. So these research works improves the performance of TCP WestwoodNR. TCP WestwoodNR cannot bifurcate the loss that packet failure is due to congestion or random loss (link failure). To overcome the problem of TCP WestwoodNR, new Transmission Control Protocol was developed WestwoodNRBWP (Bandwidth Proportionality) which bifurcate the loss using Losses Discrimination scheme. Losses Discrimination Scheme uses last three values of RTT. After loss bifurcation, TCP WestwoodNRBWP check the network status in congestion Avoidance and according to that it set the congestion window (CWND). For the purpose of simulation of proposed algorithm TCP WestwoodNRBWP, the well known network simulator NS-2 and traffic simulator Bonn Motion are used for compare it to real TCP WestwoodNR. Simulation results prove that the future scheme achieves improved throughput and congestion window than real TCP WestwoodNR.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"25 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":"132868441","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}

引用次数: 1

Placing distributed generators in distribution system using adaptive quantum inspired evolutionary algorithm 采用自适应量子进化算法将分布式发电机置于配电系统中

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813649

G. Manikanta, Ashish Mani, H. P. Singh, D. Chaturvedi

{"title":"Placing distributed generators in distribution system using adaptive quantum inspired evolutionary algorithm","authors":"G. Manikanta, Ashish Mani, H. P. Singh, D. Chaturvedi","doi":"10.1109/ICRCICN.2016.7813649","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813649","url":null,"abstract":"Power being generated in generation system is not meeting demand at load centers, mainly due to losses occurring in distribution networks. The active power losses are reduced either by increasing the size of conductor or by changing transformer taps. However, in present scenario, Distributed Generators (DG) can also play a major role in minimization of losses in distribution network. DGs are different from central or traditional power plants, which are usually large in size and concentrated at a location whereas DGs are relatively small scale power station, which are distributed in the network. Reduction in line losses, increase in overall efficiency, peak shaving, relieved transmission and distribution congestion, environmental impacts are some of the advantages produced by suitably placing a DG in the existing system. Therefore, improved quality of power at reduced cost is the benefit gained by the consumer. However, the sizing and placement of DG in distribution network is a difficult optimization problem. In this paper an adaptive quantum inspired evolutionary algorithm approach is used for sizing and placement of DG and experimental results are compared with some `State of Art' existing algorithms, which shows that the proposed technique outperforms some of the existing techniques.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"256 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":"133336461","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}

引用次数: 12

Comparative study of camshift and KLT algorithms for real time face detection and tracking applications camshift和KLT算法在实时人脸检测和跟踪应用中的比较研究

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813552

Debmalya Chatterjee, S. Chandran

引用次数: 17

Exploiting topological structures for graph compression based on quadtrees 利用拓扑结构进行基于四叉树的图压缩

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813655

A. Chatterjee, M. Levan, C. Lanham, M. Zerrudo, M. Nelson, S. Radhakrishnan

{"title":"Exploiting topological structures for graph compression based on quadtrees","authors":"A. Chatterjee, M. Levan, C. Lanham, M. Zerrudo, M. Nelson, S. Radhakrishnan","doi":"10.1109/ICRCICN.2016.7813655","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813655","url":null,"abstract":"In the age of big data, the need for efficient data processing and computation has been in the forefront of research endeavors. The process of extracting information from huge data sets require novel storage techniques to aid the computing devices to perform necessary computation. With pervasive use of heterogeneous systems and advent of non-traditional computing units like GPUs, with limited memory, it has become relevant to underline the relevance of data storage, especially to utilize such computing devices. Graphs contain a plethora of information, and also can be used to represent data from a broad range of domains; real-world big data sets are effectively represented by graphs. Efficient graph compression is therefore essential for performing computations on large data sets. Quadtrees, generally used to represent images, can be used as an effective technique to perform compression. Using additional topological information that depict certain patterns for the data sets, further improvements can be made to the space complexity of storing graph data. In this paper we describe algorithms that take into consideration the properties of graphs, and perform compression based on quadtrees. The introduced techniques achieve up to 70% compression as compared to adjacency matrix representation; when compared to existing quadtree based compression method, the proposed algorithms achieve an additional 50% improvement. Techniques to both compress data and also perform queries on the compressed data itself are introduced and discussed in detail.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"52 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":"124898719","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}

引用次数: 11

Clustering with vague set 模糊集聚类

2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) Pub Date : 2016-09-01 DOI: 10.1109/ICRCICN.2016.7813654

Ankita Bose, Kalyani Mali

{"title":"Clustering with vague set","authors":"Ankita Bose, Kalyani Mali","doi":"10.1109/ICRCICN.2016.7813654","DOIUrl":"https://doi.org/10.1109/ICRCICN.2016.7813654","url":null,"abstract":"This article constitutes a new method of clustering. The classical concept of fuzzy logic provides the means to represent approximate knowledge. Therefore the elements which lie in the boundaries of several sets are forced to belong to any of the sets. Introduction to fuzzy sets undoubtedly increases the computational burden, so there is an extension into shadowed sets, which takes the essence of fuzzy sets and reduce the computational complexity of the fuzzy sets. Shadowed set is based on three valued logic which represents the concept of full exclusion(0), full participation(1) and uncertain. So a shadowed set comprises of the elements with full participation in the set and those which are uncertain of this set. Here we have used another set theoretic concept named as vague set, it changes the general concept of fuzzy set and it removes the uncertainty of the shadowed set. Each object of this vague set has a grade of membership whose value is a continuous sub interval of [0,1]. In this study we have proposed a set theoretic concept which combines the concept of shadowed set as well as vague set. We use the proposed concept for the clustering of synthetic data sets and real data sets. The experimental results are analyzed by both quantitative and qualitative measures.","PeriodicalId":254393,"journal":{"name":"2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"282 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120970785","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}

引用次数: 1