In this paper, an improvement proposal in the XML filting is put forward on the base of the Lazy DFA. For each node in the automaton, a transition counter is added to build a frequently access area. By setting a threshold of the counter, the data in the cache can be filtering. These nodes whose value of counter exceed are identified as frequently access areas of the state. This proposal can be greatly reduced the searching time during the transition between the states of automaton in a large number of states in the cache, and thus increase the efficiency of filtering and query performance.
{"title":"The Improvement of XML Filtering Based on DFA","authors":"Guisheng Yin, Jie Shen, Xianghui Wang","doi":"10.1109/ICICSE.2009.22","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.22","url":null,"abstract":"In this paper, an improvement proposal in the XML filting is put forward on the base of the Lazy DFA. For each node in the automaton, a transition counter is added to build a frequently access area. By setting a threshold of the counter, the data in the cache can be filtering. These nodes whose value of counter exceed are identified as frequently access areas of the state. This proposal can be greatly reduced the searching time during the transition between the states of automaton in a large number of states in the cache, and thus increase the efficiency of filtering and query performance.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"73 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":"114232504","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}
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}
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}
The analysis of complex network invulnerability includes empirical analysis and simulation analysis; there are many disputes on its measure method. Those methods can’t quantitatively describe the invulnerability of Network Topology. The paper analyzes the current measure methods of complex network invulnerability, measures the reliability and the invulnerability of instant messaging network topology by analytic hierarchy process, then the paper presents the main influencing factors of instant messaging network topology, constructs the evaluation index matrix, determines the weights of every indexes by the entropy weight method.
{"title":"Entropy Weight Method for Evaluation of Invulnerability in Instant Messaging Network","authors":"Songtao Yang, Zongli Zhang","doi":"10.1109/ICICSE.2009.10","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.10","url":null,"abstract":"The analysis of complex network invulnerability includes empirical analysis and simulation analysis; there are many disputes on its measure method. Those methods can’t quantitatively describe the invulnerability of Network Topology. The paper analyzes the current measure methods of complex network invulnerability, measures the reliability and the invulnerability of instant messaging network topology by analytic hierarchy process, then the paper presents the main influencing factors of instant messaging network topology, constructs the evaluation index matrix, determines the weights of every indexes by the entropy weight method.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"94 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":"125240068","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}
Internetware is an emerging software model in the open network environment, which is built upon the coordination of heterogeneous and autonomous software entities in an open coordinated environment. Due to the uncontrollable and uncertain nature of the internet, developing an effective method to ensure the trustworthiness of internetwares is one of the most difficult technical problems. To address this issue, a trust-driven model is proposed. In this model, software entities are regarded as the basic objects to be managed, and a flexible internetware architecture is built by using the method of trust alliance, which ensures not only the model’s internal awareness ability, but also the overall early warning and defensive capabilities. At the same time, to satisfy the evolution requirements, extensible functional units and dynamic strategy sets are designed. This design enables the model to be more adaptable and evolvable over time.
{"title":"A Trust-Driven Online Evolution Model for Internetware","authors":"Zhiqiang Ma, Guisheng Yin","doi":"10.1109/ICICSE.2009.41","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.41","url":null,"abstract":"Internetware is an emerging software model in the open network environment, which is built upon the coordination of heterogeneous and autonomous software entities in an open coordinated environment. Due to the uncontrollable and uncertain nature of the internet, developing an effective method to ensure the trustworthiness of internetwares is one of the most difficult technical problems. To address this issue, a trust-driven model is proposed. In this model, software entities are regarded as the basic objects to be managed, and a flexible internetware architecture is built by using the method of trust alliance, which ensures not only the model’s internal awareness ability, but also the overall early warning and defensive capabilities. At the same time, to satisfy the evolution requirements, extensible functional units and dynamic strategy sets are designed. This design enables the model to be more adaptable and evolvable over time.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"77 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":"127084868","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}
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}
Speckle is a multiplicative noise that degrades the visual evaluation in ultrasound imaging. In medical ultrasound image processing, speckle noise suppression has become a very essential exercise for diagnose. The recent advancements in ultrasound devices necessitate the need of more robust despeckling techniques for enhancing ultrasound medical imaging in routine clinical practice. Many denoising techniques have been proposed for effective suppression of speckle noise. This paper compiles the performance of various techniques in medical B-mode ultrasound images.
{"title":"Speckle Noise Suppression Techniques for Ultrasound Images","authors":"Changming Zhu, Jun Ni, Yan-bo Li, Guochang Gu","doi":"10.1109/ICICSE.2009.26","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.26","url":null,"abstract":"Speckle is a multiplicative noise that degrades the visual evaluation in ultrasound imaging. In medical ultrasound image processing, speckle noise suppression has become a very essential exercise for diagnose. The recent advancements in ultrasound devices necessitate the need of more robust despeckling techniques for enhancing ultrasound medical imaging in routine clinical practice. Many denoising techniques have been proposed for effective suppression of speckle noise. This paper compiles the performance of various techniques in medical B-mode ultrasound images.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"5 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131958131","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：