This study aims to study argumentation in political debates by figuring out the logical fallacies employed in the debates of Clinton and Trump, the presidential nominees of the 2016 elections, and Biden and Trump, the leading contenders in the 2020 United States presidential election. The study attempts to answer the questions: (1) What relevance fallacies are adopted in the debate between Trump and Clinton? (2) What rhetorical devices are used to influence the audience and gain voters besides fallacies in the debates selected? The study analyses two texts from two arguments using Damer's (2009) taxonomy of relevance fallacy and rhetorical devices based on Perrine’s (1969) model of communication and interpersonal rhetoric to answe

This paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

This research describes a new model inspired by Mobilenetv2 that was trained on a very diverse dataset. The goal is to enable fire detection in open areas to replace physical sensor-based fire detectors and reduce false alarms of fires, to achieve the lowest losses in open areas via deep learning. A diverse fire dataset was created that combines images and videos from several sources. In addition, another self-made data set was taken from the farms of the holy shrine of Al-Hussainiya in the city of Karbala. After that, the model was trained with the collected dataset. The test accuracy of the fire dataset that was trained with the new model reached 98.87%.

Intrusion detection system is an imperative role in increasing security and decreasing the harm of the computer security system and information system when using of network. It observes different events in a network or system to decide occurring an intrusion or not and it is used to make strategic decision, security purposes and analyzing directions. This paper describes host based intrusion detection system architecture for DDoS attack, which intelligently detects the intrusion periodically and dynamically by evaluating the intruder group respective to the present node with its neighbors. We analyze a dependable dataset named CICIDS 2017 that contains benign and DDoS attack network flows, which meets certifiable criteria and is ope

Indexes of topological play a crucial role in mathematical chemistry and network theory, providing valuable insights into the structural properties of graphs. In this study, we investigate the Resize graph of G2(3), a significant algebraic structure arising from the exceptional Lie group (G2) over the finite field F3. We compute several well-known topological indices, including the Zagreb indices, Wiener index, and Randić index, to analyze the graph's connectivity and complexity. Our results reveal intricate relationships between the algebraic structure of G2(3) and its graphical properties, offering a deeper understanding of its combinatorial and spectral characteristics. These findings contribute to the broader study of algebraic graph t

Quantum key distribution (QKD) provides unconditional security in theory. However, practical QKD systems face challenges in maximizing the secure key rate and extending transmission distances. In this paper, we introduce a comparative study of the BB84 protocol using coincidence detection with two different quantum channels: a free space and underwater quantum channels. A simulated seawater was used as an example for underwater quantum channel. Different single photon detection modules were used on Bob’s side to capture the coincidence counts. Results showed that increasing the mean photon number generally leads to a higher rate of coincidence detection and therefore higher possibility of increasing the secure key rate. The secure key rat

Epithelial ovarian cancer is the leading cause of cancer deaths in women. To date, an effective screening tool for ovarian cancer has not been identified Several clinical and biological factors including serum cancer antigen 125 (CA- 125) have been assessed for prognostic and predictive relevance CA-125 is an epithelial marker derived from coelomic epithelium. It is elevated in 90% of advanced ovarian cancers and in 50% of early ovarian cancers while 20% of ovarian cancers have low or no expression of CA- 125 CA-125 concentrations were measured by Mini Vidas test (VIDAS CA125 II / BIOMERIEUX / France). The median CA-125 levels were significantly higher in the sera of ovarian cancer patients than in those with benign tumors an

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res