Trajectories play an important role in analyzing the behavior of moving objects. Many researches have been conducted that retrieved similar trajectories of moving objects in Euclidean space rather than in road network space. However, in real applications, most moving objects are located in road network space. In this paper, we investigate the properties of similar trajectories in road network space and propose a spatio-temporal representation scheme for modeling the trajectories of moving objects. Our spatio-temporal representation scheme effectively converts trajectory from the road network space to the Euclidean space. For measuring similarity between two trajectories, we propose a new POI-distance algorithm which enhances the existing distance algorithm by reducing the insignificant nodes of a trajectory. Theory and experimental results show that this method provide not only a practical method for searching for similar trajectories but also a clustering method for trajectories.
{"title":"Spatio-temporal Similarity Measure for Trajectories on Road Networks","authors":"Hongbin Zhao, Qilong Han, Haiwei Pan, Guisheng Yin","doi":"10.1109/ICICSE.2009.18","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.18","url":null,"abstract":"Trajectories play an important role in analyzing the behavior of moving objects. Many researches have been conducted that retrieved similar trajectories of moving objects in Euclidean space rather than in road network space. However, in real applications, most moving objects are located in road network space. In this paper, we investigate the properties of similar trajectories in road network space and propose a spatio-temporal representation scheme for modeling the trajectories of moving objects. Our spatio-temporal representation scheme effectively converts trajectory from the road network space to the Euclidean space. For measuring similarity between two trajectories, we propose a new POI-distance algorithm which enhances the existing distance algorithm by reducing the insignificant nodes of a trajectory. Theory and experimental results show that this method provide not only a practical method for searching for similar trajectories but also a clustering method for trajectories.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"51 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121010335","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}
By analyzing existed improved DHT networks, we propose a novel improved CAN: PPCAN, which adopt 2-dimensional Polar coordinate and power series expand subspace hops to obtain better routing efficiency and lower maintenance cost. Then, we introduce the Landmarks to optimize the relay sequenced peers through the hops. Our design can be implemented entirely at the application level. Some improved routing algorithms based CAN also can be implemented in PPCAN.
{"title":"Design and Routing Algorithm of PPCAN","authors":"Wei Gao, Guoyin Zhang, Yanmei Li","doi":"10.1109/ICICSE.2009.67","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.67","url":null,"abstract":"By analyzing existed improved DHT networks, we propose a novel improved CAN: PPCAN, which adopt 2-dimensional Polar coordinate and power series expand subspace hops to obtain better routing efficiency and lower maintenance cost. Then, we introduce the Landmarks to optimize the relay sequenced peers through the hops. Our design can be implemented entirely at the application level. Some improved routing algorithms based CAN also can be implemented in PPCAN.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"81 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":"125887499","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}
Network damage evaluation is a hot research topic in network security area. This paper reviews previous works in the area of network damage evaluation. These studies focus on building an index system and computing the damage by the entropy before and after attacks without taking the correlation of index into consideration, which could results in damage increased, and it cannot express the variable of attack damage. This paper measures the damage degree on network availability in the sudden traffic under attack, and then uses dynamic relevant coefficient adjustment method, which combine with real-time network entropy calculation method, to obtain a more accurate reflection during the dynamic process of attack damage. The simulation experimental results show that the method can reflect the dynamic process of network availability damage accurately and integrally.
{"title":"Dynamic Damage Evaluation of Network Availability Adjusted by Index Correlation","authors":"Xing Wang, Hui He, Hong-li Zhang, H. Ma, Jing Liu","doi":"10.1109/ICICSE.2009.48","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.48","url":null,"abstract":"Network damage evaluation is a hot research topic in network security area. This paper reviews previous works in the area of network damage evaluation. These studies focus on building an index system and computing the damage by the entropy before and after attacks without taking the correlation of index into consideration, which could results in damage increased, and it cannot express the variable of attack damage. This paper measures the damage degree on network availability in the sudden traffic under attack, and then uses dynamic relevant coefficient adjustment method, which combine with real-time network entropy calculation method, to obtain a more accurate reflection during the dynamic process of attack damage. The simulation experimental results show that the method can reflect the dynamic process of network availability damage accurately and integrally.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"70 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":"116376756","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}
Architecture-centric system is analyzed by agent internetware, then the self-adaptive agent architecture is achieved. From belief, decision-making, intention point of view, it shows the flexible position of goal, which is the model statement level, and deepens some common description about the correlative environment and abnormity. The self-adaptive topology granularity unit of BDI and Agent is optimized, forms the basic internetware factor: Eagent, advances the dynamic binding technology related to the polymorphism concept, integrates the architecture-centric flow logic, in order to get the self-adaptive process algorithm and the unification of internetware container that "D-Role" is the basic automatic system role.
{"title":"Architecture-Centric Eagent Division and Self-Adaptive Process Design Driven by “D-Role”","authors":"Xiaona Xia, Baoxiang Cao, Jiguo Yu","doi":"10.1109/ICICSE.2009.20","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.20","url":null,"abstract":"Architecture-centric system is analyzed by agent internetware, then the self-adaptive agent architecture is achieved. From belief, decision-making, intention point of view, it shows the flexible position of goal, which is the model statement level, and deepens some common description about the correlative environment and abnormity. The self-adaptive topology granularity unit of BDI and Agent is optimized, forms the basic internetware factor: Eagent, advances the dynamic binding technology related to the polymorphism concept, integrates the architecture-centric flow logic, in order to get the self-adaptive process algorithm and the unification of internetware container that \"D-Role\" is the basic automatic system role.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"17 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":"116408114","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}
Aiming at the problem of the "semantic gap" and the "dimensionality curse", this paper discussed the model of cross-media retrieval. The methods of feature extraction and fusion of multimedia were given for processing high-dimensional data, and a nonlinear hybrid classifier based on support vector hidden Markov models was design for implementation semantic mapping and learning. According to Shannon information theory, calculation methods of similarity and correlation were given to implement temporal-spatial clustering. Typhoon and other multimedia disaster data are selected for experiments and comparisons. Experimental results show that this method improves the performance of cross-media retrieval.
{"title":"Cross-Media Retrieval Method Based on Temporal-spatial Clustering and Multimodal Fusion","authors":"Yang Liu, Feng-bin Zheng, K. Cai, Baoqing Jiang","doi":"10.1109/ICICSE.2009.72","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.72","url":null,"abstract":"Aiming at the problem of the \"semantic gap\" and the \"dimensionality curse\", this paper discussed the model of cross-media retrieval. The methods of feature extraction and fusion of multimedia were given for processing high-dimensional data, and a nonlinear hybrid classifier based on support vector hidden Markov models was design for implementation semantic mapping and learning. According to Shannon information theory, calculation methods of similarity and correlation were given to implement temporal-spatial clustering. Typhoon and other multimedia disaster data are selected for experiments and comparisons. Experimental results show that this method improves the performance of cross-media retrieval.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"41 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":"128617536","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 echo-state-network approach for training recurrent neural networks can yield good results. However, the results depend on the experience of neural network design. It usually requires multiple tests and random chances. Through our study of the effects of spectral radius of the internal weight matrix on the training results, we propose to develop a method that can improve the echo-state network training by introducing a dynamic spectral radius. Our experiments verify that our new algorithm is significantly better than the original method for the training results and it is stable.
{"title":"Effects of Spectral Radius on Echo-State-Network's Training","authors":"Yuanbiao Wang, J. Ni, Zhiping Xu","doi":"10.1109/ICICSE.2009.69","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.69","url":null,"abstract":"The echo-state-network approach for training recurrent neural networks can yield good results. However, the results depend on the experience of neural network design. It usually requires multiple tests and random chances. Through our study of the effects of spectral radius of the internal weight matrix on the training results, we propose to develop a method that can improve the echo-state network training by introducing a dynamic spectral radius. Our experiments verify that our new algorithm is significantly better than the original method for the training results and it is stable.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"161 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":"134505634","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}
Xiaoqin Xie, Chaochen Song, Zhiqiang Zhang, Yu Long
For most of the present centralized service searching method, there are drawbacks on the performance bottleneck and single-point failure in open, dynamic environments. This paper proposes a service search method based on self-organizing referral network in such environments. The initialization of service referral network is illustrated and the search algorithm based on service referral network is given also. Two experiments prove that this method is feasible and effective.
{"title":"A Service Search Method Based on Referral Network","authors":"Xiaoqin Xie, Chaochen Song, Zhiqiang Zhang, Yu Long","doi":"10.1109/ICICSE.2009.57","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.57","url":null,"abstract":"For most of the present centralized service searching method, there are drawbacks on the performance bottleneck and single-point failure in open, dynamic environments. This paper proposes a service search method based on self-organizing referral network in such environments. The initialization of service referral network is illustrated and the search algorithm based on service referral network is given also. Two experiments prove that this method is feasible and effective.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"549 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":"117276253","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}
With the large influx of the data mining technology and mining tools, the confidentiality requirements of the personal privacy are becoming more and more urgent. Therefore, how to ensure personal privacy and get the correct mining results becomes a severe issue to be resolved. In this paper, we propose a kind of random response method of geometric transformation- the combination of the random response technology and the geometric transform algorithm. The algorithm is designed to solve the shortage of low privacy protection of the geometric transform algorithm. The algorithm first gives four parameters, corresponding to the probability of four different types of geometric transformations. According to the various random number generated, different geometric transformation method is selected, which serves the dual effect of privacy protection. Our experiment proves that this method has a high degree of privacy protection and can get correct mining results.
{"title":"Privacy Preserving Clustering by Random Response Method of Geometric Transformation","authors":"Jie Liu, Yifeng Xu","doi":"10.1109/ICICSE.2009.31","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.31","url":null,"abstract":"With the large influx of the data mining technology and mining tools, the confidentiality requirements of the personal privacy are becoming more and more urgent. Therefore, how to ensure personal privacy and get the correct mining results becomes a severe issue to be resolved. In this paper, we propose a kind of random response method of geometric transformation- the combination of the random response technology and the geometric transform algorithm. The algorithm is designed to solve the shortage of low privacy protection of the geometric transform algorithm. The algorithm first gives four parameters, corresponding to the probability of four different types of geometric transformations. According to the various random number generated, different geometric transformation method is selected, which serves the dual effect of privacy protection. Our experiment proves that this method has a high degree of privacy protection and can get correct mining results.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"85 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":"124622187","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, a framework for reducing power during behavioral synthesis is proposed. A new parameter called Cycle Power Product (CPP) is defined which captures the power characteristics as an equally weighted sum of normalized mean cycle power. To minimize this parameter uses multiple supply voltages and dynamic frequency clocking and results in reduction of both energy and transient power. The cycle differential power can be modeled either as the mean deviation from the average power or as the cycle-to-cycle power gradient. The switching activity information is obtained from behavioral simulations. Based on the above we develop a new datapath scheduling algorithm which attempts at power and energy minimization by minimizing the CPP parameter during the scheduling process. The type and number of functional units available becomes the set of resource constraints for the scheduler. Experimental results indicate that the scheduler that minimizes CPP instead of conventional energy or average power as objective function could achieve significant reductions in power and energy.
{"title":"Low Power Behavioral Synthesis","authors":"Guan-jun Wang, Ying Zhao","doi":"10.1109/ICICSE.2009.74","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.74","url":null,"abstract":"In this paper, a framework for reducing power during behavioral synthesis is proposed. A new parameter called Cycle Power Product (CPP) is defined which captures the power characteristics as an equally weighted sum of normalized mean cycle power. To minimize this parameter uses multiple supply voltages and dynamic frequency clocking and results in reduction of both energy and transient power. The cycle differential power can be modeled either as the mean deviation from the average power or as the cycle-to-cycle power gradient. The switching activity information is obtained from behavioral simulations. Based on the above we develop a new datapath scheduling algorithm which attempts at power and energy minimization by minimizing the CPP parameter during the scheduling process. The type and number of functional units available becomes the set of resource constraints for the scheduler. Experimental results indicate that the scheduler that minimizes CPP instead of conventional energy or average power as objective function could achieve significant reductions in power and energy.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"1241 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114057096","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 technology of face recognition has been widely applied to many fields such as identity authentication. A New Improvement for Face Recognition Using MMPCA is presented in this paper. The proposed algorithm when compared with conventional modular PCA algorithm is different in the computation of image mean value and the recognition process. Comparison of the two algorithms in different face databases proves that the proposed algorithm is more effective and robust than conventional modular PCA algorithm under the large variations in lighting direction and facial expression. The authors also point out that 2DPCA is a special case of improved algorithm, no matter in the process of dimension reduction or recognition.
{"title":"Face Recognition Based on Modified Modular Principal Component Analysis","authors":"Xingfu Zhang","doi":"10.1109/ICICSE.2009.29","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.29","url":null,"abstract":"The technology of face recognition has been widely applied to many fields such as identity authentication. A New Improvement for Face Recognition Using MMPCA is presented in this paper. The proposed algorithm when compared with conventional modular PCA algorithm is different in the computation of image mean value and the recognition process. Comparison of the two algorithms in different face databases proves that the proposed algorithm is more effective and robust than conventional modular PCA algorithm under the large variations in lighting direction and facial expression. The authors also point out that 2DPCA is a special case of improved algorithm, no matter in the process of dimension reduction or recognition.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"14 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":"114257572","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
扫码关注我们
求助内容：
应助结果提醒方式：