IJCST Logo

International Journal of Computer Science and Technology
Vol 6.4 ver – 2 (Oct – Dec 2015)

S.No. Research Topic Paper ID Download
31

A Survey: Feature based Intrusion Detection System in Mobile Ad-hoc Network

Devendra Singh, S.S. Bedi

Abstract

Mobile Ad-Hoc Network (MANET) has increased possibility of packet loss, attacks, misbehaving resulting in degrade the performance or break networks. Intrusion detection techniques help in detection of these attacks and packet loss occurs in network. The existing attacks suffer from selfishness of node causing packet loss which may be further aggravated by intrusion detection. This survey discusses about the conventional classification engines that
are prime candidates for the study of intrusion detection system. And also reviewed the various classification and trust approaches proposed in the literature to make conventional IDS efficient. This paper present a survey of the main intrusion detection system (IDS), then classify these mechanisms as either feature based that deal with reduction step called preprocessing, or as trust value that can deal with threshold values. Based on the survey,
A comparison of the proposed intrusion detection system is also included in this paper. Finally, we identify areas where further research could focus.
Full Paper

IJCST/64/2/A-0595
32

Document Clustering in Seized Computers for Finding Latent Patterns

Sk.Hussain, R.Madhuri

Abstract

In seized computers, a lot of unstructured text documents are available and analyzing those documents by the examiners will be more difficult. So clustering is used for analyzing those documents and also to reduce the workload for examiners. By using clustering technique, a separation of multiple collection of documents into
similar group is done. Here K-means clustering algorithm derives clusters for given documents.The accuracy of proposed method is high in terms of f-measure and time.
Full Paper

IJCST/64/2/A-0596
33

Authorized Duplicate Check Scheme in Cloud Using Hybrid Cloud

Vallu Srinivas, Madasu Gnana Vardhan

Abstract

This paper represents that, several strategies are victimization for the elimination of duplicate copies of recapping information, from those techniques, one amongst the vital information compression techniques is information duplication. Several edges with this information duplication, principally it’ll decrease the amount of cupboard space and save the information measure once victimization in cloud storage. to shield privacy of the sensitive information whereas supporting de-duplication information is encrypted by the projected confluent encoding technique before out sourcing. Issues legal information duplication formally selfaddressed by the primary try of this paper for higher protection of knowledge security. this is often totally different from the
standard duplication systems. The differential privileges of users are additional thought-about in duplicate check besides the information itself. In hybrid cloud vogue licensed duplicate check supported by many new duplication constructions. Supported the definitions per the projected safety model, our theme is secure. Proof of the idea enforced during this paper by conducting testbed experiments.
Full Paper

IJCST/64/2/A-0597
34

Performance Evaluation of HEED and H-HEED Protocol with Robomotes in WSN

Harneet Kour, Dr. Ajay K Sharma

Abstract

In wireless sensor network, all the routing algorithms currently available are taking the assumption that the sensor nodes are stationary. Some recent applications of sensor-nets (e.g. in medical care and disaster response) make use of mobile sensor nodes. Mobility improves the coverage of wireless sensor networks. In this paper, the enhancement to HEED protocol to support mobility in both homogenous and heterogeneous network. In this we will examine the performance issues HEED and H-HEED in mobile wireless sensor network. We also assume that speed of mobile nodes moving in the network is neither too high nor too low but it’s moderate.
Full Paper

IJCST/64/2/A-0598
35

Analytical Study on Fast and Secure Authenticated Key Agreement Protocol for Low Power Networks

Anooja Ali

Abstract

The increasing progress of wireless mobile communication demands more security. Authenticated key agreement protocol is an important primitive for establishing session key. In this paper, an improved Elliptic Curve based Fast and Secure Authenticated Key Agreement (FS-AKA) protocol is presented. FS-AKA is quick and light since it reduces the computational load (number of exponentiations and hash functions), therefore, it is suitable for low power networks and real time applications. This protocol resist Dictionary attack, Known-key attack, Passive attack and Active attack. FS-AKA protocol provides mutual authentication and explicit key establishment and generates a unique session key for every session.FS-AKA achieves a compromise between the robustness and the rapidity.
Full Paper

IJCST/64/2/A-0599
36

Improving the Efficiency of Bigdata Using Data Mining

K.Sudhakar, M.V.Subbarao, G.Rajesh, B. Revanth

