发布求助
文献互助 智能选刊 最新文献

2008 International Conference on Information Technology最新文献

筛选
英文 中文
An Efficient ID Based Proxy Signature, Proxy Blind Signature and Proxy Partial Blind Signature 高效的基于ID的代理签名、代理盲签名和代理部分盲签名
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.38
B. Majhi, Deepak Kumar Sahu, R. Subudhi
{"title":"An Efficient ID Based Proxy Signature, Proxy Blind Signature and Proxy Partial Blind Signature","authors":"B. Majhi, Deepak Kumar Sahu, R. Subudhi","doi":"10.1109/ICIT.2008.38","DOIUrl":"https://doi.org/10.1109/ICIT.2008.38","url":null,"abstract":"Identity-based (ID based) public key cryptosystem gives an efficient alternative for key management as compared to certificate based public key settings. A proxy signature is a method for an entity to delegate signing capabilities to other participants so that they can sign on behalf of the entity with in a given context. In this paper, we have proposed a new ID-based proxy signature which is more efficient than. Then we have extended our study in developing a blind -signature and partial blind signature using the above proxy signing key. We also have analyzed security of our new scheme briefly.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"88 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":"127135128","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}
引用次数: 6
Pairwise Statistical Significance of Local Sequence Alignment Using Substitution Matrices with Sequence-Pair-Specific Distance 利用序列对特定距离替代矩阵分析局部序列比对的两两统计显著性
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.63
Ankit Agrawal, Xiaoqiu Huang
{"title":"Pairwise Statistical Significance of Local Sequence Alignment Using Substitution Matrices with Sequence-Pair-Specific Distance","authors":"Ankit Agrawal, Xiaoqiu Huang","doi":"10.1109/ICIT.2008.63","DOIUrl":"https://doi.org/10.1109/ICIT.2008.63","url":null,"abstract":"Pairwise sequence alignment forms the basis of numerous other applications in bioinformatics. The quality of an alignment is gauged by statistical significance rather than by alignment score alone. Therefore, accurate estimation of statistical significance of a pairwise alignment is an important problem in sequence comparison. Recently, it was shown that pairwise statistical significance does better in practice than database statistical significance, and also provides quicker individual pairwise estimates of statistical significance without having to perform time-consuming database search. Under an evolutionary model, a substitution matrix can be derived using a rate matrix and a fixed distance. Although the commonly used substitution matrices like BLOSUM62, etc. were not originally derived from a rate matrix under an evolutionary model, the corresponding rate matrices can be back calculated. Many researchers have derived different rate matrices using different methods and data. In this paper, we show that pairwise statistical significance using rate matrices with sequence-pair-specific distance performs significantly better compared to using a fixed distance. Pairwise statistical significance using sequence-pair-specific distanced substitution matrices also outperforms database statistical significance reported by BLAST.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"1 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":"129821679","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}
引用次数: 13
Audio Watermarking Based on BCH Coding Using CT and DWT 基于CT和DWT的BCH编码音频水印
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.34
K. VivekanandaBhat, I. Sengupta, Abhijit Das
{"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}
引用次数: 11
Assignment of Cells to Switches in a Cellular Mobile Environment Using Swarm Intelligence 基于群体智能的蜂窝移动环境中蜂窝到交换机的分配
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.31
S. Udgata, U. Anuradha, G. Kumar, Gauri K. Udgata
{"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}
引用次数: 9
Mobility Based Clustering Algorithm and the Energy Consumption Model of Dynamic Nodes in Mobile Ad Hoc Network 移动Ad Hoc网络中基于移动性的聚类算法及动态节点能耗模型
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.54
S. Chinara, S. K. Rath
{"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}
引用次数: 17
Information Systems Management in Public Sector Organizations 公共部门组织的信息系统管理
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.68
Madhavi Latha Nandi, G. K. Nayak
{"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}
引用次数: 3
Enhancing Efficiency towards Handling Mobility Uncertainty in Mobile Ad-Hoc Network (MANET) 提高移动自组网(MANET)中处理移动性不确定性的效率
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.45
S. Roychoudhury, P. Dutta, B. Maiti
{"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}
引用次数: 3
Color Based Image Segmentation 基于颜色的图像分割
2008 International Conference on Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICIT.2008.29
A. Roy, S. Parui, Amitav Paul, Utpal Roy
{"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}
引用次数: 4
A Hardware Implementation of Modified MAC Behaviour for Multimedia Traffic in Wireless LAN for QoS 基于QoS的无线局域网多媒体业务改进MAC行为的硬件实现
2008 International Conference on Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICIT.2008.41
D. K. Puthal, B. Sahoo
{"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}
引用次数: 0
Honey Bee Behavior: A Multi-agent Approach for Multiple Campaigns Assignment Problem 蜜蜂行为:多活动分配问题的多智能体方法
2008 International Conference on Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICIT.2008.14
Satchidananda Dehuri, Sung-Bae Cho, A. Jagadev
{"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}
引用次数: 9
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信