Pub Date : 2015-12-01DOI: 10.1109/MAMI.2015.7456616
A. Rao, K. Sujatha, A. Uday, N. N. Mani
Providing security for an idle browser is a critical task. Now a day's Web browser has become a very important tool for day to day life in Internet world. Keeping the importance of users privacy, users private information must be secured with the help of a strong unbreakable security feature, otherwise one can easily violate user's privacy. A secured mini size Web browser - named TurtleMini is developed and tested for its performance under various test conditions. This paper proposes the concept of browser lock is introduced based on the idle time as per user choice by the user at the time of opening the browser. The idea of this security service is to provide a 4-digit pin while starting the browser, while using the browser if the user left the system idle for certain time then the browser locks and ask the user to enter the password to continue browsing. Hence other users cannot access the contents of the former user. The Privacy Preserving Secured Web Browser Turtle Mini is simulated and the test results show that the proposed system is secured and flexible. The feedback is collected from various user communities and is presented. Turtle Mini works even without lock time for general browsing purpose by proceeding without lock option. This browser offers general features like any other popular browsers such as bookmarks, browsing history, progress bar etc. with less memory.
{"title":"Idle lock based privacy preserving secured web browser","authors":"A. Rao, K. Sujatha, A. Uday, N. N. Mani","doi":"10.1109/MAMI.2015.7456616","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456616","url":null,"abstract":"Providing security for an idle browser is a critical task. Now a day's Web browser has become a very important tool for day to day life in Internet world. Keeping the importance of users privacy, users private information must be secured with the help of a strong unbreakable security feature, otherwise one can easily violate user's privacy. A secured mini size Web browser - named TurtleMini is developed and tested for its performance under various test conditions. This paper proposes the concept of browser lock is introduced based on the idle time as per user choice by the user at the time of opening the browser. The idea of this security service is to provide a 4-digit pin while starting the browser, while using the browser if the user left the system idle for certain time then the browser locks and ask the user to enter the password to continue browsing. Hence other users cannot access the contents of the former user. The Privacy Preserving Secured Web Browser Turtle Mini is simulated and the test results show that the proposed system is secured and flexible. The feedback is collected from various user communities and is presented. Turtle Mini works even without lock time for general browsing purpose by proceeding without lock option. This browser offers general features like any other popular browsers such as bookmarks, browsing history, progress bar etc. with less memory.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128422618","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456601
Smrutilekha Samanta, A. Dastidar
Serializer/Deserializer (SerDes) is a pair of functional block which play a vital role in many electronic devices used for high speed communication. The basic SerDes function is made up of two functional blocks: the Parallel In Serial Out (PISO) block and the Serial In Parallel Out (SIPO) block. An efficient SerDes offer high speed and low power consumption. In this paper an attempt is made to optimize the design for high speed and low power SerDes for wideband communication such as Ethernet applications. The power consumption and data transfer rate of the proposed design was calculated to be 737 mWand 25Gb/s respectively.
{"title":"Implementation of 10bit SerDes for Gigabit Ethernet PHY","authors":"Smrutilekha Samanta, A. Dastidar","doi":"10.1109/MAMI.2015.7456601","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456601","url":null,"abstract":"Serializer/Deserializer (SerDes) is a pair of functional block which play a vital role in many electronic devices used for high speed communication. The basic SerDes function is made up of two functional blocks: the Parallel In Serial Out (PISO) block and the Serial In Parallel Out (SIPO) block. An efficient SerDes offer high speed and low power consumption. In this paper an attempt is made to optimize the design for high speed and low power SerDes for wideband communication such as Ethernet applications. The power consumption and data transfer rate of the proposed design was calculated to be 737 mWand 25Gb/s respectively.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129466539","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456595
M. Mohanty, P. Biswal, S. Sabut
Ventricular fibrillation (VF) is the intense arrhythmia condition which is the major cause of cardiac arrest. Quick and precise detection of VF is crucial for the success of delivering an electrical shock through defibrillator to save life. Feature extraction algorithms have been used in electrocardiogram (ECG) signal to extract temporal and spectral parameters for rhythm detection. In this paper, we present different arrhythmias detection algorithms for feature extraction of ECG signal. Seven parameters both temporal and spectral features are computed for normal and abnormal conditions of ECG signals. The algorithms are tested and the results are compared with widely recognized databases of MITBIH, SVDB. The extracted features may be used to improve the efficiency of machine learning algorithms for detection of life-threatening arrhythmias.
{"title":"Feature extraction of ECG signal for detection of ventricular fibrillation","authors":"M. Mohanty, P. Biswal, S. Sabut","doi":"10.1109/MAMI.2015.7456595","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456595","url":null,"abstract":"Ventricular fibrillation (VF) is the intense arrhythmia condition which is the major cause of cardiac arrest. Quick and precise detection of VF is crucial for the success of delivering an electrical shock through defibrillator to save life. Feature extraction algorithms have been used in electrocardiogram (ECG) signal to extract temporal and spectral parameters for rhythm detection. In this paper, we present different arrhythmias detection algorithms for feature extraction of ECG signal. Seven parameters both temporal and spectral features are computed for normal and abnormal conditions of ECG signals. The algorithms are tested and the results are compared with widely recognized databases of MITBIH, SVDB. The extracted features may be used to improve the efficiency of machine learning algorithms for detection of life-threatening arrhythmias.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114364700","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456575
Hao Ju, Shen Yin, Huijun Gao, O. Kaynak
In this paper, the Benchmark Simulation Model No. 1, which is designed for the purpose of simulating actual wastewater treatment processes, is introduced and implemented in SIMULINK environment. Then the partial least squares (PLS) model and its kernel version is studied, and wavelet transform is used to carry out the so called multi-scale kernel partial least squares (KPLS). By means of multi-scale KPLS, the prediction of key performance indicator (KPI)-the COD concentration in effluent-is implemented. Simulation results show that this prediction model has strong generalization ability under the condition that the data collected during the wastewater treatment processes are distributed unevenly and coupled tightly.
{"title":"A data-based KPI prediction approach for wastewater treatment processes","authors":"Hao Ju, Shen Yin, Huijun Gao, O. Kaynak","doi":"10.1109/MAMI.2015.7456575","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456575","url":null,"abstract":"In this paper, the Benchmark Simulation Model No. 1, which is designed for the purpose of simulating actual wastewater treatment processes, is introduced and implemented in SIMULINK environment. Then the partial least squares (PLS) model and its kernel version is studied, and wavelet transform is used to carry out the so called multi-scale kernel partial least squares (KPLS). By means of multi-scale KPLS, the prediction of key performance indicator (KPI)-the COD concentration in effluent-is implemented. Simulation results show that this prediction model has strong generalization ability under the condition that the data collected during the wastewater treatment processes are distributed unevenly and coupled tightly.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522847","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456620
B. Mahapatra, S. Patnaik
With limited resource of nodes in Manets, achieving efficiency of a resilient and a secured network is always a challenge. Implementing any algorithm to enhance performance in such a node may result in lowering the lifetime of the network and affects the efficiency of the nodes adversely. Data regression on an incoming data in a node makes the Algorithm more efficient with respect to time and space thereby improving the performance. Apart from that the Algorithm also removes the noise factor from the data before it undergoes any process. The paper proposes the idea of preprocessing the incoming data into a node in a Manet using Sequential Feature Analysis as a Data regression Technique.
{"title":"Data reduction in MANETs using forward feature construction technique","authors":"B. Mahapatra, S. Patnaik","doi":"10.1109/MAMI.2015.7456620","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456620","url":null,"abstract":"With limited resource of nodes in Manets, achieving efficiency of a resilient and a secured network is always a challenge. Implementing any algorithm to enhance performance in such a node may result in lowering the lifetime of the network and affects the efficiency of the nodes adversely. Data regression on an incoming data in a node makes the Algorithm more efficient with respect to time and space thereby improving the performance. Apart from that the Algorithm also removes the noise factor from the data before it undergoes any process. The paper proposes the idea of preprocessing the incoming data into a node in a Manet using Sequential Feature Analysis as a Data regression Technique.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124382641","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456588
Shiladitya Saha, S. Saha, P. Bhattacharyya
Health information technology is spreading all over the world to provide right medical advice for healthcare. In this context, this paper describes the application of data mining techniques to identify jaundice by analyzing liver function test reports. Artificial neural network and support vector machine classifiers are employed here for classification on the basis of liver condition. Since correct medical advice is a sensitive decision making process, seeking multiple expert opinions may be a good choice. Henceforth, classifier fusion technique is proposed for this work. Two kinds of classifier fusion techniques viz. Decision template and Dempster-Shafer theory are tested here. Several sets of MLP and SVM classifiers are combined by both the fusion techniques. Results reveal that fused multiple classifier gives better prediction accuracy as compared to single classifier. Hybridization of two ANNs and four SVM classifiers with Dempster-Shafer algorithm gives up to 97.33% of prediction accuracy.
{"title":"Classifier fusion for liver function test based Indian jaundice classification","authors":"Shiladitya Saha, S. Saha, P. Bhattacharyya","doi":"10.1109/MAMI.2015.7456588","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456588","url":null,"abstract":"Health information technology is spreading all over the world to provide right medical advice for healthcare. In this context, this paper describes the application of data mining techniques to identify jaundice by analyzing liver function test reports. Artificial neural network and support vector machine classifiers are employed here for classification on the basis of liver condition. Since correct medical advice is a sensitive decision making process, seeking multiple expert opinions may be a good choice. Henceforth, classifier fusion technique is proposed for this work. Two kinds of classifier fusion techniques viz. Decision template and Dempster-Shafer theory are tested here. Several sets of MLP and SVM classifiers are combined by both the fusion techniques. Results reveal that fused multiple classifier gives better prediction accuracy as compared to single classifier. Hybridization of two ANNs and four SVM classifiers with Dempster-Shafer algorithm gives up to 97.33% of prediction accuracy.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115461808","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456580
Mamata Mishra, C. Panigrahi, J. Sarkar, Bibudhendu Pati
In Wireless Sensor Networks (WSNs), sensor nodes suffer from limited battery power. It is a difficult task to work with sensor nodes in an energy efficient way because sensor nodes are placed in various geographical locations and once battery is over it is difficult to change. To work with this challenge, in this work we present a Game Theory Based Energy Efficient Cluster-Head Selection Approach (GECSA) based on the Subgame Perfect Nash Equilibrium (SPNE) of game theory. Then based on SPNE decision, the Cluster-Heads(CHs) are selected. For each round and for each cluster nodes play game with each other and a node which is SPNE is selected as a CH. The simulation results show increase in performance of our proposed approach as compared to the existing protocols such as UCR, DEEC, and BEEG. The simulation results are validated through MATLAB.
{"title":"GECSA: A game theory based energy efficient cluster-head selection approach in Wireless Sensor Networks","authors":"Mamata Mishra, C. Panigrahi, J. Sarkar, Bibudhendu Pati","doi":"10.1109/MAMI.2015.7456580","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456580","url":null,"abstract":"In Wireless Sensor Networks (WSNs), sensor nodes suffer from limited battery power. It is a difficult task to work with sensor nodes in an energy efficient way because sensor nodes are placed in various geographical locations and once battery is over it is difficult to change. To work with this challenge, in this work we present a Game Theory Based Energy Efficient Cluster-Head Selection Approach (GECSA) based on the Subgame Perfect Nash Equilibrium (SPNE) of game theory. Then based on SPNE decision, the Cluster-Heads(CHs) are selected. For each round and for each cluster nodes play game with each other and a node which is SPNE is selected as a CH. The simulation results show increase in performance of our proposed approach as compared to the existing protocols such as UCR, DEEC, and BEEG. The simulation results are validated through MATLAB.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"13 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115574189","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456619
B. Samanta, Shiba Prasad Dash
List accessing problem is associated with the searching and sorting of unordered records arranged linearly. Many approaches are followed and invented since more than four decades such as self-organizing linear lists in order to obtain a minimal cost for accessing the list. This paper introduces a hybrid method that is the combination of Move to Front (MTF) and transposes (TRANS) methods for the list accessing problem which results in a minimum of total access costs as compared to the cost of accessing of list using individual methods. Our paper also uses the randomized bit algorithm and look ashead concepts for obtaining the self-organizing linear list.
{"title":"A novel hybrid approach to list accessing problem using BIT algorithm","authors":"B. Samanta, Shiba Prasad Dash","doi":"10.1109/MAMI.2015.7456619","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456619","url":null,"abstract":"List accessing problem is associated with the searching and sorting of unordered records arranged linearly. Many approaches are followed and invented since more than four decades such as self-organizing linear lists in order to obtain a minimal cost for accessing the list. This paper introduces a hybrid method that is the combination of Move to Front (MTF) and transposes (TRANS) methods for the list accessing problem which results in a minimum of total access costs as compared to the cost of accessing of list using individual methods. Our paper also uses the randomized bit algorithm and look ashead concepts for obtaining the self-organizing linear list.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114378305","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456587
Bandita Sahu, P. M. Khilar
In Clustered-Underwater Wireless sensor networks (CUWSNs), battery operated sensing devices are grouped and connected with each other through wireless interfaces. Energy and processing efficiency are the two important parameters in these systems. CUWSNs with reduced number of transmissions utilize less energy and prolong the lifetime of the network. In this paper, a new protocol is proposed which is named as selective data transmission in SNR based cluster(SCSD). In this protocol, clusters are formed and the cluster heads (CH) are chosen depending on the SNR values. The number of transmissions of the cluster head and the sensor nodes are reduced by selectively transmitting the data. It also avoids congestion problem This scheme has been implemented using NS3 and it is observed that residual energy of the sensor node is improved by 2 percent.
{"title":"Selective data transmission in SNR based clustered-underwater Wireless sensor network (CUWSN)","authors":"Bandita Sahu, P. M. Khilar","doi":"10.1109/MAMI.2015.7456587","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456587","url":null,"abstract":"In Clustered-Underwater Wireless sensor networks (CUWSNs), battery operated sensing devices are grouped and connected with each other through wireless interfaces. Energy and processing efficiency are the two important parameters in these systems. CUWSNs with reduced number of transmissions utilize less energy and prolong the lifetime of the network. In this paper, a new protocol is proposed which is named as selective data transmission in SNR based cluster(SCSD). In this protocol, clusters are formed and the cluster heads (CH) are chosen depending on the SNR values. The number of transmissions of the cluster head and the sensor nodes are reduced by selectively transmitting the data. It also avoids congestion problem This scheme has been implemented using NS3 and it is observed that residual energy of the sensor node is improved by 2 percent.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129349696","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 : 2015-12-01DOI: 10.1109/MAMI.2015.7456605
K. Pritamdas, K. M. Singh
A new adaptive switching approach is presented in which the detection of noise is based on entropy of the pixels. Then the detected noisy pixels are replaced with the output of a fuzzy weighted filter. With a little increase in computational complexity over the basic Vector median filter and its varieties, this technique works well both in lower and higher noise ratios. Simulation results show that this method outperforms many other existing nonlinear filters in terms of noise reduction and fine details preservation. This technique can also be extended for images corrupted with Gaussian noise and mixed Gaussian and Impulse noise.
{"title":"A new adaptive switching approach for impulse noise removal from color images","authors":"K. Pritamdas, K. M. Singh","doi":"10.1109/MAMI.2015.7456605","DOIUrl":"https://doi.org/10.1109/MAMI.2015.7456605","url":null,"abstract":"A new adaptive switching approach is presented in which the detection of noise is based on entropy of the pixels. Then the detected noisy pixels are replaced with the output of a fuzzy weighted filter. With a little increase in computational complexity over the basic Vector median filter and its varieties, this technique works well both in lower and higher noise ratios. Simulation results show that this method outperforms many other existing nonlinear filters in terms of noise reduction and fine details preservation. This technique can also be extended for images corrupted with Gaussian noise and mixed Gaussian and Impulse noise.","PeriodicalId":108908,"journal":{"name":"2015 International Conference on Man and Machine Interfacing (MAMI)","volume":"62 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114104654","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
扫码关注我们
求助内容：
应助结果提醒方式：