In most pattern recognition algorithms, amino acids cannot be used directly as inputs since they are nonnumerical variables. They, therefore, need encoding prior to input. In this regard, a novel string kernel is introduced, which maps a nonnumerical sequence space to a numerical feature space.The proposed string kernel is developed based on the conventional bio-basis function and termed as novel bio-basis function. The novel bio-basis function is designed based on the principle of asymmetricity of biological distance, which is calculated using an amino acid mutation matrix. The concept of zone of influence of bio-basis is introduced in the proposed string kernel to normalize the asymmetric distance. An efficient method to select bio-bases for the novel string kernel is described integrating the concepts of the Fisher ratio and degree of resemblance. The effectiveness of the proposed string kernel and bio-bases selection method, along with a comparison with existing kernel and related selection methods, is demonstrated on different protein data sets.
{"title":"Prediction of Protein Functional Sites Using Novel String Kernels","authors":"C. Das, P. Maji","doi":"10.1109/ICIT.2008.11","DOIUrl":"https://doi.org/10.1109/ICIT.2008.11","url":null,"abstract":"In most pattern recognition algorithms, amino acids cannot be used directly as inputs since they are nonnumerical variables. They, therefore, need encoding prior to input. In this regard, a novel string kernel is introduced, which maps a nonnumerical sequence space to a numerical feature space.The proposed string kernel is developed based on the conventional bio-basis function and termed as novel bio-basis function. The novel bio-basis function is designed based on the principle of asymmetricity of biological distance, which is calculated using an amino acid mutation matrix. The concept of zone of influence of bio-basis is introduced in the proposed string kernel to normalize the asymmetric distance. An efficient method to select bio-bases for the novel string kernel is described integrating the concepts of the Fisher ratio and degree of resemblance. The effectiveness of the proposed string kernel and bio-bases selection method, along with a comparison with existing kernel and related selection methods, is demonstrated on different protein data sets.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114562122","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 a protocol for identifying node-disjoint paths in an ad hoc network. The core of a protocol is a scheme that forwards copies of a route request at an intermediate node. We propose schemes that are slotted and utilize the cross-layer properties of an ad hoc network. There can be a trade-off between the overheads incurred during the route discovery and the probability of identifying all node-disjoint paths between a given source and a destination. One may select an appropriate scheme from the schemes presented in this paper depending upon the overhead-probability trade-off.
{"title":"A Slotted and Cross-Layer Node-Disjoint Multipath Routing Protocol for Mobile Ad Hoc Networks","authors":"A. Abbas","doi":"10.1109/ICIT.2008.25","DOIUrl":"https://doi.org/10.1109/ICIT.2008.25","url":null,"abstract":"In this paper, we propose a protocol for identifying node-disjoint paths in an ad hoc network. The core of a protocol is a scheme that forwards copies of a route request at an intermediate node. We propose schemes that are slotted and utilize the cross-layer properties of an ad hoc network. There can be a trade-off between the overheads incurred during the route discovery and the probability of identifying all node-disjoint paths between a given source and a destination. One may select an appropriate scheme from the schemes presented in this paper depending upon the overhead-probability trade-off.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130675813","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 blind cepstrum transform-discrete wavelet transform (CT-DWT) composite audio watermarking based on BCH coding is proposed. It takes the advantages of error correcting coding and cepstrum transform to lower the bit error rate (BER) of the extracted watermark. Experimental results show that the watermark embedded with our proposed watermarking scheme is robust and invisible. Moreover the performance of the BCH-coding scheme is superior to non BCH-coding scheme.
{"title":"Audio Watermarking Based on BCH Coding Using CT and DWT","authors":"K. VivekanandaBhat, I. Sengupta, Abhijit Das","doi":"10.1109/ICIT.2008.34","DOIUrl":"https://doi.org/10.1109/ICIT.2008.34","url":null,"abstract":"A blind cepstrum transform-discrete wavelet transform (CT-DWT) composite audio watermarking based on BCH coding is proposed. It takes the advantages of error correcting coding and cepstrum transform to lower the bit error rate (BER) of the extracted watermark. Experimental results show that the watermark embedded with our proposed watermarking scheme is robust and invisible. Moreover the performance of the BCH-coding scheme is superior to non BCH-coding scheme.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115276295","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 problem of assigning cells to switches in a mobile cellular network is a NP-Hard problem. It is therefore necessary to use a heuristic method to solve it in a reasonable amount of time with acceptable accuracy particularly for large sized problems. The assignment of cells to switches problem is characterized by minimization of the cabling cost, hand-off cost and switching costs in the whole network. We propose a swarm intelligence based technique to solve this problem. Ant colony optimization (ACO) and Particle swarm optimization (PSO) are typical swarm intelligence techniques. ACO technique was used for cell assignment problem in the recent past and shown to be better in comparison to the other schemes. In this paper, we propose a modified binary Particle Swarm Optimization (MBPSO) technique for this cell assignment problem. Our experimental results reveal better results in terms of accuracy and execution time compared to ACO for a large combination of parameters.
{"title":"Assignment of Cells to Switches in a Cellular Mobile Environment Using Swarm Intelligence","authors":"S. Udgata, U. Anuradha, G. Kumar, Gauri K. Udgata","doi":"10.1109/ICIT.2008.31","DOIUrl":"https://doi.org/10.1109/ICIT.2008.31","url":null,"abstract":"The problem of assigning cells to switches in a mobile cellular network is a NP-Hard problem. It is therefore necessary to use a heuristic method to solve it in a reasonable amount of time with acceptable accuracy particularly for large sized problems. The assignment of cells to switches problem is characterized by minimization of the cabling cost, hand-off cost and switching costs in the whole network. We propose a swarm intelligence based technique to solve this problem. Ant colony optimization (ACO) and Particle swarm optimization (PSO) are typical swarm intelligence techniques. ACO technique was used for cell assignment problem in the recent past and shown to be better in comparison to the other schemes. In this paper, we propose a modified binary Particle Swarm Optimization (MBPSO) technique for this cell assignment problem. Our experimental results reveal better results in terms of accuracy and execution time compared to ACO for a large combination of parameters.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114535042","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 mapping of cellular architecture into mobile ad hoc network (MANET) leads to the design of Linked Cluster Architecture (LCA), where every cluster has a head node associated with zero or more member nodes. In order to achieve a faster cluster setup, we consider mobility of nodes as the deciding parameter for selecting the heads and their associated members. A node having the lowest mobility among its neighbors becomes the cluster head. Selection of low mobile nodes as the cluster heads ensures better cluster stability. A new energy consumption model has been considered for the cluster heads that takes into account the network traffic, density of cluster members and the transmission power utilized to communicate the member nodes.
{"title":"Mobility Based Clustering Algorithm and the Energy Consumption Model of Dynamic Nodes in Mobile Ad Hoc Network","authors":"S. Chinara, S. K. Rath","doi":"10.1109/ICIT.2008.54","DOIUrl":"https://doi.org/10.1109/ICIT.2008.54","url":null,"abstract":"The mapping of cellular architecture into mobile ad hoc network (MANET) leads to the design of Linked Cluster Architecture (LCA), where every cluster has a head node associated with zero or more member nodes. In order to achieve a faster cluster setup, we consider mobility of nodes as the deciding parameter for selecting the heads and their associated members. A node having the lowest mobility among its neighbors becomes the cluster head. Selection of low mobile nodes as the cluster heads ensures better cluster stability. A new energy consumption model has been considered for the cluster heads that takes into account the network traffic, density of cluster members and the transmission power utilized to communicate the member nodes.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115778578","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}
With the mounting pressure on public sector organizations to perform, information systems (IS) management in public sector is gaining importance. Public sector organizations are trying to emulate the IS practices of the private sector to achieve the performance objectives. Whether the management practices followed in the private sector organizations are replicable in the unique settings of public sector organizations, is a potentially researchable question. In this direction, it is important to understand and critically examine the unique issues faced by the public sector organizations related to IS management, that were documented in the literature. Such an understanding can help in identifying the nuances involved in IS management in public sector organizations.
{"title":"Information Systems Management in Public Sector Organizations","authors":"Madhavi Latha Nandi, G. K. Nayak","doi":"10.1109/ICIT.2008.68","DOIUrl":"https://doi.org/10.1109/ICIT.2008.68","url":null,"abstract":"With the mounting pressure on public sector organizations to perform, information systems (IS) management in public sector is gaining importance. Public sector organizations are trying to emulate the IS practices of the private sector to achieve the performance objectives. Whether the management practices followed in the private sector organizations are replicable in the unique settings of public sector organizations, is a potentially researchable question. In this direction, it is important to understand and critically examine the unique issues faced by the public sector organizations related to IS management, that were documented in the literature. Such an understanding can help in identifying the nuances involved in IS management in public sector organizations.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132337787","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 article, we have concentrated on selecting there liable path from source to destination in a mobile ad-hoc net work (MANET) framework using Dempster-Shafer Theory (DST) of evidence. The belief and plausibility functions are used here for calculating the suitable path for sending data packet from source to destination selecting the proper neighborhood on the basis of radio range of the source node. The radio range is determined depending on the Proximity Index and birth rate and death rate of the neighborhood nodes of the source node.Whenever data packet is changing hops within source and destination some credit and penalty are introduced to the next and previous hops respectively. In the concluding section of the present article a measure of gain (in delay) has been introduced for comparison of the existing methods vis-a-vis that of the proposed one.
{"title":"Enhancing Efficiency towards Handling Mobility Uncertainty in Mobile Ad-Hoc Network (MANET)","authors":"S. Roychoudhury, P. Dutta, B. Maiti","doi":"10.1109/ICIT.2008.45","DOIUrl":"https://doi.org/10.1109/ICIT.2008.45","url":null,"abstract":"In this article, we have concentrated on selecting there liable path from source to destination in a mobile ad-hoc net work (MANET) framework using Dempster-Shafer Theory (DST) of evidence. The belief and plausibility functions are used here for calculating the suitable path for sending data packet from source to destination selecting the proper neighborhood on the basis of radio range of the source node. The radio range is determined depending on the Proximity Index and birth rate and death rate of the neighborhood nodes of the source node.Whenever data packet is changing hops within source and destination some credit and penalty are introduced to the next and previous hops respectively. In the concluding section of the present article a measure of gain (in delay) has been introduced for comparison of the existing methods vis-a-vis that of the proposed one.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124357587","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 article addresses color image segmentation in hue-saturation space. A model for circular data is provided by the vM-Gauss distribution, which is a joint distribution of von-Mises and Gaussian distribution. The mixture of vM-Gauss distribution is used to model hue-saturation data. A cluster merging process is applied to separate such identifiable objects in the image. The results are shown on Berkeley segmentation dataset. A cluster association methodology is developed for comparison.
{"title":"Color Based Image Segmentation","authors":"A. Roy, S. Parui, Amitav Paul, Utpal Roy","doi":"10.1109/ICIT.2008.29","DOIUrl":"https://doi.org/10.1109/ICIT.2008.29","url":null,"abstract":"This article addresses color image segmentation in hue-saturation space. A model for circular data is provided by the vM-Gauss distribution, which is a joint distribution of von-Mises and Gaussian distribution. The mixture of vM-Gauss distribution is used to model hue-saturation data. A cluster merging process is applied to separate such identifiable objects in the image. The results are shown on Berkeley segmentation dataset. A cluster association methodology is developed for comparison.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126945145","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 Modified MAC (Quality of Service Manager) VHDL implementation over wireless LAN is presented, which integrates wireless access block and user interfaces. Real-time application of multimedia system over wireless network can be easily implemented with a low cost and less complexity. To support priority issues of real-time traffic, dual queueing strategy is adopted. It also provides WLAN-PHY which supports high speed data access up to the IEEE 802.11 PHY standards. The VHDL hardware implementation of modified MAC is dedicated for the specified kind of real-time multimedia traffic.
提出了一种改进的MAC (Quality of Service Manager，服务质量管理器)VHDL在无线局域网上的实现，它集成了无线访问块和用户界面。多媒体系统在无线网络上的实时应用具有成本低、复杂度低的优点。为了支持实时流量的优先级问题，采用了双排队策略。它还提供WLAN-PHY，支持高速数据访问，达到IEEE 802.11 PHY标准。修改MAC的VHDL硬件实现是专门针对特定类型的实时多媒体流量的。
{"title":"A Hardware Implementation of Modified MAC Behaviour for Multimedia Traffic in Wireless LAN for QoS","authors":"D. K. Puthal, B. Sahoo","doi":"10.1109/ICIT.2008.41","DOIUrl":"https://doi.org/10.1109/ICIT.2008.41","url":null,"abstract":"A Modified MAC (Quality of Service Manager) VHDL implementation over wireless LAN is presented, which integrates wireless access block and user interfaces. Real-time application of multimedia system over wireless network can be easily implemented with a low cost and less complexity. To support priority issues of real-time traffic, dual queueing strategy is adopted. It also provides WLAN-PHY which supports high speed data access up to the IEEE 802.11 PHY standards. The VHDL hardware implementation of modified MAC is dedicated for the specified kind of real-time multimedia traffic.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128878192","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 address a multi-agent approach using the behavior of honey bee to find out an optimal customer-campaign relationship under certain restrictions for the problem of multiple campaigns assignment. This NP-hard problem is one of the key issues in marketing when producing the optimal campaign. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Using the behavior of honey bee a multi-agent approach is proposed to overcome the multiple recommendations problem that occur when several personalized campaigns conducting simultaneously. We measure the effectiveness of the propose method with two other methods known as RANDOM and INDEPENDENT using an artificially created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Computational result of the proposed method shows a clear edge vis-a-vis RANDOM and INDEPENDENT.
{"title":"Honey Bee Behavior: A Multi-agent Approach for Multiple Campaigns Assignment Problem","authors":"Satchidananda Dehuri, Sung-Bae Cho, A. Jagadev","doi":"10.1109/ICIT.2008.14","DOIUrl":"https://doi.org/10.1109/ICIT.2008.14","url":null,"abstract":"This paper address a multi-agent approach using the behavior of honey bee to find out an optimal customer-campaign relationship under certain restrictions for the problem of multiple campaigns assignment. This NP-hard problem is one of the key issues in marketing when producing the optimal campaign. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Using the behavior of honey bee a multi-agent approach is proposed to overcome the multiple recommendations problem that occur when several personalized campaigns conducting simultaneously. We measure the effectiveness of the propose method with two other methods known as RANDOM and INDEPENDENT using an artificially created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Computational result of the proposed method shows a clear edge vis-a-vis RANDOM and INDEPENDENT.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126578391","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
扫码关注我们
求助内容：
应助结果提醒方式：