Reasoning about real-time repetitions: terminating and nonterminating

It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to support nonterminating repetitions. In this paper we develop a general proof rule for reasoning about possibly nonterminating repetitions. The rule makes use of a Floyd-Hoare-style loop invariant that is maintained by each iteration of the repetition, a Jones-style relation between the pre- and post-states on each iteration, and a deadline specifying an upper bound on the starting time of each iteration. The general rule is proved correct with respect to a predicative semantics. In the case of a terminating repetition the rule reduces to the standard rule extended to handle real time. Other special cases include repetitions whose bodies are guaranteed to terminate, nonterminating repetitions with the constant true as a guard, and repetitions whose termination is guaranteed by the inclusion of a fixed deadline. (C) 2002 Elsevier Science B.V. All rights reserved.

Rational combinatorial chemistry-based selection, synthesis and evaluation of an affinity adsorbent for recombinant human clotting factor VII

The selection, synthesis and chromatographic evaluation of a synthetic affinity adsorbent for human recombinant factor VIIa is described. The requirement for a metal ion-dependent immunoadsorbent step in the purification of the recombinant human clotting factor, FVIIa, has been obviated by using the X-ray crystallographic structure of the complex of tissue factor (TF) and Factor VIIa and has directed our combinatorial approach to select, synthesise and evaluate a rationally-selected affinity adsorbent from a limited library of putative ligands. The selected and optimised ligand comprises a triazine scaffold bis-substituted with 3-aminobenzoic acid and has been shown to bind selectively to FVIIa in a Ca2+-dependent manner. The adsorbent purifies FVIIa to almost identical purity (>99%), yield (99%), activation/degradation profile and impurity content (∼1000 ppm) as the current immunoadsorption process, while displaying a 10-fold higher static capacity and substantially higher reusability and durability. © 2002 Elsevier Science B.V. All rights reserved.

Exploring privileged structures: the combinatorial synthesis of cyclic peptides

Head-to-tail cyclic peptides have been reported to bind to multiple, unrelated classes of receptor with high affinity. They may therefore be considered to be privileged structures. This review outlines the strategies by which both macrocyclic cyclic peptides and cyclic dipeptides or diketopiperazines have been synthesised in combinatorial libraries. It also briefly outlines some of the biological applications of these molecules, thereby justifying their inclusion as privileged structures.

Assessing clinical reasoning: a method to monitor its development in a PBL curriculum

The aim of this study was to develop and trial a method to monitor the evolution of clinical reasoning in a PBL curriculum that is suitable for use in a large medical school. Termed Clinical Reasoning Problems (CRPs), it is based on the notion that clinical reasoning is dependent on the identification and correct interpretation of certain critical clinical features. Each problem consists of a clinical scenario comprising presentation, history and physical examination. Based on this information, subjects are asked to nominate the two most likely diagnoses and to list the clinical features that they considered in formulating their diagnoses, indicating whether these features supported or opposed the nominated diagnoses. Students at different levels of medical training completed a set of 10 CRPs as well as the Diagnostic Thinking Inventory, a self-reporting questionnaire designed to assess reasoning style. Responses were scored against those of a reference group of general practitioners. Results indicate that the CRPs are an easily administered, reliable and valid assessment of clinical reasoning, able to successfully monitor its development throughout medical training. Consequently, they can be employed to assess clinical reasoning skill in individual students and to evaluate the success of undergraduate medical schools in providing effective tuition in clinical reasoning.

A Generic Library for GUI Reasoning and Testing

Graphical user interfaces (GUIs) make software easy to use by providing the user with visual controls. Therefore, correctness of GUI's code is essential to the correct execution of the overall software. Models can help in the evaluation of interactive applications by allowing designers to concentrate on its more important aspects. This paper presents a generic model for language-independent reverse engineering of graphical user interface based applications, and we explore the integration of model-based testing techniques in our approach, thus allowing us to perform fault detection. A prototype tool has been constructed, which is already capable of deriving and testing a user interface behavioral model of applications written in Java/Swing.

Reasoning and proof in classroom (9th grade)

This paper is research oriented and pretends to contribute toward giving empirical evidence about how students develop their reasoning and how they achieved to a proof construction in school context. Its main theme is epistemology. It describes the way in which four students in 9th Grade explored a task related with the discovery of symmetry axes in various geometric figures. The proof constructed by students had essentially an explaining function and it was related with the symmetry axes of regular polygons. The teacher’s role in meaning negotiation of the proof and its need is described through illustrative episodes. The paper presents part of a study which purpose is to analyse the nature of mathematical proof in classroom, its role and the nature of the relationship between the construction of a proof and the social interactions. Assuming a social perspective, attention is focussed on the social construction of knowledge and on the structuring resources that shape mathematical experience. The study’s methodology has an interpretative nature. One outcome of the study discussed here is that students develop first a practical understanding with no awareness of the reasons founding mathematical statements and after a theoretical one leading them to a proof elaboration.

Causal attributions in Brazilian children's reasoning about health and illness

