Pub Date : 2011-06-30DOI: 10.3745/KIPSTB.2011.18B.3.147
Chul-Hee Hwang, Myeongsu Kang, Yong-Bum Jung, Jong-Myon Kim
This paper proposes a 3-stage (preprocessing, feature extraction, and classification) fault detection and classification algorithm for induction motors. In the first stage, a low-pass filter is used to remove noise components in the fault signal. In the second stage, a discrete cosine transform (DCT) and a statistical method are used to extract features of the fault signal. Finally, a back propagation neural network (BPNN) method is applied to classify the fault signal. To evaluate the performance of the proposed algorithm, we used one second long normal/abnormal vibration signals of an induction motor sampled at 8kHz. Experimental results showed that the proposed algorithm achieves about 100% accuracy in fault classification, and it provides 50% improved accuracy when compared to the existing fault detection algorithm using a cross-covariance method. In a real-world data acquisition environment, unnecessary noise components are usually included to the real signal. Thus, we conducted an additional simulation to evaluate how well the proposed algorithm classifies the fault signals in a circumstance where a white Gaussian noise is inserted into the fault signals. The simulation results showed that the proposed algorithm achieves over 98% accuracy in fault classification. Moreover, we developed a testbed system including a TI`s DSP (digital signal processor) to implement and verify the functionality of the proposed algorithm.
{"title":"Highly Reliable Fault Detection and Classification Algorithm for Induction Motors","authors":"Chul-Hee Hwang, Myeongsu Kang, Yong-Bum Jung, Jong-Myon Kim","doi":"10.3745/KIPSTB.2011.18B.3.147","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.3.147","url":null,"abstract":"This paper proposes a 3-stage (preprocessing, feature extraction, and classification) fault detection and classification algorithm for induction motors. In the first stage, a low-pass filter is used to remove noise components in the fault signal. In the second stage, a discrete cosine transform (DCT) and a statistical method are used to extract features of the fault signal. Finally, a back propagation neural network (BPNN) method is applied to classify the fault signal. To evaluate the performance of the proposed algorithm, we used one second long normal/abnormal vibration signals of an induction motor sampled at 8kHz. Experimental results showed that the proposed algorithm achieves about 100% accuracy in fault classification, and it provides 50% improved accuracy when compared to the existing fault detection algorithm using a cross-covariance method. In a real-world data acquisition environment, unnecessary noise components are usually included to the real signal. Thus, we conducted an additional simulation to evaluate how well the proposed algorithm classifies the fault signals in a circumstance where a white Gaussian noise is inserted into the fault signals. The simulation results showed that the proposed algorithm achieves over 98% accuracy in fault classification. Moreover, we developed a testbed system including a TI`s DSP (digital signal processor) to implement and verify the functionality of the proposed algorithm.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121110596","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 : 2011-06-30DOI: 10.3745/KIPSTB.2011.18B.3.165
Hyun Kim, TaeChoong Chung
In this paper, we propose Ant-Q learning Algorithm[1], which uses the habits of biological ants, to find a new way to solve Stable Marriage Problem(SMP)[3] presented by Gale-Shapley[2]. The issue of SMP is to find optimum matching for a stable marriage based on their preference lists (PL). The problem of Gale-Shapley algorithm is to get a stable matching for only male (or female). We propose other way to satisfy various requirements for SMP. ACS(Ant colony system) is an swarm intelligence method to find optimal solution by using phermone of ants. We try to improve ACS technique by adding Q learning[9] concept. This Ant-Q method can solve SMP problem for various requirements. The experiment results shows the proposed method is good for the problem.
{"title":"Solving the Gale-Shapley Problem by Ant-Q learning","authors":"Hyun Kim, TaeChoong Chung","doi":"10.3745/KIPSTB.2011.18B.3.165","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.3.165","url":null,"abstract":"In this paper, we propose Ant-Q learning Algorithm[1], which uses the habits of biological ants, to find a new way to solve Stable Marriage Problem(SMP)[3] presented by Gale-Shapley[2]. The issue of SMP is to find optimum matching for a stable marriage based on their preference lists (PL). The problem of Gale-Shapley algorithm is to get a stable matching for only male (or female). We propose other way to satisfy various requirements for SMP. ACS(Ant colony system) is an swarm intelligence method to find optimal solution by using phermone of ants. We try to improve ACS technique by adding Q learning[9] concept. This Ant-Q method can solve SMP problem for various requirements. The experiment results shows the proposed method is good for the problem.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134136596","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 : 2011-06-30DOI: 10.3745/KIPSTB.2011.18B.3.117
SungHwan Jeong, Joonwhoan Lee
The purpose of this study is to produce a better way to detect crossroad accidents, which involves an efficient method to produce background images in consideration of object movement and preserve/demonstrate the candidate accident region. One of the prior studies proposed an employment of traffic signal interval within crossroad to detect accidents on crossroad, but it may cause a failure to detect unwanted accidents if any object is covered on an accident site. This study adopted inverse perspective mapping to control the scale of object, and proposed different ways such as producing robust background images enough to resist surrounding noise, generating candidate accident regions through information on object movement, and by using edge information to preserve and delete the candidate accident region. In order to measure the performance of proposed algorithm, a variety of traffic images were saved and used for experiment (e.g. recorded images on rush hours via DVR installed on crossroad, different accident images recorded in day and night rainy days, and recorded images including surrounding noise of lighting and shades). As a result, it was found that there were all 20 experiment cases of accident detected and actual effective rate of accident detection amounted to 76.9% on average. In addition, the image processing rate ranged from 10~14 frame/sec depending on the area of detection region. Thus, it is concluded that there will be no problem in real-time image processing.
{"title":"Robust Vision Based Algorithm for Accident Detection of Crossroad","authors":"SungHwan Jeong, Joonwhoan Lee","doi":"10.3745/KIPSTB.2011.18B.3.117","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.3.117","url":null,"abstract":"The purpose of this study is to produce a better way to detect crossroad accidents, which involves an efficient method to produce background images in consideration of object movement and preserve/demonstrate the candidate accident region. One of the prior studies proposed an employment of traffic signal interval within crossroad to detect accidents on crossroad, but it may cause a failure to detect unwanted accidents if any object is covered on an accident site. This study adopted inverse perspective mapping to control the scale of object, and proposed different ways such as producing robust background images enough to resist surrounding noise, generating candidate accident regions through information on object movement, and by using edge information to preserve and delete the candidate accident region. In order to measure the performance of proposed algorithm, a variety of traffic images were saved and used for experiment (e.g. recorded images on rush hours via DVR installed on crossroad, different accident images recorded in day and night rainy days, and recorded images including surrounding noise of lighting and shades). As a result, it was found that there were all 20 experiment cases of accident detected and actual effective rate of accident detection amounted to 76.9% on average. In addition, the image processing rate ranged from 10~14 frame/sec depending on the area of detection region. Thus, it is concluded that there will be no problem in real-time image processing.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134372189","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 : 2011-06-30DOI: 10.3745/KIPSTB.2011.18B.3.139
Jeong-Yeop Kim, Sang-Hyun Kim
The color correction is the important process of influencing on the picture quality of the 3D stereoscopic images. Existing colorcorrecting methods handle the processing intensifying a correspondence among a left and right image using a histogram based on any one side. In case of color correction based on a histogram, it is difficult to correct tone of image, because the color temperature is not converted enough. And in this paper, the color temperature correction and color consistency correction is proposed without using histogram. The proposed color correction method by color temperature gives 3 in CIE- for each pixel on the images captured with same illuminants and the conventional gives similar results. For color consistency, the proposed gives 9 in CIE- on the images captured with different illuminants while the conventional gives 18. The proposed method shows better results than the conventional in color consistency processing.
{"title":"A Correction of Color Temperature and Consistency for 3D Stereoscopic Images","authors":"Jeong-Yeop Kim, Sang-Hyun Kim","doi":"10.3745/KIPSTB.2011.18B.3.139","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.3.139","url":null,"abstract":"The color correction is the important process of influencing on the picture quality of the 3D stereoscopic images. Existing colorcorrecting methods handle the processing intensifying a correspondence among a left and right image using a histogram based on any one side. In case of color correction based on a histogram, it is difficult to correct tone of image, because the color temperature is not converted enough. And in this paper, the color temperature correction and color consistency correction is proposed without using histogram. The proposed color correction method by color temperature gives 3 in CIE- for each pixel on the images captured with same illuminants and the conventional gives similar results. For color consistency, the proposed gives 9 in CIE- on the images captured with different illuminants while the conventional gives 18. The proposed method shows better results than the conventional in color consistency processing.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117024755","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 : 2011-06-01DOI: 10.3745/KIPSTB.2011.18B.6.365
Jaehyun Jeon, Semin Kim, S. Han, Yong Man Ro
Recently, malicious video classification and filtering techniques are of practical interest as ones can easily access to malicious multimedia contents through the Internet, IPTV, online social network, and etc. Considerable research efforts have been made to developing malicious video classification and filtering systems. However, the malicious video classification and filtering is not still being from mature in terms of reliable classification/filtering performance. In particular, the most of conventional approaches have been limited to using only the spatial features (such as a ratio of skin regions and bag of visual words) for the purpose of malicious image classification. Hence, previous approaches have been restricted to achieving acceptable classification and filtering performance. In order to overcome the aforementioned limitation, we propose new malicious video classification framework that takes advantage of using both the spatial and temporal features that are readily extracted from a sequence of video frames. In particular, we develop the effective temporal features based on the motion periodicity feature and temporal correlation. In addition, to exploit the best data fusion approach aiming to combine the spatial and temporal features, the representative data fusion approaches are applied to the proposed framework. To demonstrate the effectiveness of our method, we collect 200 sexual intercourse videos and 200 non-sexual intercourse videos. Experimental results show that the proposed method increases 3.75% (from 92.25% to 96%) for classification of sexual intercourse video in terms of accuracy. Further, based on our experimental results, feature-level fusion approach (for fusing spatial and temporal features) is found to achieve the best classification accuracy.
{"title":"Using the fusion of spatial and temporal features for malicious video classification","authors":"Jaehyun Jeon, Semin Kim, S. Han, Yong Man Ro","doi":"10.3745/KIPSTB.2011.18B.6.365","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.6.365","url":null,"abstract":"Recently, malicious video classification and filtering techniques are of practical interest as ones can easily access to malicious multimedia contents through the Internet, IPTV, online social network, and etc. Considerable research efforts have been made to developing malicious video classification and filtering systems. However, the malicious video classification and filtering is not still being from mature in terms of reliable classification/filtering performance. In particular, the most of conventional approaches have been limited to using only the spatial features (such as a ratio of skin regions and bag of visual words) for the purpose of malicious image classification. Hence, previous approaches have been restricted to achieving acceptable classification and filtering performance. In order to overcome the aforementioned limitation, we propose new malicious video classification framework that takes advantage of using both the spatial and temporal features that are readily extracted from a sequence of video frames. In particular, we develop the effective temporal features based on the motion periodicity feature and temporal correlation. In addition, to exploit the best data fusion approach aiming to combine the spatial and temporal features, the representative data fusion approaches are applied to the proposed framework. To demonstrate the effectiveness of our method, we collect 200 sexual intercourse videos and 200 non-sexual intercourse videos. Experimental results show that the proposed method increases 3.75% (from 92.25% to 96%) for classification of sexual intercourse video in terms of accuracy. Further, based on our experimental results, feature-level fusion approach (for fusing spatial and temporal features) is found to achieve the best classification accuracy.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115698319","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 : 2011-04-30DOI: 10.3745/KIPSTB.2011.18B.2.093
S. Lee
We propose a extended vector space model by using ambiguous words and disambiguous words to improve the result of a Korean document classification method. In this paper we study the precision enhancement of vector space model and we propose a new axis that represents a weight value. Conventional classification methods without the weight value had some problems in vector comparison. We define a word which has same axis of the weight value as ambiguous word after calculating a mutual information value between a term and its classification field. We define a word which is disambiguous with ambiguous meaning as disambiguous word. We decide the strengthness of a disambiguous word among several words which is occurring ambiguous word and a same document. Finally, we proposed a new classification method based on extension of vector dimension with ambiguous and disambiguous words.
{"title":"Korean Document Classification Using Extended Vector Space Model","authors":"S. Lee","doi":"10.3745/KIPSTB.2011.18B.2.093","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.2.093","url":null,"abstract":"We propose a extended vector space model by using ambiguous words and disambiguous words to improve the result of a Korean document classification method. In this paper we study the precision enhancement of vector space model and we propose a new axis that represents a weight value. Conventional classification methods without the weight value had some problems in vector comparison. We define a word which has same axis of the weight value as ambiguous word after calculating a mutual information value between a term and its classification field. We define a word which is disambiguous with ambiguous meaning as disambiguous word. We decide the strengthness of a disambiguous word among several words which is occurring ambiguous word and a same document. Finally, we proposed a new classification method based on extension of vector dimension with ambiguous and disambiguous words.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114445434","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 : 2011-04-30DOI: 10.3745/KIPSTB.2011.18B.2.067
Jungseob Lee, Ki-Seob Shin, K. Wee
Single nucleotide polymorphisms (SNPs) are a very important tool for the study of human genome structure. Cluster analysis of the large amount of gene expression data is useful for identifying biologically relevant groups of genes and for generating networks of gene-gene interactions. In this paper we compared the clusters of SNPs within asthma group and normal control group obtained by using hierarchical cluster analysis method with entropy distance. It appears that the 5-cluster collections of the two groups are significantly different. We searched the best set of SNPs that are useful for diagnosing the two types of asthma using representative SNPs of the clusters of the asthma group. Here support vector machines are used to evaluate the prediction accuracy of the selected combinations. The best combination model turns out to be the five-locus SNPs including one on the gene ALOX12 and their accuracy in predicting aspirin tolerant asthma disease risk among asthmatic patients is 66.41%.
{"title":"Cluster Analysis of SNPs with Entropy Distance and Prediction of Asthma Type Using SVM","authors":"Jungseob Lee, Ki-Seob Shin, K. Wee","doi":"10.3745/KIPSTB.2011.18B.2.067","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.2.067","url":null,"abstract":"Single nucleotide polymorphisms (SNPs) are a very important tool for the study of human genome structure. Cluster analysis of the large amount of gene expression data is useful for identifying biologically relevant groups of genes and for generating networks of gene-gene interactions. In this paper we compared the clusters of SNPs within asthma group and normal control group obtained by using hierarchical cluster analysis method with entropy distance. It appears that the 5-cluster collections of the two groups are significantly different. We searched the best set of SNPs that are useful for diagnosing the two types of asthma using representative SNPs of the clusters of the asthma group. Here support vector machines are used to evaluate the prediction accuracy of the selected combinations. The best combination model turns out to be the five-locus SNPs including one on the gene ALOX12 and their accuracy in predicting aspirin tolerant asthma disease risk among asthmatic patients is 66.41%.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"28 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114182514","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 : 2011-04-30DOI: 10.3745/KIPSTB.2011.18B.2.051
Dal-Hyoun Kim, Dong-Guk Hwang, Woo-Ram Lee, Byoung-Min Jun
Algorithms for intrinsic images reduce color differences in RGB images caused by the temperature of black-body radiators. Based on the reference light and detecting single invariant direction, these algorithms are weak in real images which can have multiple invariant directions when the scene illuminant is a colored illuminant. To solve these problems, this paper proposes a method of acquiring an intrinsic image by omnidirectional projection of an ROI and a translation of white patch in the -chromaticity space. Because it is not easy to analyze an image in the three-dimensional RGB space, the -chromaticity is also employed without the brightness factor in this paper. After the effect of the colored illuminant is decreased by a translation of white patch, an invariant direction is detected by omnidirectional projection of an ROI in this chromaticity space. In case the RGB image has multiple invariant directions, only one ROI is selected with the bin, which has the highest frequency in 3D histogram. And then the two operations, projection and inverse transformation, make intrinsic image acquired. In the experiments, test images were four datasets presented by Ebner and evaluation methods was the follows: standard deviation of the invariant direction, the constancy measure, the color space measure and the color constancy measure. The experimental results showed that the proposed method had lower standard deviation than the entropy, that its performance was two times higher than the compared algorithm.
{"title":"Acquisition of Intrinsic Image by Omnidirectional Projection of ROI and Translation of White Patch on the X-chromaticity Space","authors":"Dal-Hyoun Kim, Dong-Guk Hwang, Woo-Ram Lee, Byoung-Min Jun","doi":"10.3745/KIPSTB.2011.18B.2.051","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.2.051","url":null,"abstract":"Algorithms for intrinsic images reduce color differences in RGB images caused by the temperature of black-body radiators. Based on the reference light and detecting single invariant direction, these algorithms are weak in real images which can have multiple invariant directions when the scene illuminant is a colored illuminant. To solve these problems, this paper proposes a method of acquiring an intrinsic image by omnidirectional projection of an ROI and a translation of white patch in the -chromaticity space. Because it is not easy to analyze an image in the three-dimensional RGB space, the -chromaticity is also employed without the brightness factor in this paper. After the effect of the colored illuminant is decreased by a translation of white patch, an invariant direction is detected by omnidirectional projection of an ROI in this chromaticity space. In case the RGB image has multiple invariant directions, only one ROI is selected with the bin, which has the highest frequency in 3D histogram. And then the two operations, projection and inverse transformation, make intrinsic image acquired. In the experiments, test images were four datasets presented by Ebner and evaluation methods was the follows: standard deviation of the invariant direction, the constancy measure, the color space measure and the color constancy measure. The experimental results showed that the proposed method had lower standard deviation than the entropy, that its performance was two times higher than the compared algorithm.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131387542","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 : 2011-04-30DOI: 10.3745/KIPSTB.2011.18B.2.083
Incheol Kim, Hui-Kyoung Oh
In this paper, we present the plan execution model for dynamic mobile computing environments, and then introduce the smart script system developed on these base models. The smart script system includes the smart script language, in which the task knowledge of a mobile personal assistant is represented, and the script execution engine, by which the scripts are dynamically executed in response to the given task goal and the environmental changes. In order to evaluate the utility and the performance of our system, we implement an application service called Smart Reservation and conduct some experiments.
{"title":"A Smart Script System for Implementing Intelligent Behaviors of Mobile Personal Assistants","authors":"Incheol Kim, Hui-Kyoung Oh","doi":"10.3745/KIPSTB.2011.18B.2.083","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.2.083","url":null,"abstract":"In this paper, we present the plan execution model for dynamic mobile computing environments, and then introduce the smart script system developed on these base models. The smart script system includes the smart script language, in which the task knowledge of a mobile personal assistant is represented, and the script execution engine, by which the scripts are dynamically executed in response to the given task goal and the environmental changes. In order to evaluate the utility and the performance of our system, we implement an application service called Smart Reservation and conduct some experiments.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126374328","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 : 2011-04-30DOI: 10.3745/KIPSTB.2011.18B.2.073
Sook-Hi Hwang, Il-Yong Weon, Sung-Bum Ko, Chang-Hoon Lee
There are a lot of people trying to solve the Traveling Salesman Problem (TSP) by using the Meta Heuristic Algorithms. TSP is an NP-Hard problem, and is used in testing search algorithms and optimization algorithms. Also TSP is one of the models of social problems. Many methods are proposed like Hybrid methods and Custom-built methods in Meta Heuristic. In this paper, we propose the S-MINE Algorithm to use the MINE Algorithm introduced in 2009 on the TSP.
{"title":"S-MINE Algorithm for the TSP","authors":"Sook-Hi Hwang, Il-Yong Weon, Sung-Bum Ko, Chang-Hoon Lee","doi":"10.3745/KIPSTB.2011.18B.2.073","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.2.073","url":null,"abstract":"There are a lot of people trying to solve the Traveling Salesman Problem (TSP) by using the Meta Heuristic Algorithms. TSP is an NP-Hard problem, and is used in testing search algorithms and optimization algorithms. Also TSP is one of the models of social problems. Many methods are proposed like Hybrid methods and Custom-built methods in Meta Heuristic. In this paper, we propose the S-MINE Algorithm to use the MINE Algorithm introduced in 2009 on the TSP.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134372846","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
扫码关注我们
求助内容：
应助结果提醒方式：