Pub Date : 2010-11-29DOI: 10.1109/KAM.2010.5646200
Yong He
This paper proposes a classification algorithm based on simplified fuzzy rules base combining fuzzy clustering with rough set. Firstly, generates fuzzy rules base using fuzzy clustering from numerical sample dates, and then simplifies the sample attributions using rough set theory, deletes the redundant rules, and gets the simplified fuzzy rules base, in order to make classification decision conveniently. The performance of the classification algorithm is tested by the IRIS data, and the results show that the fuzzy rules are not only intelligible, but also have very good classification performance.
{"title":"A classification algorithm based on simplified fuzzy rules base","authors":"Yong He","doi":"10.1109/KAM.2010.5646200","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646200","url":null,"abstract":"This paper proposes a classification algorithm based on simplified fuzzy rules base combining fuzzy clustering with rough set. Firstly, generates fuzzy rules base using fuzzy clustering from numerical sample dates, and then simplifies the sample attributions using rough set theory, deletes the redundant rules, and gets the simplified fuzzy rules base, in order to make classification decision conveniently. The performance of the classification algorithm is tested by the IRIS data, and the results show that the fuzzy rules are not only intelligible, but also have very good classification performance.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520633","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-11-29DOI: 10.1109/KAM.2010.5646310
Yongsen Jiang
Many real-world signal processing applications require an enormous amount of computational power. When these applications are deployed in on-line settings, many hurdles including stringent timing constraints must be overcome. Additionally, the number of channels feeding mathematical DSP routines is growing rapidly, easily reaching 1,000 to 100,000 channels. These applications have increasingly demanding performance requirements for generating control outputs which interact with real-world processes, where 1ms loop times are not uncommon. In this paper, we describe a graphical dataflow approach capable of yielding the necessary computational power and meeting aggressive timing constraints. We combine this methodology with strategies for targeting a combination of processors including CPUs, FPGAs, and GPUs deployed on standard PCs, workstations, and real-time systems. We demonstrate this approach through case studies on adaptive mirror control for an extremely large telescope and plasma measurement via soft X-ray tomography.
{"title":"A graphical dataflow programming model for on-line signal processing on parallel architectures","authors":"Yongsen Jiang","doi":"10.1109/KAM.2010.5646310","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646310","url":null,"abstract":"Many real-world signal processing applications require an enormous amount of computational power. When these applications are deployed in on-line settings, many hurdles including stringent timing constraints must be overcome. Additionally, the number of channels feeding mathematical DSP routines is growing rapidly, easily reaching 1,000 to 100,000 channels. These applications have increasingly demanding performance requirements for generating control outputs which interact with real-world processes, where 1ms loop times are not uncommon. In this paper, we describe a graphical dataflow approach capable of yielding the necessary computational power and meeting aggressive timing constraints. We combine this methodology with strategies for targeting a combination of processors including CPUs, FPGAs, and GPUs deployed on standard PCs, workstations, and real-time systems. We demonstrate this approach through case studies on adaptive mirror control for an extremely large telescope and plasma measurement via soft X-ray tomography.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124150512","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-11-29DOI: 10.1109/KAM.2010.5646150
Liyu Zhu
Knowledge service vendor selection is an important task for the decision makers of the company in the knowledge economics. The purpose of this study is to investigate a fuzzy multiple criteria decision-making method for evaluating and selecting knowledge service vendor. In the paper, the multiple criteria should consider in the evaluation and selection process is presented. Then, a fuzzy MCDM approach based on fuzzy TOPSIS is proposed. The linguistic evaluation information given by the decision makers are transformed into the form of triangular fuzzy numbers. Based on the extended TOPSIS, the fuzzy positive-ideal solution (FPIS) and the fuzzy negative-ideal solution (FNIS) are determined. The relative closeness of each alternatives to the FPIS and FNIS is calculated to determine the ranking order of all alternatives. The evaluation results of the knowledge service providers can be obtained through the proposed fuzzy method and then the proper vendor can be selected. Additionally, an illustrating example is given to show the feasibility and practicability of the proposed approach.
{"title":"A fuzzy MCDM model for knowledge service vendor evaluation and selection","authors":"Liyu Zhu","doi":"10.1109/KAM.2010.5646150","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646150","url":null,"abstract":"Knowledge service vendor selection is an important task for the decision makers of the company in the knowledge economics. The purpose of this study is to investigate a fuzzy multiple criteria decision-making method for evaluating and selecting knowledge service vendor. In the paper, the multiple criteria should consider in the evaluation and selection process is presented. Then, a fuzzy MCDM approach based on fuzzy TOPSIS is proposed. The linguistic evaluation information given by the decision makers are transformed into the form of triangular fuzzy numbers. Based on the extended TOPSIS, the fuzzy positive-ideal solution (FPIS) and the fuzzy negative-ideal solution (FNIS) are determined. The relative closeness of each alternatives to the FPIS and FNIS is calculated to determine the ranking order of all alternatives. The evaluation results of the knowledge service providers can be obtained through the proposed fuzzy method and then the proper vendor can be selected. Additionally, an illustrating example is given to show the feasibility and practicability of the proposed approach.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126938118","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-11-29DOI: 10.1109/KAM.2010.5646185
Qiwei Hu, Guangyan Wang, Zhijun Ma
Equipment Battlefield damage repair (BDR) sequence is an important content in the equipment maintenance support decision-making in wartime. If not handled correctly, time, man-hours, parts, and resources will be wasted and opportunities to get back in the fight will be missed. The influence factors of equipment BDR sequence were analyzed considering the requirements of equipment maintenance support decision-making. The model of equipment battlefield damage repair sequence was established based on the theory and method of multiple attribute decision-making (MADM). The results of a case study showed that the method is feasible and effective.
{"title":"Research on equipment battlefield damage repair sequence modeling","authors":"Qiwei Hu, Guangyan Wang, Zhijun Ma","doi":"10.1109/KAM.2010.5646185","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646185","url":null,"abstract":"Equipment Battlefield damage repair (BDR) sequence is an important content in the equipment maintenance support decision-making in wartime. If not handled correctly, time, man-hours, parts, and resources will be wasted and opportunities to get back in the fight will be missed. The influence factors of equipment BDR sequence were analyzed considering the requirements of equipment maintenance support decision-making. The model of equipment battlefield damage repair sequence was established based on the theory and method of multiple attribute decision-making (MADM). The results of a case study showed that the method is feasible and effective.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130211283","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-11-29DOI: 10.1109/KAM.2010.5646203
M. H. Shakoor, M. Moattari
In this paper, a novel method for the digital image stabilization is proposed that use variance properties(VDIS) to reduce the computational cost of block matching algorithm for local motion estimation. This method based on calculation of variance of pixels in each frame and accumulated variance of each pixel in each location from first reference frame to current frame. Then calculate summation of all accumulated variance for current frame and using them for select best macroblock. Four macroblocks are used in each frame. By statistical calculation the best macroblock is selected then local motion vector(LMV) of selected macroblock, is estimated by using Full search algorithm. LMV of selected macroblcok is used as global motion vector(GMV) and it is used to stabilize that frame. Full search algorithm is used for motion estimation in selected macroblock, but partial distortion elimination (PDE)[1] method was used to terminate the improper candidate blocks and reduce computation for block matching.
{"title":"Digital image stabilization based on variance properties","authors":"M. H. Shakoor, M. Moattari","doi":"10.1109/KAM.2010.5646203","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646203","url":null,"abstract":"In this paper, a novel method for the digital image stabilization is proposed that use variance properties(VDIS) to reduce the computational cost of block matching algorithm for local motion estimation. This method based on calculation of variance of pixels in each frame and accumulated variance of each pixel in each location from first reference frame to current frame. Then calculate summation of all accumulated variance for current frame and using them for select best macroblock. Four macroblocks are used in each frame. By statistical calculation the best macroblock is selected then local motion vector(LMV) of selected macroblock, is estimated by using Full search algorithm. LMV of selected macroblcok is used as global motion vector(GMV) and it is used to stabilize that frame. Full search algorithm is used for motion estimation in selected macroblock, but partial distortion elimination (PDE)[1] method was used to terminate the improper candidate blocks and reduce computation for block matching.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122578108","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-11-29DOI: 10.1109/KAM.2010.5646284
Zhu Weixing, Wu Zhilei
A machine vision method is presented to identify porcine health in real-time by detecting porcine breath. Porcine images in top view are extracted by constructing video image acquisition system, and porcine contour is obtained by serious of image pretreatment. Concave-convex recognition method is used to determine the waist corner and scapular endpoint on one side of ventral lines. The length of the line between two points is measured using improved chain code algorithm. The data of length distribution are recorded to draw time-position figure, and the fluctuation of the target curve approximately reflects the porcine breath in frame sequences. So the breath rate could be expressed as the frequency of the curve. Compared with manual observation, the relative error of the result in this paper is about 6.05% in detecting respiratory rate. Therefore, machine vision-based method is effective for detecting porcine breath.
{"title":"Detection of porcine respiration based on machine vision","authors":"Zhu Weixing, Wu Zhilei","doi":"10.1109/KAM.2010.5646284","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646284","url":null,"abstract":"A machine vision method is presented to identify porcine health in real-time by detecting porcine breath. Porcine images in top view are extracted by constructing video image acquisition system, and porcine contour is obtained by serious of image pretreatment. Concave-convex recognition method is used to determine the waist corner and scapular endpoint on one side of ventral lines. The length of the line between two points is measured using improved chain code algorithm. The data of length distribution are recorded to draw time-position figure, and the fluctuation of the target curve approximately reflects the porcine breath in frame sequences. So the breath rate could be expressed as the frequency of the curve. Compared with manual observation, the relative error of the result in this paper is about 6.05% in detecting respiratory rate. Therefore, machine vision-based method is effective for detecting porcine breath.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116814591","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-11-29DOI: 10.1109/KAM.2010.5646140
Chengfu Sun
In this paper, an improved differential evolution based on hill-climbing techniques is proposed for multi-objective optimization. Multi-objective differential evolution optimizers are often trapped in local optima and converge slowly. A simple hill-climbing is employed to keep the diversity of population and escape from local optima. A novel crowding-distance computation procedure is proposed in order that the solutions in the neighborhood of the solutions with smallest and largest function values or locating in a lesser crowded region will have higher probability to be preserved. The proposed algorithm is tested on several classical MOP benchmark functions. The simulation results show that the proposed algorithm can obtain the solutions to be widely spread on the true Pareto optimal front‥
{"title":"An improved differential evolution and novel crowding distance metric for multi-objective optimization","authors":"Chengfu Sun","doi":"10.1109/KAM.2010.5646140","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646140","url":null,"abstract":"In this paper, an improved differential evolution based on hill-climbing techniques is proposed for multi-objective optimization. Multi-objective differential evolution optimizers are often trapped in local optima and converge slowly. A simple hill-climbing is employed to keep the diversity of population and escape from local optima. A novel crowding-distance computation procedure is proposed in order that the solutions in the neighborhood of the solutions with smallest and largest function values or locating in a lesser crowded region will have higher probability to be preserved. The proposed algorithm is tested on several classical MOP benchmark functions. The simulation results show that the proposed algorithm can obtain the solutions to be widely spread on the true Pareto optimal front‥","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116189492","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-11-29DOI: 10.1109/KAM.2010.5646328
Chang Jiang, N. Yu, Meihua Gu
H.264FRext video coding standard uses integer 8×8 discrete cosine transform (DCT) algorithm. It can preserve the detail image information better. Compared with the traditional cosine transform, integer DCT can avoid the mismatch problem, increase the computation speed, and is more feasible for hardware implementation. This paper proposes a novel two-dimension DCT hardware structure based on the fast papilionaceous algorithm and the reusable row and column transform unit. The proposed hardware architecture is described by Verilog HDL language and implemented with SMIC 0.18µm2 technology. Experiments show that the maximum delay of circuit is 2.74833ns after synthesis, and the area of the system is 94283.4844 µm2, which can satisfy the system requirments to both circuit area and speed.
h . 264freext视频编码标准采用整数8×8离散余弦变换(DCT)算法。它能更好地保留图像的细节信息。与传统的余弦变换相比，整数DCT可以避免不匹配问题，提高计算速度，并且更易于硬件实现。本文提出了一种基于快速蜂群算法和可重用行、列变换单元的二维DCT硬件结构。所提出的硬件架构由Verilog HDL语言描述，采用SMIC 0.18µm2技术实现。实验表明，合成后的电路最大延迟为2.74833ns，系统面积为94283.4844µm2，可以满足系统对电路面积和速度的要求。
{"title":"A novel VLSI architecture of 8×8 integer DCT based on H.264/AVC FRext","authors":"Chang Jiang, N. Yu, Meihua Gu","doi":"10.1109/KAM.2010.5646328","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646328","url":null,"abstract":"H.264FRext video coding standard uses integer 8×8 discrete cosine transform (DCT) algorithm. It can preserve the detail image information better. Compared with the traditional cosine transform, integer DCT can avoid the mismatch problem, increase the computation speed, and is more feasible for hardware implementation. This paper proposes a novel two-dimension DCT hardware structure based on the fast papilionaceous algorithm and the reusable row and column transform unit. The proposed hardware architecture is described by Verilog HDL language and implemented with SMIC 0.18µm2 technology. Experiments show that the maximum delay of circuit is 2.74833ns after synthesis, and the area of the system is 94283.4844 µm2, which can satisfy the system requirments to both circuit area and speed.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114642865","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-11-29DOI: 10.1109/KAM.2010.5646256
Xiaoxiao Zhang, Qizong Wu, Jianfeng Zhang
Predicting oil price movements is very important for investors. Fuzzy time series which combine people's subjective attitude and objective history values can help people to solve forecasting problems. It has been applied to many areas such as stock index, university enrollments, exchange rates and tourism forecasting. This paper brings fuzzy time series into short term crude oil price forecasting. We use West Taxes Intermediate oil as an example. To evaluate our method's performances, we use root mean square error method. Experiments show that fuzzy time series can produce good forecast results.
{"title":"Crude oil price forecasting using fuzzy time series","authors":"Xiaoxiao Zhang, Qizong Wu, Jianfeng Zhang","doi":"10.1109/KAM.2010.5646256","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646256","url":null,"abstract":"Predicting oil price movements is very important for investors. Fuzzy time series which combine people's subjective attitude and objective history values can help people to solve forecasting problems. It has been applied to many areas such as stock index, university enrollments, exchange rates and tourism forecasting. This paper brings fuzzy time series into short term crude oil price forecasting. We use West Taxes Intermediate oil as an example. To evaluate our method's performances, we use root mean square error method. Experiments show that fuzzy time series can produce good forecast results.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127830871","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-11-29DOI: 10.1109/KAM.2010.5646177
Qing He, Tingting Li, Fuzhen Zhuang, Zhongzhi Shi
Text clustering is an important technology for automatically structuring large document collections. It is much more valuable in peer-to-peer networks. The high dimensionality of documents means much more communication could be saved if each node could get the approximate clustering result by distributed algorithm instead of transferring them into a center and do the clustering. Most of the existing text clustering algorithms in unstructured peer-to-peer networks are based on K-means algorithm. A problem of those algorithms is that the clustering quality may decreased with the increase of the network size. In this paper, we propose a text clustering algorithm based on frequent term sets for peer-to-peer networks. It requires relatively lower communication volume while achieving a clustering result whose quality will not be affected by the size of the network. Moreover, it gives a term set describing each cluster, which makes it possible for people to have a clear comprehension for the clustering result, and facilitates the users to find resource in the network or manage the local documents in accordance with the whole network.
{"title":"Frequent term based peer-to-peer text clustering","authors":"Qing He, Tingting Li, Fuzhen Zhuang, Zhongzhi Shi","doi":"10.1109/KAM.2010.5646177","DOIUrl":"https://doi.org/10.1109/KAM.2010.5646177","url":null,"abstract":"Text clustering is an important technology for automatically structuring large document collections. It is much more valuable in peer-to-peer networks. The high dimensionality of documents means much more communication could be saved if each node could get the approximate clustering result by distributed algorithm instead of transferring them into a center and do the clustering. Most of the existing text clustering algorithms in unstructured peer-to-peer networks are based on K-means algorithm. A problem of those algorithms is that the clustering quality may decreased with the increase of the network size. In this paper, we propose a text clustering algorithm based on frequent term sets for peer-to-peer networks. It requires relatively lower communication volume while achieving a clustering result whose quality will not be affected by the size of the network. Moreover, it gives a term set describing each cluster, which makes it possible for people to have a clear comprehension for the clustering result, and facilitates the users to find resource in the network or manage the local documents in accordance with the whole network.","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127473800","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
扫码关注我们
求助内容：
应助结果提醒方式：