Wani A H
017425 Wani A H (NO, , ) : Comprehensive methodology for data security and privacy in cloud computing systems. J Netwk Secur 2014, 2(2), 5-9.
Cloud computing encompasses computing with a pool of virtualized computer resources. A cloud provides for self-recovering highly-scalable programming models, workloads to recover from hardware/software failures and rebalance allocations, can host different workloads and allows workloads to be deployed/scaled-out on-demand by rapid provisioning of virtual or physical machines. The idea is to move desktop computing to a service-oriented platform using server clusters and huge databases at data centers. Cloud computing has become a standard method of software operation for many businesses. However, challenges are being faced by both research and professional cloud computing communities on optimized architectures, quality reliability, data security and privacy fronts. Services offered in cloud computing face the overwhelming challenges to ensure the proper physical, logical and personnel security controls, especially when considering the fact that cloud computing moves the application software and databases to the large data centers and in doing so the management of the data and services may not be fully trustworthy. In this paper, the main focus is given to highlight and investigate the data storage from perspective of threats and attacks and potential solution strategies. The paper also proposes an effective and flexible distributed scheme with two salient features, i.e., achieving the integration of storage correctness insurance and data error localization.
Vade P;Rahangdale V;Saurabh Veer
017424 Vade P;Rahangdale V;Saurabh Veer (Computer Engineering Dep, Sinhgad Institute of Technology, ) : 3D password for secured authentication. Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 108-12.
Providing authentication to any system leads to provide more security to that system. There are many authentication techniques available, such as Textual password, Graphical password, etc. but each of this individually having some limitations & drawbacks. To overcome the drawbacks of. previously existing authentication technique new improved authentication technique is used, this authentication scheme is called as 3D password. The 3D password is multi-password & multi-factor authentication system as it uses various authentication techniques such As textual password, graphical password etc. Most important part of 3d password scheme is inclusion of 3d virtual environment. 3d virtual environment is virtual environment which is consisting of real time object scenarios. It is not actual real time environment, it is just user interface provided to scheme which looks like same as real environment. 3d password is more secure authentication scheme than any other authentication techniques. Because this authentication scheme is more advanced than any other schemes. Also this scheme is hard to break & easy to use. In this paper we have introduced our contribution towards 3D password to become more secure & more user friendly to users of all categories. This paper also explaining about what is 3D password?, working of 3D password scheme, some mathematical concept related to 3D password, applications of scheme etc. all these concepts are briefly introduced & explained in this paper as per section wise.
3 illus, 7 ref
Suryaprabha P;Leema A A
017423 Suryaprabha P;Leema A A (NO, , ) : Prediction of phishing website using visual cryptography. J Netwk Secur 2014, 2(1), 28-33.
Phishing is a new type of social network attack. It is the act of attempting to acquire the information such as username, password, credit card details, etc. In this project, a new approach named as "Image Captcha Based Authentication Using Visual Cryptography"to solve the problem of phishing is proposed. The string is converted into image captcha using the extracting and embedding method. The visual cryptography is used to preserve the privacy of image captcha by decomposing the original image captcha into two shares using VCS (2*2). One of the shares is kept with the user and the other is kept in the server side. The user has to enter the user name and upload his share in the login phase. If the site is legitimate, it will display the image captcha and on the other hand image captcha will not be displayed if the website is fraudulent. This work is implemented in Java as front-end and SQL as backend. This work helps to identify the phishing site and the textual keyword validation along with visual cryptography.
Surendra Kumar;Alaria S;VijayKumar
017422 Surendra Kumar;Alaria S;VijayKumar (NO, Kautilya Institute of technology and Engineering, Jaipur, Rajasthan) : Prevention in sleep deprivation attack in MANET. Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 139-44.
MANET is a collection of mobile, decentralized, and self-organized nodes. Securing MANET is a problem which adds more challenges on the research. This is because MANET properties make it harder to be secured than the other types of static networks. It suffers from a variety of security attacks and threats such as: Denial of Service (DoS), flooding attack, impersonation attack, selfish node misbehaving, routing table overflow attack, wormhole attack, blackhole attack etc. MANET is open to vulnerabilities as a result of its basic characteristics like no point of network management; topology changes vigorously, resource restriction, no certificate authority or centralized authority. This paper objective is to summarize different types of attacks over MANET, and concerns with studying sleep deprivation attack. Our objective is to design an artificial immune system to secure from sleep deprivation attack and is based on biological Danger Theory and we imply the concept of using two thresholds on the basis of throughput. In this paper we count on the number of requests sent by a particular node in a given interval of time twice, once for minor threshold and later for major threshold.
12 illus, 13 ref
Satyakam;Rashmi P V A
017421 Satyakam;Rashmi P V A (NO, , ) : Video Steganography System using Chua Circuit for Data Encryption. J Netwk Secur 2014, 2(3), 7-12.
Data transmitted over the Internet is becoming more and more prone to hacking. Therefore, network security has become key concern for everyone. Over the years cryptography and steganography has evolved as two branches of information security. The paper combines chaotic cryptography and video steganography to provide a two tiered protection for the message to be transmitted over any network. The message is first encrypted and made unrecognizable using Chua cryptography. The encrypted message is then hidden in a video and made undetectable using video steganography. Simulation results are also presented.
Satyakam
017420 Satyakam (NO, , ) : Observer-based Control Design and Stability Analysis of Networked Hammerstein Systems. J Netwk Secur 2014, 2(3), 1-6.
In this paper, an attempt has been made to design observer for Networked Control System (NCS) with random delays. The NCS has been modeled as a Hammerstein system, a cascade combination of static non-linearity and LTI system. Luenberger Observer and Kalman Filter have been used to estimate the system states. Simulation results have been presented which result in stable overall Hammerstein systems, with improvements over existing control procedures.
Saranya K
017419 Saranya K (NO, , ) : Behavioral prediction ofnetworkattacks using honeypot rules. J Netwk Secur 2014, 2(1), 7-12.
Presented an approach for behavioral prediction of network attacks using honey pot rules using support physical machine as a classification technique. The proposed honey pot is used to trap delay and gather information about the attackers.These systems are centralized at a strategic point in the network and collect data into alog file that is subsequently analyzed as main vulnerability. Honey pots can generate the signature with the help of attack classifier, and it can detect and record known and unknown attacks in addition. Signature-based classifier uses Bayesian c1assification algorithm to represent malicious file or normal file. Therefore, the IP addresses correspond to higher chances for detecting intruders as more fake systems would be mined in the network.
Raghtate G S;Salankar S S
017418 Raghtate G S;Salankar S S (NO, , B. D. COE, Sevagram, Wardha, Email: gsraghtate2012@gmail.co) : Brain Tumor Segmentation Using fuzzy C Means With Ant Colony Optimization Algorithm. Curr Trends Technol Sci 2015, 4(2), 784-90.
In computer vision, image segmentation is an important problem and plays vital role in medical imaging. Analysis and diagnosis of tumor in MRI brain image involves segmentation as very essential steep. It separates the region of interest objects from the background and the other objects. Several approaches are used for MRI brain tumor segmentation. Fuzzy C Means (FCM) is most widely used fuzzy clustering algorithm. The accuracy of this algorithm for segmentation is not efficient due to limitation in initialization. In this paper, ant colony algorithm with min max ant system is used to improve the segmentation accuracy by maximum 32 % and reduce the computational time by maximum 2.5 times respectively.
7 illus, 7 tables, 15 ref
Patil S;Thombare K;Shelar A;Ugale P
017417 Patil S;Thombare K;Shelar A;Ugale P (Computer Engineering Dep, , Skn-Sits Lonavala, Maharashtra) : Energy management in modern mobile handsets through micro environment sensor. Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 145-50.
4 illus, 14 ref
Pardesi J D
017416 Pardesi J D (STES's RMD Sinhgad School of Computer Studies, , ) : Biometrics-steps towards greener globe. Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 105-7.
Traditional paper-made registers (musters) were used by almost all organizations for employee attendance; eventually some of them started implementing paper-made time . cards called punch cards for the purpose. However, more the paper work, more the slaughter of trees. In other terms, more the use of paper, 'lesser the trees and consequently higher the rate of global warming. In order to save trees and to put an effort towards greener globe, organizations should switch to a technology called biometrics for employee attendance. computers. Biometrics is an advanced technology wherein the employee's face scan or fingerprint is used for his/her attendance. All he/she has to do is stand in front of a camera or place in his/her finger on a reader for signing in and out. Thus attendance can go digital resulting in saving of thousands of trees on earth every year. Aim is to explain the concept of biometrics, it's main types, their working and finally put forth some instances where some concerned organization are doing their bit towards a greener globe.
1 illus, 13 ref
Pachghare V K;Kshirsagar A R;Adhao R B
017415 Pachghare V K;Kshirsagar A R;Adhao R B (NO, , ) : Hybrid model for adaptive-IDS using Machine Learning Approach. J Netwk Secur 2014, 2(2), 1-4.
Increasing need and use of internet is encouraging the development of new protocols, applications, services, etc. Even though these new developments are more robust than the previous ones, the network attacks are also emerging and are increasing security threat. The intrusion detection systems are not able to detect all types of attacks, so a solution to this problem is to combine some intrusion detection approaches to cope with the attacks effectively. An adaptive intrusion detection system takes proper decision to detect attacks properly resulting in high accuracy. The experimentation on proposed system which combines four approaches indicates enhanced performance.
Mishra P;Talati I
017414 Mishra P;Talati I (Mathematics and Computer Science Dep, School of Technology, Pandit Deendayal Petroleum University, Raisan, Gandhinagar-382 007) : genetic algorithm approach for an inventory model when ordering cost is lot size dependent. Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 92-7.
In this paper, a mathematical model is developed to study signi cance of various critical factors in the presence of lot size dependent ordering cost for an inventory model. Items in the inventory are subject to time dependent deterioration with associated salvage value. In this model lot size and cycle time are considered decision variables. Our main objective is to minimize total inventory cost to increase profitability for retailer. In this paper Genetic algorithm is used to minimize objective function which works very well with non-linear functions where conventional optimization methods stuck with local optimum. This model is validated with empirical data and sensitivity analysis is also carried out.
5 illus, 6 tables, 20 ref
Kumbhar S;Garje S;Jadhav R;Dhawas V N
017413 Kumbhar S;Garje S;Jadhav R;Dhawas V N (Computer Engineering, Sinhgad Institute of Technology, Lonavala, Maharashtra) : Forensic analysis of database using secure audit log. Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 89-91.
Database tampering is one of the big and important role in Data base Management system. Database security is very important requirement of today's database application system. The Main Objective of this Paper is to identify different technique and detection of different contents in Database. Here we are using the cryptographic hash algorithm to detect the tampering of a Database. Consequently the Tiled Bitmap Forensic analysis algorithm helps to find at what time and possibly finally why and who had tampered the Database. Here we are using separate audit log validator to observe and inspect the database along with the extra information and state of the data, Audit log playa central role in database. A notarizer is used to create notary id of each hashed value of database transaction.
1 ilus, 4 ref
Khudabadi R;Ranjan A;Varma H;Kadam S;Kalokhe P V
017412 Khudabadi R;Ranjan A;Varma H;Kadam S;Kalokhe P V (ACOE, , Pune, Email: rohit.khudabadi@gmail.com) : Recent study on early disaster warning & evacution system on mobile phones using google cloud. Curr Trends Technol Sci 2015, 4(2), 501-3.
Natural Disasters have threatened mankind since creation of earth. Also during natural disasters many people who are physically handicap faced many difficulties. For this reason, they have proposed a location based early disaster warning and evacuation system for both normal and handicap people using OpenStreetMap (OSM). The system is implemented on android mobile phone. So, this system comprises a third-party server named Disaster Management Server (DMS), android device with this application installed on it and user. The local weather office updates the disaster (tsunami, cyclone or flood) data on DMS. Device user registers on Android Cloud to Device Messaging (C2DM) server to get automatic notification of upcoming disaster otherwise user gets manual notification. The user communicates with DMS to have updated data sending the current position obtained by GPS or network provider. The probable disaster affected area is determined by ray casting algorithm. Evacuation progress is also tracked using DMS and national identification of user.
3 illus, 10 ref
Kelagadi H M;Shettar R B;Priyatam Kumar
017411 Kelagadi H M;Shettar R B;Priyatam Kumar (NO, , ) : Call Admission Control in ATM networks using Interval Arithmetic CEN. J Netwk Secur 2014, 2(3), 12-21.
Call admission control (CAC) is one of the most fundamental preventive congestion control mechanisms in asynchronous transfer mode (ATM) networKS. Call admission control is further complicated by the diverse mix of traffic types and service requirements and by the increasing speed of transmission. In this project, the focus is on a call admission control with interval arithmetic coulomb energy network, a generalization of coulomb energy network (CEN), which can handle interval data and point data for the learning efficiency. The approximations are based on the continuous monitoring of the network state and the use of a feed forward multilayer perceptron. The call admission control decision whether to accept the connection or refuse it based on the current load conditions is hence verified. The performance of the neural network based on different learning rates and the improved numerical efficiency is illustrated using three example activation functions, the sigmoidal function, bipolar and the hyperbolic tangent functions. The experimental evidence for the analysis of a given network shows that the performance of the network can be enhanced when lesser learning rates are used but with minor acceptable variations in the delay as compared with greater learning rates. The delay comparison using learning rates of 0.05 and 0.01 is made with the sigmoidal, bipolar and the hyperbolic tangent activation functions.
Kashyup A;Kothari R;Kothari H;Narang G
017410 Kashyup A;Kothari R;Kothari H;Narang G (Computer Engineering Dep, Savitribai Phule Pune University, Sinhgad Institute of technology, Lon, ) : Filtering mechanism for unwanted messages on OSN user wall using CBMF (Content Based Message Filtering). Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 98-101.
In this era of internet, tbe Online Social NetworksI (OSNs) are the platform to build social relations among people who share interests, activities, backgrounds or real life connections. OSNs have gained a ubiquitous status and this has led to security issues of posting unwanted messages on user wall. Therefore, in order to make the OSN user wall a secured wall, we are introducing a flexible- rule based system which provides users to control the messages that are posted on their walls and allows user to customise the filtering criteria to be applied on their walls. This system exploits machine learning based soft classifier for automatically labelling messages in support of content based filtering.
3 illus, 1 table, 12 ref
Islam M R;Rahman M M;Toufiq R
017409 Islam M R;Rahman M M;Toufiq R (NO, , ) : An approach to develop secure ear biometric system. J Netwk Secur 2014, 2(1), 1-6.
Biometrics is now the significant identification process for security system. The future of biometrics is surely leads to a system because the acquisition process for very simple. Ear biometrics has an important role on biometrics system. Because it is a passive biometrics system which means that the user does not have to take active partin the whole process. The most interesting human anatomical parts for such passive, physiological biometrics systems based on images acquired from cameras are face and ear. This paper introduces to ear biometrics as a passive human identification systems. Using two different methods and comparison between them help anyone to find the biometrics method. Geometrical method of feature extraction from human ear images in order to perform human identification is presented with the help of two different edge detection algorithms.
Gupta A;Suhag S;Duhan M
017408 Gupta A;Suhag S;Duhan M (NO, Deen Bandhu Chotu Ram Univ of Science & Technology, Muthal, Sonepat, Haryana) : Energy efficeint super heterogeneous communication protocol for WSNs. Ultra Scient phys Sci-Sect B 2014, 26(2), 181-5.
Wireless sensor network consists of randomly distributed autonomous battery powered sensor nodes, which sense and collectively pass their data to a base station. Wireless sensor network enables the monitoring of environment for various areas of applications. It is a web of sensor nodes and all these nodes send their collected data to a common base station directly or indirectly (through intermediate nodes). But these nodes have limited battery level. The most difficult resource constraint to meet in WSN is power consumption. So, to utilize that power level properly, some energy efficiency protocols were given. In this paper, we deal with that protocols which have more effect on overall energy efficiency of our network. In LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering based approach is used. In this, cluster head is selected randomly in the homogeneous environment. LEACH can achieve as much as a factor of 8 reductions in energy dissipation compared with conventional routing protocols. In this paper, we deal with the heterogeneity and super heterogeneity in wireless sensor network which will increase the network lifetime.
2 illus, 9 ref
Das G
017407 Das G (NO, Pingla thana Mahavidyalaya, Maligram, Pingla, West Bengal-721 140, Email: barunmaity1986@gmail.com) : Audio, visual and audio visual aids. Int J Aquatic Sci Technol 2014, 2(2), 32-4.
Present investigation falls exclusively under the Survey Studies. As survey studies, here also the study is conducted to collect details description of existing phenomena with the intent of employing data to justify current conditions and practices and to make more intelligent plans for improving them. Survey Studies may be broad or narrow in scope. Here the area of investigation is limited to the selected some schools of Guwahati city.
4 ref
Bhargava N;Aziz A;Aharwal R P
017406 Bhargava N;Aziz A;Aharwal R P (Computer Science Dep, MDS Univ, Ajmer, Rajasthan) : Application of association rule mining for waste heat recovery boiler. Ultra Scient phys Sci-Sect B 2014, 26(2), 174-80.
Data mining is a technique for discovering positive information from huge databases. This technique is currently being beneficially used by a number of industries. A common approach for information discovery is to identify association rules which make known relationships among different items. Our aim is to obtain association rules among various attributes of mechanical data. Entire database was used to obtain these association rules. This paper presents an application of Association Rule mining to discover precious association rules for data obtained from mechanical industry. The data used in this is of waste heat recovery boiler used in a fertilizer industry. In India only alittle work is done on mining of mechanical industrial data. In this paper we have used Apriori Algorithm with WEKA data mining tool.
4 illus, 1 table, 9 ref
Bansal P;Thakur J
017405 Bansal P;Thakur J (NO, , ) : Performance analysis of AODV, DSR and CGSR Routing Protocol in MANET based on energy consumption. J Netwk Secur 2014, 2(1), 21-7.
Mobile Ad-hoc networks (MANET) have gained lots of attention in researches in recent years, especially in routing protocols due to their dynamic nature. There are number of routing protocols in MANET networks and performance of these routing protocolshave been evaluated focusing on metrics such as delay, packet delivery, routing over head, throughput. However, not much work has been done to evaluate energy aspect of these routing protocols. Design new energy efficient routing algorithms are based on this basic MANET routing protocols is the latest research area in MANET and WSN. This paper will discuss the performance analysis of Dynamic Source Routing(DSR),Ad-hoc On-Demand Distance Vector(AODV) and Cluster-Gate routing protocol(CGSR) routing protocol in MANET based on energy consumption. A detailed simulation model using OMNET ++4.3 with different mobility and traffic models are used to study their energy consumption. Finally, an evaluation of these routing protocols based on energy consumption is presented.
Banal S V;Singh H;Jagdale S P;Shishupal R
017404 Banal S V;Singh H;Jagdale S P;Shishupal R (Computer Dep, Sinhgad Institute of tehnology, Lonavala) : Approah for document clustering in forensic analysis using labeling. Int J latest Technol Engng Mgmt appl Sci 2015, 4(2), 82-3.
Author presents an approach that applies document clustering algorithm to forensic analysis of computer seized in police investigations and also present a better approach in the field of forensic computing using automatic labeling and avoiding overlapping of clusters to improve response time of the search.
7 ref
Amruth V;Kuriakose J;Sri Lakshmi M D;Khan A A
017403 Amruth V;Kuriakose J;Sri Lakshmi M D;Khan A A (NO, , ) : Comparative analysis of attacks in wireless network. J Netwk Secur 2014, 2(3), 22-8.
Sensor networks (WSN) is an emerging technology and a hot research topic among researchers due to their flexibility and independence of network infrastructures, such as base stations. It can also be used for applications such as building, traffic surveillance, and habitat monitoring and many scenarios. It is flexible to go through physical partition and it avoids lot of wiring. The major challenges one facing today in wireless sensor network is security. It is because we cannot control propagation of waves and they are also limited by their computing power and energy constraints. This paper discusses about several varieties of attacks in wireless sensor network.
Aafreen A;Balasubramanian K
017402 Aafreen A;Balasubramanian K (NO, , ) : Detection of distributed denial of service attack by Hidden Markov Model throutgh Web Proxy System. J Netwk Secur 2014, 2(1), 13-20.
Nowadays the attack against the computer system is becoming very common and vulnerable. Indirect web proxy distributed denial of service attack is an increasingly common internet phenomenon and is capable of making the internet services unavailable. Such type of attacks cannot be easily discovered by most existing defense systems since malicious traffic is hidden in the aggregated traffic. Also the source of the attack traffic and normal traffic cannot be distinguished because both of them share the same IP of the proxy server. To overcome this problem, a new improved hidden semi-Markov model is proposed. Therefore, applying this proposed method protects the origin server from web proxy-based HTIP attacks. Web proxy's access behavior can be regarded as the combination of the externally observable behavior and the internal driving mechanism. The internal driving mechanism can be estimated by the observable features of proxy-to server traffic through the hidden semi-Markov model. Hidden semi-Markov model describes the dynamic behavior process of the aggregated traffic. The false positive rate is also detected with respect to the incoming traffic.
Sen S;Muralidhara V N
016407 Sen S;Muralidhara V N (Computer Science and Engineering Dep, IIT Delhi, New Delhi-110 016, Email: ssen@cse.iitd.ernet.in) : The covert set cover problem with applications to network discovery?. Proc Indian Natn Sci Acad 2014, 80(3), 609-19.
Authors address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a small set-cover using a minimal number of such queries. Presents a Monte Carlo randomized algorithm that approximates an optimal set-cover of size OPT within O(log N) factor with high probability using O(OPT log2 N) queries where N is the input size. Apply this technique to the network discovery problem that involves certifying all the edges and non-edges of an unknown n-vertices graph based on layered-graph queries from a minimal number of vertices. By reducing it to the covert set-cover problem we present an O(log2 n)-competitive Monte Carlo randomized algorithm for the covert version of network discovery problem. The previously best known algorithm (Beerliova et al., 2006) has a competitive ratio of p Ω (p √ n log n) and therefore our result achieves an exponential improvement.
2 illus, 14 ref
Zhang M;Morozov K;Takagi T
015414 Zhang M;Morozov K;Takagi T (School of Computer Science, Hubei Univ of Technology, Wuhan 430068, China) : Generic constructions and transformations of decryption consistent encryption. IETE J Res 2014, 60(3), 218-28.
Binding encryption provides an effective way to broadcast a secret to an authorized group of users, which guarantees decryption consistency, i.e., that all users can obtain the same message without any interaction among them. In this paper, we first give the definition of security of a binding encryption, and then construct a primitive that achieves security against chosen plaintext attacks (CPA) and decryption consistency. This primitive is derived from a CPA-secure public-key encryption (PKE) scheme. Then, we present several transformations of binding encryption, which ensure some advanced security requirements such as anonymity, strong decryption consistency, and non-malleability. (1) Negative results that: (a) A CCA (chosen-ciphertext attack) secure PKE does not imply a CCA-secure multi-receiver encryption (ME) or binding encryption; (b) an anonymous CPA-secure PKE implies an anonymous ME but does not imply any anonymous binding encryption; (c) a CCA-secure anonymous PKE does not imply a CCA-secure anony mous ME or anonymous binding encryption. (2) A generic construction for a binding encryption that: (a) Uses CPA-secure PKE and symmetric encryption to construct a CPA-secure ME; (b) uses a CPA-secure ME and a polynomially verifiable function to construct a CPA-secure binding encryption. (3) Three transformations from (anonymous) CCA-secure PKE to (anonymous) CCA-secure binding encryption: the first one is based on a strong one-time signature, the second one is derived from a trapdoor pseudo-random function, while the third one is based on (information-theoretically secure) cover-free families, and hence it does not require any additional computational assumptions.
1 illus, 26 ref
Pakhara A P;Bali S;Kaira G
015413 Pakhara A P;Bali S;Kaira G (Community & Family Medicine Dep, All India Institute of Medical Sciences & Research, Bhopal, Email: abhijit.cfm@aiimsbhopal.edu.in) : Use of mobile phones as research instrumental for data collection. Indian J community Hlth 2013, 25(2), 95-8.
This paper discusses the use and advantages of using mobile phones for data collection and also provides information about resources for mobile based data collection.
1 illus, 13 ref
Huraj L;Siladi V
015412 Huraj L;Siladi V (Applied Informatics Dep, SS. Cyril and Methodius in Trnava Univ, Slovakia, Email: ladislav.huraj@ucm.sk) : Evaluating grid computing platform for snow cover. J scient ind Res 2014, 73(12), 751-5.
This paper presents the solution of interpolating algorithm of snow cover computing on different parallel computing architectures, e.g. cluster, graphics processing units (GPUs), multi-core CPU Moreover, testing Algorithm was tested and deployed on grid technologies connected toEGEE/Voce virtual organization utilizing high processing performance and storage capacity. The comparison of performance of the computing is presented.
4 illus, 17 ref
Das R K;Mukhopadhyay S;Bhattacharya P
015411 Das R K;Mukhopadhyay S;Bhattacharya P (E & ECE Engineering Dep, IIT Kharagpur, West Bengal) : User authentication based on keystroke dynamics. IETE J Res 2014, 60(3), 229-39.
This paper presents a technique to verify user identity using keystroke dynamics from short text, namely the computer login string. The keystroke behavioural pattern is obtained when a person types with a QWERTY keyboard. Two features hold time of an individual key and the latency of the consecutive keystrokes is used for authentication. Using a small training sample, accuracies of 90% and 99% are achieved for the data-set of 220 login strings per user (40 strings from legal user + 180 strings from nine intruders) using Gaussian mixture model and two-layer feed-forward neural network, respectively, as classifier. The paper then proceeds to a comprehensive study to explain how the accuracy varies with the length of the input string and with negative data in the training set.
9 illus, 2 tables, 21 ref
Ahmed Z H
015410 Ahmed Z H (Computer Science Dep, Al Imam Mohammad Ibn Saud Islamic Univ (IMSIU), P.O. Box No. 5701, Riyadh 11432, Kingdom of Saudi Arabia, Email: zhahmed@gmail.com) : Simple genetic algorithm using sequential constructive crossover for the quadratic assignment problem. J scient ind Res 2014, 73(12), 763-6.
Since crossover operator plays a vital role in genetic algorithms (GAs), several crossover operators have been proposed for the travelling salesman problem, which are then modified for the quadratic assignment problem (QAP). In this paper, we modify the sequential constructive crossover (SCX) operator for a simple GA to find heuristic solution to the QAP. Efficiency of the proposed GA using SCX is tested on some benchmark QAPLIB instances and then compared with GAs using other existing crossover operators.
1 table, 32 ref
Sheeba J I;Vivekanandan K
014469 Sheeba J I;Vivekanandan K (Computer Science & Engineering Dep, Pondicherry Engineering College, Puducherry, Email: sheeba@pec.edu) : Detection of online social cruelty attack from forums. Int J Data Mining Emerging Technol 2014, 4(2), 61-71.
Web provides volumes of text-based data which are stored in online chatting websites like Twitter, Facebook, Blog and Forum etc. Cyberbullying is a social aggressive, powerful negative effects for individuals, specifically adolescents and youngsters. Nowadays, methods for automatic thoughts of mining in the online data are becoming increasingly important. This framework is proposed to extract Cyberbully polarity from the Forum using Fuzzy logic technique. At first, the given input is pre-processed. Subsequently, the pre-processed data will be sent to the features extraction method. Probability of the words are calculated by using Fuzzy Decision Tree Method. Fuzzy rules can be applied in all these features to extract the certain set of cyberbully words like bad words, insulting words, threatening words and terrorism words from the given input. Finally this method will return the reduced and accurate cyberbully words. This method is performed by human annotation, the existing methods like Mamdani Fuzzy System and Naive Bayes classifier. Extensive experiments are performed by using fuzzy logic on crime debate forum and the results show that this proposed approach is better than the traditional one.
6 illus, 2 tables, 22 ref
Saini J R
014468 Saini J R (NO, Narmada College of Computer Application, Bharuch-392 011, Email: saini_expert@yahoo.com) : Web text mining through readability metrics for evaluation of understandability of policy guides of matrimonial websites. Int J Data Mining Emerging Technol 2014, 4(2), 92-99.
With an increased exposure of internet, usage of matrimonial sites has increased. The providers of matrimonial services often require the users to sign-up and agree to their terms and conditions of usage. These conditions differently referred to by matrimonial websites as private policy, safety guide, etc. have been here collectively identified as policy guides. This paper depicts the findings on readability statistics of such policy guides. On the sidelines of this, the paper also analyses the easiness of comprehension of such policy guides by using readability formulas of Percentage of Passive Sentences (PPS), Flesch Reading Ease (FRE) and Flesch-Kincaid Grade Level (FKGL). The experiments show that the average value for PPS is 5% more than the expected standard value; the average value for FRE is approximately 25% lower than the expected standard value while the average value of FKGL is 3 points more than the expected standard value. The deviations from standard values are all in directions contributing to low readability of policy guides of matrimonial websites.
3 illus, 2 tables, 18 ref
Karegowda A G;Singh S K
014467 Karegowda A G;Singh S K (Master of Computer Application Dep, Siddaganga Institute of Technology, Tumkur, Karnataka, Email: ashagksit@gmail.com) : GA and PSO based prototype generation for nearest prototype classifiers. Int J Data Mining Emerging Technol 2014, 4(2), 100-06.
K-nearest neighbor (KNN) algorithm is one the simplest and most commonly used classifications methods. The large memory and high computation cost for large training samples for KNN can be overcome by generating prototypes for each of the class using evolutionary algorithms. Nearest prototype classifiers (NPC), to some extent, resemble to the one-nearest neighbor classifier (KNN with K = 1). The aim of this study is to inspect the applications of two evolutionary algorithms namely: Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for generating the prototypes for nearest prototype for classification of benchmark datasets. The proposed method is composed of two steps. At the first step, the prototypes representing each class are generated using real encoded GA and PSO with simple KNN using fitness function like Euclidean distance. Further, as part of the second step, the class of the test sample is determined according to the distance of the test sample to the GA and PSO generated prototypes, employing nearest prototype. To demonstrate the effectiveness of this novel method, the results of proposed method are compared with the classification results of the simple K-nearest neighbor (K = 1), prototypes identified by class means, and centroids of three clustering methods namely, K-means, farthest first and entropy based fuzzy clustering as prototypes. The performance is measured using confusion matrix. The proposed method showed enhanced classification accuracy and requires very less computational time when compared to KNN (K = 1) classifier.
2 illus, 1 table, 17 ref
Gangwar M;Mishra R B;Yadav R S
014466 Gangwar M;Mishra R B;Yadav R S (Computer Science & Engineering Dep, Motilal Nehru National Institute, Allahabad Uttar Pradesh, Email: mohitgangwar@gmail.com) : Application of data mining models in the diagnosis neuropsychiatric diseases. Int J Data Mining Emerging Technol 2014, 4(2), 72-82.
Neuropsychiatry is a complex field and its disease diagnosis depends upon the multiple and overlapping symptoms. Data mining method plays a significant role in the analysis of symptoms for the disease diagnosis. In this paper, we apply different data mining techniques for the diagnosis of five neuropsychiatric diseases. The different data mining techniques that we apply in this paper are based on decision tree and artificial neural network concept. Reduced parameter (Sensitivity analysis) parameters based analysis in combination with decision tree and artificial neural network was also performed. Comparative view of accuracy is performed for reduced and non-reduced parameters.
2 illus, 10 tables, 20 ref
Chawla N;Singh A
014465 Chawla N;Singh A (Computer Science and Engineering Dep, Deenbandhu Chhotu Ram Univ of Science and Technology, Murthal, Sonepat, Haryana, Email: chawla3238@gmail.com) : Cluster evaluation of online social network's data by using k-means algorithm. Int J Data Mining Emerging Technol 2014, 4(2), 83-91.
Clustering is the statistical technique used for identification of how various units like people, groups or societies can be grouped together on the basis of their common characteristics. In recent days, communication and advertising through social networking sites are most popular and interactive strategy among the users. The significance of the proposed work is determined with the help of online surveys of those people who have used social network sites. This paper presents data clustering process by using K-means algorithm for identification of cluster of users with common online behaviour. Furthermore by using WEKA data mining tool we have evaluated the performance of cluster on the basis of quality, accuracy and efficiency on two different cluster modes.
7 illus, 6 tables, 22 ref
Baser P;Saini J R
014464 Baser P;Saini J R (NO, Faculty of Science, R K Univ, Rajkot-360 020, Email: preeti.dalal@gmail.com) : Optimum cluster size identification for K-means using validity index for stock market data. Int J Data Mining Emerging Technol 2014, 4(2), 107-10.
Clustering is one of the data mining techniques widely used in various application areas. It is a process of assigning data objects in different groups so that data objects in the same group have similar behaviour towards each other and be different from other objects in the other groups. It is also known as an unsupervised technique in which class label is not available. Clustering is one of the most popular data mining techniques used in various financial domains. In today's competitive financial market, investors want to earn profit from their investments. This paper shows detailed analysis of k-means clustering method using the Davies-Bouldin index to find the optimum number of clusters which is very difficult for this method. These clusters can be used in further investment analysis.
1 illus, 5 tables, 12 ref
Barot P;Panchal M
014463 Barot P;Panchal M (Computer Science and Engineering Dep, Shri Satsangi Saketdham "Ram Ashram" Group of Institution, Vadasma-382 708, Email: priyadarshini.barot@gmail.com) : Review on various problem transformation methods for classifying multi label data. Int J Data Mining Emerging Technol 2014, 4(2), 45-52.
Learning from multi-label and multi-target data is always more difficult than single-label data. The complexity is incurred by multiple labels assigned to a sample as well as to provide ranking among labels. The learning algorithms used for single-label data are not suitable to learn from multi-label and multi-target data. There are many applications where multi-label and multi-target data are present, for example, image classification, gene classification and document classification. In this paper, review of multi-label classification methods is described. To see correlation between some of these methods and their performance measures, experiments are performed on rial multi-label datasets and results are presented.
6 illus, 13 tables,
Ahila Priyadharshini R;Arivazhagan S
014462 Ahila Priyadharshini R;Arivazhagan S (NO, Mepco Schlenk Engineering College, Sivakasi-625 005, Email: ahilaprem@gmail.com) : A quaternionic wavelet transform-based approach for object recognition. Def Sci J 2014, 64(4), 350-7.
Recognizing the objects in complex natural scenes is the challenging task as the object may be occluded, may vary in shape, position and in size. In this paper a method to recognize objects from different categories of images using quaternionic wavelet transform (QWT) is presented. This transform separates the information contained in the image better than a traditional Discrete wavelet transform and provides a multiscale image analysis whose coefficients are 2D analytic, with one near-shift invariant magnitude and three phases. The two phases encode local image shifts and the third one contains texture information. In the domain of object recognition, it is often to classify objects from images that make only limited part of the image. Hence to identify local features and certain region of images, patches are extracted over the interest points detected from the original image using Wavelet based interest point detector. Here QWT magnitude and phase features are computed for every patch. Then these features are trained, tested and classified using SVM classifier in order to have supervised learning model. In order to compare the performance of local feature with global feature, the transform is applied to the entire image and the global features are derived. The performance of QWT is compared with discrete wavelet transform (DWT) and dual tree discrete wavelet transform (DTDWT). Observations revealed that QWT outperforms the DWT and shift invariant DTDWT with lesser equal error rate. The experimental evaluation is done using the complex Graz databases.
9 illus, 24 ref
Zhang M;Morozov K;Takagi T
013425 Zhang M;Morozov K;Takagi T (School of Computer Sciences, Hubei University of Technology, Wuhan, China) : Revisits and transformations among functional encryption systems. IETE Tech Rev 2014, 31(1), 103-14.
Functional encryption provides a general access control over the encrypted data, where only the receiver with attribute that satisfies control policy function of policy parameter υ→ (i.e. ↵υ→, (Xυ = 1)) can decrypt its ciphertext. Special cases of functional encryption include (anonymous-) (hierarchical) identity-based encryption, fuzzy identity-based encryption, attribute-based encryption, public key encryption with keyword search, spatial encryption, inner-product encryption, hidden-vector encryption and predicate encryption. In general functional encryption systems, the control policy function can be set flexibly. The main gap among these functional encryption schemes lies in the policy functions that associates with the secret keys. In this work, we first investigate several functional encryption schemes, and then formalize and unify the functionality description of the control policies for these schemes. After giving a general definition and security model, we present the relationship and transformations among functional encryption schemes when the equivalence of these different policy functions is employed.
2 illus, 1 table, 26 ref
Yang H;Wang X;Deng J;Zeng J;Zhang X
013424 Yang H;Wang X;Deng J;Zeng J;Zhang X (School of Computer Science and Engineering, Univ of Electronic Science and Technology of China, Chengdu 611731, China) : EA-MTSP: efficient authentication for multiple third-party service providers in smart grids. IETE Tech Rev 2014, 31(2), 143-51.
With the evolution of traditional power grids into smart grids, utilities alone cannot yet provide all electricity services and thus third-party service providers (SPs) are required to help in service provision. Therefore, it is critical to secure third-party service provisions in smart grids. In particular, authentication is required to be done in the first place. However, authentication for multiple third-party SPs has not been well studied in smart grids. In this paper, we model the third-party service provision in smart grids for the first time which can capture specific cyber security threats with the existence of multiple third-party SPs. Furthermore, we propose an efficient authentication scheme for multiple third-party SPs. Security analysis shows that our scheme can achieve multiserver authentication, conditional anonymity, and other important security goals. Performance evaluation demonstrates that our scheme is well suited for smart meters (SMs) with limited resources, and each user only needs to do one registration for multiple SPs thus it has low communication overhead.
7 illus, 3 tables, 20 ref
Sur U K
013423 Sur U K (Chemistry Dep, Behala College, University of Calcutta, Kolkata-700 060, Email: uksur99@yahoo.co.in) : Bio-inspired hemispherical digital cameras of wide-angle field of view. Curr Sci 2014, 107(1), 18-19.
2 illus, 4 ref
Song J;Liu X;Zhu Z;Zhao D;Yu G
013422 Song J;Liu X;Zhu Z;Zhao D;Yu G (NO, College of Software, Northeastern University, Shenyang 110819, People's Republic of China) : Novel task scheduling approach for reducing energy consumption of MapReduce cluster. IETE Tech Rev 2014, 31(1), 65-74.
In recent years, data processing technologies like MapReduce in cloud computing have been widely used. However, the problem of high energy consumption (EC) is an obstacle for further development of cloud computing. We believe that EC could be reduced not only by hardware reinforcement but also by software improvement, especially, by energy-aware task scheduling. In this paper, the Best resources assignment model (Bram) is proposed. On this basis, a scheduling approach, concerning resource usage of nodes and different kinds of resource intensive tasks running on them, is proposed to avoid resource idleness, and then reduce energy consumption. The experimental results show that the new method could reduce the energy consumption of MapReduce cluster.
3 illus, 1 table, 21 ref
Singh K K;Nigam M J;Pal K;Mehrotra A
013421 Singh K K;Nigam M J;Pal K;Mehrotra A (Earthquake Engineering Dep, Indian Institute of Technology, Roorkee) : Fuzzy kohonen local information C-means clustering for remote sensing imagery. IETE Tech Rev 2014, 31(1), 75-81.
This paper presents a neuro fuzzy clustering algorithm, Fuzzy Kohonen Local Information C-Means (FKLICM), for classification of remote sensing images. The proposed algorithm is a hybridization of the conventional Kohonen clustering network and Fuzzy Local Information C-Means (FLICM) to produce a much more efficient and accurate clustering algorithm. The proposed algorithm first forms a fused image with three Multispectral bands and pan band of Landsat 7 Enhanced Thematic Mapper Plus (ETM+) using the Brovey transform. The fused image is a three band image with higher resolution and better visual perception. The fused image is reduced to a one-dimensional image using principal component analysis (PCA). The FKLICM algorithm is applied on the PC-1 image to classify the remote sensing image into different land cover types. Integrating the neural network with a fuzzy system combines the advantages and overcomes the limitations of both technologies. The experimental results of the proposed algorithm are compared with two other algorithms, FCM and GIFP-FCM. The classification results and accuracy assessment show that FKLICM yields better results than the other methods.
3 illus, 3 tables, 21 ref
Shah S;Dalal U
013420 Shah S;Dalal U (NO, National Institute of Technology, Surat, Gujarat) : Enhancing capability of DVB-H by three layer hierarchical mapping. IETE Tech Rev 2014, 31(2), 162-7.
Existing DVB-H technology serves users with different quality video data for TV on mobile. However, in the sever multipath scenario or when the user is on the move only standard definition quality is possible. For high-definition quality, good receiving conditions are necessary. The parallel standard second-generation handheld is in development as DVB-NGH with the incorporation of MIMO technology. Keeping this in mind, instead of reserving bandwidth for higher quality, the proposed hierarchical mapping technique introduces multiple videos with standard quality within the available bandwidth (8 MHz) as well as network with certain modifications and additional processing. These additions do not affect the performance much and give the expected results. The present research work is oriented towards the novel hierarchical mapping scheme and the performance analysis is carried out on three gray-scale videos. Also, incorporation of simple post processing improves the result performance in terms of signal-to-noise requirements.
6 illus, 9 tables, 15 ref
Ma T;Chu Y;Zhao L;Ankhbayar O
013419 Ma T;Chu Y;Zhao L;Ankhbayar O (Jiangsu Engineering Centre of Network Monitoring, Nanjing University of Information Science & Technology, Nanjing, 210044, China) : Resource allocation and scheduling in cloud computing: policy and algorithm. IETE Tech Rev 2014, 31(1), 4-16.
Cloud computing is a new distributed commercial computing model that aims at providing computational resources or services to users over a network in a low-cost manner. Resource allocation and scheduling (RAS) is the key focus of cloud computing, and its policy and algorithm have a direct effect on cloud performance and cost. This paper presents five major topics in cloud computing, namely locality-aware task scheduling; reliability-aware scheduling; energy-aware RAS; Software as a Service (SaaS) layer RAS; and workflow scheduling. These five topics are then classified into three parts: performance-based RAS; cost-based RAS; and performance- and cost-based RAS. A number of existing RAS policies and algorithms are discussed in detail accordingly with regard to their given parameters. In addition, a comparative analysis of five identified problems with their representative algorithms is performed. Finally, some future research directions of cloud RAS are pointed out.
1 illus, 6 tables, 71 ref
Lung J W J;Salam M S H;Rehman A;Rahim M S M; Saba T
013418 Lung J W J;Salam M S H;Rehman A;Rahim M S M; Saba T (Faculty of Computing, Universiti Teknologi Malaysia, Malaysia) : Fuzzy phoneme classification using multi-speaker vocal tract length normalization. IETE Tech Rev 2014, 31(2), 128-36.
The overall success of automatic speech recognition (ASR) depends on efficient phoneme recognition performance and quality of speech signal received in ASR. However, dissimilar inputs of speakers affect the overall recognition performance. One of the main problems that affect recognition performance is inter-speaker variability. Vocal tract length normalization (VTLN) is introduced to compensate inter-speaker variation on the speaker signal by applying speaker-specific warping of the frequency scale of a filter bank. Instead of measuring the performance on word level with speaker-specific warping, this research focuses on direct tackling at the phoneme level and applying VTLN on all speakers' speech signals to analyse the best setting for the highest recognition performance. This research seeks to compare each phoneme recognition results from warping factor between 0.74 and 1.54 with 0.02 increments on nine different ranges of frequency warping boundary. The warp factor and frequency warping range that provides the highest phoneme recognition performance is applied on word recognition. The results show an improved performance in phoneme recognition by 0.7% and spoken word recognition by 0.5% using warp factor of 1.40 on frequency range of 300-5000 Hz in comparison to baseline results.
9 illus, 4 tables, 28 ref
Kim K W;Lee W J
013417 Kim K W;Lee W J (College of Convergence Technology and the Institute of Media Content,, , Korea) : Efficient cellular automata based montgomery AB<. IETE Tech Rev 2014, 31(1), 92-102.
This paper presents two efficient cellular automata based Montgomery AB2 multipliers for exponentiation in finite fields GF(2m) using a polynomial representation. The proposed type I multiplier produces the results in m + 1 cycles with a critical path delay of two 2-input AND gates, two 2-input XOR gates, and one flip-flop using O(m2) area-time complexity. The proposed type II multiplier produces the results in m + 1 cycles with a critical path delay of one 2-input AND gate, two 2-input XOR gates, and one flip-flop using O(m2) area-time complexity. The proposed architectures are highly modular, and consist of regular blocks of AND and XOR logic gates. Exponentiation is more efficiently implemented by applying AB2 multiplication repeatedly rather than AB multiplication. Compared with related works, the proposed multipliers have lower area-time complexity, and computational and include the features of regularity, modularity, and cascadability.
7 illus, 2 tables, 28 ref
Garg H
013416 Garg H (School of Mathematics and Computer Applications, Thapar University, Patiala-147 004, Email: harishg58iitr@gmail.com) : Reliability, availability and maintainability analysis of industrial systems using PSO and fuzzy methodology. MAPAN 2014, 29(2), 115-29.
The purpose of this paper is to present a methodology for analyzing the system performance of an industrial system by utilizing uncertain data. Although there have been tremendous advances in the art and science of system evaluation, yet it is very difficult to assess their performance with a very high accuracy or precision. For handling of these uncertainties, fuzzy set theory has been used in the analysis while their corresponding membership functions are generated by solving a nonlinear optimization problem with particle swarm optimization. For finding the critical component of the system which affects the system performance mostly, a composite measure of reliability, availability and maintainability (RAM) named as the RAM-index has been introduced which influences the effects of failure and repair rate parameters on its performance. A time varying failure and repair rate parameters are used in the analysis instead of constant rate models. Finally, the computed results are finally compared with existing methodologies. The suggested framework has been illustrated with the help of a case.
4 illus, 5 tables, 29 ref
Fuentes J M D;Gonz lez-Manzano L; Gonz lez-Tablas A I;Blasco J
013415 Fuentes J M D;Gonz lez-Manzano L; Gonz lez-Tablas A I;Blasco J (Computer Science Dep, University Carlos III of Madrid, Avda Universidad, 30, 28911 Leganes, Spain) : Security models in vehicular ad-hoc networks. IETE Tech Rev 2014, 31(1), 47-64.
The security and privacy issues of vehicular ad-hoc networks (VANETs) must be addressed before they are implemented. For this purpose, several academic and industrial proposals have been developed. Given that several of them are intended to co-exist, it is necessary that they consider compatible security models. This study presents a survey of the underlying security models of 41 recent proposals. Four key aspects in VANET security are studied, namely trust on vehicles, trust on infrastructure entities, existence of trusted third parties and attacker features. Based on the survey analysis, a basic mechanism to compare VANET security models is also proposed, thus highlighting their similarities and differences.
5 illus, 6 tables, 52 ref
Assaf M H;Mootoo R;Das S R;Petriu E M;Groza V;Biswas S N
013414 Assaf M H;Mootoo R;Das S R;Petriu E M;Groza V;Biswas S N (Electrical and Electronic Engineering Dep, Faculty of Science and Technology, Univ of the South Pacific (USP), Suva 19128) : Designing home security and monitoring system based on field programmable gate array. IETE Tech Rev 2014, 31(2), 168-75.
In the conventional design of home security systems, only the property is typically monitored, without taking into consideration the physical control aspects of the house itself. Besides, the term security is not strictly well defined in view of the fact that there is usually a time delay between the alarm system going on and actual arrival of the security personnel. This paper presents the development of a home security and monitoring system that is suitable where the traditional security systems that are mostly concerned about curbing burglary, gathering evidence against trespassing and so on fail. The design and implementation details of this new home control and security system which is based on field programmable gate array has been discussed in the subject paper. The user here can interact directly with the system through a web-based interface over the Internet, while home appliances like air conditioners, lights, door locks, and gates are controlled remotely through a user-friendly web page. An additional feature that enhances the security aspect of the system is its capability to monitor entry points such as doors and windows so that in the event of any breach, an alerting email message could be sent to the home owner instantly.
6 illus, 12 ref