Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35166
Yi Jiang, Yao Wang, Tianqing Liu, Chao Sun, Z. Yu
It is an important military problem for artillery to fire at sea targets. To determine the damage probability of artillery is the premise for commanders to organize operations. In this paper, we distinguish single target and multi-target and establish the shooting model of island and reef Garrison Artillery at sea. For single target, the hit probability is used to evaluate the firing effectiveness of cluster target, and the average number of damaged targets is used as the evaluation index, This paper analyzes the first, second and third groups of errors that affect the hit probability, and calculates the hit probability by using Gauss Hermite method; it uses multi scale area shooting method for cluster targets, and gives the expression of determining scale number and firepower coverage area. The simulation results of single target and multi-target are respectively simulated and calculated by Matlab tool. The simulation results have promotion and reference value, It can provide a strong theoretical support for the commander to command the troops to fire at sea single target and cluster target.
{"title":"Model and Simulation of Artillery Kill Probability to Sea Targets","authors":"Yi Jiang, Yao Wang, Tianqing Liu, Chao Sun, Z. Yu","doi":"10.12783/dtcse/cisnr2020/35166","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35166","url":null,"abstract":"It is an important military problem for artillery to fire at sea targets. To determine the damage probability of artillery is the premise for commanders to organize operations. In this paper, we distinguish single target and multi-target and establish the shooting model of island and reef Garrison Artillery at sea. For single target, the hit probability is used to evaluate the firing effectiveness of cluster target, and the average number of damaged targets is used as the evaluation index, This paper analyzes the first, second and third groups of errors that affect the hit probability, and calculates the hit probability by using Gauss Hermite method; it uses multi scale area shooting method for cluster targets, and gives the expression of determining scale number and firepower coverage area. The simulation results of single target and multi-target are respectively simulated and calculated by Matlab tool. The simulation results have promotion and reference value, It can provide a strong theoretical support for the commander to command the troops to fire at sea single target and cluster target.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73034403","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35139
Meng Zhang, Minxiang Wei, Xinda Chen, Kai Chen
This paper introduced the design of a digital lock-in amplifier for weak crack detection. Due to the limitation of flicker noise and low pass filter performance, the error of the traditional lock-in amplifier in detecting weak signal will be large. In order to solve this problem, this paper designed an algorithm according to the source of noise. First, an orthogonal vector digital phase locked amplifier has been built. In addition, we have proposed and implemented a noise removal method based on Wiener filter, and optimized the anti-interference performance of the lockin amplifier by sliding mean algorithm. The simulation results show that the proposed design can effectively extract the weak crack signals submerged in noise, optimize the performance of the traditional lock-in amplifier, improve the accuracy and reduce the noise interference.
{"title":"Design of Digital Lock-in Amplifier Based on Wiener Filter","authors":"Meng Zhang, Minxiang Wei, Xinda Chen, Kai Chen","doi":"10.12783/dtcse/cisnr2020/35139","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35139","url":null,"abstract":"This paper introduced the design of a digital lock-in amplifier for weak crack detection. Due to the limitation of flicker noise and low pass filter performance, the error of the traditional lock-in amplifier in detecting weak signal will be large. In order to solve this problem, this paper designed an algorithm according to the source of noise. First, an orthogonal vector digital phase locked amplifier has been built. In addition, we have proposed and implemented a noise removal method based on Wiener filter, and optimized the anti-interference performance of the lockin amplifier by sliding mean algorithm. The simulation results show that the proposed design can effectively extract the weak crack signals submerged in noise, optimize the performance of the traditional lock-in amplifier, improve the accuracy and reduce the noise interference.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81387842","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35143
Qiqi Wang, Fuen Chen, Xiaoming Liang
Driver assistance technology allows people not to concentrate on driving a car, in which the lane is the main and important features to guide vehicles and keep them safe. Traditional lane detection algorithms usually require high quality input images and hand-crafted features, that are computationally expensive and sensitive to environment. In order to overcome these problems, this paper comes up with an end-to-end lane detection method based on semantic segmentation, which has an accuracy as other deep learning methods, but has fewer parameters. In this paper, it uses two CNN blocks to extract features, and designs a loss function to help train the network. It has been tested on tuSimple dataset and could detect lanes in most of the images in the dataset.
{"title":"Lane Detection: A Semantic Segmentation Approach","authors":"Qiqi Wang, Fuen Chen, Xiaoming Liang","doi":"10.12783/dtcse/cisnr2020/35143","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35143","url":null,"abstract":"Driver assistance technology allows people not to concentrate on driving a car, in which the lane is the main and important features to guide vehicles and keep them safe. Traditional lane detection algorithms usually require high quality input images and hand-crafted features, that are computationally expensive and sensitive to environment. In order to overcome these problems, this paper comes up with an end-to-end lane detection method based on semantic segmentation, which has an accuracy as other deep learning methods, but has fewer parameters. In this paper, it uses two CNN blocks to extract features, and designs a loss function to help train the network. It has been tested on tuSimple dataset and could detect lanes in most of the images in the dataset.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75822640","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35144
Wei Qiao, Xiaofei Kang, Mengmeng Li
This paper proposes an improved XGBoost Wi-Fi indoor positioning algorithm aiming at the accuracy problem caused by the change of environment.The method first uses Extreme Gradient Boosting (XGBoost) algorithm to establish indoor positioning model, which can achieve indoor positioning. When the environment changes, further combine error compensation (EC) method to improve the initial positioning. In addition, the positioning trajectory is compared with the actual trajectory and the unimproved positioning trajectory to verify the stability of the algorithm. The experimental results show that the 80-th percentile of the achieved accuracy is 1.11m after the change of environment, which is significantly better than the unimproved positioning algorithms based on support vector machine, random forest and extreme gradient promotion, and the obtained positioning trajectory tends to converge with the actual trajectory.
{"title":"An Improved XGBoost Indoor Localization Algorithm","authors":"Wei Qiao, Xiaofei Kang, Mengmeng Li","doi":"10.12783/dtcse/cisnr2020/35144","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35144","url":null,"abstract":"This paper proposes an improved XGBoost Wi-Fi indoor positioning algorithm aiming at the accuracy problem caused by the change of environment.The method first uses Extreme Gradient Boosting (XGBoost) algorithm to establish indoor positioning model, which can achieve indoor positioning. When the environment changes, further combine error compensation (EC) method to improve the initial positioning. In addition, the positioning trajectory is compared with the actual trajectory and the unimproved positioning trajectory to verify the stability of the algorithm. The experimental results show that the 80-th percentile of the achieved accuracy is 1.11m after the change of environment, which is significantly better than the unimproved positioning algorithms based on support vector machine, random forest and extreme gradient promotion, and the obtained positioning trajectory tends to converge with the actual trajectory.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"19 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82378651","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35170
Sheng Hu, Fushun Zhang
A dual-polarized microstrip antenna with high isolation for Sub-6 GHz (3.43.6 GHz) base station application is presented in this letter. To increase isolation between two feed ports, the stacked patches are excited by double orthogonal open-ended feed lines. The proposed antenna is simulated by HFSS18.0. The simulation results show that the isolation is better than 50 dB over the whole bandwidth from 3.23 to 3.85 GHz with the cross-polarization levels less than 30 dB when the gains are higher than 7.64 dBi for dual polarization. It’s valuable for this design method to devise mobile communication system base station antenna used in Sub-6 GHz of China Unicom and China Telecom.
{"title":"A High Isolation Dual-Polarized Microstrip Antenna for Sub-6 GHz Base Station","authors":"Sheng Hu, Fushun Zhang","doi":"10.12783/dtcse/cisnr2020/35170","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35170","url":null,"abstract":"A dual-polarized microstrip antenna with high isolation for Sub-6 GHz (3.43.6 GHz) base station application is presented in this letter. To increase isolation between two feed ports, the stacked patches are excited by double orthogonal open-ended feed lines. The proposed antenna is simulated by HFSS18.0. The simulation results show that the isolation is better than 50 dB over the whole bandwidth from 3.23 to 3.85 GHz with the cross-polarization levels less than 30 dB when the gains are higher than 7.64 dBi for dual polarization. It’s valuable for this design method to devise mobile communication system base station antenna used in Sub-6 GHz of China Unicom and China Telecom.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"126 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88162005","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}
Feiteng FT-M6678 (hereinafter referred to as M6678) DSP is a multi-core highperformance DSP with completely independent intellectual property rights. M6678 adopts the Harvard architecture and the new KeyStone multi-core architecture that store instructions and data separately. In general, the multiple classic image processing classic algorithms including correlation matching are not efficient for M6678 DSP architecture. To promote the application of domestic DSP chips in the field of image processing and artificial intelligence. Here, the correlation matching algorithm based on the correlation coefficient is transplanted to the M6678 platform, combining the algorithm characteristics and the architecture characteristics of the target platform, performance optimization in terms of parallelism and locality is carried out. The performance of the program is obviously improved, and the unique computing resources of the platform are more fully utilized, which is meaningful for the transplantation and optimization of other image processing algorithms on the platform.
{"title":"Implementation and Optimization of Template Matching Algorithm for FT-M6678","authors":"Jiang Hu, Jiandong Shang, Yun-shan Chen, Mengyuan Wang, Xia Chai","doi":"10.12783/dtcse/cisnr2020/35132","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35132","url":null,"abstract":"Feiteng FT-M6678 (hereinafter referred to as M6678) DSP is a multi-core highperformance DSP with completely independent intellectual property rights. M6678 adopts the Harvard architecture and the new KeyStone multi-core architecture that store instructions and data separately. In general, the multiple classic image processing classic algorithms including correlation matching are not efficient for M6678 DSP architecture. To promote the application of domestic DSP chips in the field of image processing and artificial intelligence. Here, the correlation matching algorithm based on the correlation coefficient is transplanted to the M6678 platform, combining the algorithm characteristics and the architecture characteristics of the target platform, performance optimization in terms of parallelism and locality is carried out. The performance of the program is obviously improved, and the unique computing resources of the platform are more fully utilized, which is meaningful for the transplantation and optimization of other image processing algorithms on the platform.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89572906","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35137
Jie Zhang, Quanli Ning, Haixia Shao
From the aspect of appearance size, gain and directivity, the simulation analysis of isotropic antenna and directional antenna is carried out by HFSS software. The simulation results show that isotropic antenna is suitable for projectile-carried communication jammer.
{"title":"Simulation Comparison of Directional Antenna and Isotropic Antenna Used in Projectile-carried Communication Jammer","authors":"Jie Zhang, Quanli Ning, Haixia Shao","doi":"10.12783/dtcse/cisnr2020/35137","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35137","url":null,"abstract":"From the aspect of appearance size, gain and directivity, the simulation analysis of isotropic antenna and directional antenna is carried out by HFSS software. The simulation results show that isotropic antenna is suitable for projectile-carried communication jammer.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78371728","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35168
Wanxin Man, Xinhong Li, Zhibin Zhang, Jiping An, Guohui Zhang, Junwei He
Modularity in space provides a solution to the scale-constrained problem of space systems, while providing other benefits in terms of flexibility, sustainability and affordability. In the system, modules are added and removed through interconnect interfaces, which transfer mechanical load, data, electrical power, and heat from one module to another. The current research tends to integrate multiple functions into a single device or equipment to reduce costs and improve standardization. This article will explore the design requirements and constraints that need to be satisfied in the design of this standardized, extensible, multifunctional (mechanical, electrical, data, thermal), modular interface, and compare the realization of each function to provide a design consideration.
{"title":"Research on Integrated Interface Design of Small Modular Spacecraf","authors":"Wanxin Man, Xinhong Li, Zhibin Zhang, Jiping An, Guohui Zhang, Junwei He","doi":"10.12783/dtcse/cisnr2020/35168","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35168","url":null,"abstract":"Modularity in space provides a solution to the scale-constrained problem of space systems, while providing other benefits in terms of flexibility, sustainability and affordability. In the system, modules are added and removed through interconnect interfaces, which transfer mechanical load, data, electrical power, and heat from one module to another. The current research tends to integrate multiple functions into a single device or equipment to reduce costs and improve standardization. This article will explore the design requirements and constraints that need to be satisfied in the design of this standardized, extensible, multifunctional (mechanical, electrical, data, thermal), modular interface, and compare the realization of each function to provide a design consideration.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85106066","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35141
Xiaming Zheng
In this letter, by introducing high order tensor representation, the method to diagonalizing second quantization quadratic form is generalized to any orders operators. By some simple calculation and comparison to classic exact diagonalization, this new technique can be verified since has the same result. Moreover, this procedure could also be applied to some analytical computation, which may give some useful information in many-body interacting systems.
{"title":"Diagonalization of High-order Second Quantization Form","authors":"Xiaming Zheng","doi":"10.12783/dtcse/cisnr2020/35141","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35141","url":null,"abstract":"In this letter, by introducing high order tensor representation, the method to diagonalizing second quantization quadratic form is generalized to any orders operators. By some simple calculation and comparison to classic exact diagonalization, this new technique can be verified since has the same result. Moreover, this procedure could also be applied to some analytical computation, which may give some useful information in many-body interacting systems.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79045857","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}
Pub Date : 2020-12-30DOI: 10.12783/dtcse/cisnr2020/35173
Junqiang Su, Anlu Liu, Jinzhu Shen, Nan Wang, WeiFeng Dong
Due to the particularity of ancient Chinese costume patterns, algorithm errors often occur in 3D simulation of ancient Chinese costume, resulting in failure of costume simulation. When reconstructing those costumes with research value, the influence of the garment structure on the effect of the garment model should be taken into account, and the garments should be reconstructed with real patterns. However, in order to reduce the algorithm errors in the costume simulation process, the authenticity of the pattern must compromise the limitations of the software algorithm, that is, the original pattern of costume must be modified. This paper, taking the court costume of Ming Dynasty as the research object, summarizes the parts where algorithm errors occur in the virtual simulation process of court costume. Through specific experiments, the effect of costume models made by different patterns is compared, the modification method of Ming Dynasty costume pattern in CLO3D is explored. The pattern modification principle that can eliminate algorithm errors in simulation process to the greatest extent is determined, and a set of court costume pattern used for 3D simulation is established. This pattern modification principle is applicable not only to the Ming Dynasty court costume, but also to all the ancient costumes with the same structure as them, which provides the theoretical basis and experimental method for the establishment of other ancient costume models.
{"title":"Principles of Pattern Modification of Court Costume in Ming Dynasty in 3D Simulation","authors":"Junqiang Su, Anlu Liu, Jinzhu Shen, Nan Wang, WeiFeng Dong","doi":"10.12783/dtcse/cisnr2020/35173","DOIUrl":"https://doi.org/10.12783/dtcse/cisnr2020/35173","url":null,"abstract":"Due to the particularity of ancient Chinese costume patterns, algorithm errors often occur in 3D simulation of ancient Chinese costume, resulting in failure of costume simulation. When reconstructing those costumes with research value, the influence of the garment structure on the effect of the garment model should be taken into account, and the garments should be reconstructed with real patterns. However, in order to reduce the algorithm errors in the costume simulation process, the authenticity of the pattern must compromise the limitations of the software algorithm, that is, the original pattern of costume must be modified. This paper, taking the court costume of Ming Dynasty as the research object, summarizes the parts where algorithm errors occur in the virtual simulation process of court costume. Through specific experiments, the effect of costume models made by different patterns is compared, the modification method of Ming Dynasty costume pattern in CLO3D is explored. The pattern modification principle that can eliminate algorithm errors in simulation process to the greatest extent is determined, and a set of court costume pattern used for 3D simulation is established. This pattern modification principle is applicable not only to the Ming Dynasty court costume, but also to all the ancient costumes with the same structure as them, which provides the theoretical basis and experimental method for the establishment of other ancient costume models.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":"43 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91516250","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}