Nowadays, data mining plays an important role in many sciences, including intrusion detection system (IDS). However, one of the essential steps of data mining is feature selection, because feature selection can help improve the efficiency of prediction rate. The previous researches, selecting features in the raw data, are difficult to implement. This paper proposes feature selection based on Euclidean Distance and Cosine Similarity which ease to implement. The experiment results show that the proposed approach can select a robust feature subset to build models for detecting known and unknown attack patterns of computer network connections. This proposed approach can improve the performance of a true positive intrusion detection rate.
{"title":"Feature Selection Using Euclidean Distance and Cosine Similarity for Intrusion Detection Model","authors":"A. Suebsing, N. Hiransakolwong","doi":"10.1109/ACIIDS.2009.23","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.23","url":null,"abstract":"Nowadays, data mining plays an important role in many sciences, including intrusion detection system (IDS). However, one of the essential steps of data mining is feature selection, because feature selection can help improve the efficiency of prediction rate. The previous researches, selecting features in the raw data, are difficult to implement. This paper proposes feature selection based on Euclidean Distance and Cosine Similarity which ease to implement. The experiment results show that the proposed approach can select a robust feature subset to build models for detecting known and unknown attack patterns of computer network connections. This proposed approach can improve the performance of a true positive intrusion detection rate.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124479136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The session Initiation Protocol (SIP) is a widely used application-layer control protocol. The processing load of the SIP protocol is reportedly seen as one of the potential problems which may limit the range of its application although it has a number of advantages. Many research efforts have been made and have come up with various compression algorithms to reduce the packet size in order not to waste scarce bandwidth especially for wireless access networks. However, they increase the processing load at the same time. We propose a lightweight application-layer signaling protocol (lightweight-SIP) which reduces network bandwidth without sacrificing CPU performance by introducing a gateway which translates SIP into the proposed protocol. The gateway works as a cache for static and lengthy header fields of SIP messages. We expect the proposed protocol to be used by low-spec devices such as sensor nodes, less-expensive surveillance cameras and wearable computers so that it could reduce the energy consumption and lengthening the battery life or loosen requirements for the hardware specs.
{"title":"A Lightweight Application-Layer Signaling Protocol","authors":"T. Kitamura, Takayuki Shizuno, T. Okabe, H. Tani","doi":"10.1109/ACIIDS.2009.47","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.47","url":null,"abstract":"The session Initiation Protocol (SIP) is a widely used application-layer control protocol. The processing load of the SIP protocol is reportedly seen as one of the potential problems which may limit the range of its application although it has a number of advantages. Many research efforts have been made and have come up with various compression algorithms to reduce the packet size in order not to waste scarce bandwidth especially for wireless access networks. However, they increase the processing load at the same time. We propose a lightweight application-layer signaling protocol (lightweight-SIP) which reduces network bandwidth without sacrificing CPU performance by introducing a gateway which translates SIP into the proposed protocol. The gateway works as a cache for static and lengthy header fields of SIP messages. We expect the proposed protocol to be used by low-spec devices such as sensor nodes, less-expensive surveillance cameras and wearable computers so that it could reduce the energy consumption and lengthening the battery life or loosen requirements for the hardware specs.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123567429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The minimum energy control problem of infinite-dimensional fractional-discrete time linear systems both without delays and with delays in control is discussed. Using methods taken from functional analysis necessary and sufficient conditions for the exact controllablity of the system are established. Next, assuming exact controllability analytical solution of the minimum energy control of the infinite-dimensional fractional discrete-time systems is given. A procedure for computation of the optimal sequence of inputs minimizing the quadratic performance index is proposed.
{"title":"Controllability and Minimum Energy Control Problem of Infinite Dimensional Fractional Discrete-Time Systems with Delays","authors":"J. Klamka","doi":"10.1109/ACIIDS.2009.53","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.53","url":null,"abstract":"The minimum energy control problem of infinite-dimensional fractional-discrete time linear systems both without delays and with delays in control is discussed. Using methods taken from functional analysis necessary and sufficient conditions for the exact controllablity of the system are established. Next, assuming exact controllability analytical solution of the minimum energy control of the infinite-dimensional fractional discrete-time systems is given. A procedure for computation of the optimal sequence of inputs minimizing the quadratic performance index is proposed.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123652217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper explores the method for Korean text watermarking and develops a morpheme-based scheme that a predicate nominal is segmented into a nominal and a predicate. Korean, as an agglutinative language, provides a good ground for the morpheme-based natural language watermarking. Korean word usually consists of a content morpheme and function morphemes. However, predicate nominal has two content morphemes--nominal and predicate. So, we propose a method to separate a predicate nominal into two words and assign a content morpheme into each of the new words. The division of a predicate nominal does not change the meaning of the sentence, and it also ensures the naturalness of the sentence.Our proposed natural language watermarking method consists of five procedures. First, we perform morphological analysis of unmarked text. Next, we choose target predicate nominals for division, and determine the division type. And then, we employ an insertion bit according to the division type. Third, we embed a watermark bit for each predicate nominal. Fourth, if the watermark bit does not correspond to the insertion bit, we divide the predicate nominal into two words. Finally, we obtain marked text. From the experimental results, we show that the rate of unnatural sentences in marked text is significantly lower than that of previous systems. Experimental results also show that the marked text keeps the same style, and it has the same information without semantic distortion.
{"title":"Natural Language Watermarking by Morpheme Segmentation","authors":"Mi-Young Kim","doi":"10.1109/ACIIDS.2009.21","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.21","url":null,"abstract":"This paper explores the method for Korean text watermarking and develops a morpheme-based scheme that a predicate nominal is segmented into a nominal and a predicate. Korean, as an agglutinative language, provides a good ground for the morpheme-based natural language watermarking. Korean word usually consists of a content morpheme and function morphemes. However, predicate nominal has two content morphemes--nominal and predicate. So, we propose a method to separate a predicate nominal into two words and assign a content morpheme into each of the new words. The division of a predicate nominal does not change the meaning of the sentence, and it also ensures the naturalness of the sentence.Our proposed natural language watermarking method consists of five procedures. First, we perform morphological analysis of unmarked text. Next, we choose target predicate nominals for division, and determine the division type. And then, we employ an insertion bit according to the division type. Third, we embed a watermark bit for each predicate nominal. Fourth, if the watermark bit does not correspond to the insertion bit, we divide the predicate nominal into two words. Finally, we obtain marked text. From the experimental results, we show that the rate of unnatural sentences in marked text is significantly lower than that of previous systems. Experimental results also show that the marked text keeps the same style, and it has the same information without semantic distortion.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117281729","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}
In this study, an independent component analysis (ICA)-based signal reconstruction with neural network is proposed for financial time series forecasting. ICA is a novel statistical signal processing technique that was originally proposed to find the latent source signals from observed mixture signal without knowing any prior knowledge of the mixing mechanism. The proposed approach first uses ICA on the forecasting variables to generate the independent components (ICs). After identifying and removing the ICs containing the noise, the rest of the ICs are then used to reconstruct the forecasting variables. The reconstructed forecasting variables will contain less noise information and are served as the input variables of the back propagation neural network (BPN) to build the forecasting model. Experimental results on TAIEX (Taiwan Stock Exchange Capitalization Weighted Stock Index) closing cash index show that the proposed model outperforms the BPN model with non-filtered forecasting variables and random walk model.
{"title":"ICA-Based Signal Reconstruction Scheme with Neural Network in Time Series Forecasting","authors":"Chi-Jie Lu, Jui-Yu Wu, Tian-Shyug Lee","doi":"10.1109/ACIIDS.2009.28","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.28","url":null,"abstract":"In this study, an independent component analysis (ICA)-based signal reconstruction with neural network is proposed for financial time series forecasting. ICA is a novel statistical signal processing technique that was originally proposed to find the latent source signals from observed mixture signal without knowing any prior knowledge of the mixing mechanism. The proposed approach first uses ICA on the forecasting variables to generate the independent components (ICs). After identifying and removing the ICs containing the noise, the rest of the ICs are then used to reconstruct the forecasting variables. The reconstructed forecasting variables will contain less noise information and are served as the input variables of the back propagation neural network (BPN) to build the forecasting model. Experimental results on TAIEX (Taiwan Stock Exchange Capitalization Weighted Stock Index) closing cash index show that the proposed model outperforms the BPN model with non-filtered forecasting variables and random walk model.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126298279","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}
Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 ≤ D
{"title":"New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem","authors":"Huynh Thi Thanh Binh, N. D. Nghia","doi":"10.1109/ACIIDS.2009.89","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.89","url":null,"abstract":"Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 ≤ D","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132371966","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}
K. Saleem, N. Fisal, M. S. Abdullah, A. B. Zulkarmwan, S. Ariffin, S. Yusof
The field of wireless sensor network (WSN) is an important and challenging research area today. Advancements in sensor networks enable a wide range of environmental monitoring and object tracking applications. Secure routing in sensor networks is a difficult problem due to the resources limitations in WSN. Moreover, multihop routing in WSN is affected by new nodes constantly entering/leaving the system. Therefore, biologically inspired algorithms are reviewed and enhanced to tackle problems arise in WSN. Ant routing and human self security systems have shown an excellent performance for WSNs. Certain parameters like energy level, link quality, lose rate are considered while making decision. This decision will come up with the optimal route and also to take best action against the security attacks. In this paper, the design and initial work on BIOlogical-inspired self-organized Secure Autonomous Routing Protocol (BIOSARP) for WSNs is presented. The proposed bio-inspired algorithm will also meet the enhanced sensor network requirements, including energy consumption, success rate and time.
{"title":"Proposed Nature Inspired Self-Organized Secure Autonomous Mechanism for WSNs","authors":"K. Saleem, N. Fisal, M. S. Abdullah, A. B. Zulkarmwan, S. Ariffin, S. Yusof","doi":"10.1109/ACIIDS.2009.75","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.75","url":null,"abstract":"The field of wireless sensor network (WSN) is an important and challenging research area today. Advancements in sensor networks enable a wide range of environmental monitoring and object tracking applications. Secure routing in sensor networks is a difficult problem due to the resources limitations in WSN. Moreover, multihop routing in WSN is affected by new nodes constantly entering/leaving the system. Therefore, biologically inspired algorithms are reviewed and enhanced to tackle problems arise in WSN. Ant routing and human self security systems have shown an excellent performance for WSNs. Certain parameters like energy level, link quality, lose rate are considered while making decision. This decision will come up with the optimal route and also to take best action against the security attacks. In this paper, the design and initial work on BIOlogical-inspired self-organized Secure Autonomous Routing Protocol (BIOSARP) for WSNs is presented. The proposed bio-inspired algorithm will also meet the enhanced sensor network requirements, including energy consumption, success rate and time.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134505089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The large population exerts high burdens to Chinese health census works. In this paper, we propose our PDCAS (Pulmonary Disease Census Aiding System) based on Medical Image Grid, which aims to utilize the superiorities of grid technology to improve the efficiency of high-incidence and occupational pulmonary disease census. PDCAS integrates the individual medical information distributed in different hospitals’ information systems into Medical Information Centre of one area. The census records are classified through one risk rate based cross clustering model to direct the medical diagnosis and review. The main processing algorithms of PDCAS are subdivided and encapsulated as detachable web services with adapted granularity to support the grid workflow composition corresponding to different pulmonary diseases or aiding aims. The prototype of PDCAS proves the possible improvement of grid technology to diseases census and other data intensive medical applications.
{"title":"Pulmonary Disease Census Aiding System Based on Medical Image Grid","authors":"Hai Jin, Aobing Sun, Qin Zhang, Ran Zheng, R. He","doi":"10.1109/ACIIDS.2009.81","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.81","url":null,"abstract":"The large population exerts high burdens to Chinese health census works. In this paper, we propose our PDCAS (Pulmonary Disease Census Aiding System) based on Medical Image Grid, which aims to utilize the superiorities of grid technology to improve the efficiency of high-incidence and occupational pulmonary disease census. PDCAS integrates the individual medical information distributed in different hospitals’ information systems into Medical Information Centre of one area. The census records are classified through one risk rate based cross clustering model to direct the medical diagnosis and review. The main processing algorithms of PDCAS are subdivided and encapsulated as detachable web services with adapted granularity to support the grid workflow composition corresponding to different pulmonary diseases or aiding aims. The prototype of PDCAS proves the possible improvement of grid technology to diseases census and other data intensive medical applications.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"77 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134051222","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}
Wireless sensor and actor networks (WSANs) are a set of coexistence sensors and actors connected wirelessly to perform cooperatively sensing and interaction to physical environment. Nowadays, WSANs are used in many important application areas. Main concern in all networks is connectivity of the network nodes, in WSANs because of majority of their applications, connectivity issue is even more vital. As WSANs deployment environment is not deterministic and mostly harsh, failure and partitioning of network upon actor’s failure is more probable. In this paper we put forward a distributed, proactive algorithm to restore actor-actor connectivity of WSANs that minimizes time of reconnecting the network and also total required movements of actors. We identify critical actor nodes and when a critical actor fails, we try to reconnect the network by relocating other actors. We validate our superiority through simulative experiments. Our approach serves significant decrease in total number of communicated messages through decision making for restoration planning and consequently decreases in network reconnection time compared to optimal cascading and other works. It also minimizes total movement of actors compared to other works.
{"title":"Self Actor-Actor Connectivity Restoration in Wireless Sensor and Actor Networks","authors":"A. Zamanifar, M. Sharifi, Omid Kashefi","doi":"10.1109/ACIIDS.2009.45","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.45","url":null,"abstract":"Wireless sensor and actor networks (WSANs) are a set of coexistence sensors and actors connected wirelessly to perform cooperatively sensing and interaction to physical environment. Nowadays, WSANs are used in many important application areas. Main concern in all networks is connectivity of the network nodes, in WSANs because of majority of their applications, connectivity issue is even more vital. As WSANs deployment environment is not deterministic and mostly harsh, failure and partitioning of network upon actor’s failure is more probable. In this paper we put forward a distributed, proactive algorithm to restore actor-actor connectivity of WSANs that minimizes time of reconnecting the network and also total required movements of actors. We identify critical actor nodes and when a critical actor fails, we try to reconnect the network by relocating other actors. We validate our superiority through simulative experiments. Our approach serves significant decrease in total number of communicated messages through decision making for restoration planning and consequently decreases in network reconnection time compared to optimal cascading and other works. It also minimizes total movement of actors compared to other works.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134069480","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}
Music evokes various human emotions or creates music moods through low level musical features. In fact, typical music consists of one or more moods and this can be used as an important factor for determining the similarity between music. In this paper, we propose a new music retrieval scheme based on the mood change pattern. For this, we first divide music clips into segments based on low level musical features. Then, we apply K-means clustering algorithm for grouping them into clusters with similar features. By assigning a unique mood symbol for each group, each music clip can be represented into a sequence of mood symbols. Then, we estimate the similarity of music based on the similarity of their musical mood sequence using the Longest Common Subsequence (LCS) algorithm. To evaluate the performance of our scheme, we carried out various experiments and measured the user evaluation. We report some of the results.
{"title":"A Similar Music Retrieval Scheme Based on Musical Mood Variation","authors":"Sanghoon Jun, Byeong-jun Han, Eenjun Hwang","doi":"10.1109/ACIIDS.2009.65","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.65","url":null,"abstract":"Music evokes various human emotions or creates music moods through low level musical features. In fact, typical music consists of one or more moods and this can be used as an important factor for determining the similarity between music. In this paper, we propose a new music retrieval scheme based on the mood change pattern. For this, we first divide music clips into segments based on low level musical features. Then, we apply K-means clustering algorithm for grouping them into clusters with similar features. By assigning a unique mood symbol for each group, each music clip can be represented into a sequence of mood symbols. Then, we estimate the similarity of music based on the similarity of their musical mood sequence using the Longest Common Subsequence (LCS) algorithm. To evaluate the performance of our scheme, we carried out various experiments and measured the user evaluation. We report some of the results.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133688237","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
扫码关注我们
求助内容：
应助结果提醒方式：