Radiotherapy is the branch of clinical medicine concerned with the application of ionizing radiation in the treatment of disease. And it is used to killing of cancer cells in a tissue using ionizing radiation while keeping the sparing of healthy cells at acceptable level. X-ray beams are used to deposit absorbed dose at depth within a patient at the site of the tumor. The aim of this work is studying the relationship between the depth dose and the field size in water phantom and homogenous actual planning. In our work, the dose distribution at different depths (zero-18 cm) deep at1cm interval treated with field size (10×10 and 20×20) cm2 were studied. Results show that high similarity between water phantom and actual planning for

Since the introduction of the HTTP/3, research has focused on evaluating its influences on the existing adaptive streaming over HTTP (HAS). Among these research, due to irrelevant transport protocols, the cross-protocol unfairness between the HAS over HTTP/3 (HAS/3) and HAS over HTTP/2 (HAS/2) has caught considerable attention. It has been found that the HAS/3 clients tend to request higher bitrates than the HAS/2 clients because the transport QUIC obtains higher bandwidth for its HAS/3 clients than the TCP for its HAS/2 clients. As the problem originates from the transport layer, it is likely that the server-based unfairness solutions can help the clients overcome such a problem. Therefore, in this paper, an experimental study of the se

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

Aerial Robot Arms (ARAs) enable aerial drones to interact and influence objects in various environments. Traditional ARA controllers need the availability of a high-precision model to avoid high control chattering. Furthermore, in practical applications of aerial object manipulation, the payloads that ARAs can handle vary, depending on the nature of the task. The high uncertainties due to modeling errors and an unknown payload are inversely proportional to the stability of ARAs. To address the issue of stability, a new adaptive robust controller, based on the Radial Basis Function (RBF) neural network, is proposed. A three-tier approach is also followed. Firstly, a detailed new model for the ARA is derived using the Lagrange–d’A

The arts global digital marketing activity is one of the most prominent manifestations of the contemporary transformation in the circulation of cultural products, and that this event has become a new knowledge event that deserves to be a framework for the problem of our current research, while this phenomenon is growing and developing to compete with the traditional marketing of art through galleries, exhibitions, auctions and museums. It is still the preserve of certain civilized and knowledge environments, and from here this research comes with the aim of shedding light on the mechanisms of digitizing the contemporary art market that have been linked to the two variables of the growing idea of indirect marketing through the intermediar

The effects of solar radiation pressure at several satellite (near Earth orbit satellite, low Earth orbit satellite, medium Earth orbit satellite and high Earth orbit satellite ) have been investigated. Computer simulation of the equation of motion with perturbations using step-by-step integration (Cowell's method) designed by matlab a 7.4 where using Jacobian matrix method to increase the accuracy of result.

The Islamic nation accuses these days of cruelty and extremism, and this is not strange. Every nation comes out
Including the hardline and the extremist, but the self-pity is that these charges have become
It went beyond the example and the mercy of the gift that the Almighty said (and you are to create great)
Al-Qalam: 4, and accusing him of not touching him in dealing with the people of the book and others, so try
It is our humble quest to urge our small speeches to clarify the position of Islam and its Prophet (peace and blessings of Allaah be upon him)
And deal with all human beings, and to show the low level of rights that our prophet has proved
Western laws are parts of his administration and adopted in the field

A new approach for baud time (or baud rate) estimation of a random binary signal is presented. This approach utilizes the spectrum of the signal after nonlinear processing in a way that the estimation error can be reduced by simply increasing the number of the processed samples instead of increasing the sampling rate. The spectrum of the new signal is shown to give an accurate estimate about the baud time when there is no apriory information or any restricting preassumptions. The performance of the estimator for random binary square waves perturbed by white Gaussian noise and ISI is evaluated and compared with that of the conventional estimator of the zero crossing detector.

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.