Different from source coding, which only emphasizes coding efficiency, fault-tolerant coding adds some redundant information during coding to strengthen the ability of error resistance, so as to obtain the best gain with the least redundancy. Therefore, the application of fault-tolerant coding in the repair of mobile cache system of satellite Internet of Things can effectively improve the security of information storage of satellite Internet of Things. Based on this, this paper introduces the repair method of mobile cache system of satellite Internet of Things based on fault-tolerant coding from the aspects of data deployment and data collection, so as to repair the invalid data in time and ensure the integrity and availability of the saved data. At the same time, a specific method to optimize its system parameters is proposed. The repair of mobile cache system of satellite Internet of Things based on fault-tolerant coding can effectively solve the disadvantages of low price and short service time of sensor node terminal equipment in Internet of Things, and avoid problems such as data storage failure or performance weakening of cache communication system caused by sensor leaving satellite coverage and power exhaustion, so as to provide corresponding reference for the development of satellite Internet of Things.
{"title":"Research on repairing mobile cache system of satellite Internet of Things based on fault-tolerant coding","authors":"Hua Zhang, Jiong Wang","doi":"10.1117/12.2671300","DOIUrl":"https://doi.org/10.1117/12.2671300","url":null,"abstract":"Different from source coding, which only emphasizes coding efficiency, fault-tolerant coding adds some redundant information during coding to strengthen the ability of error resistance, so as to obtain the best gain with the least redundancy. Therefore, the application of fault-tolerant coding in the repair of mobile cache system of satellite Internet of Things can effectively improve the security of information storage of satellite Internet of Things. Based on this, this paper introduces the repair method of mobile cache system of satellite Internet of Things based on fault-tolerant coding from the aspects of data deployment and data collection, so as to repair the invalid data in time and ensure the integrity and availability of the saved data. At the same time, a specific method to optimize its system parameters is proposed. The repair of mobile cache system of satellite Internet of Things based on fault-tolerant coding can effectively solve the disadvantages of low price and short service time of sensor node terminal equipment in Internet of Things, and avoid problems such as data storage failure or performance weakening of cache communication system caused by sensor leaving satellite coverage and power exhaustion, so as to provide corresponding reference for the development of satellite Internet of Things.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132983706","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}
The third-party emergency forces such as neighboring enterprises in the accident can improve the rescue efficiency and shorten the rescue time to ensure the production and property safety of the affected people as much as possible. This paper proposes an emergency material scheduling model taking time as the objective and considering the participation of multi-party emergency forces. The model can freely decide the type of materials to improve the rescue efficiency when the risk index of the accident point is satisfied. A real case illustrates the applicability of the proposed model. The result shows that the average arrival time of emergency supplies for corporate safety production accidents is 12.53 minutes, of which 89.13% of accidents can deliver supplies within 10 minutes. Daishan Fire Brigade and CNOOC (Zhoushan) are the main rescue partners for enterprises. In addition, foam trucks are given priority to be put into the rescue process. This study can provide a basis for enterprises to adjust the storage of materials and the government to supervise enterprises.
{"title":"Optimization of enterprise emergency material dispatch considering the third-party emergency force","authors":"Jihong Ye, Jiang Wei, Hong Bingyuan","doi":"10.1117/12.2671925","DOIUrl":"https://doi.org/10.1117/12.2671925","url":null,"abstract":"The third-party emergency forces such as neighboring enterprises in the accident can improve the rescue efficiency and shorten the rescue time to ensure the production and property safety of the affected people as much as possible. This paper proposes an emergency material scheduling model taking time as the objective and considering the participation of multi-party emergency forces. The model can freely decide the type of materials to improve the rescue efficiency when the risk index of the accident point is satisfied. A real case illustrates the applicability of the proposed model. The result shows that the average arrival time of emergency supplies for corporate safety production accidents is 12.53 minutes, of which 89.13% of accidents can deliver supplies within 10 minutes. Daishan Fire Brigade and CNOOC (Zhoushan) are the main rescue partners for enterprises. In addition, foam trucks are given priority to be put into the rescue process. This study can provide a basis for enterprises to adjust the storage of materials and the government to supervise enterprises.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127854857","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}
A coverage optimization method based on an improved sparrow search algorithm (LSSA) is proposed for the coverage problem arising from the initialization of wireless sensor networks. Firstly, the good point set method is used for population initialization to make the sparrow individuals uniformly distributed, and the algorithm can effectively avoid falling into the local optimization. Secondly, a nonlinear convergence factor is proposed to constrain the proportion of producers and scroungers, which ensures the diversity of the population during the search process and improves the solution accuracy. Finally, the location update method of producers is improved, and the algorithm’s convergence speed and optimization performance are improved by balancing global search and local search. The simulation results show that the improved sparrow search algorithm effectively achieves the optimal node deployment and improves coverage rate and convergence speed.
{"title":"Application of improved sparrow search algorithm in WSN coverage optimization","authors":"Lin Lu, Xinxin Jiang","doi":"10.1117/12.2671500","DOIUrl":"https://doi.org/10.1117/12.2671500","url":null,"abstract":"A coverage optimization method based on an improved sparrow search algorithm (LSSA) is proposed for the coverage problem arising from the initialization of wireless sensor networks. Firstly, the good point set method is used for population initialization to make the sparrow individuals uniformly distributed, and the algorithm can effectively avoid falling into the local optimization. Secondly, a nonlinear convergence factor is proposed to constrain the proportion of producers and scroungers, which ensures the diversity of the population during the search process and improves the solution accuracy. Finally, the location update method of producers is improved, and the algorithm’s convergence speed and optimization performance are improved by balancing global search and local search. The simulation results show that the improved sparrow search algorithm effectively achieves the optimal node deployment and improves coverage rate and convergence speed.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"20 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121015475","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}
Support vector machine is widely used in various fields because of its excellent generalization performance. However, the selection of its parameters directly affects the accuracy of the final results. An improved sparrow search algorithm (ISSA) is proposed to optimize the parameters of support vector machines. The ISSA algorithm improves the original algorithm from three aspects: replacing random method with optimal point set initialization population, changing the explorer position update formula, and adopting adaptive mutation mechanism. The UCI standard data set was selected to compare the SVM optimized by ISSA algorithm with the original SVM, the SVM optimized by the genetic algorithm, the particle swarm optimization algorithm and the basic sparrow search algorithm, respectively. The experimental results show that the classification accuracy of the SVM optimized by ISSA algorithm is significantly improved, and the generalization performance is further improved.
{"title":"Parameter optimization of support vector machine based on improved sparrow search algorithm","authors":"Xiling Xue, Zhihong Sun","doi":"10.1117/12.2671587","DOIUrl":"https://doi.org/10.1117/12.2671587","url":null,"abstract":"Support vector machine is widely used in various fields because of its excellent generalization performance. However, the selection of its parameters directly affects the accuracy of the final results. An improved sparrow search algorithm (ISSA) is proposed to optimize the parameters of support vector machines. The ISSA algorithm improves the original algorithm from three aspects: replacing random method with optimal point set initialization population, changing the explorer position update formula, and adopting adaptive mutation mechanism. The UCI standard data set was selected to compare the SVM optimized by ISSA algorithm with the original SVM, the SVM optimized by the genetic algorithm, the particle swarm optimization algorithm and the basic sparrow search algorithm, respectively. The experimental results show that the classification accuracy of the SVM optimized by ISSA algorithm is significantly improved, and the generalization performance is further improved.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121900000","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}
With the rapid development of science, VR technology has become more mature and perfect, and has been widely used in various fields. Include human motion scanning, so as to improve the efficiency of human key point identification and interaction. Based on this, this paper designs an interactive and key point recognition scheme of human dynamic gestures by means of theoretical analysis and experimental analysis. Through experimental verification, it can be found that the gesture recognition rate of this scheme is high, with an average of 93.5% and high accuracy, and it can be popularized in practice.
{"title":"Research on key points recognition and interaction of 3D VR human body","authors":"Linghong Wu","doi":"10.1117/12.2671448","DOIUrl":"https://doi.org/10.1117/12.2671448","url":null,"abstract":"With the rapid development of science, VR technology has become more mature and perfect, and has been widely used in various fields. Include human motion scanning, so as to improve the efficiency of human key point identification and interaction. Based on this, this paper designs an interactive and key point recognition scheme of human dynamic gestures by means of theoretical analysis and experimental analysis. Through experimental verification, it can be found that the gesture recognition rate of this scheme is high, with an average of 93.5% and high accuracy, and it can be popularized in practice.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123237286","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}
This paper analyses application status and technology of C-V2X intelligent sweeper, and research the test and evaluation method of C-V2X intelligent sweeper. Then through the domestic driverless sweeper test verification the test results meet the requirements of the test standard. This paper improves the test and evaluation system of domestic unmanned sweeper and provides reference for the test of domestic unmanned sweeper.
{"title":"Research on current status and test method of C-V2X intelligent sweeper","authors":"Xiao-Bin Tian, Feiyan Wu, Guokai Jiang, Fujiangshan He, Jiaxu Feng","doi":"10.1117/12.2672756","DOIUrl":"https://doi.org/10.1117/12.2672756","url":null,"abstract":"This paper analyses application status and technology of C-V2X intelligent sweeper, and research the test and evaluation method of C-V2X intelligent sweeper. Then through the domestic driverless sweeper test verification the test results meet the requirements of the test standard. This paper improves the test and evaluation system of domestic unmanned sweeper and provides reference for the test of domestic unmanned sweeper.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134218098","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}
Shi Li, Lingling Han, Ke Huang, Fangzhen Ge, Lele Zhang
In order to draw and analyze the current status of the research on the application of artificial intelligence in the field of health in China and abroad, we explored the hotspots and frontiers of this research field and the evolution path from 2012 to 2022. This research uses 3743 articles included in the core database of Web of Science and 728 related research articles contained in CNKI as the basis for data analysis, and uses the advantages of bibliometrics visualization software of CiteSpace and VOSviewer to study institutions, countries, authors and literature keywords. In this research area, the research of medical artificial intelligence is growing day by day. By analyzing and sorting out the current research status, research hotspots and evolution path in this field of research, and trying to point out the deficiencies in the research in this field in China, the paper hopes to provide more references for researchers and practitioners of medical artificial intelligence related research.
为了总结和分析国内外人工智能在健康领域应用的研究现状，我们探索了2012年至2022年这一研究领域的热点和前沿以及演进路径。本研究以Web of Science核心数据库收录的3743篇论文和CNKI收录的728篇相关研究论文为数据分析基础，利用文献计量可视化软件CiteSpace和VOSviewer的优势，对机构、国家、作者和文献关键词进行研究。在这一研究领域，医疗人工智能的研究日益增多。通过对该研究领域的研究现状、研究热点和演进路径进行分析和梳理，并试图指出国内在该领域研究的不足，希望能为医学人工智能相关研究的研究者和实践者提供更多的参考。
{"title":"Knowledge atlas on the medical artificial intelligence research: a bibliometric analysis based on CiteSpace and VOSviewer","authors":"Shi Li, Lingling Han, Ke Huang, Fangzhen Ge, Lele Zhang","doi":"10.1117/12.2671844","DOIUrl":"https://doi.org/10.1117/12.2671844","url":null,"abstract":"In order to draw and analyze the current status of the research on the application of artificial intelligence in the field of health in China and abroad, we explored the hotspots and frontiers of this research field and the evolution path from 2012 to 2022. This research uses 3743 articles included in the core database of Web of Science and 728 related research articles contained in CNKI as the basis for data analysis, and uses the advantages of bibliometrics visualization software of CiteSpace and VOSviewer to study institutions, countries, authors and literature keywords. In this research area, the research of medical artificial intelligence is growing day by day. By analyzing and sorting out the current research status, research hotspots and evolution path in this field of research, and trying to point out the deficiencies in the research in this field in China, the paper hopes to provide more references for researchers and practitioners of medical artificial intelligence related research.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133738693","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}
Credit assessment models are an important basis for financial credit institutions to determine whether to lend or not, so an efficient and accurate credit assessment model is crucial for financial credit institutions. Traditional credit assessment algorithms do not take into account the noise problem caused by the massive amount of credit data, which greatly affects the time complexity and accuracy of credit assessment algorithms. In view of this, this paper proposes a credit assessment method based on information entropy and LSSVM. The method first uses information entropy to assign weights to feature attributes, then sets thresholds on them for feature extraction, and constructs an LSSVM model to evaluate credit data, so as to achieve accurate assessment of credit transaction risk. The experimental results show that the method can effectively reduce the time complexity of the algorithm and improve the accuracy of prediction
{"title":"Research on credit assessment model based on information entropy and LSSVM","authors":"Junhong Guo","doi":"10.1117/12.2671469","DOIUrl":"https://doi.org/10.1117/12.2671469","url":null,"abstract":"Credit assessment models are an important basis for financial credit institutions to determine whether to lend or not, so an efficient and accurate credit assessment model is crucial for financial credit institutions. Traditional credit assessment algorithms do not take into account the noise problem caused by the massive amount of credit data, which greatly affects the time complexity and accuracy of credit assessment algorithms. In view of this, this paper proposes a credit assessment method based on information entropy and LSSVM. The method first uses information entropy to assign weights to feature attributes, then sets thresholds on them for feature extraction, and constructs an LSSVM model to evaluate credit data, so as to achieve accurate assessment of credit transaction risk. The experimental results show that the method can effectively reduce the time complexity of the algorithm and improve the accuracy of prediction","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131786974","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}
To improve the efficiency and stability of power transaction management, a micro-grid power transaction management platform is studied. Block chain Internet technology is used to build the basic architecture of the electric energy transaction management platform. Based on the principle of low cost and high efficiency, the mathematical model of electric energy transaction is established. Combined with the distributed consensus mechanism of block chain technology, the intelligent contract of electric energy transaction is designed to realize the execution and management functions of electric energy block chain transaction. The test results show that the average time delay of the platform is about 0. 36 s for 10 groups of the random electricity trading instructions, which is real-time and efficient. For 5 random groups of users, the average electricity cost of the transaction results is 20. 42 yuan, which is feasible and economical, and lays a good foundation for the sustainable development of the micro-grid electricity trading management platform.
{"title":"Micro-grid power transaction management platform based on blockchain technology","authors":"Yeshen He, W. Tan, Tian Yang","doi":"10.1117/12.2671681","DOIUrl":"https://doi.org/10.1117/12.2671681","url":null,"abstract":"To improve the efficiency and stability of power transaction management, a micro-grid power transaction management platform is studied. Block chain Internet technology is used to build the basic architecture of the electric energy transaction management platform. Based on the principle of low cost and high efficiency, the mathematical model of electric energy transaction is established. Combined with the distributed consensus mechanism of block chain technology, the intelligent contract of electric energy transaction is designed to realize the execution and management functions of electric energy block chain transaction. The test results show that the average time delay of the platform is about 0. 36 s for 10 groups of the random electricity trading instructions, which is real-time and efficient. For 5 random groups of users, the average electricity cost of the transaction results is 20. 42 yuan, which is feasible and economical, and lays a good foundation for the sustainable development of the micro-grid electricity trading management platform.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125813480","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}
A predictive coding algorithm for image lossless compression is introduced. In the prediction stage, the algorithm uses the local change rate of the pixel value to adjust the prediction model adaptively, and in the coding stage, the error feedback technology is used to further reduce the information entropy of the error image. The simulation test results on standard images show that the performance of the algorithm is significantly better than the standard lossless compression algorithm. The compression algorithm we proposed uses the local change rate of the image in the decorrelation phase to improve the prediction accuracy, and in the coding phase, the algorithm uses error feedback technology to further reduce the error.
{"title":"Aapplication of image compression technology based on local change rate in image printing","authors":"Zhiyu Huang, Luyao Li, Likun Lu, Yeli Li, Qingtao Zeng, Weichun Yang","doi":"10.1117/12.2671487","DOIUrl":"https://doi.org/10.1117/12.2671487","url":null,"abstract":"A predictive coding algorithm for image lossless compression is introduced. In the prediction stage, the algorithm uses the local change rate of the pixel value to adjust the prediction model adaptively, and in the coding stage, the error feedback technology is used to further reduce the information entropy of the error image. The simulation test results on standard images show that the performance of the algorithm is significantly better than the standard lossless compression algorithm. The compression algorithm we proposed uses the local change rate of the image in the decorrelation phase to improve the prediction accuracy, and in the coding phase, the algorithm uses error feedback technology to further reduce the error.","PeriodicalId":120866,"journal":{"name":"Artificial Intelligence and Big Data Forum","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126313220","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：