Pub Date : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429882
S. Gamwarige, C. Kulasekere
Energy Driven Cluster-Head Rotation (EDCR) class of algorithms are energy aware distributed clustering techniques for effective ad hoc deployed Wireless Sensor Network (WSN) organization. The application of this class of algorithms requires the setting of salient parameters at the design stage of the WSN to achieve desired results. Two such parameters which should be known in advance are the cluster density and the distance between neighbouring cluster heads (CHs). In this research we analyze the effect of algorithm design based on these two parameters. Simulation techniques are given to support and verify the analytical results.
{"title":"An analytical framework for cluster distribution of EDCR class of algorithms in Wireless Sensor Networks","authors":"S. Gamwarige, C. Kulasekere","doi":"10.1109/ICIINFS.2009.5429882","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429882","url":null,"abstract":"Energy Driven Cluster-Head Rotation (EDCR) class of algorithms are energy aware distributed clustering techniques for effective ad hoc deployed Wireless Sensor Network (WSN) organization. The application of this class of algorithms requires the setting of salient parameters at the design stage of the WSN to achieve desired results. Two such parameters which should be known in advance are the cluster density and the distance between neighbouring cluster heads (CHs). In this research we analyze the effect of algorithm design based on these two parameters. Simulation techniques are given to support and verify the analytical results.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132506916","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429844
P. Khandekar, S. Subbaraman, V. R. Vinjamoori
Demands for low power electronics have motivated designers to explore new approaches to VLSI circuits. The classical approaches of reducing energy dissipation in conventional CMOS circuits include reducing the supply voltages, node capacitances, and switching frequencies. Energy-recovery circuitry, on the other hand, is a new promising approach to the design of VLSI circuits with very low energy dissipation. Such circuits achieve low energy dissipation by restricting current to flow across devices with very low voltage drop and by recycling the energy stored on their capacitors. This paper analyzes the performance of Pass Transistor Adiabatic Logic (PAL) against that of static CMOS. A standard 2×2 Barrel Shifter is used as the benchmark circuit for comparison due to its modular design. The analysis is carried out in cadence design environment using 180nm technology using cell based design approach. The simulation is done at various operating voltages, frequencies, and load capacitances for each circuit family and technological node.
{"title":"Quasi-adiabatic 2×2 Barrel Shifter","authors":"P. Khandekar, S. Subbaraman, V. R. Vinjamoori","doi":"10.1109/ICIINFS.2009.5429844","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429844","url":null,"abstract":"Demands for low power electronics have motivated designers to explore new approaches to VLSI circuits. The classical approaches of reducing energy dissipation in conventional CMOS circuits include reducing the supply voltages, node capacitances, and switching frequencies. Energy-recovery circuitry, on the other hand, is a new promising approach to the design of VLSI circuits with very low energy dissipation. Such circuits achieve low energy dissipation by restricting current to flow across devices with very low voltage drop and by recycling the energy stored on their capacitors. This paper analyzes the performance of Pass Transistor Adiabatic Logic (PAL) against that of static CMOS. A standard 2×2 Barrel Shifter is used as the benchmark circuit for comparison due to its modular design. The analysis is carried out in cadence design environment using 180nm technology using cell based design approach. The simulation is done at various operating voltages, frequencies, and load capacitances for each circuit family and technological node.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130430459","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429842
N. P. Karunadasa, D. Ranasinghe
Compute Unified Device Architecture (CUDA) programmed,Graphic Processing Units (GPUs) are rapidly becoming a major choice in high performance computing. Hence, the number of applications ported to the CUDA platform is growing high. Message Passing Interface(MPI) has been the choice of high performance computing for more than a decade and it has proven its capability in delivering higher performance in parallel applications. CUDA and MPI use different programming approaches but both of them depend on the inherent parallelism of the application to be effective. However, much less research had been carried out to evaluate the performance when CUDA is integrated with other parallel programming paradigms. This paper investigates on integration of these capabilities of both programming approaches and how we can achieve superior performance in general purpose applications. Thus, we have experimented CUDA+MPI programming approach with two well-known algorithms (Strassens Algorithm & Conjugate Gradient Algorithm) and shown how we can achieve higher performance by means of using MPI as computation distributing mechanism and CUDA as the main execution engine. We have developed a general purpose matrix multiplication algorithm and a Conjugate Gradient algorithm using CUDA and MPI. In this approach, MPI functions as the data distributing mechanism between the GPU nodes and CUDA as the main computing engine. This allows the programmer to connect GPU nodes via high speed Ethernet without special technologies. Thus, the programmer is enabled to view each GPU node separately as they are and to execute different components of a program in several GPU nodes.
{"title":"Accelerating high performance applications with CUDA and MPI","authors":"N. P. Karunadasa, D. Ranasinghe","doi":"10.1109/ICIINFS.2009.5429842","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429842","url":null,"abstract":"Compute Unified Device Architecture (CUDA) programmed,Graphic Processing Units (GPUs) are rapidly becoming a major choice in high performance computing. Hence, the number of applications ported to the CUDA platform is growing high. Message Passing Interface(MPI) has been the choice of high performance computing for more than a decade and it has proven its capability in delivering higher performance in parallel applications. CUDA and MPI use different programming approaches but both of them depend on the inherent parallelism of the application to be effective. However, much less research had been carried out to evaluate the performance when CUDA is integrated with other parallel programming paradigms. This paper investigates on integration of these capabilities of both programming approaches and how we can achieve superior performance in general purpose applications. Thus, we have experimented CUDA+MPI programming approach with two well-known algorithms (Strassens Algorithm & Conjugate Gradient Algorithm) and shown how we can achieve higher performance by means of using MPI as computation distributing mechanism and CUDA as the main execution engine. We have developed a general purpose matrix multiplication algorithm and a Conjugate Gradient algorithm using CUDA and MPI. In this approach, MPI functions as the data distributing mechanism between the GPU nodes and CUDA as the main computing engine. This allows the programmer to connect GPU nodes via high speed Ethernet without special technologies. Thus, the programmer is enabled to view each GPU node separately as they are and to execute different components of a program in several GPU nodes.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123261404","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429878
D. R. Guha, S. K. Patra
This paper presents solution to channel equalization problem. Adaptive equalization techniques have been used for channel equalization extensively. Subsequently adaptive signal processing techniques using Artificial Neural Networks based Multilayer Perceptron Network, Radial Basis Function, Recurrent Network, Fuzzy and Adaptive Neuro fuzzy System have been used for these class of problems. In this paper we proposed a RBF equalizer trained with a new neural network learning paradigm called the Wilcoxon learning. This is termed as Wilcoxon generalized radial basis function network (WGRBFN), is a rank based statistics approach, is used to linear regression problems are usually robust against outliers. The Performance of the WGRBFN has been evaluated through extensive computer simulations and the results compared with other equalizers.
{"title":"Channel equalization for ISI channels using Wilcoxon generalized RBF","authors":"D. R. Guha, S. K. Patra","doi":"10.1109/ICIINFS.2009.5429878","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429878","url":null,"abstract":"This paper presents solution to channel equalization problem. Adaptive equalization techniques have been used for channel equalization extensively. Subsequently adaptive signal processing techniques using Artificial Neural Networks based Multilayer Perceptron Network, Radial Basis Function, Recurrent Network, Fuzzy and Adaptive Neuro fuzzy System have been used for these class of problems. In this paper we proposed a RBF equalizer trained with a new neural network learning paradigm called the Wilcoxon learning. This is termed as Wilcoxon generalized radial basis function network (WGRBFN), is a rank based statistics approach, is used to linear regression problems are usually robust against outliers. The Performance of the WGRBFN has been evaluated through extensive computer simulations and the results compared with other equalizers.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122416271","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429807
S. Panda, D. Mishra, B. Biswal, B. B. Choudhury
Robotic manipulators with three-revolute (3R) positional configurations are very common in the industrial robots (IRs). The capability of a robot largely depends on the workspace (WS) of the manipulator apart from other parameters. With the constraints in mind the optimization of the workspace is of prime importance in designing the manipulator. The present work aims at obtaining a formulation of workspace area while constraints are imposed to control the total area. Subsequently numerical example is presented to validate the proposed methodology.
{"title":"An appropriate formulation for workspace cross section area of 3R robot manipulator","authors":"S. Panda, D. Mishra, B. Biswal, B. B. Choudhury","doi":"10.1109/ICIINFS.2009.5429807","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429807","url":null,"abstract":"Robotic manipulators with three-revolute (3R) positional configurations are very common in the industrial robots (IRs). The capability of a robot largely depends on the workspace (WS) of the manipulator apart from other parameters. With the constraints in mind the optimization of the workspace is of prime importance in designing the manipulator. The present work aims at obtaining a formulation of workspace area while constraints are imposed to control the total area. Subsequently numerical example is presented to validate the proposed methodology.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122720947","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429805
S. Sharma, R. N. Mohapatra, B. Biswal, B. B. Choudhury
A robotic assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying the process constraints. The assembly cost relates to assembly operations, assembly motions and assembly direction changes. The work utilizes an ant colony optimization (ACO) for generation of robotic assembly sequences. The method relates the assembly cost to an energy function associated with the assembly sequence. The energy function is iteratively minimized to generate an assembly sequence with a minimum assembly cost is finally generated. Example problems show the effectiveness of the method. This modified method generates feasible, stable and optimal robotic assembly sequence satisfying the assembly constraints with minimum assembly cost.
{"title":"Generation of robotic assembly sequence using ant colony optimization","authors":"S. Sharma, R. N. Mohapatra, B. Biswal, B. B. Choudhury","doi":"10.1109/ICIINFS.2009.5429805","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429805","url":null,"abstract":"A robotic assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying the process constraints. The assembly cost relates to assembly operations, assembly motions and assembly direction changes. The work utilizes an ant colony optimization (ACO) for generation of robotic assembly sequences. The method relates the assembly cost to an energy function associated with the assembly sequence. The energy function is iteratively minimized to generate an assembly sequence with a minimum assembly cost is finally generated. Example problems show the effectiveness of the method. This modified method generates feasible, stable and optimal robotic assembly sequence satisfying the assembly constraints with minimum assembly cost.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131621915","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429857
B. Pal, Shyamal Sen, Mousumi Kumar
This article presents a fuzzy goal programming (FGP) procedure for solving a stochastic multiobjective decision making (MODM) problem having the finite probabilistic aspiration levels for achievement of the chance constrained goals.
{"title":"A fuzzy goal programming approach for solving multiobjective fuzzy stochastic programming problems","authors":"B. Pal, Shyamal Sen, Mousumi Kumar","doi":"10.1109/ICIINFS.2009.5429857","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429857","url":null,"abstract":"This article presents a fuzzy goal programming (FGP) procedure for solving a stochastic multiobjective decision making (MODM) problem having the finite probabilistic aspiration levels for achievement of the chance constrained goals.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115270829","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429830
M. Chandra, K. V. Arya, S. S. Sarangdevot
Fractals in nature are always a result of some growth process. The Sierpinski gasket is the set of points in the plane which remain if one carries out this growth process infinitely often. Sierpinski gasket is one of the very beautiful fractals from the historic gallery of classical fractals. This paper includes an analysis of superior iterations as a formalism used to describe generation of Sierpinski models, which in time has become a general method of creating fractal objects. Each next category leads to a more generalized form of the Sierpinski model. In this paper, we have generated Sierpinski's models using superior iterations.
{"title":"New Sierpinski's models","authors":"M. Chandra, K. V. Arya, S. S. Sarangdevot","doi":"10.1109/ICIINFS.2009.5429830","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429830","url":null,"abstract":"Fractals in nature are always a result of some growth process. The Sierpinski gasket is the set of points in the plane which remain if one carries out this growth process infinitely often. Sierpinski gasket is one of the very beautiful fractals from the historic gallery of classical fractals. This paper includes an analysis of superior iterations as a formalism used to describe generation of Sierpinski models, which in time has become a general method of creating fractal objects. Each next category leads to a more generalized form of the Sierpinski model. In this paper, we have generated Sierpinski's models using superior iterations.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"503 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124261867","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429803
K. Vijayakumar, R. Karthikeyan, R. Arumugam, G. Premsunder, S. Kannan
This paper describes a more precise technique for thermal analysis due to joule heat loss in switched reluctance motor with soft magnetic composite material (SMC) by two dimensional (2-D) coupled field finite element analysis. The finite element model is solved in tandem by a cascaded procedure comprising electromagnetic and thermal analysis. The results of the coupled field finite element analysis of two configurations viz (a) Switched reluctance motor made of lamination sheet steel (SRM-M19) and (b) Switched reluctance motor made of soft magnetic composite material (SRM-SMC) are presented.
{"title":"Coupled field finite element analysis of switched reluctance motor with soft magnetic composite material for thermal characterization","authors":"K. Vijayakumar, R. Karthikeyan, R. Arumugam, G. Premsunder, S. Kannan","doi":"10.1109/ICIINFS.2009.5429803","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429803","url":null,"abstract":"This paper describes a more precise technique for thermal analysis due to joule heat loss in switched reluctance motor with soft magnetic composite material (SMC) by two dimensional (2-D) coupled field finite element analysis. The finite element model is solved in tandem by a cascaded procedure comprising electromagnetic and thermal analysis. The results of the coupled field finite element analysis of two configurations viz (a) Switched reluctance motor made of lamination sheet steel (SRM-M19) and (b) Switched reluctance motor made of soft magnetic composite material (SRM-SMC) are presented.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363015","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429896
R. R. Rout, S.K. Ghosh, S. Chakrabarti
Wireless Sensor Networks (WSNs) are immensely deployed for monitoring information like humidity, temperature and soil fertility. As the sensor nodes sense data and floods them in the network, the network traffic increases and may result in congestion which leads to broadcast storm problem. This paper addresses the utility of network coding to optimize data aggregation and to decrease the number of transmitted messages in a WSN. A coding-aware deployment strategy is presented which create opportunity for network coding at aggregate sensor nodes. Our deployment strategy leads to a topology which supports many-to-many network flows (multiple sources and multiple sink network flow). It also gives protection against multiple failures in the network. Furthermore, we propose a heuristic that restricts unnecessary transmissions.
{"title":"Network coding-aware data aggregation for a distributed Wireless Sensor Network","authors":"R. R. Rout, S.K. Ghosh, S. Chakrabarti","doi":"10.1109/ICIINFS.2009.5429896","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429896","url":null,"abstract":"Wireless Sensor Networks (WSNs) are immensely deployed for monitoring information like humidity, temperature and soil fertility. As the sensor nodes sense data and floods them in the network, the network traffic increases and may result in congestion which leads to broadcast storm problem. This paper addresses the utility of network coding to optimize data aggregation and to decrease the number of transmitted messages in a WSN. A coding-aware deployment strategy is presented which create opportunity for network coding at aggregate sensor nodes. Our deployment strategy leads to a topology which supports many-to-many network flows (multiple sources and multiple sink network flow). It also gives protection against multiple failures in the network. Furthermore, we propose a heuristic that restricts unnecessary transmissions.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129487649","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
扫码关注我们
求助内容：
应助结果提醒方式：