Abstract

Big data is a buzzword, or catch-phrase, used to describe a massive volume of both structured and unstructured data that is so large it is difficult to process using traditional database and software techniques. In most enterprise scenarios the volume of data is too big or it moves too fast or it exceeds current processing capacity. Despite these problems, big data has the potential to help companies improve operations and make faster, more intelligent
decisions.This paper presents a HACE theorem that characterizes the features of the Big Data revolution, and proposes a Big Data processing model, from the data mining perspective. This datadriven model involves demand-driven aggregation of information sources, mining and analysis, user interest modeling, and security and privacy considerations.
Full Paper

IJCST/64/2/A-0600
37

Comparison of Two On-demand Routing Protocols for Ad-Hoc Networks

Saswata Roy

Abstract

Mobile Ad-hoc networks (MANET) are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. In this paper, first two on-demand routing protocols- Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector Routing (AODV) are discussed in detail. In particular, they both discover routes only in the presence of data packets in the need for a route to a
destination. Both protocols are composed of the two mechanisms of Route Discovery and Route Maintenance. Although DSR and AODV share certain characteristics, there are several important differences of these two protocols.
Full Paper

IJCST/64/2/A-0601
38

A Competencies on Multimode Monitoring of Electromyographic Signals with USB interface/Human Computer Interaction

Pradeep Kumar Jaisal, Dr. R.N.Patel

Abstract

Electromyography (EMG) is a muscle examination method which tracks and interprets electrical activity that provides to muscle contractions. Surface electromyography (SEMG) is widely used as a diagnostic tool in estimation of muscle strength, calculation of muscle fatigue and ergonomics, sports physiology and rehabilitation. Obtaining and examining carefully EMG signals provide valuable information in determining and examining abnormalities in the muscle and motor system. In this research we detect abnormalities in the muscle.
Full Paper

IJCST/64/2/A-0602
39

Presence Cloud: Mobile Ubiquity Services using Scalable Server Architecture

Earnest Stephen P, B. Satyanarayana Reddy, B. Tarakeswara Rao

Abstract

Presence is defined as the service provided by cloud computing to find out the internet connectivity status of the device. Now-A-days the usage of internet was growing enormously. The invention of smart phones, tabular mobiles results in rapid growth in the usage of internet. The smart phones provide various social networking applications such as Face book Messenger, Yahoo Messenger, GTalk etc. These applications when used in the smart phones they
automatically searches for the friends list of the user through the user contacts. As the social networking contains some millions of users it requires large processing. This process requires lot of messages to be sent from one server to other server which may cause congestion in between. To avoid this type of congestions we proposed Cloud Services for mobile integration with Social Networking Applications. The presence cloud will decrease the
search cost and latency caused between the servers. The presence servers automate the process of searching the friends and notifying them whenever a new mobile user joins the network. Presence cloud manages all the servers to form a distributed architecture. We consider two factors in presence cloud. One is the total number of messages generated when a new user joined in the network and second is the time taken by the servers under the presence cloud for getting the friend’s list of new user.
Full Paper

IJCST/64/2/A-0603
40

Architecture for Mobile Pre Assess Profile for Recruitment Process for Candidate using Android Application Framework

Mukesh Kumar, Dr. Praveen Gupta, Megha Sharma

Abstract

Industry is constantly eager to hire right employees for their business. Hiring someone new for a company is now a days very challenging process. In present scenario company offer a vacancy and in response to that thousands of candidates apply for that small number of posts. In some cases after a long filtration process candidate refused the job offer due to job location their designation or some salary issues.Thus the main objective of the research work is to develop an interactive mobile application based on android framework to assess essential information of the candidate before inviting in a recruitment process. This will reduce the number of candidate for recruitment process. Since mobile network is available at large geographical area so this can be used for any candidate that belongs to outer areas. Candidates install this app and give the answer of some profile related question. If the candidate fulfills the essential requirements then only called for the recruitment process. This paper deals with
the prototype development of a pre assess profile for recruitment process system. This app used by the company for the recruitment process which will be able to save time and efforts to eliminate unwanted candidates to appear in recruitment process by travelling a long distance.
Full Paper

IJCST/64/2/A-0604
41

Statistics Excavating With Big Data and Its Major Challenges

Revathi Kanakapathy, G Harinath Babu

Abstract

