By means of semi-pre-open L-sets and their inequality, a new form of SP-closedness is introduced in L-topological spaces, where L is a complete De Morgan algebra. This new form does not depend on the structure of basis lattice L and L does not require any distributivity.
{"title":"On SP-closedness in L-topological spaces","authors":"S. Bai, Li-Wei Jiang","doi":"10.1109/ICICTA.2010.759","DOIUrl":"https://doi.org/10.1109/ICICTA.2010.759","url":null,"abstract":"By means of semi-pre-open L-sets and their inequality, a new form of SP-closedness is introduced in L-topological spaces, where L is a complete De Morgan algebra. This new form does not depend on the structure of basis lattice L and L does not require any distributivity.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130437304","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255118
Wei Huang, E. El-Darzi
Over the past decade, granular computing has rapidly emerged as a new paradigm for distributed information systems. This paper describes an approach to develop service-oriented systems with granular computing theories and OMG standard UML (Unified Modelling Language)[1,4]. The paper goes on to outline how to integrate granular computing structures, methodology and UML for modelling, organising and addressing systems through a case study of emergency assistance service system (EAS). Our approach to building software development solutions emphasizes the importance of using granular computing structures, methodology and domain modelling as a critical initial step in developing and producing software architectures and applications. It aims to present an effective schedule and plan for software development process and addressing activities characteristics, whilst reducing the complexity of the complex systems' design and development by exploiting granular computing and UML's productivity potential.
{"title":"Using Granular Computing theories for service-oriented systems analysis and design","authors":"Wei Huang, E. El-Darzi","doi":"10.1109/GRC.2009.5255118","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255118","url":null,"abstract":"Over the past decade, granular computing has rapidly emerged as a new paradigm for distributed information systems. This paper describes an approach to develop service-oriented systems with granular computing theories and OMG standard UML (Unified Modelling Language)[1,4]. The paper goes on to outline how to integrate granular computing structures, methodology and UML for modelling, organising and addressing systems through a case study of emergency assistance service system (EAS). Our approach to building software development solutions emphasizes the importance of using granular computing structures, methodology and domain modelling as a critical initial step in developing and producing software architectures and applications. It aims to present an effective schedule and plan for software development process and addressing activities characteristics, whilst reducing the complexity of the complex systems' design and development by exploiting granular computing and UML's productivity potential.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127377165","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255121
Ping Hu
As is well known, it is the application of runoff flood forecasting that is extraordinary significant for us. A detailed detection of the flood forecasting process has been carried out using powerful artificial neural network in this paper. Learning algorithmof wavelet neural network was produced by extruding it in BP idea.The determination of network hiddenlayer nodes utilizes the medthod of tring fault. Activation function belongs to morlet wavelet function, and the modle of net structure belongs to 371. It is shown that the reliable prediction accury could be provided by using this model for predicting and analysising for the flood data of solar Da in 1996.
{"title":"Wavelet neural network based on BP algorithm and its application in flood forecasting","authors":"Ping Hu","doi":"10.1109/GRC.2009.5255121","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255121","url":null,"abstract":"As is well known, it is the application of runoff flood forecasting that is extraordinary significant for us. A detailed detection of the flood forecasting process has been carried out using powerful artificial neural network in this paper. Learning algorithmof wavelet neural network was produced by extruding it in BP idea.The determination of network hiddenlayer nodes utilizes the medthod of tring fault. Activation function belongs to morlet wavelet function, and the modle of net structure belongs to 371. It is shown that the reliable prediction accury could be provided by using this model for predicting and analysising for the flood data of solar Da in 1996.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124856387","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255064
D. Tan, Wenhai Luo, Qing Liu
This paper proposes a modified particle swarm optimization algorithm for engineering optimization problems with constraints, in which the penalty function is employed to the traditional PSO algorithm, and at the same time adjusts the personal optimum and global optimum to make PSO being able to solve the non-linear programming problems, then the multi-objective problem can be converted into single objective problem. Moreover, the constraint term played its role in the process of generating particles, those pariticles which don't meet the constraint condition are eliminated. The actual engineering design optimization problem is tested and the results show that the multi-objective particle swarm optimization algorithm can be used to solve the multi-objective constrained optimization problem. Comparison with Genetic Algorithm confirms that the proposed algorithm can find better solutions, and converge quickly.
{"title":"Multi-objective particle swarm optimization algorithm for engineering constrained optimization problems","authors":"D. Tan, Wenhai Luo, Qing Liu","doi":"10.1109/GRC.2009.5255064","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255064","url":null,"abstract":"This paper proposes a modified particle swarm optimization algorithm for engineering optimization problems with constraints, in which the penalty function is employed to the traditional PSO algorithm, and at the same time adjusts the personal optimum and global optimum to make PSO being able to solve the non-linear programming problems, then the multi-objective problem can be converted into single objective problem. Moreover, the constraint term played its role in the process of generating particles, those pariticles which don't meet the constraint condition are eliminated. The actual engineering design optimization problem is tested and the results show that the multi-objective particle swarm optimization algorithm can be used to solve the multi-objective constrained optimization problem. Comparison with Genetic Algorithm confirms that the proposed algorithm can find better solutions, and converge quickly.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125073113","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255028
Lei-Yue Yao, Jianying Xiong
In order to find out the user patterns that hide in web logs, log mining technology is one of the best ways. Log mining is the usage of data mining in the field of web server' logs. Although there are a set of softwares which can be used to analysis web logs, the algorithm raised in this article pay special attention to discover the relationship among all the pages of the web site. In this algorithm, size-link radio and static inner-link degree was creative used. According to the result of experiment, this algorithm can exactly find out the correlative ones among massive pages.
{"title":"The research and implementation of a correlative degree mining algorithm based on IIS logs","authors":"Lei-Yue Yao, Jianying Xiong","doi":"10.1109/GRC.2009.5255028","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255028","url":null,"abstract":"In order to find out the user patterns that hide in web logs, log mining technology is one of the best ways. Log mining is the usage of data mining in the field of web server' logs. Although there are a set of softwares which can be used to analysis web logs, the algorithm raised in this article pay special attention to discover the relationship among all the pages of the web site. In this algorithm, size-link radio and static inner-link degree was creative used. According to the result of experiment, this algorithm can exactly find out the correlative ones among massive pages.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"11 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126054582","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255135
Xindong Wu
With the rapid development of computer, communication and networking technologies, Web information resources are becoming increasingly rich, and on-line applications are required to be more and more flexible. Therefore, a new generation of information models and mechanisms for these information processing requirements has become a major challenge. This talk will discuss four scientific problems in ubiquitous personalized information processing with wildcards*, including demand driven aggregation of information resources, mining and analysis for aggregated information, user interest modeling, and system security. With these four components, a pervasive and personalized information processing mechanism can be constructed for dynamically organizing and optimizing multiple information resources, implementing a transparent and scalable information processing architecture, and flexibly building information and analysis services to meet various user demands.
{"title":"Ubiquitous personalized information processing with wildcards","authors":"Xindong Wu","doi":"10.1109/GRC.2009.5255135","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255135","url":null,"abstract":"With the rapid development of computer, communication and networking technologies, Web information resources are becoming increasingly rich, and on-line applications are required to be more and more flexible. Therefore, a new generation of information models and mechanisms for these information processing requirements has become a major challenge. This talk will discuss four scientific problems in ubiquitous personalized information processing with wildcards*, including demand driven aggregation of information resources, mining and analysis for aggregated information, user interest modeling, and system security. With these four components, a pervasive and personalized information processing mechanism can be constructed for dynamically organizing and optimizing multiple information resources, implementing a transparent and scalable information processing architecture, and flexibly building information and analysis services to meet various user demands.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127026295","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}
Both of XML document and user's query are represented by the set of paths from the root node to leaf nodes. So the context and content information contained in the corresponding path is a vital important clue to research XML retrieval. This paper presents an approach, NPathSim, for measuring similarity between two paths. XML Path retrieval was performed to evaluate the performance of NPathSim. The experiments show that our path retrieval method can achieve better performance than other methods.
{"title":"An approach to XML Path retrieval","authors":"Ling Song, Shengen Li, Wei Cui, Dongmei Zhang, Xiaofei Niu","doi":"10.1109/GRC.2009.5255069","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255069","url":null,"abstract":"Both of XML document and user's query are represented by the set of paths from the root node to leaf nodes. So the context and content information contained in the corresponding path is a vital important clue to research XML retrieval. This paper presents an approach, NPathSim, for measuring similarity between two paths. XML Path retrieval was performed to evaluate the performance of NPathSim. The experiments show that our path retrieval method can achieve better performance than other methods.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122942389","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255043
Bo Xu, Hongfei Lin, Baoyan Liu
This paper focuses on setting up a question-answering oriented Biomedical Domain, and it applies several different approaches to the different processing phases. Firstly, it uses shallow parser to identify the types of questions and extract the keywords, and the keywords are expanded with UMLS for the purpose of improving the recall. Secondly, passage retrieval is performed with the expanded keywords. Lastly, in the phase of answering extracting, the approach of passage retrieval based on hotspots is presented to discover the related information with low redundancy. This QA system has been evaluated on the dataset of TREC, and the experiment results shows that it can answer the questions from biomedical domain effectively.
{"title":"Study on question answering system for biomedical domain","authors":"Bo Xu, Hongfei Lin, Baoyan Liu","doi":"10.1109/GRC.2009.5255043","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255043","url":null,"abstract":"This paper focuses on setting up a question-answering oriented Biomedical Domain, and it applies several different approaches to the different processing phases. Firstly, it uses shallow parser to identify the types of questions and extract the keywords, and the keywords are expanded with UMLS for the purpose of improving the recall. Secondly, passage retrieval is performed with the expanded keywords. Lastly, in the phase of answering extracting, the approach of passage retrieval based on hotspots is presented to discover the related information with low redundancy. This QA system has been evaluated on the dataset of TREC, and the experiment results shows that it can answer the questions from biomedical domain effectively.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122100956","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255013
Xinxin Zhao, Xiaofeng Wang
Set the Chinese text sets into two classifications and determine whether the information is in the field of Chinese maritime by a two-classifier which is guided by multiple semantic. Eventually it gets Chinese maritime information set so that we can custom maritime information. We call this information system for the Chinese Marine engine. Experiments show that the Chinese Marine engine achieves good effects of custom the Chinese maritime information and it has a high practical value.
{"title":"Maritime information engine","authors":"Xinxin Zhao, Xiaofeng Wang","doi":"10.1109/GRC.2009.5255013","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255013","url":null,"abstract":"Set the Chinese text sets into two classifications and determine whether the information is in the field of Chinese maritime by a two-classifier which is guided by multiple semantic. Eventually it gets Chinese maritime information set so that we can custom maritime information. We call this information system for the Chinese Marine engine. Experiments show that the Chinese Marine engine achieves good effects of custom the Chinese maritime information and it has a high practical value.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128719290","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255023
Yi-feng Zeng, Jian Luo, Shuyuan Lin
Selecting relevant features is in demand when a large data set is of interest in a classification task. It produces a tractable number of features that are sufficient and possibly improve the classification performance. This paper studies a statistical method of Markov blanket induction algorithm for filtering features and then applies a classifier using the Markov blanket predictors. The Markov blanket contains a minimal subset of relevant features that yields optimal classification performance. We experimentally demonstrate the improved performance of several classifiers using a Markov blanket induction as a feature selection method. In addition, we point out an important assumption behind the Markov blanket induction algorithm and show its effect on the classification performance.
{"title":"Classification using Markov blanket for feature selection","authors":"Yi-feng Zeng, Jian Luo, Shuyuan Lin","doi":"10.1109/GRC.2009.5255023","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255023","url":null,"abstract":"Selecting relevant features is in demand when a large data set is of interest in a classification task. It produces a tractable number of features that are sufficient and possibly improve the classification performance. This paper studies a statistical method of Markov blanket induction algorithm for filtering features and then applies a classifier using the Markov blanket predictors. The Markov blanket contains a minimal subset of relevant features that yields optimal classification performance. We experimentally demonstrate the improved performance of several classifiers using a Markov blanket induction as a feature selection method. In addition, we point out an important assumption behind the Markov blanket induction algorithm and show its effect on the classification performance.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126684468","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
扫码关注我们
求助内容：
应助结果提醒方式：