Optimization is essentially the art, science and mathematics of choosing the best among a given set of finite or infinite alternatives. Though currently optimization is an interdisciplinary subject cutting through the boundaries of mathematics, economics, engineering, natural sciences, and many other fields of human Endeavour it had its root in antiquity. In modern day language the problem mathematically is as follows - Among all closed curves of a given length find the one that closes maximum area. This is called the Isoperimetric problem. This problem is now mentioned in a regular fashion in any course in the Calculus of Variations. However, most problems of antiquity came from geometry and since there were no general methods to solve such problems, each one of them was solved by very different approaches.
The subject of youth care of important issues in view of what constitutes the importance
to the development of societies in general and as much as enjoy young people in any society
are good psychological health and agree psychosocial be healthy to be effective to invest their
energies and their potential for the progress of that society and development of the social
aspects and economic. The universities of the most important educational institutions that
provide care for young people, they are as well as providing information and expertise
necessary to prepare young people for life and the development of mental abilities, they are
different activities that will satisfy their needs physical, psychological, social and
Background: Machine learning relies on a hybrid of analytics, including regression analyses. There have been no attempts to deploy a sinusoidal transformation of data to enhance linear regression models.
Objectives: We aim to optimize linear models by implementing sinusoidal transformation to minimize the sum of squared error.
Methods: We implemented non-Bayesian statistics using SPSS and MatLab. We used Excel to generate 30 trials of linear regression models, and each has 1,000 observations. We utilized SPSS linear regression, Wilcoxon signed-rank test, and Cronbach’s alpha statistics to evaluate the performance of the optimization model. Results: The sinusoidal
Background: zirconium (Zr) implants are known for having an aesthetically pleasing tooth-like colour Unlike the grey cervical collar that develops over time when titanium (Ti) implants are used in thin gingival biotypes. However, the surface qualities of Zr implants can be further improved. This present study examined using thermal vapour deposition (TVD) to coat Zr implants with germanium (Ge) to improve its physical and chemical characteristics and enhance soft and hard tissue responses. Materials and methods: Zr discs were divided into two groups; the uncoated (control) group was only grit-blasted with alumina particles while the coated (experimental) group was grit-blasted then coated with Ge via TVD. Field emission scanning ele
... Show MoreBrachytherapy treatment is primarily used for the certain handling kinds of cancerous tumors. Using radionuclides for the study of tumors has been studied for a very long time, but the introduction of mathematical models or radiobiological models has made treatment planning easy. Using mathematical models helps to compute the survival probabilities of irradiated tissues and cancer cells. With the expansion of using HDR-High dose rate Brachytherapy and LDR-low dose rate Brachytherapy for the treatment of cancer, it requires fractionated does treatment plan to irradiate the tumor. In this paper, authors have discussed dose calculation algorithms that are used in Brachytherapy treatment planning. Precise and less time-consuming calculations
... 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 MoreCuneiform symbols recognition represents a complicated task in pattern recognition and image analysis as a result of problems that related to cuneiform symbols like distortion and unwanted objects that associated with applying Binrizetion process like spots and writing lines. This paper aims to present new proposed algorithms to solve these problems for reaching uniform results about cuneiform symbols recognition that related to (select appropriate Binerized method, erased writing lines and spots) based on statistical Skewness measure, image morphology and distance transform concepts. The experiment results show that our proposed algorithms have excellent result and can be adopted
... Show MoreReal life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.
We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑
... Show MoreAlgorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.