Pub Date : 2012-05-29DOI: 10.1109/FSKD.2012.6234251
Z. Shi, Yan-xia Jin
The semantics of concept hierarchy can show mapping hierarchy relations among attributes in Database System. The Formal Concept Analysis (FCA) is a mathematical tool for analysis based on formal concept and concept hierarchy and can express generalization and specialization relations among formal concepts. In this paper the theories of FCA are introduced into the research of semantics of concept hierarchy in database system firstly and partial order relations of attributes can be used as formal rules for generating semantics of concept hierarchy. The theory foundation of research and realized method that can construct structure of partial order relations of attributes which can obtain semantics of concept hierarchy through intent of attribute concept are discussed. The experimental process shows that this method is effective.
{"title":"Research on semantics of concept hierarchy based on Formal Concept Analysis","authors":"Z. Shi, Yan-xia Jin","doi":"10.1109/FSKD.2012.6234251","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234251","url":null,"abstract":"The semantics of concept hierarchy can show mapping hierarchy relations among attributes in Database System. The Formal Concept Analysis (FCA) is a mathematical tool for analysis based on formal concept and concept hierarchy and can express generalization and specialization relations among formal concepts. In this paper the theories of FCA are introduced into the research of semantics of concept hierarchy in database system firstly and partial order relations of attributes can be used as formal rules for generating semantics of concept hierarchy. The theory foundation of research and realized method that can construct structure of partial order relations of attributes which can obtain semantics of concept hierarchy through intent of attribute concept are discussed. The experimental process shows that this method is effective.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115478869","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6233873
Jie Wang, Yu Zeng
closed frequent pattern mining can reduces the number of frequent patterns and keep sufficient result information. In this paper, we discuss the closed weighted frequent pattern mining problem over data streams. Continuous, unbounded and high-speed data streams make closed weighted frequent pattern mining become a difficult task. We present an efficient algorithm DCWFP-Miner, which is based on sliding window and can discover closed weighted frequent pattern from the recent data. The right order of the closed and weighted frequent constraints is proved and a new efficient DS_CWFP data structure is used to dynamically maintain the information of transactions and also maintain the closed weighted frequent patterns has been found in the current sliding window. The detail of the algorithm DCWFP-Miner is also discussed. Experimental studies are performed to evaluate the good effectiveness of DCWFP-Miner.
{"title":"DCWFP-Miner: Mining closed weighted frequent patterns over data streams","authors":"Jie Wang, Yu Zeng","doi":"10.1109/FSKD.2012.6233873","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233873","url":null,"abstract":"closed frequent pattern mining can reduces the number of frequent patterns and keep sufficient result information. In this paper, we discuss the closed weighted frequent pattern mining problem over data streams. Continuous, unbounded and high-speed data streams make closed weighted frequent pattern mining become a difficult task. We present an efficient algorithm DCWFP-Miner, which is based on sliding window and can discover closed weighted frequent pattern from the recent data. The right order of the closed and weighted frequent constraints is proved and a new efficient DS_CWFP data structure is used to dynamically maintain the information of transactions and also maintain the closed weighted frequent patterns has been found in the current sliding window. The detail of the algorithm DCWFP-Miner is also discussed. Experimental studies are performed to evaluate the good effectiveness of DCWFP-Miner.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115842436","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6234107
Q. Yue
This paper proposes a novel method for solving the two-sided matching problem, in which the preferences provided by agents are in the form of scores. Firstly, the problem description of two-sided matching with scores is given. Then the related concepts on satisfaction degree are given. Considering the satisfaction degree of each agent, a multi-objective optimization model is set up. The linear weighted method is used to convert the multi-objective optimization model into a single objective model. The matching result is obtained by solving the model. Finally, a numerical example is given to illustrate the use of the proposed method.
{"title":"A method for the two-sided matching with scores","authors":"Q. Yue","doi":"10.1109/FSKD.2012.6234107","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234107","url":null,"abstract":"This paper proposes a novel method for solving the two-sided matching problem, in which the preferences provided by agents are in the form of scores. Firstly, the problem description of two-sided matching with scores is given. Then the related concepts on satisfaction degree are given. Considering the satisfaction degree of each agent, a multi-objective optimization model is set up. The linear weighted method is used to convert the multi-objective optimization model into a single objective model. The matching result is obtained by solving the model. Finally, a numerical example is given to illustrate the use of the proposed method.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131113316","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6233762
Qin Huang, Yuanfang Chen, Sui Xu, Jing Liu
the rainfall Intensity-Duration-Frequency (IDF) curves is one of the most commonly tools used in water resources engineering. A simple multifractal rainfall model with multifractal behavior approved by Andreas Langousis is used to estimate the IDF curves in this paper. The model is composed of exterior and interior process with constant duration D and “bare” intensity I D ′. Using high resolution data of rainfall record, Langousis gives the conclusion that the results of the IDF curves tends insensitive to the length of data record. So, in this paper, the 6 years rainfall data at 5-min resolution at Nanxiong station, Guangdong province, China, are applied with the model to estimate the IDF curves. Compared to the traditional parametric models, it reduces the amount of parameters required to be calculated, and 6years of high resolution rainfall data is capable to estimate the IDF curves. 22years maxima annual daily rainfall data are fitted by the Pearson-3(P3) distribution to obtain the daily rainfall intensities for different return period T. The results are similar to 24h rainfall intensities of the multifractal model with T ≤ 100years. The study is of significant practical importance in China for the regions lacking of long sufficient rainfall data.
降雨强度-持续时间-频率(IDF)曲线是水利工程中最常用的工具之一。本文采用Andreas Langousis认可的具有多重分形行为的简单多重分形降雨模型来估计IDF曲线。模型由恒定持续时间D和“裸”强度I D '的外部过程和内部过程组成。Langousis利用高分辨率降雨记录数据，得出了IDF曲线的结果对数据记录长度不敏感的结论。因此，本文以广东省南雄站6年5 min分辨率降水资料为例，利用该模型估算了IDF曲线。与传统的参数模式相比，减少了需要计算的参数量，6年高分辨率降水资料可以估算IDF曲线。采用Pearson-3(P3)分布拟合了22年最大年日降雨量数据，得到了不同回归期T的日降雨强度，结果与T≤100年多重分形模型的24小时降雨强度相似。该研究对中国缺乏长期充足降水资料的地区具有重要的现实意义。
{"title":"A simple multifractal model for rainfall IDF analysis in China","authors":"Qin Huang, Yuanfang Chen, Sui Xu, Jing Liu","doi":"10.1109/FSKD.2012.6233762","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233762","url":null,"abstract":"the rainfall Intensity-Duration-Frequency (IDF) curves is one of the most commonly tools used in water resources engineering. A simple multifractal rainfall model with multifractal behavior approved by Andreas Langousis is used to estimate the IDF curves in this paper. The model is composed of exterior and interior process with constant duration D and “bare” intensity I D ′. Using high resolution data of rainfall record, Langousis gives the conclusion that the results of the IDF curves tends insensitive to the length of data record. So, in this paper, the 6 years rainfall data at 5-min resolution at Nanxiong station, Guangdong province, China, are applied with the model to estimate the IDF curves. Compared to the traditional parametric models, it reduces the amount of parameters required to be calculated, and 6years of high resolution rainfall data is capable to estimate the IDF curves. 22years maxima annual daily rainfall data are fitted by the Pearson-3(P3) distribution to obtain the daily rainfall intensities for different return period T. The results are similar to 24h rainfall intensities of the multifractal model with T ≤ 100years. The study is of significant practical importance in China for the regions lacking of long sufficient rainfall data.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128458311","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6234301
Fayi Yang, Min Lu
Ontology-based knowledge retrieval is one of the mainstreams of the development of information retrieval field. The evaluation mechanism is an important way to improve the efficiency of knowledge retrieval, and to enhance the user satisfaction. This paper evaluates the efficiency of knowledge retrieval models, and advances the corresponding rules and the assessment mechanisms.
{"title":"Ontology-based knowledge retrieval system and evaluation mechanism","authors":"Fayi Yang, Min Lu","doi":"10.1109/FSKD.2012.6234301","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234301","url":null,"abstract":"Ontology-based knowledge retrieval is one of the mainstreams of the development of information retrieval field. The evaluation mechanism is an important way to improve the efficiency of knowledge retrieval, and to enhance the user satisfaction. This paper evaluates the efficiency of knowledge retrieval models, and advances the corresponding rules and the assessment mechanisms.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128609949","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6233850
R. Tang, YU Peng, Xiao Chen, Xu Zhang, Yang Xiang
An effective method using quite few variables, named the finite functions method, is applied to simulate the distribution of conductivity usually described by lots of geoelectrical parameters resulting in the underdetermined of inverse problem in geophysics. Through controlling the change of function variables, we can use this method to manifest the structure and interface of geoelectrical model of the earth. The numerical calculation result verifies that the function is feasible and effective to reveal different underground conductivity structures buried in the earth, which means it is possible and effective to apply this method in practical inverse problem in future.
{"title":"Simulation and inversion of electrical conductivity distribution using the finite functions method","authors":"R. Tang, YU Peng, Xiao Chen, Xu Zhang, Yang Xiang","doi":"10.1109/FSKD.2012.6233850","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233850","url":null,"abstract":"An effective method using quite few variables, named the finite functions method, is applied to simulate the distribution of conductivity usually described by lots of geoelectrical parameters resulting in the underdetermined of inverse problem in geophysics. Through controlling the change of function variables, we can use this method to manifest the structure and interface of geoelectrical model of the earth. The numerical calculation result verifies that the function is feasible and effective to reveal different underground conductivity structures buried in the earth, which means it is possible and effective to apply this method in practical inverse problem in future.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115856942","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6233747
Yingjun Pan, Tie Zou
Based on the definition of single-tape Fuzzy Non-deterministic Turing Machine (FNTM), this article discussed in details the process of FNTM accepting language and researched the computational complexity of fuzzy Turing Machine (TM) accepting ?-cut language by using the Deterministic Turing Machine (DTM) to simulate its process, thus drawing the conclusion that the judgment of FNTM accepting ?-cut language is a matter of the NP-completeness, and that it is not essentially helpful to adjust the membership degree in facing the time complexity problem when simulating the process of FNTM accepting the language.
{"title":"On the complexity of Turing machine accepting fuzzy language","authors":"Yingjun Pan, Tie Zou","doi":"10.1109/FSKD.2012.6233747","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233747","url":null,"abstract":"Based on the definition of single-tape Fuzzy Non-deterministic Turing Machine (FNTM), this article discussed in details the process of FNTM accepting language and researched the computational complexity of fuzzy Turing Machine (TM) accepting ?-cut language by using the Deterministic Turing Machine (DTM) to simulate its process, thus drawing the conclusion that the judgment of FNTM accepting ?-cut language is a matter of the NP-completeness, and that it is not essentially helpful to adjust the membership degree in facing the time complexity problem when simulating the process of FNTM accepting the language.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124783967","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6234221
Duo Liu, X. Fan
Image compression is a kind of data compression technology. The aim of image compression is to reduce redundant information in image data. However, most image compression algorithms have problems such as computational complexity, computational load and so on. Parallel computing is an effective means to improve the processing speed. With the development of high-performance parallel processing systems, parallel image processing algorithms provides more space for improving image processing speed. And with the improvement of GPU performance, GPU is increasingly applied in the computing-concentrated data operation. According to the parallelism and programmability of CUDA, the acceleration for JPEG compression is addressed in this paper. CUDA makes it possible for GPU to do the general purpose computing. The powerful parallel computing power of CUDA GPU can improve the processing speed of JPEG image compression easily. For the parallel processing features and programmability of CUDA, this paper introduces a method of accelerating image compression based on CUDA. An optimal algorithm is proposed as well. The introduction of CUDA allows the image compression for nearly 20 to 24 times speedup. In the end of the paper, we optimize and test the program, and make the analysis of experimental results. Finally we summarize some hardware and software features of CUDA, and propose a basic method of optimizing CUDA kernels from the analysis of the experiment.
{"title":"Parallel program design for JPEG compression encoding","authors":"Duo Liu, X. Fan","doi":"10.1109/FSKD.2012.6234221","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234221","url":null,"abstract":"Image compression is a kind of data compression technology. The aim of image compression is to reduce redundant information in image data. However, most image compression algorithms have problems such as computational complexity, computational load and so on. Parallel computing is an effective means to improve the processing speed. With the development of high-performance parallel processing systems, parallel image processing algorithms provides more space for improving image processing speed. And with the improvement of GPU performance, GPU is increasingly applied in the computing-concentrated data operation. According to the parallelism and programmability of CUDA, the acceleration for JPEG compression is addressed in this paper. CUDA makes it possible for GPU to do the general purpose computing. The powerful parallel computing power of CUDA GPU can improve the processing speed of JPEG image compression easily. For the parallel processing features and programmability of CUDA, this paper introduces a method of accelerating image compression based on CUDA. An optimal algorithm is proposed as well. The introduction of CUDA allows the image compression for nearly 20 to 24 times speedup. In the end of the paper, we optimize and test the program, and make the analysis of experimental results. Finally we summarize some hardware and software features of CUDA, and propose a basic method of optimizing CUDA kernels from the analysis of the experiment.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129638268","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}
Fuzzy reasoning methods have demonstrated their ability to solve different kinds of problems in various applications domains. Currently, there is an increasing interest to augment new fuzzy reasoning principles and methods with speeding and processing capabilities. This paper points out a kind of fuzzy reasoning (CFR: Compensation Fuzzy Reasoning), and its application on DoS attack detection. Because proposed method is not based on traditional compositional operation and its operation is simple, it could be used to solve different kinds of problems. In addition, test results explained that proposed method is faster than others and it is effective on DoS attack detection. Through comparison of the existing reasoning method and application, effectiveness of proposed method is shown. This reasoning method gives us various abilities of realization in various applications domains as artificial intelligence problem and so on.
{"title":"Research on Compensation Fuzzy Reasoning and application in DoS attack detection","authors":"Jingjiao Li, Cholman Ho, Sonil Gwak, Zhenni Li, Zongho Choe","doi":"10.1109/FSKD.2012.6233912","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6233912","url":null,"abstract":"Fuzzy reasoning methods have demonstrated their ability to solve different kinds of problems in various applications domains. Currently, there is an increasing interest to augment new fuzzy reasoning principles and methods with speeding and processing capabilities. This paper points out a kind of fuzzy reasoning (CFR: Compensation Fuzzy Reasoning), and its application on DoS attack detection. Because proposed method is not based on traditional compositional operation and its operation is simple, it could be used to solve different kinds of problems. In addition, test results explained that proposed method is faster than others and it is effective on DoS attack detection. Through comparison of the existing reasoning method and application, effectiveness of proposed method is shown. This reasoning method gives us various abilities of realization in various applications domains as artificial intelligence problem and so on.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121093106","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 : 2012-05-29DOI: 10.1109/FSKD.2012.6234065
Yan Li, Siwei Chong
Because of the characteristics of distribution and isomerism within the large-scale operation simulation systems, new demands are put forward in the process of developing, running and reusing of scenario. Comparing the basic definitions of the scenario and model transformation, the paper divides the process of developing scenario into four stages of designing, matching, running and optimizing based on the development of MDA and suggests the scenario matching methods based on the MDA model transformation so as to explore the new ways of successful transformation between the platform-independent simulation scenario and platform-specific simulation script.
{"title":"A simulation scenario matching study based on the MDA model transformation","authors":"Yan Li, Siwei Chong","doi":"10.1109/FSKD.2012.6234065","DOIUrl":"https://doi.org/10.1109/FSKD.2012.6234065","url":null,"abstract":"Because of the characteristics of distribution and isomerism within the large-scale operation simulation systems, new demands are put forward in the process of developing, running and reusing of scenario. Comparing the basic definitions of the scenario and model transformation, the paper divides the process of developing scenario into four stages of designing, matching, running and optimizing based on the development of MDA and suggests the scenario matching methods based on the MDA model transformation so as to explore the new ways of successful transformation between the platform-independent simulation scenario and platform-specific simulation script.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121201964","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
扫码关注我们
求助内容：
应助结果提醒方式：