Search

Leptospirosis is a global disease that impacts people worldwide, particularly in humid and tropical regions, and is associated with significant socio-economic deficiencies. Its symptoms are often confused with other syndromes, which can compromise clinical diagnosis and the failure to carry out specific laboratory tests. In this respect, this paper presents a study of three algorithms (Decision Tree, Random Forest and Adaboost) for predicting the outcome (cure or death) of individuals with leptospirosis. Using the records contained in the government National System of Aggressions and Notification (SINAN, in portuguese) from 2007 to 2017, for the state of Pará, Brazil, where the temporal attributes of health care, symptoms (headache, vomiting, jaundice, calf pain) and clinical evolution (renal failure and respiratory changes) were used. In the performance evaluation of the selected models, it was observed that the Random Forest exhibited an accuracy of 90.81% for the training dataset, considering the attributes of experiment 8, and the Decision Tree presented an accuracy of 74.29 for the validation database. So, this result considers the best attributes pointed out by experiment 10: time first symptoms medical attention, time first symptoms ELISA sample collection, medical attention hospital admission time, headache, calf pain, vomiting, jaundice, renal insufficiency, and respiratory alterations. The contribution of this article is the confirmation that artificial intelligence, using the Decision Tree model algorithm, depicting the best choice as the final model to be used in future data for the prediction of human leptospirosis cases, helping in the diagnosis and course of the disease, aiming to avoid the evolution to death. [ABSTRACT FROM AUTHOR]

Recently, ConvNeXt and blueprint separable convolution (BSConv) constructed from standard ConvNet modules have demonstrated competitive performance in advanced computer vision tasks. This paper proposes an efficient model (BCRN) based on BSConv and the ConvNeXt residual structure for single image super-resolution, which achieves superior performance with very low parametric numbers. Specifically, the residual block (BCB) of the BCRN utilizes the ConvNeXt residual structure and BSConv to significantly reduce the number of parameters. Within the residual block, enhanced spatial attention and contrast-aware channel attention modules are simultaneously introduced to prioritize valuable features within the network. Multiple residual blocks are then stacked to form the backbone network, with Dense connections utilized between them to enhance feature utilization. Our model boasts extremely low parameters compared to other state-of-the-art lightweight models, while experimental results on benchmark datasets demonstrate its excellent performance. The code will be available at https://github.com/kptx666/BCRN. [ABSTRACT FROM AUTHOR]

The advent of Industry 4.0 has significantly promoted the field of intelligent manufacturing, which is facilitated by the development of new technologies are emerging. Robot technology and robot intelligence methods have rapidly developed and been widely applied. Manipulators are widely used in industry, and their control is a crucial research topic. The inverse kinematics solution of manipulators is an important part of manipulator control, which calculates the joint angles required for the end effector to reach a desired position and posture. Traditional inverse kinematics solution algorithms often face the problem of insufficient generalization, and iterative methods have challenges such as large computation and long solution time. This paper proposes a reinforcement learning-based inverse kinematics solution algorithm, called the MAPPO-IK algorithm. The algorithm trains the manipulator agent using the MAPPO algorithm and calculates the difference between the end effector state of the manipulator and the target posture in real-time by designing a reward mechanism, while considering Gaussian distance and cosine distance. Through experimental comparative analysis, the feasibility, computational efficiency, and superiority of this reinforcement learning algorithm are verified. Compared with traditional inverse kinematics solution algorithms, this method has good generalization and supports real-time computation, and the obtained result is a unique solution. Reinforcement learning algorithms have better adaptability to complex environments and can handle different sudden situations in different environments. This algorithm also has the advantages of path planning, intelligent obstacle avoidance, and other advantages in dynamically processing complex environmental scenes. [ABSTRACT FROM AUTHOR]