Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019710
M. Murmu
The distributed systems are highly fault prone environment to work with. Thus, fault tolerance is a major concern in distributed computing. The available failure resiliency techniques mitigate only the failures that are limited in some way. However, it is extremely difficult to limit the failures because the autonomous nodes may suffer autonomous failures. Nevertheless, in mission critical applications, the uncontrolled failures are unaffordable. Hence, it is highly desirable that the system survives such failures. The survivability of computer networks is a popular research topic. However, the survivability of computing systems has not been in focus. In this illustration, we have attempted to raise this issue and bring out certain requirements and features related to survivable computing systems. To the best of my knowledge, it is the first attempt in the direction.
{"title":"The survivability of computing systems","authors":"M. Murmu","doi":"10.1109/IC3I.2014.7019710","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019710","url":null,"abstract":"The distributed systems are highly fault prone environment to work with. Thus, fault tolerance is a major concern in distributed computing. The available failure resiliency techniques mitigate only the failures that are limited in some way. However, it is extremely difficult to limit the failures because the autonomous nodes may suffer autonomous failures. Nevertheless, in mission critical applications, the uncontrolled failures are unaffordable. Hence, it is highly desirable that the system survives such failures. The survivability of computer networks is a popular research topic. However, the survivability of computing systems has not been in focus. In this illustration, we have attempted to raise this issue and bring out certain requirements and features related to survivable computing systems. To the best of my knowledge, it is the first attempt in the direction.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128253833","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019648
B. N. Aravind, K. Suresh
Digital images gets degraded due to several reasons. The aim of denoising involves the restoration of signal to yield visually good quality representation. In this paper, we are referring to an image corrupted by additive Gaussian noise. The image is modeled as MRF and maximum-a-posteriori (MAP) estimate is obtained using graduated non-convexity technique. Results suggest that the proposed technique yields better compared to other techniques.
{"title":"MAP-MRF approach for image denoising","authors":"B. N. Aravind, K. Suresh","doi":"10.1109/IC3I.2014.7019648","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019648","url":null,"abstract":"Digital images gets degraded due to several reasons. The aim of denoising involves the restoration of signal to yield visually good quality representation. In this paper, we are referring to an image corrupted by additive Gaussian noise. The image is modeled as MRF and maximum-a-posteriori (MAP) estimate is obtained using graduated non-convexity technique. Results suggest that the proposed technique yields better compared to other techniques.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802008","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019760
J. Kurian, M. N. Upama Rajan, Shinoj K. Sukumaran
This paper introduces a flexible microstrip patch antenna using rubber as the substrate. The flexible antennas are gaining wide acceptance in the present scenario and these antennas play significant role in Wireless Body Area Network(WBAN) applications. The paper deals with the primary approach in using natural rubber and natural rubber with filler materials added as the substrate for patch antenna. The mechanical properties of the rubber makes the antenna flexible. The antenna operates in the ISM band(2.4-2.5) GHz. The ISM band is a candidate for WBAN operation.
{"title":"Flexible microstrip patch antenna using rubber substrate for WBAN applications","authors":"J. Kurian, M. N. Upama Rajan, Shinoj K. Sukumaran","doi":"10.1109/IC3I.2014.7019760","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019760","url":null,"abstract":"This paper introduces a flexible microstrip patch antenna using rubber as the substrate. The flexible antennas are gaining wide acceptance in the present scenario and these antennas play significant role in Wireless Body Area Network(WBAN) applications. The paper deals with the primary approach in using natural rubber and natural rubber with filler materials added as the substrate for patch antenna. The mechanical properties of the rubber makes the antenna flexible. The antenna operates in the ISM band(2.4-2.5) GHz. The ISM band is a candidate for WBAN operation.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124895572","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019729
B. Simhachalam, G. Ganesan
Classification or Clustering is the task of grouping similar objects based on the similarity among the individuals. The techniques using in clustering are mostly unsupervised methods. In this study, Possibilistic Fuzzy C-means (PFCM) clustering technique is used to classify the patients into different clusters of thyroid diseases. Further, the results of Possibilistic Fuzzy C-means clustering algorithm and Fuzzy c-Means clustering (FCM) algorithm are compared according to the classification performance. The results exhibit that the Possibilistic Fuzzy C-means clustering algorithm performs well.
{"title":"Possibilistic Fuzzy C-means clustering on medical diagnostic systems","authors":"B. Simhachalam, G. Ganesan","doi":"10.1109/IC3I.2014.7019729","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019729","url":null,"abstract":"Classification or Clustering is the task of grouping similar objects based on the similarity among the individuals. The techniques using in clustering are mostly unsupervised methods. In this study, Possibilistic Fuzzy C-means (PFCM) clustering technique is used to classify the patients into different clusters of thyroid diseases. Further, the results of Possibilistic Fuzzy C-means clustering algorithm and Fuzzy c-Means clustering (FCM) algorithm are compared according to the classification performance. The results exhibit that the Possibilistic Fuzzy C-means clustering algorithm performs well.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125745060","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019783
Anjuli Garg, C. Rama Krishna
Cloud computing is a technology which computes the resources and delivered as a service over a network in virtual form. Cloud computing is a bigger and broad concept which allows people to access the services through the use of internet from various devices. It has rapidly gained the popularity and captures the IT industries, colleges and institutes in recent years. Due to its advanced service benefits, numbers of users are increasing day-by-day. Hence, the need of task scheduling in cloud is increasing. Task scheduling is done to allocate the tasks onto the resources effectively and efficiently. A number of scheduling algorithms have been developed till now. A good scheduling strategy has the capability to adapt to changing environment and type of tasks. In this paper, we proposed a meta-heuristic scheduling algorithm i.e. improved honey bees life scheduling algorithm for a public a cloud (IHBSLA). The new scheduling algorithm is simulated using Cloudsim toolkit. Experimental results showed that our proposed algorithm performs 50% better than honey bees life scheduling algorithm (HBLSA) in terms of cost.
{"title":"An improved honey bees life scheduling algorithm for a public cloud","authors":"Anjuli Garg, C. Rama Krishna","doi":"10.1109/IC3I.2014.7019783","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019783","url":null,"abstract":"Cloud computing is a technology which computes the resources and delivered as a service over a network in virtual form. Cloud computing is a bigger and broad concept which allows people to access the services through the use of internet from various devices. It has rapidly gained the popularity and captures the IT industries, colleges and institutes in recent years. Due to its advanced service benefits, numbers of users are increasing day-by-day. Hence, the need of task scheduling in cloud is increasing. Task scheduling is done to allocate the tasks onto the resources effectively and efficiently. A number of scheduling algorithms have been developed till now. A good scheduling strategy has the capability to adapt to changing environment and type of tasks. In this paper, we proposed a meta-heuristic scheduling algorithm i.e. improved honey bees life scheduling algorithm for a public a cloud (IHBSLA). The new scheduling algorithm is simulated using Cloudsim toolkit. Experimental results showed that our proposed algorithm performs 50% better than honey bees life scheduling algorithm (HBLSA) in terms of cost.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121766013","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}
Motor imagery (MI) is a mental rehearsal of movement without any body movement. Brain-Computer Interface (BCI) uses MI in the neurological rehabilitation, especially in stroke rehabilitation to restore the patient's motor abilities. BCI based on MI translates the subjects motor intent into control signals to control the devices like robotic arms, wheelchairs or to navigate the virtual worlds. In this work, multichannel electroencephalogram (EEG) signals of imagination of a right hand and right foot movement is considered. Common spatial pattern (CSP) is used to estimate the spatial filters for the multi-channel EEG data. The spatial filters lead to weighting of the channel/electrodes according to their variance in discriminating the two tasks performed. Channels with the largest variance are considered as significant channels. A two-fold classification method using support vector machine (SVM) is used to classify the test signal into right hand movement and right foot movement. In the present work, the analysis conducted demonstrate that the proposed twofold classification scheme can achieve upto 94.2% of accuracy in discrimination of the two tasks performed. The high-recognition rate and computational simplicity make CSP a promising method for an EEG-based BCI.
{"title":"Twofold classification of motor imagery using common spatial pattern","authors":"Kusuma Mohanchandra, Snehanshu Saha, Rashmi Deshmukh","doi":"10.1109/IC3I.2014.7019636","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019636","url":null,"abstract":"Motor imagery (MI) is a mental rehearsal of movement without any body movement. Brain-Computer Interface (BCI) uses MI in the neurological rehabilitation, especially in stroke rehabilitation to restore the patient's motor abilities. BCI based on MI translates the subjects motor intent into control signals to control the devices like robotic arms, wheelchairs or to navigate the virtual worlds. In this work, multichannel electroencephalogram (EEG) signals of imagination of a right hand and right foot movement is considered. Common spatial pattern (CSP) is used to estimate the spatial filters for the multi-channel EEG data. The spatial filters lead to weighting of the channel/electrodes according to their variance in discriminating the two tasks performed. Channels with the largest variance are considered as significant channels. A two-fold classification method using support vector machine (SVM) is used to classify the test signal into right hand movement and right foot movement. In the present work, the analysis conducted demonstrate that the proposed twofold classification scheme can achieve upto 94.2% of accuracy in discrimination of the two tasks performed. The high-recognition rate and computational simplicity make CSP a promising method for an EEG-based BCI.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121860248","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019616
C. S. Jamadagni, C. Chethan, Yv Jeppu, S. Kamble, Vijay Desai
This paper discusses an approach for system simulation of an autopilot system designed for a Bell helicopter model. The flight controls for the helicopter is designed in Matlab/Simulink and the same is visualized in X-Plane flight simulator. The approach involves software in loop simulation method where controls are designed in Matlab/Simulink and the responses are observed on X-Plane plant. The interaction between the Matlab/Simulink and X-Plane is through UDP. A parameter identification of the X-Plane model is carried out from data obtained through UDP. This simulation setup is a good way to learn the intricacies of systems development, plant identification and control.
{"title":"System simulation approach for helicopter autopilot","authors":"C. S. Jamadagni, C. Chethan, Yv Jeppu, S. Kamble, Vijay Desai","doi":"10.1109/IC3I.2014.7019616","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019616","url":null,"abstract":"This paper discusses an approach for system simulation of an autopilot system designed for a Bell helicopter model. The flight controls for the helicopter is designed in Matlab/Simulink and the same is visualized in X-Plane flight simulator. The approach involves software in loop simulation method where controls are designed in Matlab/Simulink and the responses are observed on X-Plane plant. The interaction between the Matlab/Simulink and X-Plane is through UDP. A parameter identification of the X-Plane model is carried out from data obtained through UDP. This simulation setup is a good way to learn the intricacies of systems development, plant identification and control.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122822445","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019752
Mithun Vijayan, M. J. Josemartin, P. R. Geetharanjin
In this paper, an undecimated double density dual tree discrete wavelet transform (UDDDT-DWT) based image resolution enhancement technique is proposed. The critically sampled discrete wavelet transform (DWT) suffers from the drawbacks of being shift-variant and lacking the capacity to process directional information in images. The double density dual tree wavelet transform (DDDT-WT) is an approximately shift-invariant transform capturing directional information. The UDDDT-DWT is an improvement of the DDDT-DWT, making it exactly shift-invariant. The method uses a forward and inverse (UDDDT-DWT) to construct a high-resolution (HR) image from the given lower-resolution (LR) image. The HR image is reconstructed from the LR image using the inverse UDDDT-DWT. Results are presented and discussed through comparisons between state-of-the-art resolution enhancement methods.
{"title":"Image resolution enhancement using undecimated double density dual tree wavelet transform","authors":"Mithun Vijayan, M. J. Josemartin, P. R. Geetharanjin","doi":"10.1109/IC3I.2014.7019752","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019752","url":null,"abstract":"In this paper, an undecimated double density dual tree discrete wavelet transform (UDDDT-DWT) based image resolution enhancement technique is proposed. The critically sampled discrete wavelet transform (DWT) suffers from the drawbacks of being shift-variant and lacking the capacity to process directional information in images. The double density dual tree wavelet transform (DDDT-WT) is an approximately shift-invariant transform capturing directional information. The UDDDT-DWT is an improvement of the DDDT-DWT, making it exactly shift-invariant. The method uses a forward and inverse (UDDDT-DWT) to construct a high-resolution (HR) image from the given lower-resolution (LR) image. The HR image is reconstructed from the LR image using the inverse UDDDT-DWT. Results are presented and discussed through comparisons between state-of-the-art resolution enhancement methods.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126033950","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019743
D. A. Kumar, S. Meher
Granular neural networks (GNNs) take the fuzzy granulated input and process them through neural networks (NNs). As a result, performance of GNNs depends highly on the granulation process and initial weights of NNs. The initial weights between nodes of GNNs provide the starting point in the searching of the lowest cost function value. The present article proposes GNN model that use class-belonging (CB) fuzzy granulation of input information and rough set-theoretic weight initialization of NNs. The model thus avoids the random initialization of weights and provides improved decisions at the output with CB granulation. Classification performance of the proposed GNN model has been assessed using various measurement indexes and its superiority over similar other methods is justified. Conventional back propagation algorithm is used to train the proposed model of GNN.
{"title":"Granular neural networks models with class-belonging granulation","authors":"D. A. Kumar, S. Meher","doi":"10.1109/IC3I.2014.7019743","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019743","url":null,"abstract":"Granular neural networks (GNNs) take the fuzzy granulated input and process them through neural networks (NNs). As a result, performance of GNNs depends highly on the granulation process and initial weights of NNs. The initial weights between nodes of GNNs provide the starting point in the searching of the lowest cost function value. The present article proposes GNN model that use class-belonging (CB) fuzzy granulation of input information and rough set-theoretic weight initialization of NNs. The model thus avoids the random initialization of weights and provides improved decisions at the output with CB granulation. Classification performance of the proposed GNN model has been assessed using various measurement indexes and its superiority over similar other methods is justified. Conventional back propagation algorithm is used to train the proposed model of GNN.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123020207","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019664
A. N. Nagamani, S. Ashwin, V. K. Agrawal
Reversible logic has gained the interest of many researchers due to its applicability in emerging low power technologies such as Quantum computing, QCA, optical computing etc., Adders/Subtractors are basic design components of any processor. Optimized design of these adders results in efficient processors. In this work we propose optimized Binary adders/subtractors and BCD adders. The adders/subtractors designed in this work are optimized for Quantum cost and Delay. We also propose a generic design of n-bit adders and subtractors. In this work, we explore the use of Negative control lines for detecting overflow logic of BCD adder which considerably reduces Quantum cost, delay and gate count which result in high speed BCD adder with optimized area which give way to lot of scope in the field of reversible computing in near future.
{"title":"Design of optimized reversible binary adder/subtractor and BCD adder","authors":"A. N. Nagamani, S. Ashwin, V. K. Agrawal","doi":"10.1109/IC3I.2014.7019664","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019664","url":null,"abstract":"Reversible logic has gained the interest of many researchers due to its applicability in emerging low power technologies such as Quantum computing, QCA, optical computing etc., Adders/Subtractors are basic design components of any processor. Optimized design of these adders results in efficient processors. In this work we propose optimized Binary adders/subtractors and BCD adders. The adders/subtractors designed in this work are optimized for Quantum cost and Delay. We also propose a generic design of n-bit adders and subtractors. In this work, we explore the use of Negative control lines for detecting overflow logic of BCD adder which considerably reduces Quantum cost, delay and gate count which result in high speed BCD adder with optimized area which give way to lot of scope in the field of reversible computing in near future.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121433171","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
扫码关注我们
求助内容：
应助结果提醒方式：