Big Data concern expansive volume, intricate, developing information sets with various, self-ruling sources. With the quick advancement of systems administration, information stockpiling, and the information accumulation limit, Big Data are presently quickly extending in all science and designing spaces, including physical, natural and biomedical sciences. This paper exhibits a HACE hypothesis that portrays the elements of the Big Data unrest, and proposes a Big Data preparing model, from the information mining point of view. This information driven model includes interest driven conglomeration of data sources, mining and examination, client enthusiasm demonstrating, and security and protection contemplations. We dissect the testing issues in the information driven model furthermore in the Big Data transformation. In this paper, we propose CADS (Collaborative Adaptive Data Sharing stage), which is an “explain as-you make” base that encourages handled information annotation. A key commitment of our framework is the immediate utilization of the question workload to coordinate the annotation process, notwithstanding inspecting the substance of the archive. As it were, we are attempting to organize the annotation of archives towards producing property estimations for traits that are frequently utilized by questioning clients. The objective of CADS is to energize and bring down the expense of making pleasantly expounded reports that can be promptly helpful for ordinarily issued semi-organized questions, for example, the ones. Our key objective is to energize the annotation of the reports at creation time, while the inventor is still in the “record era” stage, despite the fact that the procedures can likewise be utilized for post era archive annotation.
Full Paper

IJCST/64/2/A-0605
42

Implementation of Decision Trees Algorithm: A Case Study of Birth Registration Data

Pushpal Desai

Abstract

The decision tree is one of the most widely used data mining method. There are several advantages of using decision tree algorithm. The decision tree algorithm implicitly selects features and less effort is required for data preparation. Furthermore, results are easy to understand as it is graphically displayed. In earlier research work, Microsoft clustering and Microsoft association rules mining algorithms were implemented on birth registration data. In this research paper, Microsoft decision tree data mining method is implemented on Birth registration data of the city of Surat.
Full Paper

IJCST/64/2/A-0606
43

Supporting Security Assurance in Customized Web Search

Gottimukkala. Sandhya, Satish Kumar. Garapati

Abstract

The measure of data on the World Wide Web is developing quickly; web indexes must have the capacity to recover data as per the client’s inclination. Ebb and flow web indexes are fabricated to serve all clients, autonomous of the unique needs of any individual client. Personalization of web pursuit is to complete recovery for every client fusing his/her advantage. Each client has a particular foundation and a particular objective when hunting down data
on the Web. Along these lines the objective of Web pursuit personalization is to tailor indexed lists to a specific client in light of that client’s advantage and inclinations. Be that as it may, successful customized pursuit requires gathering and collecting client data, which regularly raises genuine worries of security encroachment for some clients. In reality, these worries have gotten to be one of the primary obstructions for sending customized look applications, and how to do protection saving personalization is an awesome test. In this way, a parity must be struck between inquiry quality and security assurance. Thus, security insurance in PWS applications that model client inclinations as various leveled client profiles is proposed utilizing a PWS system called UPS that can adaptively sum up profiles by questions while regarding client indicated protection necessities. Alongside Personalized Search and Privacy Protection the Custom Search usefulness will likewise be given so that the clients get significant data.
Full Paper

IJCST/64/2/A-0607
44

Implementation of Time Dimension in Star Schema Design: A Case Study of Birth Registration Data

Pushpal Desai

Abstract

Time dimensions are specified in data warehouse multidimensional schema design. Normally, time dimensions are not part of source data and it has to created when multidimensional schema are designed for data warehouse project. Time dimensions are very important part of multidimensional schema designs as it allows managers to perform various analytical queries on data cubes. Time dimensions allows managers to execute analytical queries considering calendar years, semesters, quarters, months, weeks, etc… In our earlier research paper, only year was considered as dimension. In this research paper, time dimension is included in birth registration multidimensional schema design.
Full Paper

IJCST/64/2/A-0608
45

Accompanying Self-assurance Certification in Repeated Web Search

Koniki Venkatarao, G Harinath Babu

Abstract

