In this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica^®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between t

The process involved isolating E. faecium from the gut of honeybees, screening the bacterium for bacteriocin-like inhibitory substance (BLIS), evaluating its impact on the expression of the mexA gene in multidrug-resistant (MDR) P. aeruginosa, and determining the role of bacteriocin in treating infected wounds in mice through histopathological examination. After evaluating the best circumstances for producing BLIS, it was discovered that glucose was a superior carbon source and yeast extract was the best source of nitrogen. The pH was found to be 5, the ideal incubation time was 72 hours, and ammonium sulfate salt was used for partial purification at 80% saturation. The identification of MDR P. aeruginosa isolates from pus infection

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

Background: lip lengthening procedure is one of the surgical options for the correction of gummy smile in patients with short upper lip. Methods: A comparative clinical study was conducted on 15 patients requiring lip lengthening procedure for the esthetic correction of excessive gingival exposure with gummy smile. Scalpel was used in seven patients and diode laser in the remaining eight patients. Under infiltration anesthesia, about one cm strip of mucosa was excised at the vestibular depth and the mucosa of the lip was sutured to the alveolar mucosa. Results: The diode laser group demonstrated less postoperative pain and swelling. Regarding postoperative ecchymosis, three patients in the scalpel group developed ecchymosis and no cases

With the development of communication technologies for mobile devices and electronic communications, and went to the world of e-government, e-commerce and e-banking. It became necessary to control these activities from exposure to intrusion or misuse and to provide protection to them, so it's important to design powerful and efficient systems-do-this-purpose. It this paper it has been used several varieties of algorithm selection passive immune algorithm selection passive with real values, algorithm selection with passive detectors with a radius fixed, algorithm selection with passive detectors, variable- sized intrusion detection network type misuse where the algorithm generates a set of detectors to distinguish the self-samples. Practica