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

2007 International Conference on Computing: Theory and Applications (ICCTA'07)最新文献

筛选
英文 中文
An Approach Based on Regression Line Features for Low Complexity Content Based Image Retrieval 基于回归线特征的低复杂度内容图像检索方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.25
R. P. Kumar, P. Nagabhushan
{"title":"An Approach Based on Regression Line Features for Low Complexity Content Based Image Retrieval","authors":"R. P. Kumar, P. Nagabhushan","doi":"10.1109/ICCTA.2007.25","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.25","url":null,"abstract":"Similarity matching is one of the important tasks in content based image retrieval systems. Similarity matching involves the computation of distance between the feature vectors characterizing the image samples. Conventional techniques like pixel based similarity matching are computationally costly and time consuming. In recent years the tremendous increase in multi media databases, especially image databases calls for fast and efficient image retrieval mechanisms. Multiresolution based approaches through multiresolution histograms and wavelet histograms proposed recently are proven to be computationally efficient. In this paper, we propose a methodology based on regression line features for further reducing the computational complexity of these multiresolution histogram based techniques","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114176155","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
A Beacon Selection Algorithm for Bounded Error Location Estimation in Ad Hoc Networks 一种用于自组织网络有界误差定位估计的信标选择算法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.1
K. Sinha, A. D. Chowdhury
{"title":"A Beacon Selection Algorithm for Bounded Error Location Estimation in Ad Hoc Networks","authors":"K. Sinha, A. D. Chowdhury","doi":"10.1109/ICCTA.2007.1","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.1","url":null,"abstract":"We consider the class of ad hoc networks, where a small percentage of the nodes are assumed to know their locations a priori and are denoted as reference nodes. Starting from the reference nodes, location information of other nodes are estimated in a hop by hop fashion. Beacon nodes are defined to be nodes that already have a location information (including the reference nodes). Using a two-dimensional cartesian coordinate system, we show that given a maximum of plusmnepsi error in the location of each of the beacon nodes and a maximum error of plusmndelta in each of the measured ranges along either axes, the location of a node can be computed within an error bound of plusmn[3epsi(l+radic2)+2delta] to plusmn(3epsi+2delta) along one axis and within plusmn2epsi(l+radic2)+3delta] to plusmn(3epsi+2delta)) along its orthogonal axis, by using the beacon selection algorithm proposed in this paper","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114807505","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
Partially Dynamic Concurrent Update of Distributed Shortest Paths 分布式最短路径的部分动态并发更新
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.101
Gianlorenzo D'angelo, Serafino Cicerone, G. Stefano, D. Frigioni
{"title":"Partially Dynamic Concurrent Update of Distributed Shortest Paths","authors":"Gianlorenzo D'angelo, Serafino Cicerone, G. Stefano, D. Frigioni","doi":"10.1109/ICCTA.2007.101","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.101","url":null,"abstract":"We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the previous operation has to be terminated, that is, they are not able to update shortest paths concurrently, or (ii) concurrently update shortest paths, but their convergence can be very slow (possibly infinite). In this paper we propose a partially dynamic algorithm that overcomes these limitations. In particular, it is able to concurrently update shortest paths and its convergence is quite fast","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128086477","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}
引用次数: 8
Distributed Data Gathering Scheduling in Multihop Wireless Sensor Networks for Improved Lifetime 基于多跳无线传感器网络的分布式数据采集调度
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.53
S. Bhattacharjee, Nabanita Das
{"title":"Distributed Data Gathering Scheduling in Multihop Wireless Sensor Networks for Improved Lifetime","authors":"S. Bhattacharjee, Nabanita Das","doi":"10.1109/ICCTA.2007.53","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.53","url":null,"abstract":"For a multihop sensor network with n sensors, this paper presents an O(n) distributed greedy algorithm for extracting a rooted spanning tree to improve the lifetime of the overall network. It spontaneously determines a data gathering schedule from the sensors towards the base station (the root). No global knowledge about the topology is required for the computation and also each sensor does not need to access the base station directly. Simulation studies show that in terms of system lifetime, the proposed algorithm significantly outperforms the scheduling based on the minimum spanning tree (MST), or the shortest path (SP) routing techniques. Performance comparison with PEGASIS shows that the proposed algorithm performs better as more and more nodes die out","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121797182","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
Privacy Preserving Vehicle Purchase Marketplace 保护隐私的车辆购买市场
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.107
S. Sehgal, Atul Saroop
{"title":"Privacy Preserving Vehicle Purchase Marketplace","authors":"S. Sehgal, Atul Saroop","doi":"10.1109/ICCTA.2007.107","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.107","url":null,"abstract":"The car customer in the U.S. market has come to expect many incentives during her purchase process. Many of these incentives are based on the private profile information of the customer, which she would not want to disclose to the set of all possible dealers. On the other hand, the dealers want to keep the exact information on various incentives on offer private as well due to various business reasons. In this paper, we present design of a privacy preserving marketplace that executes control on information disclosure while enabling the purchasing process. Marketplace designs pertaining to both single dealer and multiple dealer participation are dealt with","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121862961","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
Semantic analysis of 'to' to的语义分析
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.116
A. Almeida, R. Mohanty, P. Bhattacharyya
{"title":"Semantic analysis of 'to'","authors":"A. Almeida, R. Mohanty, P. Bhattacharyya","doi":"10.1109/ICCTA.2007.116","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.116","url":null,"abstract":"'To' is one of the most common lexemes in English (as found in 34% of the sentences in the Penn Tree Bank corpus). This paper describes the analysis of the sentences involving `to'. `To' poses problems at lexical, syntactic and semantic level, as we need to resolve whether the phrase which is fronted by `to' is a prepositional phrase (PP) or an infinitival clause which is a kind of inflectional phrase (IP). In case of PP, we need to locate the attachment site for it and assign the semantic relation. In case of IP, we need to resolve the empty pronominal in addition to the attachment resolution-a task essential to make the semantic analysis complete. We achieve an accuracy of about 80% in the above tasks.","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131830491","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}
引用次数: 1
Unintelligent Guided Ant-Based Solution to the Application Service Mapping Problem in a Grid Environment 网格环境下应用服务映射问题的非智能导向蚁群解决方案
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.127
Sharath Babu Musunoori, G. Horn
{"title":"Unintelligent Guided Ant-Based Solution to the Application Service Mapping Problem in a Grid Environment","authors":"Sharath Babu Musunoori, G. Horn","doi":"10.1109/ICCTA.2007.127","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.127","url":null,"abstract":"A key problem of component-based grid application configuration is to map services onto the execution nodes of the grid environment such that all services of the application satisfy some minimum quality requirements. This problem is known to be NP-hard. Based on the previous ant-based methods to solve the problem, this paper proposes learning gatekeepers to guide the movement of unintelligent foraging ants to enhance the efficiency of the grid node graph exploration. In this respect, three variants of learning schemes have been used to reason how the gatekeepers could learn better recommendations to guide the ants. The simulation evaluation of the proposed methods shows that inclusion of gatekeepers significantly improves the convergence performance over the simple unintelligent random ants","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125788586","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
Weed Classification Using Angular Cross Sectional Intensities for Real-Time Selective Herbicide Applications 基于角横截面强度的实时选择性除草剂杂草分类
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.132
A. Naeem, I. Ahmad, Muhammad Islam, Shahid Nawaz
{"title":"Weed Classification Using Angular Cross Sectional Intensities for Real-Time Selective Herbicide Applications","authors":"A. Naeem, I. Ahmad, Muhammad Islam, Shahid Nawaz","doi":"10.1109/ICCTA.2007.132","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.132","url":null,"abstract":"The environmental impact of herbicide utilization has stimulated research into new methods of weed control, such as selective herbicide application on highly infested crop areas. This paper deals with the development of an algorithm which calculates angular cross sectional intensity of an image that is used for the weed classification. This algorithm is specifically developed to classify images into broad and narrow class for real-time selective herbicide application. The developed system has been tested on weeds in the lab, which have shown that the system to be very effective in weed identification especially to reduce the air and light effects of natural open air environments. Further the results show a very reliable performance on images of weeds taken under varying field conditions. The analysis of the results shows over 97% classification accuracy over 140 sample images (broad and narrow) with 70 samples from each category of weeds","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114309917","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}
引用次数: 14
An Efficient Digital Watermarking Scheme for Dynamic Estimation of Wireless Channel Condition 一种有效的无线信道状态动态估计数字水印方案
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.27
S. Maity, M. Kundu, S. Maity
{"title":"An Efficient Digital Watermarking Scheme for Dynamic Estimation of Wireless Channel Condition","authors":"S. Maity, M. Kundu, S. Maity","doi":"10.1109/ICCTA.2007.27","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.27","url":null,"abstract":"This paper investigates the scope of an unconventional use of digital watermarking principle to blindly assess the quality of the multimedia signals through dynamic estimation of the status of the wireless channel. An algorithm of a fragile watermarking technique is proposed for digital image that can be extended to video signal applications by embedding watermark information in different frames. Fast Walsh transform becomes an effective choice to implement proposed fragile spread spectrum (SS) image watermarking scheme as it offers low processing noise at low quality compression, low loss of image information due to embedding, and low computation cost. Circuits for watermark embedding and decoding are developed that makes it suitable for such real time application. Performance of the algorithm is tested for QoS assessment of digital images when transmitted through mobile channel and also to mitigate the multipath propagation effect in Rayleigh and Rician fading environment","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131773760","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}
引用次数: 10
Diameter and Routing in Enhanced OTIS Cube 增强型奥的斯立方体的直径和路由
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.49
R. Das
{"title":"Diameter and Routing in Enhanced OTIS Cube","authors":"R. Das","doi":"10.1109/ICCTA.2007.49","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.49","url":null,"abstract":"Enhanced OTIS-cube (E-OTIS-Q<sub>n</sub>), a variation of the OTIS-cube (OTIS-Q<sub>n</sub>) was proposed in (R.K. Das, 2005). E-OTIS-Q<sub>n</sub> is regular of degree n+1 and is obtained from the normal OTIS-cube by adding some extra links. In (R.K. Das, 2005), it was shown that the diameter of E-OTIS-Q<sub>n</sub> is less than or equal to lfloor4n+5/3rfloor and a heuristic for point-to-point routing has been proposed. In this paper, an optimal algorithm for one-to-one routing in E-OTIS-Q<sub>n</sub> has been developed. We have shown that the diameter of E-OTIS-Q<sub>n</sub> is equal to lfloor4n+4/3rfloor which is almost two-third of the diameter of OTIS-Q<sub>n</sub>","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133701385","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}
引用次数: 8
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信