Pub Date : 2002-04-08DOI: 10.1109/ITCC.2002.1000413
R. Newman, N. Bussard, T. Morvan
This paper presents two pieces of work which together form part of a chain of information transformation leading from engineering design models to useable hypermedia technical documentation. The building of such a chain needs to take account of two major constraints, those of efficiency of the transformation process and that of usability of the end result. The first piece of work presented here addresses the first problem by providing a means of automatically simplifying a model to a stage where it is usable as an interactive VRML document. The second piece of work addresses the second issue by investigating and prototyping novel means of presentation which provide greater 'readability' for the resultant models.
{"title":"Information transformations for Web based documentation","authors":"R. Newman, N. Bussard, T. Morvan","doi":"10.1109/ITCC.2002.1000413","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000413","url":null,"abstract":"This paper presents two pieces of work which together form part of a chain of information transformation leading from engineering design models to useable hypermedia technical documentation. The building of such a chain needs to take account of two major constraints, those of efficiency of the transformation process and that of usability of the end result. The first piece of work presented here addresses the first problem by providing a means of automatically simplifying a model to a stage where it is usable as an interactive VRML document. The second piece of work addresses the second issue by investigating and prototyping novel means of presentation which provide greater 'readability' for the resultant models.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"6 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":"134491274","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000368
M. Steinebach, A. Lang, J. Dittmann, Chr. Neubauer
Audio watermarking has become an important technology for the recording and advertisement industry. Today's embedding and detection strategies often rely on digital/ high quality channels, like CD or mp3. However for numerous applications, watermarks surviving noisy analog environments are better suited or even required. Using such schemes allows to identify, audio signals with monitoring devices which are 'listening' to the incoming signals. In the same way, illegal recordings of concerts can be identified. In this paper we describe a test environment for noisy, acoustic, (analog) channels and present results obtained from a particular watermarking scheme. We identify changes in the affected audio material, like frequency response or the amount of noise added to the signal. In order to do automatic robustness evaluations of watermarking schemes, the Stirmark Benchmark environment can be used. We analyze if it is possible to simulate an acoustic, noisy DA/AD environment with filters, quantization and noise generators. Based on the presented test results, we identify the parameters relevant for watermarks to successfully survive noisy acoustic channels and thereby provide valuable hints for audio watermark designers. We also describe a design concept for a DA/AD simulation.
{"title":"Audio watermarking quality evaluation: robustness to DA/AD processes","authors":"M. Steinebach, A. Lang, J. Dittmann, Chr. Neubauer","doi":"10.1109/ITCC.2002.1000368","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000368","url":null,"abstract":"Audio watermarking has become an important technology for the recording and advertisement industry. Today's embedding and detection strategies often rely on digital/ high quality channels, like CD or mp3. However for numerous applications, watermarks surviving noisy analog environments are better suited or even required. Using such schemes allows to identify, audio signals with monitoring devices which are 'listening' to the incoming signals. In the same way, illegal recordings of concerts can be identified. In this paper we describe a test environment for noisy, acoustic, (analog) channels and present results obtained from a particular watermarking scheme. We identify changes in the affected audio material, like frequency response or the amount of noise added to the signal. In order to do automatic robustness evaluations of watermarking schemes, the Stirmark Benchmark environment can be used. We analyze if it is possible to simulate an acoustic, noisy DA/AD environment with filters, quantization and noise generators. Based on the presented test results, we identify the parameters relevant for watermarks to successfully survive noisy acoustic channels and thereby provide valuable hints for audio watermark designers. We also describe a design concept for a DA/AD simulation.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"77 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":"132850911","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000355
J. Calic, E. Izquierdo
Content-based video indexing and retrieval has its foundations in the analyses of the prime video temporal structures. Consequently, technologies for video segmentation and key-frame extraction have become crucial for the development of advanced digital video systems. Conventional algorithms for video partitioning and key-frame extraction are mainly implemented autonomously. By focusing the analysis on compressed video features, this paper introduces a real-time algorithm for scene change detection and key-frame extraction that generates frame difference metrics by analysing the statistics of the macro-block features extracted from an MPEG compressed stream. The key-frame extraction method is implemented using difference metrics in curve simplification by means of a discrete contour evolution algorithm. This approach resulted in a fast and robust algorithm. Results of computer simulations are reported.
{"title":"Efficient key-frame extraction and video analysis","authors":"J. Calic, E. Izquierdo","doi":"10.1109/ITCC.2002.1000355","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000355","url":null,"abstract":"Content-based video indexing and retrieval has its foundations in the analyses of the prime video temporal structures. Consequently, technologies for video segmentation and key-frame extraction have become crucial for the development of advanced digital video systems. Conventional algorithms for video partitioning and key-frame extraction are mainly implemented autonomously. By focusing the analysis on compressed video features, this paper introduces a real-time algorithm for scene change detection and key-frame extraction that generates frame difference metrics by analysing the statistics of the macro-block features extracted from an MPEG compressed stream. The key-frame extraction method is implemented using difference metrics in curve simplification by means of a discrete contour evolution algorithm. This approach resulted in a fast and robust algorithm. Results of computer simulations are reported.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"203 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":"131612031","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000422
Limin Xiang, K. Ushijima, Y. Asahiro
In this paper, e-words are used for coding k-ary trees with n internal nodes. The properties of e-words are discussed in depth, such as the necessary and sufficient condition of e-words, and based on the properties, a loopless algorithm is obtained to generate e-words for k-ary trees in lexicographic order, which is more efficient in both space and time than the previous algorithm. In addition, e-words can also be easily generated in lexicographic order by a recursive algorithm, and in the order with the Strong Minimal Change Property (SMCP) by a loopless algorithm.
{"title":"Coding k-ary trees for efficient loopless generation in lexicographic order","authors":"Limin Xiang, K. Ushijima, Y. Asahiro","doi":"10.1109/ITCC.2002.1000422","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000422","url":null,"abstract":"In this paper, e-words are used for coding k-ary trees with n internal nodes. The properties of e-words are discussed in depth, such as the necessary and sufficient condition of e-words, and based on the properties, a loopless algorithm is obtained to generate e-words for k-ary trees in lexicographic order, which is more efficient in both space and time than the previous algorithm. In addition, e-words can also be easily generated in lexicographic order by a recursive algorithm, and in the order with the Strong Minimal Change Property (SMCP) by a loopless algorithm.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"29 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":"122985278","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000415
H. Selvaraj, M. Rawski, T. Luba
Since modern programmable devices contain embedded memory blocks, there exists the possibility of implementing finite state machines (FSM) using such blocks. However, the size of the memory available in programmable devices is limited. The paper presents a general method for the synthesis of sequential circuits using embedded memory blocks. The method is based on the serial decomposition concept and relies on decomposing the memory block into two blocks: a combinational address modifier and a smaller memory block. An appropriately chosen decomposition strategy may allow reducing the required memory size at the cost of additional logic cells for address modifier implementation. This makes possible the implementation of FSMs that exceed available memory by using embedded memory blocks and additional programmable logic.
{"title":"FSM implementation in embedded memory blocks of programmable logic devices using functional decomposition","authors":"H. Selvaraj, M. Rawski, T. Luba","doi":"10.1109/ITCC.2002.1000415","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000415","url":null,"abstract":"Since modern programmable devices contain embedded memory blocks, there exists the possibility of implementing finite state machines (FSM) using such blocks. However, the size of the memory available in programmable devices is limited. The paper presents a general method for the synthesis of sequential circuits using embedded memory blocks. The method is based on the serial decomposition concept and relies on decomposing the memory block into two blocks: a combinational address modifier and a smaller memory block. An appropriately chosen decomposition strategy may allow reducing the required memory size at the cost of additional logic cells for address modifier implementation. This makes possible the implementation of FSMs that exceed available memory by using embedded memory blocks and additional programmable logic.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"14 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":"115299069","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000369
S. Shirani
Multiple description coding has been studied as an approach for transmission of images over error prone environments. The multiple description coding method proposed takes into account the content of the image and provides the least amount of degradation, caused by loss of descriptors, for those areas of the image which are of greater interest. This is achieved by employing a nonlinear geometrical transform to add redundancy mainly to the area of interest followed by a partitioning of the non-linearly transformed image into sub-images which are coded and transmitted over separate channels. Simulations show that this approach yields exceptional performance even when only one descriptor is received. Moreover the method proposed can be implemented through pre- and postprocessing of the image data, without modification to the source codecs (e.g., JPEG).
{"title":"Error resilient image communication using content-based multiple description coding","authors":"S. Shirani","doi":"10.1109/ITCC.2002.1000369","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000369","url":null,"abstract":"Multiple description coding has been studied as an approach for transmission of images over error prone environments. The multiple description coding method proposed takes into account the content of the image and provides the least amount of degradation, caused by loss of descriptors, for those areas of the image which are of greater interest. This is achieved by employing a nonlinear geometrical transform to add redundancy mainly to the area of interest followed by a partitioning of the non-linearly transformed image into sub-images which are coded and transmitted over separate channels. Simulations show that this approach yields exceptional performance even when only one descriptor is received. Moreover the method proposed can be implemented through pre- and postprocessing of the image data, without modification to the source codecs (e.g., JPEG).","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"18 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":"126955792","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000367
R. Sion
An important parameter in evaluating data hiding methods is hiding capacity (Cohen et al., 1999) i.e. the amount of data that a certain algorithm can "hide" until reaching allowable distortion limits. One fundamental difference between watermarking (Cox et al., 1997; 1999) and generic data hiding resides exactly in the main applicability and descriptions of the two domains. In the digital framework, watermarking algorithms that make use of information hiding techniques have been developed and hiding capacity was naturally used as a metric in evaluating their power to hide information. Whereas the maximal amount of information that a certain algorithm can "hide" (while keeping the data within allowable distortion bounds) is certainly related to the ability to assert ownership in court, it is not directly measuring its power of persuasion, in part also because it does not consider directly the existence and power of watermarking attacks. We show why, due to its particularities, watermarking requires a different metric, more closely related to its ultimate purpose, claiming ownership in a court of law. We define one suitable metric (watermarking power) and show how it relates to derivates of hiding capacity. We prove that there are cases where considering hiding capacity is sub-optimal as a metric in evaluating watermarking methods whereas the metric of watermarking power delivers good results.
评估数据隐藏方法的一个重要参数是隐藏能力(Cohen et al.， 1999)，即某种算法可以“隐藏”的数据量，直到达到允许的失真限制。水印的一个根本区别(Cox et al.， 1997;1999)和通用数据隐藏恰恰存在于这两个领域的主要适用性和描述中。在数字框架下，利用信息隐藏技术的水印算法已经被开发出来，隐藏能力自然被用作评估其隐藏信息能力的一个指标。尽管某种算法可以“隐藏”的最大信息量(同时将数据保持在允许的失真范围内)肯定与在法庭上主张所有权的能力有关，但它并不能直接衡量其说服力，部分原因还在于它没有直接考虑水印攻击的存在和威力。我们展示了为什么，由于其特殊性，水印需要一个不同的度量，与它的最终目的更密切相关，在法庭上声称所有权。我们定义了一个合适的度量(水印能力)，并展示了它与隐藏能力的导数的关系。我们证明了在某些情况下，将隐藏容量作为评估水印方法的指标是次优的，而将水印功率作为评估水印方法的指标则可以获得良好的结果。
{"title":"Power: a metric for evaluating watermarking algorithms","authors":"R. Sion","doi":"10.1109/ITCC.2002.1000367","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000367","url":null,"abstract":"An important parameter in evaluating data hiding methods is hiding capacity (Cohen et al., 1999) i.e. the amount of data that a certain algorithm can \"hide\" until reaching allowable distortion limits. One fundamental difference between watermarking (Cox et al., 1997; 1999) and generic data hiding resides exactly in the main applicability and descriptions of the two domains. In the digital framework, watermarking algorithms that make use of information hiding techniques have been developed and hiding capacity was naturally used as a metric in evaluating their power to hide information. Whereas the maximal amount of information that a certain algorithm can \"hide\" (while keeping the data within allowable distortion bounds) is certainly related to the ability to assert ownership in court, it is not directly measuring its power of persuasion, in part also because it does not consider directly the existence and power of watermarking attacks. We show why, due to its particularities, watermarking requires a different metric, more closely related to its ultimate purpose, claiming ownership in a court of law. We define one suitable metric (watermarking power) and show how it relates to derivates of hiding capacity. We prove that there are cases where considering hiding capacity is sub-optimal as a metric in evaluating watermarking methods whereas the metric of watermarking power delivers good results.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"45 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":"121984853","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000391
Jinho Lee, D. Grossman, R. Orlandic
This paper presents an original information-retrieval engine, called MIRE, for integrating structured data and text. Among other things, MIRE is designed to work in a natural and efficient way with the inherent hierarchies of structured data. While multidimensional access methods have originally been developed for spatial applications, they can be successfully used to index hierarchical structured data and add to an existing information retrieval engine the capability of navigating hierarchical dimensions. To support this capability, MIRE enhances the processing algorithms of an existing multidimensional access method to avoid overflow and support for hierarchical dimensions. Compared to a search engine with multiple indexes for a different type of search, the multidimensional approach shows a significant reduction in the number of page accesses over a large document collection.
{"title":"MIRE: a multidimensional information retrieval engine for structured data and text","authors":"Jinho Lee, D. Grossman, R. Orlandic","doi":"10.1109/ITCC.2002.1000391","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000391","url":null,"abstract":"This paper presents an original information-retrieval engine, called MIRE, for integrating structured data and text. Among other things, MIRE is designed to work in a natural and efficient way with the inherent hierarchies of structured data. While multidimensional access methods have originally been developed for spatial applications, they can be successfully used to index hierarchical structured data and add to an existing information retrieval engine the capability of navigating hierarchical dimensions. To support this capability, MIRE enhances the processing algorithms of an existing multidimensional access method to avoid overflow and support for hierarchical dimensions. Compared to a search engine with multiple indexes for a different type of search, the multidimensional approach shows a significant reduction in the number of page accesses over a large document collection.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"13 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":"122220898","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000380
S. Kwok, Christopher C. Yang
The need for copyright protection has become a detachable requirement for online media e-business as online multimedia businesses and enabling technologies become viable in recent years. Watermarking enables copyright protection in e-business but it also slows down the packaging process for delivery. The requirement of instant delivery is a prime requirement for online business. In the literature, extensive research on watermarking performance has been emphasized on imperceptibility and robustness but not the efficiency factor for online e-business, for example processing time and storage requirement that are crucial to the success of online e-business. We investigate four watermarking schemes derived from one-bit watermarking, multiple-bit watermarking and their combinations in order to identify a viable watermarking scheme that can meet the requirements of online e-business. The performance of these schemes in terms of preparation time, delivery time and storage requirement are measured and reported. Our analysis proves that the watermarking schemes with multiple-bit watermarking can ensure instant delivery with a penalty of some extra storage requirements.
{"title":"Watermarking in online media e-business","authors":"S. Kwok, Christopher C. Yang","doi":"10.1109/ITCC.2002.1000380","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000380","url":null,"abstract":"The need for copyright protection has become a detachable requirement for online media e-business as online multimedia businesses and enabling technologies become viable in recent years. Watermarking enables copyright protection in e-business but it also slows down the packaging process for delivery. The requirement of instant delivery is a prime requirement for online business. In the literature, extensive research on watermarking performance has been emphasized on imperceptibility and robustness but not the efficiency factor for online e-business, for example processing time and storage requirement that are crucial to the success of online e-business. We investigate four watermarking schemes derived from one-bit watermarking, multiple-bit watermarking and their combinations in order to identify a viable watermarking scheme that can meet the requirements of online e-business. The performance of these schemes in terms of preparation time, delivery time and storage requirement are measured and reported. Our analysis proves that the watermarking schemes with multiple-bit watermarking can ensure instant delivery with a penalty of some extra storage requirements.","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":"122441010","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000401
R. Baraglia, P. Palmerini
During their navigation, Web users leave many records of their activity. This huge amount of data can be a useful source of knowledge. Sophisticated data mining processes are needed for this knowledge to be extracted, understood and used. In this paper, we propose a Web usage mining (WUM) system, called SUGGEST, which dynamically generates suggested links to Web pages of potential interest for a user. SUGGEST is designed to efficiently integrate the WUM process with the ordinary Web server functionalities. It can provide useful information to make the user's Web navigation easier and to optimize the Web server's performance. Two quantities are introduced in order to give a measure of the quality of our WUM system.
{"title":"SUGGEST: a Web usage mining system","authors":"R. Baraglia, P. Palmerini","doi":"10.1109/ITCC.2002.1000401","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000401","url":null,"abstract":"During their navigation, Web users leave many records of their activity. This huge amount of data can be a useful source of knowledge. Sophisticated data mining processes are needed for this knowledge to be extracted, understood and used. In this paper, we propose a Web usage mining (WUM) system, called SUGGEST, which dynamically generates suggested links to Web pages of potential interest for a user. SUGGEST is designed to efficiently integrate the WUM process with the ordinary Web server functionalities. It can provide useful information to make the user's Web navigation easier and to optimize the Web server's performance. Two quantities are introduced in order to give a measure of the quality of our WUM system.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"27 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":"133991902","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
扫码关注我们
求助内容：
应助结果提醒方式：