Lithotripsy of Different Urinary Tract Stones by Using Seeds of Carum copticum

It has been a well-known practice to use seeds and the essential oil of Carum copticum as a strongly  antiseptic ,  antispasmodic ,  aromatic  , bitter ,  diaphoretic  ,  digestive  ,  diuretic , expectorant  and tonic. Also used for cure influenza, asthma, and rheumatoid arthritis. To our knowledge it will be the first time to use the seeds of this herb as a urinary tract stone lithotripsy.This research aimed to the use of these seeds as a lithotripsian against different types of urinary stones and determine the efficiency of these preparation against which types of stone.A liquid solution was prepared from dissolving the seeds powder in cow milk and then concentration this preparation was done by boiling at 100°C to reduce the volume of solution to the half.The treatment was given via oral administration for successive 9 days before breakfast. 350 patients with urinary stone of different type took part in this research. All patients were subjected to ultrasonography and intravenous pyelography examinations to localized the position and detect diameter of stone. The above examination and also biochemical tests for diagnosis of stones ingredients were repeated after the administration of treatment and excretion of stone fragments in urine. The results were so promising especially against pure ca-oxalate stone

Move acceptance in local search metaheuristics for cross-domain search

Metaheuristics provide high-level instructions for designing heuristic optimisation algorithms and have been successfully applied to a range of computationally hard real-world problems. Local search metaheuristics operate under a single-point based search framework with the goal of iteratively improving a solution in hand over time with respect to a single objective using certain solution perturbation strategies, known as move operators, and move acceptance methods starting from an initially generated solution. Performance of a local search method varies from one domain to another, even from one instance to another in the same domain. There is a growing number of studies on `more general' search methods referred to as cross-domain search methods, or hyperheuristics, that operate at a high-level solving characteristically different problems, preferably without expert intervention. This paper provides a taxonomy and overview of existing local search metaheuristics along with an empirical study into the effects that move acceptance methods, as components of singlepoint based local search metaheuristics, have on the cross-domain performance of such algorithms for solving multiple combinatorial optimisation problems. The experimental results across a benchmark of nine different computationally hard problems highlight the shortcomings of existing and well-known methods for use as components of cross-domain search methods, despite being re-tuned for solving each domain