Web Site structures are modified to enhance the client routes. Web personalization system reproduces the page joins with reference to the traversal way and profile of a specific client. Client data are gathered and dissected to get the client expectation behind the issued inquiry. Client adjustable Privacy safeguarding Search (UPS) is utilized to sum up profiles by questions with client security necessities. Ravenous segregating force calculation (GreedyDP) is utilized to augment the separating force of the client profiles. Insatiable Information Loss (GreedyIL) is utilized to minimize the data misfortune in client profiles. GreedyIL calculation accomplishes high proficiency than the GreedyDP calculation. The Personalized Web Search (PWS) plan is upgraded to control subject relationship based master assaults. The User adjustable Privacy-safeguarding Search (UPS) model is improved to oppose question session based assaults. Inquiry speculation is performed with question need values. Anonymization and point scientific categorization models are utilized to enhance the personalization process. Customized web pursuit has meant its accomplishment in enhancing the evaluation of distinctive inquiry administrations on the web. The verification uncover that client’s unwillingness to tell their own data amid hunt has turns into a noteworthy blockade for the wide develop of pws. In this we think about private wellbeing in pws applications that representation client want as progressive client profiles.
Full Paper

IJCST/64/2/A-0609
46

An Encryption Algorithm to Design Efficient Authentication Mechanisms for Mobile and Pervasive Computing

S. AbhiRam, A. Vanathi

Abstract

Keeping up the honesty of texts swap above group passage is one of the standard objectives in cryptography and the writing is affluent with text verification code (MAC) algorithms that are gotten ready for the single guideline of safeguarding text honour. Taking into account their security, MACs can be additionally completely or computationally bolted. Totally safe MACs present text reliability contiguous falsifiers with limitless computation force. Then again, computationally secure MACs are scarcely protected and sound when falsifiers have restricted computational power. With now a day’s innovation, numerous functions depend on the survival of little gadgets that can swap all together and structure correspondence systems. In a important bit of such functions, the protection and honesty of the imparted texts are of demanding concern.
Full Paper

IJCST/64/2/A-0610
47

Energy Efficient Adaptive Clustering LEACH Protocols: A Survey

Nagendra Sah, Vijay Rana

Abstract

Wireless Sensor Network (WSN) comprises a large number of homogeneous or heterogeneous nodes having capabilities of sensing, computation and to communicate wirelessly with each other. They are used for continuous monitoring of various civil and military applications. Nodes in the WSN are battery powered, so energy is the main constraint while designing a network. In this paper, we present a survey on Low Energy Adaptive Clustering Hierarchy (LEACH) protocol and its various variant. These communication protocols make use of adaptive clustering techniques which help in reducing overall energy consumption of the network. LEACH protocol utilizes the randomized rotation of cluster heads to distribute the energy load among all the nodes in the sensor networks. LEACH uses localized coordination for strengthening of network and blend data fusion into routing protocol to lower the amount of information that is to be transmitted to the base station. LEACH provides better energy efficiency than the conventional routing protocols.
Full Paper

IJCST/64/2/A-0611
48

Two Stage Approach for Improving the Security of User Authentication

R.B.Sarat, K.Surendra, Y.Swathi

Abstract

Poorly managed personal computers affected with malicious software programs causes different types of attacks like channel breaking, phishing, hijacking, keylogging. Preventing these attacks requires designing of efficient and secured authentication protocols which will be a challenging task for researchers. If we provide more security for applications it degrades the application usability for user. In this project implementation of visualization design enhances the security and usability of application. A novel two visual authentication protocol includes One-time password and another one is password based authentication protocol achieves high level usability and provides robust security.
Full Paper

IJCST/64/2/A-0612
49

A Review of Routing Protocols in MANET

Nagendra Sah, Rajat Saini

Abstract

Mobile Ad-hoc Networks (MANETs) have established a new dimension in field of wireless networks. It allows any number of nodes to communicate with each other in the absence of centralized support. It doesn’t require fixed infrastructure as the mobile nodes are highly mobile. And network topology in MANET is highly dynamic i.e. changes accordingly to the environment. These are much easier to deploy, establish and organize i.e. these are selfconfigurable. These kinds of networks are currently one of the most important and hot research areas due to the wide range of applications (such as emergency, military, rescue operations, local area networks, personal area network, hospitals, and many more). The growing interest in mobile ad hoc network has resulted in many routing protocol proposals. In this paper we will survey the different unicasting routing protocols proposed and designed for mobile ad hoc networks (MANET). Routing protocols used in MANET have to face many challenges due to dynamically changing topologies, route discovery, device discovery, bandwidth constrained, low transmission power and asymmetric links. Due to node mobility and instability and frequently changing topologies,
routing became one of the major issue in MANET.Full Paper

