{"title":"Multi-target Trajectory Analysis based on Extended Perception Domain and Skeleton Extraction","authors":"Bo Zhu, Fangjie Zhong, X. Lv, Peng Qiao","doi":"10.1109/icsai53574.2021.9664177","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664177","url":null,"abstract":"Traditional trajectory analysis methods are based on time-series multi-frame image data, target shape and other information. But they do not work well for single frame or sparse time-series multi-target image data. In this paper, a simple and effective sparse trajectory analysis method, based on extended perception domain and skeleton extraction, is proposed for multitarget single frame image data. First of all, the convex hull region feature of sparse points is extracted. The second step, these points are connected into different lines. Then, the skeleton of each trajectory and the coordinate points that make up the trajectory is extracted and recorded respectively. Finally, all kinds of curves are classified and connected by the extending perception domain. The experimental results show that the method can extract multitarget trajectories well under time series data and target features free.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132977287","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":"Some the approximate reasoning models over attribute logic semantic","authors":"Jialu Zhang, Juan Xiao","doi":"10.1109/ICSAI53574.2021.9664182","DOIUrl":"https://doi.org/10.1109/ICSAI53574.2021.9664182","url":null,"abstract":"By using the methods of triple-I reasoning for all implication, we give the solutions of generalized MP rules and MT rules in attribute logic, and propose some approximate reasoning methods based on generalized MP rules and MT rules. We also proposed an approximate reasoning method based on the attribute logic pseudo-metric, and discuss the relation among various approximate reasoning methods.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114044867","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":"Steady-State Optimization of a Biological Process","authors":"Gongxian Xu, Zhuxi Li, Yuzhu Wang","doi":"10.1109/icsai53574.2021.9664197","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664197","url":null,"abstract":"This paper deals with the steady-state optimization of continuous process in glycerol metabolism. An optimization model is established by maximizing the production rate of the desired product. This model also considers the requirement for the stable steady-state point of considered bioprocess. The proposed model is then transformed into a nonlinear optimization problem by using the Hurwitz criteria. Finally, the new problem is solved by a hybrid method. This approach combines a deterministic solver and a stochastic solver. We not only obtain the stable steady-state point of considered bioprocess, but also attain the maximum production rate of desired product increased more than 10.37 times its initial point.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114712107","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":"Dynamic Weighted Anytime Bounded Cost Search Algorithm","authors":"Jiaying Che, Xiangrong Tong","doi":"10.1109/icsai53574.2021.9664215","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664215","url":null,"abstract":"The best first algorithm like A* can find the optimal path if the time and memory is enough. However, it is usually difficult to do it in many cases. Moreover, there is always not enough time to support algorithm to find the optimal solution. On the other hand, users usually need an available solution rather than the optimal solution. Based on this, we propose Dynamic weighted Anytime Bounded Cost Search(DW-ABCS) algorithm. It combines the Bounded sub-optimal search(BSS) with the Bounded cost search(BCS) and improves the problem that BCS may not find a solution if the cost bound set is less than the optimal solution. Furthermore, in order to improve the efficiency of search, DW-ABCS algorithm dynamically modify the cost bound by considering the depth of nodes in the search process. In this way, the nodes considered become less and less and the complexity of algorithm will be lower and lower along the depth of search increasing, which improves the search efficiency significantly. In addition, the idea of anytime algorithm is used to find a better solution in every iteration. In this way, the algorithm can quickly find a sub-optimal path within suboptimal bound, and then reducing the sub-optimal bound to optimize it until the time out. If time permitted, the algorithm can converge to the optimal solution. Specially, we conducted a rigorous theoretical analysis. The various gird maps are used to verify the performance of DW-ABCS. Experimental results show that DW-ABCS algorithm can effectively identify the sub-optimal solution in different scenes.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122527548","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":"Optimal Virtual Machine Allocations in Cloud Computing System","authors":"Wenlong Ni, Jue Wang, Ziyang Liu, Huaixiang Song, Huangning Chen, Xinyu Zhou","doi":"10.1109/icsai53574.2021.9664088","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664088","url":null,"abstract":"Cloud Computing (CC) is a popular computing paradigm by providing virtual resources as services over the internet. In the CC system, each user request can get services on a pay as you use basis. There is reward and system cost for serving each request, and the service provider can decide the amount of resources to assign to each request. Regardless of the random request arrivals and departures, a novel model of the Continous-Time Markov Decision Process (CTMDP) is explored. In this paper our goal is to maximize the total discounted expected reward for service providers. With the solution of the Bellman optimality equation by the value iteration method, an optimal policy can be achieved.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209423","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 Business Structure of a Metrology Institution Based on Linear Regression Analysis","authors":"D. Zhao, Yudong Liu, Xiaojing Zhang, Tianyi Liu, Zhi Hu, Yiran Zheng","doi":"10.1109/icsai53574.2021.9664213","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664213","url":null,"abstract":"This paper is based on the business data of a metrology institution. First, the core sample data of the measurement institution is obtained through scattering graph analysis. Then, in combination with the actual business conditions, the four-quadrant analysis is conducted to classify the core sample data into four quadrant areas with their characteristics. Next, SPSS data analysis software is used to perform linear regression analysis on the business data of each quadrant area, and the data analysis results are taken to further study the impact of the measurement and testing fee on the volume of the business units of the measurement agency. Finally, for the business structure in each quadrant area, some suggestions for business improvement are given based on the K-means clustering algorithm and the analysis of customer properties.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129684373","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":"Dynamic Maintenance Document Management Based on BOM","authors":"Chunliu Zhou, Shan Ye, Hongjun Wang, Zhenhua Gao","doi":"10.1109/icsai53574.2021.9664090","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664090","url":null,"abstract":"To realize the efficient management of high-speed train maintenance documents, a document management method based on the Bill of Material (BOM) was proposed. Since the maintenance documents were dynamically changed as the design updated, and the change process was complicated and time-consuming via handwork, the relationship between the Engineering BOM (EBOM) and the Documental BOM (DBOM) was established, which delivered the design change, updated the maintenance documents in real time, and provided the latest documents for on-site maintenance business. Technologies of fuzzy matching, version management and XML were used together to realized the dynamic management of maintenance documents, and an application was displayed with system interfaces to verify the DBOM method.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116192616","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":"Coordinated control strategy of the battery energy storage system for lifetime extension and efficiency improvement in wind power applications","authors":"W. Chai, Bobo Li","doi":"10.1109/icsai53574.2021.9664112","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664112","url":null,"abstract":"The battery energy storage system (BESS) can be controlled to smooth the wind power with the active power regulation. At the same time, the BESS can regulate the grid-side voltage with the reactive power control. In this paper, a coordinated control strategy for active and reactive power control of the BESS based on a variable charge/discharge time (CDT) and an optimal filter time is proposed to extend the BESS lifetime and improve BESS efficiency. First, the relationships between the charge/discharge time (CDT) of the BESS and the lifetime and efficiency of the BESS are studied. To extend the BESS lifetime and improve BESS efficiency, a variable CDT control scheme of the BESS is developed. Then, an optimization algorithm of the variable filter time is developed to satisfy both the wind power smoothing and the grid-side voltage regulation requirements. Finally, the proposed BESS control method is verified by a simulation with the actual data from a wind farm.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132051439","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}
Etienne Mueller, V. Studenyak, Daniel Auge, Alois Knoll
{"title":"Spiking Transformer Networks: A Rate Coded Approach for Processing Sequential Data","authors":"Etienne Mueller, V. Studenyak, Daniel Auge, Alois Knoll","doi":"10.1109/ICSAI53574.2021.9664146","DOIUrl":"https://doi.org/10.1109/ICSAI53574.2021.9664146","url":null,"abstract":"Machine learning applications are steadily increasing in performance, while also being deployed on a growing number of devices with limited energy resources. To minimize this trade-off, researchers are continually looking for more energy efficient solutions. A promising field involves the use of spiking neural networks in combination with neuromorphic hardware, significantly reducing energy consumption since energy is only consumed as information is being processed. However, as their learning algorithms lag behind conventional neural networks trained with backpropagation, not many applications can be found today. The highest levels of accuracy can be achieved by converting networks that are trained with backpropagation to spiking networks. Spiking neural networks can show nearly the same performance in fully connected and convolutional networks. The conversion of recurrent networks has been shown to be challenging. However, recent progress with transformer networks could change this. This type of network not only consists of modules that can easily be converted, but also shows the best accuracy levels for different machine learning tasks. In this work, we present a method to convert the transformer architecture to networks of spiking neurons. With only minimal conversion loss, our approach can be used for processing sequential data with very high accuracy while offering the possibility of reductions in energy consumption.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133711944","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 New A* Method toward Routing Plan for Marine Vessel","authors":"Daheng Zhang, Chengjie Hou, Chuang Zhang","doi":"10.1109/ICSAI53574.2021.9664032","DOIUrl":"https://doi.org/10.1109/ICSAI53574.2021.9664032","url":null,"abstract":"Effective routing plan is a key problem of ship navigation, which is characterized by dynamic obstacles in the complex marine environment. To solve the problem of ship routing plan in the marine environment, this paper proposes an A* method which takes a ship surrounded by a circular boundary as a safety distance constraint. Different from routing plan based on graphic approach, this study also extends the classic A* method, including static obstacles and dynamic obstacles. The effectiveness of this method is verified by simulation experiments under different environmental conditions.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133860447","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}