Pub Date : 2012-07-26DOI: 10.1109/ICCCNT.2012.6395941
S. Devi, P. Yogesh
Distributed Denial of Service (DDoS) attacks are posing major threat to today's essential Internet service because of its ability to create a huge volume of unwanted traffic. It is hard to detect and respond to DDoS attacks due to large and complex network environments. It becomes more serious when such attacks occur during the flash crowd. Both Flash crowds and DDoS attacks have very similar properties in terms of internet traffic; however Flash crowds are legitimate flows and DDoS attacks are illegitimate flows. This paper proposes a scheme to counter application layer DDoS attack and to schedule the flash crowd during DDoS attacks. In this scheme, an Access Matrix is defined to capture the access patterns of the legitimate clients and the normal flash crowd. Dimensionality reduction schemes are applied to reduce the multidimensional Access Matrix. A counter-mechanism consisting of a suspicion assignment mechanism and a scheduler is deployed. The suspicion mechanism assigns a score to each client session, and the scheduler decides whether to forward the session's requests or to drop the request based on the suspicion score.
{"title":"An effective approach to counter application layer DDoS attacks","authors":"S. Devi, P. Yogesh","doi":"10.1109/ICCCNT.2012.6395941","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6395941","url":null,"abstract":"Distributed Denial of Service (DDoS) attacks are posing major threat to today's essential Internet service because of its ability to create a huge volume of unwanted traffic. It is hard to detect and respond to DDoS attacks due to large and complex network environments. It becomes more serious when such attacks occur during the flash crowd. Both Flash crowds and DDoS attacks have very similar properties in terms of internet traffic; however Flash crowds are legitimate flows and DDoS attacks are illegitimate flows. This paper proposes a scheme to counter application layer DDoS attack and to schedule the flash crowd during DDoS attacks. In this scheme, an Access Matrix is defined to capture the access patterns of the legitimate clients and the normal flash crowd. Dimensionality reduction schemes are applied to reduce the multidimensional Access Matrix. A counter-mechanism consisting of a suspicion assignment mechanism and a scheduler is deployed. The suspicion mechanism assigns a score to each client session, and the scheduler decides whether to forward the session's requests or to drop the request based on the suspicion score.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131801261","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6396057
S. Jeyadevi, R. Manikumar, P. Gayathri, B. Mahalakshmi, M. Seethalakshmi
A solar energy application with maximum efficiency is the need of the day to meet out the power demands. Thermal Performance of a flat plate solar air heater is less and several approaches such as Genetic Algorithm, etc., have been attempted to solve this problem. The purpose of this work is to find the advantages of the application of Differential Evolution (DE) for the optimization of a flat plate solar air heater. The thermal efficiency of flat plate solar air heater is tested by optimizing its construction and operating variables such as Reynolds number, tilt angle of the plate, emissivity of the plate and velocity of air etc., The impact of these parameters variation on thermal performance is analyzed. In this work, the climatic data for the city of Hamirpur is considered, which is taken from an already published work in which authors applied Genetic Algorithm (GA). The reported results of GA are also considered for comparison with PSO and DE. Simulation results are quite promising and show that DE performs better than PSO and GA.
{"title":"Optimization of solar air heater using differential evolution","authors":"S. Jeyadevi, R. Manikumar, P. Gayathri, B. Mahalakshmi, M. Seethalakshmi","doi":"10.1109/ICCCNT.2012.6396057","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6396057","url":null,"abstract":"A solar energy application with maximum efficiency is the need of the day to meet out the power demands. Thermal Performance of a flat plate solar air heater is less and several approaches such as Genetic Algorithm, etc., have been attempted to solve this problem. The purpose of this work is to find the advantages of the application of Differential Evolution (DE) for the optimization of a flat plate solar air heater. The thermal efficiency of flat plate solar air heater is tested by optimizing its construction and operating variables such as Reynolds number, tilt angle of the plate, emissivity of the plate and velocity of air etc., The impact of these parameters variation on thermal performance is analyzed. In this work, the climatic data for the city of Hamirpur is considered, which is taken from an already published work in which authors applied Genetic Algorithm (GA). The reported results of GA are also considered for comparison with PSO and DE. Simulation results are quite promising and show that DE performs better than PSO and GA.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127620145","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6395910
S. Mhamane, L. Lobo
Internet banking has their separate account for users and is managed by Banks or retail store. The aim of this paper is to detect and prevent fraud in case of internet banking using Hidden Markov Model algorithm. At the same time, we have tried to ensure that genuine transactions are not rejected by making use of one time password that was generated by the Bank server and sent to the particular customers through SMS to their Mobile number which is registered in the system. Banks are seeking to minimize huge losses through fraud detection and prevention systems. Many different advanced fraud technologies are being applied to fraudulent Internet banking transactions detection and prevention. However, they have no effective detection mechanism to identify legitimate users and trace their unlawful activities. We propose a model to overcome all these difficulties using Hidden Markov Model.
{"title":"Internet banking fraud detection using HMM","authors":"S. Mhamane, L. Lobo","doi":"10.1109/ICCCNT.2012.6395910","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6395910","url":null,"abstract":"Internet banking has their separate account for users and is managed by Banks or retail store. The aim of this paper is to detect and prevent fraud in case of internet banking using Hidden Markov Model algorithm. At the same time, we have tried to ensure that genuine transactions are not rejected by making use of one time password that was generated by the Bank server and sent to the particular customers through SMS to their Mobile number which is registered in the system. Banks are seeking to minimize huge losses through fraud detection and prevention systems. Many different advanced fraud technologies are being applied to fraudulent Internet banking transactions detection and prevention. However, they have no effective detection mechanism to identify legitimate users and trace their unlawful activities. We propose a model to overcome all these difficulties using Hidden Markov Model.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134506443","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6395858
P. Iyappan, V. PrasannaVenkatesan, R. Amarnath, L. Noor Mouhammed, A. Selvamani
Nowadays smart way of doing the work is very familiar among every business oriented enterprise applications. In this paper we propose an enhanced smart multi-banking integrated using service oriented composition model by which using single username and password the user can able to access multiple bank accounts. Every user can have more than one bank accounts and each bank provides different username and passwords. To operate his/her account he/she wants to remember all the user name and password of each bank. This Multi Banking Interface is aimed to enhance the current services of the bank to meet the requirements for future-banking world for the users who is having accounts in multiple banks. By using this interface any user who is having accounts in various banks can directly login to Multiple Banks and make any kind of transactions. By using this interface client can also able to see all various bank account summaries in the single page. He/she can get minimum 10 transaction details of all banks. Even amount can be transacted between the banks in the single interface. In addition to this, the main feature of the paper is, Sometimes the client need a particular amount, but all the banks in which he/she has account is having balance lesser then the required amount. For this we are providing a dynamic service composition interface to overcome this problem. Consider `n' number of banks is going to participate in multi-banking interface. Here one of the banks acts as a primary and remaining are secondary one. Consider the scenario that the user requires the amount of Rs.10000/- but no banks have full-required amount. Now the integrated system checks whether 60% of required amount is available in any of the banks. If so, it takes the amount from the corresponding bank otherwise it checks for 50% of required amount and so on for particular limit. Similarly, the remaining amount is taken from other banks in such criteria. Now the integrated system transfers the amount, which is taken from the secondary banks to primary bank account. Finally From the primary bank account the user can withdraw the required amount. If the client needs to add one more bank he/she can add the bank details and make our system to composite with the existing bank services dynamically.
{"title":"An enhanced smart multi-banking integrated system — Service oriented approach","authors":"P. Iyappan, V. PrasannaVenkatesan, R. Amarnath, L. Noor Mouhammed, A. Selvamani","doi":"10.1109/ICCCNT.2012.6395858","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6395858","url":null,"abstract":"Nowadays smart way of doing the work is very familiar among every business oriented enterprise applications. In this paper we propose an enhanced smart multi-banking integrated using service oriented composition model by which using single username and password the user can able to access multiple bank accounts. Every user can have more than one bank accounts and each bank provides different username and passwords. To operate his/her account he/she wants to remember all the user name and password of each bank. This Multi Banking Interface is aimed to enhance the current services of the bank to meet the requirements for future-banking world for the users who is having accounts in multiple banks. By using this interface any user who is having accounts in various banks can directly login to Multiple Banks and make any kind of transactions. By using this interface client can also able to see all various bank account summaries in the single page. He/she can get minimum 10 transaction details of all banks. Even amount can be transacted between the banks in the single interface. In addition to this, the main feature of the paper is, Sometimes the client need a particular amount, but all the banks in which he/she has account is having balance lesser then the required amount. For this we are providing a dynamic service composition interface to overcome this problem. Consider `n' number of banks is going to participate in multi-banking interface. Here one of the banks acts as a primary and remaining are secondary one. Consider the scenario that the user requires the amount of Rs.10000/- but no banks have full-required amount. Now the integrated system checks whether 60% of required amount is available in any of the banks. If so, it takes the amount from the corresponding bank otherwise it checks for 50% of required amount and so on for particular limit. Similarly, the remaining amount is taken from other banks in such criteria. Now the integrated system transfers the amount, which is taken from the secondary banks to primary bank account. Finally From the primary bank account the user can withdraw the required amount. If the client needs to add one more bank he/she can add the bank details and make our system to composite with the existing bank services dynamically.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134620291","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6396074
A. Meenakshi, K. Alagarsamy
Modern digital databases are immersed with massive collection of data. The proliferation, ubiquity and increasing power of computer technology have increased data collection and storage. As datasets have grown in size and complexity, direct hands-on data analysis has increasingly been augmented in-direct, automatic data processing. There are so many existing algorithms to find frequent itemsets in Association Rule Mining. In this paper, we have modified FPtree algorithm as HCFPMine frequency of tree (Horizontal Compact Frequent Pattern Mining) combines all the maximum occurrence of frequent itemsets before converting into the tree structure. We have also used median value for finding same frequency of items and inserted it as node in the tree structure. We have explained it with an algorithm and illustrated with examples and also depicted the runtime and memory space for the construction of the tree structure.
现代数字数据库中充斥着海量的数据。计算机技术的普及、普及和日益增强的能力增加了数据的收集和存储。随着数据集的规模和复杂性的增长，直接动手的数据分析越来越多地被直接、自动的数据处理所增强。在关联规则挖掘中，现有的频繁项集查找算法很多。在本文中，我们将FPtree算法改进为HCFPMine frequency of tree (Horizontal Compact frequency Pattern Mining)，将所有频繁项集的最大出现次数组合在一起，然后转换为树结构。我们还使用中值来查找相同频率的项目，并将其作为树结构中的节点插入。我们用一个算法解释了它，用例子说明了它，还描述了构建树形结构的运行时和内存空间。
{"title":"An implementation for dynamic combination of frequent items in HCFPMINETREE","authors":"A. Meenakshi, K. Alagarsamy","doi":"10.1109/ICCCNT.2012.6396074","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6396074","url":null,"abstract":"Modern digital databases are immersed with massive collection of data. The proliferation, ubiquity and increasing power of computer technology have increased data collection and storage. As datasets have grown in size and complexity, direct hands-on data analysis has increasingly been augmented in-direct, automatic data processing. There are so many existing algorithms to find frequent itemsets in Association Rule Mining. In this paper, we have modified FPtree algorithm as HCFPMine frequency of tree (Horizontal Compact Frequent Pattern Mining) combines all the maximum occurrence of frequent itemsets before converting into the tree structure. We have also used median value for finding same frequency of items and inserted it as node in the tree structure. We have explained it with an algorithm and illustrated with examples and also depicted the runtime and memory space for the construction of the tree structure.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124378797","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6396007
K. Shilpa, C. Lakshminarayana, M. K. Singh
Scheduling is very important and critical part of high level synthesis. Quality of schedule rules the performance of chip in terms of cost and speed. Define Optimal schedule is a challenging and tedious task. This paper has proposed the concept of Integer Evolutionary Programming (IEP) which is extension and discrete version of Evolution Programming (EP) to handle the scheduling as a constraint optimization problem over the Integer Linear Programming (ILP) formulation of problem. Proposed method can apply over any complexity of problem easily and efficiently. Verification of developed algorithm has given over benchmark problem.
{"title":"Scheduling in high level synthesis using discrete evolutionary programming","authors":"K. Shilpa, C. Lakshminarayana, M. K. Singh","doi":"10.1109/ICCCNT.2012.6396007","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6396007","url":null,"abstract":"Scheduling is very important and critical part of high level synthesis. Quality of schedule rules the performance of chip in terms of cost and speed. Define Optimal schedule is a challenging and tedious task. This paper has proposed the concept of Integer Evolutionary Programming (IEP) which is extension and discrete version of Evolution Programming (EP) to handle the scheduling as a constraint optimization problem over the Integer Linear Programming (ILP) formulation of problem. Proposed method can apply over any complexity of problem easily and efficiently. Verification of developed algorithm has given over benchmark problem.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114353755","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6396103
Geng Zheng, S. Mohanty, E. Kougianos
In the current trend of short time-to-market and complex circuits and systems containing billions of nanoscale transistor, fast and accurate time-domain simulations are crucial for analog and mixed-signal (AMS) design and verification. This will ensure reduction in the non-recurrent cost and make electronics cheaper. In this paper, in order to investigate the options for fast and accurate simulations, two popular modeling tools and languages (Simulink and Verilog-AMS) capable of constructing behavioral models are evaluated. A delta-sigma modulator design with biomedical applications is used as a case study. The system-level design of a third-order, feedforward continuous-time (CT) delta-sigma modulator (DSM) with a signal-to-noise ratio (SNR) of 87.3 dB and 20 kHz input bandwidth is presented. This CT DSM is to be employed in an analog-to-digital converter (ADC) targeting several portable biomedical applications which require a 10 kHz signal bandwidth and higher than 10-bit resolution. Simulink and Verilog-AMS were used throughout the design. The efficiency are compared in terms of modeling effort, simulation performance, and accuracy.
{"title":"Design and modeling of a continuous-time delta-sigma modulator for biopotential signal acquisition: Simulink vs. Verilog-AMS perspective","authors":"Geng Zheng, S. Mohanty, E. Kougianos","doi":"10.1109/ICCCNT.2012.6396103","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6396103","url":null,"abstract":"In the current trend of short time-to-market and complex circuits and systems containing billions of nanoscale transistor, fast and accurate time-domain simulations are crucial for analog and mixed-signal (AMS) design and verification. This will ensure reduction in the non-recurrent cost and make electronics cheaper. In this paper, in order to investigate the options for fast and accurate simulations, two popular modeling tools and languages (Simulink and Verilog-AMS) capable of constructing behavioral models are evaluated. A delta-sigma modulator design with biomedical applications is used as a case study. The system-level design of a third-order, feedforward continuous-time (CT) delta-sigma modulator (DSM) with a signal-to-noise ratio (SNR) of 87.3 dB and 20 kHz input bandwidth is presented. This CT DSM is to be employed in an analog-to-digital converter (ADC) targeting several portable biomedical applications which require a 10 kHz signal bandwidth and higher than 10-bit resolution. Simulink and Verilog-AMS were used throughout the design. The efficiency are compared in terms of modeling effort, simulation performance, and accuracy.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970279","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6395973
V. Thanikachalam, K. Thyagharajan
This paper presents a method to recognize the action being performed by a human in a video. Applications like video surveillance, highlight extraction and video summarization require the recognition of the activities occurring in the video. The analysis of human activities in video is an area with increasingly important consequences from security and surveillance to entertainment and personal archiving. We propose an action recognition scheme based on accumulated motion and gradient of motion, in which the former is motion based and the latter is appearance based. Firstly, we define an Accumulated Motion Image (AMI) with which energy histograms are built and normalized for extracting features. Then we compute DFT from the energy histograms so that features like mean and variance are obtained. Secondly, we try finding out gradient direction and magnitude by taking a key frame from the video. Again, we extract mean and variance from histogram giving out few more feature vectors. Finally with all the extracted features, we train the system using Dynamic Time Warping(DTW) to recognize the various actions.Public dataset is used for Evaluation.
{"title":"Human action recognition using accumulated motion and gradient of motion from video","authors":"V. Thanikachalam, K. Thyagharajan","doi":"10.1109/ICCCNT.2012.6395973","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6395973","url":null,"abstract":"This paper presents a method to recognize the action being performed by a human in a video. Applications like video surveillance, highlight extraction and video summarization require the recognition of the activities occurring in the video. The analysis of human activities in video is an area with increasingly important consequences from security and surveillance to entertainment and personal archiving. We propose an action recognition scheme based on accumulated motion and gradient of motion, in which the former is motion based and the latter is appearance based. Firstly, we define an Accumulated Motion Image (AMI) with which energy histograms are built and normalized for extracting features. Then we compute DFT from the energy histograms so that features like mean and variance are obtained. Secondly, we try finding out gradient direction and magnitude by taking a key frame from the video. Again, we extract mean and variance from histogram giving out few more feature vectors. Finally with all the extracted features, we train the system using Dynamic Time Warping(DTW) to recognize the various actions.Public dataset is used for Evaluation.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114995638","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6396072
R. K. Megalingam, S. Sugunan, Abishek Thekkeyil Kunnath
Quick advancement in wireless communication devices and systems like mobile phone technology has had a significant impact on the health care industry. One such important application is to monitor patient's health status at anytime and anywhere [1]. In this paper we propose an emergency medical service system which can be used for DHA (Disaster hit areas). The proposed system can measure the vital parameters of the patient without the requirement of an elaborate patient monitoring system which consumes a lot of power, time and space, also need experts to setup the system. The system is designed such that it is easily portable, power efficient and user-friendly mode of operation for the ease of usage in a disaster hit area. Also for the communication with far away expert doctors the system needs wireless network connection (WNC) namely GSM (Global System for Mobile Communication). One of the paramount considerations in the design is to make the device compact and portable as well as to minimize power consumption.
{"title":"Power competent health monitoring system for a Disaster hit area","authors":"R. K. Megalingam, S. Sugunan, Abishek Thekkeyil Kunnath","doi":"10.1109/ICCCNT.2012.6396072","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6396072","url":null,"abstract":"Quick advancement in wireless communication devices and systems like mobile phone technology has had a significant impact on the health care industry. One such important application is to monitor patient's health status at anytime and anywhere [1]. In this paper we propose an emergency medical service system which can be used for DHA (Disaster hit areas). The proposed system can measure the vital parameters of the patient without the requirement of an elaborate patient monitoring system which consumes a lot of power, time and space, also need experts to setup the system. The system is designed such that it is easily portable, power efficient and user-friendly mode of operation for the ease of usage in a disaster hit area. Also for the communication with far away expert doctors the system needs wireless network connection (WNC) namely GSM (Global System for Mobile Communication). One of the paramount considerations in the design is to make the device compact and portable as well as to minimize power consumption.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116954722","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 : 2012-07-26DOI: 10.1109/ICCCNT.2012.6396086
Chirag N. Modi, D. Patel, Avi Patel, R. Muttukrishnan
One of the major security issues in cloud computing is to protect against network intrusions that affect confidentiality, availability and integrity of Cloud resources and offered services. To address this issue, we design and integrate Bayesian Classifier and Snort based network intrusion detection system (NIDS) in Cloud. This framework aims to detect network intrusions in Cloud environment with low false positives and affordable computational cost. To ensure feasibility of our NIDS module in Cloud, we evaluate performance and quality results on KDD'99 experimental dataset.
{"title":"Bayesian Classifier and Snort based network intrusion detection system in cloud computing","authors":"Chirag N. Modi, D. Patel, Avi Patel, R. Muttukrishnan","doi":"10.1109/ICCCNT.2012.6396086","DOIUrl":"https://doi.org/10.1109/ICCCNT.2012.6396086","url":null,"abstract":"One of the major security issues in cloud computing is to protect against network intrusions that affect confidentiality, availability and integrity of Cloud resources and offered services. To address this issue, we design and integrate Bayesian Classifier and Snort based network intrusion detection system (NIDS) in Cloud. This framework aims to detect network intrusions in Cloud environment with low false positives and affordable computational cost. To ensure feasibility of our NIDS module in Cloud, we evaluate performance and quality results on KDD'99 experimental dataset.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116328986","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
扫码关注我们
求助内容：
应助结果提醒方式：