{"title":"Design and implementation of road surveillance fusion system","authors":"Kai Li, Haowei Jia, Meng Chen, Shirao Li, Wenkui Xiang, Yiping Yuan, Yuxuan Huang, Tingpei Chen, DongMing Tang","doi":"10.1109/CIS58238.2022.00106","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00106","url":null,"abstract":"Highway Monitoring System is an important part of The Intelligent Highway. And the basic highway monitoring system consists of fisheye camera and gun camera as the data acquisition side. Since the gun camera has a limited viewing angle, the fisheye camera is used as a supplement. To eliminate these blind areas in the monitoring system, we propose a system that merge the fisheye image and the two guns images to obtain a global view under the monitor pole. At the same time, it provides video cutting and video annotation functions to meet the practical needs of users in use. Our experimental results show that the system provides high convenience in terms of performance and functionality.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"15 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125002859","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":"Entrepreneurial traits, resource bricolage, and entrepreneurial opportunity identification: a grounded theory approach","authors":"Wenli Chen, Wenshuang Wan","doi":"10.1109/CIS58238.2022.00063","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00063","url":null,"abstract":"To investigate the resource pooling analysis model in entrepreneurial activities and provide reference suggestions for the growth of entrepreneurs and start-ups, this study selected a sample of 25 start-ups with a duration of 8 years. In this study, we collected original data through in-depth interviews, and established an analytical model based on The Timmons Model of “Entrepreneurial Traits-Resource Bricolage-Entrepreneurial Opportunity Identification” using the Grounded Theory. The results of the study show that entrepreneurial traits, resource bricolage and uncertainty of internal and external environment are the main influencing factors for entrepreneurial opportunity identification, and entrepreneurs with entrepreneurial traits are better at coping with the uncertainty of environment, implementing entrepreneurial resource bricolage, using the resources at hand rationally, forming a larger “opportunity pool”, identifying and grasping opportunities and help start-ups better establish competitive advantages.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125249319","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":"Multi-agent reinforcement learning based 5G bi-level multi-slice resource allocation","authors":"Zhipeng Yu, Fangqing Gu","doi":"10.1109/CIS58238.2022.00018","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00018","url":null,"abstract":"With the complexity of application scenarios and the wide application of network slicing, the base station faces different requirements of different slicing in resource allocation. The base station can separate the centralized unit (CU)-distributed unit (DU) according to the slicing demand and carry out different charges according to different separation schemes. We build a more efficient bi-level model for resource allocation in the context of CU-DU separation, and for practical consideration, we use the deterministic reinforcement learning algorithm to solve this bi-level model. The results show that the reinforcement learning method is effective in solving the bi-level resource allocation model.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125368079","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 novel match point mapping algorithm based on dominant point for large-scale mlcs problem","authors":"Shiwei Wei, Na Zhao, Xunzhang Li, Quanyou Zhao","doi":"10.1109/CIS58238.2022.00019","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00019","url":null,"abstract":"Finding the Multiple Longest Common Subsequences (MLCS) is a fundamental problem in many fields such as bioinformatics, computational genomics and pattern recognition. Existing algorithms for finding MLCSs from sequences are not suitable for the long and large-scale sequences due to their high time and space consumption. To overcome this problem, a new DAG (directed acyclic graph) model and a Novel Match Point Mapping algorithm (NMPM) based on dominant point are proprosed in this paper. In the DAG, there is no duplicate match point and each match point is mapped to a unique integer identifier. The DAG can be efficiently built by continually calculating successors of each match point. What is more, the high-dimensional match points can be removed if they are no longer used during the construction of DAG. Therefore, a great deal of memory space will be saved. The experiment results reveal that our new algorithm outperforms other leading algorithms, especially for large-scale MLCS problem.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"471 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126836322","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":"Surrogate model-driven differential evolution with multi-strategy techniques","authors":"Anshan Chen, Hecheng Li, Hua Ran","doi":"10.1109/CIS58238.2022.00010","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00010","url":null,"abstract":"For large-scale complex optimization problems, some traditional evolutionary algorithms (EAs) using a single evolutionary strategy often face the challenges of easily falling into the local optima and are computationally expensive. In order to deal with these shortcomings, a multi-strategy differential evolution algorithm based on surrogate model is proposed in this manuscript. First, to reduce the computational cost, we employ cheap surrogate models to reduce the number of real function evaluations and construct global and local surrogate models to guide population evolution. Secondly, a multi-strategy differential evolution operator is developed to generate promising individuals and enhance population diversity. Finally, seven benchmark functions with up 200 decision variables are calculated to illustrate the efficiency of the proposed method. The experimental results show that the proposed algorithm is highly competitive when compared with other state-of-the-art algorithms for large-scale complex optimization problems.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123478795","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":"Profile-matrix-based shapelet discovery for time series binary classification","authors":"Qin Tao, Jun Yang, Siyuan Jing","doi":"10.1109/CIS58238.2022.00069","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00069","url":null,"abstract":"Due to the characteristics of interpretability and high accuracy, shapelet-based time series classification (S-TSC) has attracted considerable attention on data mining community over the past decades. An effective way for the S-TSC is shapelet transformation which produces a transformed dataset by the best k shapelets, where each of the k features in the dataset represent the distance between a time series and a shapelet. It can not only optimize the shapelet selection process, but also the transformed dataset can be combined with any traditional classifiers. However, the method requires evaluating a large amount of shapelets that will consume huge time. In this paper, we propose a matrix profile based method for shapelet discovery to handle time series binary classification. Firstly, this method calculates the distance from time series in one class to time series in another class. Secondly, it selects the three pairs of time series with the farthest distance, and finds the critical region corresponding to each set by the Matrix Profile, and extracts the shapelets from them. By this way, the shapelet candidates for evaluation can be significantly reduced. Experiments show that the method can improve the discovery speed of shapelets to a certain extent while maintaining high accuracy.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121345603","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":"Investigation and research on the current situation of amateur badminton population in Dongguan","authors":"Le Yu, Lun Yu","doi":"10.1109/CIS58238.2022.00065","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00065","url":null,"abstract":"Among many ball games, although badminton does not need direct physical confrontation, but there are certain requirements for speed, strength and flexibility of participants. At present, people have fully realized the importance of sports, become more interested in all kinds of sports, and the competitive level is also increasing. All kinds of sports events are organized frequently in Dongguan, Hunan Province. Due to the characteristics of small antagonism and fierce, a considerable number of project teams choose to carry out badminton competitions. Badminton is very beneficial to the physical and mental health of the participants. Compared with the professional badminton competition, there is still a larger space for the development of amateur badminton competition in terms of the scale and the number of participants. Based on this, this paper has carried out an in-depth study on the population related problems of amateur badminton in Dongguan. Quantitative analysis was used to explore the relevant factors that may have a significant impact on the number of amateur badminton population and the development of amateur badminton events in Dongguan. then the paper put forward some reasonable suggestions for the future of the city amateur badminton activity development.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126225785","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}
Lin Zhou, Zhaobing Su, Yongshi Zhuang, Yang Liu, Lei Fan
{"title":"Parallelization of multi-trajectory calculation based on Runge-Kutta method","authors":"Lin Zhou, Zhaobing Su, Yongshi Zhuang, Yang Liu, Lei Fan","doi":"10.1109/CIS58238.2022.00092","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00092","url":null,"abstract":"Uncontrolled exterior ballistic calculation is a typical computing intensive problem, which plays vital roles in aircraft design and trajectory planning. Solving this problem usually involves a large amount of calculation, which is time-consuming. To accelerate the multiple trajectory calculation, we design a multi-trajectory calculation architecture based on the fourth-order Runge-Katta method using multithreading parallel computing technology. The multi-trajectory calculation tasks will be allocated to different threads through tasks division. The influences of key factors of multi-trajectory calculation were analyzed in experiments. Simulation results show that the multi-trajectory parallel acceleration architecture can effectively reduce the calculation time and improve the calculation efficiency for the complex differential equations.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134373980","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}
Zijian Liu, Bingfeng Zhang, Cheng Xu, Yuansheng Liu, Jun Zhang
{"title":"Vision localization method for intelligent vehicles in low-texture environments","authors":"Zijian Liu, Bingfeng Zhang, Cheng Xu, Yuansheng Liu, Jun Zhang","doi":"10.1109/CIS58238.2022.00057","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00057","url":null,"abstract":"In order to address the problem that the intelligent vehicle will generate localization error due to the inability to extract enough feature points in the image under the low-texture environment, a detector-free method is proposed to accurately solve the intelligent vehicle position pose. Firstly, we perform dense matching at pixel level based on the improved LoFTR method for low-texture surfaces; secondly, we use DBSCAN to cluster the matching and select regions with higher matching confidence; finally, we use RANSAC to filter the outliers within the clustered regions to obtain accurate positional results. The experimental results on the public dataset show that the proposed method has good localization results.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131852027","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 receding horizon control algorithm of pipeline engineering robot path tracking based on sliding parameter estimation of sliding mode observer","authors":"Gengshun Chen, Sheng Zheng","doi":"10.1109/CIS58238.2022.00009","DOIUrl":"https://doi.org/10.1109/CIS58238.2022.00009","url":null,"abstract":"To improve the path-tracking accuracy of pipeline engineering robots in the wild, By studying the steering characteristics of pipeline engineering robots under sideslip disturbance, a kinematic model based on sliding was established. An improved synovial observer is proposed to estimate the sliding parameters of the robot. A genetic algorithm is used to optimize the gain coefficient of the synovial observer, which makes the estimation result more accurate. In addition, an improved Receding Horizon Control was proposed to discretize both nonlinear and linear terms in the model to reduce the difficulty of calculation. Experimental results show that the proposed RHC path-tracking control strategy based on slip parameter estimation can track the target path quickly and accurately with better tracking accuracy.","PeriodicalId":377327,"journal":{"name":"2022 18th International Conference on Computational Intelligence and Security (CIS)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133459288","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}