A new design of HDB3 encoder / decoder based on FPGA is proposed to deal with the high complexity and long output delay of the encoder and no error correction function of the decoder which have been implemented so far. The encoder has the function of converting a NRZ code sequence to a HDB3 sequence and the decoder, vice versa. Meanwhile the decoder can correct the errors in the received HDB3 sequence according to a certain rule. Synthesis reports show that the encoder and decoder are both simple–structured; Simulation results show that the encoder has a shorter output delay and the decoder has a better function of error detecting and correcting which greatly improves the reliability of the system.
{"title":"A New Design of HDB3 Encoder and Decoder Based on FPGA","authors":"Yang Zhang, Xiumin Wang, Yuduo Wang","doi":"10.1109/HIS.2009.48","DOIUrl":"https://doi.org/10.1109/HIS.2009.48","url":null,"abstract":"A new design of HDB3 encoder / decoder based on FPGA is proposed to deal with the high complexity and long output delay of the encoder and no error correction function of the decoder which have been implemented so far. The encoder has the function of converting a NRZ code sequence to a HDB3 sequence and the decoder, vice versa. Meanwhile the decoder can correct the errors in the received HDB3 sequence according to a certain rule. Synthesis reports show that the encoder and decoder are both simple–structured; Simulation results show that the encoder has a shorter output delay and the decoder has a better function of error detecting and correcting which greatly improves the reliability of the system.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124485682","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}
Robin K. Chou, M. Huang, Jun-Biao Lin, Jen Tsung Hsu
We try to reconcile the findings of prior size effect studies by re-examining the issue with different time periods, regression methods, and database selection. We test whether the size effect varies in relation to the time period, whether extreme observations cause the size effect, by experimenting with different regression methods, and whether the survivorship bias in the COMPUSTAT database induces the size effect. It is found that the size effect is highly significant for data from the earlier time period, but its significance is noticeably reduced for the later time period. Extreme returns cannot fully account for the size effect, because the effect remains strong in the earlier time period even when the extreme observations are trimmed. Finally, we do not find any evidence indicating that the survivorship bias in the COMPUSTAT database is responsible for the size effect.
{"title":"The Consistency of Size Effect: Time Periods, Regression Methods, and Database Selection","authors":"Robin K. Chou, M. Huang, Jun-Biao Lin, Jen Tsung Hsu","doi":"10.1109/HIS.2009.24","DOIUrl":"https://doi.org/10.1109/HIS.2009.24","url":null,"abstract":"We try to reconcile the findings of prior size effect studies by re-examining the issue with different time periods, regression methods, and database selection. We test whether the size effect varies in relation to the time period, whether extreme observations cause the size effect, by experimenting with different regression methods, and whether the survivorship bias in the COMPUSTAT database induces the size effect. It is found that the size effect is highly significant for data from the earlier time period, but its significance is noticeably reduced for the later time period. Extreme returns cannot fully account for the size effect, because the effect remains strong in the earlier time period even when the extreme observations are trimmed. Finally, we do not find any evidence indicating that the survivorship bias in the COMPUSTAT database is responsible for the size effect.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121647929","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 Automatic Question Answering System, topic identification is usually based on relevancy computation of sentences. This paper introduces an approach to compute topic relevancy. Using the semantic computation in HowNet, the relevancy of sentences can be calculated. The topic relevancy of sentences can be calculated through the computation of relevancy between words of sentence and subject words. Experimental results show the effectiveness of the method.
{"title":"Research on Topic Relevancy of Sentences Based on HowNet Semantic Computation","authors":"Jinzhong Xu, Jie Liu, Xiaoming Liu","doi":"10.1109/HIS.2009.150","DOIUrl":"https://doi.org/10.1109/HIS.2009.150","url":null,"abstract":"In Automatic Question Answering System, topic identification is usually based on relevancy computation of sentences. This paper introduces an approach to compute topic relevancy. Using the semantic computation in HowNet, the relevancy of sentences can be calculated. The topic relevancy of sentences can be calculated through the computation of relevancy between words of sentence and subject words. Experimental results show the effectiveness of the method.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122532308","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}
Normalization theory is necessary for designing a good XML document. A good document means that it has minimal redundancy. The research on XML functional dependency and normalization is still an open problem. This paper first presents a path language of XML model, then proposes a new kind of XML functional dependency (XFD) that has stronger expression ability to XML functional dependency that can result in redundancies. In this paper, the problems of XFD logical implication and XFD closure are studied and a group of the corresponding inference rules is proposed. Based on the XFD, a kind of XML normal form (XNF) and an algorithm converting into XNF are also proposed in this paper.
{"title":"XML Functional Dependency and Schema Normalization","authors":"Xiangguo Zhao, Junchang Xin, Ende Zhang","doi":"10.1109/HIS.2009.276","DOIUrl":"https://doi.org/10.1109/HIS.2009.276","url":null,"abstract":"Normalization theory is necessary for designing a good XML document. A good document means that it has minimal redundancy. The research on XML functional dependency and normalization is still an open problem. This paper first presents a path language of XML model, then proposes a new kind of XML functional dependency (XFD) that has stronger expression ability to XML functional dependency that can result in redundancies. In this paper, the problems of XFD logical implication and XFD closure are studied and a group of the corresponding inference rules is proposed. Based on the XFD, a kind of XML normal form (XNF) and an algorithm converting into XNF are also proposed in this paper.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"571 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124213638","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}
Singular rough sets is defined by R-element equivalence class, which has dynamic characteristic. By engrafting, crossing, and penetrating between information security theory and singular rough sets, singular rough decision is given, furthermore secure transmission of decision conclusion is also presented in this paper. The fusion and share between singular rough sets and information security theory is a new research direction of the application in information system.
{"title":"Singular Rough Decision and Secure Transmission of Decision Conclusion","authors":"Haiqing Hu, Chong Li, Chunmei Li","doi":"10.1109/HIS.2009.136","DOIUrl":"https://doi.org/10.1109/HIS.2009.136","url":null,"abstract":"Singular rough sets is defined by R-element equivalence class, which has dynamic characteristic. By engrafting, crossing, and penetrating between information security theory and singular rough sets, singular rough decision is given, furthermore secure transmission of decision conclusion is also presented in this paper. The fusion and share between singular rough sets and information security theory is a new research direction of the application in information system.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233210","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 JPEG compression method is one of the most popular compression schemes. There are many hardware and software systems based on the JPEG compression standard.This is an indication that the format is still very important before these systems become outdate. This paper presents an adaptive regression method applied to the standard JPEG compression for archiving higher compression ratios. Besides,an interesting coding scheme, Golomb-Rice coding, is introduced also for improve the JPEG standard. Since the coding scheme is not based on frequency analysis from certain of images to gain a codebook, the decoded images that are encoded with this scheme are assured in average quality. The standard JPEG compression scheme can import these two for higher compression rates or wider application fields.
{"title":"An Enhancement of JPEG Still Image Compression with Adaptive Linear Regression and Golomb-Rice Coding","authors":"Chinchen Chang, Y. Lai","doi":"10.1109/HIS.2009.220","DOIUrl":"https://doi.org/10.1109/HIS.2009.220","url":null,"abstract":"The JPEG compression method is one of the most popular compression schemes. There are many hardware and software systems based on the JPEG compression standard.This is an indication that the format is still very important before these systems become outdate. This paper presents an adaptive regression method applied to the standard JPEG compression for archiving higher compression ratios. Besides,an interesting coding scheme, Golomb-Rice coding, is introduced also for improve the JPEG standard. Since the coding scheme is not based on frequency analysis from certain of images to gain a codebook, the decoded images that are encoded with this scheme are assured in average quality. The standard JPEG compression scheme can import these two for higher compression rates or wider application fields.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593590","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}
Yong Zhang, Qingdong Du, Shidong Yu, Jeng-Shyang Pan
Fuzzy information fusion methods are adopted widely to resolve the complicated nonlinear problems in recent years. This paper proposes a fusion learning algorithm of radial basis function (RBF) neural network based on fuzzy evolution Kalman filtering. By using this proposed method, monitoring data are extracted and optimized in mine safety monitoring, and Matlab simulation results are analyzed. The results show that this method has feasibility and rapid learning efficiency, which can improve precision and reliability in mine monitoring systems.
{"title":"RBF Neural Network Based on Fuzzy Evolution Kalman Filtering and Application in Mine Safety Monitoring","authors":"Yong Zhang, Qingdong Du, Shidong Yu, Jeng-Shyang Pan","doi":"10.1109/HIS.2009.96","DOIUrl":"https://doi.org/10.1109/HIS.2009.96","url":null,"abstract":"Fuzzy information fusion methods are adopted widely to resolve the complicated nonlinear problems in recent years. This paper proposes a fusion learning algorithm of radial basis function (RBF) neural network based on fuzzy evolution Kalman filtering. By using this proposed method, monitoring data are extracted and optimized in mine safety monitoring, and Matlab simulation results are analyzed. The results show that this method has feasibility and rapid learning efficiency, which can improve precision and reliability in mine monitoring systems.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127665385","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}
Schema-free query processing has become a key technique of XML query for the absence of structural information or over multiple data sources. It is an important issue to effectively and efficiently filter out correct results from many meaningless results. To solve the basic problem of what are meaningful results, we propose a structure-based model for meaningful result determination. This model covers more correct results than typical model like Interconnection- Relationship and MLCAS. The extensive experiments show that our approach has better querying quality for real XML documents.
{"title":"Effectively Answering Schema-Free XML Queries over Document-Centric Data","authors":"Xiaoli Li, Xiaoguang Li, Baoyan Song","doi":"10.1109/HIS.2009.267","DOIUrl":"https://doi.org/10.1109/HIS.2009.267","url":null,"abstract":"Schema-free query processing has become a key technique of XML query for the absence of structural information or over multiple data sources. It is an important issue to effectively and efficiently filter out correct results from many meaningless results. To solve the basic problem of what are meaningful results, we propose a structure-based model for meaningful result determination. This model covers more correct results than typical model like Interconnection- Relationship and MLCAS. The extensive experiments show that our approach has better querying quality for real XML documents.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127669493","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 automatic recognition of unknown words is an important problem in Chinese information processing. Based on the characteristics of words, this paper proposes a method to recognize new words using high frequent strings. Firstly, the high frequent strings from each single document are extracted as candidate strings. Then the strings that cannot satisfy the characteristics of word’s distribution and word’s independently usage are removed. Finally, segment the entire corpus with these candidate strings, and count the word-frequency for further filtering. Experimental results show that, on the documents about basketball downloaded from Zaobao Newspaper, this method achieves an F-score of 79.39%.
{"title":"Chinese Unknown Words Extraction Based on Word-Level Characteristics","authors":"Wenbo Pang, Xiaozhong Fan, Yijun Gu, Jiangde Yu","doi":"10.1109/HIS.2009.77","DOIUrl":"https://doi.org/10.1109/HIS.2009.77","url":null,"abstract":"The automatic recognition of unknown words is an important problem in Chinese information processing. Based on the characteristics of words, this paper proposes a method to recognize new words using high frequent strings. Firstly, the high frequent strings from each single document are extracted as candidate strings. Then the strings that cannot satisfy the characteristics of word’s distribution and word’s independently usage are removed. Finally, segment the entire corpus with these candidate strings, and count the word-frequency for further filtering. Experimental results show that, on the documents about basketball downloaded from Zaobao Newspaper, this method achieves an F-score of 79.39%.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121020116","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, a new method of image enhancement, which only depends on the difference of grey values of adjacency flat zones of an image, is proposed according to the theory of morphological reconstruction. First of all, a non-idempotent connected operator which can be the criterion for multi-scale enhancement is defined and the criterion is a key to enhancement of an image. Subsequently, the grey values in same the simple connected zones of an image are enhanced overall so the way can keep the immovability of the image contour. At last the connected zones of an image and their relations are described and the way of the multi-scale morphological reconstruction enhancement for an image is implemented by using maximum tree or minimum tree structure. Lots of experimental results indicate that this method can not only stretch the contrast according to the character of gray level of connected zones of an image, but also protect the relations of gray level of connected zones. It’s an effective enhancement method of an image.
{"title":"A new Approach of Image Enhancement Based on Multi-scale Morphological Reconstruction","authors":"Shu Yang, Cairong Wang, Liguo Deng","doi":"10.1109/HIS.2009.30","DOIUrl":"https://doi.org/10.1109/HIS.2009.30","url":null,"abstract":"In this paper, a new method of image enhancement, which only depends on the difference of grey values of adjacency flat zones of an image, is proposed according to the theory of morphological reconstruction. First of all, a non-idempotent connected operator which can be the criterion for multi-scale enhancement is defined and the criterion is a key to enhancement of an image. Subsequently, the grey values in same the simple connected zones of an image are enhanced overall so the way can keep the immovability of the image contour. At last the connected zones of an image and their relations are described and the way of the multi-scale morphological reconstruction enhancement for an image is implemented by using maximum tree or minimum tree structure. Lots of experimental results indicate that this method can not only stretch the contrast according to the character of gray level of connected zones of an image, but also protect the relations of gray level of connected zones. It’s an effective enhancement method of an image.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116425444","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
扫码关注我们
求助内容：
应助结果提醒方式：