Research on soft computing techniques have been developed rapidly since it can be applied easily to several areas like artificial intelligence, computer science, medical science, machine learning, information technology, economics, environments, engineering, among others. In this study, we introduce an investment decision making procedure for solving investment decision making formed by interval valued intuitionistic fuzzy soft set after choosing certain opinion weighting vectors. The feasibility of our proposed investment decision making procedure in practical applications is shown by some numerical models.
{"title":"Application of Interval Valued Intuitionistic Fuzzy Soft Set in Investment Decision Making","authors":"A. Mukherjee, A. Das","doi":"10.1109/ICACC.2015.37","DOIUrl":"https://doi.org/10.1109/ICACC.2015.37","url":null,"abstract":"Research on soft computing techniques have been developed rapidly since it can be applied easily to several areas like artificial intelligence, computer science, medical science, machine learning, information technology, economics, environments, engineering, among others. In this study, we introduce an investment decision making procedure for solving investment decision making formed by interval valued intuitionistic fuzzy soft set after choosing certain opinion weighting vectors. The feasibility of our proposed investment decision making procedure in practical applications is shown by some numerical models.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129421770","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}
In this paper, we present an analytical model to find the probability density function of link life time in vehicular ad hoc networks, assuming Rayleigh fading channel conditions and vehicle speed to follow uniform probability distribution. We then investigate the impact of path loss exponent, transmit power, threshold SNR and velocity on the mean link life time. We perform Kolmogorov-Smirnov test and establish that the probability distribution of link duration can be approximated as exponential.
{"title":"A Probabilistic Model for Link Duration in Vehicular Ad Hoc Networks under Rayleigh Fading Channel Conditions","authors":"Siddharth Shelly, A. Babu","doi":"10.1109/ICACC.2015.16","DOIUrl":"https://doi.org/10.1109/ICACC.2015.16","url":null,"abstract":"In this paper, we present an analytical model to find the probability density function of link life time in vehicular ad hoc networks, assuming Rayleigh fading channel conditions and vehicle speed to follow uniform probability distribution. We then investigate the impact of path loss exponent, transmit power, threshold SNR and velocity on the mean link life time. We perform Kolmogorov-Smirnov test and establish that the probability distribution of link duration can be approximated as exponential.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129468673","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}
Reversible data hiding is a technique to embed additional message into some distortion-unacceptable cover media, such as military or medical images, in a reversible manner so that the original cover content can be perfectly restored after extraction of the hidden message. This paper presents a new method using histogram shifting that aims at reducing the embedding distortion and improving watermark payload. The embedding capacity of a histogram-based reversible data hiding technique is primarily determined by the peak height of the histogram. Recently, some studies have tried to embed data in the histogram of prediction errors by modifying the error values. Previous methods insert data only in smooth areas. But by applying the histogram modulation to the image prediction-errors and by considering their immediate pixel neighborhood, the method we propose inserts data in textured areas also. The proposed method, which can be applied to both natural and medical images, outperforms prior works in terms of payload and PSNR.
{"title":"Reversible Watermarking Using Image Content Assessment and Histogram Shifting","authors":"N. Thomas, Shiney Thomas","doi":"10.1109/ICACC.2015.18","DOIUrl":"https://doi.org/10.1109/ICACC.2015.18","url":null,"abstract":"Reversible data hiding is a technique to embed additional message into some distortion-unacceptable cover media, such as military or medical images, in a reversible manner so that the original cover content can be perfectly restored after extraction of the hidden message. This paper presents a new method using histogram shifting that aims at reducing the embedding distortion and improving watermark payload. The embedding capacity of a histogram-based reversible data hiding technique is primarily determined by the peak height of the histogram. Recently, some studies have tried to embed data in the histogram of prediction errors by modifying the error values. Previous methods insert data only in smooth areas. But by applying the histogram modulation to the image prediction-errors and by considering their immediate pixel neighborhood, the method we propose inserts data in textured areas also. The proposed method, which can be applied to both natural and medical images, outperforms prior works in terms of payload and PSNR.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132778359","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}
Jinu Joseph, N. S. Kumar, Devi M. Rema, K. P. Krishna
In this paper, the problem of direction of arrival estimation of unknown sources in under water scenario, with minimum data acquisition is investigated. The scheme is based on Compressive Sampling, an emerging technique in signal processing, which asserts that data acquisition and signal reconstruction is possible with much less number of measurements. The sparse nature of the angle spectrum is effectively utilized. The target data as received by a linear array of acoustic sensors is simulated and compressed sensing is employed prior to processing. For reconstruction of compressively sampled signals, greedy algorithms like orthogonal matching pursuit, matching pursuit and weak matching pursuit are employed. The performance of these algorithms are assessed and results are compared with conventional MUSIC algorithm.
{"title":"CS Based Acoustic Source Localization and Sparse Reconstruction Using Greedy Algorithms","authors":"Jinu Joseph, N. S. Kumar, Devi M. Rema, K. P. Krishna","doi":"10.1109/ICACC.2015.22","DOIUrl":"https://doi.org/10.1109/ICACC.2015.22","url":null,"abstract":"In this paper, the problem of direction of arrival estimation of unknown sources in under water scenario, with minimum data acquisition is investigated. The scheme is based on Compressive Sampling, an emerging technique in signal processing, which asserts that data acquisition and signal reconstruction is possible with much less number of measurements. The sparse nature of the angle spectrum is effectively utilized. The target data as received by a linear array of acoustic sensors is simulated and compressed sensing is employed prior to processing. For reconstruction of compressively sampled signals, greedy algorithms like orthogonal matching pursuit, matching pursuit and weak matching pursuit are employed. The performance of these algorithms are assessed and results are compared with conventional MUSIC algorithm.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133131699","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}
User-based Collaborative-filtering (CF) which uses the matrix to store the ratings of the user, is the most frequently used recommender technique, widely used because of its simplicity and efficient performance. Although it is extensively used, one of its major problems is that its performance decreases when the user-item matrix becomes sparse. This paper provides a novel technique to overcome sparsity by the usage of combination of graph data base and with Locality Sensitive Hashing (LSH). Graph database provide the flexibility to developer to design database without performing any normalization and LSH provide the faster way to find the nearest neighbor for the recommendation to user. Paper concludes with comparison of traditional approach with the proposed approach.
{"title":"Enhancing the Accuracy of Movie Recommendation System Based on Probabilistic Data Structure and Graph Database","authors":"Ashish Sharma, Shalini Batra","doi":"10.1109/ICACC.2015.14","DOIUrl":"https://doi.org/10.1109/ICACC.2015.14","url":null,"abstract":"User-based Collaborative-filtering (CF) which uses the matrix to store the ratings of the user, is the most frequently used recommender technique, widely used because of its simplicity and efficient performance. Although it is extensively used, one of its major problems is that its performance decreases when the user-item matrix becomes sparse. This paper provides a novel technique to overcome sparsity by the usage of combination of graph data base and with Locality Sensitive Hashing (LSH). Graph database provide the flexibility to developer to design database without performing any normalization and LSH provide the faster way to find the nearest neighbor for the recommendation to user. Paper concludes with comparison of traditional approach with the proposed approach.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114931914","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}
MANET (Mobile Ad Hoc Network) consists of mobile nodes having no fixed infrastructure. These networks have dynamic topology and all the nodes are in general autonomous. Normally network comprises of selfish individuals that are not willing to forward the packets but wants to forward their own messages. In ad hoc network throughput increases when all available nodes are used for routing and forwarding. So instead of avoiding selfish nodes from the routing path the network can effectively utilize all the existing nodes. In this research, selfishness of the nodes is studied and better security methods are proposed to ensure reliable delivery of messages. Simulation results shows that the proposed system ensures less message overhead, memory and time. Also it tries to improve the packet delivery ratio.
{"title":"SDFS: Secured Data Forwarding with Minimum Selfishness and Message Overhead in Mobile Wireless Network","authors":"Bency Wilson, K. Preetha","doi":"10.1109/ICACC.2015.41","DOIUrl":"https://doi.org/10.1109/ICACC.2015.41","url":null,"abstract":"MANET (Mobile Ad Hoc Network) consists of mobile nodes having no fixed infrastructure. These networks have dynamic topology and all the nodes are in general autonomous. Normally network comprises of selfish individuals that are not willing to forward the packets but wants to forward their own messages. In ad hoc network throughput increases when all available nodes are used for routing and forwarding. So instead of avoiding selfish nodes from the routing path the network can effectively utilize all the existing nodes. In this research, selfishness of the nodes is studied and better security methods are proposed to ensure reliable delivery of messages. Simulation results shows that the proposed system ensures less message overhead, memory and time. Also it tries to improve the packet delivery ratio.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132846375","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}
Microwave imaging is the technique used to analyze hidden objects in a structure using microwaves. The significant contrast in dielectric properties between the malignant tumors and normal fatty tissue at microwave frequencies is the driving force in the application of microwave imaging for breast tumor detection. In this paper breast is modelled as a hemisphere and spherical tumors are embedded in the breast, which is divided into different layers. Multiple receivers are placed around the composite structure for each layer and measurements are carried out at different microwave frequencies. Hence a multi-illumination and multi-frequency approach is employed for collecting scattered field, which helps in reconstruction of entire permittivity profile. The scattered field from the breast tumor model were computed by using a boundary value mode-matching (MM) approach. Then the intensity of field inside the composite structure for each layer is reconstructed from the scattered field by mode-matching Bessel function method, which is used to analyze hidden or embedded tumor. It is identified that microwave frequency range used for imaging has dependence on the permittivity of normal tissue. A new algorithm is proposed to identify the exact permittivity of the normal tissue. Further the optimum frequency range has been identified corresponding to each permittivity value. An attempt has been made to identify the minimum number of receivers required for efficient reconstruction of permittivity profile.
{"title":"A Multi-illumination Multi-frequency Approach for Early Detection of Breast Tumor by Mode-Matching Method","authors":"A. Athira, T. Anjit, P. Mythili","doi":"10.1109/ICACC.2015.78","DOIUrl":"https://doi.org/10.1109/ICACC.2015.78","url":null,"abstract":"Microwave imaging is the technique used to analyze hidden objects in a structure using microwaves. The significant contrast in dielectric properties between the malignant tumors and normal fatty tissue at microwave frequencies is the driving force in the application of microwave imaging for breast tumor detection. In this paper breast is modelled as a hemisphere and spherical tumors are embedded in the breast, which is divided into different layers. Multiple receivers are placed around the composite structure for each layer and measurements are carried out at different microwave frequencies. Hence a multi-illumination and multi-frequency approach is employed for collecting scattered field, which helps in reconstruction of entire permittivity profile. The scattered field from the breast tumor model were computed by using a boundary value mode-matching (MM) approach. Then the intensity of field inside the composite structure for each layer is reconstructed from the scattered field by mode-matching Bessel function method, which is used to analyze hidden or embedded tumor. It is identified that microwave frequency range used for imaging has dependence on the permittivity of normal tissue. A new algorithm is proposed to identify the exact permittivity of the normal tissue. Further the optimum frequency range has been identified corresponding to each permittivity value. An attempt has been made to identify the minimum number of receivers required for efficient reconstruction of permittivity profile.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132441778","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 efficiency of a router in a Network on Chip (NoC) is characterised by good performance, minimum packet latency, area and power. In this paper, we propose an adaptive deflection router for mesh NoC which offers higher speed of operation by reducing the router critical path latency. We propose a single cycle router that uses an intelligent decision making logic to store deflected flits in minimum number of side buffers. Synthesis results of the design show an overall reduction in timing latency compared to a conventional minimally buffered router with two cycle latency. Network simulation of the proposed architecture using synthetic and real application traffic reports that the average flit latency and deflection rate reduces significantly in our design compared to the state-of-the-art single cycle deflection routers.
{"title":"HiPAD: High Performance Adaptive Deflection Router for On-Chip Mesh Networks","authors":"Simi Zerine Sleeba, John Jose, M. G. Mini","doi":"10.1109/ICACC.2015.105","DOIUrl":"https://doi.org/10.1109/ICACC.2015.105","url":null,"abstract":"The efficiency of a router in a Network on Chip (NoC) is characterised by good performance, minimum packet latency, area and power. In this paper, we propose an adaptive deflection router for mesh NoC which offers higher speed of operation by reducing the router critical path latency. We propose a single cycle router that uses an intelligent decision making logic to store deflected flits in minimum number of side buffers. Synthesis results of the design show an overall reduction in timing latency compared to a conventional minimally buffered router with two cycle latency. Network simulation of the proposed architecture using synthetic and real application traffic reports that the average flit latency and deflection rate reduces significantly in our design compared to the state-of-the-art single cycle deflection routers.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121824196","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 simplicity and high performance-to-cost ratio make Ethernet, the most dominant and widely deployed LAN technology. But, a single Ethernet network cannot scale to large networks such as enterprise, campus, data center and wide area networks because of broadcast based services like Address Resolution Protocol (ARP) and Dynamic Host Configuration Protocol (DHCP). The Software-Defined Networking (SDN) based scheme SEASDN is proposed here to effectively enhance the scalability of Ethernet by suppressing broadcast traffic. In this scheme, DHCP and ARP broadcast messages are relayed through SDN controller to the destination and thus eliminating the need for broadcasting. The proposed scheme can eliminate flooding without any change to the existing hardware, software and protocols of hosts and also can detect ARP spoofing attack. The simulation results show that SEASDN is very much effective in ARP and DHCP broadcast suppression than the current SDN broadcast handling methods while reducing control plane overhead and data plane traffic significantly.
{"title":"Scalable Ethernet Architecture Using SDN by Suppressing Broadcast Traffic","authors":"Naseela Jehan, A. M. Haneef","doi":"10.1109/ICACC.2015.66","DOIUrl":"https://doi.org/10.1109/ICACC.2015.66","url":null,"abstract":"The simplicity and high performance-to-cost ratio make Ethernet, the most dominant and widely deployed LAN technology. But, a single Ethernet network cannot scale to large networks such as enterprise, campus, data center and wide area networks because of broadcast based services like Address Resolution Protocol (ARP) and Dynamic Host Configuration Protocol (DHCP). The Software-Defined Networking (SDN) based scheme SEASDN is proposed here to effectively enhance the scalability of Ethernet by suppressing broadcast traffic. In this scheme, DHCP and ARP broadcast messages are relayed through SDN controller to the destination and thus eliminating the need for broadcasting. The proposed scheme can eliminate flooding without any change to the existing hardware, software and protocols of hosts and also can detect ARP spoofing attack. The simulation results show that SEASDN is very much effective in ARP and DHCP broadcast suppression than the current SDN broadcast handling methods while reducing control plane overhead and data plane traffic significantly.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124859490","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}
Cloud computing is an emerging computing paradigm in which shared resources are provided according to the customer request at specific time. Load balancing is the process of distributing workload among various nodes of the computing system. The load can be CPU load, memory capacity, or network load. An efficient load balancing avoids a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. When Virtual Machine (VM) is overloaded with multiple tasks, these tasks are removed and migrated to the under loaded VMs of the same or different datacenter. This paper proposes a bee colony based algorithm for efficient load balancing, which is based on the foraging behavior of honey bees to balance load across VMs. In the proposed method, tasks removed from over loaded VMs are treated as honey bees and under loaded VMs are the food sources. The proposed method also considers the priorities of tasks in the waiting queues of VMs and tries to achieve minimum response time and reduced number of task migrations. The experimental result shows that there is significant improvement in the Quality of Service (QoS).
{"title":"Load Balancing of Tasks in Cloud Computing Environment Based on Bee Colony Algorithm","authors":"K. R. R. Babu, Amaya Anna Joy, P. Samuel","doi":"10.1109/ICACC.2015.47","DOIUrl":"https://doi.org/10.1109/ICACC.2015.47","url":null,"abstract":"Cloud computing is an emerging computing paradigm in which shared resources are provided according to the customer request at specific time. Load balancing is the process of distributing workload among various nodes of the computing system. The load can be CPU load, memory capacity, or network load. An efficient load balancing avoids a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. When Virtual Machine (VM) is overloaded with multiple tasks, these tasks are removed and migrated to the under loaded VMs of the same or different datacenter. This paper proposes a bee colony based algorithm for efficient load balancing, which is based on the foraging behavior of honey bees to balance load across VMs. In the proposed method, tasks removed from over loaded VMs are treated as honey bees and under loaded VMs are the food sources. The proposed method also considers the priorities of tasks in the waiting queues of VMs and tries to achieve minimum response time and reduced number of task migrations. The experimental result shows that there is significant improvement in the Quality of Service (QoS).","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125180617","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
扫码关注我们
求助内容：
应助结果提醒方式：