Background: The microhardness of a composite resin is a vital parameter that is used to determine its clinical behavior. Measuring the microhardness of a composite resin has been used as an indirect method to assess its degree of conversion and extent of polymerization. The purpose of this in vitro study was to evaluate the effect of three curing distances (0, 2, and 4 mm) on the microhardness of the top and bottom surfaces of three types of flowable bulk-fill composite resins (smart dentin replacement, Opus bulk fill flow, and Tetric N). Material and method: Sixty-three specimens from the three types of composite resins (n=21) were fabricated using Teflon mold with a 4mm depth and a 5 mm internal diameter and cured for 20 seconds. For e

    This work aims to investigate the dependence of gravitational lensing properties on the lens redshift and source redshift.

The angular diameter distance hereafter referred to as ADD has been determined using two different numerical integral methods, Simpson's rule, and definite integral methods. Both of those two methods gave identical results. In addition, observational data of gravitational Lensing systems have been used to find the most probable value of lens redshift and source redshift. The result showed that the lens redshift and source redshift are more likely to occur in the ranges of z_L=0.2-0.6 and z_S=1-3, respectively.

Einstein radius and the critical surface mass density

     The growing relevance of printed and digitalized hand-written characters has necessitated the need for convalescent automatic recognition of characters in Optical Character Recognition (OCR). Among the handwritten characters, Arabic is one of those with special attention due to its distinctive nature, and the inherent challenges in its recognition systems. This distinctiveness of Arabic characters, with the difference in personal writing styles and proficiency, are complicating the effectiveness of its online handwritten recognition systems. This research, based on limitations and scope of previous related studies, studied the recognition of Arabic isolated characters through the identification o

In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.

This study deals with examining UCAS students’ attitudes in Gaza towards learning Arabic grammar online during the Corona pandemic. The researcher has adopted a descriptive approach and used a questionnaire as a tool for data collection. The results of the study have statistically shown significant differences at the level of "0.01" between the average scores of students in favor of the students of the humanities specializations. It has also been found that the students’ attitudes at the Department of Humanities and Media towards learning Arabic grammar online are positive. Additionally, the results revealed no statistical significant differences due to the variable of UCAS students’ scientific qualifications. The results stressed

Coronavirus disease (Covid-19) has threatened human life, so it has become necessary to study this disease from many aspects. This study aims to identify the nature of the effect of interdependence between these countries and the impact of each other on each other by designating these countries as heads for the proposed graph and measuring the distance between them using the ultrametric spanning tree. In this paper, a network of countries in the Middle East is described using the tools of graph theory.

         Language always conveys ideologies that represent an essential aspect of the world we live in. The beliefs and opinions of an individual or community can be organized, interacted with, and negotiated via the use of language. Recent researches have paid attention to bullying as a social issue. They have focused on the psychological aspect of bullying rather than the linguistic one. To bridge this gap, the current study is intended to investigate the ideology of bullying from a critical stylistic perspective. The researchers adopt Jeffries' (2010) critical stylistics model to analyze the data which is five extracts taken from Hunt’s Fish in a Tree (2015). The analysis demonstrates

Polyaromatic hydrocarbons (PAHs) are a group of aromatic compounds that contain at least two rings. These compounds are found naturally in petroleum products and are considered the most prevalent pollutants in the environment. The lack of microorganism capable of degrading some PAHs led to their accumulation in the environment which usually causes major health problems as many of these compounds are known carcinogens. Xanthene is one of the small PAHs which has three rings. Many xanthene derivatives are useful dyes that are used for dyeing wood and cosmetic articles. However, several studies have illustrated that these compounds have toxic and carcinogenic effects. The first step of the bacterial degradation of xanthene is conducted by d

     The present study investigates the implementation of machine learning models on crop data to predict crop yield in Rajasthan state, India. The key objective of the study is to identify which machine learning model performs are better to provide the most accurate predictions. For this purpose, two machine learning models (decision tree and random forest regression) were implemented, and gradient boosting regression was used as an optimization algorithm. The result clarifies that using gradient boosting regression can reduce the yield prediction mean square error to 6%. Additionally, for the present data set, random forest regression performed better than other models. We reported the machine learning model's performance using Mea

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th