A fuzzy logic controller for intestinal levodopa infusion in Parkinson’s disease

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.

Fuzzy logic for decision support in chronic care

Computerized clinical guidelines can provide significant benefits in terms of health outcomes and costs, however, their effective computer implementation presents significant problems. Vagueness and ambiguity inherent in natural language (textual) clinical guidelines makes them problematic for formulating automated alerts or advice. Fuzzy logic allows us to formalize the treatment of vagueness in a decision support architecture. In care plan on-line (CPOL), an intranet-based chronic disease care planning system for general practitioners (GPs) in use in South Australia, we formally treat fuzziness in interpretation of quantitative data, formulation of recommendations and unequal importance of clinical indicators. We use expert judgment on cases, as well as direct estimates by experts, to optimize aggregation operators and treat heterogeneous combinations of conjunction and disjunction that are present in the natural language decision rules formulated by specialist teams.

Macleod and the offence of defrauding the company in one-person businesses: the divergence between legal principle and logic widens

The recent High Court decision in Macleod v R establishes that a director and sole shareholder may be convicted of fraudulently applying a company's property even though the person has consented to the personal use of the company's property. It is contended that while this decision is consistent with the weight of precedent, it is wrong in principle. The decision implies that corporations are not only separate legal entities, but that they are highly virtuous legal entities -- incapable of being imbued with the dishonest intentions and activities of the individuals controlling the company.

Fuzzy logic based metric in software testing

How to provide cost-effective strategies for Software Testing has been one of the research focuses in Software Engineering for a long time. Many researchers in Software Engineering have addressed the effectiveness and quality metric of Software Testing, and many interesting results have been obtained. However, one issue of paramount importance in software testing – the intrinsic imprecise and uncertain relationships within testing metrics – is left unaddressed. To this end, a new quality and effectiveness measurement based on fuzzy logic is proposed. The software quality features and analogy-based reasoning are discussed, which can deal with quality and effectiveness consistency between different test projects. Experimental results are also provided to verify the proposed measurement.

A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic

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.

Equality and Monodic First-Order Temporal Logic

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.