INTRODUCTION: At a time when a great number of diseases can be prevented by changing one's habits and life style, investigations have focused on understanding what adults and children believe to be desirable health practices and uncovering the factors associated with successful adherence to such practices. For these, causal attributions for health and illness were investigated among 96 Brazilian elementary school students. METHODS: Ninety six subjects, aged 6 to 14, were interviewed individually and their causal attributions were assessed through 14 true-false items (e.g. people stay well [healthy] because they are lucky). The relationship between the children's causal attributions and demographic characteristics were also examined. RESULTS: Overall, the results were consistent with previous researches. "Taking care of oneself" was considered the most important cause of good health. "Viruses and germs" and "lack of self-care" were the most selected causes of illness. Analyses revealed significant relationship between subjects' causal attribution and their age, school grade level, socioeconomic status and gender. CONCLUSIONS: The study findings suggest that there may be more cross-cultural similarities than differences in children's causal attributions for health and illness. Finding ways to help individuals engage in appropriate preventive-maintenance health practices without developing an exaggerated notion that the individuals can control their own health and illness is a challenge which remains to be addressed by further research.

Self-optimization module for scheduling using case-based reasoning

Metaheuristics performance is highly dependent of the respective parameters which need to be tuned. Parameter tuning may allow a larger flexibility and robustness but requires a careful initialization. The process of defining which parameters setting should be used is not obvious. The values for parameters depend mainly on the problem, the instance to be solved, the search time available to spend in solving the problem, and the required quality of solution. This paper presents a learning module proposal for an autonomous parameterization of Metaheuristics, integrated on a Multi-Agent System for the resolution of Dynamic Scheduling problems. The proposed learning module is inspired on Autonomic Computing Self-Optimization concept, defining that systems must continuously and proactively improve their performance. For the learning implementation it is used Case-based Reasoning, which uses previous similar data to solve new cases. In the use of Case-based Reasoning it is assumed that similar cases have similar solutions. After a literature review on topics used, both AutoDynAgents system and Self-Optimization module are described. Finally, a computational study is presented where the proposed module is evaluated, obtained results are compared with previous ones, some conclusions are reached, and some future work is referred. It is expected that this proposal can be a great contribution for the self-parameterization of Metaheuristics and for the resolution of scheduling problems on dynamic environments.

Multi-apprentice learning for meta-heuristics parameter tuning in a multi agent scheduling system

The scheduling problem is considered in complexity theory as a NP-hard combinatorial optimization problem. Meta-heuristics proved to be very useful in the resolution of this class of problems. However, these techniques require parameter tuning which is a very hard task to perform. A Case-based Reasoning module is proposed in order to solve the parameter tuning problem in a Multi-Agent Scheduling System. A computational study is performed in order to evaluate the proposed CBR module performance.

Case-based reasoning for meta-heuristics self-parameterization in a multi-agent scheduling system

A novel agent-based approach to Meta-Heuristics self-configuration is proposed in this work. Meta-heuristics are examples of algorithms where parameters need to be set up as efficient as possible in order to unsure its performance. This paper presents a learning module for self-parameterization of Meta-heuristics (MHs) in a Multi-Agent System (MAS) for resolution of scheduling problems. The learning is based on Case-based Reasoning (CBR) and two different integration approaches are proposed. A computational study is made for comparing the two CBR integration perspectives. In the end, some conclusions are reached and future work outlined.

Case-based reasoning for self-optimizing behavior

In this paper we present a Self-Optimizing module, inspired on Autonomic Computing, acquiring a scheduling system with the ability to automatically select a Meta-heuristic to use in the optimization process, so as its parameterization. Case-based Reasoning was used so the system may be able of learning from the acquired experience, in the resolution of similar problems. From the obtained results we conclude about the benefit of its use.

Aspectos de aprendizagem em optimização

A optimização e a aprendizagem em Sistemas Multi-Agente são consideradas duas áreas promissoras mas relativamente pouco exploradas. A optimização nestes ambientes deve ser capaz de lidar com o dinamismo. Os agentes podem alterar o seu comportamento baseando-se em aprendizagem recente ou em objectivos de optimização. As estratégias de aprendizagem podem melhorar o desempenho do sistema, dotando os agentes da capacidade de aprender, por exemplo, qual a técnica de optimização é mais adequada para a resolução de uma classe particular de problemas, ou qual a parametrização é mais adequada em determinado cenário. Nesta dissertação são estudadas algumas técnicas de resolução de problemas de Optimização Combinatória, sobretudo as Meta-heurísticas, e é efectuada uma revisão do estado da arte de Aprendizagem em Sistemas Multi-Agente. É também proposto um módulo de aprendizagem para a resolução de novos problemas de escalonamento, com base em experiência anterior. O módulo de Auto-Optimização desenvolvido, inspirado na Computação Autónoma, permite ao sistema a selecção automática da Meta-heurística a usar no processo de optimização, assim como a respectiva parametrização. Para tal, recorreu-se à utilização de Raciocínio baseado em Casos de modo que o sistema resultante seja capaz de aprender com a experiência adquirida na resolução de problemas similares. Dos resultados obtidos é possível concluir da vantagem da sua utilização e respectiva capacidade de adaptação a novos e eventuais cenários.