IJCST/64/2/A-0613
50

A Novel Dynamic Secret Key Generation Protocol and New Data User Authentication Protocol

M.Rama Krishna Raju, Sudhir Varma Sagiraju

Abstract

Cloud computing is a dissident technology thatis altering the way IT hardware and software aredesigned and purchased. As a new model ofcomputing, cloud computing provides plentiful benefitscounting easy access, decreased costs, quickdeployment and supple resource management, etc.Enterprises of all sizes can influence the cloud toadd to innovation and collaboration.In spite of the plentiful benefits of cloud computing,for time alone concerns, individuals and enterpriseusers are unenthusiastic to subcontract their sensitive data,including emails, personal health records and governmentconfidential files, to the cloud. This is sinceonce sensitive data are outsourced to a remote cloud;the parallel data owners lose direct control ofthese data. Cloud service providers (CSPs) would guarantee to ensure owners’ data place of safety using mechanisms like virtualization and firewalls. routing became one of the major issue in MANET.
Full Paper

IJCST/64/2/A-0614
51

An Efficient Framework for Extracting Significant Associations among GO_Terms in Breast Cancer Dataset Using Association Rule Mining by Apriori Algorithm

P.Prithiviraj, Dr. R. Porkodi

Abstract

This research paper focuses on data mining in Bioinformatics, particularly in which Association Rule Mining is explored. The objective of the proposed research work is to identify the significant associations present among GO_Terms in genes in the breast cancer dataset by applying apriori algorithm for two matrices. The two matrices namely binary encoded matrix and weight encoded matrix are constructed considering direct GO_Terms and indirect
GO_Terms which includes level 1 and level 2 GOs for direct GO_Terms appears in genes in the experimental dataset. Finally, the association rules identified from apriori algorithm for two matrices are compared. It is observed that, the apriori applied for weight encoded matrix identifies more number of significant rules and also hidden associations which are not identified by the apriori applied for binary encoded matrix. The research work has been implemented in Matlab tool and .NET framework.
Full Paper

IJCST/64/2/A-0615
52

A New Twin Cloud Architecture for Eliminating Repeated Data and Maintain Confidentiality

M.Satya Deepika, N.Leelavathy, B.Srinivas

Abstract

Starting late, the data organization and adaptability in distributed computing using deduplication has been a comprehended system and has pulled in more thought. Data deduplication is a specific information pressure framework to destroy copy duplicates of reiterating data away. The practice is used for advancement stockpiling utilization and can be utilized as a part of trimming down the data traded in the systems. As opposed to keeping distinctive duplicates with the same item, deduplication fixes of superfluous data by keeping one and just physical duplicate and inferring different abundance data to that duplicate. Deduplication can happens at either the document level or the square level. For document level deduplication it abstains from duplicate copies of the same record. Deduplication can like insightful happen at the square level which administers copy bits of information that happen in non-vague records.
Full Paper

IJCST/64/2/A-0616
53

Function and Pathway Analysis of Differentially Expressed Genes in Alzheimer’s Disease Dataset Using Linear Regression Model

Dr. R. Porkodi, R. Savitha

Abstract

Alzheimer’s disease is an irreversible, progressive brain disorder that slowly destroys memory and thinking skills, and eventually the ability to carry out the simplest tasks. The aim of this study is to screen the potential pathways changed in Alzheimer’s disease and elucidate the mechanism of it. Published microarray data of GSE1297 series is downloaded from Gene Expression Omnibus (GEO). Significance analysis of microarray is performed using
software R, and differentially expressed genes (DEGs) are harvested. The functions and pathways of DEGs are mapped in Gene Otology and KEGG pathway database respectively. A total of 2273 genes are filtered as DEGs between normal and Alzheimer’s disease cells. This research work is to depict the molecular level changes of Alzheimer disease through microarray analysis of differentially expressed genes (DEGs), and the function and pathway enrichment of differentially expressed genes (DEGs).
Full Paper

IJCST/64/2/A-0617
54

Comparative Study of Cloud Computing Solutions

Amit Sharma, Dr. Sohan Garg

Abstract

