Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918788
G. Cao, Yiqiong Wu
Automatic repeat request (ARQ) is a well-known technique to provide error control. In reliable satellite multicasting, ARQ may reduce system throughput as the number of receivers increases since the satellite has to retransmit a packer until all receivers correctly receive it. This performance degradation might be alleviated substantially by conducting retransmissions through terrestrial paths from the sender to each receiver instead of through the multicast satellite link. However, this approach may not be possible when some receivers do not have terrestrial connections to the sender. Also, a large volume of feedback traffic from the receivers to the sender may cause a feedback implosion at the sender. In this paper, we propose a scalable framework to solve these problems. Our solution enables receivers to form groups to avoid unnecessary retransmissions as long as a correct packet call be found inside the group. Using analytical models, we demonstrate that the proposed solution can significantly improve system throughput.
{"title":"Reliable multicast via satellites","authors":"G. Cao, Yiqiong Wu","doi":"10.1109/ITCC.2001.918788","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918788","url":null,"abstract":"Automatic repeat request (ARQ) is a well-known technique to provide error control. In reliable satellite multicasting, ARQ may reduce system throughput as the number of receivers increases since the satellite has to retransmit a packer until all receivers correctly receive it. This performance degradation might be alleviated substantially by conducting retransmissions through terrestrial paths from the sender to each receiver instead of through the multicast satellite link. However, this approach may not be possible when some receivers do not have terrestrial connections to the sender. Also, a large volume of feedback traffic from the receivers to the sender may cause a feedback implosion at the sender. In this paper, we propose a scalable framework to solve these problems. Our solution enables receivers to form groups to avoid unnecessary retransmissions as long as a correct packet call be found inside the group. Using analytical models, we demonstrate that the proposed solution can significantly improve system throughput.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130357707","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918865
R. Orlandic, Byunggu Yu
Contemporary database technology is severely limited in managing the high-dimensional data of many advanced applications, such as multimedia systems and data mining. The main concern of this paper is the well-known performance degradation of multi-dimensional access methods in spaces with many dimensions. The paper proposes an elaborate storage organization, called the inverted space, which can support efficient processing of data in spaces with very high dimensionality. The organization allows system administrators to control the size of spatial indexes and thereby to avoid the negative impact of extremely high data dimensionality on the retrieval performance. In addition, this paper introduces a new point access method designed to address numerous other problems that contemporary retrieval schemes experience in high-dimensional situations. This mechanism is envisioned to serve as the core indexing structure of inverted-space storage organizations.
{"title":"Inverted-space storage organization for persistent data of very high dimensionality","authors":"R. Orlandic, Byunggu Yu","doi":"10.1109/ITCC.2001.918865","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918865","url":null,"abstract":"Contemporary database technology is severely limited in managing the high-dimensional data of many advanced applications, such as multimedia systems and data mining. The main concern of this paper is the well-known performance degradation of multi-dimensional access methods in spaces with many dimensions. The paper proposes an elaborate storage organization, called the inverted space, which can support efficient processing of data in spaces with very high dimensionality. The organization allows system administrators to control the size of spatial indexes and thereby to avoid the negative impact of extremely high data dimensionality on the retrieval performance. In addition, this paper introduces a new point access method designed to address numerous other problems that contemporary retrieval schemes experience in high-dimensional situations. This mechanism is envisioned to serve as the core indexing structure of inverted-space storage organizations.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125082112","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918848
Chao Kan, M. Srinath
In this paper a new method of combining cubic B-spline wavelet moments (WMs) and Zernike moments (ZMs) into a common feature vector is proposed for invariant pattern classification. By doing so, the ability of ZMs to capture global features and WMs to differentiate between subtle variations in description can be utilized at the same time. Analysis and simulations verify that the new method achieves better performance with respect to classification accuracy than using ZMs or WMs separately. In addition, this new method should also be applicable to other areas of pattern recognition.
{"title":"Combined features of cubic B-spline wavelet moments and Zernike moments for invariant character recognition","authors":"Chao Kan, M. Srinath","doi":"10.1109/ITCC.2001.918848","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918848","url":null,"abstract":"In this paper a new method of combining cubic B-spline wavelet moments (WMs) and Zernike moments (ZMs) into a common feature vector is proposed for invariant pattern classification. By doing so, the ability of ZMs to capture global features and WMs to differentiate between subtle variations in description can be utilized at the same time. Analysis and simulations verify that the new method achieves better performance with respect to classification accuracy than using ZMs or WMs separately. In addition, this new method should also be applicable to other areas of pattern recognition.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132413141","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918807
P. Montessoro, D. Pierattoni
New communication technologies are being developed and new user requirements are growing due to advances in fiber optics providing high link capacity at low cost. Traditional solutions are based on processing resources of host and network nodes in order to optimize link utilization. A simpler and lightweight solution could be reached by a new approach for designing network protocols; our proposal is initially limited to the LAN/structured cabling system environment, not excluding a further extension to MAN/WAN support. The leading idea is a broadband network architecture, based on native flow control, dynamic resource allocation and reallocation, and synchronous, connection-oriented fast circuit switching. It will provide a service based on multi-rate channels with short setup time and fixed switching requirements, as well as applications with bursty asynchronous traffic. A project framework is presented addressing the most important issues; physical, data link and network layer functions, data transfer schemes and traditional TCP/IP compatibility.
{"title":"An innovative local area network architecture for native multimedia support","authors":"P. Montessoro, D. Pierattoni","doi":"10.1109/ITCC.2001.918807","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918807","url":null,"abstract":"New communication technologies are being developed and new user requirements are growing due to advances in fiber optics providing high link capacity at low cost. Traditional solutions are based on processing resources of host and network nodes in order to optimize link utilization. A simpler and lightweight solution could be reached by a new approach for designing network protocols; our proposal is initially limited to the LAN/structured cabling system environment, not excluding a further extension to MAN/WAN support. The leading idea is a broadband network architecture, based on native flow control, dynamic resource allocation and reallocation, and synchronous, connection-oriented fast circuit switching. It will provide a service based on multi-rate channels with short setup time and fixed switching requirements, as well as applications with bursty asynchronous traffic. A project framework is presented addressing the most important issues; physical, data link and network layer functions, data transfer schemes and traditional TCP/IP compatibility.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134099615","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918839
S. Chompun, S. Jitapunkul, D. Tancharoen
This paper proposes a modification of the flexible multi-pulse based code excited linear predictive (MP-CELP) coder with bit rate scalabilities for tonal language speech in multimedia applications. The coder consists of a core coder and bit rate scalable tools. The high pitch delay resolutions are applied to the adaptive codebook of the core coder for tonal language speech quality improvement. The bit rate scalable tool employs multi-stage excitation coding based on an embedded-coding approach. The multi-pulse excitation codebook at each stage is adaptively produced depending on the selected excitation signal ut the previous stage. The experimental results show that the speech quality of the proposed coder is improved compared to that of the conventional coder without pitch-resolution adaptation.
{"title":"Novel technique for tonal language speech compression based on a bit rate scalable MP-CELP coder","authors":"S. Chompun, S. Jitapunkul, D. Tancharoen","doi":"10.1109/ITCC.2001.918839","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918839","url":null,"abstract":"This paper proposes a modification of the flexible multi-pulse based code excited linear predictive (MP-CELP) coder with bit rate scalabilities for tonal language speech in multimedia applications. The coder consists of a core coder and bit rate scalable tools. The high pitch delay resolutions are applied to the adaptive codebook of the core coder for tonal language speech quality improvement. The bit rate scalable tool employs multi-stage excitation coding based on an embedded-coding approach. The multi-pulse excitation codebook at each stage is adaptively produced depending on the selected excitation signal ut the previous stage. The experimental results show that the speech quality of the proposed coder is improved compared to that of the conventional coder without pitch-resolution adaptation.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165047","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918853
H. Q. Ngo, D. Du, R. Graham
In studying the scalability of optical networks, one problem arising involves coloring the vertices of the n-dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of /spl chi//sub k~/(n), the minimum number of colors needed, appears to be a difficult problem. We improve the known lower and upper bounds of /spl chi//sub k~/(n) and indicate the connection of this colouring problem to linear codes.
{"title":"New bounds on a hypercube coloring problem and linear codes","authors":"H. Q. Ngo, D. Du, R. Graham","doi":"10.1109/ITCC.2001.918853","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918853","url":null,"abstract":"In studying the scalability of optical networks, one problem arising involves coloring the vertices of the n-dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of /spl chi//sub k~/(n), the minimum number of colors needed, appears to be a difficult problem. We improve the known lower and upper bounds of /spl chi//sub k~/(n) and indicate the connection of this colouring problem to linear codes.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"19 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132059646","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918778
K. Chakrabarty, S. Iyengar, H. Qi, E. Cho
Distributed, real time sensor networks are essential for effective surveillance in the digitized battlefield and for environmental monitoring. We present the first systematic theory that leads to novel sensor deployment strategies for effective surveillance and target location. We represent the sensor field as a grid (two- or three-dimensional) of points (coordinates), and use the term target at a grid point at any instant in time. We use the framework of unidentified codes to determine sensor placement for unique target location. We provide coding-theoretic-bounds on the number of sensors and present methods for determining their placement in the sensor field. We also show that sensor placement for single targets provides asymptotically complete (unambiguous) location of multiple targets.
{"title":"Coding theory framework for target location in distributed sensor networks","authors":"K. Chakrabarty, S. Iyengar, H. Qi, E. Cho","doi":"10.1109/ITCC.2001.918778","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918778","url":null,"abstract":"Distributed, real time sensor networks are essential for effective surveillance in the digitized battlefield and for environmental monitoring. We present the first systematic theory that leads to novel sensor deployment strategies for effective surveillance and target location. We represent the sensor field as a grid (two- or three-dimensional) of points (coordinates), and use the term target at a grid point at any instant in time. We use the framework of unidentified codes to determine sensor placement for unique target location. We provide coding-theoretic-bounds on the number of sensors and present methods for determining their placement in the sensor field. We also show that sensor placement for single targets provides asymptotically complete (unambiguous) location of multiple targets.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133454305","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918815
A. Yener
Maximum likelihood (ML) detection problems for several multiuser systems result in nonlinear optimization problems with unacceptably high complexity. One way of achieving near-optimum performance without the complexity associated with the ML detector is using nonlinear programming relaxations to approximate the solution of the ML detection problem at hand. Using this approach, new detectors are formulated and it is observed that some popular suboptimum receivers correspond to relaxations of the ML detectors. We concentrate on two types of systems to demonstrate this concept and evaluate the performance of the resulting detectors.
{"title":"Nonlinear programming based detectors for multiuser systems","authors":"A. Yener","doi":"10.1109/ITCC.2001.918815","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918815","url":null,"abstract":"Maximum likelihood (ML) detection problems for several multiuser systems result in nonlinear optimization problems with unacceptably high complexity. One way of achieving near-optimum performance without the complexity associated with the ML detector is using nonlinear programming relaxations to approximate the solution of the ML detection problem at hand. Using this approach, new detectors are formulated and it is observed that some popular suboptimum receivers correspond to relaxations of the ML detectors. We concentrate on two types of systems to demonstrate this concept and evaluate the performance of the resulting detectors.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133646367","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918826
M. Cannataro, Walter Curci, Maurizio Giglio
Many fields of human activity produce data at an increasing rate, that have to be analysed in an effective and timely way, both locally at the data sources and globally, where decisions have to be taken. Very often in distributed applications, delays originate from the limited network bandwidth or temporary network congestions. To cope with these problems and to satisfy the requirements of online interactive applications (timely availability of data whose quality could eventually be reduced), new compression algorithms and transmission protocols that can trade off the exactness of results against their timeliness, have to be developed. This paper presents a priority-based data transmission protocol for sending large volumes of data (data cubes) over congested networks, that allows the incremental implementation of OLAP applications. A wavelet-based lossy compression algorithm that is the core of the transmission protocol is also presented.
{"title":"A priority-based transmission protocol for congested networks supporting incremental computations","authors":"M. Cannataro, Walter Curci, Maurizio Giglio","doi":"10.1109/ITCC.2001.918826","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918826","url":null,"abstract":"Many fields of human activity produce data at an increasing rate, that have to be analysed in an effective and timely way, both locally at the data sources and globally, where decisions have to be taken. Very often in distributed applications, delays originate from the limited network bandwidth or temporary network congestions. To cope with these problems and to satisfy the requirements of online interactive applications (timely availability of data whose quality could eventually be reduced), new compression algorithms and transmission protocols that can trade off the exactness of results against their timeliness, have to be developed. This paper presents a priority-based data transmission protocol for sending large volumes of data (data cubes) over congested networks, that allows the incremental implementation of OLAP applications. A wavelet-based lossy compression algorithm that is the core of the transmission protocol is also presented.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115576098","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}
Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918796
Faisal Alturki, R. Mersereau
Data hiding in multimedia is the process of secretly embedding information into data sources such as image, video, or audio signals without changing the perceptual quality of the data source. We present a novel blind data hiding technique for hiding information in still images. This technique is based on embedding the information in the transform domain, after decorrelating the samples in the spatial domain. This results in a significant increase in the number of transform coefficients that can be used to transmit the hidden information. The technique is suitable for a variety of data hiding applications such as steganography, data authentication and captioning. The technique achieves a higher and more secure data embedding rate than existing data embedding transform domain techniques developed for these particular applications.
{"title":"A novel approach for increasing security and data embedding capacity in images for data hiding applications","authors":"Faisal Alturki, R. Mersereau","doi":"10.1109/ITCC.2001.918796","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918796","url":null,"abstract":"Data hiding in multimedia is the process of secretly embedding information into data sources such as image, video, or audio signals without changing the perceptual quality of the data source. We present a novel blind data hiding technique for hiding information in still images. This technique is based on embedding the information in the transform domain, after decorrelating the samples in the spatial domain. This results in a significant increase in the number of transform coefficients that can be used to transmit the hidden information. The technique is suitable for a variety of data hiding applications such as steganography, data authentication and captioning. The technique achieves a higher and more secure data embedding rate than existing data embedding transform domain techniques developed for these particular applications.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115202698","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
扫码关注我们
求助内容：
应助结果提醒方式：