Cassava, a significant crop in Africa, Asia, and South America, is a staple food for millions. However, classifying cassava species using conventional color, texture, and shape features is inefficient, as cassava leaves exhibit similarities across different types, including toxic and non-toxic varieties. This research aims to overcome the limitations of traditional classification methods by employing deep learning techniques with pre-trained AlexNet as the feature extractor to accurately classify four types of cassava: Gajah, Manggu, Kapok, and Beracun. The dataset was collected from local farms in Lamongan Indonesia. To collect images with agricultural research experts, the dataset consists of 1,400 images, and each type of cassava has 350 images. Three fully connected (FC) layers were utilized for feature extraction, namely fc6, fc7, and fc8. The classifiers employed were support vector machine (SVM), k-nearest neighbors (KNN), and Naive Bayes. The study demonstrated that the most effective feature extraction layer was fc6, achieving an accuracy of 90.7% with SVM. SVM outperformed KNN and Naive Bayes, exhibiting an accuracy of 90.7%, sensitivity of 83.5%, specificity of 93.7%, and F1-score of 83.5%. This research successfully addressed the challenges in classifying cassava species by leveraging deep learning and machine learning methods, specifically with SVM and the fc6 layer of AlexNet. The proposed approach holds promise for enhancing plant classification techniques, benefiting researchers, farmers, and environmentalists in plant species identification, ecosystem monitoring, and agricultural management.
Imitation learning is an effective method for training an autonomous agent to accomplish a task by imitating expert behaviors in their demonstrations. However, traditional imitation learning methods require a large number of expert demonstrations in order to learn a complex behavior. Such a disadvantage has limited the potential of imitation learning in complex tasks where the expert demonstrations are not sufficient. In order to address the problem, we propose a Generative Adversarial Network-based model which is designed to learn optimal policies using only a single demonstration. The proposed model is evaluated on two simulated tasks in comparison with other methods. The results show that our proposed model is capable of completing co
... Show MoreThis study aimed at identifying the trend to applying the Joint Audit as an approach to improve the financial reports quality with all their characteristics (Relevance, Reliability, Comparability, Consistency), as well as enclose the difficulties that faced the auditors in the Gaza Strip in implementing the Joint Audit. In order to achieve the study aims, a measure was used to identify the trend to apply the Joint Audit and it was distributed to the study sample which is consisting of (119) individuals and retrieved thereof (99) valid for analysis, approximately (83.2%), (69) of them are Auditors, (30) financial managers and accountants. The researcher used the analytical descriptive method, and after analyzing the results, the s
... Show MoreThe Internet of Things (IoT) is an expanding domain that can revolutionize different industries. Nevertheless, security is among the multiple challenges that it encounters. A major threat in the IoT environment is spoofing attacks, a type of cyber threat in which malicious actors masquerade as legitimate entities. This research aims to develop an effective technique for detecting spoofing attacks for IoT security by utilizing feature-importance methods. The suggested methodology involves three stages: preprocessing, selection of important features, and classification. The feature importance determines the most significant characteristics that play a role in detecting spoofing attacks. This is achieved via two techniques: decision tr
... Show MoreBinary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin
... Show MoreLeap Motion Controller (LMC) is a gesture sensor consists of three infrared light emitters and two infrared stereo cameras as tracking sensors. LMC translates hand movements into graphical data that are used in a variety of applications such as virtual/augmented reality and object movements control. In this work, we intend to control the movements of a prosthetic hand via (LMC) in which fingers are flexed or extended in response to hand movements. This will be carried out by passing in the data from the Leap Motion to a processing unit that processes the raw data by an open-source package (Processing i3) in order to control five servo motors using a micro-controller board. In addition, haptic setup is proposed using force sensors (F
... Show MoreCancer is in general not a result of an abnormality of a single gene but a consequence of changes in many genes, it is therefore of great importance to understand the roles of different oncogenic and tumor suppressor pathways in tumorigenesis. In recent years, there have been many computational models developed to study the genetic alterations of different pathways in the evolutionary process of cancer. However, most of the methods are knowledge-based enrichment analyses and inflexible to analyze user-defined pathways or gene sets. In this paper, we develop a nonparametric and data-driven approach to testing for the dynamic changes of pathways over the cancer progression. Our method is based on an expansion and refinement of the pathway bei
... Show MoreIn general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot. Simulation results, whi
... Show MoreMost of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B
... Show MoreThe virtual decomposition control (VDC) is an efficient tool suitable to deal with the full-dynamics-based control problem of complex robots. However, the regressor-based adaptive control used by VDC to control every subsystem and to estimate the unknown parameters demands specific knowledge about the system physics. Therefore, in this paper, we focus on reorganizing the equation of the VDC for a serial chain manipulator using the adaptive function approximation technique (FAT) without needing specific system physics. The dynamic matrices of the dynamic equation of every subsystem (e.g. link and joint) are approximated by orthogonal functions due to the minimum approximation errors produced. The contr