Sumin Zhang, Qiuli Kong, Shuaibin Lian, Zhengming Ma
{"title":"An improved HLLE algorithm based on the midpoint-nearest neighborhood selection","authors":"Sumin Zhang, Qiuli Kong, Shuaibin Lian, Zhengming Ma","doi":"10.1109/ICAL.2012.6308194","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308194","url":null,"abstract":"The tangent spaces of data points play an important role in HLLE. It is based on the tangent spaces of data points that HLLE defines and calculates the Hessian matrices of data points. However, the proof presented in this paper shows that the space commonly used to calculate the Hessian matrix of a data point in HLLE algorithm is not the tangent space of the data point, but the tangent space of the midpoint of the data point's neighborhood. When a data point is far away from the midpoint of its neighborhood, HLLE will break down. This defect of HLLE algorithm has never been pointed out in previous literatures. Based on this fact, an improvement to the original HLLE algorithm is proposed in this paper. The main idea of the improved HLLE algorithm is that the neighborhood of a data point must be chosen so as to make the midpoint of the data point's neighborhood as close to the data point itself as possible. The experimental results presented in this paper show that the improved HLLE algorithm outperforms the original HLLE algorithm on the manifolds such as Punctured Sphere, where the data are often unevenly sampled.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132507648","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}
Yunong Zhang, Wenchao Lao, Yonghua Yin, Lin Xiao, Jinhao Chen
{"title":"Weights and structure determination of pruning-while-growing type for 3-input power-activation feed-forward neuronet","authors":"Yunong Zhang, Wenchao Lao, Yonghua Yin, Lin Xiao, Jinhao Chen","doi":"10.1109/ICAL.2012.6308199","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308199","url":null,"abstract":"In this paper, a new type of 3-input power-activation feed-forward neuronet (3IPFN) is constructed and investigated. For the 3IPFN, a novel weights-and-structure-determination (WASD) algorithm is presented to solve data approximation and prediction problems. With the weights-direct-determination (WDD) method exploited, the WASD algorithm can obtain the optimal weights of the 3IPFN between hidden layer and output layer directly. Moreover, the WASD algorithm determines the optimal structure (i.e., the optimal number of hidden-layer neurons) of the 3IPFN adaptively by growing and pruning hidden-layer neurons during the training process. Numerical results of illustrative examples highlight the efficacy of the 3IPFN equipped with the so-called WASD algorithm.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134322162","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}
{"title":"True random bit generator based on cell phone recording and chaotic encryption","authors":"Fei Xiang, Lei Zhang, Zhiyong Zhang, Lili Zhang","doi":"10.1109/ICAL.2012.6308147","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308147","url":null,"abstract":"This paper proposes a design method of true random bit generator(TRBG) based on cell phone recording and chaotic encryption. Firstly a recording from cell phone is collected, then is transformed the format operated by MATLAB. The recording is turned into a sequence in computer by MATLAB, which is encrypted by chaotic sequence from a chaotic system. Finally, through binarization a true random bit sequence is produced. Randomness and security analysis is carried out. Simulation results show that the properties of the bit sequence are excellent in randomness and security, and the method is safe, fast and easy to realize.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"106 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133293846","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}
{"title":"The implementation of encoder and decoder of LT codes based on DSP","authors":"Junhong Hu, Hongfeng Gao, S. Ge","doi":"10.1109/ICAL.2012.6308140","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308140","url":null,"abstract":"LT codes are efficient rateless codes. In this article, the TMS320VC5416 is used to design and realize the encoder and decoder of LT codes. In order to improve the decoding efficiency, the redundancy process is introduced to remove the redundancies of code signals. As the computational burden and memory usage of the encoder and decoder increase rapidly with the encoding length, the feedback control signal is introduced to control the length of code signals. Positional coefficient storage mechanism of neighbors' list of the code signals is built to ensure the optimal use of DSP chip's memory resources. The simulation results show that the LT codes encoder and decoder based on DSP have good performance.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116447353","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}
{"title":"DC network connecting of switched reluctance generator system","authors":"X. Zan, C. Liu, H. Chen, J. Gu","doi":"10.1109/ICAL.2012.6308203","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308203","url":null,"abstract":"The paper presents the developed Switched Reluctance generator system with DC network connecting to loads and the storage batteries. The generator system is made up of three-phase 12/8 structure Switched Reluctance generator, three-phase asymmetrical bridge power converter and the digital controller by the core of Freescale MCF5213 microprocessor clocked at 80MHz. The closed-loop control scheme of output voltage is described. The process of estalishing output voltage is tested. The sudden adding load and sudden unload experiments are made. It is shown that the time of estalishing output voltage is very short, and the recovery time of the output voltage is also short under sudden adding load and sudden unload. The distributing Switched Reluctance generator system provides the DC electrical power to the loads and the redundant electrical power can be used to charge the storage batteries.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128432546","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}
{"title":"Texture segmentation using window empirical mode decomposition","authors":"Lingfei Liang, J. Pu, Ziliang Ping","doi":"10.1109/ICAL.2012.6308238","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308238","url":null,"abstract":"In this paper window empirical mode decomposition (WEMD) is proposed and is used to do texture segmentation. Empirical mode decomposition (EMD) can decompose the nonstationary and nonlinear signals by sifting into a few intrinsic mode functions (IMFs) which represent a simple oscillatory mode of local data. However, the traditional bidimensional EMD (BEMD) has two drawbacks of the gray spots in IMF image and the slow computation speed. WEMD can solve such problems. Based on the characteristic of WEMD and local time/space-frequency analysis of structure multivector, the renovate technique of texture segmentation is also presented. Characterized by the local amplitude and the local frequency of every IMF component, the texture image can be segmented by k-means clustering algorithm. The subsequent experimental results indicate this method's effectiveness.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"303 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124327629","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}
{"title":"A geometric correction approach for chassis images with non-uniform speed by linear CCD camera","authors":"Y. Cheng, Lingfei Liang, J. Pu","doi":"10.1109/ICAL.2012.6308221","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308221","url":null,"abstract":"This paper proposes a geometric correction method for vehicle chassis images acquired by linear charge coupled device (CCD) camera using speeded up robust features (SURF) and phase-only correlation (POC). We use feature matching based in SURF to estimate an approximate homography between standard images and real-time camera images using a limited number of corresponding points, and dense sub-pixel correspondence search based in POC to adjust precise position of corresponding points. Experimental result shows the geometric correction method using SURF and POC can achieve high-accuracy.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117218331","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}
{"title":"SO-RTI: A new RTI based on web services","authors":"Xiaofeng Guo, Jianjing Shen, Zuwei Yin, Shanming Wu","doi":"10.1109/ICAL.2012.6308219","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308219","url":null,"abstract":"The traditional RTI is limited in the following aspects. First, it merely runs in the Local Area Network (LAN) or Virtual Private Network (VPN) rather than Wide Area Network (WAN). Second, it does not support the interoperation over the different platforms. The development of web service based RTI is becoming a hot spot of p resent research. By analyzing the merits and drawbacks of the three methods of existed web services based RTI, this paper intends to design and implement a new service oriented RTI, namely, SO-RTI.SO-RTI uses the technologies of separation of RTI ambassador services and federate ambassador services, persistence of the federation state, etc., and resolve the problems, such as the inconformity of the data type between web service and HLA, maintain of the invoking state, invoking federate ambassador service dynamically, and compatibility of the original federate.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130432985","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}
{"title":"Detection of transient power quality disturbances based EMD combined with Choi-Williams distribution","authors":"W. Liu, Xiaoting Guo","doi":"10.1109/ICAL.2012.6308146","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308146","url":null,"abstract":"To suppress the cross terms interference in the Cohen class quadratic time-frequency distribution, a method based on empirical mode decomposition (EMD) and Choi-Williams distribution is proposed. In this method, the time domain signal is decomposed into intrinsic mode functions (IMFs) by EMD in frequency domain. It calculates Cohen class distribution after deleting the false components generated by EMD, and then the Cohen class distribution of original signal is reconstructed by superposing the results of IMFs to the original signal linearly. The simulation results show that the method is effective to suppress the cross terms of Cohen class Distribution, ensure Cohen class Distribution time-frequency concentration, and extract features of disturbance.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132251940","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}
{"title":"Deploying and researching Hadoop in virtual machines","authors":"Guanghui Xu, Feng Xu, Hongxu Ma","doi":"10.1109/ICAL.2012.6308241","DOIUrl":"https://doi.org/10.1109/ICAL.2012.6308241","url":null,"abstract":"Hadoop's emerging and the maturity of virtualization make it feasible to combine them together to process immense data set. To do research on Hadoop in virtual environment, an experimental environment is needed. This paper firstly introduces some technologies used such as CloudStack, MapReduce and Hadoop. Based on that, a method to deploy CloudStack is given. Then we discuss how to deploy Hadoop in virtual machines which can be obtained from CloudStack by some means, then an algorithm to solve the problem that all the virtual machines which are created by CloudStack using same template have a same hostname. After that we run some Hadoop programs under the virtual cluster, which shows that it is feasible to deploying Hadoop in this way. Then some methods to optimize Hadoop in virtual machines are discussed. From this paper, readers can follow it to set up their own Hadoop experimental environment and capture the current status and trend of optimizing Hadoop in virtual environment.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132996103","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}