Proceedings. International Conference on Information Technology: Coding and Computing最新文献

筛选
英文 中文
Mask and multiple format: two notions for a progressive and adapted access to information 遮罩和多重格式:进步和适应信息获取的两个概念
M. Villanova-Oliver, J. Gensel, H. Martin, Christelle Erb
{"title":"Mask and multiple format: two notions for a progressive and adapted access to information","authors":"M. Villanova-Oliver, J. Gensel, H. Martin, Christelle Erb","doi":"10.1109/ITCC.2002.1000406","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000406","url":null,"abstract":"Introduces the notions of mask and multiple format for setting up a progressive access to information in an information system. Masks consist of more or less complete representations of the structure of information while multiple formats correspond to different representations available for multimedia data. We describe how these two notions are integrated into AROM, an object-based knowledge representation system which supports a UML-like formalism, by instantiating a model called PAM (Progressive Access Model). More generally, a progressive and adapted access to information can be given to users of any information system by simply adapting the PAM to the underlying data schema and coupling it with the target data or knowledge base.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"456 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128563037","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
Determining the usefulness of manually assigned keywords for a vector space system 确定为向量空间系统手动分配关键字的有用性
K. Taghva, T. Nartker, J. Borsack, A. Condit
{"title":"Determining the usefulness of manually assigned keywords for a vector space system","authors":"K. Taghva, T. Nartker, J. Borsack, A. Condit","doi":"10.1109/ITCC.2002.1000394","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000394","url":null,"abstract":"In this paper, we report on a series of experiments involving feedback and query expansion. We conclude that query expansion using manually-assigned keywords has no advantage over expansion using terms from the text of the document.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128682832","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}
引用次数: 2
Trends in multimedia Web searching: excite queries 多媒体网络搜索的趋势:激发查询
Seda Özmutlu, H. C. Özmutlu, A. Spink
{"title":"Trends in multimedia Web searching: excite queries","authors":"Seda Özmutlu, H. C. Özmutlu, A. Spink","doi":"10.1109/ITCC.2002.1000357","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000357","url":null,"abstract":"This paper provides results from a study analyzing current trends in multimedia Web searching. The following results were found: (1) multimedia searches are more complex than general searches in queries per user session and terms per query, and (2) audio queries are the most popular type of multimedia queries (compared to video and image queries) in the number of queries submitted and query durations.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124031454","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
Self-adjusted network transmission for multimedia data 自调整网络传输多媒体数据
M. Shyu, Hongli Luo, Shu‐Ching Chen
{"title":"Self-adjusted network transmission for multimedia data","authors":"M. Shyu, Hongli Luo, Shu‐Ching Chen","doi":"10.1109/ITCC.2002.1000373","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000373","url":null,"abstract":"High bandwidth requirements in multimedia transmission make the efficient use of limited network resource a challenging task, especially when multiple clients make their requests to the server simultaneously. We propose a self-adjusted network transmission mechanism for multiple clients. Instead of assigning a fixed bandwidth for each client, the server determines the transmission rate for each client connection according to the buffer packets and playback rate at each client. Transmission rates are adjusted when the total requested bandwidth is larger than the network bandwidth. In addition, the proposed mechanism can minimize the bandwidth allocation and maximize the client buffer utilization. A simulation is performed and the simulation results show that the proposed mechanism can dynamically change the transmission rate for each client to avoid overflow of the client buffer, and achieve the optimal utilization of the limited network resource in multiple client network environments.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132877134","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}
引用次数: 7
Distributed power control using the simultaneous mutation of genetic algorithms in cellular radio systems 蜂窝式无线电系统中采用同步突变遗传算法的分布式功率控制
Won Jay Song, B. Ahn
{"title":"Distributed power control using the simultaneous mutation of genetic algorithms in cellular radio systems","authors":"Won Jay Song, B. Ahn","doi":"10.1109/ITCC.2002.1000416","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000416","url":null,"abstract":"This paper has proposed a distributed power control algorithm that uses a stochastic search technique in order to solve linear systems of equations for power update in CDMA cellular radio systems. The proposed algorithm is developed by applying Bremermann's evolutionary computation algorithm to the CDMA power control problem. The major advantage of the applied evolutionary computation algorithm is more rapid optimization on linear systems of equations compared with the simple genetic algorithm (SGA). By employing distributed constrained power control (DCPC) as a reference algorithm, we have designed and implemented computational experiments on the DS-CDMA system. The results indicate that the proposed algorithm significantly enhances the optimization speed of power control. The proposed algorithm is also compared with the bang-bang type algorithm used in the IS-95 and W-CDMA systems. The results show that our proposed algorithm also has the potential to increase the CDMA cellular radio network capacity and decrease the mobile terminal power consumption.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133910695","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}
引用次数: 2
Joint source-channel coding using simplified block-based segmentation and content-based rate-control for wireless video transport 基于简化块分割和基于内容的无线视频传输速率控制的联合信源信道编码
S. Aramvith, H. Kortrakulkij, D. Tancharoen, S. Jitapunkul
{"title":"Joint source-channel coding using simplified block-based segmentation and content-based rate-control for wireless video transport","authors":"S. Aramvith, H. Kortrakulkij, D. Tancharoen, S. Jitapunkul","doi":"10.1109/ITCC.2002.1000362","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000362","url":null,"abstract":"The scenario of using Automatic Repeat reQuest (ARQ) retransmission for two-way low bit-rate video communications over wireless Rayleigh fading channels is studied. In this kind of channel, the packets inevitably experience errors during deep fades. The retransmissions can be used to re-send such packets. During retransmissions, the video encoder buffer fills up quickly and may cause the rate-control algorithm to skip frames or allocate less number of bits to encode the video frame. To reduce the number of frames skipped and improve bit allocation, we propose a content-based rate-control scheme using simplified block-based segmentation to intelligently allocate more bits to the foreground region. In addition, our proposed scheme also takes into consideration the effects of the video buffer fill-up, an a priori channel model, channel feedback information. The simulation results indicate that our proposed scheme encodes the video sequences with higher quality on the foreground region and much fewer frame skipping as compared to H.263 TMN8.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122554622","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}
引用次数: 12
Automatic query expansion based on directed divergence 基于有向发散的自动查询扩展
D. Cai, C. J. Rijsbergen
{"title":"Automatic query expansion based on directed divergence","authors":"D. Cai, C. J. Rijsbergen","doi":"10.1109/ITCC.2002.1000352","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000352","url":null,"abstract":"To extract informative terms through known relevance information for query expansion is an important issue in the design of an effective text retrieval system. Various discriminant functions have been developed as a device for eliciting good terms. In this paper the notion of informativeness of terms is interpreted and discriminant functions are formalised both based on information-theoretic ideas for automatic query expansion. Preliminary results show that the approach adopted in this paper is worthy of continued investigation.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128706647","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}
引用次数: 2
Unified method for optimization of several video coding algorithms on general-purpose processors 通用处理器上几种视频编码算法的统一优化方法
V. Lappalainen, T. Hämäläinen
{"title":"Unified method for optimization of several video coding algorithms on general-purpose processors","authors":"V. Lappalainen, T. Hämäläinen","doi":"10.1109/ITCC.2002.1000428","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000428","url":null,"abstract":"A unified method for optimization of video coding algorithms on general-purpose processors is presented. The method consists of algorithmic, code, compiler, and SIMD (Single Instruction Multiple Data) media Instruction Set Architecture (ISA) optimizations. H.263, H.263+ and emerging H.26L are used as example cases. For the realization of the unified method, the coding elements in all the codecs are analyzed and optimization techniques suitable for one or several of all the coding elements are presented. Results show that a nine-fold improvement can be obtained in H.26L decoding speed in terms of frames per second with video quality equivalent to a non-optimized implementation.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125574753","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
Bridging O-telos and XML with XML schema: the authoring environment for KBS Adaptive Hyperbook 用XML模式桥接O-telos和XML: KBS Adaptive Hyperbook的创作环境
C. Qu, W. Nejdl
{"title":"Bridging O-telos and XML with XML schema: the authoring environment for KBS Adaptive Hyperbook","authors":"C. Qu, W. Nejdl","doi":"10.1109/ITCC.2002.1000412","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000412","url":null,"abstract":"KBS Adaptive Hyperbook is a framework designed for modeling, organizing, and maintaining distributed hypermedia resources on the Web with the purpose of supporting Web-based distance education. Since the Hyperbook system is implemented based on a sophisticated meta modeling language (O-Telos), its authoring depends to a great extent on the Hyperbook developers instead of lecturers who have rich teaching experience but generally no knowledge of O-Telos and meta modeling. This has become a notable obstacle to enrich the content of existing Hyperbooks and further construct new Hyperbooks which are applicable to different specialties. In this paper we present a novel approach which can achieve schema-level transformation between O-Telos schema and W3C standard XML schema. By transforming Hyperbook data models, which are originally represented in O-Telos, into XML schemas, we can provide a standalone Hyperbook authoring environment which is able to directly utilize XML-schema-aware XML visual editors as a front-end GUI and enable lecturers to easily accomplish Hyperbook authoring.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126605139","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
Euler vector: a combinatorial signature for gray-tone images 欧拉矢量:灰调图像的组合签名
Arijit Bishnu, B. Bhattacharya, M. Kundu, C. A. Murthy, T. Acharya
{"title":"Euler vector: a combinatorial signature for gray-tone images","authors":"Arijit Bishnu, B. Bhattacharya, M. Kundu, C. A. Murthy, T. Acharya","doi":"10.1109/ITCC.2002.1000372","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000372","url":null,"abstract":"A new combinatorial characterization of a gray-tone image, called an Euler vector, is proposed. The Euler number of a binary image is a well-known topological feature, which remains invariant under translation, rotation, scaling, and rubber-sheet transformations of the image. An Euler vector comprises of a 4-tuple, where each element is an integer representing the Euler number of the partial binary image formed by the four most significant bit planes of the gray-tone image. Experimental results demonstrate the robustness of the Euler vector under compression and inclusion of noise followed by filtering. The vector is topologically invariant and can be used for image indexing and retrieval.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127068022","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
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学术官方微信