Cloud Computing is a powerful and flexible software environment, which delegates the material’s management and in which users pay as they go. The migration of enterprise applications on the Cloud is increasing. Most of these applications are available with a standardized access to the business logic through Internet. However, the current cloud offers is not always complying with users’ needs. For instance, some providers do not guarantee sufficient resource flexibility and high availability. Other users try to build their own Cloud based on open source technologies. In this work, we conduct a survey on current Cloud providers and technologies in order to help users (1) choosing the better cloud offer that compiles with their needs or (2) building their own Cloud infrastructure with the most suitable open source technologies.
Full Paper

IJCST/64/2/A-0618
55

A Debugging Scheme for Declarative Programming Languages

Dr. Kahkashan T. Mohammed Osman

Abstract

The declarative programming language has a deterministic control structure. It is established on the basis of proof by contradiction of first order logic. It is most frequently used AI languages. For instance the logic programming language, Prolog has established range of applications in AI. Therefore efficient interpretation of Prolog programs is an important issue. This paper aims to analyze debugging for declarative language like prolog. The paper provides a debugging scheme for declarative programming that is based on drawing SLD trees. SLD trees are a tool to create a tree in hierarchical form by using the facts and rules.
Full Paper

IJCST/64/2/A-0619
56

Frequent Itemset Generation using Enhanced Apriori Algorithm and Multiple Projection Rule Pruning Algorithm for Sessions Identified by Incremental Learning Approach for Dynamic Database Trace Logs

D.Kavitha, Dr. B.Kalpana

Abstract

Web sessions is a sequence of requests sent to the database system by a user or an application to complete certain task. Session identification is a main task in preprocessing of database trace logs used for discovering useful patterns. The performance of database systems is improved by discovered patterns through getting predicted queries and rewriting the current query or conducting effective cache replacement. To overcome the above mentioned problem a novel session identification method uses an online incremental learning approach which provides more strong
outcomes for identifying session boundaries compared to ordinary timeout methods. It is named as (DS-OILSD) because it selects threshold automatically based on the Standard Deviation then it is applied for Dynamic web log Session identification based on the Online Incremental Learning (DS-OIL) approach. Session records in the database trace logs files doesn’t mine efficiently the frequent pattern mining in online incremental learning. An Enhanced Apriori Algorithm(EAA) is proposed to perform frequent itemset generation. The goal of EAA is optimization of the initial iterations of Apriori, which are the most time consuming ones because of considering the characterization of datasets by short or medium length frequent patterns. The innovative method is used for storing candidate set of items and counting their support, and the pruning techniques significantly reduce the size of the dataset as execution progresses are two main improvements. Multiple Projection Rule Pruning Algorithm (MPRPA) is used to create rule for frequent mined itemset. This algorithm arranges the rules in ascending order of support and confidence thresholds which is found from automatic support method based on the assumption that rules with high support and confidence values will have excellent information. The experimental results shows that the EAA method
for frequent itemset generation for sessions identified from OLTP database application for characteristics analysis of web logs is effective and provides finest outcome when compared to Apriori and modified Apriori algorithm.
Full Paper

IJCST/64/2/A-0620
57

The Packet Suppressing Approaches Aimed to Avert Selective Jamming Attacks

Suresh Botcha, Ch. K. Rupesh Kumar

Abstract

Wireless Networks are turning into an inexorably critical innovation that is uniting the world. In this kind of system environment there could be more risks of attacks. The bundles can’t be effortlessly exchanged over the system. It influences system execution corrupt. While listening stealthily and message infusion can be avoided
utilizing cryptographic strategies, sticking attacks are much harder to counter. They have been appeared to complete serious Denial-of- Service (DoS) attacks against systems. In Simplest structure enemy obstructs the bundles that are transmitted over Wireless system. Ordinarily, sticking attacks has been considered under an outside risk model, in which the jammer is not some portion of the system. To conquer the above issue of system activity and execution in this paper we have considered a bundle concealing techniques that can be safely transmit parcels over the system. We are tending to the issue of sticking attacks under inside danger model and two plans
are recommended that avert ongoing bundle order of parcels by joining concealing plan in view of cryptographic primitives.
Full Paper

IJCST/64/2/A-0621
58

Some Common Fixed Point Theorems in Intuitionistic Fuzzy Metric Spaces Using the CLRg Property

Pranjali Sharma, Shailesh Dhar Diwan

Abstract

In this paper, we establish some common fixed point theorems in Intuitionistic fuzzy metric spaces using the (CLRg) property. Our results fuzzify, generalize and improve several results of metric s
Full Paper

IJCST/64/2/A-0622