Querying k nearest neighbors of query point from data set in high dimensional space is one of important operations in spatial database. The classic nearest neighbor query algorithms are based on R-tree. However, R-tree exits overlapping problem of minimum bounding rectangles. This causes its time complexity exponentially depends on the dimensionality of the space. So, the reduction of the dimensionality is the key point. Hilbert curve fills high dimensional space linearly, divides the space into equal-size grids and maps points lying in grids into linear space. Using the quality of reducing dimensionality of Hilbert curve, the paper presents an approximate k nearest neighbor query algorithm AKNN, and analyzes the quality of k nearest neighbors in theory. According to the experimental result, the execution time of algorithm AKNN is shorter than the nearest neighbor query algorithm based on R-tree in high dimensional space, and the quality of approximate k nearest neighbors satisfies the need of real applications.
{"title":"An Approximate Nearest Neighbor Query Algorithm Based on Hilbert Curve","authors":"Hongbo Xu","doi":"10.1109/ICICIS.2011.134","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.134","url":null,"abstract":"Querying k nearest neighbors of query point from data set in high dimensional space is one of important operations in spatial database. The classic nearest neighbor query algorithms are based on R-tree. However, R-tree exits overlapping problem of minimum bounding rectangles. This causes its time complexity exponentially depends on the dimensionality of the space. So, the reduction of the dimensionality is the key point. Hilbert curve fills high dimensional space linearly, divides the space into equal-size grids and maps points lying in grids into linear space. Using the quality of reducing dimensionality of Hilbert curve, the paper presents an approximate k nearest neighbor query algorithm AKNN, and analyzes the quality of k nearest neighbors in theory. According to the experimental result, the execution time of algorithm AKNN is shorter than the nearest neighbor query algorithm based on R-tree in high dimensional space, and the quality of approximate k nearest neighbors satisfies the need of real applications.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133084394","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 overcome the disadvantages such as low calculation precision and convergence rate of traditional BP neural network algorithm, a kind of nonlinear optimization method-BFGS method for unconstrained extreme problem is introduced into BP neural network algorithm, and a BFGS-BP neural network model is developed, which is applied well in tunnel deformation monitoring data processing and forecasting with uncertainty and nonlinearity. With the example of the observation data of vault crown settlement of some tunnel construction process, the test of training and forecast experiments of BFGS - BP were developed. The result shows that BFGS-BP model has higher calculation precision and convergence rate than the traditional one.
{"title":"Application of BFGS-BP in Tunnel Deformation Monitoring Data Processing","authors":"Wang Zegen, Gao Yu-yun, Hu Guangqiang","doi":"10.1109/ICICIS.2011.107","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.107","url":null,"abstract":"In order to overcome the disadvantages such as low calculation precision and convergence rate of traditional BP neural network algorithm, a kind of nonlinear optimization method-BFGS method for unconstrained extreme problem is introduced into BP neural network algorithm, and a BFGS-BP neural network model is developed, which is applied well in tunnel deformation monitoring data processing and forecasting with uncertainty and nonlinearity. With the example of the observation data of vault crown settlement of some tunnel construction process, the test of training and forecast experiments of BFGS - BP were developed. The result shows that BFGS-BP model has higher calculation precision and convergence rate than the traditional one.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123886016","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 an unreliable communication network, the most reliable source (MRS) of the network is a good candidate as the source for data broadcast. Previous studies focused on seeking either an MRS that maximizes the expected number of nodes reachable from it or an MRS that maximizes the minimum reachable probability from it. In this paper, we integrated the two aspects into a new double¨Cobjective problem with a aim of seeking a node called an extended most reliable source (EMRS). Further, we transform this double-objective problem into three different single-objective problems respectively from three different perspectives. Moreover, we assume that the network has a complex unreliability, i.e. each edge has an independent probability while each node has an independent transmitting probability and an independent receiving probability. Both on the assumption and under the Open Most Reliable Path First (OMRPF) protocol, we present one polynomial-time algorithm respectively for computing each of three problems above.
{"title":"Extended Most Reliable Source on an Unreliable General Network","authors":"Wei Ding","doi":"10.1109/ICICIS.2011.138","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.138","url":null,"abstract":"In an unreliable communication network, the most reliable source (MRS) of the network is a good candidate as the source for data broadcast. Previous studies focused on seeking either an MRS that maximizes the expected number of nodes reachable from it or an MRS that maximizes the minimum reachable probability from it. In this paper, we integrated the two aspects into a new double¨Cobjective problem with a aim of seeking a node called an extended most reliable source (EMRS). Further, we transform this double-objective problem into three different single-objective problems respectively from three different perspectives. Moreover, we assume that the network has a complex unreliability, i.e. each edge has an independent probability while each node has an independent transmitting probability and an independent receiving probability. Both on the assumption and under the Open Most Reliable Path First (OMRPF) protocol, we present one polynomial-time algorithm respectively for computing each of three problems above.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124026120","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 analyzes the whole network architecture of the wireless monitoring system, and then analysis the hardware design and software design of the system, through the effective design of the system reached the real-time monitoring of the train, and guarantee the safety of the train.
{"title":"Wireless Monitoring System in the Application of Train","authors":"Min-Song Li, Duan Zhuo-hua","doi":"10.1109/ICICIS.2011.156","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.156","url":null,"abstract":"This paper analyzes the whole network architecture of the wireless monitoring system, and then analysis the hardware design and software design of the system, through the effective design of the system reached the real-time monitoring of the train, and guarantee the safety of the train.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127875639","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, we present a statistical analysis of the performance of three dimension parametric shape estimators. By using the Cram¶er-Rao lower bound(CRLB), we also generate confidence regions which conveniently display the effect of parameters on the quality of the estimated shapes, as well as allow a performance analysis of the algorithms.
{"title":"An Analysis of 3-D Parametric Shape Estimators","authors":"Xie Fengfan","doi":"10.1109/ICICIS.2011.87","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.87","url":null,"abstract":"In this paper, we present a statistical analysis of the performance of three dimension parametric shape estimators. By using the Cram¶er-Rao lower bound(CRLB), we also generate confidence regions which conveniently display the effect of parameters on the quality of the estimated shapes, as well as allow a performance analysis of the algorithms.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129347372","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}
Wu Zhaoxia, Zhu Guangshuai, Ma Zhenhe, Wu Fei, Chang Lei, Shi Leilei
In this dissertation, the research of distributed fiber grating spectrum form optimization is given. Spatial division multiplexing transform and time division multiplexing are the advantages of distributed fiber grating so that it can highly enhance efficiency and practicality, but much side lobes and bad precision are inherent disadvantages of distributed fiber grating. In accordance with those, BP neural network method is put forward. The result shows that BP neural network method possesses robustness and fault tolerance.
{"title":"Distributed Fiber Grating Spectrum Optimization Based on BP Neural Network","authors":"Wu Zhaoxia, Zhu Guangshuai, Ma Zhenhe, Wu Fei, Chang Lei, Shi Leilei","doi":"10.1109/ICICIS.2011.122","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.122","url":null,"abstract":"In this dissertation, the research of distributed fiber grating spectrum form optimization is given. Spatial division multiplexing transform and time division multiplexing are the advantages of distributed fiber grating so that it can highly enhance efficiency and practicality, but much side lobes and bad precision are inherent disadvantages of distributed fiber grating. In accordance with those, BP neural network method is put forward. The result shows that BP neural network method possesses robustness and fault tolerance.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115867064","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 work presents the mimicking of the main rhythmic gait patterns of a quadrupedal animal as an illustration of a novel approach to the prediction and generation of coupled neural oscillation. Based on Scheduling by Multiple Edge Reversal (SMER), a simple though powerful distributed algorithm, it is shown how oscillatory building blocks (OBBs) can be created for the generation of complex rhythmic patterns and implemented as asymmetric Hopfield neural networks. The network is able to reproduce the different firing rates observed among pairs of biological motor neurons working during different gait patterns.
{"title":"A Quadrupedal Locomotion Central Pattern Generator Based on Oscillatory Building Block Networks","authors":"Zhijun Yang, Qingbao Zhu","doi":"10.1109/ICICIS.2011.25","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.25","url":null,"abstract":"This work presents the mimicking of the main rhythmic gait patterns of a quadrupedal animal as an illustration of a novel approach to the prediction and generation of coupled neural oscillation. Based on Scheduling by Multiple Edge Reversal (SMER), a simple though powerful distributed algorithm, it is shown how oscillatory building blocks (OBBs) can be created for the generation of complex rhythmic patterns and implemented as asymmetric Hopfield neural networks. The network is able to reproduce the different firing rates observed among pairs of biological motor neurons working during different gait patterns.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953694","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}
Applying soft sets to lattice implication algebras, the concepts of soft lattice implication algebra and soft lattice implication sub algebra are introduced. The intersection, union and "AND" operations of soft lattice implication algebra and soft lattice implication sub algebra are established. The relations between soft lattice implication algebra (recp. soft lattice implication sub algebra) and their homomorphic images are provided.
{"title":"Soft Lattice Implication Algebras","authors":"Pen Jiayin","doi":"10.1109/ICICIS.2011.74","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.74","url":null,"abstract":"Applying soft sets to lattice implication algebras, the concepts of soft lattice implication algebra and soft lattice implication sub algebra are introduced. The intersection, union and \"AND\" operations of soft lattice implication algebra and soft lattice implication sub algebra are established. The relations between soft lattice implication algebra (recp. soft lattice implication sub algebra) and their homomorphic images are provided.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487233","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}
Through analyzing the characteristics of student tickets reservation, and under the condition of controlling the student tickets reservation information, a mathematic model of student ticket distribution model (STDM) is established. Particle swarm optimization (PSO) is established to solve STDM. In PSO, particle position matrix is set up, matrix's every column corresponds to a student, and matrix has two rows, the first row corresponds to train, and its elements are random train number that student will like to choose, second row correspond to date, and its elements are random date that student will like to choose. When students have the same train number and date pair, we can get train's students loads in one date. Through calculation example, this paper expounds the actual effect of the model.
{"title":"Study on Student Ticket Distribution Model and its Particle Swarm Optimization Algorithm","authors":"Qing Wang, Leizhen Wang, Suxin Wang, Li Zhao, Xuelei Cheng, Xuemei Chen","doi":"10.1109/ICICIS.2011.111","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.111","url":null,"abstract":"Through analyzing the characteristics of student tickets reservation, and under the condition of controlling the student tickets reservation information, a mathematic model of student ticket distribution model (STDM) is established. Particle swarm optimization (PSO) is established to solve STDM. In PSO, particle position matrix is set up, matrix's every column corresponds to a student, and matrix has two rows, the first row corresponds to train, and its elements are random train number that student will like to choose, second row correspond to date, and its elements are random date that student will like to choose. When students have the same train number and date pair, we can get train's students loads in one date. Through calculation example, this paper expounds the actual effect of the model.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124722289","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 study ore mining process' influence on rock mechanics and stability of mine, Stope structure parameters' influence on surrounding rock mechanics and stability, and the overlying rock and ground surface deformation mobile rule. Simulating the mining sequence by 3D software FLAC, Through the analysis of the maximum principal stress, Z direction stress and displacement of t the Z direction of different mining sequence, the optimal scheme is selected, and the results can provide reference for the safe production in mines.
{"title":"Analysis on Mine Pressure Numerical Simulation of Mine's Mining","authors":"L. Wei, Song Weidong, C. Qihua","doi":"10.1109/ICICIS.2011.148","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.148","url":null,"abstract":"In order to study ore mining process' influence on rock mechanics and stability of mine, Stope structure parameters' influence on surrounding rock mechanics and stability, and the overlying rock and ground surface deformation mobile rule. Simulating the mining sequence by 3D software FLAC, Through the analysis of the maximum principal stress, Z direction stress and displacement of t the Z direction of different mining sequence, the optimal scheme is selected, and the results can provide reference for the safe production in mines.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131253537","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
扫码关注我们
求助内容：
应助结果提醒方式：