Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5688009
Xiang Qiu, Li Zhang, Xiaoli Lian
Exception handling mechanism in modern programming languages is frequently used to build robust systems. However, it presents more daze for software developers because of exception propagation. Centering on the question: “For raising exception, how to identify where handles the exception?” we analyze the dependency between exception propagation and method call. Then associating the method with exception types by the relationship of throw (declared explicitly in method signature) or catch, this paper builds the Software Extended Dependency Graph and proposes a static exception propagation path extraction algorithm, so we can analyze exception propagation hops, the exception hierarchy and exception propagation boundary.
{"title":"Static analysis for java exception propagation structure","authors":"Xiang Qiu, Li Zhang, Xiaoli Lian","doi":"10.1109/PIC.2010.5688009","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688009","url":null,"abstract":"Exception handling mechanism in modern programming languages is frequently used to build robust systems. However, it presents more daze for software developers because of exception propagation. Centering on the question: “For raising exception, how to identify where handles the exception?” we analyze the dependency between exception propagation and method call. Then associating the method with exception types by the relationship of throw (declared explicitly in method signature) or catch, this paper builds the Software Extended Dependency Graph and proposes a static exception propagation path extraction algorithm, so we can analyze exception propagation hops, the exception hierarchy and exception propagation boundary.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114247818","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687956
Binxiang Liu, Hailin Li, Xiang Cheng
Method of information process based on test mining and segmentation technology is provided, which uses the relative principles in the filed of test mining and word segmentation to preprocess and transform the information from internet. The problem of large data dimension caused by the redundancy characters extracted from the test is settled and it improves the performance of the CE arithmetic. Finally, the results are showed and the burden of the CPU and memory of the server which is brought by the of the ceramic company testify that this method have the characters of intelligent behavior, precise result, beautiful interface, easy operation and synchronization of running.
{"title":"Method of information process based on test mining and word segmentation","authors":"Binxiang Liu, Hailin Li, Xiang Cheng","doi":"10.1109/PIC.2010.5687956","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687956","url":null,"abstract":"Method of information process based on test mining and segmentation technology is provided, which uses the relative principles in the filed of test mining and word segmentation to preprocess and transform the information from internet. The problem of large data dimension caused by the redundancy characters extracted from the test is settled and it improves the performance of the CE arithmetic. Finally, the results are showed and the burden of the CPU and memory of the server which is brought by the of the ceramic company testify that this method have the characters of intelligent behavior, precise result, beautiful interface, easy operation and synchronization of running.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114434135","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687464
Jianping Feng, Lihua Wu, Yu Zhang
In this paper, the life characteristics of a computer virus and algorithm characteristics are studied. A evolution model of computer virus based on immune genetic algorithm, which draws inspirations from artificial life, is proposed. The formal definition of computer virus is introduced, and the evolution operators which include selection operator, crossover operator, mutation operator and immune operator are presented. It reveals that computer virus is a possible form of the characteristics of biological evolution. The simulation experiments were conducted and it indicates that computer viruses have enormously potential capability of self-propagation and self-evolution. Computer viruses have the characteristics of biological evolution, and the model can provides research thinking for anti-virus technology to improve and enhance.
{"title":"A evolution model of computer virus based on immune genetic algorithm","authors":"Jianping Feng, Lihua Wu, Yu Zhang","doi":"10.1109/PIC.2010.5687464","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687464","url":null,"abstract":"In this paper, the life characteristics of a computer virus and algorithm characteristics are studied. A evolution model of computer virus based on immune genetic algorithm, which draws inspirations from artificial life, is proposed. The formal definition of computer virus is introduced, and the evolution operators which include selection operator, crossover operator, mutation operator and immune operator are presented. It reveals that computer virus is a possible form of the characteristics of biological evolution. The simulation experiments were conducted and it indicates that computer viruses have enormously potential capability of self-propagation and self-evolution. Computer viruses have the characteristics of biological evolution, and the model can provides research thinking for anti-virus technology to improve and enhance.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122643727","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687941
M. Doke, N. Hamaguchi, H. Kaneko, S. Inoue
We have been conducting research and development on a new system called TV for you (TV4U), for production, distribution and viewing of video content on the Internet. With TV4U, ordinary users with no special skills are able to produce and publish video content based on real-time 3D computer graphics (CG), and these can be viewed easily by anyone. TV4U makes use of a mechanism we have devised, called Automatic Production Engine (APE), which involve templates for automatically generating production direction for video content. Through introduction of APE, produced video content can be created easily, even by ordinary users with no special skills, by writing a simple description of a scenario. So far, APE have only been capable of generating productions within the range of predefined templates already in the system, limiting the video content that can be produced. As such, we have devised a mechanism able to generate production direction according to the current conditions in the video content. Introducing this mechanism into APE has made it more sophisticated, and has allowed APE to generate sophisticated production direction for video content that was not possible with previous versions of APE.
{"title":"Innovative CG content production through advanced APE","authors":"M. Doke, N. Hamaguchi, H. Kaneko, S. Inoue","doi":"10.1109/PIC.2010.5687941","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687941","url":null,"abstract":"We have been conducting research and development on a new system called TV for you (TV4U), for production, distribution and viewing of video content on the Internet. With TV4U, ordinary users with no special skills are able to produce and publish video content based on real-time 3D computer graphics (CG), and these can be viewed easily by anyone. TV4U makes use of a mechanism we have devised, called Automatic Production Engine (APE), which involve templates for automatically generating production direction for video content. Through introduction of APE, produced video content can be created easily, even by ordinary users with no special skills, by writing a simple description of a scenario. So far, APE have only been capable of generating productions within the range of predefined templates already in the system, limiting the video content that can be produced. As such, we have devised a mechanism able to generate production direction according to the current conditions in the video content. Introducing this mechanism into APE has made it more sophisticated, and has allowed APE to generate sophisticated production direction for video content that was not possible with previous versions of APE.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122664030","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687454
Yonghua Hao, Xuzhu Wang, Caiping Wu, Na Xue
The objective of the paper is to extend Bandyopadhyay's results on rationality conditions of crisp choice functions. By fuzzifying the rationality conditions in the crisp case, we present a necessary and sufficient condition for the acyclic rationality and a characterization theorem for the Wϕ-transitive rationality under a strong De Morgan triple. As a result, some rationality characterizations in the crisp choice functions are generalized.
{"title":"The characterization of Wϕ-transitive rationality and acyclic rationality of fuzzy choice functions","authors":"Yonghua Hao, Xuzhu Wang, Caiping Wu, Na Xue","doi":"10.1109/PIC.2010.5687454","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687454","url":null,"abstract":"The objective of the paper is to extend Bandyopadhyay's results on rationality conditions of crisp choice functions. By fuzzifying the rationality conditions in the crisp case, we present a necessary and sufficient condition for the acyclic rationality and a characterization theorem for the Wϕ-transitive rationality under a strong De Morgan triple. As a result, some rationality characterizations in the crisp choice functions are generalized.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126336747","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687405
Y. Naudet, T. Latour, Géraldine Vidou, Y. Djaghloul
In this paper, we present an approach for high stake decision making based on the processing of uncontrolled knowledge originated from e-communities. Knowledge bases fed by such communities can provide a very rich source for a diagnosis or decision-support systems. However, they inherently bear inherent problems due in particular to knowledge heterogeneity, vagueness, completeness, uncertainty, and origins. In the High Stake Community Contributed Knowledge Base (HSCCKB) approach, the challenge of exploiting heterogeneous data in high stake decisions is addressed. We propose here a dedicated knowledge model as well as tracks for the evaluation of important knowledge aspects, and focus on the decisional architecture and process involved in HSCCKB-based decision support systems.
{"title":"Improving decision support systems with a High Stake Community Contributed Knowledge Base","authors":"Y. Naudet, T. Latour, Géraldine Vidou, Y. Djaghloul","doi":"10.1109/PIC.2010.5687405","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687405","url":null,"abstract":"In this paper, we present an approach for high stake decision making based on the processing of uncontrolled knowledge originated from e-communities. Knowledge bases fed by such communities can provide a very rich source for a diagnosis or decision-support systems. However, they inherently bear inherent problems due in particular to knowledge heterogeneity, vagueness, completeness, uncertainty, and origins. In the High Stake Community Contributed Knowledge Base (HSCCKB) approach, the challenge of exploiting heterogeneous data in high stake decisions is addressed. We propose here a dedicated knowledge model as well as tracks for the evaluation of important knowledge aspects, and focus on the decisional architecture and process involved in HSCCKB-based decision support systems.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129618693","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 : 2010-12-01DOI: 10.1109/PIC.2010.5688020
Lei Hua, Lei Xie, Hui-fang Chen
The color interpolation method of Bayer CFA used in most digital cameras plays an important role in imaging system. In Bayer pattern, the green components are the twice as much as red or blue and contain more image information, which can be used to compensate the interpolations of red and blue. Due to the high correlation among the three color channels, color mutation is prevented by the fixed color difference. Based on these principles, the proposed interpolation algorithm estimates green component firstly with adapted color plane interpolation algorithm, then computes the color difference image (R-G and B-G) to interpolate the full resolution difference image with the compensation of interpolated G and edge adaptive method. Edge blurring problem is addressed by using edge judgment to estimate RGB. Color distortion is reduced using color difference interpolation procedure. Experimental results show that the proposed algorithm outperforms existing typical interpolation methods in terms of image quality and peak signal-to-noise ratio (PSNR), and also computational complexity is low.
{"title":"A color interpolation algorithm for Bayer pattern digital cameras based on green components and color difference space","authors":"Lei Hua, Lei Xie, Hui-fang Chen","doi":"10.1109/PIC.2010.5688020","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688020","url":null,"abstract":"The color interpolation method of Bayer CFA used in most digital cameras plays an important role in imaging system. In Bayer pattern, the green components are the twice as much as red or blue and contain more image information, which can be used to compensate the interpolations of red and blue. Due to the high correlation among the three color channels, color mutation is prevented by the fixed color difference. Based on these principles, the proposed interpolation algorithm estimates green component firstly with adapted color plane interpolation algorithm, then computes the color difference image (R-G and B-G) to interpolate the full resolution difference image with the compensation of interpolated G and edge adaptive method. Edge blurring problem is addressed by using edge judgment to estimate RGB. Color distortion is reduced using color difference interpolation procedure. Experimental results show that the proposed algorithm outperforms existing typical interpolation methods in terms of image quality and peak signal-to-noise ratio (PSNR), and also computational complexity is low.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127713078","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687590
ShouChao Song, Jie Zhang, J. Du, Qiaoyuan Wen
How to construct Boolean functions with good crytographic characteristics is an interesting and significant problem in crytography. Based on the properties of concatenation, two methods were proposed to construct Boolean functions with optimal or suboptimal algebraic immunity. Moreover, some other cryptographic properties, such as algebraic degree, balancedness, and nonlinearity, of the constructed function were also studied. At the end, a new idea was presented for ascertaining whether the given Boolean function had optimal algebraic immunity.
{"title":"On the construction of Boolean functions with optimal algebraic immunity and good other properties by concatenation","authors":"ShouChao Song, Jie Zhang, J. Du, Qiaoyuan Wen","doi":"10.1109/PIC.2010.5687590","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687590","url":null,"abstract":"How to construct Boolean functions with good crytographic characteristics is an interesting and significant problem in crytography. Based on the properties of concatenation, two methods were proposed to construct Boolean functions with optimal or suboptimal algebraic immunity. Moreover, some other cryptographic properties, such as algebraic degree, balancedness, and nonlinearity, of the constructed function were also studied. At the end, a new idea was presented for ascertaining whether the given Boolean function had optimal algebraic immunity.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740690","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687419
Chunguang Chang, Xiang Ma, Xiaoyu Song, Bo Gao
With the flourishing development of construction and real estate industry, engineering accidents happen more frequently. The purpose of this paper is to generate emergency case as quick as possible so as to improve the quick emergency reaction capability when engineering accident happens. The flow of CBR based emergency case generating system (CBR/ECGS) under engineering accidents is studied. Both the static and dynamic case presentation technologies for CBR/ECGS are designed, and the case retrieval, case adaptation and case maintenance technologies for CBR/ECGS are proposed. It can be seen from running result of CBR/ECGS that, comparing with the result under the mode in which artificial adjustment is allowed, the overcast degree of emergency cases generated by CBR/ECGS under the mode in which only automatic system adjustment is allowed is almost the same. The validity of CBR/ECGS proposed in this paper is validated, and CBR is suitable for solving complex, non-structure problems such as emergency case generating under engineering accidents.
{"title":"CBR based emergency case generating system under engineering accidents","authors":"Chunguang Chang, Xiang Ma, Xiaoyu Song, Bo Gao","doi":"10.1109/PIC.2010.5687419","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687419","url":null,"abstract":"With the flourishing development of construction and real estate industry, engineering accidents happen more frequently. The purpose of this paper is to generate emergency case as quick as possible so as to improve the quick emergency reaction capability when engineering accident happens. The flow of CBR based emergency case generating system (CBR/ECGS) under engineering accidents is studied. Both the static and dynamic case presentation technologies for CBR/ECGS are designed, and the case retrieval, case adaptation and case maintenance technologies for CBR/ECGS are proposed. It can be seen from running result of CBR/ECGS that, comparing with the result under the mode in which artificial adjustment is allowed, the overcast degree of emergency cases generated by CBR/ECGS under the mode in which only automatic system adjustment is allowed is almost the same. The validity of CBR/ECGS proposed in this paper is validated, and CBR is suitable for solving complex, non-structure problems such as emergency case generating under engineering accidents.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158122","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687942
Fei Tan, Zhengming Li, Xiaoqin Zhu
Influenced by the noises, for example, eyelid and eyelash occlusions, iris localization algorithms are difficult to keep a right balance between real-time quality and accuracy. Therefore, a novel iris localization method with effective noise eliminating is proposed in this paper. For the iris' inner edge location, morphological open is used to eliminate noise based on separating pupil region by binaryzation. Then the pupil's center and radius are located accurately by gray projection. For the iris' outer edge location, morphological close is proposed to eliminate the rich texture within the iris area. Based on this method, an edge detection template to search four directional points within a small scope of the probable boundary is designed and thus the iris's centre and radius can be located. Simulation results show that, compared with the pre-algorithms, the new algorithm not only greatly improves the accuracy and the speed, but also shows good robustness.
{"title":"Iris localization algorithm based on gray distribution features","authors":"Fei Tan, Zhengming Li, Xiaoqin Zhu","doi":"10.1109/PIC.2010.5687942","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687942","url":null,"abstract":"Influenced by the noises, for example, eyelid and eyelash occlusions, iris localization algorithms are difficult to keep a right balance between real-time quality and accuracy. Therefore, a novel iris localization method with effective noise eliminating is proposed in this paper. For the iris' inner edge location, morphological open is used to eliminate noise based on separating pupil region by binaryzation. Then the pupil's center and radius are located accurately by gray projection. For the iris' outer edge location, morphological close is proposed to eliminate the rich texture within the iris area. Based on this method, an edge detection template to search four directional points within a small scope of the probable boundary is designed and thus the iris's centre and radius can be located. Simulation results show that, compared with the pre-algorithms, the new algorithm not only greatly improves the accuracy and the speed, but also shows good robustness.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179576","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
扫码关注我们
求助内容：
应助结果提醒方式：