In spatial data mining, clustering is one of useful techniques for discovering interesting data in the underlying data objects. The k-means algorithm is probably the most widely applied clustering method. But a major drawback of k-means algorithm is that it is difficult to determine the parameter k to represent natural cluster, and it is only suitable for concave spherical clusters. Therefore, the paper presents an efficient clustering algorithm for large spatial databases. It combines the hierarchical approach with the grid partition. The hierarchical approach is applied to find the genuine clusters by repeatedly combining together these blocks. Hilbert curve is a continuous path which passes through every point in a space once to form a one-one correspondence between the coordinates of the points and the one-dimensional sequence numbers of the points on the curve. The goal of using Hilbert curve is to preserve the distance of that points which are close in space and represent similar data should be stored close together in the linear order. This kind of mapping also can minimize the disk access effort and provide high speed for clustering. The simulation shows that the clustering algorithm can have shorter execution time than k-means algorithms for the large databases. Moreover, the algorithm can deal with clusters with arbitrary shapes in which the k-means algorithm can not discover.
{"title":"A Clustering Algorithm Based on Grid Partition of Space-Filling Curve","authors":"Hongbo Xu, Zhongxiao Hao, Qi-long Han","doi":"10.1109/ICICSE.2009.17","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.17","url":null,"abstract":"In spatial data mining, clustering is one of useful techniques for discovering interesting data in the underlying data objects. The k-means algorithm is probably the most widely applied clustering method. But a major drawback of k-means algorithm is that it is difficult to determine the parameter k to represent natural cluster, and it is only suitable for concave spherical clusters. Therefore, the paper presents an efficient clustering algorithm for large spatial databases. It combines the hierarchical approach with the grid partition. The hierarchical approach is applied to find the genuine clusters by repeatedly combining together these blocks. Hilbert curve is a continuous path which passes through every point in a space once to form a one-one correspondence between the coordinates of the points and the one-dimensional sequence numbers of the points on the curve. The goal of using Hilbert curve is to preserve the distance of that points which are close in space and represent similar data should be stored close together in the linear order. This kind of mapping also can minimize the disk access effort and provide high speed for clustering. The simulation shows that the clustering algorithm can have shorter execution time than k-means algorithms for the large databases. Moreover, the algorithm can deal with clusters with arbitrary shapes in which the k-means algorithm can not discover.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115464950","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}
Maohai Li, Lining Sun, Qing-Cheng Huang, Z. Cai, Songhao Piao
This paper presents a practical approach to design guard robot alarm system using GPRS technology. GPRS offers an interesting communications infrastructure for remotely accessing, controlling and interacting with robots in an integrated and highly portable manner, particularly in recent years the GPRS network provides wireless access of internet for mobile phone which becomes the most important and common terminal equipment. Therefore, in this paper the alarm information is designed to send to the user’s mobile phone, and add man-made intervention to the system, thus achieves a more convenient and reliable alarm system. The system mainly consists of two parts: detection of abnormal and dangerous situation in domestic environment and sending the alarm information as MMS form to the user’s phone via GPRS networks. Finally experiments show that the alarm system can accurately send alarm information to the user’s mobile phone. The system is low-cost, flexible, reliable, and can be widely used.
{"title":"GPRS Based Guard Robot Alarm System Design","authors":"Maohai Li, Lining Sun, Qing-Cheng Huang, Z. Cai, Songhao Piao","doi":"10.1109/ICICSE.2009.55","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.55","url":null,"abstract":"This paper presents a practical approach to design guard robot alarm system using GPRS technology. GPRS offers an interesting communications infrastructure for remotely accessing, controlling and interacting with robots in an integrated and highly portable manner, particularly in recent years the GPRS network provides wireless access of internet for mobile phone which becomes the most important and common terminal equipment. Therefore, in this paper the alarm information is designed to send to the user’s mobile phone, and add man-made intervention to the system, thus achieves a more convenient and reliable alarm system. The system mainly consists of two parts: detection of abnormal and dangerous situation in domestic environment and sending the alarm information as MMS form to the user’s phone via GPRS networks. Finally experiments show that the alarm system can accurately send alarm information to the user’s mobile phone. The system is low-cost, flexible, reliable, and can be widely used.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116527538","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 goal of software evolution research is to use the history of a software system to analyze its present state and to predict its future development, which made people can better use and management software In this paper, a process of changing normal software into autonomic software is described, which add autonomic attribute in software. Relationship and operation of components for software evolution is defined and the process of software evolution mechanism is depicted in this paper. A software evolution method considering software historical behavior is proposed for maintaining the dependability of software in a stable and non-reduced level. The simulated results produced by the designed experiment show that the method is validity in maintaining and increasing the dependability of software.
{"title":"Software Evolution Method Considering Software Historical Behavior","authors":"Qian Zhao, Huiqiang Wang, Guangsheng Feng, Xu Lu","doi":"10.1109/ICICSE.2009.21","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.21","url":null,"abstract":"The goal of software evolution research is to use the history of a software system to analyze its present state and to predict its future development, which made people can better use and management software In this paper, a process of changing normal software into autonomic software is described, which add autonomic attribute in software. Relationship and operation of components for software evolution is defined and the process of software evolution mechanism is depicted in this paper. A software evolution method considering software historical behavior is proposed for maintaining the dependability of software in a stable and non-reduced level. The simulated results produced by the designed experiment show that the method is validity in maintaining and increasing the dependability of software.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129845116","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}
Min Song, Zhe Zhang, Guisheng Yin, Hongbin Wang, J. Ni
The characteristics of publish/subscribe technology are of asynchronism and loosely coupled. This phenomenon makes producers and consumers are de-communicated in temporal and spatial domains during processing. It requires develop a dynamic integration in today’s large-scale, distributed information system. This paper introduces a Semantic Integration Data Model (SIDM) for publish/subscribe systems, within which model subscription module is designed. The model contains a matching algorithm which combines both publishing-driven and subscription-driven matching algorithms. Our experiments show that this matching algorithm has high efficiency for matching.
{"title":"Publish/Subscribe Driven Matching Algorithm","authors":"Min Song, Zhe Zhang, Guisheng Yin, Hongbin Wang, J. Ni","doi":"10.1109/ICICSE.2009.49","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.49","url":null,"abstract":"The characteristics of publish/subscribe technology are of asynchronism and loosely coupled. This phenomenon makes producers and consumers are de-communicated in temporal and spatial domains during processing. It requires develop a dynamic integration in today’s large-scale, distributed information system. This paper introduces a Semantic Integration Data Model (SIDM) for publish/subscribe systems, within which model subscription module is designed. The model contains a matching algorithm which combines both publishing-driven and subscription-driven matching algorithms. Our experiments show that this matching algorithm has high efficiency for matching.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128699724","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}
there have little work on processing joins with direction predicates, the research work on processing of spatial joins has primarily focused on topological and distance relations. The processing of direction relation queries is essentially a traversing process. A new fine query filtering method based on R-tree presented in this paper. A fine filtering step added in the middle of the traditional 2-stage query model. The improved method could decrease the size of candidate set in the filter step, and thus it can reduce the workload of the refine step. The validity of method is be proved by theoretical analysis. The improved methods only achieve the 40% calculation cost of original method. Results fully prove the validity of this method. Finally, it uses real world datasets to prove the validity. The experiment results show that performance evaluation of the proposed method performs well with respect to both I/O-and CPU-time.
{"title":"A R-tree-based Fine Directional Query Filtering","authors":"Ze-bao Zhang, Jianpei Zhang, Ruo-yu Li, Jing Yang","doi":"10.1109/ICICSE.2009.36","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.36","url":null,"abstract":"there have little work on processing joins with direction predicates, the research work on processing of spatial joins has primarily focused on topological and distance relations. The processing of direction relation queries is essentially a traversing process. A new fine query filtering method based on R-tree presented in this paper. A fine filtering step added in the middle of the traditional 2-stage query model. The improved method could decrease the size of candidate set in the filter step, and thus it can reduce the workload of the refine step. The validity of method is be proved by theoretical analysis. The improved methods only achieve the 40% calculation cost of original method. Results fully prove the validity of this method. Finally, it uses real world datasets to prove the validity. The experiment results show that performance evaluation of the proposed method performs well with respect to both I/O-and CPU-time.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131060947","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 presents a survey of the state-of-art of formal verification technique. The expression models for formal verification are introduced and analyzed. The characteristics of each model are expounded. Moreover, the typical model checking techniques are studied. Equivalence checking and property checking are introduced. The development trend for formal verification is discussed.
{"title":"Survey on Formal Verification Methods for Digital IC","authors":"Jianhua Wang, Jingbo Shao, Yingmei Li, Jinfeng Ding","doi":"10.1109/ICICSE.2009.46","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.46","url":null,"abstract":"This paper presents a survey of the state-of-art of formal verification technique. The expression models for formal verification are introduced and analyzed. The characteristics of each model are expounded. Moreover, the typical model checking techniques are studied. Equivalence checking and property checking are introduced. The development trend for formal verification is discussed.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122151807","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 order to deal with the uncertain temporal knowledge of the complex real-time system and to improve the existed uncertain temporal knowledge expression and inference algorithm, a new kind of high-level fuzzy timed Petri nets was proposed based on fuzzy timed Petri nets (FTN). The uncertain temporal of the complex real-time can be quantitatively described and the time possibility can be analyzed after temporal constraint was added to resources and transitions of FTN. Finally, a case study was given to illustrate the usage of this approach. The temporal phenomena and laws of real-time system can be described more overall with HFTN. It is suitable for complex real-time system modeling and analysis.
{"title":"A High-Level Fuzzy Timed Petri-Net-Based Approach","authors":"Xin Liu, Guisheng Yin, Ziying Zhang","doi":"10.1109/ICICSE.2009.62","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.62","url":null,"abstract":"In order to deal with the uncertain temporal knowledge of the complex real-time system and to improve the existed uncertain temporal knowledge expression and inference algorithm, a new kind of high-level fuzzy timed Petri nets was proposed based on fuzzy timed Petri nets (FTN). The uncertain temporal of the complex real-time can be quantitatively described and the time possibility can be analyzed after temporal constraint was added to resources and transitions of FTN. Finally, a case study was given to illustrate the usage of this approach. The temporal phenomena and laws of real-time system can be described more overall with HFTN. It is suitable for complex real-time system modeling and analysis.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117137536","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}
Due to the limited availability of energy within network nodes, energy-efficient routing mechanism is one of the most critical issues in wireless sensor networks. In this paper, we propose a multi-path routing algorithm with energy-aware based on ant colony system. The algorithm introduces three improved rules: Ant Marginalization Rule, State Transition Rule and Global Pheromone Update Rule to solve the problems of local convergence, local optimization and multi-path for transferring data respectively. It can avoid using up the energy of nodes on the optimal path while preserving network connectivity. Compared with traditional routing methods, simulation results demonstrate that the algorithm can help save energy and prolong the lifetime of the network.
{"title":"A New Energy-Efficient Routing Algorithm Based on Ant Colony System for Wireless Sensor Networks","authors":"Songzhu Xia, Su Wu, Jun Ni","doi":"10.1109/ICICSE.2009.27","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.27","url":null,"abstract":"Due to the limited availability of energy within network nodes, energy-efficient routing mechanism is one of the most critical issues in wireless sensor networks. In this paper, we propose a multi-path routing algorithm with energy-aware based on ant colony system. The algorithm introduces three improved rules: Ant Marginalization Rule, State Transition Rule and Global Pheromone Update Rule to solve the problems of local convergence, local optimization and multi-path for transferring data respectively. It can avoid using up the energy of nodes on the optimal path while preserving network connectivity. Compared with traditional routing methods, simulation results demonstrate that the algorithm can help save energy and prolong the lifetime of the network.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132617036","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 presents an efficient method, which finds top-k strongly correlated item pairs from transaction database, without generating any candidate sets. To reduce execution time, the proposed method uses a correlogram matrix based approach to compute support count of all item sets in a single scan over the database. From the correlogram matrix the correlation values of all the item pairs are computed and top-k correlated pairs are extracted very easily. The simplified logic structure makes the implementation of the proposed method more attractive. Experiments were taken with real and synthetic datasets and the performance of the proposed method was compared with its other counterparts.
{"title":"Notice of Violation of IEEE Publication PrinciplesAn Efficient Mining Algorithm for Top-k Strongly Correlated Item Pairs","authors":"Qiang Li, Yongshi Zhang","doi":"10.1109/ICICSE.2009.56","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.56","url":null,"abstract":"This paper presents an efficient method, which finds top-k strongly correlated item pairs from transaction database, without generating any candidate sets. To reduce execution time, the proposed method uses a correlogram matrix based approach to compute support count of all item sets in a single scan over the database. From the correlogram matrix the correlation values of all the item pairs are computed and top-k correlated pairs are extracted very easily. The simplified logic structure makes the implementation of the proposed method more attractive. Experiments were taken with real and synthetic datasets and the performance of the proposed method was compared with its other counterparts.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157843","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}
Privacy is an important issue in data mining and knowledge discovery. In this paper, we use the randomized response technology to conduct association rule mining. We propose a privacy preserving association rule mining algorithm which is called DDIL based on data disturbance and inquiry limitation. Applying DDIL on the data set, the original data can be disturbed and hidden and the degree of privacy-preserving is improved effectively. Specially, a high effective method of generating frequent items from transformed data sets is proposed. Our experiments demonstrate that when the random parameters are chosen suitably, our methods are effective and provide acceptable values in practice for balancing privacy and accuracy.
{"title":"Privacy Preserving Association Rules Mining Based on Data Disturbance and Inquiry Limitation","authors":"Wei Li, Jie Liu","doi":"10.1109/ICICSE.2009.30","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.30","url":null,"abstract":"Privacy is an important issue in data mining and knowledge discovery. In this paper, we use the randomized response technology to conduct association rule mining. We propose a privacy preserving association rule mining algorithm which is called DDIL based on data disturbance and inquiry limitation. Applying DDIL on the data set, the original data can be disturbed and hidden and the degree of privacy-preserving is improved effectively. Specially, a high effective method of generating frequent items from transformed data sets is proposed. Our experiments demonstrate that when the random parameters are chosen suitably, our methods are effective and provide acceptable values in practice for balancing privacy and accuracy.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"633 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117100","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
扫码关注我们
求助内容：
应助结果提醒方式：