The precise classification of DNA sequences is pivotal in genomics, holding significant implications for personalized medicine. The stakes are particularly high when classifying key genetic markers such as BRAC, related to breast cancer susceptibility; BRAF, associated with various malignancies; and KRAS, a recognized oncogene. Conventional machine learning techniques often necessitate intricate feature engineering and may not capture the full spectrum of sequence dependencies. To ameliorate these limitations, this study employs an adapted UNet architecture, originally designed for biomedical image segmentation, to classify DNA sequences.The attention mechanism was also tested LONG WITH u-Net architecture to precisely classify DNA sequences into BRAC, BRAF, and KRAS categories. Our comprehensive methodology includes rigorous data preprocessing, model training, and a multi-faceted evaluation approach. The adapted U-Net model exhibited exceptional performance, achieving an overall accuracy of 0.96. The model also achieved high precision and recall rates across the classes, with precision ranging from 0.93 to 1.00 and recall between 0.95 and 0.97 for the key markers BRAC, BRAF, and KRAS. The F1-score for these critical markers ranged from 0.95 to 0.98. These empirical results substantiate the architecture’s capability to capture local and global features in DNA sequences, affirming its applicability for critical, sequence-based bioinformatics challenges
The research aims to: build and record a measure of cognitive participation among second-year female students at the College of Physical Education and Sports Sciences, University of Baghdad. The researchers used the descriptive approach in the survey style for the research sample. The sample was selected from female students and divided into: (10) female students for the survey sample, and (80) female students for the construction and codification sample. The data were statistically analyzed by the researchers using SPSS, the T-test for independent and correlated samples, Pearson's simple correlation coefficient, Cronbach's alpha, Chi-square, and Spearman-Brown. They were recruited for the samples. The study concluded that constr
... Show MorePattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o
... Show MoreIntrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system
... Show MoreThis paper demonstrates the design of an algorithm to represent the design stages of fixturing system that serve in increasing the flexibility and automation of fixturing system planning for uniform polyhedral part. This system requires building a manufacturing feature recognition algorithm to present or describe inputs such as (configuration of workpiece) and built database system to represents (production plan and fixturing system exiting) to this algorithm. Also knowledge – base system was building or developed to find the best fixturing analysis (workpiece setup, constraints of workpiece and arrangement the contact on this workpiece) to workpiece.
<p>Mobility management protocols are very essential in the new research area of Internet of Things (IoT) as the static attributes of nodes are no longer dominant in the current environment. Proxy MIPv6 (PMIPv6) protocol is a network-based mobility management protocol, where the mobility process is relied on the network entities, named, Mobile Access Gateways (MAGs) and Local Mobility Anchor (LMA). PMIPv6 is considered as the most suitable mobility protocol for WSN as it relieves the sensor nodes from participating in the mobility signaling. However, in PMIPv6, a separate signaling is required for each mobile node (MN) registration, which may increase the network signaling overhead and lead to increase the total handoff latency
... Show MoreThe substantial key to initiate an explicit statistical formula for a physically specified continua is to consider a derivative expression, in order to identify the definitive configuration of the continua itself. Moreover, this statistical formula is to reflect the whole distribution of the formula of which the considered continua is the most likely to be dependent. However, a somewhat mathematically and physically tedious path to arrive at the required statistical formula is needed. The procedure in the present research is to establish, modify, and implement an optimized amalgamation between Airy stress function for elastically-deformed media and the multi-canonical joint probability density functions for multivariate distribution complet
... Show MoreThis work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of
... Show More
XML is being incorporated into the foundation of E-business data applications. This paper addresses the problem of the freeform information that stored in any organization and how XML with using this new approach will make the operation of the search very efficient and time consuming. This paper introduces new solution and methodology that has been developed to capture and manage such unstructured freeform information (multi information) depending on the use of XML schema technologies, neural network idea and object oriented relational database, in order to provide a practical solution for efficiently management multi freeform information system.