{"title":"Fractional Complex-order Hopfield Neural Networks to Analyze the Effect of Drug-resistance in the HIV Infection","authors":"C. Fernández","doi":"10.1109/ICACI49185.2020.9177513","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177513","url":null,"abstract":"The present paper uses a complex and fractional-order model for Hopfield neural networks to set a nonlinear model that represents the quantity of infected/uninfected CD4+T cells into the HIV dynamic when an antiviral therapy based on protease inhibitors is applied. By using a mathematical model of the environment associated with CD4+T cells that are progressively infected, it is proposed a closed-loop scheme associated with the HIV dynamic and its antiviral therapy, both acting in the same environment. To this end, the work reported here will use Caputo-type derivatives in order to represent such closed-loop dynamic by assuming that there is a nonlinear model based on Hopfield neural networks (HNN). In this way, the mutual interference between the additive activation dynamics of HNN and the complex-valued fractional-order analysis will be used to study the local and global asymptotic stability of HIV. The effect of drug-resistance will be the main starting point to understand how the resistant CD4+T cells can be reduced. The equilibrium point of HNN model will be studied by using quadratic-type Lyapunov functions and compared with a model based on Grunwald-Letnikov formulation in order to validate the approach proposed. The results show that HNN-based model converges toward a small neighborhood of the origin with better performance than Grunwald-Letnikov model.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117248659","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}
Wenqiang Liu, Dan Wang, Yuyang Li, Cheng Yang, Hui Wang, Zhigang Liu
{"title":"An Automatic Fracture Defect Detection Approach for Current-carrying Rings of Catenary Droppers Using A Multi-task Neural Network","authors":"Wenqiang Liu, Dan Wang, Yuyang Li, Cheng Yang, Hui Wang, Zhigang Liu","doi":"10.1109/ICACI49185.2020.9177502","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177502","url":null,"abstract":"Catenary droppers play an essential role in the catenary system. They both connect messenger wires and contact wires to stabilize contact wires and transmit the working current and short-circuit current. And the current carrying rings of catenary droppers can avoid the direct connect of droppers and dropper clips and reduce electrical faults and arcs when the locomotive draws current through the pantograph. At present, researchers mainly focus on the loosen defect of droppers, but still do not pay attention to the fracture defect of the current-carrying ring of droppers. Therefore, this paper proposes an automatic fracture defect detection approach for the current-carrying ring of droppers using a multi-task neural network. Compared to traditional solutions based on the connected domains, the method based on neural networks is more automated and robust. First, this network consisted of three function head networks of a classification head network, a regression head network, and a mask head network is performed to get a classification score and a segmentation score, respectively. And then, by counting the scores of normal and faulty components, a fault criterion for evaluating the current-carrying ring is proposed. Experiment results show that the proposed method is highly accurate and automatic for the state detection of catenary droppers.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125484345","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 torque compensation control strategy for four-wheel drive hybrid system in rapid acceleration","authors":"Cui Liu, Wei Zhang, Jianhua Guo, Zuofei Liu","doi":"10.1109/ICACI.2018.8377584","DOIUrl":"https://doi.org/10.1109/ICACI.2018.8377584","url":null,"abstract":"This paper is based on the ground coupled four-wheel drive hybrid system with “BSG system of front axle and motor drive of rear axle”, the torque compensation control strategy under the condition of rapid acceleration is researched. The strategy determines the driver's intention according to the acceleration pedal opening and change rate, then calculate the compensation torque with consideration of the limitation of jerk on the compensation torque by fuzzy control. Based on the maximum utilization of ground adhesion, the compensation torque is allocated. The simulation model is built under the Matlab/Simulink environment. The simulation results show that this strategy can effectively recognize the drivers' demand for rapid acceleration, improve the dynamic performance of the whole vehicle under the premise of satisfying the ride comfort and handling stability of the vehicle.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126057611","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":"Multiple route planning algorithm based on improved K-means clustering and particle swarm optimization","authors":"Hai-yan Yang, Shuai-wen Zhang, Cheng Han","doi":"10.1109/ICACI.2018.8377617","DOIUrl":"https://doi.org/10.1109/ICACI.2018.8377617","url":null,"abstract":"To improve the survival rate of aerial vehicle in battlefield, a method that provides multiple alternative routes for it to choose and replace is proposed. For this problem, threat models of aerial vehicles are built to generate the basic cost functions of route planning. Then, a new strategy named exclusion mechanism is introduced to improve K-means clustering, which improves the variety of solutions and contributes to high routes' spatial dispersion. Thanks to the improved K-means clustering, the routes can be classified owing to their distribution in space. Finally, to enhance the efficiency of solving, particle swarm optimization(PSO) is chosen to make the algorithm adaptable. The simulation compares the proposed algorithm with a related one, which proves that, unaffected by subjectivity of artificial planning, the improved algorithm can finish multiple route planning quickly and meet the demand of pre-route-planning in actual combat.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125662118","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":"Recognition of virtual maze scene under simulated prosthetic vision","authors":"Ying Zhao, Xiulin Geng, Qi Li, Guangqi Jiang","doi":"10.1109/ICACI.2018.8377543","DOIUrl":"https://doi.org/10.1109/ICACI.2018.8377543","url":null,"abstract":"To help blind people obtain the optimal vision in low resolution effectively, real-time maze pathfinding experiment under simulated prosthetic vision was carried out to find the optimal real-time scene processing strategy using the limited number of electrodes. Simple (5×5), medium (8×8) and complex (11×11) maze scenes were built by Unity. Then, binarization, color inversion and matching to 32×32 resolution phosphene template were performed as image processing strategy to get useful scene information from the camera and realize real-time pixelization. In the experiment, subjects were asked to complete 45 and 60 degrees viewpoint of the maze pathfinding task at 32×32 resolution. The time of finding entrance, maze pathfinding and the accuracy rate of completing maze from different view angles under the same resolution were recorded and analyzed to determine the optimal viewing angle. As the results, Subjects were able to accomplish the most complicated maze routing task at 32×32 resolution, the time of finding entrance under 45 degrees viewpoint and 60 degrees viewpoint were 14.38 seconds and 19.30 seconds, the time of 45 degrees viewpoint was significantly less than that of 60 degrees. The time of the maze pathfinding under two view angles were 125.39 seconds and 170.14 seconds, and the time of 45 degrees viewpoint was less than that of 60 degrees. Therefore, the 45 degrees viewpoint was significantly better than the 60 degrees visual angle and provided the best viewpoint for visual prosthesis to complete maze wayfinding tasks.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124136946","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":"Image Block Compression Based on Dual-Learning Dictionaries","authors":"Wen-ling Pan, Bo Li, Yanwen Chong","doi":"10.1109/ICACI49185.2020.9177627","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177627","url":null,"abstract":"To improve the nonlinear reconstruction performance of sparse representation in image compression and reconstruction process, a new image compression algorithm based on dual synthesis and analysis dictionaries is proposed. Firstly, the dual synthesis and analysis dictionaries learning algorithm is analyzed, including penalty function analysis and the algorithm of dictionary learning with gradient decent. Then, the compression model based on synthesis and analysis dictionaries is introduced and the properties of the model is also analyzed. Experimental results demonstrate that the proposed method outperforms many other algorithms in image compression.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116429528","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":"Max-margin generative adversarial networks","authors":"Wanshun Gao, Zhonghao Wang","doi":"10.1109/ICACI.2018.8377529","DOIUrl":"https://doi.org/10.1109/ICACI.2018.8377529","url":null,"abstract":"Generative Adversarial Networks (GANs) have recently received a lot attention due to the promising performance in image generation, inpainting and style transfer. However, GANs and their variants still face several challenges, including vanishing gradients, mode collapse and unbalanced training between generator and discriminator, which limits further improvement and application of GANs. In this paper, we propose the Max-Margin Generative Adversarial Networks (MMGANs) to approach these challenges by substituting the sigmoid cross-entropy loss of GANs with a max-margin loss. We present the theoretical guarantee regarding merits of max-margin loss to solve the above problems in GANs. Experiments on MNIST and CelebA have shown that MMGANs have three main advantages compared with regular GANs. Firstly, MMGANs is robust to vanishing gradients and mode collapse. Secondly, MMGANs have good stability and strong balance ability during the training process. Thirdly, MMGANs can be easily expanded to multi-class classification tasks.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126998832","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":"BOF Endpoint Carbon Content Prediction based on Association Rule Case Base Maintenance Strategy","authors":"Yuan Cheng, Z. Cheng, Xinzhe Wang","doi":"10.1109/ICACI49185.2020.9177854","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177854","url":null,"abstract":"Traditional basic oxygen furnace (BOF) prediction based on Case-based reasoning (CBR) is usually dependent on experts and experiences which will result in deviation. Aiming at attributes selection in BOF steelmaking and case base maintenance, this paper proposes using Ridge regression and Association rules to improve CBR and predicting the endpoint carbon content of BOF steelmaking. In CBR, case representation is the basic, the selected attributes in case representation play an important role but dependent on expert experiences so that this paper uses lasso regression algorithm to get the attributes. Through the simulation experiment, the results show that the improved CBR can obviously improve the accuracy of endpoint carbon content prediction.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116591658","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}
Yang Wang, Ye Tian, Tiefeng Li, Dongcheng Peng, Yihua Zhou
{"title":"Visualization analysis of shipping recruitment information based on R","authors":"Yang Wang, Ye Tian, Tiefeng Li, Dongcheng Peng, Yihua Zhou","doi":"10.1109/ICACI.2018.8377582","DOIUrl":"https://doi.org/10.1109/ICACI.2018.8377582","url":null,"abstract":"With the combination of big data and shipping industry, data visualization plays a more and more important role in the shipping industry, which makes the boring industry data vivid and intuitive and help users understand and grasp the data easily. However, the traditional data visualization has a series of deficiencies, for instance, the display structure is too single and too simple, the unit information is insufficient, the visualization function for the multi-factor data set is limited, which has become increasingly unable to meet people's requirements for visualization. In this paper, we apply Python web crawler for crawling the shipping recruitment information firstly. Then, do some necessary data preprocessing through the R language based on reshape software package, next we use one of the ggplot2 software package to do a variety of visualization of shipping recruitment information. Finally, some necessary analysis and assessment have been made according to the visualization results and some relevant professional knowledge. The experimental results show that the ggplot2 drawing system can deal with the multi-factor shipping recruitment information dataset and can design the graph with high recognition and large information. In addition, according to the visualization results, this paper can easily find out the significant level of each factor and the trend of each level, which to be expected to provide a reference and basis for the determination of the overall situation of China's seafarer market.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114876787","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":"Availability analysis of electronic flight instrument system based on dynamic fault tree","authors":"Haiyong Dong, Guoqing Wang, Zhengjun Zhai, Yanhong Lu, Qingfan Gu","doi":"10.1109/ICACI.2018.8377503","DOIUrl":"https://doi.org/10.1109/ICACI.2018.8377503","url":null,"abstract":"As a high availability product, Electronic Flight Instrument System (EFIS) has very complicated redundancy structures to fulfill high safety integrity requirement. This paper presents a comprehensive study on the availability analysis for EFIS by using Dynamic Fault Tree (DFT) approach based on Markov chain with modularization method. The static fault sub-tree is solved by Binary Decision Diagram (BDD) and the dynamic fault sub-tree is solved by Markov chain. A novel Markov chain expression is utilized to avoid state explosion of dynamic fault sub-tree. Besides, Minimal Cut Sequence Set (MCSS) are generated. At last, Monte Carlo simulation is carried out to verify the theoretical results.","PeriodicalId":346930,"journal":{"name":"International Conference on Advanced Computational Intelligence","volume":"9 6-7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120917306","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}