906 resultados para complementary logic
Resumo:
Genetic algorithms are commonly used to solve combinatorial optimizationproblems. The implementation evolves using genetic operators (crossover, mutation,selection, etc.). Anyway, genetic algorithms like some other methods have parameters(population size, probabilities of crossover and mutation) which need to be tune orchosen.In this paper, our project is based on an existing hybrid genetic algorithmworking on the multiprocessor scheduling problem. We propose a hybrid Fuzzy-Genetic Algorithm (FLGA) approach to solve the multiprocessor scheduling problem.The algorithm consists in adding a fuzzy logic controller to control and tunedynamically different parameters (probabilities of crossover and mutation), in anattempt to improve the algorithm performance. For this purpose, we will design afuzzy logic controller based on fuzzy rules to control the probabilities of crossoverand mutation. Compared with the Standard Genetic Algorithm (SGA), the resultsclearly demonstrate that the FLGA method performs significantly better.
Resumo:
The aim of this work is to evaluate the fuzzy system for different types of patients for levodopa infusion in Parkinson Disease based on simulation experiments using the pharmacokinetic-pharmacodynamic model. Fuzzy system is to control patient’s condition by adjusting the value of flow rate, and it must be effective on three types of patients, there are three different types of patients, including sensitive, typical and tolerant patient; the sensitive patients are very sensitive to drug dosage, but the tolerant patients are resistant to drug dose, so it is important for controller to deal with dose increment and decrement to adapt different types of patients, such as sensitive and tolerant patients. Using the fuzzy system, three different types of patients can get useful control for simulating medication treatment, and controller will get good effect for patients, when the initial flow rate of infusion is in the small range of the approximate optimal value for the current patient’ type.
Resumo:
Little is known about relationships between quality of care (QoC) and use of complementary and alternative medicine (CAM) among patients with lung cancer (LC). Purpose: This study examines CAM-use among patients with LC in Sweden, associations between QoC and CAM-use among these patients, and reported aspects of LC-care perceived as particularly positive and negative by patients, as well as suggestions for improving QoC. Methods: Survey data from 94 patient members of the Swedish LC patient organization about CAM-use and QoC as measured by the instrument “Quality from the patient’s perspective” were analyzed. Results: Fifty (53%) LC-patients used CAM, with 40 of the CAM-users reporting that CAM helped them. The most common CAMs used were dietary supplements and natural remedies, followed by prayer. Significantly more patients reported using prayer and meditation for cure than was the case for other types of CAM used. Less than half the CAM-users reported having spoken with staff from the biomedical health care system about their CAM-use. Patients provided numerous suggestions for improving LC-care in a variety of areas, aiming at a more effective and cohesive care trajectory. No differences in QoC were found between CAM-users and non-CAM-users, but differences in CAM-use i.e. type of CAM, reasons for using CAM, and CAM-provider consulted could be associated with different experiences of care. Conclusions: It is important to recognize that CAM-users are not a homogeneous group but might seek different types of CAMs and CAM-providers in different situations depending on experiences of care.
Resumo:
The clausal resolution method for propositional linear-time temporal logic is well known and provides the basis for a number of temporal provers. The method is based on an intuitive clausal form, called SNF, comprising three main clause types and a small number of resolution rules. In this paper, we show how the normal form can be radically simplified, and consequently, how a simplified clausal resolutioin method can be defined for this impoprtant variety of logics.
Resumo:
It has been shown recently that monodic first-order temporal logic without functional symbols but with equality is incomplete, i.e., the set of the valid formulae of this logic is not recursively enumerable. In this paper we show that an even simpler fragment consisting of monodic monadic two-variable formulae is not recursively enumerable.