Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670742
S. Ajitha, T. V. Suresh Kumar, D. Evangelin Geetha, K. Rajnikanth
Performance is an important non functional aspect to be considered for any software system. Software Performance Engineering (SPE) is an approach to predict the performance of a software system early in the life cycle. In this paper we present a neural network model for the performance prediction of Multi-Agent system at the early stages of development. We used Feed forward back propagation neural network model for the performance prediction. The results are validated and a case study of Multi-Agent System is presented.
{"title":"Performance prediction in early stages of software systems: Artificial neural network model","authors":"S. Ajitha, T. V. Suresh Kumar, D. Evangelin Geetha, K. Rajnikanth","doi":"10.1109/ICCCCT.2010.5670742","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670742","url":null,"abstract":"Performance is an important non functional aspect to be considered for any software system. Software Performance Engineering (SPE) is an approach to predict the performance of a software system early in the life cycle. In this paper we present a neural network model for the performance prediction of Multi-Agent system at the early stages of development. We used Feed forward back propagation neural network model for the performance prediction. The results are validated and a case study of Multi-Agent System is presented.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127316827","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670540
S. Srinu, S. L. Sabat
Spectrum sensing is a critical component of the Cognitive Radio that detects the presence of primary user signal in a channel. In this paper energy detection technique based on Neyman-pearson criterion is used to detect the presence of deterministic primary user (PU) signals in the channel. We have considered three different kinds of modulated signal such as BPSK, QPSK, DVB-T (2K mode) under additive white Gaussian noise (AWGN) and Rayleigh fading channel environment as specified in IEEE 802.22 standard for validating the algorithm. The simulation result shows that the energy detector achieves the desired probability of detection (≥0.9) with probability of false alarm (≤0.1) at low signal to noise ratio (SNR) up to −8dB for QPSK and DVB-T modulated signal with sample size of 64. The algorithm is also implemented in Xilinx Virtex2pro XC2VP30 (FFG896-7) Field Programmable Gate Array (FPGA). Hardware in loop (HIL) technique is used for verifying the algorithm in FPGA. The implementation result reveals that the algorithm fits into the Virtex2pro FPGA and can execute with operating frequency between 110 to 138 MHz for different sample size of primary user signals.
{"title":"FPGA implementation of spectrum sensing based on energy detection for Cognitive Radio","authors":"S. Srinu, S. L. Sabat","doi":"10.1109/ICCCCT.2010.5670540","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670540","url":null,"abstract":"Spectrum sensing is a critical component of the Cognitive Radio that detects the presence of primary user signal in a channel. In this paper energy detection technique based on Neyman-pearson criterion is used to detect the presence of deterministic primary user (PU) signals in the channel. We have considered three different kinds of modulated signal such as BPSK, QPSK, DVB-T (2K mode) under additive white Gaussian noise (AWGN) and Rayleigh fading channel environment as specified in IEEE 802.22 standard for validating the algorithm. The simulation result shows that the energy detector achieves the desired probability of detection (≥0.9) with probability of false alarm (≤0.1) at low signal to noise ratio (SNR) up to −8dB for QPSK and DVB-T modulated signal with sample size of 64. The algorithm is also implemented in Xilinx Virtex2pro XC2VP30 (FFG896-7) Field Programmable Gate Array (FPGA). Hardware in loop (HIL) technique is used for verifying the algorithm in FPGA. The implementation result reveals that the algorithm fits into the Virtex2pro FPGA and can execute with operating frequency between 110 to 138 MHz for different sample size of primary user signals.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127907102","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670747
S. Jeeva Sathya Theesar, P. Balasubramaniam
This paper presents the stability analysis of a class of nonlinear time-varying delay systems with parameter uncertainty, through extended Takagi-Sugeno fuzzy modeling. The delay-dependent stability and robust stability criterions are presented using delay decomposition approach, in terms of linear matrix inequalities (LMIs). The time-varying delay is assumed to be bounded and continuous need not be differentiable. Simulation results are discussed to show the efficiency of the technique and compared the maximum allowable upper bound (MAUB) with literature.
{"title":"Robust stability analysis of uncertain T-S fuzzy systems with time-varying delay","authors":"S. Jeeva Sathya Theesar, P. Balasubramaniam","doi":"10.1109/ICCCCT.2010.5670747","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670747","url":null,"abstract":"This paper presents the stability analysis of a class of nonlinear time-varying delay systems with parameter uncertainty, through extended Takagi-Sugeno fuzzy modeling. The delay-dependent stability and robust stability criterions are presented using delay decomposition approach, in terms of linear matrix inequalities (LMIs). The time-varying delay is assumed to be bounded and continuous need not be differentiable. Simulation results are discussed to show the efficiency of the technique and compared the maximum allowable upper bound (MAUB) with literature.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126617811","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670732
C. Indumathi, B. Galeebathullah, O. Pandithurai
Coverage analysis defines the tracing of a program by test cases. It also helps in the testing process by finding the areas of a program not exercised by a set of test cases. Introducing new test cases to increase coverage, and determine the quantitative measure of the code, which is an indirect measure of quality. Coverage analysis provides more benefit when applied to an application that makes a lot of decisions rather than data-centric applications, such as a database application. This paper will discuss the issues that make test case coverage analysis a complicated task and how those issues are being addressed. We will describe the technique for improving the maximum coverage for test case of a program by using a data mining technique called Association rule Mining.
{"title":"Analysis of test case coverage using data mining technique","authors":"C. Indumathi, B. Galeebathullah, O. Pandithurai","doi":"10.1109/ICCCCT.2010.5670732","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670732","url":null,"abstract":"Coverage analysis defines the tracing of a program by test cases. It also helps in the testing process by finding the areas of a program not exercised by a set of test cases. Introducing new test cases to increase coverage, and determine the quantitative measure of the code, which is an indirect measure of quality. Coverage analysis provides more benefit when applied to an application that makes a lot of decisions rather than data-centric applications, such as a database application. This paper will discuss the issues that make test case coverage analysis a complicated task and how those issues are being addressed. We will describe the technique for improving the maximum coverage for test case of a program by using a data mining technique called Association rule Mining.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121080428","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670745
Raman Bhati
In this paper we have proposed a new way to achieve the optimum learning rate that can reduce the learning time of the multi layer feed forward neural network. The effect of optimum numbers of inner iterations and numbers of hidden nodes on learning time and recognition rate has been shown. The Principal Component Analysis and Multilayer Feed Forward Neural Network are applied in face recognition system for feature extraction and recognition respectively. The paper shows that the recognition rate and training time are dependent on numbers on hidden nodes. In this approach we have used variable learning rate and demonstrated its superiority over constant learning rate. We have used ORL database for all the experiments.
{"title":"Face recognition system using multi layer feed Forward Neural Networks and Principal Component Analysis with variable learning rate","authors":"Raman Bhati","doi":"10.1109/ICCCCT.2010.5670745","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670745","url":null,"abstract":"In this paper we have proposed a new way to achieve the optimum learning rate that can reduce the learning time of the multi layer feed forward neural network. The effect of optimum numbers of inner iterations and numbers of hidden nodes on learning time and recognition rate has been shown. The Principal Component Analysis and Multilayer Feed Forward Neural Network are applied in face recognition system for feature extraction and recognition respectively. The paper shows that the recognition rate and training time are dependent on numbers on hidden nodes. In this approach we have used variable learning rate and demonstrated its superiority over constant learning rate. We have used ORL database for all the experiments.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"134 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114012187","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670531
S. Robinson, R. Nakkeeran
In this paper, two dimensional Photonic Crystal square lattice circular ring resonator based Bandpass Filter (BPF) is designed by coupling in-line quasi waveguides and resonant cavity. The output efficiency of the circular ring resonator is investigated by varying size of the cavity. The normalized transmission spectra of circular Photonic Crystal Ring Resonator (PCRR) have been studied by using the Finite Difference Time Domain (FDTD) method. The Photonic Bandgap (PBG) has been calculated by Plane Wave Expansion (PWE) method. The simulation shows 100% transfer efficiency and 25 nm of bandwidth over the range of 1575 nm to 1600 nm. The impact of number of rings in the ring is also studied for determining the output efficiency and bandwidth.
{"title":"Photonic Crystal Ring Resonator based Bandpass Filter","authors":"S. Robinson, R. Nakkeeran","doi":"10.1109/ICCCCT.2010.5670531","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670531","url":null,"abstract":"In this paper, two dimensional Photonic Crystal square lattice circular ring resonator based Bandpass Filter (BPF) is designed by coupling in-line quasi waveguides and resonant cavity. The output efficiency of the circular ring resonator is investigated by varying size of the cavity. The normalized transmission spectra of circular Photonic Crystal Ring Resonator (PCRR) have been studied by using the Finite Difference Time Domain (FDTD) method. The Photonic Bandgap (PBG) has been calculated by Plane Wave Expansion (PWE) method. The simulation shows 100% transfer efficiency and 25 nm of bandwidth over the range of 1575 nm to 1600 nm. The impact of number of rings in the ring is also studied for determining the output efficiency and bandwidth.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"373 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122438056","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670598
R. Murugesan, K. Sivasakthi Balan, V. Navaneetha Kumar
An improved Clonal selection algorithm based Artificial Immune System (AIS) is given for solving Job Shop Scheduling Problem (JSSP). To reduce the optimal solution search space, a bio inspired positive selection principle is proposed to populate the initial antigen library. This proposed algorithm gives the better start up and faster converging towards the optimal solution for the given JSSP. The given algorithm has been simulated in Matlab tool and the results were compared with the Genetic Algorithm (GA) generated results for a well known bench marking problem. AIS produced optimal solution for more than 90% run which 15% produced by GA.
{"title":"Clonal selection algorithm using improved initialization for solving JSSP","authors":"R. Murugesan, K. Sivasakthi Balan, V. Navaneetha Kumar","doi":"10.1109/ICCCCT.2010.5670598","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670598","url":null,"abstract":"An improved Clonal selection algorithm based Artificial Immune System (AIS) is given for solving Job Shop Scheduling Problem (JSSP). To reduce the optimal solution search space, a bio inspired positive selection principle is proposed to populate the initial antigen library. This proposed algorithm gives the better start up and faster converging towards the optimal solution for the given JSSP. The given algorithm has been simulated in Matlab tool and the results were compared with the Genetic Algorithm (GA) generated results for a well known bench marking problem. AIS produced optimal solution for more than 90% run which 15% produced by GA.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565161","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670582
S. Karthigai Lakshmi, G. Athisha, M. Karthikeyan, C. Ganesh
In this paper we discuss different Subtractors design based on quantum dot cellular automata (QCA). QCA is an emerging nanotechnology for electronic circuits. It has the potential for attractive features such as faster speed, smaller size and low power consumption than transistor based technology. By taking the advantages of QCA we are able to design interesting computational architectures. The Subtractors: Half-Subtractor and Full-Subtractor are designed and simulated using QCADesigner . The QCA designer is a design and simulation tool for quantum dot cellular automata (QCA).
{"title":"Design of subtractor using nanotechnology based QCA","authors":"S. Karthigai Lakshmi, G. Athisha, M. Karthikeyan, C. Ganesh","doi":"10.1109/ICCCCT.2010.5670582","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670582","url":null,"abstract":"In this paper we discuss different Subtractors design based on quantum dot cellular automata (QCA). QCA is an emerging nanotechnology for electronic circuits. It has the potential for attractive features such as faster speed, smaller size and low power consumption than transistor based technology. By taking the advantages of QCA we are able to design interesting computational architectures. The Subtractors: Half-Subtractor and Full-Subtractor are designed and simulated using QCADesigner . The QCA designer is a design and simulation tool for quantum dot cellular automata (QCA).","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"14 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115720461","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670597
Krishnamoorthy A Research Scholar, Dharmalingam K Dean, Academic Activities
In the design of electrical machinery, direct search methods of conventional optimization techniques are widely used. In the recent years, Genetic Algorithm (GA) has been successfully applied to the design optimization of electromagnetic devices and electrical machinery. In this paper, an optimal design method to optimize the cost of three phase Induction Motor (IM) is presented. The motor design procedure consists of a set of non - linear equations, which imposes IM characteristics, motor performance, magnetic stresses and thermal limits, and also checks that certain constraints imposed are not violated. Optimization has been carried out using a conventional optimization method, Rosenbrock's method and also using GA. A combination of conventional optimization technique with GA (i.e., results obtained in Rosenbrock's method are fed as input data in GA process) has also been carried out. A comparative study and analysis of the end results obtained through computer simulations are presented in the paper.
{"title":"Optimized design of three phase IM using Rosenbrock's method and GA","authors":"Krishnamoorthy A Research Scholar, Dharmalingam K Dean, Academic Activities","doi":"10.1109/ICCCCT.2010.5670597","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670597","url":null,"abstract":"In the design of electrical machinery, direct search methods of conventional optimization techniques are widely used. In the recent years, Genetic Algorithm (GA) has been successfully applied to the design optimization of electromagnetic devices and electrical machinery. In this paper, an optimal design method to optimize the cost of three phase Induction Motor (IM) is presented. The motor design procedure consists of a set of non - linear equations, which imposes IM characteristics, motor performance, magnetic stresses and thermal limits, and also checks that certain constraints imposed are not violated. Optimization has been carried out using a conventional optimization method, Rosenbrock's method and also using GA. A combination of conventional optimization technique with GA (i.e., results obtained in Rosenbrock's method are fed as input data in GA process) has also been carried out. A comparative study and analysis of the end results obtained through computer simulations are presented in the paper.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132486695","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}
Pub Date : 2010-12-17DOI: 10.1109/ICCCCT.2010.5670592
Sandhya Yogi, K. Subhashini, J. Satapathy, Shiv Kumar
Here we have presented an alternate ANN structure called functional link ANN (FLANN) for channel equalization. In contrast to a feed forward ANN structure i.e. a multilayer perceptron (MLP), the FLANN is basically a single layer structure in which non-linearity is introduced by enhancing the input pattern with nonlinear function expansion. A novel method of training the FLANNs using PSO Algorithm is described. The neuron structure is modified to improve the performance of the equalizer. From the results it can be noted that the proposed structure improves the classification capability of the FLANNs in differentiating the received data.
{"title":"A novel PSO based adaptive channel equalizer using a modified ANN structure","authors":"Sandhya Yogi, K. Subhashini, J. Satapathy, Shiv Kumar","doi":"10.1109/ICCCCT.2010.5670592","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670592","url":null,"abstract":"Here we have presented an alternate ANN structure called functional link ANN (FLANN) for channel equalization. In contrast to a feed forward ANN structure i.e. a multilayer perceptron (MLP), the FLANN is basically a single layer structure in which non-linearity is introduced by enhancing the input pattern with nonlinear function expansion. A novel method of training the FLANNs using PSO Algorithm is described. The neuron structure is modified to improve the performance of the equalizer. From the results it can be noted that the proposed structure improves the classification capability of the FLANNs in differentiating the received data.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131711783","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
扫码关注我们
求助内容：
应助结果提醒方式：