{"title":"A Track Correlation Algorithm for Radar Intelligence","authors":"Jiang Surong, Lan Jiangqiao","doi":"10.1109/DCABES.2014.37","DOIUrl":"https://doi.org/10.1109/DCABES.2014.37","url":null,"abstract":"Aiming at track correlation in airborne early warning radar intelligence analysis, an improved dual threshold track correlation algorithm is proposed. Taking into account that we have held all the point information after flying, we use wave gate technology instead of the hypothesis to test the hypothesis one by one, and the data have been screened for relevance to avoid extrapolation errors and history cases. It reduced the correlation computation amount. The experimental results show that the algorithm in airborne radar information processing can improve the efficiency of correlation between the ground radar tracks and airborne radar tracks.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122345773","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}
Mookwon Seo, Derrick Cerwinsky, K. Gahalaut, C. Douglas
{"title":"Implementations and Interpretations of the Talbot-Ogden Infiltration Model","authors":"Mookwon Seo, Derrick Cerwinsky, K. Gahalaut, C. Douglas","doi":"10.1109/DCABES.2014.71","DOIUrl":"https://doi.org/10.1109/DCABES.2014.71","url":null,"abstract":"The interaction between surface and subsurface hydrology flow systems is important for water supplies. Accurate, efficient numerical models are needed to estimate the movement of water through unsaturated soil. We investigate a water infiltration model and develop very fast serial and parallel implementations that are suitable for a computer with a graphical processing unit (GPU).","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130073611","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 Simulation Model of Boarding Process for Narrow-Body Aircraft","authors":"Yuefei. Shi, Qifeng Mou","doi":"10.1109/DCABES.2014.63","DOIUrl":"https://doi.org/10.1109/DCABES.2014.63","url":null,"abstract":"In this paper, we proposed a simulated boarding process for narrow-body passenger aircraft with consideration of passengers' individual boarding time. The individual boarding time, consisting of walking time in aisle, time to store luggage and seating time, were analyzed at first. With characteristics of seat layout in narrow-body aircraft, a simulation model of boarding process for narrow-body aircraft was established by Monte Carlo stochastic modeling method. Then the model was applied to three typical aircrafts under five different aircraft boarding strategies including Back to Front, Random, Reverse Pyramid, Wilma Outside in and Wilma Block boarding strategies. Our numerical results of the total passenger boarding time were presented in three distributing graph forms. Finally, the results indicated that Reverse Pyramid and Wilma Block are more effective than the other three boarding strategies. The model parameters and boarding sequences also can be adjusted to adapt to different narrow-body aircrafts and various boarding patterns.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158045","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}
Ke Zhan, Chao Yang, Changyou Zhang, Jingjing Zheng, Ting Wang
{"title":"PLDSRC: A Multi-threaded Compressor/Decompressor for Massive DNA Sequencing Data","authors":"Ke Zhan, Chao Yang, Changyou Zhang, Jingjing Zheng, Ting Wang","doi":"10.1109/DCABES.2014.9","DOIUrl":"https://doi.org/10.1109/DCABES.2014.9","url":null,"abstract":"To face the rapid growth of DNA sequencing data, it is of great importance to study high efficiency compression techniques to reduce the cost of storing the massive amount of sequencing data. In this paper, we propose a parallel DNA data compressor/decompress or, PLDSRC, based on the famous serial DSRC software. We first analyze the compression and decompression algorithm in DSRC and identity three basic operations, namely read, work, and write. Then a single pipeline parallel algorithm is proposed to accelerate the compression/decompression procedure. To further exploit today's popular multi-core, multi-socket systems based on the non-uniform memory access (NUMA) architecture, we extend the single pipeline approach to the multi-pipeline case. Experiments on two different platforms are done and show that PLDSRC in both single and multiple pipeline forms is able to speed up DNA sequencing data compression/decompression greatly, while maintaining the same compressing ratio. Examples indicate that the maximum speedup of PLDSRC on compressing and decompressing is respectively around 24.71x and 22.00x, as compared to the serial DSRC software.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130324271","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":"Improved Parallel Randomized Quasi Monte Carlo Algorithm of Asian Option Pricing on MIC Architecture","authors":"P. Yao, Y. Hu, Z. Lu, Yan Gang Wang, Jue Wang","doi":"10.1109/DCABES.2014.33","DOIUrl":"https://doi.org/10.1109/DCABES.2014.33","url":null,"abstract":"High-dimensional Option pricing, which plays an important role in complex financial activities, presents a great computational challenge in practice. Randomized Quasi Monte Carlo (RQMC) algorithm is of practical significance for forecasting option prices or other finance derivatives. In this paper, we present an improved parallel RQMC algorithm to forecast Asian option prices using Many Integrated Core (MIC) architecture. The improved algorithm employs novel data structure, independent random generator, vectorization technology, and data alignment. Numerical experiments were conducted on MIC architecture and the parallel performance was then analyzed. A speedup of 1.37 was achieved on MIC over CPU. Efficiency of 70.85% was achieved by using 64 OpenMP threads of a MIC card. An average speedup of 3.38 can be obtained by mixing the CPU and MIC computation in comparison with a single core of the CPU. Ample evidences proved the RQMC algorithm can benefit enormously from MIC architecture.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127195690","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 Dynamic Topology Management Mechanism in Green Internet","authors":"Jinhong Zhang, Xingwei Wang, Min Huang","doi":"10.1109/DCABES.2014.44","DOIUrl":"https://doi.org/10.1109/DCABES.2014.44","url":null,"abstract":"In recent years, the rapid development of the Internet has provided people with more and more convenience. However, meanwhile a tremendous energy consumption problem and a low energy efficiency problem in the networks still exist. With the continuous expansion of the network scale, these problems are increasingly more severe. In order to achieve the \"green\" goal in the paper, first a networking model for green backbone network is built, then an innovative node structure and an innovative link structure are designed, furthermore, constitution of energy consumption in network device is analyzed, and a power model of the network device is set up, then according to the power-law principle, the values of network elements are evaluated from the three aspects of resource utilization rate, the impact degree on robustness of the network topology and the impact degree on communication quality, finally, a dynamic topology management mechanism in green Internet is proposed. Applicability and validity of the innovative mechanism with respect to energy saving and topology management are verified via prototype simulation and performance evaluation.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132029575","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":"Making a Virtual Sand Table Based on Unity 3D Technique","authors":"L. Xiaofeng, Chen Tianhuang, Qin Tingchao","doi":"10.1109/DCABES.2014.61","DOIUrl":"https://doi.org/10.1109/DCABES.2014.61","url":null,"abstract":"The 3D virtual sand table is a kind of relatively complicated technology with the very important point that the map datum should generate rapidly. Based on DEM datum, This article is devoted to come up with a systematic method to structure a 3D virtual sand table and identify its feasibility: a gray scale-map generates by means of linear interpolation in a short time and a vivid 3D-topographic map is constructed in Unity3D, the feasibility of the method is proved by a experimental way.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114297683","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":"Parking Guidance System Based on ZigBee and Geomagnetic Sensor Technology","authors":"Fengli Zhou, Qing Li","doi":"10.1109/DCABES.2014.58","DOIUrl":"https://doi.org/10.1109/DCABES.2014.58","url":null,"abstract":"Concerning the phenomenon that common parking service could not satisfy the increasing demand of the private vehicle owners, an intelligent parking guidance system based on Zig Bee network and geomagnetic sensors was designed. Real-time vehicle position and related traffic information were collected by geomagnetic sensors around parking lots and updated to center server via Zig Bee network. On the other hand, out-door Liquid Crystal Display screens controlled by center server can display information of available parking places. In this paper, guidance strategy was divided into four levels, which could provide clear and effective information to drivers. The experimental results prove that the distance detection accuracy of geomagnetic sensors was within 0.4m, and the lowest package loss rate of the wireless network in the range of 150m is 0%. This system can provide solution for better parking service in intelligent cities.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115506616","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":"Research and Implementation of Petri Nets Parallelization Model","authors":"Xuan Wang, Wenjing Li, Ze-Yu Tang, Weizhi Liao","doi":"10.1109/DCABES.2014.39","DOIUrl":"https://doi.org/10.1109/DCABES.2014.39","url":null,"abstract":"In order to solve parallel algorithm of Petri net system with concurrent functions and implement parallel control and execution of Petri net, parallel programming model of Petri net based on multi-core clusters is put forward. First, P-invariant technology is used to do the functional division of Petri net system and the parallel analysis of Petri net process. Next, based on architecture of multi-core cluster and combined with parallelism of Petri net process, Petri net system model is constructed. Simultaneously, parallel algorithm of Petri net system is raised. Finally, under the environment of multi-core cluster, the simulation experiment of parallel algorithm is done. The experimental results show that parallel algorithm based on Petri net system model is correct and feasible. The model can effectively simulate the actual operation of the system and is an effective model of Petri net parallelization system.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124020575","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":"Memory Integrity Protection Method Based on Asymmetric Hash Tree","authors":"Ma Haifeng, Cheng Jie, Gao Zhenguo","doi":"10.1109/DCABES.2014.57","DOIUrl":"https://doi.org/10.1109/DCABES.2014.57","url":null,"abstract":"Focus on this question of high verification overhead of hash tree memory protection scheme, this paper proposed a hash tree optimize method called AH-Tree. Utilizing the locality character of memory accessing, the memory is divided into two parts and an asymmetric hash tree (AH-Tree) is constructed. The advantage of AH-Tree is low average operation overhead. The analysis and experiment results proved that the proposed scheme has shorter average verification path and better verify efficiency than hash tree scheme. AH-Tree is a feasible memory integrity protection scheme.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126876098","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}