Pub Date : 2011-07-20DOI: 10.1109/PACC.2011.5979044
A. Paul, M. Tech, B. S. Anju, Pillai
In real time scheduling, preemption is one of the causes of run time overhead and large memory requirements. This paper focuses on reducing the number of preemptions in Earliest Deadline First (EDF) scheduling using a technique called Dynamic Preemption Threshold Scheduling (DPTS) in uniprocessor platform. This method is an improvement over existing threshold algorithms, but the complexity is slightly higher. The simulation results show that context switches are reduced by about 91% on an average. This technique is also applied for scheduling of sporadic requests along with periodic tasks. Preemptions that occur when tasks share resources and are required to synchronize are also reduced in this work. Our work also focuses on task set generation with limited hyperperiod (L.C.M. of periods of the tasks).
{"title":"Reducing the Number of Context Switches in Real Time Systems","authors":"A. Paul, M. Tech, B. S. Anju, Pillai","doi":"10.1109/PACC.2011.5979044","DOIUrl":"https://doi.org/10.1109/PACC.2011.5979044","url":null,"abstract":"In real time scheduling, preemption is one of the causes of run time overhead and large memory requirements. This paper focuses on reducing the number of preemptions in Earliest Deadline First (EDF) scheduling using a technique called Dynamic Preemption Threshold Scheduling (DPTS) in uniprocessor platform. This method is an improvement over existing threshold algorithms, but the complexity is slightly higher. The simulation results show that context switches are reduced by about 91% on an average. This technique is also applied for scheduling of sporadic requests along with periodic tasks. Preemptions that occur when tasks share resources and are required to synchronize are also reduced in this work. Our work also focuses on task set generation with limited hyperperiod (L.C.M. of periods of the tasks).","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130505452","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 : 2011-07-20DOI: 10.1109/PACC.2011.5978964
P. Pardhasaradhi, T. Nagarjuna, P. Seetharamaiah
Image fusion is an integral part of many existing and future surveillance systems. Due to the limited depth-of-focus of optical lenses (especially such with long focal lengths) it is often not possible to get an image which contains all relevant objects in focus. One way to get an everywhere-in-focus image is to fuse the images of the same scene which are taken with different focal settings. This paper describes a novel optimal method for multi-focus image fusion using differential evolution algorithm. The source images are first decomposed into blocks. Then, the sharper blocks are selected by employing a sharpness criterion function. The selected blocks are finally combined to construct the fused image. The motivation of the proposed method lies in the fact that an optimized block size could be more effective than a fixed block size. The experimental results show that the proposed method can perform better than the other traditional methods in terms of both quantitative and visual evaluations.
{"title":"Notice of Violation of IEEE Publication PrinciplesA Differential Evolution Algorithm for Image Fusion","authors":"P. Pardhasaradhi, T. Nagarjuna, P. Seetharamaiah","doi":"10.1109/PACC.2011.5978964","DOIUrl":"https://doi.org/10.1109/PACC.2011.5978964","url":null,"abstract":"Image fusion is an integral part of many existing and future surveillance systems. Due to the limited depth-of-focus of optical lenses (especially such with long focal lengths) it is often not possible to get an image which contains all relevant objects in focus. One way to get an everywhere-in-focus image is to fuse the images of the same scene which are taken with different focal settings. This paper describes a novel optimal method for multi-focus image fusion using differential evolution algorithm. The source images are first decomposed into blocks. Then, the sharper blocks are selected by employing a sharpness criterion function. The selected blocks are finally combined to construct the fused image. The motivation of the proposed method lies in the fact that an optimized block size could be more effective than a fixed block size. The experimental results show that the proposed method can perform better than the other traditional methods in terms of both quantitative and visual evaluations.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126329267","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 : 2011-07-20DOI: 10.1109/PACC.2011.5978888
D. Savitha Manojna, S. Kirthiga, M. Jayakumar
The Millimeter Waves are allocated with 60GHz frequency range as an unlicensed band worldwide. Millimeter waves become very useful for short-range communications because of its high data rate, its large-available bandwidth of 7GHz and the Oxygen absorption present at that band. The 60GHz indoor channel contains much of multipath components and needs the use of statistical parameters in modeling the channel. At 60 GHz, the free space loss is higher and thus requires the use of antennas with more pattern directivity along with having small antenna dimensions. Considering these factors, in this paper, Triple Saleh Valenzuela (TSV) model is chosen as a suitable model for millimeter waves. The performance of Spatial Multiplexed system for TSV channel model is simulated by assuming a simple indoor Line of Sight (LOS) environment model. Assuming perfect channel estimation, the Bit Error Rate (BER) performance of the 2x2 system is investigated for Zero Forcing (ZF), Minimum Mean Square Error (MMSE), and Maximum Likelihood (ML) receivers.
{"title":"Study of 2x2 Spatial Multiplexed System in 60 GHz Indoor Environment","authors":"D. Savitha Manojna, S. Kirthiga, M. Jayakumar","doi":"10.1109/PACC.2011.5978888","DOIUrl":"https://doi.org/10.1109/PACC.2011.5978888","url":null,"abstract":"The Millimeter Waves are allocated with 60GHz frequency range as an unlicensed band worldwide. Millimeter waves become very useful for short-range communications because of its high data rate, its large-available bandwidth of 7GHz and the Oxygen absorption present at that band. The 60GHz indoor channel contains much of multipath components and needs the use of statistical parameters in modeling the channel. At 60 GHz, the free space loss is higher and thus requires the use of antennas with more pattern directivity along with having small antenna dimensions. Considering these factors, in this paper, Triple Saleh Valenzuela (TSV) model is chosen as a suitable model for millimeter waves. The performance of Spatial Multiplexed system for TSV channel model is simulated by assuming a simple indoor Line of Sight (LOS) environment model. Assuming perfect channel estimation, the Bit Error Rate (BER) performance of the 2x2 system is investigated for Zero Forcing (ZF), Minimum Mean Square Error (MMSE), and Maximum Likelihood (ML) receivers.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121426151","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 : 2011-07-20DOI: 10.1109/PACC.2011.5979034
Alwin Francis, R. Ramachandran
Modulo Ten Search is a searching algorithm for finding a particular value in a list by performing modulus Ten of the number . Here the list will be partitioned into ten list based on modulo ten of the number. It searches an item by first taking modulo ten values and finally it undergoes a linear search method. A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, Modulo Ten Search is not limited to integers
{"title":"Modulo Ten Search- An Alternative to Linear Search","authors":"Alwin Francis, R. Ramachandran","doi":"10.1109/PACC.2011.5979034","DOIUrl":"https://doi.org/10.1109/PACC.2011.5979034","url":null,"abstract":"Modulo Ten Search is a searching algorithm for finding a particular value in a list by performing modulus Ten of the number . Here the list will be partitioned into ten list based on modulo ten of the number. It searches an item by first taking modulo ten values and finally it undergoes a linear search method. A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, Modulo Ten Search is not limited to integers","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126394679","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 : 2011-07-20DOI: 10.1109/PACC.2011.5978868
D. Kiran, S. Gurunarayanan, J. P. Misra
We present a parallelization scheme involving extracting intra block parallelism within sequential programs which are in SSA form and scheduling block on to multicore processor. Since we are working on SSA form program, we are able to exploit more parallelism compared to existing parallelization compilers. Also an attempt is made to schedule to multiple cores taking by number of registers into consideration. At the end we show how our approach will give solution to direct cache coherence problem.
{"title":"Taming Compiler to Work with Multicore Processors","authors":"D. Kiran, S. Gurunarayanan, J. P. Misra","doi":"10.1109/PACC.2011.5978868","DOIUrl":"https://doi.org/10.1109/PACC.2011.5978868","url":null,"abstract":"We present a parallelization scheme involving extracting intra block parallelism within sequential programs which are in SSA form and scheduling block on to multicore processor. Since we are working on SSA form program, we are able to exploit more parallelism compared to existing parallelization compilers. Also an attempt is made to schedule to multiple cores taking by number of registers into consideration. At the end we show how our approach will give solution to direct cache coherence problem.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122323421","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 : 2011-07-20DOI: 10.1109/PACC.2011.5979030
S. Nirmala, B. Veena Abirami, D. Manamalli
Abstract-Chemical plants are tightly integrated processes, which exhibit nonlinear behaviour and complex dynamic properties. For decades, the chemical process industry has relied on single-loop linear controllers to regulate such systems. The multivariable four-tank system exhibits complex dynamics, which includes interaction, transmission zero, and non-minimum phase characteristics that emerge from a simple cascade of tanks. The linearised dynamics of the system have a multivariable zero that is possible to move along the real axis by changing a valve. The zero can be placed in both the left and the right half-plane. The four-tank process is ideal for illustrating many concepts in multivariable control. In this paper, a linearised state-space model of the four tank process was developed in the non-minimum phase region and a model predictive controller was designed using this model. The performance of this set up was studied for reference tracking and disturbance rejection cases.
{"title":"Design of Model Predictive Controller for a Four-Tank Process Using Linear State Space Model and Performance Study for Reference Tracking under Disturbances","authors":"S. Nirmala, B. Veena Abirami, D. Manamalli","doi":"10.1109/PACC.2011.5979030","DOIUrl":"https://doi.org/10.1109/PACC.2011.5979030","url":null,"abstract":"Abstract-Chemical plants are tightly integrated processes, which exhibit nonlinear behaviour and complex dynamic properties. For decades, the chemical process industry has relied on single-loop linear controllers to regulate such systems. The multivariable four-tank system exhibits complex dynamics, which includes interaction, transmission zero, and non-minimum phase characteristics that emerge from a simple cascade of tanks. The linearised dynamics of the system have a multivariable zero that is possible to move along the real axis by changing a valve. The zero can be placed in both the left and the right half-plane. The four-tank process is ideal for illustrating many concepts in multivariable control. In this paper, a linearised state-space model of the four tank process was developed in the non-minimum phase region and a model predictive controller was designed using this model. The performance of this set up was studied for reference tracking and disturbance rejection cases.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131509088","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 : 2011-07-20DOI: 10.1109/PACC.2011.5979040
A. Raghuvamshi, Pallipamu Venkateswara Rao
Cryptography is the practice and study of hiding information. Cryptanalysis is the study of how to crack encryption algorithms or their implementations. This paper describes an effortless method of a cryptanalyst for a knapsack cipher. The describing method is based on simple programming and calculations to crack the knapsack cipher.
{"title":"An Effortless Cryptanalytic Attack on Knapsack Cipher","authors":"A. Raghuvamshi, Pallipamu Venkateswara Rao","doi":"10.1109/PACC.2011.5979040","DOIUrl":"https://doi.org/10.1109/PACC.2011.5979040","url":null,"abstract":"Cryptography is the practice and study of hiding information. Cryptanalysis is the study of how to crack encryption algorithms or their implementations. This paper describes an effortless method of a cryptanalyst for a knapsack cipher. The describing method is based on simple programming and calculations to crack the knapsack cipher.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121758285","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 : 2011-07-20DOI: 10.1109/PACC.2011.5979045
Ayan Mukherjee, A. Pakhira, Saptarshi Das, Indranil Pan, Amitava Gupta
The paper presents a Stateflow based network test-bed to validate real-time optimal control algorithms. Genetic Algorithm (GA) based time domain performance index minimization is attempted for tuning of PI controller to handle a balanced lag and delay type First Order Plus Time Delay (FOPTD) process over network. The tuning performance is validated on a real-time communication network with artificially simulated stochastic delay, packet loss and out-of-order packets characterizing the network.
{"title":"Embedded Network Test-Bed for Validating Real-Time Control Algorithms to Ensure Optimal Time Domain Performance","authors":"Ayan Mukherjee, A. Pakhira, Saptarshi Das, Indranil Pan, Amitava Gupta","doi":"10.1109/PACC.2011.5979045","DOIUrl":"https://doi.org/10.1109/PACC.2011.5979045","url":null,"abstract":"The paper presents a Stateflow based network test-bed to validate real-time optimal control algorithms. Genetic Algorithm (GA) based time domain performance index minimization is attempted for tuning of PI controller to handle a balanced lag and delay type First Order Plus Time Delay (FOPTD) process over network. The tuning performance is validated on a real-time communication network with artificially simulated stochastic delay, packet loss and out-of-order packets characterizing the network.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663657","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 : 2011-07-20DOI: 10.1109/PACC.2011.5979039
V. Srinivasan, G. Rajenderan, J. Vandar Kuzhali, M. Aruna
There are different algorithms used in classification and these algorithm mainly used for classifying the algorithm accurately and the concept of fast classification is lagging behind in the previous algorithms. In this paper we introduce the new concept of Fuzzy Classification Algorithm (FCA) with the hybrid of ID3 and SVM. To make this algorithm with fast and accurate classification we use entropy to reduce the attributes which does not give more information and with use of lower and upper approximation for accuracy classification. The result of experiments shows that the improved fast classification algorithm considerably reduces the computational complexity and improves the speed of classification particularly in the circumstances of the large database.
{"title":"Fuzzy Classification to Identify the Risk in Diabetic Pregnancy","authors":"V. Srinivasan, G. Rajenderan, J. Vandar Kuzhali, M. Aruna","doi":"10.1109/PACC.2011.5979039","DOIUrl":"https://doi.org/10.1109/PACC.2011.5979039","url":null,"abstract":"There are different algorithms used in classification and these algorithm mainly used for classifying the algorithm accurately and the concept of fast classification is lagging behind in the previous algorithms. In this paper we introduce the new concept of Fuzzy Classification Algorithm (FCA) with the hybrid of ID3 and SVM. To make this algorithm with fast and accurate classification we use entropy to reduce the attributes which does not give more information and with use of lower and upper approximation for accuracy classification. The result of experiments shows that the improved fast classification algorithm considerably reduces the computational complexity and improves the speed of classification particularly in the circumstances of the large database.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133233260","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 : 2011-07-20DOI: 10.1109/PACC.2011.5978963
P. Manoharan, T. Rajkamal, M. Iruthayarajan
In this paper, Iterative Learning Control approach for tracking trajectory is presented. The paper includes a general introduction to ILC and a technical description of the methodology. Iterative learning control (ILC) is a learning technique used to improve the performance of systems that execute the same task multiple times. Learning transient behavior has emerged as an important topic in the design and analysis of ILC systems. Given a desired trajectory to be followed, the proposed learning algorithm improves the system performance from trail to trail by exploiting the experience gained from previous repetitions. Taking advantage of the a-priori knowledge about the systems dominating dynamics, a data-based update rule is derived which adapts the feedforward input signal after each trial. Different (nonlinear) performance objectives can be specified defining the overall learning behavior. Finally, the proposed algorithm is successfully applied to improve system performance and also to track exactly the given trajectory.
{"title":"Tracking Trajectory Using Iterative Learning Control","authors":"P. Manoharan, T. Rajkamal, M. Iruthayarajan","doi":"10.1109/PACC.2011.5978963","DOIUrl":"https://doi.org/10.1109/PACC.2011.5978963","url":null,"abstract":"In this paper, Iterative Learning Control approach for tracking trajectory is presented. The paper includes a general introduction to ILC and a technical description of the methodology. Iterative learning control (ILC) is a learning technique used to improve the performance of systems that execute the same task multiple times. Learning transient behavior has emerged as an important topic in the design and analysis of ILC systems. Given a desired trajectory to be followed, the proposed learning algorithm improves the system performance from trail to trail by exploiting the experience gained from previous repetitions. Taking advantage of the a-priori knowledge about the systems dominating dynamics, a data-based update rule is derived which adapts the feedforward input signal after each trial. Different (nonlinear) performance objectives can be specified defining the overall learning behavior. Finally, the proposed algorithm is successfully applied to improve system performance and also to track exactly the given trajectory.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133951833","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
扫码关注我们
求助内容：
应助结果提醒方式：