{"title":"Research on Stock Selection Strategy Based on AdaBoost Algorithm","authors":"Yanyu Chen, Xuechen Li, Wei Sun","doi":"10.1145/3424978.3425084","DOIUrl":"https://doi.org/10.1145/3424978.3425084","url":null,"abstract":"In this paper, we propose a new direction of stock selection strategy, coining the AdaBoost-Decision Tree (Ada-DT) model, which uses the AdaBoost lifting algorithm and Decision Tree to predict stock movements and select superior stocks. As for financial investment, people are more sensitive to losses than the same amount of gains. Therefore, we add this consideration to the use of AdaBoost algorithm. We use quality indicators, growth indicators, per-share indicators, and sentiment indicators, 24 in total, as the feature space, and try to identify the stocks that may outperform the broader market and have high yield from the Shanghai Stock Exchange (SSE) 50 constituent stocks. The stock selection result of Ada-DT is that the average correct rate of the out-of-sample test set is 72.84%, and the AUC is 0.634. At the same time, we compare the Ada-DT with AdaBoost-Support Vector Machine (Ada-SVM) prediction model and find that Ada-DT provides a higher correct rate and better cumulative returns, indicating that the Ada-DT algorithm is reasonable for complex nonlinear stock markets.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127641601","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 Application of Three Machine Learning Algorithms in Student Performance Evaluation","authors":"Xinghui Wu, Zaifeng Shi, Yuping Zhou, Haihua Xing","doi":"10.1145/3424978.3425072","DOIUrl":"https://doi.org/10.1145/3424978.3425072","url":null,"abstract":"At present, the research of machine learning is a hot topic. In this paper, three machine learning algorithms, decision tree, support vector machine and random forest, are used to predict the students' achievement data sets. The results in the early stage of the data were analyzed to predict the average results in the later stage of the professional courses. The results show that the classification performance of the three classifier models is high, among which the random forest classifier is the best in the accuracy rate, precision rate, recall rate and F1 value. Moreover, the comprehensive forecast result and the course importance order can guide the student to carry on the pertinence remediation, and it's helpful for students to make specific explanations in class.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133350889","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":"Similarity Measurement Based on Non-linear Hash Coding","authors":"Jinjin Zhu, Yaping Cai","doi":"10.1145/3424978.3425103","DOIUrl":"https://doi.org/10.1145/3424978.3425103","url":null,"abstract":"We propose an algorithm named non-linear deep hash (NLDH) to encode the object in the image into a series of compact binary codes through a structure called a non-linear hash coding module. Based on this, then, we propose a retrieval algorithm for similar images based on these binary codes in the image. This algorithm adopts the strategy from coarse-to-fine. Then the image level similarity calculation is carried out to complete the search of the most similar images. Finally, experiments were carried out on the Oxford buildings dataset and ancient painting image dataset in this paper. The experimental results show that our proposed algorithm has a higher retrieval ability than the ordinary deep hash method, and the retrieval accuracy and recall rate are greatly improved.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121280337","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":"An Optimal Design Method of Conv2d Operator for TensorFlow Based on FPGA Accelerator","authors":"Rengang Li, Hongwei Kan, Dongdong Su, Yanwei Wang, Hongbo Zhao, Peilin Tong","doi":"10.1145/3424978.3424987","DOIUrl":"https://doi.org/10.1145/3424978.3424987","url":null,"abstract":"Currently, TensorFlow architecture only supports CPU and GPU programming, and has not yet formed a unified support standard for FPGAs. To the best of our knowledge, when forward operators in TensorFlow specifies a new device, the backward gradient operator in the same neural network cannot use the same device, which does not comply with rules about node device allocation in TensorFlow. Therefore, we propose an improved algorithm for node device allocation based on placement mechanism and an optimization algorithm for conv2d operator based on OpenCL. The proposed improved algorithm for node device allocation makes forward and backward operators based on FPGA accelerator satisfy the node and device allocation requirements for all TensorFlow operators, and the conv2d operator optimization algorithm based on OpenCL takes full advantage of the parallel computing advantages of FPGA. Finally, this paper uses the CNN LeNet5 model and the MNIST dataset to conduct corresponding experiments. Referring to conv2d operator, based on FPGA accelerator, we implement both the forward and backward operators involved in the first four layers of the model. The experimental results show that the accuracy of the three methods is above 98%. Compared with CPU and GPU, the accuracy difference is only about five thousandths. In addition, in the case of different batch sizes, we tested the runtime of conv2d operator in the first layer of this model. The results show that when the input batch size increased to 10000, the FPGA runs 9 times faster than the CPU. It proved that we proposed an optimization solution for TensorFlow to use FPGA operators for neural network calculations.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128426354","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 on Forward-looking Ranging Algorithm of Missile-borne Phased Array Detector Based on Pulse Compression","authors":"Xude Cheng, Xuedong Xue, Jing Zhang, Shuai Zhang, Jian Qin","doi":"10.1145/3424978.3425034","DOIUrl":"https://doi.org/10.1145/3424978.3425034","url":null,"abstract":"Aiming at the forward-looking ranging problem of phased array detectors, this paper proposes a forward-looking ranging algorithm suitable for missile-borne phased array detectors, it uses stepped pulse compression to extract the distance information from the echo signal, and it achieves high-precision and high-efficiency distance the target area for a missile-borne platform with high real-time requirements. In this paper, the forward-looking ranging model of the missile-borne detector is established, and the linear frequency modulation sub-pulse frequency stepping signal system is used as the ranging signal. Then the ranging principle of the missile-borne detector is derived from the ranging theory. Finally, the ranging algorithm was verified through simulation experiments.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128720421","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 Hybrid Encoding Based Particle Swarm Optimizer for Feature Selection and Classification","authors":"Yan'an Lin, Qifan Zhuang","doi":"10.1145/3424978.3425074","DOIUrl":"https://doi.org/10.1145/3424978.3425074","url":null,"abstract":"Feature selection (FS) is an important issue for classification, which aims to search the optimal feature subset to assist the classification task. Bio-inspired algorithms, such as particle swarm optimization (PSO), have shown superior performances in dealing with feature selection. However, current methods still suffer from local optimal and lack of efficient encoding manner for particles, which results in limited classification accuracy. In this paper, we proposed a hybrid encoding based PSO, HE-PSO for wrapper-based FS, where a novel encoding consisting of both integer and categorical value is applied. The new encoding way considerably takes the interactions between different features into account. In addition, a new updating strategy for particles' positions is developed, which is able to explore and search more promising and better solutions. Experimental results on benchmark data sets validate the effectiveness of our proposed approach in classification accuracy.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114210948","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":"Terrorist Video Detection System Based on Faster R-CNN and LightGBM","authors":"Chao Yi, Shunxiang Wu, Bin Xi, Daodong Ming, Yisong Zhang, Zhenwen Zhou","doi":"10.1145/3424978.3425121","DOIUrl":"https://doi.org/10.1145/3424978.3425121","url":null,"abstract":"Nowadays the mobile phone has become an indispensable tool in the lives of many people. While facilitating people's lives, it also provides criminals with a very important tool for spreading the terrorist video. Traditional manual detection of the terrorist video has the problem of low accuracy and inefficiency. To address the issue, this paper proposes a terrorist video detection system based on Light Gradient Boosting Machine (LightGBM) and Faster Region-based Convolutional Neural Network (Faster R-CNN) for mobile phone forensics system, which is used to quickly detect whether there is a terrorist video in the suspect's mobile phone. The system uses a multi-model method for detection, which includes preliminary detection and deep detection in two stages. Experimental research shows that it can effectively and accurately detect terrorist videos in mobile phones, thereby helping criminal investigation personnel to quickly grasp criminal evidence and provide some clues for the detection of the case.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125380788","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 Mapping Method for Indoor Mobile Robot","authors":"Haoxin Liu, Yonghui Zhang, Yibo Cao","doi":"10.1145/3424978.3425050","DOIUrl":"https://doi.org/10.1145/3424978.3425050","url":null,"abstract":"Simultaneous location and mapping (SLAM) is a core issue in the field of mobile robots. This paper proposes an endpoint features based mapping method for an indoor mobile robot. The robot collects sensor information over some time to build a local map, and the local maps are fused to get a global map. This article defines the concept of endpoints and gives each endpoint a unique descriptor. Local endpoints and global endpoints are compared using descriptor matching and brute force matching to obtain a calibration. The local grids are merged into the global grids if the calibration is less than a threshold. Otherwise, running a pose correction for the mobile robot. Experiments show that in various indoor environments, this mapping method can obtain a grid map that is similar to the actual environment, which supports the mobile robot to complete navigation, obstacle avoidance, planning, and other works.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125618844","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":"Library Readers Flow Control Based on the Supervisory Control Theory of Discrete-event Systems","authors":"Chongqing Lin, Daowen Qiu, Weilin Deng","doi":"10.1145/3424978.3425066","DOIUrl":"https://doi.org/10.1145/3424978.3425066","url":null,"abstract":"The readers flow control in public libraries is an important problem. In this paper, we present a new formulation for the library readers flow control via the supervisory control theory of discrete-event systems (DESs). First of all, we formulate the library readers flow problem via the model of DESs. Secondly, for the usual control specification, we present its automaton characterization, and then prove its controllability and further provide a supervisor that can achieve the specification. This paper demonstrates that the supervisory control framework can provide a simple and flexible solution for the readers flow control in public libraries.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128033656","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 Household Design Method Based on Improved Generative Adversarial Networks","authors":"Yufeng Chen, Bo Li","doi":"10.1145/3424978.3424997","DOIUrl":"https://doi.org/10.1145/3424978.3424997","url":null,"abstract":"We propose a system for automatic household design, which is based on Generative Adversarial Networks (GAN) to construct a multi-layer network structure system. Based on the given home building structure information and in accordance with the real rules, specific furniture objects can be reasonably placed in the corresponding home building space. First, we constructed the household design dataset, which includes a building structure diagram with constraint information as input, and a real home layout based on the structure diagram design. including part of the design and the complete design. The multi-layer GAN structure can generate the household design results with structural relations according to the design steps. The system introduces the attention network, which can generate the structural details in the image by focusing on the constraint conditions of the input image. Conditional regression is designed at the back of the system, so that the generated results can have diverse characteristics. Our system can quickly generate a diversified real home layout, which has good practical value.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"5 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128182173","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}