This paper discusses the application of object oriented probabilistic relational models to the formulation of situation assessments in the tactical military domain. Object-oriented probabilistic relational models extend traditional attribute based Bayesian networks with the concepts of objects, their attributes and the relationships between them by combining a frame-based representation system with object-oriented Bayesian networks.
{"title":"Probabilistic reasoning techniques for situation assessments","authors":"Catherine Howard, M. Stumptner","doi":"10.1109/ICITA.2005.219","DOIUrl":"https://doi.org/10.1109/ICITA.2005.219","url":null,"abstract":"This paper discusses the application of object oriented probabilistic relational models to the formulation of situation assessments in the tactical military domain. Object-oriented probabilistic relational models extend traditional attribute based Bayesian networks with the concepts of objects, their attributes and the relationships between them by combining a frame-based representation system with object-oriented Bayesian networks.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128956706","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}
A method for skew detection of document images is presented. The method is based on the information of the directions of text lines in the images. To extract the directions of text lines in the images, a measure of line-likeness of texts is adopted, which reflects the strength and direction of a pixel being part of a text line. This measure is applicable to texts of various fonts, sizes, and even languages. The skew angle of the whole image is the consensus among all pixels in the image. Several methods for the consensus are proposed. Experimental results of the method on document images are presented.
{"title":"Skew detection of document images using line structural information","authors":"Chih-Hong Kao, H. Don","doi":"10.1109/ICITA.2005.255","DOIUrl":"https://doi.org/10.1109/ICITA.2005.255","url":null,"abstract":"A method for skew detection of document images is presented. The method is based on the information of the directions of text lines in the images. To extract the directions of text lines in the images, a measure of line-likeness of texts is adopted, which reflects the strength and direction of a pixel being part of a text line. This measure is applicable to texts of various fonts, sizes, and even languages. The skew angle of the whole image is the consensus among all pixels in the image. Several methods for the consensus are proposed. Experimental results of the method on document images are presented.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130208715","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}
In this paper, we propose multistage wavelength conversion by sharing limited range wavelength converters in wavelength division multiplexed (WDM) all-optical packet switching networks. By using multistage wavelength conversion and converter sharing technology expensive resources can be maximally utilized. Our interest is to investigate how converters of lower capability in terms of conversion limit can be effectively utilized for performance improvement rather than using converters of full conversion capability. We summarize the benefits of multistage wavelength conversion and wavelength converter sharing using limited range wavelength converters and demonstrate some outlines for the choice of conversion limit, number of converters, and the number of stages of conversion by simulation. Simulation results dictate that, with wavelength converters fewer than the number of wavelength channels to or from the optical cross-connect, significant improvement in performance in terms of packet loss probability before saturation can be achieved with multistage conversion at some lower limits of conversion.
{"title":"Limited range wavelength converter sharing in WDM networks","authors":"M. M. Rashid, Sugang Xu, Y. Tanaka","doi":"10.1109/ICITA.2005.172","DOIUrl":"https://doi.org/10.1109/ICITA.2005.172","url":null,"abstract":"In this paper, we propose multistage wavelength conversion by sharing limited range wavelength converters in wavelength division multiplexed (WDM) all-optical packet switching networks. By using multistage wavelength conversion and converter sharing technology expensive resources can be maximally utilized. Our interest is to investigate how converters of lower capability in terms of conversion limit can be effectively utilized for performance improvement rather than using converters of full conversion capability. We summarize the benefits of multistage wavelength conversion and wavelength converter sharing using limited range wavelength converters and demonstrate some outlines for the choice of conversion limit, number of converters, and the number of stages of conversion by simulation. Simulation results dictate that, with wavelength converters fewer than the number of wavelength channels to or from the optical cross-connect, significant improvement in performance in terms of packet loss probability before saturation can be achieved with multistage conversion at some lower limits of conversion.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553321","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}
Many efforts in past years have been made to lower the linguistic barriers for non-native English speakers to access the Internet. IDNA (Faltstrom et al., 2003) focuses on access to internationalized domain names (IDN) in a range of scripts that is broader in scope than the original ASCII. However, the use of character variants that have similar appearances and/or interpretations could create confusion. A variant IDL (internationalized domain label), derived from an IDL by replacing some characters with their variants, should match the original IDL. In JET Guidelines (Konishi et al., 2004), it is suggested that zone administrators model this concept of equivalence as an atomic IDL package that contains the variant IDLs generated according to the language variant tables (LVT). In addition to the registered IDL, some of the variant IDLs are activated and stored in the zone files and thus become resolvable. However, an issue of scalability arises when the number of the activated variant IDLs is large. In this paper, we present a mechanism to resolve the variant IDLs in an IDL package into the registered IDL. Specifically, we target Han character variants. Two Han characters are said to be variants of each other if they have the same meaning and are pronounced the same. Furthermore, Han character variants usually have similar appearances. We introduce a new resource record (RR) type, denoted as VarIdx, to associate the variant IDLs with the registered IDL. Experiment results show that a small number of VarIdx RRs are sufficient for enumerating all variant IDLs in an IDL package. We then present a redirection service that uses VarIdx RRs to redirect user requests with variant IDLs to the URLs with the corresponding registered IDLs.
在过去的几年里，为了降低非英语母语人士访问互联网的语言障碍，人们做出了许多努力。IDNA (Faltstrom et al.， 2003)侧重于获取国际化域名(IDN)的一系列脚本，其范围比原始ASCII更广。然而，使用具有相似外观和/或解释的字符变体可能会造成混淆。通过用IDL的变体替换某些字符而从IDL派生出来的变体IDL(国际化域标签)应该与原始IDL匹配。在JET指南(Konishi et al.， 2004)中，建议区域管理员将这种等效概念建模为包含根据语言变体表(LVT)生成的变体IDL的原子IDL包。除了注册的IDL之外，一些变体IDL被激活并存储在区域文件中，因此可以解析。但是，当激活的变体idl数量很大时，就会出现可伸缩性问题。在本文中，我们提出了一种将IDL包中的变体IDL解析为注册IDL的机制。具体来说，我们的目标是汉字变体。两个汉字如果意思相同，发音相同，就被称为彼此的变体。此外，汉字变体通常具有相似的外观。我们引入一个新的资源记录(RR)类型，表示为VarIdx，将变体IDL与注册的IDL关联起来。实验结果表明，少量的VarIdx RRs足以枚举一个IDL包中的所有变体IDL。然后，我们提供了一个重定向服务，该服务使用VarIdx rr将具有可变idl的用户请求重定向到具有相应注册idl的url。
{"title":"A Web redirection service for variant Chinese domain name resolution","authors":"Jeng-Wei Lin, L. Tseng, Jan-Ming Ho, F. Lai","doi":"10.1109/ICITA.2005.50","DOIUrl":"https://doi.org/10.1109/ICITA.2005.50","url":null,"abstract":"Many efforts in past years have been made to lower the linguistic barriers for non-native English speakers to access the Internet. IDNA (Faltstrom et al., 2003) focuses on access to internationalized domain names (IDN) in a range of scripts that is broader in scope than the original ASCII. However, the use of character variants that have similar appearances and/or interpretations could create confusion. A variant IDL (internationalized domain label), derived from an IDL by replacing some characters with their variants, should match the original IDL. In JET Guidelines (Konishi et al., 2004), it is suggested that zone administrators model this concept of equivalence as an atomic IDL package that contains the variant IDLs generated according to the language variant tables (LVT). In addition to the registered IDL, some of the variant IDLs are activated and stored in the zone files and thus become resolvable. However, an issue of scalability arises when the number of the activated variant IDLs is large. In this paper, we present a mechanism to resolve the variant IDLs in an IDL package into the registered IDL. Specifically, we target Han character variants. Two Han characters are said to be variants of each other if they have the same meaning and are pronounced the same. Furthermore, Han character variants usually have similar appearances. We introduce a new resource record (RR) type, denoted as VarIdx, to associate the variant IDLs with the registered IDL. Experiment results show that a small number of VarIdx RRs are sufficient for enumerating all variant IDLs in an IDL package. We then present a redirection service that uses VarIdx RRs to redirect user requests with variant IDLs to the URLs with the corresponding registered IDLs.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132141968","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}
It has been recently shown that local feature approaches to face verification are considerably more robust than holistic approaches, in terms of translations (caused by automatic face localization) and pose variations. In this paper, we first investigate whether features based on local principal component analysis (LPCA) are more discriminative than features based on the 2D discrete cosine transform (2D DCT). We also investigate several methods for modifying the two feature extraction techniques in order to counteract the effects of linear and non-linear illumination changes, without losing discriminative information. Results on the XM2VTS database show that when using a Bayesian classifier based on Gaussian mixture models (GMMs), the performances of 2D DCT and LPCA techniques are quite similar, suggesting that the 2D DCT technique is preferable due to its lower computational complexity. When using 8/spl times/8 blocks, modifying the 2D DCT and LPCA techniques by removing the first coefficient, which is the most affected by illumination changes, enhances robustness with little change in discrimination ability; removing further coefficients causes a noticeable reduction in performance on clean images and provides little gain in robustness. When using the 2D DCT with 16/spl times/16 blocks, the first three coefficients need to be removed in order to achieve good robustness. It is further shown that contrary to previously published results, the use of deltas of low-order coefficients (to alleviate performance losses caused by removing coefficients) can adversely affect robustness.
{"title":"On local features for GMM based face verification","authors":"Conrad Sanderson, M. Saban, Yongsheng Gao","doi":"10.1109/ICITA.2005.194","DOIUrl":"https://doi.org/10.1109/ICITA.2005.194","url":null,"abstract":"It has been recently shown that local feature approaches to face verification are considerably more robust than holistic approaches, in terms of translations (caused by automatic face localization) and pose variations. In this paper, we first investigate whether features based on local principal component analysis (LPCA) are more discriminative than features based on the 2D discrete cosine transform (2D DCT). We also investigate several methods for modifying the two feature extraction techniques in order to counteract the effects of linear and non-linear illumination changes, without losing discriminative information. Results on the XM2VTS database show that when using a Bayesian classifier based on Gaussian mixture models (GMMs), the performances of 2D DCT and LPCA techniques are quite similar, suggesting that the 2D DCT technique is preferable due to its lower computational complexity. When using 8/spl times/8 blocks, modifying the 2D DCT and LPCA techniques by removing the first coefficient, which is the most affected by illumination changes, enhances robustness with little change in discrimination ability; removing further coefficients causes a noticeable reduction in performance on clean images and provides little gain in robustness. When using the 2D DCT with 16/spl times/16 blocks, the first three coefficients need to be removed in order to achieve good robustness. It is further shown that contrary to previously published results, the use of deltas of low-order coefficients (to alleviate performance losses caused by removing coefficients) can adversely affect robustness.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127849571","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}
We investigate the performance analysis for constructing a performance practice support system for instrumental music having ability to tune to players. Especially, we propose a current performing position recognition algorithm based on cellular representation of scores and show the system implemented works robustly and efficiently for the beginners who make various types of mistakes in their practices
{"title":"Performance Analysis for Construction of a Performance Practice Support System","authors":"S. Ozaki, M. Harao, K. Hirata","doi":"10.1109/ICITA.2005.210","DOIUrl":"https://doi.org/10.1109/ICITA.2005.210","url":null,"abstract":"We investigate the performance analysis for constructing a performance practice support system for instrumental music having ability to tune to players. Especially, we propose a current performing position recognition algorithm based on cellular representation of scores and show the system implemented works robustly and efficiently for the beginners who make various types of mistakes in their practices","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121622197","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}
We propose a novel framework that employs correlated digital video and audio watermarking where the watermarking sequence contains video interaction information and media features as a basis towards constructing a secure, self-contained, format independent stream-based scheme for interactive media authoring. We have detailed our methods and illustrate the advantages of this scheme over the traditional meta-tag approach for interactive video authoring. We also identify many of the potential applications that can benefit from this approach. We outline the prototype application and demonstrate the successful implementation within our existing real-time multimedia authoring system, where the new post production video delivering module is based on this framework
{"title":"Stream-Based Interactive Video Language Authoring Using Correlated Audiovisual Watermarking","authors":"R. Xu, Jesse S. Jin, J. G. Allen","doi":"10.1109/ICITA.2005.263","DOIUrl":"https://doi.org/10.1109/ICITA.2005.263","url":null,"abstract":"We propose a novel framework that employs correlated digital video and audio watermarking where the watermarking sequence contains video interaction information and media features as a basis towards constructing a secure, self-contained, format independent stream-based scheme for interactive media authoring. We have detailed our methods and illustrate the advantages of this scheme over the traditional meta-tag approach for interactive video authoring. We also identify many of the potential applications that can benefit from this approach. We outline the prototype application and demonstrate the successful implementation within our existing real-time multimedia authoring system, where the new post production video delivering module is based on this framework","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275036","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}
In order to maintain the high reliability of a computer system, it is necessary to detect the failure leading to a fault. In general, fault can be detected by exploiting time redundancy or spatial redundancy. However, it negatively affects on either hardware cost or processor performance. To solve the cost-performance issue, in this paper, we propose a concept of cost-effective approach to achieve spatial redundancy for dependable processors. In addition, we perform a primly evaluation for the impact of our method on processor performance
{"title":"A Cost Effective Spacial Redundancy with Data-Path Partitioning","authors":"S. Matsusaka, Koji Inoue","doi":"10.1109/ICITA.2005.7","DOIUrl":"https://doi.org/10.1109/ICITA.2005.7","url":null,"abstract":"In order to maintain the high reliability of a computer system, it is necessary to detect the failure leading to a fault. In general, fault can be detected by exploiting time redundancy or spatial redundancy. However, it negatively affects on either hardware cost or processor performance. To solve the cost-performance issue, in this paper, we propose a concept of cost-effective approach to achieve spatial redundancy for dependable processors. In addition, we perform a primly evaluation for the impact of our method on processor performance","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114247053","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}
The royalty rate for Japanese patents is usually 2%-3% in the computer domain. This rate is based on the royalty rate values described in the "Royalty Rate" (published by Japan Institute of Invention and Innovation) and those used by Japanese national holding patents. This paper demonstrates that this conventional royalty is inadequate for large-scale software application systems and large-scale integrations (LSIs), especially the AP system using business method patents. The reason is that the contribution of the invention is very small for these large-scale systems. Moreover, this paper proposes a new method to calculate the royalty rate for large-scale applications in order to resolve these problems. Experimental case analyses show that the proposed method can derive adequate royalty rates that pioneer patents have high royalty rates and that bubble patents have low royalty rates.
{"title":"Royalty rate of business method patents for large scale software applications","authors":"S. Kaneda, Takuya Senbo, K. Fujimoto","doi":"10.1109/ICITA.2005.242","DOIUrl":"https://doi.org/10.1109/ICITA.2005.242","url":null,"abstract":"The royalty rate for Japanese patents is usually 2%-3% in the computer domain. This rate is based on the royalty rate values described in the \"Royalty Rate\" (published by Japan Institute of Invention and Innovation) and those used by Japanese national holding patents. This paper demonstrates that this conventional royalty is inadequate for large-scale software application systems and large-scale integrations (LSIs), especially the AP system using business method patents. The reason is that the contribution of the invention is very small for these large-scale systems. Moreover, this paper proposes a new method to calculate the royalty rate for large-scale applications in order to resolve these problems. Experimental case analyses show that the proposed method can derive adequate royalty rates that pioneer patents have high royalty rates and that bubble patents have low royalty rates.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116680844","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}
In this study, a new algorithm based on some intuitive properties that characterize the structure of minimal paths (MPs), and the relationships between MPs and subpaths are developed to improved sum-of-disjoint products technique (SDP). The proposed algorithm is not only easier to understand and implement, but is also better than the existing best-known SDP based algorithm. The correctness of the proposed algorithm is analyzed and proven. One bench example is illustrated to show how to determine the network reliability with known minimal paths using the proposed SDP.
{"title":"A new sum-of-disjoint-products technique to determine network reliabilities with known minimal paths","authors":"W. Yeh","doi":"10.1109/ICITA.2005.35","DOIUrl":"https://doi.org/10.1109/ICITA.2005.35","url":null,"abstract":"In this study, a new algorithm based on some intuitive properties that characterize the structure of minimal paths (MPs), and the relationships between MPs and subpaths are developed to improved sum-of-disjoint products technique (SDP). The proposed algorithm is not only easier to understand and implement, but is also better than the existing best-known SDP based algorithm. The correctness of the proposed algorithm is analyzed and proven. One bench example is illustrated to show how to determine the network reliability with known minimal paths using the proposed SDP.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123793807","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
扫码关注我们
求助内容：
应助结果提醒方式：