发布求助
文献互助 智能选刊 最新文献

2021 11th International Conference on Information Science and Technology (ICIST)最新文献

筛选
英文 中文
Impulsive Containment Control for Linear Multi-Agent Systems with Self-Feedback and Aperiodic Sampling 线性多智能体自反馈非周期采样系统的脉冲包容控制
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440623
Jiejie Chen, Boshan Chen, Z. Zeng, Ping Jiang, Yi Zhu
{"title":"Impulsive Containment Control for Linear Multi-Agent Systems with Self-Feedback and Aperiodic Sampling","authors":"Jiejie Chen, Boshan Chen, Z. Zeng, Ping Jiang, Yi Zhu","doi":"10.1109/ICIST52614.2021.9440623","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440623","url":null,"abstract":"In this paper we discuss the impulsive containment control problem of continuous-time linear multi-agent systems. Firstly, an impulsive control protocol with self-feedback and aperiodic sampling is proposed, in which the coupling matrix do not have to be Laplacian. Utilizing the proposed protocol, the impulsive containment control problem for continuous-time linear multi-agent systems is equivalently transformed into the stabilization problem of some independent linear discrete-time switched systems. Then a mode-dependent switching-type Lyapunov function is constructed, some sufficient conditions are showed by using some linear matrix inequalities to achieve the containment control purpose. In addition, based on a linear matrix inequality, the controller gain matrix can be designed to solve the containment control problem. In obtained results, the self-feedback gain, the size and the switching frequency of the sampling intervals can play all important roles. Finally, two simulation examples are employed to validate the effectiveness of the theoretical results.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125642148","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}
引用次数: 0
Command filter based event-triggered adaptive control for strict-feedback nonlinear systems with full state constraints 基于命令滤波的全状态约束严格反馈非线性系统自适应控制
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440552
Sijia Fan, Min Ma, Tong Wang
{"title":"Command filter based event-triggered adaptive control for strict-feedback nonlinear systems with full state constraints","authors":"Sijia Fan, Min Ma, Tong Wang","doi":"10.1109/ICIST52614.2021.9440552","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440552","url":null,"abstract":"This paper investigates event-triggered adaptive control problem for a class of strict-feedback nonlinear systems with full state constraints. Barrier Lyapunov functions are utilized for the stability analysis. To reduce the computational burden and energy consumption, command filtering design technique is incorporated into the proposed event-triggered control algorithm. Finally, a numerical simulation example is given to validate effectiveness of proposed control strategy.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128926688","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}
引用次数: 0
A Fast and Realistic Bloom Rendering Method for Large Scale 3D Scene 一种快速、逼真的大规模3D场景Bloom渲染方法
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440634
Wenshan Fan
{"title":"A Fast and Realistic Bloom Rendering Method for Large Scale 3D Scene","authors":"Wenshan Fan","doi":"10.1109/ICIST52614.2021.9440634","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440634","url":null,"abstract":"As a ubiquitous phenomenon in nature, bloom plays an important role in many 3D realistic rendering fields, such as CG games, films and scientific visulization. With the employment of bloom, the quality of synthetic image would be improved and the representation of abstract engineering data could be refined further. However, rendering bloom is always a concern due to its heavy computational overhead. Considering the irrugular geometric shapes and spatial occlusion, the issue becomes more complicated. To faciliate bloom rendering in the practical scenorio, the paper described a convolution-based image-space rendering algorithm, which exploited the ability of renderring to texture(RTT) and frame buffer object, to generate, transform and process the bloom textures in the multi-pass rendering style. The introduced method offered a high-quality and effective way both for nature objects rendering and abstract data-set visulization. The paper also implemented the introduced approach in aerospace application and demonstrated its feasibility in large scale 3D scene.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132450310","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}
引用次数: 0
Design of Data Acquisition System with High Precision for Lane-change Behavior Detection Applied in Intelligent and Connected Vehicles 应用于智能网联汽车的高精度变道行为检测数据采集系统设计
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440581
Luyao Du, Wei Chen, Zhonghui Pei, Jing Ji, Bingming Tong, Hongjiang Zheng
{"title":"Design of Data Acquisition System with High Precision for Lane-change Behavior Detection Applied in Intelligent and Connected Vehicles","authors":"Luyao Du, Wei Chen, Zhonghui Pei, Jing Ji, Bingming Tong, Hongjiang Zheng","doi":"10.1109/ICIST52614.2021.9440581","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440581","url":null,"abstract":"V2X technology enables the intelligent and connected vehicles (ICVs) to communicate with surrounding vehicles in real time. In order to obtain the data related to the lane-change behavior of the ICVs and its surrounding vehicles, a positioning data acquisition system with high precision is designed, including hardware and software. In the designed system, the high-precision position, velocity, acceleration and direction angle data are acquired based on the Sinan navigation high-precision receiver M100, the MK5 OBU of Cohda Wireless can be used to realize real-time communication of information, and the main controller is designed based on STM32, completes the collection and transmission of high-precision positioning information, and stores it in the SD card after time synchronization. The relevant data was collected by installing the designed system on the test vehicle, and the lane-changing behavior was manually marked and time stamped. The analysis of experimental results shows that the designed system can basically achieve lane-level accuracy in urban open road scenes, and accurately describe the trajectory of vehicle lane-change behavior.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132050246","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}
引用次数: 0
A Novel Memory Output Feedback Controller Design for Piecewise Affine Systems 一种分段仿射系统的记忆输出反馈控制器设计
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440564
Meng Wang, Wenqiang Ji, Yue Li
{"title":"A Novel Memory Output Feedback Controller Design for Piecewise Affine Systems","authors":"Meng Wang, Wenqiang Ji, Yue Li","doi":"10.1109/ICIST52614.2021.9440564","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440564","url":null,"abstract":"This article proposes a memory output feedback controller design approach to piecewise affine systems by using both the current and the past output measurements, i.e., y(t) and y(t−1). By adopting a descriptor system approach, the coupling problem between the controller gains and the Lyapunov matrices has been addressed. Based on piecewise Lyapunov functions and S-procedure, the stability analysis results have been obtained, and then the memory output feedback controller method has been proposed. Simulation results have been given to show the effectiveness and advantages of the proposed method over the conventional memoryless one.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132244018","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}
引用次数: 0
An Aerial Image Stitching Algorithm Based on Long-distance Features 一种基于远距离特征的航空图像拼接算法
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440638
Qiang Liu, Min Han, Jun Wang
{"title":"An Aerial Image Stitching Algorithm Based on Long-distance Features","authors":"Qiang Liu, Min Han, Jun Wang","doi":"10.1109/ICIST52614.2021.9440638","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440638","url":null,"abstract":"Aerial image stitching is very important in obtaining UAV information. The Speeded Up Robust Features Algorithm (SURF) is an image matching method with high robustness. However, the SURF algorithm subjects to the problems of inexact edge positioning and low matching accuracy. In order to obtain high-precision aerial stitching images with high efficiency, an aerial image stitching algorithm based on long-distance features is proposed in this paper. First, the Canny-SURF algorithm is used for feature detection. After that, the Long-Fast Retina Keypoint (L-FREAK) binary symbol is used to describe and match the feature points. Finally, the Random Sample Consensus Algorithm (RANSAC) is used to compute the projection transformation model, and the weighted average fusion algorithm is used to fuse the pixels. Experimental results show that the proposed algorithm is outperform the SIFT, SURF, ORB, and BRISK algorithms. The proposed algorithm has good stitching accuracy, and can stitch aerial images with wide rotation characteristics.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122191147","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}
引用次数: 0
Actor Spatiotemporal Relation Networks for Group Activity Recognition 群体活动识别的行动者时空关系网络
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440644
Yan Zhou, Siqi Tan, Dongli Wang, Jinzhen Mu
{"title":"Actor Spatiotemporal Relation Networks for Group Activity Recognition","authors":"Yan Zhou, Siqi Tan, Dongli Wang, Jinzhen Mu","doi":"10.1109/ICIST52614.2021.9440644","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440644","url":null,"abstract":"The existing video-based group activity recognition methods do not full use spatiotemporal information, and cannot effectively improve the accuracy of group recognition. This paper proposes an effective group activity recognition model based on Actor Spatial-Temporal Relation Networks (ASRN) to capture potential spatiotemporal features in an end-to-end manner. First, we propose an SRM to get the feature correlation between feature nodes from the temporal dimension and the spatial dimension. Second, Personal Spatiotemporal Feature Module (PSFM) and a Multi-actors Relation Module (MRM) are designed using SRM to extract actor-level spatiotemporal semantic information and the relation features between actors. We conducted experiments on two datasets: volleyball dataset and collective activity dataset. The results on these two datasets show the superiority of our method.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127194786","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}
引用次数: 2
A quick and effective iterated greedy algorithm for energy-efficient hybrid flow shop scheduling problem with blocking constraint 具有阻塞约束的高效混合流车间调度问题的一种快速有效的迭代贪婪算法
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440648
H. Qin, Yu-yan Han, Jun-qing Li, Hongyan Sang, Qing-da Chen, Leilei Meng, Biao Zhang
{"title":"A quick and effective iterated greedy algorithm for energy-efficient hybrid flow shop scheduling problem with blocking constraint","authors":"H. Qin, Yu-yan Han, Jun-qing Li, Hongyan Sang, Qing-da Chen, Leilei Meng, Biao Zhang","doi":"10.1109/ICIST52614.2021.9440648","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440648","url":null,"abstract":"With the continuous development of national economy, the problems of energy consumption are becoming more and more prominent. Similarly, the energy efficient scheduling problem in manufacturing has attracted much attention of the researchers. Some flow-shop scheduling problems have made progress on energy saving, but the research on hybrid flow shop with blocking constraint(BHFSP) is very few. Due to its NP-hard characteristic, in this paper, we suggest a mathematical model of BHFSP and a meta heuristic method named quick iterative greedy algorithm (IGQ) to solve this problem. Compared with other existing IG algorithms, for BHFSP, three main contributions of the IGQ are described as follows: First, we use the MME to initialize the solution. Second, we develop a quick local perturbation strategy to ensure the convergence of the algorithm. Third, a quick global perturbation strategy is proposed to guarantee the diversity of the algorithm. Computational results and comparisons verify the effectiveness of proposed algorithm IGQ for solving BHFSP.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127914231","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}
引用次数: 2
An improved iterated greedy algorithm for the distributed flow shop scheduling problem with sequence-dependent setup times 针对时序相关的分布式流水车间调度问题，提出一种改进的迭代贪心算法
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440591
Xue Han, Yu-yan Han, Yiping Liu, Q. Pan, H. Qin, Jun-qing Li
{"title":"An improved iterated greedy algorithm for the distributed flow shop scheduling problem with sequence-dependent setup times","authors":"Xue Han, Yu-yan Han, Yiping Liu, Q. Pan, H. Qin, Jun-qing Li","doi":"10.1109/ICIST52614.2021.9440591","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440591","url":null,"abstract":"In various flow shop scheduling problems, it is very common that a large-scale production is done. Under this situation, more factories are of more practical interest than a factory. Thus, the distributed permutation flow shop scheduling problems (DPFSPs) have been attracted attentions by researchers. However, the DPFSP is more complicated than the traditional flow shop scheduling problems. It considers not only the processing order of the jobs, but also how to distribute the jobs to multiple factories for parallel processing. In addition, the sequence- dependent setup time (SDST) constraint of machines is taken into account to well study the above DPFSP with SDST. This paper presents a simple and effective iterated greedy algorithm. It is proposed to replace the traditional insertion-based local search with exchange-based local search, which greatly improves the search efficiency. The proposed new iterated greedy (NIG) algorithm is applied to test instances, and compares with the state- of-the-art algorithms. Our empirical results demonstrate that the proposed algorithm outperforms the compared algorithms and can obtain the best solution of DPFSP.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115458411","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}
引用次数: 0
Top-k Graph Similarity Search Based on Hierarchical Inverted Index 基于层次倒排索引的Top-k图相似度搜索
2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440632
Zhong-qing Wang, Yan Yang, Y. Zhong
{"title":"Top-k Graph Similarity Search Based on Hierarchical Inverted Index","authors":"Zhong-qing Wang, Yan Yang, Y. Zhong","doi":"10.1109/ICIST52614.2021.9440632","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440632","url":null,"abstract":"Graph similarity search is an important research problem in many applications, such as finding result graphs that have a similar structure to a given entity in biochemistry, data mining, and pattern recognition. Top-k graph similarity search is one of graph similarity search tasks, which aims to find the top-k graphs that are most similar to the query graph in a given graph database. In this paper, the top-k similarity search problem based on the graph edit distance is studied according to the corollary of the partitioned similarity theorem. Firstly, in order to speed up the online search process and avoid scanning each graph in the database one by one, an offline hierarchical inverted index is constructed to satisfy top-k search. Secondly, the offline hierarchical inverted index is used to filter the candidate graphs online and verify them, which reduces the time of searching the graphs. Finally, the good performance of the algorithm in running time and scalability is verified by running the similarity algorithm on real dataset and synthetic dataset.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114779158","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信