IJCT - Volume 4, Issue 4 / July - August 2017

S.No	Title/Author Name	Serial No
1	Enhancing Data Security in Cloud Computing Growth Security - M.Subhashini, Dr.P.Srivaramangai. [ Abstract ] [ Cite ] [ PDF ] Abstract In this paper performed Cloud computing is an Internet-based computing and next stage in evolution of the internet. It has received significant attention in recent years but security issue is one of the major inhibitor in decreasing the growth of cloud computing. One of the most important and leading is security issue that needs to be addressed. Data Security concerns arising because both user data and program are located in provider premises. The architecture of cloud poses such a threat to the security of the existing technologies when deployed in a cloud environment. Cloud service users need to be vigilant in understanding the risks of data breaches in this new environment. we propose a two-factor data security protection mechanism with factor revocability for cloud storage system. Our system allows a sender to send an encrypted message to a receiver through a cloud storage server. The sender only needs to know the identity of the receiver but no other information (such as its public key or its certificate). A recent survey by Cloud Security Alliance (CSA) & IEEE indicates that enterprises across sectors are eager to adopt cloud computing but that security are needed both to accelerate cloud adoption on a wide scale and to respond to regulatory drivers. It also details that cloud computing is shaping the future of IT but the absence of a compliance environment is having dramatic impact on cloud computing growth. Keyword: Cloud, Security × M.Subhashini, Dr.P.Srivaramangai ," Enhancing Data Security in Cloud Computing Growth Security " Vol. 4 - Issue 4 (1-5) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I4P1
2	A Review on Different Spam Detection Approaches - K.Ravikumar, P.Gandhimathi [ Abstract ] [ Cite ] [ PDF ] Abstract The spam mails are used by spammers to pilfer the data of the users and organizations online. Quick growth rate of the use of the internet has increased the spam mails. There are several methods employed for filtering spam. Most of the spam filtering techniques are based on objective methods such as the content filtering and DNS/reverse DNS checks. Recently, some cooperative subjective spam filtering techniques are proposed. Objective methods suffer from the false positive and false negative classification. Objective methods based on the content filtering are time con-suming and resource demanding. They are inaccurate and require continuous update to cope with newly invented spammer�s tricks. On the other side, the existing subjective proposals have some drawbacks like the attacks from mali-cious users that make them unreliable and the privacy. In this paper, we propose an efficient spam filtering system that is based on a smart cooperative subjective technique for content filtering in addition to the fastest and the most reliable non-content-based objective methods. The growing use of internet has promoted an easy and fast way of e-communication. The well-known example for this is E-MAIL. The increasing use of e-mail and the growing trend of Internet users sending unsolicited bulk e-mail, the need for an antispam filtering or have created, Filter large poster have been produced in this area, each with its own method and some parameters are to recognize spam.. Keyword: Spam Filtering, E-mail, Images, Text Tagging, Web Application Web Services × K.Ravikumar, P.Gandhimathi ,"A Review on Different Spam Detection Approaches" Vol. 4 - Issue 4 (6-9) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I4P2
3	Incorporated Keyword Search Using Characteristic Based Encryption for Electronic Health Records in Vapours - A.Senthil Kumar, S.Abirami [ Abstract ] [ Cite ] [ PDF ] Abstract Electronic health (e-health) document frame is a new usage which provide more relieve in healthcare. The fortification shield and safety of the susceptible personal manuscript is the significant matter for the users, these factors major concerns for further evolution of the framework. Users fundamentally have two major concerns related to their personal information like the solitude and safety measures of the susceptible personal information, which might harm or obstruct further enlargement. Re-encryption scheme provides more safety to the records by re-encrypting the encrypted index before uploading them into cloud server. Since the patient�s healthcare records consist of susceptible in order, it may be not convenient for the patient when his records are accessed by everybody. The searchable encryption (SE) format is a equipment to have as a feature sanctuary aegis and propitious operability functions together, which can play a consequential role in the e-health record system. This provides the patients to give the access right permission to other users to operate search function on the personal record in limited time period. And then it verifies the user substantiation. Then it allows the user to access the data in a scrupulous time meeting. File access process is over then the meeting is over file convey time is very short time so attackers can�t the users file and also user gives request any time so it�s very problematical for the attackers to access the user data illegally. Keyword: Searchable Encryption; Time Control, Designated Tester, E-health. × A.Senthil Kumar, S.Abirami ,"Incorporated Keyword Search Using Characteristic Based Encryption for Electronic Health Records in Vapours" Vol. 4 - Issue 4 (10-13) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P3
4	CRM Through Customer Online Reviews and Analysis - S. Alexander Suresh [ Abstract ] [ Cite ] [ PDF ] Abstract Merchants selling products on the Web often ask their customers to review the products that they have purchased and the associated services. As e-commerce is becoming more and more popular, the number of customer reviews that a product receives grows rapidly. For a popular product, the number of reviews can be in hundreds or even thousands. This makes it difficult for a potential customer to read them to make an informed decision on whether to purchase the product. It also makes it difficult for the manufacturer of the product to keep track and to manage customer opinions. For the manufacturer, there are additional difficulties because many merchant sites may sell the same product and the manufacturer normally produces many kinds of products. In this research, we aim to mine and to summarize all the customer reviews of a product. This summarization task is different from traditional text summarization because we only mine the features of the product on which the customers have expressed their opinions and whether the opinions are positive or negative. We do not summarize the reviews by selecting a subset or rewrite some of the original sentences from the reviews to capture the main points as in the classic text summarization. Our task is performed in three steps: (1) mining product features that have been commented on by customers; (2) identifying opinion sentences in each review and deciding whether each opinion sentence is positive or negative; (3) summarizing the results. This paper proposes several novel techniques to perform these tasks. Our experimental results using reviews of a number of products sold online demonstrate the effectiveness of the techniques. Keyword: CRM, OPINION, REVIEWS. × S. Alexander Suresh ,"CRM Through Customer Online Reviews and Analysis" Vol. 4 - Issue 4 (14-18) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P4
6	Server-Designation Preventive Scheme for Public key Encryption with Keyword Search Cryptographic Primordial - A.Senthil Kumar, S.Vimal [ Abstract ] [ Cite ] [ PDF ] Abstract Customer Relationship Management (CRM) is a process that manages the interactions between a company and customer. The primary users of CRM software applications are database marketers. Who are looking to automate the process of interacting with customer? Data mining applications process of searching the mountains to find patterns that are good predicators of purchasing behaviors. This separation of the data mining and campaign management software introduction considerable inefficiency and opens the door for human errors. Tightly integrating the two disciplines presents an opportunity for companies to gain to gain competitive advantage. Keyword: Operational CRM, Analytical CRM, Collaborative CRM. × A.Senthil Kumar, S.Vimal ,"Server-Designation Preventive Scheme for Public key Encryption with Keyword Search Cryptographic Primordial" Vol. 4 - Issue 4 (27-30) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P6
7	Watermarking and Multiobjective Based Secure Data Aggregation for Wireless Sensor Network - Jaybhaye Chaitali, Dr. P. M. Pawar [ Abstract ] [ Cite ] [ PDF ] Abstract Wireless Sensor network is formed of sensor nodes, placed in defy and hostile environment. Many important fields are dependent on WSN for data gathering from human unreachable areas. Sensor nodes have restricted amount of resources like memory, battery. Data aggregation helps to reduce energy usage by minimizing data transmission and removing data redundancy. Research proposed Multiobjective based optimization for secure data aggregation. Multiobjective optimization is used for cluster level aggregation. The research proposed watermarking based mechanism for securing data Watermarking provides data confidentiality and data integrity with less computational cost. Results of the SDAMMO are compared with the MH-EESDA system. Results show that the SDAMMO system is more efficient than the MH-EESDA. Keyword: Wireless Sensor Network, Data Aggregation, Secure Data Aggregation, Multiobjective Optimization, Watermarking. × Jaybhaye Chaitali, Dr. P. M. Pawar ,"Watermarking and Multiobjective Based Secure Data Aggregation for Wireless Sensor Network" Vol. 4 - Issue 4 (31 - 37) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P7
8	A Study on Genes Identification with Expression Levels Related to Breast Cancer Prognosis Using Data Mining Techniques - N.Sureshbabu , S.Sivakumar [ Abstract ] [ Cite ] [ PDF ] Abstract The study of identifying genes more correlated with the prognosis of breast cancer, we used data mining techniques to study the gene expression values of breast cancer patients with known clinical outcome. Focus of our work was the creation of a classification model to be used in the clinical practice to support therapy prescription. We randomly subdivided a gene expression dataset of 96 samples into a training set to learn the model and a test set to validate the model and assess its performance. We evaluated several learning algorithms in their not weighted and weighted form, which we defined to take into account the different clinical importance of false positive and false negative classifications. Based on our results, these last, especially when used in their combined form, appear to provide better results. Keyword: Data Mining, Gene expression; Breast Cancer Prognosis. × N.Sureshbabu , S.Sivakumar ," A Study on Genes Identification with Expression Levels Related to Breast Cancer Prognosis Using Data Mining Techniques " Vol. 4 - Issue 4 (38 - 44) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P8
9	Partial Face Recognition Using Robust Point Set Matching - A.K.Mariselvam , A.Akhil , S.Vishnumohan Reddy , B.Rishvita Reddy [ Abstract ] [ Cite ] [ PDF ] Abstract A number of methods have been proposed for recognition of a face over the past few decades. Some of them have shown promising results but they work only in well controlled condition. In this method, the face patch and the gallery image are brought to the same size before finding the similarities between the images. In our real world scenarios, a lot of faces get covered by other objects like scarfs, sunglasses, another person face in front of us, the angle between the camera and the person etc., not being able to recognise the persons face. To overcome such cases a method should be developed to identify the persons face. A gallery image and a face patch is taken, first we detect their keypoints and extract their textual features and geometric features. Then we proceed with the robust point set matching where we match keypoints with the textual features and the geometrical features of both the gallery image and the face patch image. Finally, the distance between the features is matched and the face is recognised. Keyword: Face recognition, partial face recognition, feature set matching, feature alignment, image matching. × A.K.Mariselvam , A.Akhil , S.Vishnumohan Reddy , B.Rishvita Reddy ," Partial Face Recognition Using Robust Point Set Matching " Vol. 4 - Issue 4 (45 - 47) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P9
10	EEG Based Hearing Threshold Determination Using Artificial Neural Network - .Ezhilarasi V., Shahin A. [ Abstract ] [ Cite ] [ PDF ] Abstract A simple method has been proposed to distinguish the normal and abnormal hearing subjects (conductive or sensorineural hearing loss) using acoustically stimulated EEG signals. Auditory Evoked Potential (AEP) signals are unilaterally recorded with monaural acoustical stimulus from the normal and abnormal hearing subjects with conductive or sensorineural hearing loss. The extracted features are applied to machine-learning algorithms to categorize the AEP signal dynamics into their hearing threshold states of the subjects. To classify the normal hearing and abnormal hearing subjects with conductive or sensorineural hearing loss. To detect the hearing loss for all including neonates, infants and multiple handicaps which helps to improve their quality of life. Keyword: EGG signals, AEP signal ,Sensorineural hearing loss,Neonates. × Ezhilarasi V., Shahin A. ," EEG Based Hearing Threshold Determination Using Artificial Neural Network " Vol. 4 - Issue 4 (48 - 54) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P10
11	Improving Energy-Effiency in Wireless Body Area Network for M-Gear Using Multihop Link Efficient Protocol (MLEP) - Suganya Devi D, Lavanya S [ Abstract ] [ Cite ] [ PDF ] Abstract Wireless Sensor Network (WSNs)provides a new model for sensing and spreading information from different environments, with the possibility to serve numerous and various applications. WSN is prominent area of research nowadays, because of the potential utilization of sensor networks in different applications. Wireless sensor network is a collection of various small micro-electro-mechanical devices. These small devices have sensors, capability of computation, supply of power and the wireless transmitter and receiver. A body area network (BAN), also referred to as a wireless body are network(WBAN) or a body sensor network (BSN), is a wireless network of wearable computing devices. BAN devices may be embedded inside the body, implants, may be surface-mounted on the body in a fixed position Wearable technology or may be accompanied devices which humans can carry in different positions, in clothes pockets, by hand or in various bags. The proposed process focus on Wireless body area sensors are used to monitor human health with energy constraints. Different energy efficient routing schemes are used to forward data from body sensors to medical server. It is important that sensed data of patient reliably forward to medical specialist or server for further analysis. To increase the throughput and reliable communication between sensors and sink, we propose a new scheme. Main advantages of our proposed protocol scheme are to achieve a longer stability time. Nodes stay alive for longer period and consume less energy. The large stability period and less energy consumption of nodes, contribute to a high throughput. Keyword: ---- × Suganya Devi D, Lavanya S," Improving Energy-Effiency in Wireless Body Area Network for M-Gear Using Multihop Link Efficient Protocol (MLEP) " Vol. 4 - Issue 4 (55 - 61) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P11
12	Cascade-Forward Algorithm to Extract Hidden Rules of Gastric Cancer Information Based on Ontology - Ms.Janani A., Mrs. Shoba S.A. [ Abstract ] [ Cite ] [ PDF ] Abstract Cancer is the leading cause of death in economically developed countries and the second leading cause of death in developing countries. Gastric cancers are among the most devastating and incurable forms of cancer and their treatment may be excessively complex and costly. Data mining, a technology that is used to produce analytically useful information, has been employed successfully with medical data. Although the use of traditional data mining techniques such as association rules helps to extract knowledge from large data sets, sometimes the results obtained from a data set are so large that it is a major problem. In fact, one of the disadvantages of this technique is a lot of nonsense and redundant rules due to the lack of attention to the concept and meaning of items or the samples. This paper presents a new method to discover association rules using ontology to solve the expressed problems. This paper reports a data mining based on ontology on a medical database containing clinical data on patients referring to the Imam Reza Hospital at Tabriz. The data set used in this paper is gathered from 490 random visitors to the Imam Reza Hospital at Tabriz, who had been suspicions of having gastric cancer. The proposed data mining algorithm based on ontology makes rules more intuitive, appealing and understandable, eliminates waste and useless rules, and as a minor result, significantly reduces Apriori algorithm running time. The experimental results confirm the efficiency and advantages of this algorithm. Keyword: cascade forwarding algorithm, back propagation algorithm, cancer detection, mapping and ontology. × Ms.Janani A., Mrs. Shoba S.A. ,"Cascade-Forward Algorithm to Extract Hidden Rules of Gastric Cancer Information Based on Ontology" Vol. 4 - Issue 4 (62 - 70) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P12
13	Effective Use of Data Mining on Biological and Clinical Data Analysis - Ms. Lavanya M, Mrs. Shoba S.A., [ Abstract ] [ Cite ] [ PDF ] Abstract In the past, many researchers used data mining techniques in any area. A lot of amounts of data have been collected from scientific domains such as geo sciences, astronomy, meteorology, geology and biological sciences. Data mining techniques and tools used by researchers in biological and environmental problems also. In biological science data mining used in sequences alignment is based on the fact that all living organisms are related by evolution and in environmental science data mining used in predicting data such as earthquakes and landslide etc. This paper highlights on the wide survey of protein sequences, (DNA, RNA) sequences, cancer prediction, relational and semantic data mining for biomedical research area. Health care data, multiagent framework for bio data mining, predicting earthquakes, landslide and spatial data in distributed data mining alg orithms and tools. This is including in bioinformatics and environmental studies also. Keyword: Daa mining Process, DNA, RNA Relational Database Schema, health care monitoring. × Ms. Lavanya M, Mrs. Shoba S.A., ," Effective Use of Data Mining on Biological and Clinical Data Analysis" Vol. 4 - Issue 4 (71 - 78) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P13
14	Amplification Misplaced Answers to Crowd DB Using Fuzzylogic and K-Means Clustering Algorithm - Ms.Pavithra P., Ms. Abarna N. [ Abstract ] [ Cite ] [ PDF ] Abstract Due to the fact that existing database systems are increasingly more difficult to use, improving the quality and the usability of database systems has gained tremendous momentum over the last few years. Data clustering is a process of arranging data into groups or a technique for classifying a mountain of information into some manageable meaningful piles. The goal of clustering is to partitions a dataset into several groups such that the similarity within a group is better than among groups. K- means is one of the basic clustering algorithm which is commonly used in several applications, but it is computationally time consuming and the quality of the resulting clusters heavily depends on the selection of initial centroids. We can remove first limitation using the Enhanced K- Means algorithm. This paper represents the comparison analysis of basic K-Means clustering algorithm and Enhanced K- Means clustering algorithm which shows Enhanced K-Means algorithm more effective and efficient than Basic K-means algorithm. we use the query-refinement method. That is, given as inputs the original top-k SQL query and a set of missing tuples, our algorithms return to the user a refined query that includes both the missing tuples and the original query results. Case studies and experimental results show that our algorithms are able to return high quality explanations efficiently. Keyword: Missing answers, Top-K, SQL, Usability, K-Means Clustering, fuzzy logic set. × Ms.Pavithra P., Ms. Abarna N. ," Amplification Misplaced Answers to Crowd DB Using Fuzzylogic and K-Means Clustering Algorithm" Vol. 4 - Issue 4 (79 - 87) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P14
15	Mechanical Investigation of Packet Production - Ms. Ramya P., Saravanan A. M. [ Abstract ] [ Cite ] [ PDF ] Abstract Networks are getting larger and more complex, yet administrators rely on rudimentary tools such as ping and trace route to debug problems. ATPG propose an automated and systematic approach for testing and debugging networks called ?Automatic Test Packet Generation? (ATPG). ATPG reads router configurations and generates a device-independent model. The model is used to generate a minimum set of test packets to minimally exercise every link in the network or maximally exercise every rule in the network. Test packets are sent periodically, and detected failures trigger a separate mechanism to localize the fault. ATPG can detect both functional and performance problems . ATPG complements but goes beyond earlier work in static checking which cannot detect liveness or performance faults or fault localization which only localize faults given liveness results. ATPG describe our prototype implementation and results on two real-world data sets: Stanford University?s backbone network and Internet2. We find that a small number of test packets suffice to test all rules in these networks. ATPG code and the data sets are publicly available. Keyword: Automatic Test Packet Generation (ATPG, small number of test packets). × Ms. Ramya P., Saravanan A. M," Mechanical Investigation of Packet Production " Vol. 4 - Issue 4 (88 - 95) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P15
16	Adapted Collaborative Filtering for Web Service Recommendation Using QOS Prediction Method - Ms. Sangeetha A, Mrs. Abarna N. [ Abstract ] [ Cite ] [ PDF ] Abstract Collaborative Filtering (CF) is widely employed for making Web service recommendation. CF-based Web service recommendation aims to predict missing QoS (Quality-of-Service) values of Web services. Although several CF-based Webs service QoS prediction methods have been proposed in recent years, the performance still needs significant improvement. Firstly, existing QoS prediction methods seldom consider personalized influence of users and services when measuring the similarity between users and between services. Secondly, Web service QoS factors, such as response time and throughput, usually depends on the locations of Web services and users. However, existing Web service QoS prediction methods seldom took this observation into consideration. In this paper, we propose a location-aware personalized CF method for Web service recommendation. The proposed method leverages both locations of users and Web services when selecting similar neighbors for the target user or service. The method also includes an enhanced similarity measurement for users and Web services, by taking into account the personalized influence of them. To evaluate the performance of our proposed method, we conduct a set of comprehensive experiments using a real-world Web service dataset. The experimental results indicate that our approach improves the QoS prediction accuracy and computational efficiency significantly, compared to previous CF-based methods. Keyword: location based service, CF method, Qos prediction method, CF based web service. × Ms. Sangeetha A, Mrs. Abarna N ," Adapted Collaborative Filtering for Web Service Recommendation Using QOS Prediction Method " Vol. 4 - Issue 4 (96 - 103) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P16
17	Modified Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds - B.Sudha [ Abstract ] [ Cite ] [ PDF ] Abstract In Cloud Computing models, Virtual Machines (VM) can be dynamically provisioned according to demand and released when not needed. Efficient Virtual Machine (VM) provisioning and allocation allows the cloud providers to effectively utilize their available resources and obtain higher profits. The existing static VM provisioning may not guarantee economically efficient allocation and thus cannot guarantee maximum revenue for cloud providers. A better solution would be to take into account the users' demand and dynamically provision VM instances. In the recent times, the cloud providers have introduced auction-based models for VM provisioning and allocation which allow users to submit bids for their requested VMs. MM Nejad, L. Mashayekhy and D Grosu have formulated a dynamic VM provisioning and allocation problem for the auction-based model as an integer program considering multiple types of resources. They have designed truthful greedy and optimal mechanisms for the problem such that the cloud provider provisions VMs based on the requests of the winning users and determines their payments. Since Virtual Machines are created by Hypervisors in the underlying physical machines and this would result in overhead and ultimately would impact the overall performance of the cloud. We propose that this overhead could be factored inthe design of Truthful Greedy mechanisms. It is hoped that our proposed idea can achieve better results in terms of revenue for the cloud provider. Keyword: Cloud computing; truthful mechanism; virtual machine provisioning; dynamic resource allocation; hypervisor; Cloud provider. × B.Sudha ," Modified Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds " Vol. 4 - Issue 4 (104 - 110) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P17
18	DEYPOS: Deduplicatable Efficiency of Dynamic Proof of Storage for Multi-User Knowledge - A. Senthil Kumar, P.Raju [ Abstract ] [ Cite ] [ PDF ] Abstract Dynamic Proof of Storage (PoS) is a useful cryptographic primitive that enables a user to check the integrity of outsourced files and to efficiently update the files in a cloud server. Although researchers have proposed many dynamic PoS schemes in single user environments, the problem in multi-user environments has not been investigated sufficiently. A practical multi-user cloud storage system needs the secure client-side cross-user deduplication technique, which allows a user to skip the uploading process and obtain the ownership of the files immediately, when other owners of the same files have uploaded them to the cloud server. To the best of our knowledge, none of the existing dynamic PoSs can support this technique. In this paper, we introduce the concept of deduplicatable dynamic proof of storage and propose an efficient construction called DeyPoS, to achieve dynamic PoS and secure cross-user deduplication, simultaneously. Considering the challenges of structure diversity and private tag generation, we exploit a novel tool called Homomorphic Authenticated Tree (HAT). We prove the security of our construction, and the theoretical analysis and experimental results show that our construction is efficient in practice. Keyword: Authenticate, Techniques, Tree. × A. Senthil Kumar, P.Raju ," DEYPOS: Deduplicatable Efficiency of Dynamic Proof of Storage for Multi-User Knowledge " Vol. 4 - Issue 4 (111 - 114) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P18
19	Enhanced Classification Model for Cervical Cancer Dataset based on Cost Sensitive Classifier - Hayder K. Fatlawi [ Abstract ] [ Cite ] [ PDF ] Abstract Cervical cancer threatens the lives of many women in our world today. In 2014, the number of women infected with this disease in the United States was 12,578, of which 4,115 died, with a death rate of nearly 32%. Cancer data, including cervical cancer datasets, represent a significant challenge data mining techniques because absence of different costs for error cases. The proposed model present a cost sensitive classifiers that has three main stages; the first stage is prepressing the original data to prepare it for classification model which is build based on decision tree classifier with cost selectivity and finallyevaluation the proposed model based on many metrics in addition to apply a cross validation.The proposed model provides more accurate result in both binary class and multi class classification. It has a TP rate (0.429) comparing with (0.160) for typical decision tree in binary class task. Keyword: Decision Tree, Cost Sensitive Classifier, Cervical Cancer, Imbalance Class. × Hayder K. Fatlawi ," Enhanced Classification Model for Cervical Cancer Dataset based on Cost Sensitive Classifier " Vol. 4 - Issue 4 (115 - 120) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P19
20	SDDMCSS: Secure and Data De-duplicated Multi-Cloud Storage System - Priyanka Sunil Rokade , Biplab Kumar Sarkar , Prof. Dr. Bej Raj Singh Patel [ Abstract ] [ Cite ] [ PDF ] Abstract Normally when user uploads any file that file is stored on single cloud service provider. From a customer’s point of view relying upon a solo Service Provider for his outsourced data is not very promising. In addition, providing better privacy as well as ensuring data availability, can be achieve by dividing the user’s data block into data pieces and distributing them among the available Service Providers in such a way that no less than a threshold number of Service Providers can take part in successful retrieval of the whole data block. In the proposed system a secured cost-effective multi-cloud storage (SCMCS) model in cloud computing which holds an economical distribution of data among the available Service Providers in the market, to provide customers with data availability as well as secure storage. Along with file storage on multiple clouds, here invention focusses on ‘Data Deduplication’ technique also. Deduplication is a method of removing duplicate files or data from the storage, and is used in cloud computing environment to minimize storage space as well as network bandwidth. In data deduplication single copy of file is stored in cloud environment, which is owned by a large number of data users which may leads to reduced reliability, availability and security. Along with deduplication, there is a major issue of security for sensitive data, when the data has been outsourced on the cloud. By addressing security challenges, we attempt to formalize the secure distributed deduplication system. Here we are proposing new distributed data deduplication system, which achieves more confidentiality, integrity and reliability, as compare to the traditional deduplication system. In the proposed system single data chunk or file is divided and distributed on the multiple cloud storage servers, in such a way that the single part of file is unpredictable. This is done by introducing a Shamir secret sharing scheme and hashing algorithms in distributed cloud storage system, without using traditional ways of encryption-decryption scheme. Also proposed system will be focusing on the recovery and reconstruction of corrupted data or failed storage site without using traditional backup or recovery methods as like RAID array method. Keyword: SDDMCSS, data deduplication, cloud storage, reliability, availability and RAID array. × Priyanka Sunil Rokade , Biplab Kumar Sarkar , Prof. Dr. Bej Raj Singh Patel ," SDDMCSS: Secure and Data De-duplicated Multi-Cloud Storage System " Vol. 4 - Issue 4 (121 - 130) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P20
21	A Study on Data Mining Optimizing Visual Search Re-Ranking Via Pair Wise Learning Image Datas - L.Dhivyajayadharshini [ Abstract ] [ Cite ] [ PDF ] Abstract Conventional approaches to visual search re-ranking empirically take the �classification performance� as the optimization objective, in which each visual document is determined whether relevant or not, followed by a process of increasing the order of relevant documents. In this project, we first reestablish the fact that: the classification performance fails to produce a globally optimal ranked list. Hence, we formulate re-ranking as an optimization problem, in which a ranked list is globally optimal only if any arbitrary two documents in the list are correctly ranked in terms of relevance. This is different from existing Approaches which simply classify a document as �relevant� or not. To find the optimal ranked list, we convert the individual documents to �document pairs�, Each pair is represented as an �ordinal relation.� Then, we find the optimal document pairs which can maximally preserve the initial rank order while simultaneously keeping the consistency with the auxiliary knowledge mined from query examples and web resources as much as possible. We develop two pair wise re-ranking methods, difference pair wise re-ranking (DP-re-ranking) and exclusion pair wise re-ranking (EP-re-ranking), to obtain the relevant relation of each document pair. Finally, a round robin criterion is explored to recover the final ranked list. Keyword: Re-rank, icons, mining. × L.Dhivyajayadharshini ," A Study on Data Mining Optimizing Visual Search Re-Ranking Via Pair Wise Learning Image Datas " Vol. 4 - Issue 4 (121 - 130) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P21
22	A Review and New Subjective Evaluation Experiment of Objective Metricsused to Evaluate Histogram Equalization-based Contrast Enhancement Techniques - Hasan Thabit Rashid Kurmasha , Abbas Fadhil Alharan [ Abstract ] [ Cite ] [ PDF ] Abstract Histogram Equalization (HE) is a dominant contrast enhancement method mainly used in image processing expanse due to its efficacy in forming images with good contrast. Various versions of works' efforts in Global HE have been created over the years. Improperly, these methods� resilience to distortion remains questionable. This paper proposes to evaluate the selected two objective metrics which are the Absolute Mean Brightness Error (AMBE) and Entropy used for evaluation of image quality assessment algorithms (IQAs) based onGHE techniques. A review for thesetwo objective metrics is made. It is found that the two IQAs fail to detect the occurrence of noise artifacts and gray level brightness saturation effectively.Also,an experiment was conducted by using subjective evaluation to assess the performance of these twoobjective metrics. The statistical results of the experimentreveal that they have poor correlation with Human Visual Perception (HVP) of distortions. Keyword: Contrast enhancement;Histogram equalization;Human visual perception;Image quality assessment, Distortions, AMBE, Entropy. × Hasan Thabit Rashid Kurmasha , Abbas Fadhil Alharan ," A Review and New Subjective Evaluation Experiment of Objective Metricsused to Evaluate Histogram Equalization-based Contrast Enhancement Techniques " Vol. 4 - Issue 4 (131 - 136) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P22
23	A New Group Signature Scheme using IBE - Girish , Dr.Phaneendra H.D [ Abstract ] [ Cite ] [ PDF ] Abstract Group signature is a method which allows any genuine group member to sign many number of messages on behalf of the group without giving his identity. Whenever dispute arises, the manager of the group can reveal the identity of the signer. If quantum computer comes in to picture group signatures which are based on the traditional cryptography can be broken easily. In this paper, we propose a new identity based group signature. Our signature scheme is based on bilinear maps. This identity based scheme has the security properties of group signatures. In this scheme the size of the group pubic key and the length of signatures are independent on the size of the group. This scheme can be used for very large groups. Same key pair can be used by the group member to sign many messages. Keyword: Group Signature, Digital Signature, Identity based Group signature, Bilinear Map × Girish , Dr.Phaneendra H.D ," A New Group Signature Scheme using IBE " Vol. 4 - Issue 4 (137 - 143) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P23
24	The Research on Accelerated Routing Lookup Algorithms - Yaqiong Li , Xiaohua Meng , Jie Li [ Abstract ] [ Cite ] [ PDF ] Abstract With the rapid development of the network, the speed of optical fiber and interface transmission has been improved, and the ability of network equipment to handle message processing has become the main bottleneck of the current high performance network development. Core routing turned sharply increasing scale of published, leading to increasing demand time and memory look-up table, and the need to press the longest prefix match when forwarding lookup, make address lookup in numerical and length on the two dimensions. Therefore, to deal with a large number of packets and ensure network quality, faster routing search speed is needed. Surrounding the technology of high performance routing lookup is studied, this paper puts forward two kinds of routing lookup algorithm based on GPU acceleration technology, based on hash table(CUCKOO FILTER) lookup algorithm of acceleration and LCTrie acceleration of tree search algorithm, and compared and analyzed the advantages and disadvantages of the two methods. Keyword: Routing Lookup, GPU, CUCKOO FILTER, Hash Table, LCTrie, Fast Routing × Yaqiong Li , Xiaohua Meng , Jie Li ," The Research on Accelerated Routing Lookup Algorithms " Vol. 4 - Issue 4 (144 - 153) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P24
25	Public Key Infrastructure Using Wireless Communication Networks - R.Karthikeyan , Dr.T.Geetha , Shanmugapriya M , Vimala M [ Abstract ] [ Cite ] [ PDF ] Abstract The Smart Grid is an electrical power infrastructure that makes intelligent decisions about the state of the electrical power system to maintain a stable environment. It is expected that the smart grid will radically add new functionalities to legacy electrical power systems. However, believe that this will in turn introduce many new security risks. In addition, different protocols that are used in these networks use their own set of security requirements. The public key infrastructure (PKI) is a viable solution; it has some difficulties to satisfy the requirements in availability, privacy preservation, and scalability. To complement the functions of PKI, introduce some novel mechanisms so that those security requirements can be met. In particular, propose a mechanism to efficiently resist Denial-of-Service (DoS) attacks, and some suggestions to the security protocol design for different application categories. Keyword: Smart grid, PKI, DoS × R.Karthikeyan , Dr.T.Geetha , Shanmugapriya M , Vimala M ," Public Key Infrastructure Using Wireless Communication Networks " Vol. 4 - Issue 4 (154 - 158) - July - August 2017 , International Journal of Computer Techniques (IJCT) , ISSN: 2394 - 2231 , www.ijctjournal.org ×	IJCT-V4I3P25

Go Top

IJCT - Volume 4, Issue 4 / July - August 2017

IJCT Management

Downloads

IJCT Policy