The detection of malicious files is an important component of any intrusion detection system. Due to increase in network speeds and new worms being discovered frequently, there arises a need to detect worms on the fly without disassembling or running them. Signature-based detection is considered to be an important technique in anti-virus applications because of its accuracy and lack of false positives. by checking the signatures stored in the database. As the database of signatures increase, the time required to perform the pattern matching operation in software increases. FPGAs(Field Programmable Gate Arrays) present us with ideal platforms for these kinds of pattern matching applications since they are characterized by low cost and short application development cycles. They also provide a right compromise between flexibility of re-programming and capability in operating at high speeds. In this paper we present a design where FPGA is used as a co-processor to help out with signature matching. They can also be extended to perform inline matching where the packets can be inspected for protocol analysis.
{"title":"FPGA based approach for signature based antivirus applications","authors":"Nitesh B. Guinde, R. Lohani","doi":"10.1145/1980022.1980300","DOIUrl":"https://doi.org/10.1145/1980022.1980300","url":null,"abstract":"The detection of malicious files is an important component of any intrusion detection system. Due to increase in network speeds and new worms being discovered frequently, there arises a need to detect worms on the fly without disassembling or running them. Signature-based detection is considered to be an important technique in anti-virus applications because of its accuracy and lack of false positives. by checking the signatures stored in the database. As the database of signatures increase, the time required to perform the pattern matching operation in software increases. FPGAs(Field Programmable Gate Arrays) present us with ideal platforms for these kinds of pattern matching applications since they are characterized by low cost and short application development cycles. They also provide a right compromise between flexibility of re-programming and capability in operating at high speeds. In this paper we present a design where FPGA is used as a co-processor to help out with signature matching. They can also be extended to perform inline matching where the packets can be inspected for protocol analysis.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130704513","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}
In microarray gene expression data, monitor gene in different tissues & where each experiment with additional response variable such as a cancer type. Although the number of measure genes is in the thousand, it is assume that only law marker components of gene subset determine the type of a tissue. This paper proposes a new clustering method based on Minimal Spanning Tree for finding such groups of genes. By applying the proposed algorithm to gene expression data, meaning full clusters of gene are discovered. Significant genes are the subtend from each cluster & they contain useful information for sample classification. Thus a small pool of subtend genes can be used to build classification with high classification rode. The performance of this method is presented based on the predictive accuracy of K-NN rule, on colon cancer & leukemia data set.
{"title":"Marker gene selection for sample classification using a new MST based clustering algorithm","authors":"S. Sarkar","doi":"10.1145/1980022.1980357","DOIUrl":"https://doi.org/10.1145/1980022.1980357","url":null,"abstract":"In microarray gene expression data, monitor gene in different tissues & where each experiment with additional response variable such as a cancer type. Although the number of measure genes is in the thousand, it is assume that only law marker components of gene subset determine the type of a tissue. This paper proposes a new clustering method based on Minimal Spanning Tree for finding such groups of genes. By applying the proposed algorithm to gene expression data, meaning full clusters of gene are discovered. Significant genes are the subtend from each cluster & they contain useful information for sample classification. Thus a small pool of subtend genes can be used to build classification with high classification rode. The performance of this method is presented based on the predictive accuracy of K-NN rule, on colon cancer & leukemia data set.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130446835","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}
Whenever, user has to deal with lots of files present in the system, managing and storing these files systematically is very important in order to make it easier to access them. Here comes the role of our FS Filter Driver which helps user to classify these files and check the intrusions in these files and store them in separate directories according to their file extensions. It also classifies the files which are downloaded from the Internet. Thus Driver eases the programmer's job of handling a lot of files by classifying them systematically.
{"title":"A generic filter driver for file classification in Linux","authors":"Pravin Dilp, Ajit Ambeka, P. Chawan","doi":"10.1145/1980022.1980344","DOIUrl":"https://doi.org/10.1145/1980022.1980344","url":null,"abstract":"Whenever, user has to deal with lots of files present in the system, managing and storing these files systematically is very important in order to make it easier to access them. Here comes the role of our FS Filter Driver which helps user to classify these files and check the intrusions in these files and store them in separate directories according to their file extensions. It also classifies the files which are downloaded from the Internet. Thus Driver eases the programmer's job of handling a lot of files by classifying them systematically.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130837471","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}
Detection and classification of Atrial complexes from the ECG is of considerable importance in critical patient care monitoring of dangerous heart conditions. Accurate detection of Paroxysmal Atrial Fibrillation (PAF) using Atrial Premature Complexes(APC) is particularily important in relation to life threatening arrhythmias. PAF is a type of progressive cardiac arrhythmia that poses severe health risks, sometimes leading to ventricular arrhythmia. The electrocardiogram (ECG) data from the PhysioNet Online Database is used to develop a technique to screen, detect, and predict the onset of PAF. By considering a set of feature derived from RR intervals and P wave morphology it is possible to discriminate between PAF patients and healthy individuals. Result demonstrated that feature based on RR intervals is most successful. The RR based algorithm could be incorporated into medical devices with the potential of contributing to new healthcare technology.
{"title":"R-R interval based paroxysmal atrial fibrillation analysis","authors":"S. Kadge, M. Panse","doi":"10.1145/1980022.1980306","DOIUrl":"https://doi.org/10.1145/1980022.1980306","url":null,"abstract":"Detection and classification of Atrial complexes from the ECG is of considerable importance in critical patient care monitoring of dangerous heart conditions. Accurate detection of Paroxysmal Atrial Fibrillation (PAF) using Atrial Premature Complexes(APC) is particularily important in relation to life threatening arrhythmias. PAF is a type of progressive cardiac arrhythmia that poses severe health risks, sometimes leading to ventricular arrhythmia. The electrocardiogram (ECG) data from the PhysioNet Online Database is used to develop a technique to screen, detect, and predict the onset of PAF. By considering a set of feature derived from RR intervals and P wave morphology it is possible to discriminate between PAF patients and healthy individuals. Result demonstrated that feature based on RR intervals is most successful. The RR based algorithm could be incorporated into medical devices with the potential of contributing to new healthcare technology.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129657292","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}
K. Salam, J. Sathyan, S. James, S. Sreejith, M. P. Suhair
In this paper, we describe a circuit idea and implementation algorithm of a device useful to common people during travelling. This device provides the power to user by inserting a one rupee coin. It consists of a coin detector, microcontroller and out driver relay. When a coin is inserted, power can be drawn from the plug point for a predefined duration. This devise is useful for charging all portable electronic devices and e-vehicles.
{"title":"An accurate circuit idea for pre-paid electricity for portable devices","authors":"K. Salam, J. Sathyan, S. James, S. Sreejith, M. P. Suhair","doi":"10.1145/1980022.1980297","DOIUrl":"https://doi.org/10.1145/1980022.1980297","url":null,"abstract":"In this paper, we describe a circuit idea and implementation algorithm of a device useful to common people during travelling. This device provides the power to user by inserting a one rupee coin. It consists of a coin detector, microcontroller and out driver relay. When a coin is inserted, power can be drawn from the plug point for a predefined duration. This devise is useful for charging all portable electronic devices and e-vehicles.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130020467","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}
Power and Bandwidth are scarce resources in cellular communication. The limited radio spectrum is becoming scarcer with an increasing growth in cellular users and the new services offered by the advancement in cellular communication. Optimum utilization of limited bandwidth; in cellular communication is an important research topic, in which the main challenge lies in allocating a channel to the new caller in the system. Channel allocation problem is known to be NP hard. Various channel allocation schemes are available, out of which Dynamic Channel Allocation using Particle Swarm Optimization technique is implemented in this paper. The velocity update function is modified by introducing dynamically varying inertia and its effects are studied. This efficient allocation scheme will help in improving the efficiency of the system, by allocating the channels to the newly arrived call at a faster rate. The simulation is performed on well known bench mark problem. The results of which show that, we obtain the optimum solution at a faster rate and low values of call rejected ratio.
{"title":"Resource management in cellular communication using particle swarm optimization","authors":"G. Mundada, B. Chaudhari, P. Lohiya","doi":"10.1145/1980022.1980105","DOIUrl":"https://doi.org/10.1145/1980022.1980105","url":null,"abstract":"Power and Bandwidth are scarce resources in cellular communication. The limited radio spectrum is becoming scarcer with an increasing growth in cellular users and the new services offered by the advancement in cellular communication. Optimum utilization of limited bandwidth; in cellular communication is an important research topic, in which the main challenge lies in allocating a channel to the new caller in the system. Channel allocation problem is known to be NP hard. Various channel allocation schemes are available, out of which Dynamic Channel Allocation using Particle Swarm Optimization technique is implemented in this paper. The velocity update function is modified by introducing dynamically varying inertia and its effects are studied. This efficient allocation scheme will help in improving the efficiency of the system, by allocating the channels to the newly arrived call at a faster rate. The simulation is performed on well known bench mark problem. The results of which show that, we obtain the optimum solution at a faster rate and low values of call rejected ratio.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126346214","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}
Iris recognition has become a popular research in recent years due to its reliability and nearly perfect recognition rates. Iris recognition system has three main stages: Image preprocessing, Feature extraction and Template matching. In the preprocessing stage, iris segmentation is critical to the success of subsequent feature extraction and template matching stages. Most recent algorithm on template matching proposed by Libor Masek shows an improvement of 3.6 % over existing algorithm like Hamming Distance. This paper addresses for improvement to Libor Masek algorithm of Template matching method for Iris Recognition. The method evaluates on iris images taken from the CASIA iris image database version 1.0 and version 3. Experimental results show that the proposed approach has more efficient than to Libor Masek in terms of Template matching Time of about 99%, Creation of template is of about 10 % and False Rejection Ratio (FRR) is of about 10 %.
{"title":"Improvement to libor masek algorithm of template matching method for iris recognition","authors":"S. B. Kulkarni, R. Hegadi, U. Kulkarni","doi":"10.1145/1980022.1980303","DOIUrl":"https://doi.org/10.1145/1980022.1980303","url":null,"abstract":"Iris recognition has become a popular research in recent years due to its reliability and nearly perfect recognition rates. Iris recognition system has three main stages: Image preprocessing, Feature extraction and Template matching. In the preprocessing stage, iris segmentation is critical to the success of subsequent feature extraction and template matching stages. Most recent algorithm on template matching proposed by Libor Masek shows an improvement of 3.6 % over existing algorithm like Hamming Distance. This paper addresses for improvement to Libor Masek algorithm of Template matching method for Iris Recognition. The method evaluates on iris images taken from the CASIA iris image database version 1.0 and version 3. Experimental results show that the proposed approach has more efficient than to Libor Masek in terms of Template matching Time of about 99%, Creation of template is of about 10 % and False Rejection Ratio (FRR) is of about 10 %.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126632303","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}
The emergence of mobile computing provides the ability to access information at any time and place. Ubiquitous data access is the base of mobile computing and connectivity. Organizing and accessing massive amount of data on wireless communication networks in order to provide fast and low power access to users equipped with wireless devices is a new challenge to the data management and telecommunication communities. This paper provides a brief introduction to mobile database architecture, and enlist important issues related to management of data on move which could be available everywhere. The use of wireless communication makes the data availability the most important problem here especially for location dependent data. It further states the problem associated with Location dependent data in caching, cache invalidation and cache replacement.
{"title":"Ubiquitous information management system","authors":"M. Bhelotkar, U. Pawar","doi":"10.1145/1980022.1980144","DOIUrl":"https://doi.org/10.1145/1980022.1980144","url":null,"abstract":"The emergence of mobile computing provides the ability to access information at any time and place. Ubiquitous data access is the base of mobile computing and connectivity. Organizing and accessing massive amount of data on wireless communication networks in order to provide fast and low power access to users equipped with wireless devices is a new challenge to the data management and telecommunication communities.\u0000 This paper provides a brief introduction to mobile database architecture, and enlist important issues related to management of data on move which could be available everywhere. The use of wireless communication makes the data availability the most important problem here especially for location dependent data. It further states the problem associated with Location dependent data in caching, cache invalidation and cache replacement.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127489779","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}
This paper, evaluates the performance of two ad-hoc multicast routing protocols under varying traffic, density and mobility conditions. We observe that a large fraction of the traffic is being carried on the Internet today by TCP. Thus internet traffic has inherently different characteristics than CBR traffic, which is commonly used traffic type for evaluating MANET routing protocols performance. Previous efforts to evaluate performance of TCP and CBR in tree-based multicast routing protocol (MAODV) are done. But these tree based protocols face lot of problem like single path property, vulnerable to high mobility and large group, single point of failure which are removed in mesh-based multicast routing protocol like ODMRP, ADMR etc. It is observe that mesh based protocol are robust enough and performance of CBR is more in mesh based protocol as compare to TCP.
{"title":"Comparing the performance of TCP and CBR in tree-based and mesh-based ad-hoc multicast routing protocol","authors":"V. V. Mandhare, P. Vikhe, N. S. Nehe","doi":"10.1145/1980022.1980201","DOIUrl":"https://doi.org/10.1145/1980022.1980201","url":null,"abstract":"This paper, evaluates the performance of two ad-hoc multicast routing protocols under varying traffic, density and mobility conditions. We observe that a large fraction of the traffic is being carried on the Internet today by TCP. Thus internet traffic has inherently different characteristics than CBR traffic, which is commonly used traffic type for evaluating MANET routing protocols performance. Previous efforts to evaluate performance of TCP and CBR in tree-based multicast routing protocol (MAODV) are done. But these tree based protocols face lot of problem like single path property, vulnerable to high mobility and large group, single point of failure which are removed in mesh-based multicast routing protocol like ODMRP, ADMR etc. It is observe that mesh based protocol are robust enough and performance of CBR is more in mesh based protocol as compare to TCP.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127744532","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}
The performance of IEEE 802.11 with different network densities and protocol configurations is of interest, particularly in distributed coordination function (DCF) mode. A mathematical model for one hop network IEEE 802.11 protocol was introduced by Bianchi [2] to analytically derive the saturated throughput. Our ultimate goal is to enhance the capacity of Ad-hoc network closer to the analytical values of this model. As an attempt, we propose the Receiver Based Capacity Enhancement Algorithm using Cross-Layer Design Approach (RCECLD) by dynamically adapting the data rate. It uses Signal-to-Noise Ratio (SNR) values calculated by Physical layer and exported to Medium Access Control (MAC) layer via the cross-layer interface to estimate the prevailing channel state. In RCECLD the receiver decides the transmission data rate by calculating the SNR value of received RTS (Ready-to-Send), which is in turn an estimate of the prevailing channel state, and piggybacking it through CTS (Clear-to-Send) to the transmitter. Accordingly transmitter transmits the data frame with adopted data rate. The capacity of the Ad-hoc network is enhanced with RCECLD. It is investigated through an extensive set of simulations. The results indicate that the enhancement is very close to analytical values for smaller network size and it is about 2.5 times more than Auto-Rate Fallback (ARF) [8], in spite of fading and mobility effects.
{"title":"Receiver based capacity enhancement with cross-layer design approach for IEEE 802.11 ad-hoc networks","authors":"Satish Y. Ket, R. Awale","doi":"10.1145/1980022.1980197","DOIUrl":"https://doi.org/10.1145/1980022.1980197","url":null,"abstract":"The performance of IEEE 802.11 with different network densities and protocol configurations is of interest, particularly in distributed coordination function (DCF) mode. A mathematical model for one hop network IEEE 802.11 protocol was introduced by Bianchi [2] to analytically derive the saturated throughput. Our ultimate goal is to enhance the capacity of Ad-hoc network closer to the analytical values of this model. As an attempt, we propose the Receiver Based Capacity Enhancement Algorithm using Cross-Layer Design Approach (RCECLD) by dynamically adapting the data rate. It uses Signal-to-Noise Ratio (SNR) values calculated by Physical layer and exported to Medium Access Control (MAC) layer via the cross-layer interface to estimate the prevailing channel state. In RCECLD the receiver decides the transmission data rate by calculating the SNR value of received RTS (Ready-to-Send), which is in turn an estimate of the prevailing channel state, and piggybacking it through CTS (Clear-to-Send) to the transmitter. Accordingly transmitter transmits the data frame with adopted data rate.\u0000 The capacity of the Ad-hoc network is enhanced with RCECLD. It is investigated through an extensive set of simulations. The results indicate that the enhancement is very close to analytical values for smaller network size and it is about 2.5 times more than Auto-Rate Fallback (ARF) [8], in spite of fading and mobility effects.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":"232 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113999780","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
扫码关注我们
求助内容：
应助结果提醒方式：