Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

The main idea of this research is to consider fibrewise pairwise versions of the more important separation axioms of ordinary bitopology named fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise -Hausdorff spaces, fibrewise pairwise functionally -Hausdorff spaces, fibrewise pairwise -regular spaces, fibrewise pairwise completely -regular spaces, fibrewise pairwise -normal spaces and fibrewise pairwise functionally -normal spaces. In addition we offer some results concerning it.

Background: Prostatic adenocarcinoma is the most widely recognized malignancy in men and the second cause of cancer-related mortality encountered in male patients after lung cancer.

Aim of the study:  To assess the diagnostic value of diffusion weighted imaging (DWI) and its quantitative measurement, apparent diffusion coefficient (ADC), in the identification and localization of prostatic cancer compared with T2 weighted image sequence (T2WI).

Type of the study: a prospective analytic study

Patients and methods: forty-one male patients with suspected prostatic cancer were examined by pelvic MRI at the MRI department of the Oncology Teaching Hospital/Medical City in Baghdad

Survival analysis is widely applied in data describing for the life time of item until the occurrence of an event of interest such as death or another event of understudy . The purpose of this paper is to use the dynamic approach in the deep learning neural network method, where in this method a dynamic neural network that suits the nature of discrete survival data and time varying effect. This neural network is based on the Levenberg-Marquardt (L-M) algorithm in training, and the method is called Proposed Dynamic Artificial Neural Network (PDANN). Then a comparison was made with another method that depends entirely on the Bayes methodology is called Maximum A Posterior (MAP) method. This method was carried out using numerical algorithms re

<p>In this paper, we prove there exists a coupled fixed point for a set- valued contraction mapping defined on X× X , where X is incomplete ordered G-metric. Also, we prove the existence of a unique fixed point for single valued mapping with respect to implicit condition defined on a complete G- metric.</p>

Background: Conventional  MR imaging is essential for diagnosis and evaluation of the posterior fossa tumors  Objectives: To assess the value of diffusion weighted imaging and apparent diffusion coefficient in making distinction between different histological types of posterior fossa tumors.

Type of the study: Cross-sectional study.

Methods: Brain MRI and DWI assessed 19 patients (12 female and 7 male) with MRI diagnosis of posterior fossa tumors. absolute ADC values of contrast -enhancing solid tumor region and ADC ratio of solid tumor to ADC of normal -appearing deep White matter were compared with histological diagnosis postoperatively .The m

The primary objective of this paper is to present a new concept of fibrewise topological spaces over B is said to be fibrewise slightly topological spaces over B. Also, we introduce the concepts of fibrewise slightly perfect topological spaces, filter base, contact point, slightly convergent, slightly directed toward a set, slightly adherent point, slightly rigid, fibrewise slightly weakly closed, H.set, fibrewise almost slightly perfect, slightly∗ .continuous fibrewise slightly∗ topological spaces respectively, slightly Te, locally QHC, In addition, we state and prove several propositions related to these concepts.

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the