Software effort modeling is one of the fields in which machine learning techniques have proved effective. In this paper, attempt has been made to establish a relation between program development time with respect to its dependence on various program and personnel attributes. A neural network model has been developed to predict the development time of various software programs. The model is a three layer feed forward network with 17 neurons in the hidden layer. The model has 5 inputs and 1 output.
{"title":"The Soft Computing Approach to Program Development Time Estimation","authors":"V. Bhattacherjee","doi":"10.1109/ICIT.2006.84","DOIUrl":"https://doi.org/10.1109/ICIT.2006.84","url":null,"abstract":"Software effort modeling is one of the fields in which machine learning techniques have proved effective. In this paper, attempt has been made to establish a relation between program development time with respect to its dependence on various program and personnel attributes. A neural network model has been developed to predict the development time of various software programs. The model is a three layer feed forward network with 17 neurons in the hidden layer. The model has 5 inputs and 1 output.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"63 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":"132898013","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}
Lack of online trusted dealer and group membership dynamics make the membership control become a challenging task in wireless ad hoc network. Based on the threshold cryptography (and verifiable secret sharing), we propose a secure membership control scheme using a new threshold signature based on the RSA variant. Compared with other proposed solutions based on RSA, the scheme does not need the operation of t-bounded coalition offsetting; moreover, it provides verifiable GMC issuance and share acquisition, which is only achieved in threshold DSA before.
{"title":"Securing Membership Control in Mobile Ad Hoc Networks","authors":"Yunfang Feng, Zhiyuan Liu, Jun Yu Li","doi":"10.1109/ICIT.2006.81","DOIUrl":"https://doi.org/10.1109/ICIT.2006.81","url":null,"abstract":"Lack of online trusted dealer and group membership dynamics make the membership control become a challenging task in wireless ad hoc network. Based on the threshold cryptography (and verifiable secret sharing), we propose a secure membership control scheme using a new threshold signature based on the RSA variant. Compared with other proposed solutions based on RSA, the scheme does not need the operation of t-bounded coalition offsetting; moreover, it provides verifiable GMC issuance and share acquisition, which is only achieved in threshold DSA before.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"32 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":"133449281","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}
Improving the query performance is critical in data warehousing and decision support systems. A lot of methods have been proposed by various researches. Indexing the data warehouse is a common but effective technique. Bitmap indices play a very important role in improving query performance in data warehousing and decision support systems. In this paper we present a new bitmap indexing strategy that can be applied to any existing bitmap compression schemes that are based on run length encoding. The new strategy, in most cases, requires less space and provides performance gains as well. The new strategy is tested on two commonly used bitmap compression schemes namely, word-aligned hybrid (WAH) and byte-aligned bitmap code (BBC) and results are presented graphically. The proposed strategy simply sorts the field on which a bitmap is to be created. Sorting of the field ensures long runs of ones and zeros. These long runs of ones and zeros are desirable for any compression scheme that is based on run length encoding and its variants. The space required to store the bitmap indexes goes down dramatically. The effect of sorting on query response time is studied for equality and range queries and it is found that there is a considerable decrease in the response time of queries. The overheads associated with the proposed strategy are sorting a table on a particular field and maintaining a sorted table. These extra tasks could be easily performed during the ETL process or when the data warehouse is offline. The new strategy concentrates on reducing space requirement for the bitmap index and the response time of queries and achieves both objectives without incurring any processing overheads when the data warehouse is online.
{"title":"Improved Bitmap Indexing Strategy for Data Warehouses","authors":"Navneet Goyal, Susheel Kumar Zaveri, Yashvardhan Sharma","doi":"10.1109/ICIT.2006.59","DOIUrl":"https://doi.org/10.1109/ICIT.2006.59","url":null,"abstract":"Improving the query performance is critical in data warehousing and decision support systems. A lot of methods have been proposed by various researches. Indexing the data warehouse is a common but effective technique. Bitmap indices play a very important role in improving query performance in data warehousing and decision support systems. In this paper we present a new bitmap indexing strategy that can be applied to any existing bitmap compression schemes that are based on run length encoding. The new strategy, in most cases, requires less space and provides performance gains as well. The new strategy is tested on two commonly used bitmap compression schemes namely, word-aligned hybrid (WAH) and byte-aligned bitmap code (BBC) and results are presented graphically. The proposed strategy simply sorts the field on which a bitmap is to be created. Sorting of the field ensures long runs of ones and zeros. These long runs of ones and zeros are desirable for any compression scheme that is based on run length encoding and its variants. The space required to store the bitmap indexes goes down dramatically. The effect of sorting on query response time is studied for equality and range queries and it is found that there is a considerable decrease in the response time of queries. The overheads associated with the proposed strategy are sorting a table on a particular field and maintaining a sorted table. These extra tasks could be easily performed during the ETL process or when the data warehouse is offline. The new strategy concentrates on reducing space requirement for the bitmap index and the response time of queries and achieves both objectives without incurring any processing overheads when the data warehouse is online.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"82 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":"117308344","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 paper presents a policy-based approach to detect security violations by enforcing security policy at run-time for providing secure email service. As email service usage is increasing day by day, hackers or attackers are also playing a vital role to destruct email service and even to crash the email server. Due to this, it is a challenging task today to the system administrators to provide secure email service. In this paper, security policy is defined at operating system level, mail application level and network infrastructure level. A policy at system level specifies mandatory usage profile, usages of system sensitive resources such as file system objects, processes, system memory and inter process communication objects. Policies for mail application are defined with sensitive files/directories and parameters, which have impact in delivering a service. Policies for network are defined for controlling inbound and outbound traffic, specifying demilitarized zone, denying misuse of public IP and detecting suspicious network activity. The proposed system architecture supports the layered approach in policy enforcement, proactive defensive mechanism against security violations and scope for new policy discovery. The approach is prototyped on Linux-2.4.21-4 and have built rules for squirrel mail version 1.4.5 to detect security violations in a mail service at run-time.
{"title":"Policy Specification and Enforcement for Detection of Security Violations in a Mail Service","authors":"A.M.M. Rao","doi":"10.1109/ICIT.2006.72","DOIUrl":"https://doi.org/10.1109/ICIT.2006.72","url":null,"abstract":"The paper presents a policy-based approach to detect security violations by enforcing security policy at run-time for providing secure email service. As email service usage is increasing day by day, hackers or attackers are also playing a vital role to destruct email service and even to crash the email server. Due to this, it is a challenging task today to the system administrators to provide secure email service. In this paper, security policy is defined at operating system level, mail application level and network infrastructure level. A policy at system level specifies mandatory usage profile, usages of system sensitive resources such as file system objects, processes, system memory and inter process communication objects. Policies for mail application are defined with sensitive files/directories and parameters, which have impact in delivering a service. Policies for network are defined for controlling inbound and outbound traffic, specifying demilitarized zone, denying misuse of public IP and detecting suspicious network activity. The proposed system architecture supports the layered approach in policy enforcement, proactive defensive mechanism against security violations and scope for new policy discovery. The approach is prototyped on Linux-2.4.21-4 and have built rules for squirrel mail version 1.4.5 to detect security violations in a mail service at run-time.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"92 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":"133308870","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}
S. Saha, S. Sur-Kolay, S. Bandyopadhyay, P. Dasgupta
Buffered clock-tree design, with cells at its leaves, are known to meet timing and skew requirements better. Clustering of flip-flops leads to reduced clock-tree wirelengths and power-efficient layouts. In this paper, the problem of clustering flip-flops in a given placement is formulated as Multi-way Equi-Partitioning of a given point set, such that (i) total area of the partition (ii) area of the largest partition and (Hi) total deviation of the partitions, are minimal. For this computationally expensive multiobjective optimization problem, also relevant to design of semi-synchronous systems, a technique based on genetic algorithm, is proposed. Crossover and mutation operators specific to the k-way equipartitioning problem, have been designed and a new greedy heuristic operator is employed to accelerate the convergence. Results on data sets obtained from layouts of ISCAS89 benchmark circuit demonstrate the effectiveness of the proposed method.
{"title":"Multiobjective Genetic Algorithm for k-way Equipartitioning of a Point Set with Application to CAD-VLSI","authors":"S. Saha, S. Sur-Kolay, S. Bandyopadhyay, P. Dasgupta","doi":"10.1109/ICIT.2006.66","DOIUrl":"https://doi.org/10.1109/ICIT.2006.66","url":null,"abstract":"Buffered clock-tree design, with cells at its leaves, are known to meet timing and skew requirements better. Clustering of flip-flops leads to reduced clock-tree wirelengths and power-efficient layouts. In this paper, the problem of clustering flip-flops in a given placement is formulated as Multi-way Equi-Partitioning of a given point set, such that (i) total area of the partition (ii) area of the largest partition and (Hi) total deviation of the partitions, are minimal. For this computationally expensive multiobjective optimization problem, also relevant to design of semi-synchronous systems, a technique based on genetic algorithm, is proposed. Crossover and mutation operators specific to the k-way equipartitioning problem, have been designed and a new greedy heuristic operator is employed to accelerate the convergence. Results on data sets obtained from layouts of ISCAS89 benchmark circuit demonstrate the effectiveness of the proposed method.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"111 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":"124061848","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}
Camouflaging is an attempt to obscure the signature of a target and sublimate the target in its background frame in terms of co-occurrence matrix texture properties. The objective of this research work is to detect such camouflaged defect. Since the texture similarity between the background and the defect is the premise for accomplishing camouflage, an intensive texture analysis should be able to discriminate defect from its background. In the proposed work we intended to employ Co-occurrence matrix based texture features are computed within the block, a small region of the image. Finally defective portions are detected by cluster analysis and identified through!. Watershed segmentation. Several experiments have been conducted to demonstrate the suitability of the proposed model to spot camouflaged defects. Experimentation on the synthetic and real images corroborates the potential of the method.
{"title":"Camouflage Defect Identification: A Novel Approach","authors":"Nagappa U. Bhajantri, P. Nagabhushan","doi":"10.1109/ICIT.2006.34","DOIUrl":"https://doi.org/10.1109/ICIT.2006.34","url":null,"abstract":"Camouflaging is an attempt to obscure the signature of a target and sublimate the target in its background frame in terms of co-occurrence matrix texture properties. The objective of this research work is to detect such camouflaged defect. Since the texture similarity between the background and the defect is the premise for accomplishing camouflage, an intensive texture analysis should be able to discriminate defect from its background. In the proposed work we intended to employ Co-occurrence matrix based texture features are computed within the block, a small region of the image. Finally defective portions are detected by cluster analysis and identified through!. Watershed segmentation. Several experiments have been conducted to demonstrate the suitability of the proposed model to spot camouflaged defects. Experimentation on the synthetic and real images corroborates the potential of the method.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"2230 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":"130187233","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}
B. Karthik, M. Jaiswal, V. Menon, Vidhya Kannan, Shobha Venkobarao, Madan Pande, A. Talukder, D. Das
Addition of different service requirements by users and advent of new access networks have increased the complexity to manage these networks uniformly. However, there are many management protocols available today like SNMP, JMX, WBEM, etc, which are being used to manage networks. Because of complexity and heterogeneity of these management protocols it has become very difficult for a network manager to manage different network elements (NE) since these may be instrumented using different such protocols. One critical example of such a complex network is IP Multimedia Subsystem (IMS). 3GPP does not specify the management protocol to be used to manage network elements in IMS. In this paper, the authors have proposed a novel network management solution, which can be used to manage IMS components independent of heterogeneous management protocols like WBEM, SNMP, JMX etc. Moreover, authors have developed a prototype resource adapter to test the suitability of the protocol.
{"title":"Seamless Network Management in Presence of Heterogeneous Management Protocols for Next Generation Networks","authors":"B. Karthik, M. Jaiswal, V. Menon, Vidhya Kannan, Shobha Venkobarao, Madan Pande, A. Talukder, D. Das","doi":"10.1109/ICIT.2006.80","DOIUrl":"https://doi.org/10.1109/ICIT.2006.80","url":null,"abstract":"Addition of different service requirements by users and advent of new access networks have increased the complexity to manage these networks uniformly. However, there are many management protocols available today like SNMP, JMX, WBEM, etc, which are being used to manage networks. Because of complexity and heterogeneity of these management protocols it has become very difficult for a network manager to manage different network elements (NE) since these may be instrumented using different such protocols. One critical example of such a complex network is IP Multimedia Subsystem (IMS). 3GPP does not specify the management protocol to be used to manage network elements in IMS. In this paper, the authors have proposed a novel network management solution, which can be used to manage IMS components independent of heterogeneous management protocols like WBEM, SNMP, JMX etc. Moreover, authors have developed a prototype resource adapter to test the suitability of the protocol.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"31 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":"116662799","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, using cryptographic access control techniques, we demonstrate that a client can store various versions of a file in a secure way at the (remote) server and control its access. The proposed mechanism also permits different users (clients) to store simultaneously their files with the same name at the server in a common storage area, without any name conflict. This will be very useful for mobile clients with limited storage.
{"title":"Version Control using Cryptographic Access Control","authors":"K. Ganesan, R. Anandan","doi":"10.1109/ICIT.2006.91","DOIUrl":"https://doi.org/10.1109/ICIT.2006.91","url":null,"abstract":"In this paper, using cryptographic access control techniques, we demonstrate that a client can store various versions of a file in a secure way at the (remote) server and control its access. The proposed mechanism also permits different users (clients) to store simultaneously their files with the same name at the server in a common storage area, without any name conflict. This will be very useful for mobile clients with limited storage.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"1 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":"128461496","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 deals with a quadratic classifier based scheme for the recognition of off-line handwritten numerals of Kannada, an important Indian script. The features used in the classifier are obtained from the directional chain code information of the contour points of the characters. The bounding box of a character is segmented into blocks and the chain code histogram is computed in each of the blocks. Here we have used 64 dimensional and 100 dimensional features for a comparative study on the recognition accuracy of our proposed system. This chain code features are fed to the quadratic classifier for recognition. We tested our scheme on 2300 data samples and obtained 97.87% and 98.45% recognition accuracy using 64 dimensional and 100 dimensional features respectively, from the proposed scheme using five-fold cross-validation technique.
{"title":"Recognition of Handwritten Kannada Numerals","authors":"N. Sharma, U. Pal, F. Kimura","doi":"10.1109/ICIT.2006.77","DOIUrl":"https://doi.org/10.1109/ICIT.2006.77","url":null,"abstract":"This paper deals with a quadratic classifier based scheme for the recognition of off-line handwritten numerals of Kannada, an important Indian script. The features used in the classifier are obtained from the directional chain code information of the contour points of the characters. The bounding box of a character is segmented into blocks and the chain code histogram is computed in each of the blocks. Here we have used 64 dimensional and 100 dimensional features for a comparative study on the recognition accuracy of our proposed system. This chain code features are fed to the quadratic classifier for recognition. We tested our scheme on 2300 data samples and obtained 97.87% and 98.45% recognition accuracy using 64 dimensional and 100 dimensional features respectively, from the proposed scheme using five-fold cross-validation technique.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"50 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":"127242612","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}
D. Mishra, N. Bose, A. Tolambiya, A. Dwivedi, P. Kandula, Ashiwani Kumar, P. Kalra
A modified forward-only counterpropagation neural network (MFO-CPN) for color image compression is proposed. It uses several higher-order distance measures for calculating winning node. It also incorporates nonlinear adjustment of learning rates in both the layers. Results with these distance functions are compared. Proposed modifications leads to improvement in the image quality and faster convergence of network.
{"title":"Color Image Compression with Modified Forward-Only Counterpropagation Neural Network: Improvement of the Quality using Different Distance Measures","authors":"D. Mishra, N. Bose, A. Tolambiya, A. Dwivedi, P. Kandula, Ashiwani Kumar, P. Kalra","doi":"10.1109/ICIT.2006.37","DOIUrl":"https://doi.org/10.1109/ICIT.2006.37","url":null,"abstract":"A modified forward-only counterpropagation neural network (MFO-CPN) for color image compression is proposed. It uses several higher-order distance measures for calculating winning node. It also incorporates nonlinear adjustment of learning rates in both the layers. Results with these distance functions are compared. Proposed modifications leads to improvement in the image quality and faster convergence of network.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"90 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":"115105742","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
扫码关注我们
求助内容：
应助结果提醒方式：