Active noise control accuracy depends on how much destructive interference exists between the primary noise and the noise (anti noise) generated by secondary source. In this paper firstly multilayer perceptron (MLP) neural network is designed and trained with extracted features of noise signals for classification and then Empirical Mode Decomposition (EMD) is used for active noise control. The noise signals of m109 tank and F16 cockpit are selected from SPIB database. The results of simulation show that the EMD technique is capable of suppressing the non linear and non stationary noise signals. The EMD technique has performed well in noise attenuation.
{"title":"Active Noise Control Using Intrinsic Mode Function Technique","authors":"Neha Narang, M. Sharma, R. Vig","doi":"10.1109/CICN.2013.52","DOIUrl":"https://doi.org/10.1109/CICN.2013.52","url":null,"abstract":"Active noise control accuracy depends on how much destructive interference exists between the primary noise and the noise (anti noise) generated by secondary source. In this paper firstly multilayer perceptron (MLP) neural network is designed and trained with extracted features of noise signals for classification and then Empirical Mode Decomposition (EMD) is used for active noise control. The noise signals of m109 tank and F16 cockpit are selected from SPIB database. The results of simulation show that the EMD technique is capable of suppressing the non linear and non stationary noise signals. The EMD technique has performed well in noise attenuation.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116377393","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}
One of the most important problems in controlling robot locomotion, is how to generate an online trajectory for robots with a large number of degrees of freedom. In this paper, we present a biomimetic approach which is based on Central Pattern Generator (CPG) inspired from the lamprey to solve this problem. CPG is a neural network found in animal and has the ability of producing rhythmic pattern without receiving rhythmic input. We used a recurrent neural network(RNN) to model the CPG and proposed the genetic algorithm to train the RNN to follow a predefined oscillatory pattern. It is furthermore demonstrated that recurrent neural networks do indeed exhibit oscillatory behavior and may in this way be used to imitate the function of the CPG responsible for locomotion in animate creatures.
{"title":"A Recurrent Neural Network Model for Lamprey-Like Robot Movement","authors":"Bassam Daya, M. Chahine, R. Awad","doi":"10.1109/CICN.2013.72","DOIUrl":"https://doi.org/10.1109/CICN.2013.72","url":null,"abstract":"One of the most important problems in controlling robot locomotion, is how to generate an online trajectory for robots with a large number of degrees of freedom. In this paper, we present a biomimetic approach which is based on Central Pattern Generator (CPG) inspired from the lamprey to solve this problem. CPG is a neural network found in animal and has the ability of producing rhythmic pattern without receiving rhythmic input. We used a recurrent neural network(RNN) to model the CPG and proposed the genetic algorithm to train the RNN to follow a predefined oscillatory pattern. It is furthermore demonstrated that recurrent neural networks do indeed exhibit oscillatory behavior and may in this way be used to imitate the function of the CPG responsible for locomotion in animate creatures.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882667","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}
Web Usage Data is related to web activity, the majority of the techniques that have been used for pattern discovery from Web Usage Data are clustering methods due to their limitations this paper proposes a novel partition based approach for dynamically grouping Web users based on their Web access patterns using ART1 NN clustering algorithm. In e-commerce applications, clustering methods are used for the purpose of generating marketing strategies, product offerings, personalization, web site adaptation and also used for preload web pages which are likely to be accessed in near future.
{"title":"Clustering of Preprocessed Web Usage Data Using ART1 Neural Network and Comparative Analysis of ART1, K-Means and SOM Clustering Techniques","authors":"H. Yogish, G. Raju","doi":"10.1109/CICN.2013.73","DOIUrl":"https://doi.org/10.1109/CICN.2013.73","url":null,"abstract":"Web Usage Data is related to web activity, the majority of the techniques that have been used for pattern discovery from Web Usage Data are clustering methods due to their limitations this paper proposes a novel partition based approach for dynamically grouping Web users based on their Web access patterns using ART1 NN clustering algorithm. In e-commerce applications, clustering methods are used for the purpose of generating marketing strategies, product offerings, personalization, web site adaptation and also used for preload web pages which are likely to be accessed in near future.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123394153","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}
This paper contains the linear time varying systems with discrete time sliding mode control with modified switching function. The changed sliding surface improves control input in the initial phase and reduces the chattering with improved robustness. Also the system state is uniformly eventually bounded with better asymptotic convergence under the existence of time varying disturbances.
{"title":"A Discrete-Time Sliding Mode Controller with Modified Function for Linear Time-Varying Systems","authors":"Shalabh Agarwal, Rajkumar, V. Deolia, V. Goyal","doi":"10.1109/CICN.2013.55","DOIUrl":"https://doi.org/10.1109/CICN.2013.55","url":null,"abstract":"This paper contains the linear time varying systems with discrete time sliding mode control with modified switching function. The changed sliding surface improves control input in the initial phase and reduces the chattering with improved robustness. Also the system state is uniformly eventually bounded with better asymptotic convergence under the existence of time varying disturbances.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124919576","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 propose a fuzzy based routing algorithm in which the link cost are dynamically assigned using a fuzzy system. Based on a set of fuzzy rules, link cost is dynamically assigned depending upon the current condition of the network. The proposed fuzzy scheme determines the integrity of a link given the current congestion state calculated via the delay experienced in the network and the offered load on the network. Delay and Queue length are the two inputs to the Fuzzy system. Delay was estimated by the time taken for the packets to travel between nodes and queue length is the number of packets waiting in the queue. The cost of a link for certain interval is the output of the fuzzy system. Simulations results showed that the fuzzy scheme offered improved performance in congestion avoidance.
{"title":"Fuzzy Based Routing Algorithm for Congestion Control in Internet","authors":"N. Aggarwal, Deepak Gaur, Kunal Gupta","doi":"10.1109/CICN.2013.67","DOIUrl":"https://doi.org/10.1109/CICN.2013.67","url":null,"abstract":"In this paper we propose a fuzzy based routing algorithm in which the link cost are dynamically assigned using a fuzzy system. Based on a set of fuzzy rules, link cost is dynamically assigned depending upon the current condition of the network. The proposed fuzzy scheme determines the integrity of a link given the current congestion state calculated via the delay experienced in the network and the offered load on the network. Delay and Queue length are the two inputs to the Fuzzy system. Delay was estimated by the time taken for the packets to travel between nodes and queue length is the number of packets waiting in the queue. The cost of a link for certain interval is the output of the fuzzy system. Simulations results showed that the fuzzy scheme offered improved performance in congestion avoidance.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121720140","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 a business oriented concept to provide online IT resources and IT services on demand using pay per use model where main goal of cloud service provider is to use cloud computing resources efficiently and gain profits marginally. One of the challenging areas in cloud computing is frequent optimization of cloud server. It mainly concerns with the load balancing of cloud data centers to improve efficiency of the host machine and minimize number of active host machine to support green computing concept. To balance the load of entire data center, we need to transfer the virtual machines of the overloaded host to the light weighted host using migration techniques. In this paper, we introduce a threshold based Dynamic compare and balance algorithm (DCABA) for cloud server optimization. Unlike the traditional server optimization strategies which consider only load balancing and scheduling of resources based on the usage of CPU, RAM and BW in physical servers, DCABA also minimizes the number of host machines to be powered on, for reducing the cost of cloud services. Our approach can serve the purpose of service cost reduction in cloud industry with effective utilization of available resources.
{"title":"Cloud Server Optimization with Load Balancing and Green Computing Techniques Using Dynamic Compare and Balance Algorithm","authors":"Yatendra Sahu, R. K. Pateriya, R. Gupta","doi":"10.1109/CICN.2013.114","DOIUrl":"https://doi.org/10.1109/CICN.2013.114","url":null,"abstract":"Cloud computing is a business oriented concept to provide online IT resources and IT services on demand using pay per use model where main goal of cloud service provider is to use cloud computing resources efficiently and gain profits marginally. One of the challenging areas in cloud computing is frequent optimization of cloud server. It mainly concerns with the load balancing of cloud data centers to improve efficiency of the host machine and minimize number of active host machine to support green computing concept. To balance the load of entire data center, we need to transfer the virtual machines of the overloaded host to the light weighted host using migration techniques. In this paper, we introduce a threshold based Dynamic compare and balance algorithm (DCABA) for cloud server optimization. Unlike the traditional server optimization strategies which consider only load balancing and scheduling of resources based on the usage of CPU, RAM and BW in physical servers, DCABA also minimizes the number of host machines to be powered on, for reducing the cost of cloud services. Our approach can serve the purpose of service cost reduction in cloud industry with effective utilization of available resources.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114584351","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}
This paper describes the implementation of unsupervised speaker segmentation and clustering system. Main objective of the work presented in this paper is to study the performance of speaker diarization system using a new feature-set called Temporal Energy of Subband Cepstral Coefficients (TESBCC) and Pitch based features. The system first classifies the audio signal into speech and nonspeech signal using average zero crossing rate (ZCR), followed by a gender clssifier stage. Speaker change is first roughly detected using Hotelling T2 distance metric and then the Bayesian information criterion (BIC) is used to validate the potential speaker change point to reduce the false alarm rate. The bottom-up approach is used for speaker clustering. The performance of the speaker segmentation and clustering system using TESBCC is compared with that using MFCC.
{"title":"Unsupervised Speaker Segmentation and Clustering Using TESBCC and Pitch Based Features","authors":"J. Naresh, R. S. Holambe, T. Basu","doi":"10.1109/CICN.2013.142","DOIUrl":"https://doi.org/10.1109/CICN.2013.142","url":null,"abstract":"This paper describes the implementation of unsupervised speaker segmentation and clustering system. Main objective of the work presented in this paper is to study the performance of speaker diarization system using a new feature-set called Temporal Energy of Subband Cepstral Coefficients (TESBCC) and Pitch based features. The system first classifies the audio signal into speech and nonspeech signal using average zero crossing rate (ZCR), followed by a gender clssifier stage. Speaker change is first roughly detected using Hotelling T2 distance metric and then the Bayesian information criterion (BIC) is used to validate the potential speaker change point to reduce the false alarm rate. The bottom-up approach is used for speaker clustering. The performance of the speaker segmentation and clustering system using TESBCC is compared with that using MFCC.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128296858","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}
A data warehouse (DW) contains many views accessed by different queries. Amongst the most important decisions in designing a DW is the selection of views to materialize for efficiently supporting the process of decision making. Materialized views are advantageous because they provide faster access to data and enhance the query performance. The major factors involved in materialization of views include query processing cost and view maintenance cost. Materialized views are kept up to date by using various techniques viz. view selection, view synchronization, view maintenance and view adaptation. Selection of the materialized views is, however, one of the most vital tasks in data warehousing environment in order to provide optimal efficiency by reducing query response time and query processing as well. In this paper, we present various approaches of view selection in data warehousing environment that have been proposed in the past. We have provided a comprehensive study on research works of many authors on certain important parameters and presented a comparative analysis in tabular format.
{"title":"A Comparative Study of Materialised View Selection in Data Warehouse Environment","authors":"Alka, A. Gosain","doi":"10.1109/CICN.2013.100","DOIUrl":"https://doi.org/10.1109/CICN.2013.100","url":null,"abstract":"A data warehouse (DW) contains many views accessed by different queries. Amongst the most important decisions in designing a DW is the selection of views to materialize for efficiently supporting the process of decision making. Materialized views are advantageous because they provide faster access to data and enhance the query performance. The major factors involved in materialization of views include query processing cost and view maintenance cost. Materialized views are kept up to date by using various techniques viz. view selection, view synchronization, view maintenance and view adaptation. Selection of the materialized views is, however, one of the most vital tasks in data warehousing environment in order to provide optimal efficiency by reducing query response time and query processing as well. In this paper, we present various approaches of view selection in data warehousing environment that have been proposed in the past. We have provided a comprehensive study on research works of many authors on certain important parameters and presented a comparative analysis in tabular format.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127076757","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}
This paper demonstrates the elementary and basic functioning, noteworthy limitations of the existing scenario, the proposed scheme for Endpoint based Call Admission Control for the Voice over Internet Protocol over IEEE 802.11 Wireless Local Area Network for removing the existing issues and flaws, and it's implementation for proving its necessity as well as importance in the real time scenario. According to the results obtained, the proposed scheme for Call Admission Control is found more efficient, reliable, improved in terms of Quality of Service, overcoming the flaws of the present scenario, and delivering the effective test results, when it was being evaluated on experimental test bed, with the added functionality of Retransmission Timer as a main component.
{"title":"Simulation of Endpoint Based Call Admission Control Using Retransmission Timer","authors":"Amar Saraswat, Kunal Gupta","doi":"10.1109/CICN.2013.53","DOIUrl":"https://doi.org/10.1109/CICN.2013.53","url":null,"abstract":"This paper demonstrates the elementary and basic functioning, noteworthy limitations of the existing scenario, the proposed scheme for Endpoint based Call Admission Control for the Voice over Internet Protocol over IEEE 802.11 Wireless Local Area Network for removing the existing issues and flaws, and it's implementation for proving its necessity as well as importance in the real time scenario. According to the results obtained, the proposed scheme for Call Admission Control is found more efficient, reliable, improved in terms of Quality of Service, overcoming the flaws of the present scenario, and delivering the effective test results, when it was being evaluated on experimental test bed, with the added functionality of Retransmission Timer as a main component.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129787510","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}
Beer Pratap Singh Tomar, Vijayshri Chaurasia, J. Yadav, B. Pandey
This paper, deals with Latch Free Clock Gating technique for reduction of clock power and dynamic power consumption in ITC'99 bo1 Benchmark circuit and we have compared power reduction at different device operating frequencies. Without latch free clock gating technique in b01 benchmark circuit the Contribution of Clock power was 37.50%, 37.64%, 4.46%, 38.75% and 38.76% of total dynamic power when device is operating at frequency 100MHz, 1GHz, 10GHz, 100GHz and 1 THz respectively. After implementation of latch free clock gating technique, In b01 benchmark circuit, Clock power contribution in total dynamic power reduces to 1.96%, 1.98%, 1.93% and 1.92%, when device operating frequency is 1GHz, 10GHz, 100GHz and 1 THz respectively. We synthesized this device on 40-nm vertex-6 this technique also reduces significantly IOs power. We have shown last results only at two operating frequency i.e. 10GHz and 100GHz. At operating frequency of 1 THz, the proposed design results 97.08 % reduction in clock power, 7.28% reduction in IOs power and 44% reduction in dynamic power as compare d to ITC'99 b01 benchmark circuit without latch free clock gating technique.
{"title":"Power Reduction of ITC'99-b01 Benchmark Circuit Using Clock Gating Technique","authors":"Beer Pratap Singh Tomar, Vijayshri Chaurasia, J. Yadav, B. Pandey","doi":"10.1109/CICN.2013.93","DOIUrl":"https://doi.org/10.1109/CICN.2013.93","url":null,"abstract":"This paper, deals with Latch Free Clock Gating technique for reduction of clock power and dynamic power consumption in ITC'99 bo1 Benchmark circuit and we have compared power reduction at different device operating frequencies. Without latch free clock gating technique in b01 benchmark circuit the Contribution of Clock power was 37.50%, 37.64%, 4.46%, 38.75% and 38.76% of total dynamic power when device is operating at frequency 100MHz, 1GHz, 10GHz, 100GHz and 1 THz respectively. After implementation of latch free clock gating technique, In b01 benchmark circuit, Clock power contribution in total dynamic power reduces to 1.96%, 1.98%, 1.93% and 1.92%, when device operating frequency is 1GHz, 10GHz, 100GHz and 1 THz respectively. We synthesized this device on 40-nm vertex-6 this technique also reduces significantly IOs power. We have shown last results only at two operating frequency i.e. 10GHz and 100GHz. At operating frequency of 1 THz, the proposed design results 97.08 % reduction in clock power, 7.28% reduction in IOs power and 44% reduction in dynamic power as compare d to ITC'99 b01 benchmark circuit without latch free clock gating technique.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121184437","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
扫码关注我们
求助内容：
应助结果提醒方式：