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

Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)最新文献

筛选
英文 中文
Towards knowledge discovery from WWW log data 从WWW日志数据中发现知识
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844242
F. Tao, F. Murtagh
{"title":"Towards knowledge discovery from WWW log data","authors":"F. Tao, F. Murtagh","doi":"10.1109/ITCC.2000.844242","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844242","url":null,"abstract":"As the result of interactions between visitors and a Web site, an http log file contains very rich knowledge about users' on-site behavior, which, if fully exploited, can better customer services and site performance. Different to most of the existing log analysis tools which use statistical counting summaries on pages, hosts, etc., we propose a transaction model to represent users' access history and a framework to adapt data mining techniques such as sequence and association rule mining to these transactions. In this framework, all transactions are extracted from the raw log file though a series of step by step data preparation phases. We discuss different methods to identify a user, and separate long convoluted sequences into semantically meaningful sessions and transactions. A new feature called interestingness is defined to model user interests in different Web sections. With all the transactions being imported into an adapted cube structure with a concept hierarchy attached to each dimension of it, it is possible to carry out multi-dimensional data mining at multi-abstract levels. Using interest context rules, we demonstrate the potentially significant meaning of this system prototype.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134598384","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}
引用次数: 35
Segmentation of Brazilian bank check logos without a priori knowledge 分割巴西银行支票标志没有先验知识
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844231
Andreia de Jesus, J. Facon
{"title":"Segmentation of Brazilian bank check logos without a priori knowledge","authors":"Andreia de Jesus, J. Facon","doi":"10.1109/ITCC.2000.844231","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844231","url":null,"abstract":"The paper presents a method to locate and extract Brazilian bank check logos automatically by employing mathematical morphology. The objective is to minimize the number of heuristic parameters to obtain the most precise possible segmentation in every situation, thereby allowing this approach to be reused in other applications. Trials and results are presented.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134233812","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
Advanced signal processing for wireless multimedia communications 用于无线多媒体通信的先进信号处理
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.28945/572
Xiaodong Wang
{"title":"Advanced signal processing for wireless multimedia communications","authors":"Xiaodong Wang","doi":"10.28945/572","DOIUrl":"https://doi.org/10.28945/572","url":null,"abstract":"We present some key advanced signal processing methodologies that have been developed for interference suppression in wireless networks. We focus primarily on the problem of jointly suppressing multiple-access interference (MAI) and intersymbol interference (ISI), which are the limiting sources of interference for the high data-rate wireless systems being proposed for many emerging application areas, such as wireless multimedia. We first present a signal subspace approach to blind joint suppression of MAI and ISI. We then discuss a powerful iterative technique for joint interference suppression and decoding, the so-called turbo multiuser detection, that is especially useful for wireless multimedia packet communications. We also discuss space-time processing methods which employ multiple antennas for interference rejection and signal enhancement. Finally, we touch on the problems of suppressing narrowband interference and impulsive ambient noise, two other sources of radio frequency interference present in wireless multimedia networks.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133073037","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
A robust parallel architecture for adaptive color quantization 一种鲁棒的自适应颜色量化并行架构
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844201
Babu Mailachalam, T. Srikanthan
{"title":"A robust parallel architecture for adaptive color quantization","authors":"Babu Mailachalam, T. Srikanthan","doi":"10.1109/ITCC.2000.844201","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844201","url":null,"abstract":"Adaptive color quantization (ACQ) as described here is one method of color image compression employed for image storage and display in low cost monitors. Due to the nature of the palette based mapping employed in ACQ, it is prone to large errors due to noises introduced in transmission or additional lossy compression. This paper proposes a robust method of ACQ using a three dimensional self organizing map (3D SOM) which is tolerant to noises. The robustness of the 3D SOM is due to the property of such maps to cluster the color vectors in a topological manner. An efficient parallel architecture based on the SIMD structure and parallel winner determination scheme, is presented for the implementation of the 3D SOM. The VLSI area-time efficiency of this parallel architecture over the current implementations is also established.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574019","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
QoS oriented bandwidth management scheme for stable multimedia services on the IMT-2000 networks 面向QoS的带宽管理方案，用于IMT-2000网络中稳定的多媒体业务
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844240
Sunghyun Cho, Seungbo Yang, S. Heu, Sung-Han Park
{"title":"QoS oriented bandwidth management scheme for stable multimedia services on the IMT-2000 networks","authors":"Sunghyun Cho, Seungbo Yang, S. Heu, Sung-Han Park","doi":"10.1109/ITCC.2000.844240","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844240","url":null,"abstract":"We propose a bandwidth management scheme to efficiently guarantee the QoS of various services on IMT-2000 networks. The proposed bandwidth management scheme consists of the call admission control based on the guard channel and the time slot scheduling in wireless links. For the call admission control the preemption and deprivation method are used to overcome the problems in the previous guard channel scheme. The proposed time slot scheduling scheme allocates time slots based on the QoS requirements of each user. The time slots are dynamically scheduled by considering the current traffic conditions with the DQRUMA protocol. The simulation results show that the proposed bandwidth scheme has better performance than the previous works in terms of the handoff failure probability and the packet delay time.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117278474","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
Encoding neural networks to compute the atmospheric point spread function 编码神经网络计算大气点扩散函数
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844249
Bin Cong
{"title":"Encoding neural networks to compute the atmospheric point spread function","authors":"Bin Cong","doi":"10.1109/ITCC.2000.844249","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844249","url":null,"abstract":"Images of the Earth's surface acquired by a high-altitude aircraft or satellites are degraded by the intervening atmosphere. The imaging instrument records not only the signal of the targeted viewing area but also the radiance scattered into the field of view in the near by area. This effect can be characterized by an atmospheric point spread function (PSF). There are many parameters that may affect the PSF. To restore noisy-blurred images, one must understand which parameters influence the PSF and to what degree. This is very important for scientific applications that seek to extract information about environmental systems. In this paper, a design and implementation of a distributed representation scheme and neural networks are presented in order to estimate the atmospheric PSF. The representation scheme exemplifies the conjunctive coding and coarse coding techniques. Neural networks trained using such an appropriately structured representation generate a desired approximation of the PSF with satisfactory processing time.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123863684","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
A simulation for real time data compression 实时数据压缩的仿真
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844270
T. Pham
{"title":"A simulation for real time data compression","authors":"T. Pham","doi":"10.1109/ITCC.2000.844270","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844270","url":null,"abstract":"This paper presents one new basic step in real time data compression. The data under compression are random sequence of variable Y which at time t:y/sub 0/, y/sub 1/, ..., y/sub t/ have occurred. Y-random integer-{0, 1, ..., N-1}. So, at time t, if we produce Y~/sub t+1/ to be really a subset to Y so that y/sub t+1//spl isin/Y~/sub t+1/ then we can write or send the index of y/sub t+1/ in Y~/sub t+1/ instead of y/sub t+1/. To do it we create a function F, which learned from some recent past Y by the fixed rules, to map a known set onto V. The known set is the set known by both sender and receiver, and also, the function F is automatically created the same at both sides.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128086146","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
Networked multimedia systems courses: evolution, current courses, and future directions 网络多媒体系统课程:演变、当前课程和未来方向
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844247
N. Sharda
{"title":"Networked multimedia systems courses: evolution, current courses, and future directions","authors":"N. Sharda","doi":"10.1109/ITCC.2000.844247","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844247","url":null,"abstract":"This paper presents an overview of courses in the evolving discipline of networked multimedia systems (NMS). Many new subjects and some courses on NMS are already on offer at various universities. Most of the current subjects in NMS are offered in existing computer science and computer engineering courses. Some universities are also offering full fledged degree programs in NMS and related areas. NMS area is developing into an independent discipline much quicker than did computer science. Practical work is an important aspect of any NMS subject or course. NMS is a fast developing area, hence the practical exercises and projects must be designed to absorb this fast pace of development. A systematic and forward-looking view of NMS subjects and courses is required to ensure cohesive development in the future.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128412569","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
Probability of miscorrection for Reed-Solomon codes 里德-所罗门码的纠错概率
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844260
I. Sofair
{"title":"Probability of miscorrection for Reed-Solomon codes","authors":"I. Sofair","doi":"10.1109/ITCC.2000.844260","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844260","url":null,"abstract":"The decoder fails to correct an erroneous message to its original untainted version when the number of errors exceeds half the number of appended Reed-Solomon characters. In most cases, the Reed-Solomon algorithm can detect the presence of an excess of errors through built-in filters. However, in a few cases, the message may be corrected to a different code word in which case it is said to be miscorrected. This paper derives a general expression for the probability of miscorrection of an n-character message with a t-error correcting Reed-Solomon code that utilizes a maximum 2/sup m/-character set (GF(2/sup m/)), where 2/sup m/>n, given e errors.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128536504","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
Parallel real-time numerical computation: beyond speedup. III 并行实时数值计算:超越加速。3
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) Pub Date : 2000-03-27 DOI: 10.1109/ITCC.2000.844266
S. Akl, S. Bruda
{"title":"Parallel real-time numerical computation: beyond speedup. III","authors":"S. Akl, S. Bruda","doi":"10.1109/ITCC.2000.844266","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844266","url":null,"abstract":"For pt. II see Technical Report No. 99-423, Dept. of Comput. and Inf. Sci., Queen's University, Kingston, Ontario, May 1999. Parallel computers can do more than simply speed up sequential computations. They are capable of finding solutions that are far better in quality than those obtained by sequential computers. This fact is demonstrated by analyzing sequential and parallel solutions to numerical problems in a real-time paradigm. In this setting, numerical data required to solve a problem are received as input by a computer system, at regular intervals. The computer must process its inputs as soon as they arrive. It must also produce its outputs at regular intervals, as soon as they are available. We show that for some real-time numerical problems a parallel computer can deliver a solution that is significantly more accurate than that computed by a sequential computer. Similar results were derived recently in the areas of real-time optimization and real-time cryptography.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130583933","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术官方微信