Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 4 )

2018 ( 4 )

2017 ( 12 )

2016 ( 6 )

Custom range...

Search Results: 1 - 10 of 2549 matches for " Deepak Garg "
All listed articles are free for downloading (OA Articles)
Page 1 /2549
Display every page Item
Guest Editorial
Deepak Garg
Journal of Advances in Information Technology , 2011, DOI: 10.4304/jait.2.3.133
Abstract: Due to increasing complexity and heterogeneity of applications the importance of efficient algorithms is increasing day by day. The size of the input is increasing. More and more machines are now supporting parallel and distributed computations which also forms the need for more sophisticated algorithms. This special issue on Advanced Algorithms tries to handle few issues out of this domain. In the first paper author has proposed a differential geometry approach to detect changes from remotely sensed images. It can detect the change using the geometric property of the pixels with respect to its surroundings. It can compute and filter the changed pixels having high curvature from that of flat (2D) changed pixels. Author of the second author has proposed Voting algorithm with Soft Dynamic Threshold for safety critical systems. In the third paper author improves upon the decryption/signature generation time for cryptosystem applications. Fourth paper is related to recommender systems and the author has proposed an improved algorithm which helps to get more effective and quality recommendations for the active users Fifth paper gives new distributed scheduling algorithm for independent tasks to be assigned optimally amongst available machines. The approach works in two phases. In first phase, it assigns a task according to the Min-min heuristic and in second phase, it improves the scheduling by using efficient refinery scheduling heuristic. Sixth paper proposes a solution for the first open problem using the property of forward-security. It gives a forward-secure proxy re-signature scheme which is based on the hardness of factoring translates one person’s signature to another person’s signature and additionally facilitates the signers as well as the proxy to guarantee the security of messages signed in the past even if their secret key is exposed today. Last paper recommends that the RL model has a generic decision-making structure that is well suited to explaining human behavior in dynamic tasks. The RL model is used to model human behavior in a popular dynamic control task called Dynamic Stock and Flows (DSF) that was used in a recent Model Comparison Challenge (MCC). The RL model’s performance is compared to a winner model that won the MCC, that also uses the RL mechanism, and that is the best known model to explain human behaviour in the DSF task. As Guest Editor, I will like to thank all the contributors for submitting their work in this special issue.
Generation of a pool of variable size symmetric keys through Image
Prerna Garg,Deepak Garg
International Journal on Computer Science and Engineering , 2011,
Abstract: This paper introduces a new concept of the generation of a unending pool of keys through an image leaving behind the idea of sending keys every time for encryption and decryption. This can help in avoiding the problem of frequent key exchanges and the after affects associated with it. In this a single image is used to generate the various keys. Thus say ,if the image is of 2n bytes, taking n from 0 to any valid integer value gives a big pool of keys making it useful for any symmetric encryption technique,DES, AES, RC4, CAST, twofish, blowfish etc. This adds the advantage of one time usage of key andavoids the disadvantage of securing and sending it on the network.
Semantic Web Mining of Un-structured Data: Challenges and Opportunities
Manoj Manuja & Deepak Garg
International Journal of Engineering , 2011,
Abstract: The management of unstructured data is acknowledged as one of the most critical unsolvedproblems in data management and business intelligence fields in current times. The major reasonfor this unresolved problem is primarily because of the actuality that the methods, systems andrelated tools that have established themselves so successfully converting structured informationinto business intelligence, simply are ineffective when we try to implement the same onunstructured information. New methods and approaches are very much necessary. It is a knownrealism that huge amount of information is shared by the organizations across the world over theweb. It is, however, significant to observe that this information explosion across the globe hasresulted in opening a lot of new avenues to create tools for data management and businessintelligence primarily focusing on unstructured data. In this paper, we explore the challengesbeing faced by information system developers during mining of unstructured data in the context ofsemantic web and web mining. Opportunities in the wake of these challenges are discussedtowards the end of the paper.
Comparative Analysis of Various Approaches Used in Frequent Pattern Mining
Deepak Garg,Hemant Sharma
International Journal of Advanced Computer Sciences and Applications , 2011,
Abstract: Frequent pattern mining has become an important data mining task and has been a focused theme in data mining research. Frequent patterns are patterns that appear in a data set frequently. Frequent pattern mining searches for recurring relationship in a given data set. Various techniques have been proposed to improve the performance of frequent pattern mining algorithms. This paper presents review of different frequent mining techniques including apriori based algorithms, partition based algorithms, DFS and hybrid algorithms, pattern based algorithms, SQL based algorithms and Incremental apriori based algorithms. A brief description of each technique has been provided. In the last, different frequent pattern mining techniques are compared based on various parameters of importance. Experimental results show that FP- Tree based approach achieves better performance.
An Evaluation of K-Center Problem Solving Techniques, towards Optimality
Rattan Rana,Deepak Garg
International Journal of Advancements in Technology , 2011,
Abstract: Optimization of facility location problem is one of the prominent areas of research since last few decades. The vertex k-center problem represents a common occurring problem with in public and private sectors. Consistent efforts are going towards optimal solution of this NP-hard nature problem. The aim of this paper is to highlight the different aspects of algorithmic approach made in this area, so far. Relevant suggestions and modifications are also incorporated in this paper.
Survey of Finding Frequent Patterns in Graph Mining: Algorithms and Techniques
Vijender Singh,Deepak Garg
International Journal of Soft Computing & Engineering , 2011,
Abstract: Graphs become increasingly important in modeling complicated structures, such as circuits, images, chemical compounds, protein structures, biological networks, social networks, the web, workflows, and XML documents. Many graph search algorithms have been developed in chemical informatics, computer vision, video indexing and text retrieval with the increasing demand on the analysis of large amounts of structured data; graph mining has become an active and important theme in data mining.
String Matching Algorithms and their Applicability in various Applications
Nimisha Singla,Deepak Garg
International Journal of Soft Computing & Engineering , 2012,
Abstract: In this paper the applicability of the various strings matching algorithms are being described. Which algorithm is best in which application and why. This describes the optimal algorithm for various activities that include string matching as an important aspect of functionality. In all applications test string and pattern class needs to be matched always.
Gene Finding Using Hidden Markov Model
Srabanti Maji,Deepak Garg
Journal of Applied Sciences , 2012,
Abstract: The objective of this study is to perform mini review on Hidden Markov Models (HMMs) which is recently important and popular among bioinformatics researchers and large no of software tools are based on this technique. The mathematical foundations of HMMs shall be considered first in brief manner and then the gene identification application. In the case of gene identification process, HMM basically resolve three basic problems: First is the evaluation problem, in this it computes the probability that a particular HMM will generates a given sequence of observations. Second is Decoding problem, in which it will uncover the most likely hidden state and Third is Learning problem, it is used to adjust the model parameter and train the HMM to find an optimal model. Evaluation problem can be solved by using Forward and Backward algorithm, Decoding problems are solved by using Viterbi algorithm and posterior decoding algorithm and then Learning problems are solved through Viterbi training algorithm and Baum-Welch algorithm. Finally, some limitations of the current approaches and future directions are also reported.
Improvement in RSA Cryptosystem
Seema Verma,Deepak Garg
Journal of Advances in Information Technology , 2011, DOI: 10.4304/jait.2.3.146-151
Abstract: Boneh and Shacham gave a nice survey on four variants (Batch RSA, MultiPrime RSA, MultiPower RSA, Rebalanced RSA). Rebalanced RSA and MultiPower RSA were then combined to increase the decryption/signature generation performance. This combination theoretically improves the decryption/signature generation time about 14 times than RSA with CRT and about 56 times than the standard RSA with key size 2048bits. On the encryption side, it increased the encryption time, thus making encryption/signature verification very costly. Here in this paper we further tried to increase the encryption/signature verification performance. The proposed scheme is semantically secure also.
Complexity Analysis in Heterogeneous System
Kuldeep Sharma,Deepak Garg
Computer and Information Science , 2009, DOI: 10.5539/cis.v2n1p48
Abstract: Complexity analysis in heterogeneous system is one of the more complicated topics in the subject mathematics for computing. It involves an unusual concept and some tricky algebra. This paper shows how various algorithms take part in heterogeneous system and how they affect the overall system complexity? All analysis and methods are situation specific. Here we show a comparative study of various method and techniques of algorithm analysis giving their specific advantages and disadvantages. We will specify general guidelines for calculating the complexity of heterogeneous system which still gives sleepless nights to the researchers.
Page 1 /2549
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.