L. Boldrin, Vanesa Daza, R. Prisco, Sergi Rovira, Saverio Sivo
{"title":"A trust module for the interaction with virtual characters","authors":"L. Boldrin, Vanesa Daza, R. Prisco, Sergi Rovira, Saverio Sivo","doi":"10.1109/icsai53574.2021.9664176","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664176","url":null,"abstract":"This paper describes the architecture of a trust module for the interaction between human users and virtual characters. The module is part of a bigger project whose goal is that of creating virtual and truly realistic characters capable of interacting with human users. An example of such a virtual character is a computer rendered museum clerk that interacts with visitors. The role of the security module in the envisioned scenarios is that of providing trust, mainly regarding the identity of the human user, but also about the “identity” of the virtual character. In this paper we design (and describe the implementation) of an architecture in which human users identities are checked through face recognition and handled with verifiable credentials managed through a public blockchain. The project has been funded by the European Union and is under realization.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"128 6 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":"117110552","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 Web Crawler Based on Python to Obtain Public Emotional data Analysis - Take The Weibo Hot Rearch data as An Example","authors":"Qing Bai, Zhangliao Xu, Yuyan Liu, Xisong Miao, Qing Xiu","doi":"10.1109/ICSAI53574.2021.9664113","DOIUrl":"https://doi.org/10.1109/ICSAI53574.2021.9664113","url":null,"abstract":"With the development of the times continuously, the increasing popularity of the Internet and the maturity of its date base, the amount of date in human daliy study, life and work presents an enponentail growth, when the collected data is large and more complex, it is urgent to collect data from a large amount of data and extract valuable information. Taking Sina Weibo as an example, this paper uses web crawlers to crawl data, and analyzes the emotion of weibo hot search data through Bayesian network model, which is of great significance for controlling the direction of public opinion.","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":"115283760","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 Sequential Quadratic Programming Based Material Allocation Optimization Algorithm","authors":"Zheng Fan, Tong-Le Duan, Jin Wu","doi":"10.1109/ICSAI53574.2021.9664104","DOIUrl":"https://doi.org/10.1109/ICSAI53574.2021.9664104","url":null,"abstract":"Material allocation is a nonlinear optimization problem. For this problem, a quadratic programming based material allocation optimization algorithm is proposed. In the proposed algorithm, firstly, the objective function of support effectiveness and its approximate model of quadratic programming are constructed with target importance and material requirements. Secondly, by using SQP (sequential quadratic programming), the proposed algorithm quickly converge to the optimal solution. For the initial allocation, selective rounding and iterative adjustment according to the material requirements is implemented, and then obtaining the final allocation. Simulation results show that through combing the target parameters and actual requirements constrains, the proposed algorithm can realize reasonable, balanced and fast allocation.","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":"129727060","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}
Yukang Shen, Baoju Li, Yong Sun, Wenchuan Wu, Chang Liu, Bin Wang
{"title":"Data-driven Identification for Frequency Regulation Model of Wind Farms","authors":"Yukang Shen, Baoju Li, Yong Sun, Wenchuan Wu, Chang Liu, Bin Wang","doi":"10.1109/ICSAI53574.2021.9664143","DOIUrl":"https://doi.org/10.1109/ICSAI53574.2021.9664143","url":null,"abstract":"The increasing penetration of the renewable energy sources (RES) brings new challenges to the frequency security of power systems. Therefore, qualifying the frequency regulation capacity of RES is indispensable. However, the diversity of the control strategies deployed for wind turbines makes it hard to explicitly formulate the frequency regulation model. In this paper, Sparse Identification of Nonlinear Dynamics (SINDy), a data-driven method is employed to identify the aggregated frequency regulation model of wind farms, which can be represented as an equivalent governor transfer function. Compared with physical modelling approach which needs to know all the control parameters in advance, this data-driven method can learn the model characteristics of dynamic systems from the historical data using a universal framework. Numerical simulations indicate that the proposed general frequency regulation model identification framework is applicable to wind farms with high accuracy.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"22 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":"121857497","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 Multi-Task Information Extraction Framework for Bridge Inspection Based on Joint Neural Networks","authors":"Jianxi Yang, Xiaoxia Yang, Ren Li, Mengting Luo","doi":"10.1109/icsai53574.2021.9664111","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664111","url":null,"abstract":"Focused on the issue that insufficient information extraction and knowledge services in the bridge management and maintenance domain, a multi-task information extraction framework for bridge inspection based on joint neural networks is proposed. Firstly, a multi-task information extraction training dataset for bridge inspection is constructed and a distributed representation of the text is obtained using BERT as the embedding layer. Secondly, the subtasks of topic word detection and other bridge inspection information extraction are jointly learned by sharing BERT weights and fine-tuning, and the context features are further extracted in depth. Finally, the bridge inspection knowledge service is used as application examples to verify the effectiveness of the bridge inspection information extraction model in actual application scenarios such as bridge domain question answering. In the comparison experiments with mainstream models, the proposed method outperforms the mainstream models with F1-score of 85.27%, 72.73%, and 90.76% for the NER, RE, and topic word detection respectively. The experimental results show that the model can meet the requirements of a variety of practical tasks for information extraction of bridge inspection.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"19 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":"115951706","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":"Cuckoo-Beetle Swarm Search for Nonlinear Optimization: A New Meta-Heuristic Algorithm","authors":"Guancheng Zhou, Dechao Chen, Rensu Gu, Shuai Li","doi":"10.1109/icsai53574.2021.9664216","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664216","url":null,"abstract":"Conventional meta-heuristic algorithms have problems being trapped in local optima because of premature convergence and insufficient global search ability in solving nonlinear optimization. This brief proposes a new meta-heuristic algorithm, called cuckoo-beetle swarm search (CBSS) to handle this issue in nonlinear optimization. The proposed algorithm imitates the breeding habits of cuckoos and the food foraging characteristics of beetles. Levy flight is combined with particle search velocity to improve the global optimization of CBSS. Nonlinear benchmark functions are tested to verify the accuracy, search speed, and stability of the CBSS algorithm. The numerical verification proves that the proposed algorithm has better robustness and global search capability than its counterparts.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"66 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":"127125696","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}
Pengfei Zheng, Chongbin Guo, Qingfeng Ji, Sujie Guo
{"title":"Design and Distributed Autonomous Scheduling Strategy of Satellite Constellation with High Frequency and Long Duration","authors":"Pengfei Zheng, Chongbin Guo, Qingfeng Ji, Sujie Guo","doi":"10.1109/icsai53574.2021.9664098","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664098","url":null,"abstract":"With the increasing communication and remote sensing demand, a constellation composed of multiple low-orbit satellites is usually designed. However, it is faced with the problems of how to achieve coverage with high frequency, long duration, and fully autonomous for a sudden ground target. Given the difficulty of the conventional constellation to achieve the above capabilities at a lower cost, a broken-chain constellation is proposed. The broken-chain constellation maintains a chain-like configuration in space to achieve better coverage uniformity, which can reduce the number of satellites. Aiming at the fully autonomous operation of the constellation, a distributed autonomous scheduling strategy is designed considering the chain-like characteristics. Compared with the traditional centralized scheduling method, this strategy not only effectively reduces the computational cost but also improves the dynamic response to the observation of sudden ground targets.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"16 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":"124096436","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 Improved Gaming Particle Swarm Algorithm Based the Rules of Flexible Job Shop Scheduling","authors":"Xiaojie Xu, Lisheng Wang","doi":"10.1109/icsai53574.2021.9664124","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664124","url":null,"abstract":"Job shop scheduling problem (JSP) has been proved a NP-Hard problem. As the extension of JSP, flexible job shop scheduling problem (FJSP) is more complex combinatorial optimization problem than JSP, and is closer to the real process of production than JSP. FJSP is one of classic problems of intelligent manufacturing and its study owns an important value of theory and the significance of directing actual production. The searching mechanisms of tradition particle swarm optimization algorithm (PSO) are improved based on the scheduling theories and criteria under the help of the gaming results among different objectives. After testing standard benchmarks and comparing the results with other results obtained with other improved PSOs, the improved gaming PSO is proved effectively to minimize the maximum complete time of FJSP.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"13 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":"114919713","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 Influence Factors of Zero-input Response","authors":"Y. Zhong, Xianbing Pan, Y. Zhang","doi":"10.1109/ICSAI53574.2021.9664037","DOIUrl":"https://doi.org/10.1109/ICSAI53574.2021.9664037","url":null,"abstract":"Zero-input response is a basic concept in system analysis. It is involved in both simple and complex systems, continuous systems and discrete systems. Of course, the theory of zero-input response in continuous lumped parameter linear time invariant systems (continuous LTI systems for short) is the basis. In the current general theory, the zero-input response of continuous LTI system is considered to be determined by the differential equation and 0− state of the system. However, this paper demonstrates that the zero-input response of continuous LTI system is related not only to the differential equation and 0− state of the system, but also to the input signal expression of the system for time $mathrm{t} < 0$. This paper makes an important improvement on the basic system analysis theory, which helps to lay a solid foundation for all kinds of system analysis.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"113 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":"132456977","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":"Privacy Preserving Mining Sequential Pattern based on Random Data Perturbation","authors":"Weimin Ouyang","doi":"10.1109/icsai53574.2021.9664200","DOIUrl":"https://doi.org/10.1109/icsai53574.2021.9664200","url":null,"abstract":"Privacy preserving data mining is a hot research direction of data mining in the big data environment. If Data mining has been used properly, it will endanger the privacy and the information. Inspired by that, we researched a method via random data perturbation method to keep privacy preserving in sequential patterns mining. Its strategy is as follows: First, noisy events are added into each event sequence of the original database. Then, an algorithm PP-Span (Privacy-Preserving Sequential pattern mining) is proposed to reconstruct the frequent sequences from these noise-added data sequences. Our results showed that it can outperform a lot of traditional methods.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"12 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":"131633829","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}