Skin cancer is one of the most common types of cancer in the world, accounting for at least 40% of all cancers. Melanoma is considered as the 19th most commonly occurring cancer among the other cancers in the human society, such that about 300,000 new cases were found in 2018. While cancer diagnosis is based on interventional methods such as surgery, radiotherapy, and chemotherapy, studies show that the use of new computer technologies such as image processing mechanisms in processes related to early diagnosis of this cancer can help the physicians heal this cancer. This paper proposes an automatic method for diagnosis of skin cancer from dermoscopy images. The proposed model is based on an improved XceptionNet, which utilized swish activation function and depthwise separable convolutions. This system shows an improvement in the classification accuracy of the network compared to the original Xception and other dome architectures. Simulations of the proposed method are compared with some other related skin cancer diagnosis state-of-the-art solutions, and the results show that the suggested method achieves higher accuracy compared to the other comparative methods.
1 January 2021 in Computational Intelligence and Neuroscience
Lung cancer is the uncontrolled growth of cells in the lung that are made up of two spongy organs located in the chest. These cells may penetrate outside the lungs in a process called metastasis and spread to tissues and organs in the body. In this paper, using image processing, deep learning, and metaheuristic, an optimal methodology is proposed for early detection of this cancer. Here, we design a new convolutional neural network for this purpose. Marine predators algorithm is also used for optimal arrangement and better network accuracy. The method finally applied to RIDER dataset, and the results are compared with some pretrained deep networks, including CNN ResNet‐18, GoogLeNet, AlexNet, and VGG‐19. Final results showed higher results of the proposed method toward the compared techniques. The results showed that the proposed MPA‐based method with 93.4% accuracy, 98.4% sensitivity, and 97.1% specificity provides the highest efficiency with the least error (1.6) toward the other state of the art methods.
Our study focuses on the dynamic transient analysis of arched beam bridges over rivers, which face unique geohazards and challenges, including vibrations and dynamic loads that can affect structural integrity. The finite element software ANSYS v. 19.3 was employed to assess acceleration time histories at various bridge positions. Using MATLAB, we conducted wavelet packet decomposition to extract insights from the data, specifically isolating river-induced influences. In this article, the introduction of the wavelet packet rate index (WPERI) is presented as a novel metric for the detection of cracks in the curved bridge segments over rivers. The WPERI proves reliable in accounting for the river environment’s impact on structural integrity. Our findings highlight the sensitivity and precision of the WPERI in accurately detecting cracks and vulnerabilities in these riverine bridges. By combining WPT, finite element analysis, and signal decomposition, our research offers insights into tailored crack detection methods for riverine bridges. This study underscores the potential of WPT as a tool for identifying and characterizing cracks in curved bridge elements over rivers. The innovative WPERI provides a holistic approach to addressing structural issues, thus enhancing bridge durability amid changing environmental conditions. It contributes significantly to structural engineering and paves the way for the further exploration of river-specific crack detection techniques.
While the practical Byzantine fault tolerance (PBFT) consensus algorithm provides excellent theoretical fault tolerance, its performance in practical blockchain applications is often constrained by high communication overhead, especially in scenarios with limited node resources and high mobility, such as Vehicular Ad hoc Networks (VANETs). To address these blockchain-specific limitations without sacrificing the fundamental safety guarantees against arbitrary Byzantine failures, this paper proposes a novel PBFT-optimized consensus algorithm based on a dynamic reputation tree (DRT-PBFT). First, to address the issue of limited storage resources, we propose a block synchronization method based on differentiated storage of reputation values. The lower-reputation nodes retain only “micro-blocks” that contain essential information of the complete block, while the higher-reputation nodes store and synchronize complete blocks, significantly reducing the storage overhead. Second, on the basis of the reputation values, we construct a tree communication topology from the leaf node layer in a bottom-up manner. Messages are transmitted from multiple child nodes to their parent node, resolving the problem of a single message source in the tree structure. Additionally, we optimize the consensus process, reducing the number of mutual communications between nodes to a linear level. Finally, to address the problem of malicious nodes in the tree structure, we introduce a dynamic reconstruction mechanism for the reputation tree. When child node messages are inconsistent, the parent node splits the child nodes to mitigate the influence of malicious nodes, enhancing both the security and scalability of the consensus process. The experimental results show that, compared with typical improved PBFT algorithms, the proposed algorithm improves the average throughput by 34.1% and reduces the average latency by 27.4%. Moreover, compared with the full replication block synchronization method, the differentiated storage method reduces the storage overhead by 26.3%, making it potentially more suitable for large-scale VANET scenarios.