this paper a generic prototype for storing and querying XML data in any RDBMS using model mapping methods is proposed. In this prototype the latest researched model mapping method SUCXENT and free of cost available technologies MySQL, PhpMyAdmin and PHP classes are used as the examples. Otherwise being a generics solution any model mapping strategy to translate XML document into relational schema, any RDBMS as backend and any programming language for processing and front end can be used. As the proposed prototype is using SUCXENT so it will be proved to be an efficient solution with respect to Query processing specially recursive XML queries and updating. Instead of XPath, XQuery query processor is used for the querying of XML data as it is going to be standard XML query language
{"title":"A generic prototype for storing and querying XML documents in RDBMS using model mapping methods","authors":"Saeed Hassan Hisbani","doi":"10.1109/ICIT.2006.8","DOIUrl":"https://doi.org/10.1109/ICIT.2006.8","url":null,"abstract":"this paper a generic prototype for storing and querying XML data in any RDBMS using model mapping methods is proposed. In this prototype the latest researched model mapping method SUCXENT and free of cost available technologies MySQL, PhpMyAdmin and PHP classes are used as the examples. Otherwise being a generics solution any model mapping strategy to translate XML document into relational schema, any RDBMS as backend and any programming language for processing and front end can be used. As the proposed prototype is using SUCXENT so it will be proved to be an efficient solution with respect to Query processing specially recursive XML queries and updating. Instead of XPath, XQuery query processor is used for the querying of XML data as it is going to be standard XML query language","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126757014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper addresses the problem of searching and retrieval in an image database by considering a layered approach - a "physical" layer which handles physical attributes of image files and a "features" layer which handles color based features of images. Color information is represented both by local and global histogram approaches in the HSV color space and comparison is done using "color moments" of global HSV histograms and Euclidean distances between cellular color values.
{"title":"Towards an Architecture of an Image Database","authors":"R. Parekh","doi":"10.1109/ICIT.2006.85","DOIUrl":"https://doi.org/10.1109/ICIT.2006.85","url":null,"abstract":"This paper addresses the problem of searching and retrieval in an image database by considering a layered approach - a \"physical\" layer which handles physical attributes of image files and a \"features\" layer which handles color based features of images. Color information is represented both by local and global histogram approaches in the HSV color space and comparison is done using \"color moments\" of global HSV histograms and Euclidean distances between cellular color values.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124330775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. Bhowmik, S. K. Parui, U. Bhattacharya, Bikash Shaw
A novel hidden Markov model (HMM) for recognition of handwritten Oriya numerals is proposed. The novelty lies in the fact that the HMM states are not determined a priori, but are determined automatically based on a database of handwritten numeral images. A handwritten numeral is assumed to be a string of several shape primitives. These are in fact the states of the proposed HMM and are found using certain mixture distributions. One HMM is constructed for each numeral. To classify an unknown numeral image, its class conditional probability for each HMM is computed. The classification scheme has been tested on a large handwritten Oriya numeral database developed recently. The classification accuracy is 95.89% and 90.50% for training and test sets respectively.
{"title":"An HMM Based Recognition Scheme for Handwritten Oriya Numerals","authors":"T. Bhowmik, S. K. Parui, U. Bhattacharya, Bikash Shaw","doi":"10.1109/ICIT.2006.29","DOIUrl":"https://doi.org/10.1109/ICIT.2006.29","url":null,"abstract":"A novel hidden Markov model (HMM) for recognition of handwritten Oriya numerals is proposed. The novelty lies in the fact that the HMM states are not determined a priori, but are determined automatically based on a database of handwritten numeral images. A handwritten numeral is assumed to be a string of several shape primitives. These are in fact the states of the proposed HMM and are found using certain mixture distributions. One HMM is constructed for each numeral. To classify an unknown numeral image, its class conditional probability for each HMM is computed. The classification scheme has been tested on a large handwritten Oriya numeral database developed recently. The classification accuracy is 95.89% and 90.50% for training and test sets respectively.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125007274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper has considered the problem of distributed diagnosis in dynamic fault environments for not-completely connected network. An algorithm has been designed and its formal analysis has been presented The algorithm is simulated and results are compared with the algorithm FHB proposed in paper [3]. The result validates for better average diagnostic latency under more realistic crash and value fault model which is suitable for general purpose and real time distributed systems.
{"title":"Design and Evaluation of a Distributed Diagnosis Algorithm in Dynamic Fault Environments For Not-Completely Connected Network","authors":"P. M. Khilar, S. Mahapatra","doi":"10.1109/ICIT.2006.42","DOIUrl":"https://doi.org/10.1109/ICIT.2006.42","url":null,"abstract":"This paper has considered the problem of distributed diagnosis in dynamic fault environments for not-completely connected network. An algorithm has been designed and its formal analysis has been presented The algorithm is simulated and results are compared with the algorithm FHB proposed in paper [3]. The result validates for better average diagnostic latency under more realistic crash and value fault model which is suitable for general purpose and real time distributed systems.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133732887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Human face detection plays an important role in real life application such as Face recognition, Human computer interface, Video surveillance and Face image database management. Automatic Face detection in such scenario is a challenging task. Here we propose to use skin color cue to detect face in a video sequence by modeling the skin color by an one class classifier named SVDD (Support Vector Data Descriptor). We apply the one class classifier for facial skin model on Various color transformations (YCrCb, HSV, Normalized RGB). We also examine SVDD on all the three Y, Cb and Cr and their combinations for the skin model as it is known that the non linear combination of the three gives better skin model and experiments on large set of data sets proves the robustness of the method.
{"title":"Face Detection by using Skin Color Model based on One Class Classifier","authors":"R. Hota, V. Venkoparao, S. Bedros","doi":"10.1109/ICIT.2006.54","DOIUrl":"https://doi.org/10.1109/ICIT.2006.54","url":null,"abstract":"Human face detection plays an important role in real life application such as Face recognition, Human computer interface, Video surveillance and Face image database management. Automatic Face detection in such scenario is a challenging task. Here we propose to use skin color cue to detect face in a video sequence by modeling the skin color by an one class classifier named SVDD (Support Vector Data Descriptor). We apply the one class classifier for facial skin model on Various color transformations (YCrCb, HSV, Normalized RGB). We also examine SVDD on all the three Y, Cb and Cr and their combinations for the skin model as it is known that the non linear combination of the three gives better skin model and experiments on large set of data sets proves the robustness of the method.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"508 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132235624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ants, bees and other social insects deposit pheromone (a type of chemical) in order to communicate between the members of their community. Pheromone that causes clumping or clustering behavior in a species and brings individuals into a closer proximity is called aggregation pheromone. This paper presents a new algorithm (called APC) for clustering data set based on this property of aggregation pheromone found in ants. At each location of data point an ant is placed, and the ants are allowed to move in the search space to find points with higher pheromone density. The movement of an ant is governed by the amount of pheromone deposited at different points of the search space. If the pheromone density is more at a point, more ants are attracted towards this point. This leads to the formation of homogenous groups of data. The proposed algorithm is evaluated on a number of well-known benchmark data sets using different cluster validity measures. Results are compared with those obtained using average linkage clustering algorithm and are found to be better and robust.
{"title":"Aggregation Pheromone Density Based Clustering","authors":"Megha Kothari, Susmita K. Ghosh, Ashish Ghosh","doi":"10.1109/ICIT.2006.25","DOIUrl":"https://doi.org/10.1109/ICIT.2006.25","url":null,"abstract":"Ants, bees and other social insects deposit pheromone (a type of chemical) in order to communicate between the members of their community. Pheromone that causes clumping or clustering behavior in a species and brings individuals into a closer proximity is called aggregation pheromone. This paper presents a new algorithm (called APC) for clustering data set based on this property of aggregation pheromone found in ants. At each location of data point an ant is placed, and the ants are allowed to move in the search space to find points with higher pheromone density. The movement of an ant is governed by the amount of pheromone deposited at different points of the search space. If the pheromone density is more at a point, more ants are attracted towards this point. This leads to the formation of homogenous groups of data. The proposed algorithm is evaluated on a number of well-known benchmark data sets using different cluster validity measures. Results are compared with those obtained using average linkage clustering algorithm and are found to be better and robust.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133793988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new technique to classify palm prints is proposed in this paper. A rectangular region of interest (ROI) containing only the heart line is extracted from palm print images obtained from a peg-free scanner. The ROI extraction is robust using boundary tracing and rotations based on our study of palm geometry. Preprocessing operations such as intensity normalization and smoothing are applied. Sobel gradient thresholds are applied to extract the heart line from the ROI. The palm print images are classified based on the regions that the heart line traverses in the palm horizontally. Our scheme allows for a total number of 257 possible categories. Testing of the scheme on two databases shows that a classification accuracy of more than 98% is obtained. It is expected that this very efficient method shall be useful in the classification and matching of very large sized palm print databases.
{"title":"A Palmprint Classification Scheme using Heart Line Feature Extraction","authors":"A. Negi, B. Panigrahi, M. Prasad, M. Das","doi":"10.1109/ICIT.2006.17","DOIUrl":"https://doi.org/10.1109/ICIT.2006.17","url":null,"abstract":"A new technique to classify palm prints is proposed in this paper. A rectangular region of interest (ROI) containing only the heart line is extracted from palm print images obtained from a peg-free scanner. The ROI extraction is robust using boundary tracing and rotations based on our study of palm geometry. Preprocessing operations such as intensity normalization and smoothing are applied. Sobel gradient thresholds are applied to extract the heart line from the ROI. The palm print images are classified based on the regions that the heart line traverses in the palm horizontally. Our scheme allows for a total number of 257 possible categories. Testing of the scheme on two databases shows that a classification accuracy of more than 98% is obtained. It is expected that this very efficient method shall be useful in the classification and matching of very large sized palm print databases.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116593390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose an unsupervised change- detection technique based on self-organizing feature map neural network that discriminates the "difference image" by constructing two clusters. In the proposed network, the number of input neurons is equal to the dimension of the input pattern while the number of output neurons is two. To confirm the effectiveness of the proposed technique a comparative study is made with another existing context- sensitive technique.
{"title":"Unsupervised Change Detection in Remote-Sensing Images using One-dimensional Self-Organizing Feature Map Neural Network","authors":"Swarnajyoti Patra, Susmita K. Ghosh, Ashish Ghosh","doi":"10.1109/ICIT.2006.87","DOIUrl":"https://doi.org/10.1109/ICIT.2006.87","url":null,"abstract":"In this paper, we propose an unsupervised change- detection technique based on self-organizing feature map neural network that discriminates the \"difference image\" by constructing two clusters. In the proposed network, the number of input neurons is equal to the dimension of the input pattern while the number of output neurons is two. To confirm the effectiveness of the proposed technique a comparative study is made with another existing context- sensitive technique.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122182774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Delegation is an indirect authorization technique used in grids. Existing grid delegation mechanisms rely on authentication. We propose an indirect authorization approach for grids using role delegation. This method suggests four different interconnection topologies for the grid access control components for inter-domain as well as intra-domain role delegation.
{"title":"Indirect Authorization Topologies for Grid Access Control","authors":"G. Geethakumari, A. Negi, V. N. Sastry","doi":"10.1109/ICIT.2006.60","DOIUrl":"https://doi.org/10.1109/ICIT.2006.60","url":null,"abstract":"Delegation is an indirect authorization technique used in grids. Existing grid delegation mechanisms rely on authentication. We propose an indirect authorization approach for grids using role delegation. This method suggests four different interconnection topologies for the grid access control components for inter-domain as well as intra-domain role delegation.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130462044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The technique considers a message as binary string on which a cascaded recursive carry addition and key rotation (CRCAKR) is applied. This technique uses binary addition method. It is a kind of block cipher and symmetric in nature hence, decoding is done following the same procedure. A comparison of the proposed technique with existing RSA and Triple DES has also been done in terms of frequency distribution and homogeneity of source and encrypted files.
{"title":"Cascaded Encryption Through Recursive Carry Addition and Key Rotation (CRCAKR) of a Session Key","authors":"P. K. Jha, J. K. Mandal","doi":"10.1109/ICIT.2006.36","DOIUrl":"https://doi.org/10.1109/ICIT.2006.36","url":null,"abstract":"The technique considers a message as binary string on which a cascaded recursive carry addition and key rotation (CRCAKR) is applied. This technique uses binary addition method. It is a kind of block cipher and symmetric in nature hence, decoding is done following the same procedure. A comparison of the proposed technique with existing RSA and Triple DES has also been done in terms of frequency distribution and homogeneity of source and encrypted files.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121669405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：