Eukaryotic genomes are typically large and filled with both genes and multiple classes of repetitive DNA. The repetitive DNAs are a rapidly evolving genome component that can provide the raw material for novel selected functions and also indicate the mechanisms and history of genome evolution in any ancestral lineage. In order to facilitate a broader range of repeat analyses, we present a graph method for repeat family detection and characterization by using the sparse de Bruijn graphs. This program was written in JAVA and with numerous adjustable parameters. Testing of this program indicated that it can found all of the major repeats.
{"title":"A New Repeat Family Detection Method Based on Sparse de Bruijn Graph","authors":"Hong Zhou, Zheng Zhao, Hongpo Wang","doi":"10.1109/KAM.2009.27","DOIUrl":"https://doi.org/10.1109/KAM.2009.27","url":null,"abstract":"Eukaryotic genomes are typically large and filled with both genes and multiple classes of repetitive DNA. The repetitive DNAs are a rapidly evolving genome component that can provide the raw material for novel selected functions and also indicate the mechanisms and history of genome evolution in any ancestral lineage. In order to facilitate a broader range of repeat analyses, we present a graph method for repeat family detection and characterization by using the sparse de Bruijn graphs. This program was written in JAVA and with numerous adjustable parameters. Testing of this program indicated that it can found all of the major repeats.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124415312","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}
Wenqing Fan, Binbin Zhou, Hongliang Liang, Yixian Yang
Path-sensitive analysis is an important feature of static program analysis that can assist to performance the software testing and ensure the software quality. Currently most analysis models are based on symbolic execution analysis. Our approach faces on some challenges like how to deal with the "path explosion" problem due to the number of paths growing exponentially with the number of program branches and the inline process of inter-procedural callings. In this paper, we present a method called Path Correlation Analysis and an analytical model, Solving Time Symbolic Execution, which, working together, can alleviate the redundant analysis of the common nodes between different paths in conventional path-oriented analysis. We also give the description of the corresponding algorithms in the paper and prove that compared with the conventional methods, this method can efficiently reduce the time complexity, easing the effect of the "path explosion" problem.
{"title":"A Novel Program Analysis Method Based on Execution Path Correlation","authors":"Wenqing Fan, Binbin Zhou, Hongliang Liang, Yixian Yang","doi":"10.1109/KAM.2009.34","DOIUrl":"https://doi.org/10.1109/KAM.2009.34","url":null,"abstract":"Path-sensitive analysis is an important feature of static program analysis that can assist to performance the software testing and ensure the software quality. Currently most analysis models are based on symbolic execution analysis. Our approach faces on some challenges like how to deal with the \"path explosion\" problem due to the number of paths growing exponentially with the number of program branches and the inline process of inter-procedural callings. In this paper, we present a method called Path Correlation Analysis and an analytical model, Solving Time Symbolic Execution, which, working together, can alleviate the redundant analysis of the common nodes between different paths in conventional path-oriented analysis. We also give the description of the corresponding algorithms in the paper and prove that compared with the conventional methods, this method can efficiently reduce the time complexity, easing the effect of the \"path explosion\" problem.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124133928","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}
This paper proposed the binary particle swam optimization method based on simulated annealing and weak population mutation. We applied this method to casing damage forecast of oil field. Using our new algorithm, attributes reduce to 12 from original 62. It becomes possible to forecast using these 12 attributes as the inputs.
{"title":"Reduction Methods of Attributes Based on Improved BPSO","authors":"Guanyu Pan, Da-you Liu, Hui Yan","doi":"10.1109/KAM.2009.202","DOIUrl":"https://doi.org/10.1109/KAM.2009.202","url":null,"abstract":"This paper proposed the binary particle swam optimization method based on simulated annealing and weak population mutation. We applied this method to casing damage forecast of oil field. Using our new algorithm, attributes reduce to 12 from original 62. It becomes possible to forecast using these 12 attributes as the inputs.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122466726","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}
Ordinary differential equation with small parameter is considered in this paper. This kind of problem changes rapidly in both side of boundary layer. Firstly, the asymptotic solution of the problem is presented in order one. The asymptotic solution is used to solve the problem outside the boundary layer. Secondly, the analytical solution is decomposed into the smooth component and the singular component in order to improve the computational effect. The bounds for the derivatives of the smooth component and the singular component are studied. Thirdly, the fitted operator method is constructed for both side of boundary layer. The error estimation of numerical method is given also. Finally, numerical experiment is given to support the theoretical result.
{"title":"Combining Asymptotic Solution and Numerical Solution for Differential Equation with Small Parameter","authors":"X. Cai","doi":"10.1109/KAM.2009.87","DOIUrl":"https://doi.org/10.1109/KAM.2009.87","url":null,"abstract":"Ordinary differential equation with small parameter is considered in this paper. This kind of problem changes rapidly in both side of boundary layer. Firstly, the asymptotic solution of the problem is presented in order one. The asymptotic solution is used to solve the problem outside the boundary layer. Secondly, the analytical solution is decomposed into the smooth component and the singular component in order to improve the computational effect. The bounds for the derivatives of the smooth component and the singular component are studied. Thirdly, the fitted operator method is constructed for both side of boundary layer. The error estimation of numerical method is given also. Finally, numerical experiment is given to support the theoretical result.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116930590","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}
Operating system controls the resources of the computer, and provides interfaces for users. The resource sharing calls for the multi-user support of the computer system. The system on one hand divides resources for different processes and on the other, let processes share the resources when necessary, which makes the structure of the operating system extremely complicated. This paper gives a study of the operating system structure through analyzing the components of the system: As to the software, it gives an analysis and a conclusion of the methods for the function of an operating system; as to the hardware, it studies the management of distributed hardware.
{"title":"The Analyses of Operating System Structure","authors":"Chengjun Wang","doi":"10.1109/KAM.2009.265","DOIUrl":"https://doi.org/10.1109/KAM.2009.265","url":null,"abstract":"Operating system controls the resources of the computer, and provides interfaces for users. The resource sharing calls for the multi-user support of the computer system. The system on one hand divides resources for different processes and on the other, let processes share the resources when necessary, which makes the structure of the operating system extremely complicated. This paper gives a study of the operating system structure through analyzing the components of the system: As to the software, it gives an analysis and a conclusion of the methods for the function of an operating system; as to the hardware, it studies the management of distributed hardware.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117116432","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}
As a classic clustering method, the traditional K-Means algorithm has been widely used in pattern recognition and machine learning. It is known that the performance of the K-means clustering algorithm depend highly on initial cluster centers. Generally initial cluster centers are selected randomly, so the algorithm could not lead to the unique result. In this paper, we present a method to compute initial cluster centers for K-means clustering. Our method is based on an efficient technique for estimating the modes of a distribution. We apply the new method to the K-means algorithm. The experimental results show better performance of the proposed method.
{"title":"A New Method for Initialising the K-Means Clustering Algorithm","authors":"X. Qin, Shijue Zheng","doi":"10.1109/KAM.2009.20","DOIUrl":"https://doi.org/10.1109/KAM.2009.20","url":null,"abstract":"As a classic clustering method, the traditional K-Means algorithm has been widely used in pattern recognition and machine learning. It is known that the performance of the K-means clustering algorithm depend highly on initial cluster centers. Generally initial cluster centers are selected randomly, so the algorithm could not lead to the unique result. In this paper, we present a method to compute initial cluster centers for K-means clustering. Our method is based on an efficient technique for estimating the modes of a distribution. We apply the new method to the K-means algorithm. The experimental results show better performance of the proposed method.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123262699","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}
Current methods of service discovery, using the same mechanism to describe both request and advertisement and does not take into account the asymmetry between the two. Service advertisement discovery is a complete description of descriptive, information-rich features, and service request description is concerned only with some of the characteristics of services, usually does not constitute a complete description of the service. In this paper, we propose to use semantic web query language SPARQL-DL as the service request description language to retrieve OWL-S form published services. Treat the service discovery issue as query against the knowledge base. Through the experiment, confirmed that the method is practical, simple, reliable and easy-to-use.
{"title":"Query for Semantic Web Services Using SPARQL-DL","authors":"Hai Wang, Sheping Zhai, Lin Fan","doi":"10.1109/KAM.2009.198","DOIUrl":"https://doi.org/10.1109/KAM.2009.198","url":null,"abstract":"Current methods of service discovery, using the same mechanism to describe both request and advertisement and does not take into account the asymmetry between the two. Service advertisement discovery is a complete description of descriptive, information-rich features, and service request description is concerned only with some of the characteristics of services, usually does not constitute a complete description of the service. In this paper, we propose to use semantic web query language SPARQL-DL as the service request description language to retrieve OWL-S form published services. Treat the service discovery issue as query against the knowledge base. Through the experiment, confirmed that the method is practical, simple, reliable and easy-to-use.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126823389","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 paper put forward a new method of image edge detection based on grey entropy which was the first time to be applied into the field of image edge extraction. We let the median value of pixels in the neighborhood of the window be the reference sequence, and selected certain pixels from sixteen different directions as the comparative sequences according to the information of the image texture and pixel distribution. After carrying out the grey relational analysis, we employed the grey relational coefficients obtained to calculate the grey entropy. If the difference between the maximum grey entropy value and the minimum one is greater than a given threshold, we can determine the central pixel is an edge point, or it is a non-edge one. Experiments show that this method can achieve a better effect than other conventional algorithms, and it provides us a new approach to image edge detection.
{"title":"New Image Edge Detection Approach by Using Grey Entropy","authors":"Gang Li, Yala Tong, Xin-ping Xiao","doi":"10.1109/KAM.2009.178","DOIUrl":"https://doi.org/10.1109/KAM.2009.178","url":null,"abstract":"The paper put forward a new method of image edge detection based on grey entropy which was the first time to be applied into the field of image edge extraction. We let the median value of pixels in the neighborhood of the window be the reference sequence, and selected certain pixels from sixteen different directions as the comparative sequences according to the information of the image texture and pixel distribution. After carrying out the grey relational analysis, we employed the grey relational coefficients obtained to calculate the grey entropy. If the difference between the maximum grey entropy value and the minimum one is greater than a given threshold, we can determine the central pixel is an edge point, or it is a non-edge one. Experiments show that this method can achieve a better effect than other conventional algorithms, and it provides us a new approach to image edge detection.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116017799","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}
Rural educational resource regional service platform is service-oriented, providing personalized service to users anywhere who participate in distance education. Users can acquire resources based on their interests, achieving to share educational resources in the maximum extent. The paper first briefly analyses the mode, the present situation and the characteristics of rural education, then puts forward the regional service model of educational resources model based on the inadequacy of existing model, and explains the rural educational resources regional service platform detailedly from several aspects such as structure, function and development and implementation.
{"title":"Design and Implementation of Rural Educational Resource Regional Service Platform","authors":"Min Hu, Qingtang Liu, Hao Li","doi":"10.1109/KAM.2009.107","DOIUrl":"https://doi.org/10.1109/KAM.2009.107","url":null,"abstract":"Rural educational resource regional service platform is service-oriented, providing personalized service to users anywhere who participate in distance education. Users can acquire resources based on their interests, achieving to share educational resources in the maximum extent. The paper first briefly analyses the mode, the present situation and the characteristics of rural education, then puts forward the regional service model of educational resources model based on the inadequacy of existing model, and explains the rural educational resources regional service platform detailedly from several aspects such as structure, function and development and implementation.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116165470","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}
Z. Wan, T. Liao, Jun‐Juh Yan, Lan-yuen Guo, Yi‐You Hou
In this study, the secure communication application of switched chaotic systems which depend on a time-driven switching law is considered. The secure communications is set up by the masking scheme. Based on Lyapunov stability theorem, linear matrix inequality (LMI), and linear matrix equality (LME) optimization techniques, an output feedback controller is designed to synchronize the master-slave system and to guarantee the recovery the transmitted message. Finally, the numerical simulation verifies the results of the proposed method in this paper.
{"title":"Message Masking Communication of Switched Chaotic Systems","authors":"Z. Wan, T. Liao, Jun‐Juh Yan, Lan-yuen Guo, Yi‐You Hou","doi":"10.1109/KAM.2009.169","DOIUrl":"https://doi.org/10.1109/KAM.2009.169","url":null,"abstract":"In this study, the secure communication application of switched chaotic systems which depend on a time-driven switching law is considered. The secure communications is set up by the masking scheme. Based on Lyapunov stability theorem, linear matrix inequality (LMI), and linear matrix equality (LME) optimization techniques, an output feedback controller is designed to synchronize the master-slave system and to guarantee the recovery the transmitted message. Finally, the numerical simulation verifies the results of the proposed method in this paper.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"31 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122473613","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
扫码关注我们
求助内容：
应助结果提醒方式：