Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918854
M. Hata, E. Yamaguchi, Y. Hamasuna, Toshio Ishizaka, I. Takumi
The new high-dimensional torus knot code with respect to its geometrical structure has been studied. The special features of the code are presented. (1) The code block is wound up into a small, compact code ball, so the code passes hardly damaged through the channel of a dense shower of error-making disturbances. (2) The torus knot winding works as block-size interleaving, which distributes the received burst errors randomly in the parity check cycles, so the code exhibits excellent burst error correction capability. (3) Majority logic decoding of each code digit based on the erroneous parity lines can be made up of a high-speed logic circuit thanks to the cyclical properties of the code parity check function. The four-dimensional, size-five 4Dm5-code was burned onto a 50-kilogate, 0.6-micron-order VLSI chip. The code block length and the transmission rate are 625 bits and 0.41, respectively. It was operated at a clock speed of 50 MHz, with a throughput of 6.25 Gbps. Through 100000 block trials, it was proven that the chip can perfectly correct a mean BER of 0.021 for burst and random mixed error situations.
{"title":"High performance error correcting code of the high-dimensional discrete torus knot","authors":"M. Hata, E. Yamaguchi, Y. Hamasuna, Toshio Ishizaka, I. Takumi","doi":"10.1109/ITCC.2001.918854","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918854","url":null,"abstract":"The new high-dimensional torus knot code with respect to its geometrical structure has been studied. The special features of the code are presented. (1) The code block is wound up into a small, compact code ball, so the code passes hardly damaged through the channel of a dense shower of error-making disturbances. (2) The torus knot winding works as block-size interleaving, which distributes the received burst errors randomly in the parity check cycles, so the code exhibits excellent burst error correction capability. (3) Majority logic decoding of each code digit based on the erroneous parity lines can be made up of a high-speed logic circuit thanks to the cyclical properties of the code parity check function. The four-dimensional, size-five 4Dm5-code was burned onto a 50-kilogate, 0.6-micron-order VLSI chip. The code block length and the transmission rate are 625 bits and 0.41, respectively. It was operated at a clock speed of 50 MHz, with a throughput of 6.25 Gbps. Through 100000 block trials, it was proven that the chip can perfectly correct a mean BER of 0.021 for burst and random mixed error situations.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"107 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":"126063647","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.918777
M. Freytes, C. Rodríguez, C. Marqués
Wireless video services in packet-switched environments constitute a significant challenge. While radio channels present limited capacity high error rates and time-varying and asymmetric propagation properties, video applications are bandwidth-killing, error-sensitive and delay-intolerant. This situation forces wireless video systems to dynamically adapt to changes in the network resources. In the recent past there have been some papers investigating video transmission over wireless networks (H. Liu and M. El Zarki, 1997; N. Chan and P.T. Mathiopoulos, 2000), performance of the transfer protocols proposed in the IEEE 802.11 standard (H.S. Chhaya and S. Gupta, 1996; J. Weinmiller et al., 1997), and real time video communications in packet-switched infrastructure networks (P. Bahl, 1998). However, no previous experimental work on video conferencing systems for IEEE 802.11 Ad Hoc WLANs supporting IP multicast extensions has been reported so far. The paper describes Kinesis, an H.263+video transmission system for 802.11 network. Kinesis supports IP multicast extension and implements real time transport protocols to manage synchronization and QoS issues. We focus on the system architecture as a general communication framework for distributed and interactive audiovisual applications. Kinesis has been tested under different working conditions, performing H.263+ video sequences with excellent results.
分组交换环境中的无线视频服务构成了一个重大挑战。虽然无线信道具有有限的容量、高错误率、时变和非对称传播特性，但视频应用具有带宽消耗、错误敏感和延迟不容性。这种情况迫使无线视频系统动态地适应网络资源的变化。最近有一些研究无线网络视频传输的论文(H. Liu和M. El Zarki, 1997;N. Chan和P.T. Mathiopoulos, 2000)， IEEE 802.11标准中提出的传输协议的性能(H.S. Chhaya和S. Gupta, 1996;J. Weinmiller等人，1997)，以及分组交换基础设施网络中的实时视频通信(P. Bahl, 1998)。然而，到目前为止，还没有关于IEEE 802.11 Ad Hoc wlan支持IP多播扩展的视频会议系统的实验工作的报道。介绍了基于802.11网络的H.263+视频传输系统Kinesis。Kinesis支持IP多播扩展，并实现实时传输协议来管理同步和QoS问题。我们关注系统架构作为分布式和交互式视听应用程序的通用通信框架。kineesis在不同的工作条件下进行了测试，执行H.263+视频序列，效果优异。
{"title":"Real-time H.263+ video transmission on 802.11 wireless LANs","authors":"M. Freytes, C. Rodríguez, C. Marqués","doi":"10.1109/ITCC.2001.918777","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918777","url":null,"abstract":"Wireless video services in packet-switched environments constitute a significant challenge. While radio channels present limited capacity high error rates and time-varying and asymmetric propagation properties, video applications are bandwidth-killing, error-sensitive and delay-intolerant. This situation forces wireless video systems to dynamically adapt to changes in the network resources. In the recent past there have been some papers investigating video transmission over wireless networks (H. Liu and M. El Zarki, 1997; N. Chan and P.T. Mathiopoulos, 2000), performance of the transfer protocols proposed in the IEEE 802.11 standard (H.S. Chhaya and S. Gupta, 1996; J. Weinmiller et al., 1997), and real time video communications in packet-switched infrastructure networks (P. Bahl, 1998). However, no previous experimental work on video conferencing systems for IEEE 802.11 Ad Hoc WLANs supporting IP multicast extensions has been reported so far. The paper describes Kinesis, an H.263+video transmission system for 802.11 network. Kinesis supports IP multicast extension and implements real time transport protocols to manage synchronization and QoS issues. We focus on the system architecture as a general communication framework for distributed and interactive audiovisual applications. Kinesis has been tested under different working conditions, performing H.263+ video sequences with excellent results.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"2013 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":"127325938","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.918837
Jong-Nam Kim, Byung-Ha Ahn
To reduce the amount of computation of the full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without degradation of predicted images as in conventional FS. The computational reduction without any degradation in the predicted image comes from fast removal of impossible motion vectors. We obtain faster removal of inappropriate motion vectors using efficient matching units from the localization of complex area in image data. In this paper, we show three properties in block matching of motion estimation. Experimentally, we reduce unnecessary computations by about 30% with our algorithm compared with the conventional fast matching scan algorithm.
{"title":"Lossless computational reduction of full search algorithm in motion estimation using appropriate matching unit from image localization","authors":"Jong-Nam Kim, Byung-Ha Ahn","doi":"10.1109/ITCC.2001.918837","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918837","url":null,"abstract":"To reduce the amount of computation of the full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without degradation of predicted images as in conventional FS. The computational reduction without any degradation in the predicted image comes from fast removal of impossible motion vectors. We obtain faster removal of inappropriate motion vectors using efficient matching units from the localization of complex area in image data. In this paper, we show three properties in block matching of motion estimation. Experimentally, we reduce unnecessary computations by about 30% with our algorithm compared with the conventional fast matching scan algorithm.","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":"122523466","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.918811
Yi Sun
The optimum multiuser detector achieves global maximum likelihood and has a complexity growing exponentially with the number of users. We propose the local maximum likelihood (LML) multiuser detectors with an arbitrary neighborhood size. As the neighborhood size is one, two, etc., up to the total number of users, the computational complexity of the LML detector is linear quadratic, etc., up to exponential in the total number of users. Every LML detector is associated with a local minimum error probability defined with the corresponding neighborhood size. A family of local-maximum-likelihood likelihood-ascent-search (LMLAS) detectors is proposed, each of which is shown to be an LML detector. An LMLAS detector monotonically increases likelihood step by step, and thus converges to an LML point in a finite number of search steps with probability one. Following any detector, an LMLAS detector can reduce the error probability of the initial detector to a local minimum or not change it when the initial detector is an LML detector with the same or larger neighborhood size with probability one.
{"title":"Local maximum likelihood multiuser detection for CDMA communications","authors":"Yi Sun","doi":"10.1109/ITCC.2001.918811","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918811","url":null,"abstract":"The optimum multiuser detector achieves global maximum likelihood and has a complexity growing exponentially with the number of users. We propose the local maximum likelihood (LML) multiuser detectors with an arbitrary neighborhood size. As the neighborhood size is one, two, etc., up to the total number of users, the computational complexity of the LML detector is linear quadratic, etc., up to exponential in the total number of users. Every LML detector is associated with a local minimum error probability defined with the corresponding neighborhood size. A family of local-maximum-likelihood likelihood-ascent-search (LMLAS) detectors is proposed, each of which is shown to be an LML detector. An LMLAS detector monotonically increases likelihood step by step, and thus converges to an LML point in a finite number of search steps with probability one. Following any detector, an LMLAS detector can reduce the error probability of the initial detector to a local minimum or not change it when the initial detector is an LML detector with the same or larger neighborhood size with probability one.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"29 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":"129362573","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.918829
C. Makris, A. Tsakalidis, B. Vassiliadis, N. Bogonikolos
The amount of structured information available in Internet sources is rapidly increasing. This information includes commercial databases on product information and information on e-services forming the so-called e-shops. However, the process of using this information has become more complicated, and can sometimes be tedious for users with different goals, interests, levels of expertise, abilities and preferences. This paper deals with the definition of an architectural framework for intelligent, adaptive and personalised navigation within large hypertext electronic commerce environments.
{"title":"Adapting information presentation and retrieval through user modelling","authors":"C. Makris, A. Tsakalidis, B. Vassiliadis, N. Bogonikolos","doi":"10.1109/ITCC.2001.918829","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918829","url":null,"abstract":"The amount of structured information available in Internet sources is rapidly increasing. This information includes commercial databases on product information and information on e-services forming the so-called e-shops. However, the process of using this information has become more complicated, and can sometimes be tedious for users with different goals, interests, levels of expertise, abilities and preferences. This paper deals with the definition of an architectural framework for intelligent, adaptive and personalised navigation within large hypertext electronic commerce environments.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"28 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":"127134482","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.918767
Qibin Sun, Peirong Feng, R. Deng
We present a novel and simple optical watermarking system aiming at overriding some practical problems when the state-of-the art digital watermarking techniques are applied to authenticate printed documents. We name our technique optical watermarking differing from traditional digital watermarking in the sense that the watermark extraction is done by some optical and visual means like a photocopier, while no digitization is required. The system security is guaranteed by adopting a content-based key share scheme originated from visual cryptography. The non-obtrusiveness effect of the watermarked document is achieved by modulating the watermark into a higher resolution grating level. Experimental results demonstrate the availability and practicality of the proposed approach.
{"title":"An optical watermarking solution for authenticating printed documents","authors":"Qibin Sun, Peirong Feng, R. Deng","doi":"10.1109/ITCC.2001.918767","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918767","url":null,"abstract":"We present a novel and simple optical watermarking system aiming at overriding some practical problems when the state-of-the art digital watermarking techniques are applied to authenticate printed documents. We name our technique optical watermarking differing from traditional digital watermarking in the sense that the watermark extraction is done by some optical and visual means like a photocopier, while no digitization is required. The system security is guaranteed by adopting a content-based key share scheme originated from visual cryptography. The non-obtrusiveness effect of the watermarked document is achieved by modulating the watermark into a higher resolution grating level. Experimental results demonstrate the availability and practicality of the proposed approach.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"19 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":"132988281","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.918817
P. Montessoro, D. Pierattoni
Computer networks require complex solutions for traffic shaping and for bandwidth management on links and switching nodes, in order to provide a reliable QoS-based infrastructure for multimedia and bandwidth-on-demand applications. A simpler and lightweight solution could be reached by a new approach in designing the network protocols. The evolution of the hardware technology will make available faster processing units and larger memories for network devices; this could lead to a radical change of paradigm in network design if a long term research plan for innovative network architectures became popular in the research community. The wide variety of arguments to be investigated requires a multidisciplinary approach, possibly involving several research groups worldwide from research institutions and industrial R&D. The main purpose of the article is to suggest some guidelines for designing an innovative architecture for computer networks. Our proposal descends from a circumstantial survey of existing technologies, and offers a general framework for individuating and approaching research topics of common interest in the networking environment.
{"title":"Advanced research issues for tomorrow's multimedia networks","authors":"P. Montessoro, D. Pierattoni","doi":"10.1109/ITCC.2001.918817","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918817","url":null,"abstract":"Computer networks require complex solutions for traffic shaping and for bandwidth management on links and switching nodes, in order to provide a reliable QoS-based infrastructure for multimedia and bandwidth-on-demand applications. A simpler and lightweight solution could be reached by a new approach in designing the network protocols. The evolution of the hardware technology will make available faster processing units and larger memories for network devices; this could lead to a radical change of paradigm in network design if a long term research plan for innovative network architectures became popular in the research community. The wide variety of arguments to be investigated requires a multidisciplinary approach, possibly involving several research groups worldwide from research institutions and industrial R&D. The main purpose of the article is to suggest some guidelines for designing an innovative architecture for computer networks. Our proposal descends from a circumstantial survey of existing technologies, and offers a general framework for individuating and approaching research topics of common interest in the networking environment.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"32 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941464","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.918876
Chung-Ping Wu, C.-C. Jay Kuo
A speech content integrity verification scheme integrated with ITU G.723.1 speech coding to minimize the total computational cost is proposed in this research. Speech features relevant to the semantic meaning are extracted, encrypted and attached as the header information. This scheme is not only much faster than cryptographic bitstream integrity algorithms, but also more compatible with a variable of applications. The speech signal could go through recompression, amplification, transcoding, re-sampling, D/A and A/D conversion and minor white noise pollution without triggering the verification alarm.
{"title":"Speech content integrity verification integrated with ITU G.723.1 speech coding","authors":"Chung-Ping Wu, C.-C. Jay Kuo","doi":"10.1109/ITCC.2001.918876","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918876","url":null,"abstract":"A speech content integrity verification scheme integrated with ITU G.723.1 speech coding to minimize the total computational cost is proposed in this research. Speech features relevant to the semantic meaning are extracted, encrypted and attached as the header information. This scheme is not only much faster than cryptographic bitstream integrity algorithms, but also more compatible with a variable of applications. The speech signal could go through recompression, amplification, transcoding, re-sampling, D/A and A/D conversion and minor white noise pollution without triggering the verification alarm.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"5 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":"128978139","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.918785
P. Havinga, G. Smit
Presents a QoS (quality of service) scheduler that assigns bandwidth over a wireless channel such that the amount of energy spent by a mobile device is minimized, while maintaining the QoS of the connections. Energy efficiency is an important issue for mobile computers, since they must rely on their batteries. We have designed and implemented an energy-efficient architecture and MAC protocol for wireless multimedia traffic. The scheduling is based on two mechanisms: (1) short-term transmission frame scheduling that concatenates the uplink and downlink traffic of a mobile device, and (2) long-term scheduling that tries to collect traffic as much as possible within the QoS requirements of the connections. The result is that the transceiver can be in a low-power operating mode for an extended period of time and that the number of operating mode transitions is reduced.
{"title":"QoS scheduling for energy-efficient wireless communication","authors":"P. Havinga, G. Smit","doi":"10.1109/ITCC.2001.918785","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918785","url":null,"abstract":"Presents a QoS (quality of service) scheduler that assigns bandwidth over a wireless channel such that the amount of energy spent by a mobile device is minimized, while maintaining the QoS of the connections. Energy efficiency is an important issue for mobile computers, since they must rely on their batteries. We have designed and implemented an energy-efficient architecture and MAC protocol for wireless multimedia traffic. The scheduling is based on two mechanisms: (1) short-term transmission frame scheduling that concatenates the uplink and downlink traffic of a mobile device, and (2) long-term scheduling that tries to collect traffic as much as possible within the QoS requirements of the connections. The result is that the transceiver can be in a low-power operating mode for an extended period of time and that the number of operating mode transitions is reduced.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"31 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":"125726210","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.918768
Nazli Goharian, D. Grossman, T. El-Ghazawi
Documents, both internal and related publicly available, are now considered a corporate asset. The potential to efficiently and accurately search such documents is of great significance. We demonstrate the application of sparse matrix-vector multiplication algorithms for text storage and retrieval as a means of supporting efficient and accurate text processing. As many parallel sparse matrix-vector multiplication algorithms exist, such an information retrieval approach lends itself to parallelism. This enables us to attack the problem of parallel information retrieval, which has resisted good scalability. We use sparse matrix compression algorithms and compare the storage of a subcollection of the commonly used NIST TREC corpus with a traditional inverted index. We demonstrate query processing using a sparse matrix-vector multiplication algorithm. Our results indicate that our approach saves approximately 35% of the total storage requirements for the inverted index. Additionally to improve accuracy, we develop a novel matrix based relevance feedback technique as well as a proximity search algorithm. The results of our experiment to incorporate proximity search capability into the system also indicate 35% less storage for the sparse matrix over the inverted index.
{"title":"Enterprise text processing: a sparse matrix approach","authors":"Nazli Goharian, D. Grossman, T. El-Ghazawi","doi":"10.1109/ITCC.2001.918768","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918768","url":null,"abstract":"Documents, both internal and related publicly available, are now considered a corporate asset. The potential to efficiently and accurately search such documents is of great significance. We demonstrate the application of sparse matrix-vector multiplication algorithms for text storage and retrieval as a means of supporting efficient and accurate text processing. As many parallel sparse matrix-vector multiplication algorithms exist, such an information retrieval approach lends itself to parallelism. This enables us to attack the problem of parallel information retrieval, which has resisted good scalability. We use sparse matrix compression algorithms and compare the storage of a subcollection of the commonly used NIST TREC corpus with a traditional inverted index. We demonstrate query processing using a sparse matrix-vector multiplication algorithm. Our results indicate that our approach saves approximately 35% of the total storage requirements for the inverted index. Additionally to improve accuracy, we develop a novel matrix based relevance feedback technique as well as a proximity search algorithm. The results of our experiment to incorporate proximity search capability into the system also indicate 35% less storage for the sparse matrix over the inverted index.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"10 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":"126387662","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
扫码关注我们
求助内容：
应助结果提醒方式：