Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9096006
Fengshen Sun, Yizhuo Li, Yanan Huang
Due to the discontinuous structure of hatch cover and multiple loads, deck structural instability is prone to occur in hatch cover position. Taking the modification of hydraulic hatch cover of a buoy tender as an example, this paper focuses on several key technologies involved in the modification of hatch cover, including the adjustment of weight and gravity center of ship in ballast after modification, structure design and strength check of hatch cover. The stress, deformation and buckling strength of hatch cover structure under corresponding load conditions are analyzed by finite element method.
{"title":"Study on Refitting of Hydraulic Hatch Cover","authors":"Fengshen Sun, Yizhuo Li, Yanan Huang","doi":"10.1109/IICSPI48186.2019.9096006","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9096006","url":null,"abstract":"Due to the discontinuous structure of hatch cover and multiple loads, deck structural instability is prone to occur in hatch cover position. Taking the modification of hydraulic hatch cover of a buoy tender as an example, this paper focuses on several key technologies involved in the modification of hatch cover, including the adjustment of weight and gravity center of ship in ballast after modification, structure design and strength check of hatch cover. The stress, deformation and buckling strength of hatch cover structure under corresponding load conditions are analyzed by finite element method.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131613814","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9096009
Huida Zheng, Xusheng Gan, Shiyao Ren
To realize the scientific management of equipment development, a new method based on Least Square Support Vector Machine (LS-SVM) is proposed for equipment development risk assessment. On the basis of built index system of equipment development risk assessment, LS-SVM is used to establish the risk assessment model for equipment development. The simulation indicates that the method can carry out equipment development risk assessment correctly and effectively.
{"title":"Equipment Development Risk Assessment Based on Least Square Support Vector Machine","authors":"Huida Zheng, Xusheng Gan, Shiyao Ren","doi":"10.1109/IICSPI48186.2019.9096009","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9096009","url":null,"abstract":"To realize the scientific management of equipment development, a new method based on Least Square Support Vector Machine (LS-SVM) is proposed for equipment development risk assessment. On the basis of built index system of equipment development risk assessment, LS-SVM is used to establish the risk assessment model for equipment development. The simulation indicates that the method can carry out equipment development risk assessment correctly and effectively.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129570490","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9095974
Liu Weihao, Chen Jiamin, Wang Ning, Shen Jun, Li Weijiao, Ji Linhua, Chen Xiaodong
With the rapid development of the domestic logistics industry, the demand for quick inquiry of express parcel delivery information is becoming more and more urgent. The automatic acquisition of express delivery number is expected to solve this problem. This paper proposes a barcode localization segmentation recognition algorithm for bar code/QR code location segmentation recognition in a single scan image of a parcel in a complex environment. The whole algorithm is fully tested in the actual express single scan image. The results show that the algorithm is fast, accurate and has low bit error rate, and has strong practical value.
{"title":"Fast segmentation identification of express parcel barcode based on MSRCR enhanced high noise environment","authors":"Liu Weihao, Chen Jiamin, Wang Ning, Shen Jun, Li Weijiao, Ji Linhua, Chen Xiaodong","doi":"10.1109/IICSPI48186.2019.9095974","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9095974","url":null,"abstract":"With the rapid development of the domestic logistics industry, the demand for quick inquiry of express parcel delivery information is becoming more and more urgent. The automatic acquisition of express delivery number is expected to solve this problem. This paper proposes a barcode localization segmentation recognition algorithm for bar code/QR code location segmentation recognition in a single scan image of a parcel in a complex environment. The whole algorithm is fully tested in the actual express single scan image. The results show that the algorithm is fast, accurate and has low bit error rate, and has strong practical value.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126195406","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9095932
Q. Zeng, Lisha Wang, Tianyi Zhang, Ge Song, H. Duan, Geng Chen
With the development of mobile terminal technology, how to reduce the network energy consumption in mobile environment has become a research hotspot in mobile wireless sensor network (MWSNs). In this paper, an energy-saving clustering algorithm is presented based on improved K-medoids and affinity propagation (AP) in MWSNs. Firstly, the AP algorithm is used to find the number and location of the initial cluster heads. After that, a new weight function is established by considering the communication distance, residual energy and moving speed of the nodes. Next, improved K-medoids method is used to find the optimized cluster heads and form the network topology based on the new weight function. Finally, the network enters the communication stage using greedy algorithm to transmit data. The simulation results display that the presented algorithm can reduce the energy consumption of the entire network and prolong the network lifetime. Compared with LEACH, LEACH-M and APSA, the network lifetime of the presented APEEA algorithm is extended by 719 rounds, 684 rounds and 90 rounds, respectively. Meanwhile, the performance improvement of the energy consumption can achieve 16.553 J (66.2%), 13.973 J (55.9%) and 3.544 J (14.2%), respectively.
{"title":"An Energy-efficient Clustering Algorithm Based on Affinity Propagation and Improved K-medoids for Mobile Wireless Sensor Networks","authors":"Q. Zeng, Lisha Wang, Tianyi Zhang, Ge Song, H. Duan, Geng Chen","doi":"10.1109/IICSPI48186.2019.9095932","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9095932","url":null,"abstract":"With the development of mobile terminal technology, how to reduce the network energy consumption in mobile environment has become a research hotspot in mobile wireless sensor network (MWSNs). In this paper, an energy-saving clustering algorithm is presented based on improved K-medoids and affinity propagation (AP) in MWSNs. Firstly, the AP algorithm is used to find the number and location of the initial cluster heads. After that, a new weight function is established by considering the communication distance, residual energy and moving speed of the nodes. Next, improved K-medoids method is used to find the optimized cluster heads and form the network topology based on the new weight function. Finally, the network enters the communication stage using greedy algorithm to transmit data. The simulation results display that the presented algorithm can reduce the energy consumption of the entire network and prolong the network lifetime. Compared with LEACH, LEACH-M and APSA, the network lifetime of the presented APEEA algorithm is extended by 719 rounds, 684 rounds and 90 rounds, respectively. Meanwhile, the performance improvement of the energy consumption can achieve 16.553 J (66.2%), 13.973 J (55.9%) and 3.544 J (14.2%), respectively.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122955592","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9096014
Jie Zhang, Yongna Liu, Haihua Xing
The tapping panel dryness (TPD) in Hevea brasiliensis is a complex physiological syndrome and seriously affects the yield of the natural latex from rubber tree. Using image segmentation technology, the proportion of cut and latex area in rubber tree image are calculated to determine grade of TPD. According to the principle of two-dimensional maximum entropy, the global search of genetic algorithm and simulated annealing local hill climbing performance are synthetically selected to determine the optimal segmentation threshold. 276 images selected from the experimental base were tested. The experimental results showed that the method quickly and efficiently realized the extraction of the rubber tree cutting marks and the separation of rubber latex. The accuracy rate of TPD grade was as high as 92.4%, which could effectively prevent the further spread of TPD, and had certain experimental value.
{"title":"Application of Improved 2-D Entropy Algorithm in Rubber Tree Image Segmentation","authors":"Jie Zhang, Yongna Liu, Haihua Xing","doi":"10.1109/IICSPI48186.2019.9096014","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9096014","url":null,"abstract":"The tapping panel dryness (TPD) in Hevea brasiliensis is a complex physiological syndrome and seriously affects the yield of the natural latex from rubber tree. Using image segmentation technology, the proportion of cut and latex area in rubber tree image are calculated to determine grade of TPD. According to the principle of two-dimensional maximum entropy, the global search of genetic algorithm and simulated annealing local hill climbing performance are synthetically selected to determine the optimal segmentation threshold. 276 images selected from the experimental base were tested. The experimental results showed that the method quickly and efficiently realized the extraction of the rubber tree cutting marks and the separation of rubber latex. The accuracy rate of TPD grade was as high as 92.4%, which could effectively prevent the further spread of TPD, and had certain experimental value.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123165167","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9095953
L. Ye, X. Xia, Z. Chang
Hierarchical maximum entropy Bayesian method is proposed to establish the reliability evaluation model for data sample with unknown priori information. The probability density functions are calculated for different time series using the maximum entropy principles and the Bayesian method is utilized to obtain the posterior sample information for different time intervals. The values of performance continuity relative reliability for time series data sample can be calculated during the corresponding time intervals and the failure degree maintaining optimum performance status in the future can be predicted.
{"title":"Reliability Evaluating Theory for Data Sample with Unknown Priori Information","authors":"L. Ye, X. Xia, Z. Chang","doi":"10.1109/IICSPI48186.2019.9095953","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9095953","url":null,"abstract":"Hierarchical maximum entropy Bayesian method is proposed to establish the reliability evaluation model for data sample with unknown priori information. The probability density functions are calculated for different time series using the maximum entropy principles and the Bayesian method is utilized to obtain the posterior sample information for different time intervals. The values of performance continuity relative reliability for time series data sample can be calculated during the corresponding time intervals and the failure degree maintaining optimum performance status in the future can be predicted.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116538758","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9095884
Qi Han, Yang Xie, Hui Wang, Guorong Chen
In this works, the economic dispatch problem for smart grids is simplified by the $varepsilon$–exact penalty functions. A novel and systematic distributed optimization algorithm is introduced based on the multi-agent system via the algebraic graph theory. In order to minimize the operation cost in the entire grid, cooperative control of the power outputs of all power generators in the smart grid will be presented by using of the novel optimization algorithm. Furthermore, through the iteration of the penalty parameters and smooth parameters, the convergence of the algorithm is proved. The solution of the penalty optimization problem coincides with the optimal solution of the economic dispatch problem. A numerical example testifies the good performance of the new algorithm.
{"title":"Distributed Optimal Economic Dispatch for Smart Grids Based on Multi-Agent System","authors":"Qi Han, Yang Xie, Hui Wang, Guorong Chen","doi":"10.1109/IICSPI48186.2019.9095884","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9095884","url":null,"abstract":"In this works, the economic dispatch problem for smart grids is simplified by the $varepsilon$–exact penalty functions. A novel and systematic distributed optimization algorithm is introduced based on the multi-agent system via the algebraic graph theory. In order to minimize the operation cost in the entire grid, cooperative control of the power outputs of all power generators in the smart grid will be presented by using of the novel optimization algorithm. Furthermore, through the iteration of the penalty parameters and smooth parameters, the convergence of the algorithm is proved. The solution of the penalty optimization problem coincides with the optimal solution of the economic dispatch problem. A numerical example testifies the good performance of the new algorithm.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122165731","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9095905
Guojun Sheng, Yimin Zhang, Yanling Li
Aimed at optimizing the efficiency of resource scheduling problem in cloud environment, an improved scheduling algorithm is proposed for instance-intensive cloud workflow. It used the direct acyclic graph to model the workflow process, and then the clustering method is employed to classify the cloud service resources, and optimize the resource strategy to match the execution time and cost of the entire workflow instance. The experimental results show that the algorithm can effectively improve the efficiency and reduce the cost of using cloud resources for scheduling the instance-intensive cloud workflows.
{"title":"Improved Scheduling Algorithm for Instance-Intensive Cloud Workflow","authors":"Guojun Sheng, Yimin Zhang, Yanling Li","doi":"10.1109/IICSPI48186.2019.9095905","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9095905","url":null,"abstract":"Aimed at optimizing the efficiency of resource scheduling problem in cloud environment, an improved scheduling algorithm is proposed for instance-intensive cloud workflow. It used the direct acyclic graph to model the workflow process, and then the clustering method is employed to classify the cloud service resources, and optimize the resource strategy to match the execution time and cost of the entire workflow instance. The experimental results show that the algorithm can effectively improve the efficiency and reduce the cost of using cloud resources for scheduling the instance-intensive cloud workflows.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122301964","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9096058
Han Yaochang, Wang Jie
Aiming at the problem of remote sensing image classification, this paper designs an improved convolutional neural network structure. Combined with the transfer learning method, the classification experiments of different remote sensing image datasets are compared, and the effectiveness and versatility of the proposed method are verified.
{"title":"Application of Convolutional Neural Networks in Remote Sensing Image Classification","authors":"Han Yaochang, Wang Jie","doi":"10.1109/IICSPI48186.2019.9096058","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9096058","url":null,"abstract":"Aiming at the problem of remote sensing image classification, this paper designs an improved convolutional neural network structure. Combined with the transfer learning method, the classification experiments of different remote sensing image datasets are compared, and the effectiveness and versatility of the proposed method are verified.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127081266","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}
Pub Date : 2019-11-01DOI: 10.1109/IICSPI48186.2019.9096012
Huixi He, K. Nawata
Peer-to-peer (P2P) lending is a new trend in the individual credit business. However, compared with stock market data or other famous marketing data, the lake of P2P data accumulation causes difficulty when building analyzing models. Furthermore, the market inspection and management or relevant law can hardly catch up with the pace of the developing progress of P2P lending market, which brings high risks and uncertainties in this domain. In this work, we proposed a visualization algorithm-based anomaly detection method for analyzing customers who have failed lending records in an online P2P lending platform. Our anomaly detection method is benefited from the visualization map, which can bring an extremely intuitive sense of normal data and outliers. Our approach made it possible for us to show a reasonable assumption for detecting the occasion of such outliers.
{"title":"Anomaly Detection in Peer-to-Peer Lending Transaction Records by Visualizing High Dimensional Heterogeneous Data","authors":"Huixi He, K. Nawata","doi":"10.1109/IICSPI48186.2019.9096012","DOIUrl":"https://doi.org/10.1109/IICSPI48186.2019.9096012","url":null,"abstract":"Peer-to-peer (P2P) lending is a new trend in the individual credit business. However, compared with stock market data or other famous marketing data, the lake of P2P data accumulation causes difficulty when building analyzing models. Furthermore, the market inspection and management or relevant law can hardly catch up with the pace of the developing progress of P2P lending market, which brings high risks and uncertainties in this domain. In this work, we proposed a visualization algorithm-based anomaly detection method for analyzing customers who have failed lending records in an online P2P lending platform. Our anomaly detection method is benefited from the visualization map, which can bring an extremely intuitive sense of normal data and outliers. Our approach made it possible for us to show a reasonable assumption for detecting the occasion of such outliers.","PeriodicalId":318693,"journal":{"name":"2019 2nd International Conference on Safety Produce Informatization (IICSPI)","volume":"14 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132360895","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
扫码关注我们
求助内容：
应助结果提醒方式：