A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sridevi, R.
- An Investigation of Intrusion Detection in UDP Data Streams
Authors
1 Department of Information Technology, Periyar Maniammai University, Thanjavur-613403, IN
2 Department of Information Technology, Periyar Maniammai University, Thanjavur-613403, IN
Source
Digital Signal Processing, Vol 3, No 1 (2011), Pagination: 14-18Abstract
Securing the local network is a crucial task for any system administrator, as the activities in a network vary widely from simple data searching to online commercial transactions in many organizations. Intrusion detection systems (IDS) are extremely useful in this task. Detecting intrusions and identifying various methods or types of intrusions play an important role for predicting an intrusion and securing the network in the long run. Data mining techniques are being increasingly used to study the data streams with good results in IDS. In this paper we propose to extract unique signatures from UDP data streams, and predict intrusion using data mining techniques. We have used the KDD cup 1999 dataset that contains a wide variety of intrusion attacks simulated in a military environment.Keywords
Decision Trees, KDD Cup Dataset, Random Tree, Supervised Learning Model, Naïve Bayes.
- Illumination and Expression Invariant Face Recognition System Using Discrete Wavelet and Hybrid Fourier Feature with Multiple Face Model
Authors
1 Jayaram College of Engineering and Technology, Karattampatti, IN
2 Shri Angalamman College of Engineering and Technology, Siruganoor, Trichy, IN
3 TCS, Bangalore, IN
Source
Biometrics and Bioinformatics, Vol 4, No 3 (2012), Pagination: 93-99Abstract
Face recognition is one of the challenging applications of image processing. It has been actively investigated by the scientific community and has already taken its place in modern consumer software. However, there are still major challenges remaining e.g. variations in pose, lighting and appearance, even with well known face recognition systems. In this paper, we present a Robust face recognition system should posses the ability to recognize identity despite many variations in pose, lighting and appearance. This proposed face recognition system consists of a novel illumination-insensitive preprocessing method, a combined method of feature extraction using discrete wavelet Transform and hybrid fourier transform with multiple face model to improve the recognition rate, and a score fusion scheme. First, in the preprocessing stage, a face image is transformed into an illuminationinsensitivimage, called an ―integral normalized gradient image,‖ by normalizing and integrating the smoothed gradients of a facial image.Then, for feature extraction of complementary classifiers,multipleface models based upon discrete wavelet and hybrid fourier featuresare applied. The wavelet featuresare extracted from wavelet coefficient values with the same size as the original image. Thesecoefficients are used to describe the face image. The hybrid Fouriereatures are extracted from different Fourier domains in differentfrequency bandwidths and then each feature is individually classified by linear discriminant analysis. In addition, multiple face models are enerated by plural normalized face images that have different eye distances. Finally, to combine scores from multiple complementarym classifiers, a log likelihood ratio-based score fusion scheme is applied.
Keywords
Face Recognition, Integral Normalized Gradient Image Method, Discrete Wavelet and Hybrid Fourier Feature Extraction and Score Fusion.- Mining Association Rules in a Transactional Database Using the Lift Ratio
Authors
1 Manonmaniam Sundaranar University, Tirunelveli, IN
2 Department of Computer Science and Engineering, Alagappa University, Karaikudi, IN
Source
Artificial Intelligent Systems and Machine Learning, Vol 6, No 7 (2014), Pagination: 251-255Abstract
Association rule is a method for discovering interesting relationships between the items in large databases. For analyzing the students’ behaviour, the systems accumulate a large volume of valuable information. Since the student database includes more number of attributes it is difficult for processing. The goal of the Multidimensional Quantitative Rule Generation is to generate association rules that satisfy the minimum confidence threshold. But in some cases measuring confidence alone is not sufficient for decision making. Therefore, the Confidence measure for continuous data can be derived that agrees with the standard confidence measure while applying to binary data also. Besides we have taken one more add-on factor `Lift Ratio' which is to validate the generated Association rules that are strong enough to infer useful information. This proposed approach aims to put together the above points to generate an efficient algorithm to offer useful rules in an effective manner.
Keywords
Data Mining, Association Rules, Multidimensional, Confidence, Lift Ratio.- Survey on Packet Marking Algorithms for IP Traceback
Authors
1 Dept of Information Technology, Kakatiya Institute of Technology and Science, Warangal, Telangana, IN
2 Dept of Computer Science, Vaagdevi College of Engineering, Warangal, Telangana, IN
3 Dept of Computer Science, Jawaharlal Nehru Technological University, Hyderabad, Telangana, IN
Source
Oriental Journal of Computer Science and Technology, Vol 10, No 2 (2017), Pagination: 507-512Abstract
Distributed Denial of Service (DDoS) attack is an unavoidable attack. Among various attacks on the network, DDoS attacks are difficult to detect because of IP spoofing. The IP traceback is the only technique to identify DDoS attacks. The path affected by DDoS attack is identified by IP traceback approaches like Probabilistic Packet marking algorithm (PPM) and Deterministic Packet Marking algorithm (DPM). The PPM approach finds the complete attack path from victim to the source where as DPM finds only the source of the attacker. Using DPM algorithm finding the source of the attacker is difficult, if the router get compromised. Using PPM algorithm we construct the complete attack path, so the compromised router can be identified. In this paper, we review PPM and DPM techniques and compare the strengths and weaknesses of each proposal.Keywords
Distributed Denial of Service, Deterministic Packet Marking, IP Traceback, Packet Marking, Probabilistic Packet Marking.Full Text
References
- Marion Vasseur, Xiuzhen Chen, Rida Khatoun, Ahmed Serhrouchni, Survey on Packet Marking Fields and Information for IP Traceback, In Proc. Int. Conf. on Cyber Security of Smart cities, Industrial Control System and Communications (SSIC), 2015.
- R. Kiremire Ankunda, R. Brust Matthias, V. Phoha Vir, Using network motifs to investigate the influence of network topology on PPM based IP traceback schemes. Computer Network, 2014; 14–32.
- Anatolii Balyk, Uliana Latsykovska, Mikolaj Karpinski, Yuliia Khokhlachova, Aigul Shaikhanova, Lesia Korkishko, A Survey of Modern IP Traceback Methodologies. In Proc. 8th IEEE Int. Conf. on Intelligent Data Acquisition and Advanced Computing Systems, 2015: pp. 484-488.
- S. Savage, D. Wetherall, A. Karlin, T. Anderson, Practical network support for IP Traceback. In Proc. ACM SIGCOMM conference, 2000; pp. 295-306.
- DX Song, A. Perrig, Advanced and authenticated marking schemes for IP Traceback. In Proc. IEEE INFOCOM, 2001; pp. 878–86.
- Snoeren AC, Partridge C, Sanchez LA, Jones CE, Tchakountio F, Kent ST, Hash-based IP Traceback. In Proc. ACM SIGCOMM, 2001.
- Wong Tsz-Yeung, Wong Man-Hon, Lui Chi-Shing, A precise termination condition of the probabilistic packet marking algorithm. IEEE Transactions on Dependable Secure Computing, 2008; 5: 6–21.
- Lih-Chyau, Liu Tzong-Jye, Yang Jyun-Yan, IP traceback based on Chinese Remainder Theorem. In Proc. 6th IASTED Int. Conf. on Communications, Internet, and Information Technology, 2007, pp. 214–219.
- Y. Bhavani, V. Janaki, R. Sridevi, IP traceback through modified probabilistic packet marking algorithm using Chinese remainder theorem, Ain Shams Engineering Journal, 2015; 6: 715–722.
- D. Dean, M. Franklin, A. Stubblefield, An algebraic approach to IP Traceback. ACM Transactions on Information and System Security, 2002; 5: 119–137.
- K. Park, H. Lee, On the effectiveness of probabilistic packet marking for IP Traceback under denial-of-service attacks, In Proc. IEEE INFOCOM, 2001.
- Y. Bhavani, V. Janaki, R. Sridevi, IP Traceback through modified probabilistic packet marking algorithm. In Proc. IEEE Region10 conference TENCON, 2013, pp.1565-1569.
- Andrey Belenky and Nirwan Ansari, IP Traceback with Deterministic Packet Marking. IEEE Communications Letters 7, 2003; 162-164.
- Ashwani Parashar, Dr. Ramaswami Radhakrishnan, Improved Deterministic Packet Marking Algorithm. In Proc. of 15th Int. Conf. on Advanced Computing Technologies, 2013.
- Yang Xiang , Wanlei Zhou , Minyi Guo, Flexible Deterministic Packet Marking: An IP Traceback System to Find the Real Source of Attacks. IEEE Transactions on Parallel and Distributed Systems, 2009; 20: 567 – 580.
- S. Yu, W. Zhou, S. Guo, M. Guo, A feasible IP traceback framework through dynamic deterministic packet marking. IEEE Transactions on Computers, 2016; 65: 1418–1427.
- Design of a High Speed Multiplier (Ancient Vedic Mathematics Approach)
Authors
1 Department of Electronics and Communication Engineering, KITS, Warangal, IN
Source
International Journal of Engineering Research, Vol 2, No 3 (2013), Pagination: 183-186Abstract
In this paper, an area efficient multiplier architecture is presented. The architecture is based on Ancient algorithms of the Vedas, propounded in the Vedic Mathematics scripture of Sri Bharati Krishna Tirthaji Maharaja. The multiplication algorithm used here is called Nikhilam Navatascaramam Dasatah. The multiplier based on the ancient technique is compared with the modern multiplier to highlight the speed and power superiority of the Vedic Multipliers.Keywords
Digital Multiplier, Nikhilam Algorithm.Full Text
- A Survey Paper on Visual Cryptography Application to Biometric Authentication
Authors
1 Department of Computer Science, PSG College of Arts & Science, Coimbatore, IN
Source
Biometrics and Bioinformatics, Vol 10, No 1 (2018), Pagination: 18-20Abstract
In today’s modern world communication is a basic need on daily life. In order to prevent it by the intruders a technique called visual cryptography is used. “Visual cryptography using biometric authentication” is a technique which is used for authentication to keep more secure and safe where the images are hidden by using encryption. In this paper visual cryptography method is used for protecting and securing the biometric data’s such as finger print images for the purpose of user authentication.References
- “A Study on Elliptic Curve Cryptography” in International Journal on Research Innovations in Engineering Science and Technology (IJRIEST), (ISSN 2455-8540), Volume 2, Issue 7, July-2017, pp: 546 – 550.
- “Cryptographic Cloud Storage Techniques” in International Journal of Engineering Sciences & Research Technology(IJESRT), ISSN: 2277-9655, July 2017, pp: 602-605.(Impact Factor: 4.116)
- “Checking User Authentication by Biometric One Time Password Generation using Elliptic Curve Cryptography” in International Journal of Computer Science & Engineering Technology (IJCSET), ISSN: 2229-3345, Vol. 8 No. 06, June 2017, pp. 213-218.
- “Ghost Imaging using a Novel Phase Modulation Patterns for Efficient and High Secured Optical Encryption” in International Journal of Modern Computer Science (IJMCS) ISSN: 2320-7868 (Online) Volume 4, Issue 6, December, 2016.
- “An Implementation of Hybrid Cryptographic Protocol for Facial Image Security” in International Journal of current research in science and technology (ISSN: 2394-5745 “Secured Transmission of Data in cloud Environment Using
- Elliptic curve Cryptography” in International Journal of Innovative Research in Computer and Communication Engineering (IJRCCE) (ISSN (online): 2320-9801), Vol. 3, Issue 8, August 2015(impact factor: 5.618).
- “A Secured Asymmetric Crypto system for Multi- (IJTRD) (ISSN (online): 2394-9333), Vol. 2, Issue 5, September-October 2015(impact factor: 0.924).
- “ECC Encryption and LSB Data Embedding Technique for Studies (ISSN (online): 2348-1439), Vol. 2, Issue 7, June 2015, pp.55 – 57. (Impact Factor: 0.74).