Reasoning about timeouts

In real-time programming a timeout mechanism allows exceptional behaviour, such as a lack of response, to be handled effectively, while not overly affecting the programming for the normal case. For. example, in a pump controller if the water level has gone below the minimum level and the pump is on and hence pumping in more water, then the water level should rise above the minimum level within a specified time. If not, there is a fault in the system and it should be shut down and an alarm raised. Such a situation can be handled by normal case code that determines when the level has risen above the minimum, plus a timeout case handling the situation when the specified time to reach the minimum has passed. In this paper we introduce a timeout mechanism, give it a formal definition in terms of more basic real-time commands, develop a refinement law for introducing a timeout clause to implement a specification, and give an example of using the law to introduce a timeout. The framework used is a machine-independent real-time programming language, which makes use of a deadline command to represent timing constraints in a machine-independent fashion. This allows a more abstract approach to handling timeouts.

Reasoning about deadlines in concurrent real-time programs

We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machine-dependent task. The latter takes into account the execution times of the program on a particular machine. Therefore, our goal is to make the machine-dependent phase of the analysis as simple as possible. We succeed in the sense that the machine-dependent phase remains the same as in the analysis of sequential programs. We shift the complexity introduced by concurrency completely to the machine-independent phase.

Intuition: Myth or a Decision-making Tool?

Faced with today’s ill-structured business environment of fast-paced change and rising uncertainty, organizations have been searching for management tools that will perform satisfactorily under such ambiguous conditions. In the arena of managerial decision making, one of the approaches being assessed is the use of intuition. Based on our definition of intuition as a non-sequential information-processing mode, which comprises both cognitive and affective elements and results in direct knowing without any use of conscious reasoning, we develop a testable model of integrated analytical and intuitive decision making and propose ways to measure the use of intuition.

Variants of temporal defeasible logics for modelling norm modifications

This paper proposes some variants of Temporal Defeasible Logic (TDL) to reason about normative modifications. These variants make it possible to differentiate cases in which, for example, modifications at some time change legal rules but their conclusions persist afterwards from cases where also their conclusions are blocked.

Strategic argumentation: A game theoretical investigation

Argumentation is modelled as a game where the payoffs are measured in terms of the probability that the claimed conclusion is, or is not, defeasibly provable, given a history of arguments that have actually been exchanged, and given the probability of the factual premises. The probability of a conclusion is calculated using a standard variant of Defeasible Logic, in combination with standard probability calculus. It is a new element of the present approach that the exchange of arguments is analysed with game theoretical tools, yielding a prescriptive and to some extent even predictive account of the actual course of play. A brief comparison with existing argument-based dialogue approaches confirms that such a prescriptive account of the actual argumentation has been almost lacking in the approaches proposed so far.

Probabilistic Action System Trace Semantics

Action systems are a construct for reasoning about concurrent, reactive systems, in which concurrent behaviour is described by interleaving atomic actions. Sere and Troubitsyna have proposed an extension to action systems in which actions may be expressed and composed using discrete probabilistic choice as well as demonic nondeterministic choice. In this paper we develop a trace-based semantics for probabilistic action systems. This semantics provides a simple theoretical base on which practical refinement rules for probabilistic action systems may be justified.

Proof Explanation in the DR-DEVICE System

Trust is a vital feature for Semantic Web: If users (humans and agents) are to use and integrate system answers, they must trust them. Thus, systems should be able to explain their actions, sources, and beliefs, and this issue is the topic of the proof layer in the design of the Semantic Web. This paper presents the design and implementation of a system for proof explanation on the Semantic Web, based on defeasible reasoning. The basis of this work is the DR-DEVICE system that is extended to handle proofs. A critical aspect is the representation of proofs in an XML language, which is achieved by a RuleML language extension.

Programming internet based DAI applications in Qu-Prolog

This paper presents the unique collection of additional features of Qu-Prolog, a variant of the Al programming language Prolog, and illustrates how they can be used for implementing DAI applications. By this we mean applications comprising communicating information servers, expert systems, or agents, with sophisticated reasoning capabilities and internal concurrency. Such an application exploits the key features of Qu-Prolog: support for the programming of sound non-clausal inference systems, multi-threading, and high level inter-thread message communication between Qu-Prolog query threads anywhere on the internet. The inter-thread communication uses email style symbolic names for threads, allowing easy construction of distributed applications using public names for threads. How threads react to received messages is specified by a disjunction of reaction rules which the thread periodically executes. A communications API allows smooth integration of components written in C, which to Qu-Prolog, look like remote query threads.

Gene-engineered T cells as a superior adjuvant therapy for metastatic cancer

The major limiting factor in the successful application of adjuvant therapy for metastatic disease is the lack of adjuvant specificity that leads to severe side effects. Reasoning that T cells of the immune system are highly specific, we generated tumor-specific T cells by genetic modification of mouse primary T cells with a chimeric receptor reactive with the human breast cancer-associated Ag erbB-2. These T cells killed breast cancer cells and secreted IFN-gamma in an Ag-specific manner in vitro. We investigated their use against metastatic breast cancer in mice in an adjuvant setting, and compared their effectiveness with the commonly applied adjuvants doxorubicin, 5-fluorouracil, and herceptin. Mice were inoculated orthotopically with the human erbB-2-expressing spontaneously metastatic mouse breast cancer 4T1.2 in mammary tissue, and the primary tumor was surgically removed 8 days later., Significant metastatic disease was demonstrated in lung and liver at the time of surgery on day 8 with increased tumor burden at later time points. T cell adjuvant treatment of day 8 metastatic disease resulted in dramatic increases in survival of mice, and this survival was significantly greater than that afforded by either doxorubicin, 5-fluorouracil, or herceptin.

Ecology, values, and objectivity: Advancing the debate

We add to current discussions about the interface between ecology, values, and objectivity by reporting on a novel Delphi-based study of the scientific reasoning employed by a group of eight ecologists as they collectively considered current ecological thinking. We rely on contextual empiricism, with its features of multiple ways of relating theory to reality and science as a social activity, to provide a richer understanding of scientific objectivity. This understanding recognizes the place and contributions of values and, in so doing, moves the discussion beyond whether or not science is value neutral.

Mathematically gifted male adolescents activate a unique brain network during mental rotation

Mental rotation involves the creation and manipulation of internal images, with the later being particularly useful cognitive capacities when applied to high-level mathematical thinking and reasoning. Many neuroimaging studies have demonstrated mental rotation to be mediated primarily by the parietal lobes, particularly on the right side. Here, we use fMRI to show for the first time that when performing 3-dimensional mental rotations, mathematically gifted male adolescents engage a qualitatively different brain network than those of average math ability, one that involves bilateral activation of the parietal lobes and frontal cortex, along with heightened activation of the anterior cingulate. Reliance on the processing characteristics of this uniquely bilateral system and the interplay of these anterior/posterior regions may be contributors to their mathematical precocity.