Pub Date : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798454
B. Pal, Somsubhra Gupta
In this article, the efficient use of a genetic algorithm (GA) to the goal programming (GP) formulation of interval valued multiobjective fractional programming problems (MOFPPs) is presented. In the proposed approach, first the interval arithmetic technique [1] is used to transform the fractional objectives with interval coefficients into the standard form of an interval programming problem with fractional criteria. Then, the redefined problem is converted into the conventional fractional goal objectives by using interval programming approach [2] and then introducing under-and over-deviational variables to each of the objectives. In the model formulation of the problem, both the aspects of GP methodologies, minsum GP and minimax GP [3] are taken into consideration to construct the interval function (achievement function) for accommodation within the ranges of the goal intervals specified in the decision situation where minimization of the regrets (deviations from the goal levels) to the extent possible within the decision environment is considered. In the solution process, instead of using conventional transformation approaches [4, 5, 6] to fractional programming, a GA approach is introduced directly into the GP framework of the proposed problem. In using the proposed GA, based on mechanism of natural selection and natural genetics, the conventional roulette wheel selection scheme and arithmetic crossover are used for achievement of the goal levels in the solution space specified in the decision environment. Here the chromosome representation of a candidate solution in the population of the GA method is encoded in binary form. Again, the interval function defined for the achievement of the fractional goal objectives is considered the fitness function in the reproduction process of the proposed GA. A numerical example is solved to illustrate the proposed approach and the model solution is compared with the solutions of the approaches [6, 7] studied previously.
{"title":"A Goal Programming approach for solving Interval valued Multiobjective Fractional Programming problems using Genetic Algorithm","authors":"B. Pal, Somsubhra Gupta","doi":"10.1109/ICIINFS.2008.4798454","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798454","url":null,"abstract":"In this article, the efficient use of a genetic algorithm (GA) to the goal programming (GP) formulation of interval valued multiobjective fractional programming problems (MOFPPs) is presented. In the proposed approach, first the interval arithmetic technique [1] is used to transform the fractional objectives with interval coefficients into the standard form of an interval programming problem with fractional criteria. Then, the redefined problem is converted into the conventional fractional goal objectives by using interval programming approach [2] and then introducing under-and over-deviational variables to each of the objectives. In the model formulation of the problem, both the aspects of GP methodologies, minsum GP and minimax GP [3] are taken into consideration to construct the interval function (achievement function) for accommodation within the ranges of the goal intervals specified in the decision situation where minimization of the regrets (deviations from the goal levels) to the extent possible within the decision environment is considered. In the solution process, instead of using conventional transformation approaches [4, 5, 6] to fractional programming, a GA approach is introduced directly into the GP framework of the proposed problem. In using the proposed GA, based on mechanism of natural selection and natural genetics, the conventional roulette wheel selection scheme and arithmetic crossover are used for achievement of the goal levels in the solution space specified in the decision environment. Here the chromosome representation of a candidate solution in the population of the GA method is encoded in binary form. Again, the interval function defined for the achievement of the fractional goal objectives is considered the fitness function in the reproduction process of the proposed GA. A numerical example is solved to illustrate the proposed approach and the model solution is compared with the solutions of the approaches [6, 7] studied previously.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123345578","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798345
N. Jonnakuti, S. Kar, N. Kishore, V. Srinivas
Design and development of a rectangular current pulse generator is presented. The generator produces 15 ms wide, 100 A amplitude unipolar pulses into an 8 Omega load. Pulses with duration of 10-20 ms are essential for the development of compacts of the nanomaterial samples while avoiding grain growth on the samples dominant at long pulses. The pulses are produced by discharging the charged artificial transmission line into the load impedance equal to the surge impedance of the transmission line. These pulses obtained are applied for sintering of samples like aluminum and graphite.
{"title":"Development of Rectangular Current Pulse Generator for Sintering of Nanomaterials","authors":"N. Jonnakuti, S. Kar, N. Kishore, V. Srinivas","doi":"10.1109/ICIINFS.2008.4798345","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798345","url":null,"abstract":"Design and development of a rectangular current pulse generator is presented. The generator produces 15 ms wide, 100 A amplitude unipolar pulses into an 8 Omega load. Pulses with duration of 10-20 ms are essential for the development of compacts of the nanomaterial samples while avoiding grain growth on the samples dominant at long pulses. The pulses are produced by discharging the charged artificial transmission line into the load impedance equal to the surge impedance of the transmission line. These pulses obtained are applied for sintering of samples like aluminum and graphite.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121694376","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798465
Ratnakar Dash, Rutuparna Panda, B. Acharya, B. Majhi
In this paper direct design of generalized B-spline filters has been presented. It has been shown how to choose filter parameters to meet the desired specifications. These filters exhibit maximally flat magnitude response and low side lobe energy as compared to Kaiser Window filter. Also a new type of adaptive B-spline filter has been developed in this paper. The application of the proposed filters for hybrid echo cancellation on digital cellular has been extensively studied. Results reveal the suitability of the proposed filters for such applications. This filter minimizes the mean square error using proportionate adaptive LMS algorithm. The proposed adaptive filter makes a perfect estimate of the hybrid echo.
{"title":"Novel Adaptive B-Spline Filter for Hybrid Echo Cancellation","authors":"Ratnakar Dash, Rutuparna Panda, B. Acharya, B. Majhi","doi":"10.1109/ICIINFS.2008.4798465","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798465","url":null,"abstract":"In this paper direct design of generalized B-spline filters has been presented. It has been shown how to choose filter parameters to meet the desired specifications. These filters exhibit maximally flat magnitude response and low side lobe energy as compared to Kaiser Window filter. Also a new type of adaptive B-spline filter has been developed in this paper. The application of the proposed filters for hybrid echo cancellation on digital cellular has been extensively studied. Results reveal the suitability of the proposed filters for such applications. This filter minimizes the mean square error using proportionate adaptive LMS algorithm. The proposed adaptive filter makes a perfect estimate of the hybrid echo.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121766920","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798416
Anirban Krishna Bhattacharya, S. Bhattacharya, Tanushree Garai, S. Mukhopadhyay
RF seekers provide the relative kinematics between the target and the pursuer in terms of LOS rates which are used for homing guidance computation. The measurement noise of the seeker is non-stationary and correlated due to eclipsing, Glint, RCS fluctuation, Radome distortion, angular noise, Gyro drift, etc. Further, the track loop dynamics originated from the receiver, signal processing and the stabilization loop result in certain delay between the kinematic LOS rate and the measurements. These necessitate appropriate modeling of the LOS rate measurement dynamics and the noise characteristics to incorporate in the seeker estimator, rather than considering the measurements as kinematics with additive white and stationary noise. The modeling of measurement dynamics and non-stationary and correlated noise of the RF seeker noise are discussed in this paper. The results of simulation in a realistic engagement scenario show that implementation of suitable measurement dynamics and noise model improves estimation of LOS rates as compared to absence of such models.
{"title":"Modeling of RF Seeker Dynamics and Noise Characteristics for Estimator Design in Homing Guidance Applications","authors":"Anirban Krishna Bhattacharya, S. Bhattacharya, Tanushree Garai, S. Mukhopadhyay","doi":"10.1109/ICIINFS.2008.4798416","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798416","url":null,"abstract":"RF seekers provide the relative kinematics between the target and the pursuer in terms of LOS rates which are used for homing guidance computation. The measurement noise of the seeker is non-stationary and correlated due to eclipsing, Glint, RCS fluctuation, Radome distortion, angular noise, Gyro drift, etc. Further, the track loop dynamics originated from the receiver, signal processing and the stabilization loop result in certain delay between the kinematic LOS rate and the measurements. These necessitate appropriate modeling of the LOS rate measurement dynamics and the noise characteristics to incorporate in the seeker estimator, rather than considering the measurements as kinematics with additive white and stationary noise. The modeling of measurement dynamics and non-stationary and correlated noise of the RF seeker noise are discussed in this paper. The results of simulation in a realistic engagement scenario show that implementation of suitable measurement dynamics and noise model improves estimation of LOS rates as compared to absence of such models.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114957788","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798442
J. Bhaumik, Balaji Janakiram, D. R. Chowdhury
Cellular Automata (CA) is a novel approach for designing byte error-correcting codes. The regular, modular and cascaded structure of CA can be economically built with VLSI technology. In this correspondence, a modular architecture of CA based (32, 28) byte error correcting encoder and decoder has been proposed. The design is capable of locating and correcting all double byte errors. CA-based implementation of the proposed decoding scheme provides a simple cost effective solution compared to the existing decoding scheme for the Reed-Solomon (RS) decoder, having double error correcting capability.
{"title":"Architectural Design of CA-Based Double Byte Error Correcting Codec","authors":"J. Bhaumik, Balaji Janakiram, D. R. Chowdhury","doi":"10.1109/ICIINFS.2008.4798442","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798442","url":null,"abstract":"Cellular Automata (CA) is a novel approach for designing byte error-correcting codes. The regular, modular and cascaded structure of CA can be economically built with VLSI technology. In this correspondence, a modular architecture of CA based (32, 28) byte error correcting encoder and decoder has been proposed. The design is capable of locating and correcting all double byte errors. CA-based implementation of the proposed decoding scheme provides a simple cost effective solution compared to the existing decoding scheme for the Reed-Solomon (RS) decoder, having double error correcting capability.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122737762","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798452
B. Pal, Shyamal Sen
This article describes a goal programming (GP) procedure for proper allocation of teaching personnel to the teaching departments for smooth functioning of the academic activities of a university. In the academic resource planning context, both the crisp and fuzzy goal objectives which are frequently involved with the problem are discussed. Again, certain ratios in the fractional forms which are inherently associated to the problem are also taken into consideration. In the model formulation, achievement of the highest membership value (unity) of the membership functions of the defined fuzzy goal as well as attainment of the prescribed goal levels of the crisp goals to the extent possible are considered. In the solution process, the fractional goals are transformed into the linear goals by using the linear transformation approach studied previously. A case study of University of Kalyani, West Bengal, India is considered to expound the potential use of the proposed model.
{"title":"A Linear Goal Programming Procedure for Academic Personel Management Problems in University System","authors":"B. Pal, Shyamal Sen","doi":"10.1109/ICIINFS.2008.4798452","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798452","url":null,"abstract":"This article describes a goal programming (GP) procedure for proper allocation of teaching personnel to the teaching departments for smooth functioning of the academic activities of a university. In the academic resource planning context, both the crisp and fuzzy goal objectives which are frequently involved with the problem are discussed. Again, certain ratios in the fractional forms which are inherently associated to the problem are also taken into consideration. In the model formulation, achievement of the highest membership value (unity) of the membership functions of the defined fuzzy goal as well as attainment of the prescribed goal levels of the crisp goals to the extent possible are considered. In the solution process, the fractional goals are transformed into the linear goals by using the linear transformation approach studied previously. A case study of University of Kalyani, West Bengal, India is considered to expound the potential use of the proposed model.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129893191","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798366
K. Garje, Anil Kumar, S. Biswas, Amitava Banerjee, Pam Srikanth, S. Mukhopadhyay
Fault simulation is one of the elemental steps in test pattern generation and is widely used for digital circuits. In case of analog circuits, fault simulation is not generally adopted because of the lack of suitable fault models and the time required for the transistor level simulation of the entire circuit. In this paper, a macromodel level fault model, which is able to represent the faulty behavior of the linear circuits with opamp, is presented. Macromodel based platform is chosen for fault simulation because, as shown in this paper, they are much faster in simulation than transistor level models but fault behavior is captured within an adequate range of accuracy. The faults considered are mostly parametric and few are catastrophic in nature. For ease of the test engineers, the macromodel parameters of the faulty opamp used for linear circuits are obtained automatically by a parameter estimation tool, given the macromodel of the normal circuit and the fault.
{"title":"Macromodel Based Fault Simulation of Linear Circuits using Parameter Estimation","authors":"K. Garje, Anil Kumar, S. Biswas, Amitava Banerjee, Pam Srikanth, S. Mukhopadhyay","doi":"10.1109/ICIINFS.2008.4798366","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798366","url":null,"abstract":"Fault simulation is one of the elemental steps in test pattern generation and is widely used for digital circuits. In case of analog circuits, fault simulation is not generally adopted because of the lack of suitable fault models and the time required for the transistor level simulation of the entire circuit. In this paper, a macromodel level fault model, which is able to represent the faulty behavior of the linear circuits with opamp, is presented. Macromodel based platform is chosen for fault simulation because, as shown in this paper, they are much faster in simulation than transistor level models but fault behavior is captured within an adequate range of accuracy. The faults considered are mostly parametric and few are catastrophic in nature. For ease of the test engineers, the macromodel parameters of the faulty opamp used for linear circuits are obtained automatically by a parameter estimation tool, given the macromodel of the normal circuit and the fault.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115964028","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798361
P. Sivasankar, C. Chellappan, S. Balaji
Mobile ad hoc networks are a class of dynamic networks without any centralized administration. A major bottleneck in mobile ad hoc networks (MANETs) is the energy consumption since nodes are usually mobile and battery operated. To maximize the lifetime of mobile ad hoc networks (i.e., the lifetime of the nodes themselves) the power depletion of network must be evenly distributed, i.e., there must be a uniform drain of energy from the nodes, and the overall transmission power requirement for each connection request must be minimized. This paper proposes two algorithms called energy efficient delay time routing (EEDTR) and maximised energy efficient routing (MEER), which try to increase the operational lifetime of mobile ad hoc networks. These algorithms are modified versions of the existing dynamic source routing (DSR) algorithm. These algorithms select fully distributed routes, thus balancing power consumption of the entire network. The first algorithm(EEDTR) introduces a delay in forwarding the packets by nodes, which is inversely proportional to the remaining energy level of the node. The second algorithm includes energy information on the route request packet and select the routes based on this information (MEER). These algorithms are designed and implemented using global mobile simulator (GloMoSim), a scalable, simulation environment for network simulation. Based on the results obtained, this paper concludes that the proposed algorithms increase the lifetime of mobile ad hoc networks, at the expense of end to end delay and control overhead.
{"title":"Performance Evaluation of Energy Efficient On-demand Routing Algorithms for MANET","authors":"P. Sivasankar, C. Chellappan, S. Balaji","doi":"10.1109/ICIINFS.2008.4798361","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798361","url":null,"abstract":"Mobile ad hoc networks are a class of dynamic networks without any centralized administration. A major bottleneck in mobile ad hoc networks (MANETs) is the energy consumption since nodes are usually mobile and battery operated. To maximize the lifetime of mobile ad hoc networks (i.e., the lifetime of the nodes themselves) the power depletion of network must be evenly distributed, i.e., there must be a uniform drain of energy from the nodes, and the overall transmission power requirement for each connection request must be minimized. This paper proposes two algorithms called energy efficient delay time routing (EEDTR) and maximised energy efficient routing (MEER), which try to increase the operational lifetime of mobile ad hoc networks. These algorithms are modified versions of the existing dynamic source routing (DSR) algorithm. These algorithms select fully distributed routes, thus balancing power consumption of the entire network. The first algorithm(EEDTR) introduces a delay in forwarding the packets by nodes, which is inversely proportional to the remaining energy level of the node. The second algorithm includes energy information on the route request packet and select the routes based on this information (MEER). These algorithms are designed and implemented using global mobile simulator (GloMoSim), a scalable, simulation environment for network simulation. Based on the results obtained, this paper concludes that the proposed algorithms increase the lifetime of mobile ad hoc networks, at the expense of end to end delay and control overhead.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121030255","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798383
A. Ganguly, A. Ganguly, Manik Bhoumic, A. Ganguly
High speed resonant cavity metal-semiconductor-metal (MSM) Schottky barrier photo detector is reported. Nickel is used as metal and quasi mono-crystalline silicon (QMS) with nanovoids is used as semiconductor material. QMS is sandwiched between thin nickel plates to obtain heterodyne characterization of MSM photo detector. QMS of suitable dimension shows significant enhancement of optical absorptance which in turn provides higher efficiency of the photo detector. A theoretical model of the photo diode is designed with a resonant cavity. The resonant cavity is chosen for obtaining higher quantum efficiency and the Schottky effect provides high speed to this photo detector. The micro cavity also causes wavelength selectivity accompanied by a drastic increase of the electric field at the resonant wavelength. The enhanced optical field provides high efficiency for faster transit time limited photodiodes with thinner absorption region. Appreciable improvement in results on speed, efficiency and responsivity is observed.
{"title":"High-Speed Metal-Semiconductor-Metal Photo diode","authors":"A. Ganguly, A. Ganguly, Manik Bhoumic, A. Ganguly","doi":"10.1109/ICIINFS.2008.4798383","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798383","url":null,"abstract":"High speed resonant cavity metal-semiconductor-metal (MSM) Schottky barrier photo detector is reported. Nickel is used as metal and quasi mono-crystalline silicon (QMS) with nanovoids is used as semiconductor material. QMS is sandwiched between thin nickel plates to obtain heterodyne characterization of MSM photo detector. QMS of suitable dimension shows significant enhancement of optical absorptance which in turn provides higher efficiency of the photo detector. A theoretical model of the photo diode is designed with a resonant cavity. The resonant cavity is chosen for obtaining higher quantum efficiency and the Schottky effect provides high speed to this photo detector. The micro cavity also causes wavelength selectivity accompanied by a drastic increase of the electric field at the resonant wavelength. The enhanced optical field provides high efficiency for faster transit time limited photodiodes with thinner absorption region. Appreciable improvement in results on speed, efficiency and responsivity is observed.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121377806","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798403
Santi Sankar Chowdhury, B. Tudu, R. Bandyopadhyay, N. Bhattacharyya
A portable electronic nose system has been developed with an array of five commercially available Metal Oxide Semiconductor (MOS) sensors, where a microcontroller (muc) is used for the pattern recognition. The classification of black tea aroma is carried out in the muc (PIC18F4520) and is based on feed forward multilayer perceptron (FF-MLP) algorithm. With the samples collected from the different gardens of north-east and eastern India, the MLP is trained first using the back-propagation algorithm with the fingerprint from the sensor array and the corresponding tea tasters' mark in a PC to obtain the optimum architecture and weights and biases of the neurons. Once it is trained, the computed weights and biases of the neurons are programmed in the muc and it then becomes a portable instrument, which gives the aroma index directly for new unknown tea samples. It is observed from the results that the performance of the muc-based electronic nose is at par with that of the PC-based electronic nose system when compared with unknown finished black tea samples.
{"title":"Portable Electronic Nose System for Aroma Classification of Black Tea","authors":"Santi Sankar Chowdhury, B. Tudu, R. Bandyopadhyay, N. Bhattacharyya","doi":"10.1109/ICIINFS.2008.4798403","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798403","url":null,"abstract":"A portable electronic nose system has been developed with an array of five commercially available Metal Oxide Semiconductor (MOS) sensors, where a microcontroller (muc) is used for the pattern recognition. The classification of black tea aroma is carried out in the muc (PIC18F4520) and is based on feed forward multilayer perceptron (FF-MLP) algorithm. With the samples collected from the different gardens of north-east and eastern India, the MLP is trained first using the back-propagation algorithm with the fingerprint from the sensor array and the corresponding tea tasters' mark in a PC to obtain the optimum architecture and weights and biases of the neurons. Once it is trained, the computed weights and biases of the neurons are programmed in the muc and it then becomes a portable instrument, which gives the aroma index directly for new unknown tea samples. It is observed from the results that the performance of the muc-based electronic nose is at par with that of the PC-based electronic nose system when compared with unknown finished black tea samples.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127086325","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
扫码关注我们
求助内容：
应助结果提醒方式：