Journal of Information & Knowledge Management, 2019
Outdegree Centrality (OC) is a graph-based centrality measure that captures local connectedness o... more Outdegree Centrality (OC) is a graph-based centrality measure that captures local connectedness of a node in a graph. The measure has been used in the literature to highlight key sentences in a graph-based optimisation method for summarisation. It is observed in resultant summaries that OC tends to be biased towards selecting introductory sentences of the document producing only generic summaries. The different graph centrality measures lead to different interpretations of a summary. Therefore, the authors propose to use another suitable centrality measure in order to generate more specific summary rather than a generic summary. Such a summary is expected to be highly informative covering all the subtopics of the source document. This requirement has instigated the authors to use Laplacian Centrality (LC) measure to find the significance of the nodes. The essence of this measure lies in highlighting central nodes from subgraphs which contribute non-uniformly towards the common goal ...
2009 Proceeding of International Conference on Methods and Models in Computer Science (ICM2CS), 2009
Offline fingerprints find immense application in the fields of user authentication and criminal i... more Offline fingerprints find immense application in the fields of user authentication and criminal identification. But if an insider or a criminal gets unauthorized access to the printed database of fingerprints at a criminology department, then he might tamper or tear them. This may lead to loss of evidence, which could have been useful at the time of post-detection. We feel that no work has been carried out in stitching those torn off images without loss of any fingerprint features. To advocate this need, we introduce Re-TOF (reconstructing torn offline fingerprint), a novel technique of stitching such images which are cut portions of a fingerprint and do not have any overlap. Re-TOF exploits the similar features of the ridges that get cut while tearing off a fingerprint. Experimental evaluation on FVC 2002 database using FAR and FRR verifies the proposed Re-TOF technique.
2011 International Conference on Multimedia, Signal Processing and Communication Technologies, 2011
A suspect (apriori known) for a given malafide intention has to be lured into Context honeypot us... more A suspect (apriori known) for a given malafide intention has to be lured into Context honeypot using lure messages. The message is generated in a privacy enforced environment in such a way that it can entice him/her into the Context honeypot. Earlier work advocates the formation of message with genuine and synthetic information. The choice of synthetic information should in no way destroy the opaque characteristic of the system. This paper tries to address this need. Here we (a) propose a framework to generate privacy enforced lure message and (b) conduct experiments in a particular domain with set of test users in choosing the synthetic information. The lure message having the synthetic information is used as bait to lure the test user. The response from the user helps the framework in regulating the synthetic information. The best message thus generated is taken as bait to induce the suspected user. The outcome of the result corroborates usefulness/success of the proposed framework.
2014 9th International Conference on Industrial and Information Systems (ICIIS), 2014
Static Graphs consist of a fixed sequence of nodes and edges which does not change over time, hen... more Static Graphs consist of a fixed sequence of nodes and edges which does not change over time, hence lack in providing the information regarding evolution of the network. In contrast, Dynamic Graphs to a greater extent relate to real-life events and so provide complete information about the network evolution. That is why many researchers [1, 2, 3, 5, 6, 7, 8, 9 and 10] have developed interest in mining of Dynamic Graphs. We feel, that the topic can be further sub-divided structurally into four major categories, which are mining of Labeled, Edge Unlabeled, Directed and Undirected Dynamic Graphs. However, the main focus of research till now is on the mining of Edge Unlabeled Dynamic Graphs. But the limitation is that it does not provide the complete insights of graphs where edge strengths i.e. weights are also changing with time. For example in case of Coauthor network mining in Unlabeled Dynamic Graphs gives information only about the occurrence of relation whereas that in Labeled Dynamic Graphs provides more detailed information like the number of paper published jointly at different instants of time. To address this problem, the present paper proposes a novel method to find out Weighted Regular Patterns in Edge Labeled Dynamic Graphs. The proposed method consists of creating a summary graph to find weight occurrence sequence of edges enabling to determine weighted regular patterns. The method is applied to real world dataset, PACS networks, to ensure its practical feasibility and to understand how Weighted Dynamic Graphs behave regularly over time.
2014 International Conference on Information Technology, 2014
Mining of regular patterns in dynamic networks finds immense application in characterizing the lo... more Mining of regular patterns in dynamic networks finds immense application in characterizing the local properties of the networks, like behaviour (friendship relation), event occurrence (football matches). They in then are used to predict their future trends. But if they do not entail weight and direction aspects of the dynamic network, there can be loss of several significant details, such as strength of a relationship or event, specification of the person responsible for it in a relationship, winning or losing in case of events. To the best of our knowledge, no work has been reported yet to extract regular patterns that take into account weight and direction aspects of dynamic networks. We thus propose a novel method to mine regular patterns in weighted and directed networks. In the proposed method, different snapshots of the dynamic network are taken, and through the concept of Regular Expression, we obtain repetition rule for each of: occurrence sequence, weight sequence, direction sequence and weight-direction sequence. For each of these four categories, edges having same rule are grouped to obtain evolution patterns. To ensure the practical feasibility of the approach, experimental evaluation is done on the real world dataset of Enron emails. The results obtained show that, 2.39%, 6.92%, 9.96% and 1.81% of the edges are found to be regular on weight, direction, occurrence and weight-direction respectively.
A privacy auditing framework for Hippocratic databases accepts an administrator formulated audit ... more A privacy auditing framework for Hippocratic databases accepts an administrator formulated audit expression and returns all suspicious user queries that satisfy the given constraints in that audit expression. Such an expression should be expressive, precise, unambiguous and flexible to describe various characteristics of a privacy violation such as target data (sensitive data subject to disclosure review), suspicion notion, authorized privacy policy parameters through which the violation is possible, and time duration of the privacy violation. Earlier proposed audit expression models for the auditing are not flexible and do not specify suspicion notion with in the audit expression for the auditing of past user accesses. We propose a unified model for an audit expression which can specify earlier proposed audit expressions along with different suspicion notions. The model includes (i) a suspicion notion model which unifies earlier proposed suspicion notions, and (ii) mechanisms to specify data versions.
Communications in Computer and Information Science, 2009
Abstract. Biometrics is an automated approach of measuring and analysing physical and behavioural... more Abstract. Biometrics is an automated approach of measuring and analysing physical and behavioural characteristics for identity verification. The stability of the Iris texture makes it a robust biometric tool for security and authentica-tion purposes. Reliable Segmentation of Iris is a ...
2013 Sixth International Conference on Contemporary Computing (IC3), 2013
Gesture-based interfaces are gaining attention from researchers worldwide owing to a user-friendl... more Gesture-based interfaces are gaining attention from researchers worldwide owing to a user-friendly and natural mode of interaction. The direct use of hands as an input method is an attractive way to design Human-Computer interfaces. In scenarios where hand gestures are used to perform manipulation tasks on sensitive data, there is a need to authenticate a user. In this paper, we propose a two-level framework for addressing this need by augmenting the existing gesture recognition methodologies with hand biometrics. In the first level, the hand gesture is recognized by extracting Gesture-Specific Features (GSFs) from a video consisting of a gesture password. This is followed by the second level where the user is authenticated based on User-Specific Features (USFs). These GSFs and USFs together form a Feature Vector (FV) which is unique for every user. This is fed into LIBSVM for authentication purposes. Before an unknown or a malicious user tries to modify sensitive data, his presence is detected, he is denied access and a warning is sent to the registered user. The framework is tested using hand gestures derived from American Sign Language symbols. An overall accuracy rate of 95 percentage demonstrates the potentiality of TAG in access control through a hand gesture interface.
Communications in Computer and Information Science, 2011
Smart phones nowadays, with colossally large number of users have become very prominent[1]. Furth... more Smart phones nowadays, with colossally large number of users have become very prominent[1]. Furthermore, this increasing prominence goes arm in arm with the rising number of malwares[2], thus making it inevitable to take cognizance of the need for an efficient malware detection mechanism. However, sundry former associated works like [3] & [4] for malware detection, have not cited a novel
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2010
In recent times the cost of mobile communication has dropped significantly leading to a dramatic ... more In recent times the cost of mobile communication has dropped significantly leading to a dramatic increase in mobile phone usage. The widespread usage has led mobiles to emerge as a strong alternative for other applications one of which is tracking. This has enabled law-enforcing agencies to detect overspeeding vehicles and organizations to keep track its employees. The 3 major ways of tracking being employed presently are (a) via GPS [1] (b) signal attenuation property of a packet [3] and (c) using GSM Network [2]. The initial cost of GPS is very high resulting in low usage whereas (b) needs a very high precision measuring device. The paper presents a GSM-based tracking technique which eliminates the above mentioned overheads, implements it in NS2 and shows the limitations of the real life simulation. An accuracy of 97% was achieved during NS2 simulation which is comparable to the above mentioned alternate methods of tracking.
2013 1st International Conference on Emerging Trends and Applications in Computer Science, 2013
With increase in availability of GPS enabled devices, a large amount of GPS data is being collect... more With increase in availability of GPS enabled devices, a large amount of GPS data is being collected over time. The mining of this data is likely to help in detection of the locations which face frequent traffic congestion. The prior knowledge of such locations will help the users in deciding whether or not to opt for that route. Avoidance of plying on such routes will also help in reducing the congestion in such locations. However, the authors feel that the work done so far in this field does not give very accurate results. The reason behind this is the inability of the work done so far to distinguish between jams and random short-term stoppages like traffic lights. To incorporate such differentiation in this paper, the authors propose an improvised traffic-jam-detection framework - DTC (Detect Traffic Congestion). This framework can be applied to versatile GPS data i.e. data coming from various kinds of devices like mobile phones, tablets or from vehicles etc. In the technique associated with this framework, these GPS data is first clusterized using the Expectation Maximization Algorithm. The clusters hence obtained are filtered out to acquire on-the-road vehicle data clusters. On further processing these clusters, a final binary output of either Traffic jam or Traffic light is obtained. The output is then fed to a J48 Classification Model to train it and hence make the predictions more accurate. The results obtained in the experiments are then cross-checked with the real-time data giving an accuracy of 86%.
2009 Second International Conference on the Applications of Digital Information and Web Technologies, 2009
Panoramic stitching of static and dynamic scenes is a very important and challenging research are... more Panoramic stitching of static and dynamic scenes is a very important and challenging research area. For static scenes, number of approaches has been proposed so far. The result produced by these approaches provides great similarity between resultant panorama and input images with almost zero seam visibility. However for dynamic scenes, we have found that existing approaches are unable to overcome
Communications in Computer and Information Science, 2011
Jigsaw Distributed File System (JigDFS) [3] is a secure P2P distributed file system. However, obs... more Jigsaw Distributed File System (JigDFS) [3] is a secure P2P distributed file system. However, observations during implementation conveyed that JigDFS [3] has certain limitations. It [3] deals with all the files in a preprogrammed manner (which is rather obsolete) and takes impractically high file encoding time. This paper introduces "CASE-JigDFS", an improved JigDFS [3] network that is smart enough to distinguish between file attributes so as to dynamically manipulate data encryption and IDA parameters to intelligently utilize system's resources. The optimized network is best suited for mobile network devices viz. Smart phones and PDAs. The results have been arrived at, by comparing processing time vs. file size plots for different file types for 'JigDFS'[3] and 'CASE-JigDFS' networks.
Welcome Shri Dharmender Chaprana has been appointed as Catering Assistant in the scale of Rs.3200... more Welcome Shri Dharmender Chaprana has been appointed as Catering Assistant in the scale of Rs.3200-85-4900/-w.e.f. January 19, 2006. Shri Surat Singh has been appointed as Catering Assistant in the scale of Rs. 3200-85-4900/-w.e.f. February 7, 2006. Shri Brajesh Kumar Mishra has been appointed as Catering Assistant in the scale of Rs. 3200-85-4900/-w.e.f. February 7, 2006. Shri Mantu Kumar Maji has been appointed as Catering Assistant in the scale of Rs. 3200-85-4900/-w.e.f. February 10, 2006. Shri Avilash Singh has been appointed as Assistant Caretaker in the scale of Rs. 3200-85-4900/-w.e.f. February 1, 2006. Smt. Karamcheti Bhaskara Kalyani has been appointed as Assistant Caretaker in the scale of Rs. 3200-85-4900/-w.e.f. February 2, 2006. Ms. Indermani has been appointed as Technical Assistant (Translation) in the scale of Rs. 4500-125-7000/-w.e.f. February 8, 2006. Congratulations Shri Rajesh Sekwal, Catering Assistant in Hostel Organisation has been appointed as Caretaker-cum-Manager in the pay scale of Rs.5000-150-8000/-. Shri Nanhe, Group `D' Attendant in A.R. (P.G.) Office has been appointed in Group `C' entry level post i.e. Lower Division Clerk in the scale of Rs.3200-85-4900/- .
2006 1st International Conference on Digital Information Management, 2007
... of Computer Science & Engineering, IIT Delhi, New Delhi, India. Sankalp Dubey Dept. of Co... more ... of Computer Science & Engineering, IIT Delhi, New Delhi, India. Sankalp Dubey Dept. of Computer Science & Engineering, IIT Delhi, New Delhi, India. [email protected] Vikram Goyal Dept, of Computer Science & Engineering, IIT Delhi, New Delhi, India. ...
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2012
Spammers are constantly evolving new spam technologies, the latest of which is image spam. Till n... more Spammers are constantly evolving new spam technologies, the latest of which is image spam. Till now research in spam image identification has been addressed by considering properties like colour, size, compressibility, entropy, content etc. However, we feel the methods of identification so evolved have certain limitations due to embedded obfuscation like complex backgrounds, compression artifacts and wide variety of fonts and formats .To overcome these limitations, we have proposed a 4-stage methodology which uses the information of low level features and content of the spam images. The method works on images with and without noise separately. Also colour properties of the images are altered so that OCR (Optical Character Recognition) can easily read the text embedded in the image. The proposed method is tested on a dataset of 1984 spam images and is found to be effective in identifying all types of spam images having (1) only text, (2) only images or (3) both text and images. The encouraging experimental results show that the technique achieves an accuracy of 92%.
2009 2nd International Conference on Computer, Control and Communication, 2009
AbstractUpholding the privacy of data has gathered in-creased interest in the current industrial... more AbstractUpholding the privacy of data has gathered in-creased interest in the current industrial scenario. The databases that hold personal information and the individuals' choices of privacy are often subjected to attacks from mischievous sources which try to access undisclosed ...
2009 First International Conference on Networks & Communications, 2009
Abstract With the widespread usage of mobile phones primarily due to their reduced costs, they ar... more Abstract With the widespread usage of mobile phones primarily due to their reduced costs, they are now not only being used for communication but can also assist law enforcing agencies to keep track of speeding vehicles or can be used by organizations to keep track ...
2008 First International Conference on Emerging Trends in Engineering and Technology, 2008
Page 1. A Pattern Matching Classifier for Offline Signature Verification Abhay Bansal Divye Garg ... more Page 1. A Pattern Matching Classifier for Offline Signature Verification Abhay Bansal Divye Garg Anand Gupta Student, Department of Computer Engineering, NSIT, Delhi, India [email protected] Student, Department ...
Journal of Information & Knowledge Management, 2019
Outdegree Centrality (OC) is a graph-based centrality measure that captures local connectedness o... more Outdegree Centrality (OC) is a graph-based centrality measure that captures local connectedness of a node in a graph. The measure has been used in the literature to highlight key sentences in a graph-based optimisation method for summarisation. It is observed in resultant summaries that OC tends to be biased towards selecting introductory sentences of the document producing only generic summaries. The different graph centrality measures lead to different interpretations of a summary. Therefore, the authors propose to use another suitable centrality measure in order to generate more specific summary rather than a generic summary. Such a summary is expected to be highly informative covering all the subtopics of the source document. This requirement has instigated the authors to use Laplacian Centrality (LC) measure to find the significance of the nodes. The essence of this measure lies in highlighting central nodes from subgraphs which contribute non-uniformly towards the common goal ...
2009 Proceeding of International Conference on Methods and Models in Computer Science (ICM2CS), 2009
Offline fingerprints find immense application in the fields of user authentication and criminal i... more Offline fingerprints find immense application in the fields of user authentication and criminal identification. But if an insider or a criminal gets unauthorized access to the printed database of fingerprints at a criminology department, then he might tamper or tear them. This may lead to loss of evidence, which could have been useful at the time of post-detection. We feel that no work has been carried out in stitching those torn off images without loss of any fingerprint features. To advocate this need, we introduce Re-TOF (reconstructing torn offline fingerprint), a novel technique of stitching such images which are cut portions of a fingerprint and do not have any overlap. Re-TOF exploits the similar features of the ridges that get cut while tearing off a fingerprint. Experimental evaluation on FVC 2002 database using FAR and FRR verifies the proposed Re-TOF technique.
2011 International Conference on Multimedia, Signal Processing and Communication Technologies, 2011
A suspect (apriori known) for a given malafide intention has to be lured into Context honeypot us... more A suspect (apriori known) for a given malafide intention has to be lured into Context honeypot using lure messages. The message is generated in a privacy enforced environment in such a way that it can entice him/her into the Context honeypot. Earlier work advocates the formation of message with genuine and synthetic information. The choice of synthetic information should in no way destroy the opaque characteristic of the system. This paper tries to address this need. Here we (a) propose a framework to generate privacy enforced lure message and (b) conduct experiments in a particular domain with set of test users in choosing the synthetic information. The lure message having the synthetic information is used as bait to lure the test user. The response from the user helps the framework in regulating the synthetic information. The best message thus generated is taken as bait to induce the suspected user. The outcome of the result corroborates usefulness/success of the proposed framework.
2014 9th International Conference on Industrial and Information Systems (ICIIS), 2014
Static Graphs consist of a fixed sequence of nodes and edges which does not change over time, hen... more Static Graphs consist of a fixed sequence of nodes and edges which does not change over time, hence lack in providing the information regarding evolution of the network. In contrast, Dynamic Graphs to a greater extent relate to real-life events and so provide complete information about the network evolution. That is why many researchers [1, 2, 3, 5, 6, 7, 8, 9 and 10] have developed interest in mining of Dynamic Graphs. We feel, that the topic can be further sub-divided structurally into four major categories, which are mining of Labeled, Edge Unlabeled, Directed and Undirected Dynamic Graphs. However, the main focus of research till now is on the mining of Edge Unlabeled Dynamic Graphs. But the limitation is that it does not provide the complete insights of graphs where edge strengths i.e. weights are also changing with time. For example in case of Coauthor network mining in Unlabeled Dynamic Graphs gives information only about the occurrence of relation whereas that in Labeled Dynamic Graphs provides more detailed information like the number of paper published jointly at different instants of time. To address this problem, the present paper proposes a novel method to find out Weighted Regular Patterns in Edge Labeled Dynamic Graphs. The proposed method consists of creating a summary graph to find weight occurrence sequence of edges enabling to determine weighted regular patterns. The method is applied to real world dataset, PACS networks, to ensure its practical feasibility and to understand how Weighted Dynamic Graphs behave regularly over time.
2014 International Conference on Information Technology, 2014
Mining of regular patterns in dynamic networks finds immense application in characterizing the lo... more Mining of regular patterns in dynamic networks finds immense application in characterizing the local properties of the networks, like behaviour (friendship relation), event occurrence (football matches). They in then are used to predict their future trends. But if they do not entail weight and direction aspects of the dynamic network, there can be loss of several significant details, such as strength of a relationship or event, specification of the person responsible for it in a relationship, winning or losing in case of events. To the best of our knowledge, no work has been reported yet to extract regular patterns that take into account weight and direction aspects of dynamic networks. We thus propose a novel method to mine regular patterns in weighted and directed networks. In the proposed method, different snapshots of the dynamic network are taken, and through the concept of Regular Expression, we obtain repetition rule for each of: occurrence sequence, weight sequence, direction sequence and weight-direction sequence. For each of these four categories, edges having same rule are grouped to obtain evolution patterns. To ensure the practical feasibility of the approach, experimental evaluation is done on the real world dataset of Enron emails. The results obtained show that, 2.39%, 6.92%, 9.96% and 1.81% of the edges are found to be regular on weight, direction, occurrence and weight-direction respectively.
A privacy auditing framework for Hippocratic databases accepts an administrator formulated audit ... more A privacy auditing framework for Hippocratic databases accepts an administrator formulated audit expression and returns all suspicious user queries that satisfy the given constraints in that audit expression. Such an expression should be expressive, precise, unambiguous and flexible to describe various characteristics of a privacy violation such as target data (sensitive data subject to disclosure review), suspicion notion, authorized privacy policy parameters through which the violation is possible, and time duration of the privacy violation. Earlier proposed audit expression models for the auditing are not flexible and do not specify suspicion notion with in the audit expression for the auditing of past user accesses. We propose a unified model for an audit expression which can specify earlier proposed audit expressions along with different suspicion notions. The model includes (i) a suspicion notion model which unifies earlier proposed suspicion notions, and (ii) mechanisms to specify data versions.
Communications in Computer and Information Science, 2009
Abstract. Biometrics is an automated approach of measuring and analysing physical and behavioural... more Abstract. Biometrics is an automated approach of measuring and analysing physical and behavioural characteristics for identity verification. The stability of the Iris texture makes it a robust biometric tool for security and authentica-tion purposes. Reliable Segmentation of Iris is a ...
2013 Sixth International Conference on Contemporary Computing (IC3), 2013
Gesture-based interfaces are gaining attention from researchers worldwide owing to a user-friendl... more Gesture-based interfaces are gaining attention from researchers worldwide owing to a user-friendly and natural mode of interaction. The direct use of hands as an input method is an attractive way to design Human-Computer interfaces. In scenarios where hand gestures are used to perform manipulation tasks on sensitive data, there is a need to authenticate a user. In this paper, we propose a two-level framework for addressing this need by augmenting the existing gesture recognition methodologies with hand biometrics. In the first level, the hand gesture is recognized by extracting Gesture-Specific Features (GSFs) from a video consisting of a gesture password. This is followed by the second level where the user is authenticated based on User-Specific Features (USFs). These GSFs and USFs together form a Feature Vector (FV) which is unique for every user. This is fed into LIBSVM for authentication purposes. Before an unknown or a malicious user tries to modify sensitive data, his presence is detected, he is denied access and a warning is sent to the registered user. The framework is tested using hand gestures derived from American Sign Language symbols. An overall accuracy rate of 95 percentage demonstrates the potentiality of TAG in access control through a hand gesture interface.
Communications in Computer and Information Science, 2011
Smart phones nowadays, with colossally large number of users have become very prominent[1]. Furth... more Smart phones nowadays, with colossally large number of users have become very prominent[1]. Furthermore, this increasing prominence goes arm in arm with the rising number of malwares[2], thus making it inevitable to take cognizance of the need for an efficient malware detection mechanism. However, sundry former associated works like [3] & [4] for malware detection, have not cited a novel
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2010
In recent times the cost of mobile communication has dropped significantly leading to a dramatic ... more In recent times the cost of mobile communication has dropped significantly leading to a dramatic increase in mobile phone usage. The widespread usage has led mobiles to emerge as a strong alternative for other applications one of which is tracking. This has enabled law-enforcing agencies to detect overspeeding vehicles and organizations to keep track its employees. The 3 major ways of tracking being employed presently are (a) via GPS [1] (b) signal attenuation property of a packet [3] and (c) using GSM Network [2]. The initial cost of GPS is very high resulting in low usage whereas (b) needs a very high precision measuring device. The paper presents a GSM-based tracking technique which eliminates the above mentioned overheads, implements it in NS2 and shows the limitations of the real life simulation. An accuracy of 97% was achieved during NS2 simulation which is comparable to the above mentioned alternate methods of tracking.
2013 1st International Conference on Emerging Trends and Applications in Computer Science, 2013
With increase in availability of GPS enabled devices, a large amount of GPS data is being collect... more With increase in availability of GPS enabled devices, a large amount of GPS data is being collected over time. The mining of this data is likely to help in detection of the locations which face frequent traffic congestion. The prior knowledge of such locations will help the users in deciding whether or not to opt for that route. Avoidance of plying on such routes will also help in reducing the congestion in such locations. However, the authors feel that the work done so far in this field does not give very accurate results. The reason behind this is the inability of the work done so far to distinguish between jams and random short-term stoppages like traffic lights. To incorporate such differentiation in this paper, the authors propose an improvised traffic-jam-detection framework - DTC (Detect Traffic Congestion). This framework can be applied to versatile GPS data i.e. data coming from various kinds of devices like mobile phones, tablets or from vehicles etc. In the technique associated with this framework, these GPS data is first clusterized using the Expectation Maximization Algorithm. The clusters hence obtained are filtered out to acquire on-the-road vehicle data clusters. On further processing these clusters, a final binary output of either Traffic jam or Traffic light is obtained. The output is then fed to a J48 Classification Model to train it and hence make the predictions more accurate. The results obtained in the experiments are then cross-checked with the real-time data giving an accuracy of 86%.
2009 Second International Conference on the Applications of Digital Information and Web Technologies, 2009
Panoramic stitching of static and dynamic scenes is a very important and challenging research are... more Panoramic stitching of static and dynamic scenes is a very important and challenging research area. For static scenes, number of approaches has been proposed so far. The result produced by these approaches provides great similarity between resultant panorama and input images with almost zero seam visibility. However for dynamic scenes, we have found that existing approaches are unable to overcome
Communications in Computer and Information Science, 2011
Jigsaw Distributed File System (JigDFS) [3] is a secure P2P distributed file system. However, obs... more Jigsaw Distributed File System (JigDFS) [3] is a secure P2P distributed file system. However, observations during implementation conveyed that JigDFS [3] has certain limitations. It [3] deals with all the files in a preprogrammed manner (which is rather obsolete) and takes impractically high file encoding time. This paper introduces "CASE-JigDFS", an improved JigDFS [3] network that is smart enough to distinguish between file attributes so as to dynamically manipulate data encryption and IDA parameters to intelligently utilize system's resources. The optimized network is best suited for mobile network devices viz. Smart phones and PDAs. The results have been arrived at, by comparing processing time vs. file size plots for different file types for 'JigDFS'[3] and 'CASE-JigDFS' networks.
Welcome Shri Dharmender Chaprana has been appointed as Catering Assistant in the scale of Rs.3200... more Welcome Shri Dharmender Chaprana has been appointed as Catering Assistant in the scale of Rs.3200-85-4900/-w.e.f. January 19, 2006. Shri Surat Singh has been appointed as Catering Assistant in the scale of Rs. 3200-85-4900/-w.e.f. February 7, 2006. Shri Brajesh Kumar Mishra has been appointed as Catering Assistant in the scale of Rs. 3200-85-4900/-w.e.f. February 7, 2006. Shri Mantu Kumar Maji has been appointed as Catering Assistant in the scale of Rs. 3200-85-4900/-w.e.f. February 10, 2006. Shri Avilash Singh has been appointed as Assistant Caretaker in the scale of Rs. 3200-85-4900/-w.e.f. February 1, 2006. Smt. Karamcheti Bhaskara Kalyani has been appointed as Assistant Caretaker in the scale of Rs. 3200-85-4900/-w.e.f. February 2, 2006. Ms. Indermani has been appointed as Technical Assistant (Translation) in the scale of Rs. 4500-125-7000/-w.e.f. February 8, 2006. Congratulations Shri Rajesh Sekwal, Catering Assistant in Hostel Organisation has been appointed as Caretaker-cum-Manager in the pay scale of Rs.5000-150-8000/-. Shri Nanhe, Group `D' Attendant in A.R. (P.G.) Office has been appointed in Group `C' entry level post i.e. Lower Division Clerk in the scale of Rs.3200-85-4900/- .
2006 1st International Conference on Digital Information Management, 2007
... of Computer Science & Engineering, IIT Delhi, New Delhi, India. Sankalp Dubey Dept. of Co... more ... of Computer Science & Engineering, IIT Delhi, New Delhi, India. Sankalp Dubey Dept. of Computer Science & Engineering, IIT Delhi, New Delhi, India. [email protected] Vikram Goyal Dept, of Computer Science & Engineering, IIT Delhi, New Delhi, India. ...
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2012
Spammers are constantly evolving new spam technologies, the latest of which is image spam. Till n... more Spammers are constantly evolving new spam technologies, the latest of which is image spam. Till now research in spam image identification has been addressed by considering properties like colour, size, compressibility, entropy, content etc. However, we feel the methods of identification so evolved have certain limitations due to embedded obfuscation like complex backgrounds, compression artifacts and wide variety of fonts and formats .To overcome these limitations, we have proposed a 4-stage methodology which uses the information of low level features and content of the spam images. The method works on images with and without noise separately. Also colour properties of the images are altered so that OCR (Optical Character Recognition) can easily read the text embedded in the image. The proposed method is tested on a dataset of 1984 spam images and is found to be effective in identifying all types of spam images having (1) only text, (2) only images or (3) both text and images. The encouraging experimental results show that the technique achieves an accuracy of 92%.
2009 2nd International Conference on Computer, Control and Communication, 2009
AbstractUpholding the privacy of data has gathered in-creased interest in the current industrial... more AbstractUpholding the privacy of data has gathered in-creased interest in the current industrial scenario. The databases that hold personal information and the individuals' choices of privacy are often subjected to attacks from mischievous sources which try to access undisclosed ...
2009 First International Conference on Networks & Communications, 2009
Abstract With the widespread usage of mobile phones primarily due to their reduced costs, they ar... more Abstract With the widespread usage of mobile phones primarily due to their reduced costs, they are now not only being used for communication but can also assist law enforcing agencies to keep track of speeding vehicles or can be used by organizations to keep track ...
2008 First International Conference on Emerging Trends in Engineering and Technology, 2008
Page 1. A Pattern Matching Classifier for Offline Signature Verification Abhay Bansal Divye Garg ... more Page 1. A Pattern Matching Classifier for Offline Signature Verification Abhay Bansal Divye Garg Anand Gupta Student, Department of Computer Engineering, NSIT, Delhi, India [email protected] Student, Department ...
Uploads
Papers by Anand Gupta