Junghee Kim, Youlin Jin, S. Lim, Karpjoo Jeong, J. Woo, Eun Yi Kim
Many people want to feel safe and secure by monitoring events and changes surrounding them that affect their quality of life. This concern prompted the development of the environment monitoring system. Among the many research groups, sensors and sensor network are their choice of tool for environment monitoring system. Data management is the most challenging issue when we are using sensor networks. To compose sensor network environment need various kind of sensors which does not have standard way to describe sensors and sensor data. In this paper, we will discuss the data management system for the Distributed Real-time Emissions Air pollutants Monitoring System (DREAM). In this system, we will discuss sensor data modeling and usage of those data.
{"title":"A Data Management System for Distributed Real-Time Emissions and Air Pollutants Monitoring System","authors":"Junghee Kim, Youlin Jin, S. Lim, Karpjoo Jeong, J. Woo, Eun Yi Kim","doi":"10.1109/ACIIDS.2009.84","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.84","url":null,"abstract":"Many people want to feel safe and secure by monitoring events and changes surrounding them that affect their quality of life. This concern prompted the development of the environment monitoring system. Among the many research groups, sensors and sensor network are their choice of tool for environment monitoring system. Data management is the most challenging issue when we are using sensor networks. To compose sensor network environment need various kind of sensors which does not have standard way to describe sensors and sensor data. In this paper, we will discuss the data management system for the Distributed Real-time Emissions Air pollutants Monitoring System (DREAM). In this system, we will discuss sensor data modeling and usage of those data.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"37 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":"122309417","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 suggest a new camera calibration approach based on the neural network model. The proposed approach is shown to be very accurate because the neural network model implicitly contains all the physical parameters, some of which are very difficult to be estimated in the conventional explicit calibration methods. As the first step of this approach, this paper presents the camera calibration process which enables the coordinate transformation between 2D image points and points of a certain space in 3D real world. However, this approach is currently extended to be a general 3D camera calibration method in terms of 2 plane method. Experimental comparison of our method with well-known Tsai's 2 stage method is made to verify the accuracy of the proposed method.
{"title":"Implicit Camera Calibration Using MultiLayer Perceptron Type Neural Network","authors":"Dong-Min Woo, Dong-Chul Park","doi":"10.1109/ACIIDS.2009.11","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.11","url":null,"abstract":"This paper suggest a new camera calibration approach based on the neural network model. The proposed approach is shown to be very accurate because the neural network model implicitly contains all the physical parameters, some of which are very difficult to be estimated in the conventional explicit calibration methods. As the first step of this approach, this paper presents the camera calibration process which enables the coordinate transformation between 2D image points and points of a certain space in 3D real world. However, this approach is currently extended to be a general 3D camera calibration method in terms of 2 plane method. Experimental comparison of our method with well-known Tsai's 2 stage method is made to verify the accuracy of the proposed method.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"21 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":"115321219","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}
Chen Ni, Hyeon-Cheol Zin, Bokman Lee, D. Hwang, Chonggun Kim
A MANET comprises a set of mobile devices which are capable of communicating with others. Despite its flexibility and portability, it suffers from energy limitation. If the energy consumption of the nodes in the MANET cannot be balanced efficiently, some nodes will die in an early stage due to the energy depletion, which in turn partitions the whole network and leads to the communication failure. To balance the energy consumption, we propose the dynamic packet balancing agent for MANETs. The agent utilizes the HELLO packets to update energy information along a path, which enables the dynamic update of the energy information of each path, and sends packets via the path with the best energy condition. The agent is further applied to AOMDV, a well-known multipath protocol. Simulation result generated by NS2(Network Simulator version 2) shows that our proposal outperforms AOMDV in balancing energy consumption.
MANET包括一组能够与其他人通信的移动设备。尽管它具有灵活性和便携性，但它受到能量限制。如果不能有效地平衡MANET中节点的能量消耗，一些节点会因为能量耗尽而过早死亡，从而导致整个网络被分割，导致通信失败。为了平衡能量消耗，我们提出了动态分组平衡代理。agent利用HELLO报文沿着一条路径更新能量信息，实现了每条路径能量信息的动态更新，并在能量状态最佳的路径上发送报文。该代理进一步应用于著名的多路径协议AOMDV。NS2(Network Simulator version 2)的仿真结果表明，我们的方案在平衡能耗方面优于AOMDV。
{"title":"Dynamic Packet Balancing Agent in MANETs Based on AOMDV","authors":"Chen Ni, Hyeon-Cheol Zin, Bokman Lee, D. Hwang, Chonggun Kim","doi":"10.1109/ACIIDS.2009.50","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.50","url":null,"abstract":"A MANET comprises a set of mobile devices which are capable of communicating with others. Despite its flexibility and portability, it suffers from energy limitation. If the energy consumption of the nodes in the MANET cannot be balanced efficiently, some nodes will die in an early stage due to the energy depletion, which in turn partitions the whole network and leads to the communication failure. To balance the energy consumption, we propose the dynamic packet balancing agent for MANETs. The agent utilizes the HELLO packets to update energy information along a path, which enables the dynamic update of the energy information of each path, and sends packets via the path with the best energy condition. The agent is further applied to AOMDV, a well-known multipath protocol. Simulation result generated by NS2(Network Simulator version 2) shows that our proposal outperforms AOMDV in balancing energy consumption.","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":"131371145","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 paper presents a method of automatic detection of identity theft related event. The method is based on the social network analysis. The protection of electronic identity in contemporary information society is one of the greatest challenge in security research. The main idea about method of identity theft detection described in the paper is that identity theft events are related to change of the subject’s behavior as the node of the social network (or several different networks). In consequence identity theft may be detected similarly as the other types of malicious activities by analyzing the change of observed behavior patterns.
{"title":"An Approach to Identity Theft Detection Using Social Network Analysis","authors":"G. Kolaczek","doi":"10.1109/ACIIDS.2009.44","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.44","url":null,"abstract":"The paper presents a method of automatic detection of identity theft related event. The method is based on the social network analysis. The protection of electronic identity in contemporary information society is one of the greatest challenge in security research. The main idea about method of identity theft detection described in the paper is that identity theft events are related to change of the subject’s behavior as the node of the social network (or several different networks). In consequence identity theft may be detected similarly as the other types of malicious activities by analyzing the change of observed behavior patterns.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"8 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":"127726255","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}
Z. Golebiewski, Michal Koza, M. Klonowski, Mirosław Kutyłowski
We consider access scheduling to a shared radio channel in networks where a set of stations tries to get exclusive rights to transmit over a shared radio channel. A frequent strategy to solve this problem is that each station independently tosses an asymmetric coin and transmits in case of tails. The trials are executed some number of times and the first station that sends alone in a trial gets the right to broadcast over the shared channel. We consider here a multi-channel case: during onetime slot a station may transmit on k different channels.In this case trials can be arranged in two slightly different ways. The first method is that in each trial a station decides whether to participate in it; if it is so, then the station decides independently for each channel whether to transmit on it. According to the second method a station makes one decision whether to send and if the decision is positive it chooses a single channel for transmission. The second method guarantees a limited energy cost for each station but,as we show, turns out to be inferior regarding success probability. We consider these algorithms for a realistic number of stations. We analyze subtle differences between both algorithms regarding success probability.
{"title":"Leader Election for Multi-channel Radio Networks - Dependent versus Independent Trials","authors":"Z. Golebiewski, Michal Koza, M. Klonowski, Mirosław Kutyłowski","doi":"10.1109/ACIIDS.2009.29","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.29","url":null,"abstract":"We consider access scheduling to a shared radio channel in networks where a set of stations tries to get exclusive rights to transmit over a shared radio channel. A frequent strategy to solve this problem is that each station independently tosses an asymmetric coin and transmits in case of tails. The trials are executed some number of times and the first station that sends alone in a trial gets the right to broadcast over the shared channel. We consider here a multi-channel case: during onetime slot a station may transmit on k different channels.In this case trials can be arranged in two slightly different ways. The first method is that in each trial a station decides whether to participate in it; if it is so, then the station decides independently for each channel whether to transmit on it. According to the second method a station makes one decision whether to send and if the decision is positive it chooses a single channel for transmission. The second method guarantees a limited energy cost for each station but,as we show, turns out to be inferior regarding success probability. We consider these algorithms for a realistic number of stations. We analyze subtle differences between both algorithms regarding success probability.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"5 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":"128118705","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 paper is devoted to present various intelligent, distributed network-based intrusion detection systems architectures and quality measures. Moreover an impact of network and their intrusion detection system architectures parameters on the intrusion detection systems quality is discussed.
{"title":"Intelligent Distributed Intrusion Detection Systems of Computer Communication Systems","authors":"A. Grzech","doi":"10.1109/ACIIDS.2009.87","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.87","url":null,"abstract":"The paper is devoted to present various intelligent, distributed network-based intrusion detection systems architectures and quality measures. Moreover an impact of network and their intrusion detection system architectures parameters on the intrusion detection systems quality is discussed.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"29 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":"133151055","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 paper, two concepts from different research areas are addressed together, namely functional dependency (FD) and multidimensional association rule (MAR). FD is a class of integrity constraints that have gained fundamental importance in relational database design. MAR is a class of patterns which has been studied rigorously in data mining. We employ MAR to mine the interesting rules from XML Databases. The mined interesting rules are considered as candidate FDs whose all confidence itemsets are 100%. To prune the weak rules, we pay attention to support and correlation itemsets. The final strong rules are used to generate an Object-Role Model conceptual schema diagram.
{"title":"Deriving Conceptual Schema from XML Databases","authors":"O. Y. Yuliana, S. Chittayasothorn","doi":"10.1109/ACIIDS.2009.13","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.13","url":null,"abstract":"In this paper, two concepts from different research areas are addressed together, namely functional dependency (FD) and multidimensional association rule (MAR). FD is a class of integrity constraints that have gained fundamental importance in relational database design. MAR is a class of patterns which has been studied rigorously in data mining. We employ MAR to mine the interesting rules from XML Databases. The mined interesting rules are considered as candidate FDs whose all confidence itemsets are 100%. To prune the weak rules, we pay attention to support and correlation itemsets. The final strong rules are used to generate an Object-Role Model conceptual schema diagram.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"36 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":"132261196","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, we propose a method of stability analysis for a GA-Based reference ANNC capable of handling these types of problems for a nonlinear system. The initial values of the consequent parameter vector are decided via a genetic algorithm (GA) after which a modified adaptive law is derived based on Lyapunov stability theory to control the nonlinear system for tracking a user-defined reference model. The requirement of Kalman-Yacubovich lemma is fulfilling. A boundary-layer function is introduced into these updating laws to cover parameter and modeling errors, and to guarantee that the state errors converge into a specified error bound. After this, an adaptive neural network controller (ANNC) is derived to simultaneously stabilize and control the system.
{"title":"Stability Analysis of Fuzzy Control for Nonlinear Systems","authors":"Po-Chen Chen, K. Yeh, Cheng-Wu Chen, Shu-Hao Lin","doi":"10.1109/ACIIDS.2009.83","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.83","url":null,"abstract":"In this study, we propose a method of stability analysis for a GA-Based reference ANNC capable of handling these types of problems for a nonlinear system. The initial values of the consequent parameter vector are decided via a genetic algorithm (GA) after which a modified adaptive law is derived based on Lyapunov stability theory to control the nonlinear system for tracking a user-defined reference model. The requirement of Kalman-Yacubovich lemma is fulfilling. A boundary-layer function is introduced into these updating laws to cover parameter and modeling errors, and to guarantee that the state errors converge into a specified error bound. After this, an adaptive neural network controller (ANNC) is derived to simultaneously stabilize and control the system.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"25 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":"132774439","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}
A fuzzy classifier with adaptive learning of the volume of norm inducing matrix is proposed in this paper. The proposed fuzzy classifier improves the Gustafson-Kessel algorithm (GKA) which assumes a fixed volume of the norm inducing matrix. An efficient approach based on gradient descent learning, called adaptive ellipsoid classification algorithm (AECA) is proposed to recursively update the volume of norm inducing matrix. Mathematical analyses and computer simulations are made to show the effectiveness and efficiency of the proposed fuzzy classifier.
{"title":"A Fuzzy Classifier with Directed Initialization Adaptive Learning of Norm Inducing Matrix","authors":"L. Yao, Kuei-Sung Weng, Ren-Wei Chang","doi":"10.1109/ACIIDS.2009.57","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.57","url":null,"abstract":"A fuzzy classifier with adaptive learning of the volume of norm inducing matrix is proposed in this paper. The proposed fuzzy classifier improves the Gustafson-Kessel algorithm (GKA) which assumes a fixed volume of the norm inducing matrix. An efficient approach based on gradient descent learning, called adaptive ellipsoid classification algorithm (AECA) is proposed to recursively update the volume of norm inducing matrix. Mathematical analyses and computer simulations are made to show the effectiveness and efficiency of the proposed fuzzy classifier.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"841 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":"116375044","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}
A new idea is proposed that preprocessing is the key to improving the precision of short-term load forecasting (STLF). This paper presents a new model of STLF which is using support vector regression (SVR) based on pattern-base. Our model can be described as follows: firstly, it recognizes the different patterns of daily load according such features as weather and date type by means of data mining technology of classification and regression tree (CART); secondly, it sets up pattern-bases which are composed of daily load data sequence with highly similar features; thirdly, it establishes SVR forecasting model based on the pattern-base which matches to the forecasting day. Since the patterns of daily load are treated beforehand, the rule of the historical data sequence is more obvious. The model has many advantages: first, since the training data has similar pattern to the forecasting day, the model reflects the rule of daily load accurately and improves forecasting precision accordingly; second, as the pattern variables need not to be input into model, the mapping of the categorical variables is solved; third, as inputs are reduced, the model is simplified and the runtime is lessened. The simulation indicates that the new method is feasible and the forecasting precision is greatly improved.
{"title":"Short-Term Load Forecasting Using Support Vector Regression Based on Pattern-Base","authors":"Yingchun Guo, D. Niu","doi":"10.1109/ACIIDS.2009.52","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.52","url":null,"abstract":"A new idea is proposed that preprocessing is the key to improving the precision of short-term load forecasting (STLF). This paper presents a new model of STLF which is using support vector regression (SVR) based on pattern-base. Our model can be described as follows: firstly, it recognizes the different patterns of daily load according such features as weather and date type by means of data mining technology of classification and regression tree (CART); secondly, it sets up pattern-bases which are composed of daily load data sequence with highly similar features; thirdly, it establishes SVR forecasting model based on the pattern-base which matches to the forecasting day. Since the patterns of daily load are treated beforehand, the rule of the historical data sequence is more obvious. The model has many advantages: first, since the training data has similar pattern to the forecasting day, the model reflects the rule of daily load accurately and improves forecasting precision accordingly; second, as the pattern variables need not to be input into model, the mapping of the categorical variables is solved; third, as inputs are reduced, the model is simplified and the runtime is lessened. The simulation indicates that the new method is feasible and the forecasting precision is greatly improved.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"29 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":"115709103","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
扫码关注我们
求助内容：
应助结果提醒方式：