2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)最新文献

筛选
英文 中文
Research on Anti-condensation Design of Charging Equipments 充电设备防冷凝设计研究
Qingyong Gao, Yang Zhang, X. Fang, Zhichao Xing, Xiaoguang Zhang
{"title":"Research on Anti-condensation Design of Charging Equipments","authors":"Qingyong Gao, Yang Zhang, X. Fang, Zhichao Xing, Xiaoguang Zhang","doi":"10.1109/IHMSC55436.2022.00025","DOIUrl":"https://doi.org/10.1109/IHMSC55436.2022.00025","url":null,"abstract":"Charging equipments for electric vehicles are directly installed outside. Condensation phenomenon would occur on the surface of charging equipments with rapidly changing of ambient temperature and humidity. The mechanism of dewing and harm of dew to electrical equipments in high humidity enviroment were studied in this paper. Four design shcemes were improved to solve the problem of dewing. Simulation test of condensation was accomplished by using high-low temperature chamber. The effect of four design schemes is tested and anlyzed to find the best anti-condensation scheme. Safety and reliability of internal electrical equipments are effectively guaranteed. The design scheme has important guiding significance for anti-condensation design of similar outdoor products.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"74 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116374082","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
Improved Spatial Information Sampling Algorithm 改进的空间信息采样算法
Jiayi Li, Haichuan Yang, Zihang Zhang, Yuki Todo, Shangce Gao
{"title":"Improved Spatial Information Sampling Algorithm","authors":"Jiayi Li, Haichuan Yang, Zihang Zhang, Yuki Todo, Shangce Gao","doi":"10.1109/IHMSC55436.2022.00032","DOIUrl":"https://doi.org/10.1109/IHMSC55436.2022.00032","url":null,"abstract":"Spatial information sampling algorithm (SIS) is an evolutionary algorithm that uses intelligent solutions for decision making. In SIS, the shape of solution space of the population is normalized to a hypercube distribution. The SIS always searches around the best individuals, and thus suffers from a local optimum trapping problem. Therefore, we propose an improved spatial information sampling algorithm (ISIS). We innovatively propose a dynamic adjustment of the population structure strategy and improve on the original search strategy so that the ISIS algorithm can search around multiple good individuals simultaneously. We compare the results of ISIS on 29 benchmark problems from CEC2017 with other state-of-the-art algorithms, and our algorithm has significant advantages.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122752912","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
Criteria and Application of Semi-α-Preinvex Function 半-α-预反凸函数的判据及应用
Haiying Wang, Zufeng Fu, Jing Li, Bing Tan
{"title":"Criteria and Application of Semi-α-Preinvex Function","authors":"Haiying Wang, Zufeng Fu, Jing Li, Bing Tan","doi":"10.1109/IHMSC55436.2022.00038","DOIUrl":"https://doi.org/10.1109/IHMSC55436.2022.00038","url":null,"abstract":"In this paper, we consider the class of semi-α-preinvex functions. Under certain conditions, we provide a new criteria for differentiable semi-α-preinvex functions, and four new criteria for nondifferentiable semi-α-preinvex functions, respectively. The application of this function in the multioptimization problem also has been studied.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128092582","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
The NP-Completeness of (1,0)-Regular (k,s)-SAT (1,0)-正则(k,s)-SAT的np -完备性
Zufeng Fu, Haiying Wang, He Li, Jinjiang Liu
{"title":"The NP-Completeness of (1,0)-Regular (k,s)-SAT","authors":"Zufeng Fu, Haiying Wang, He Li, Jinjiang Liu","doi":"10.1109/IHMSC55436.2022.00021","DOIUrl":"https://doi.org/10.1109/IHMSC55436.2022.00021","url":null,"abstract":"Dealing with uncertainty in optimization is increasingly recognized as a key necessity for tackling real-world problems. A (1,0)-super solution has better robust, and can protect against default risk of variable assignment. When flipped a value of any one of variables, the (1,0)-super solution still is a solution. In this work, we study the completeness of (1,0)-regular (k,s)-SAT. (1,0)-regular (k,s)-SAT is a problem to decide whether a regular (k,s)-CNF formula has a (1,0)-super solution. We give a reduction method that transform from (k,s)-SAT to (1,0)-regular (k+1,s)-SAT if an unsatisfiable (k,s)-CNF formula exists, and a structure method of forced-regular (k,s)-CNF formula. This implies that (1,0)-regular (k +1,s)-SAT problem has a sudden jump from triviality to NP-completeness for every k > 3.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128144481","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
Vehicle Type Recognition Based on Data Augmentation and Deep Learning 基于数据增强和深度学习的车辆类型识别
Tiegang Bai, Zhihang Liu
{"title":"Vehicle Type Recognition Based on Data Augmentation and Deep Learning","authors":"Tiegang Bai, Zhihang Liu","doi":"10.1109/ihmsc55436.2022.00043","DOIUrl":"https://doi.org/10.1109/ihmsc55436.2022.00043","url":null,"abstract":"The task of vehicle type recognition in images is mainly used in parking lots, road and bridge toll management and public security traffic management departments. However, in practical applications, the recognition method has low recognition accuracy due to factors such as background clutter, illumination changes, diverse viewing angles, partial occlusion, and motion blur. In order to solve this problem, this paper adopts the deep learning method to realize the task of vehicle recognition. Due to the limited amount of image data, the training of deep learning cannot be satisfied. To solve this problem, this paper adopts the data augmentation (DA) method to expand the scale of the data set can realize intelligent vehicle recognition based on deep learning. The experimental results show that the method proposed in this paper is superior to the existing vehicle recognition methods based on deep learning, and the recognition accuracy can reach 92%.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129870180","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
GDLR: A Robust 3D Laser Descriptor for Loop Closure Detection and Registration 用于闭环检测和配准的鲁棒三维激光描述子
Nan Zhang, Shilong Rong, Cheng Shang
{"title":"GDLR: A Robust 3D Laser Descriptor for Loop Closure Detection and Registration","authors":"Nan Zhang, Shilong Rong, Cheng Shang","doi":"10.1109/IHMSC55436.2022.00010","DOIUrl":"https://doi.org/10.1109/IHMSC55436.2022.00010","url":null,"abstract":"In this paper, we present a novel 3D point cloud descriptor GDLR, which aims to realize robust 3D laser loop detection and registration in challenging scenarios with large rotation or inadequate overlapping. We test the proposed method on Kitti datasets and compare our results with the state-of-the-art methods. Experimental results show GDLR performs a better precision than the state-of-the-art methods and achieves far better registration accuracy than other scan registration methods.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134562628","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
Searching for a Consensus Agreement for Multilateral Multi-Issue Automated Negotiation 寻求多边多议题自动谈判的共识协议
Mukun Cao, Shengjie Dang
{"title":"Searching for a Consensus Agreement for Multilateral Multi-Issue Automated Negotiation","authors":"Mukun Cao, Shengjie Dang","doi":"10.1109/IHMSC55436.2022.00023","DOIUrl":"https://doi.org/10.1109/IHMSC55436.2022.00023","url":null,"abstract":"In this paper, we propose a multilateral multi-issue automated negotiation model that aims to search for a consensus agreement. Multilateral multi-issue automated negotiation is more complicated compared with bilateral negotiations. However, most of the existing multilateral negotiations are still the form of bilateral negotiations. This method usually performs with low transaction efficiency and high cost and cannot meet the complicated scenario requirements, in which multiple agents seek a consensus agreement. Therefore, we propose a multilateral multi-issue automated negotiation model based on the multi-dimensional Pareto front. This method takes the pareto optimality of negotiation offers, which can effectively solve the multilateral multi-issue automated negotiation problems.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346989","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
IHMSC 2022 Committees
{"title":"IHMSC 2022 Committees","authors":"","doi":"10.1109/ihmsc55436.2022.00006","DOIUrl":"https://doi.org/10.1109/ihmsc55436.2022.00006","url":null,"abstract":"","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"3 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120859889","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
Fault-Tolerant Finite-Time Consensus of Single-Integrator Multi-Agent Systems under Synchronous Self-Sensing Function Failure 同步自感知功能失效下单积分器多智能体系统的容错有限时间一致性
Zhihai Wu, Linbo Xie
{"title":"Fault-Tolerant Finite-Time Consensus of Single-Integrator Multi-Agent Systems under Synchronous Self-Sensing Function Failure","authors":"Zhihai Wu, Linbo Xie","doi":"10.1109/IHMSC55436.2022.00033","DOIUrl":"https://doi.org/10.1109/IHMSC55436.2022.00033","url":null,"abstract":"This paper focuses on fault-tolerant finite-time consensus problems of single-integrator multi-agent systems (MASs) with partial agents subject to synchronous self-sensing function failure (SSFF). First, a strategy of recovering the connectivity of network topology among normal agents is presented based on multi-hop communication technology together with agents subject to SSFF as routing nodes. Second, a fault-tolerant finite-time consensus protocol with time-varying gains is devised. Third, consensus convergence analysis is made by separately considering the dynamics of normal agents and ones subject to SSFF. It shows that single-integrator MASs applying the proposed strategy of recovering the network topology connectivity and fault-tolerant finite-time consensus protocol with the proper time-varying gains can reach finite-time consensus. Last, numerical simulations are given to illustrate the effectiveness of the theoretical results.","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545251","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}
引用次数: 1
IHMSC 2022 Reviewers
{"title":"IHMSC 2022 Reviewers","authors":"","doi":"10.1109/ihmsc55436.2022.00007","DOIUrl":"https://doi.org/10.1109/ihmsc55436.2022.00007","url":null,"abstract":"","PeriodicalId":447862,"journal":{"name":"2022 14th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)","volume":"21 S8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113958088","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学术文献互助群
群 号:604180095
Book学术官方微信