Toward a Theory of Representation Design

This research is concerned with designing representations for analytical reasoning problems (of the sort found on the GRE and LSAT). These problems test the ability to draw logical conclusions. A computer program was developed that takes as input a straightforward predicate calculus translation of a problem, requests additional information if necessary, decides what to represent and how, designs representations capturing the constraints of the problem, and creates and executes a LISP program that uses those representations to produce a solution. Even though these problems are typically difficult for theorem provers to solve, the LISP program that uses the designed representations is very efficient.

Reasoning from Incomplete Knowledge in a Procedural Deduction System

One very useful idea in AI research has been the notion of an explicit model of a problem situation. Procedural deduction languages, such as PLANNER, have been valuable tools for building these models. But PLANNER and its relatives are very limited in their ability to describe situations which are only partially specified. This thesis explores methods of increasing the ability of procedural deduction systems to deal with incomplete knowledge. The thesis examines in detail, problems involving negation, implication, disjunction, quantification, and equality. Control structure issues and the problem of modelling change under incomplete knowledge are also considered. Extensive comparisons are also made with systems for mechanica theorem proving.

The Definition and Implementation of a Computer Programming Language Based on Constraints

The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network of devices connected by wires. Data values may flow along the wires, and computation is performed by the devices. A device computes using only locally available information (with a few exceptions), and places newly derived values on other, locally attached wires. In this way computed values are propagated. An advantage of the constraint paradigm (not unique to it) is that a single relationship can be used in more than one direction. The connections to a device are not labelled as inputs and outputs; a device will compute with whatever values are available, and produce as many new values as it can. General theorem provers are capable of such behavior, but tend to suffer from combinatorial explosion; it is not usually useful to derive all the possible consequences of a set of hypotheses. The constraint paradigm places a certain kind of limitation on the deduction process. The limitations imposed by the constraint paradigm are not the only one possible. It is argued, however, that they are restrictive enough to forestall combinatorial explosion in many interesting computational situations, yet permissive enough to allow useful computations in practical situations. Moreover, the paradigm is intuitive: It is easy to visualize the computational effects of these particular limitations, and the paradigm is a natural way of expressing programs for certain applications, in particular relationships arising in computer-aided design. A number of implementations of constraint-based programming languages are presented. A progression of ever more powerful languages is described, complete implementations are presented and design difficulties and alternatives are discussed. The goal approached, though not quite reached, is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.

Time-dependent wavepacket approach to the influence of intense fields on the population of molecular excited states

The influence of laser-field parameters, such as intensity and pulse width, on the population of molecular excited state is investigated by using the time-dependent wavepacket method. For a two-state system in intense laser fields, the populations in the upper and lower states are given by the wavefunctions obtained by solving the Schrodinger equation through split-operator scheme. The calculation shows that both the laser intensity and the pulse width have a strong effect on the population in molecular excited state, and that as the common feature of light-matter interaction (LMI), the periodic changing of the population with the evolution time in each state can be interpreted by Rabi oscillation and area-theorem. The results illustrate that by controlling these two parameters, the needed population in excited state of interest can be obtained, which provides the foundation of light manipulation of molecular processes. (C) 2005 Elsevier B.V. All rights reserved.

Accelerated partial irradiation for breast cancer: Systematic review and meta-analysis of 8653 women in eight randomized trials

Background and purpose: Accelerated partial breast irradiation (APBI) is the strategy that allows adjuvant treatment delivery in a shorter period of time in smaller volumes. This study was undertaken to assess the effectiveness and outcomes of APBI in breast cancer compared with whole-breast irradiation (WBI). Material and methods: Systematic review and meta-analysis of randomized controlled trials of WBI versus APBI. Two authors independently selected and assessed the studies regarding eligibility criteria. Results: Eight studies were selected. A total of 8653 patients were randomly assigned for WBI versus APBI. Six studies reported local recurrence outcomes. Two studies were matched in 5 years and only one study for different time of follow-up. Meta-analysis of two trials assessing 1407 participants showed significant difference in the WBI versus APBI group regarding the 5-year local recurrence rate (HR = 4.54, 95% CI: 1.78-11.61, p = 0.002). Significant difference in favor of WBI for different follow-up times was also found. No differences in nodal recurrence, systemic recurrence, overall survival and mortality rates were observed. Conclusions: APBI is associated with higher local recurrence compared to WBI without compromising other clinical outcomes. (C) 2014 Elsevier Ireland Ltd. All rights reserved.

Rethinking the digital divide: from philanthropy to isonomia..

The digital divide has been, at least until very recently, a major theme in policy as well as interdisciplinary academic circles across the world, as well as at a collective global level, as attested by the World Summit on the Information Society. Numerous research papers and volumes have attempted to conceptualise the digital divide and to offer reasoned prescriptive and normative responses. What has been lacking in many of these studies, it is submitted, is a rigorous negotiation of moral and political philosophy, the result being a failure to situate the digital divide - or rather, more widely, information imbalances - in a holistic understanding of social structures of power and wealth. In practice, prescriptive offerings have been little more than philanthropic in tendency, whether private or corporate philanthropy. Instead, a theory of distributive justice is required, one that recovers the tradition of emancipatory, democratic struggle. This much has been said before. What is new here, however, is that the paper suggests a specific formula, the Rawls-Tawney theorem, as a solution at the level of analytical moral-political philosophy. Building on the work of John Rawls and R. H. Tawney, this avoids both the Charybdis of Marxism and the Scylla of liberalism. It delineates some of the details of the meaning of social justice in the information age. Promulgating a conception of isonomia, which while egalitarian eschews arithmetic equality (the equality of misery), the paper hopes to contribute to the emerging ideal of communicative justice in the media-saturated, post-industrial epoch.

Mixed methods feasibility study for a trial of blood pressure telemonitoring for people who have had stroke/transient ischaemic attack (TIA).

Background Good blood pressure (BP) control reduces the risk of recurrence of stroke/transient ischaemic attack (TIA). Although there is strong evidence that BP telemonitoring helps achieve good control, none of the major trials have considered the effectiveness in stroke/TIA survivors. We therefore conducted a feasibility study for a trial of BP telemonitoring for stroke/ TIA survivors with uncontrolled BP in primary care. Method Phase 1 was a pilot trial involving 55 patients stratified by stroke/TIA randomised 3:1 to BP telemonitoring for 6 months or usual care. Phase 2 was a qualitative evaluation and comprised semi-structured interviews with 16 trial participants who received telemonitoring and 3 focus groups with 23 members of stroke support groups and 7 carers. Results Overall, 125 patients (60 stroke patients, 65 TIA patients) were approached and 55 (44%) patients were randomised including 27 stroke patients and 28 TIA patients. Fifty-two participants (95%) attended the 6-month follow-up appointment, but one declined the second daytime ambulatory blood pressure monitoring (ABPM) measurement resulting in a 93% completion rate for ABPM − the proposed primary outcome measure for a full trial. Adherence to telemonitoring was good; of the 40 participants who were telemonitoring, 38 continued to provide readings throughout the 6 months. There was a mean reduction of 10.1 mmHg in systolic ABPM in the telemonitoring group compared with 3.8 mmHg in the control group, which suggested the potential for a substantial effect from telemonitoring. Our qualitative analysis found that many stroke patients were concerned about their BP and telemonitoring increased their engagement, was easy, convenient and reassuring Conclusions A full-scale trial is feasible, likely to recruit well and have good rates of compliance and follow-up.

Introduction to logical information systems

Ridoux, O. and Ferr?, S. (2004) Introduction to logical information systems. Information Processing & Management, 40 (3), 383-419. Elsevier

Modelling random fuzzy renewal reward processes

Shen, Q., Zhao, R., Tang, W. (2008). Modelling random fuzzy renewal reward processes. IEEE Transactions on Fuzzy Systems, 16 (5),1379-1385

Generalized semi-geostrophic theory on a sphere

Douglas, Robert; Cullen, M.J.P.; Roulston, I.; Sewell, M.J., (2005) 'Generalized semi-geostrophic theory on a sphere', Journal of Fluid Mechanics 531 pp.123-157 RAE2008

Twierdzenia o punktach stałych pewnych klas operatorów nieliniowych wraz z ich zastosowaniami

Wydział Matematyki i Informatyki

Market allocations of location choice: an example

The purpose of this paper is to make an example which, first, illustrates Starret’s Spatial Imposibility Theorem, when agents have free mobility; and second, allowes us to get a competitive equilibrium with transportation when agents move only if there is a noticeable difference in utilities that justifies the change of location.

Dependence of severe storm occurrence on circulation types in Poland

The paper investigates the relationships between the occurrence of thunderstorms with heavy precipitation (> 30 mm) and atmospheric circulation types. The study covers the period 1951–1998 and is based on a matching span of records of thunderstorm occurrence and daily precipitation totals at 47 weather stations in Poland. A catalogue of circulation types by Osuchowska-Klein, data on frequency of fronts over south-eastern Poland by Niedźwiedź and weather maps were used. In Poland, days with a thunderstorm and more than 30 mm of precipitation are extremely rare and occur mainly in summer. Their recurrence period amounts to about two to four years, with the exception of mountain areas (southern Poland) where they occur nearly every year. The heaviest precipitation on a day with thunderstorm, 166.1 mm, was recorded at a high-mountain station on Mt. Kasprowy Wierch. Apart from this station the highest precipitation was 141.0 mm and only eight stations had at least one record of more than 100 mm. Four regions characterised by different circulation types most favourable for the occurrence of thunderstorms with heavy precipitation were identified. In all of them southerly advection was most favourable for the occurrence of the phenomena studied (Sc, SEc, Sa/c), but that effect was especially prominent in the south-western region. Most of the days with thunderstorm and heavy precipitation coincided with the passing of an atmospheric front over Poland (53.8–81.9% days depending on the station). Days with air-mass thunderstorm and heavy precipitation were rare and mostly occurred in areas of variable topography.

Via de sinalização mTOR no carcinoma urotelial da bexiga

Trabalho de Projeto apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Análises Laboratoriais Especializadas, área de especialização em Análise Biomédica

Building Responsive Systems from Physically-correct Specifications

Predictability - the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements - is a crucial, highly desirable property of responsive embedded systems. This paper overviews a development methodology for responsive systems, which enhances predictability by eliminating potential hazards resulting from physically-unsound specifications. The backbone of our methodology is the Time-constrained Reactive Automaton (TRA) formalism, which adopts a fundamental notion of space and time that restricts expressiveness in a way that allows the specification of only reactive, spontaneous, and causal computation. Using the TRA model, unrealistic systems - possessing properties such as clairvoyance, caprice, in finite capacity, or perfect timing - cannot even be specified. We argue that this "ounce of prevention" at the specification level is likely to spare a lot of time and energy in the development cycle of responsive systems - not to mention the elimination of potential hazards that would have gone, otherwise, unnoticed. The TRA model is presented to system developers through the CLEOPATRA programming language. CLEOPATRA features a C-like imperative syntax for the description of computation, which makes it easier to incorporate in applications already using C. It is event-driven, and thus appropriate for embedded process control applications. It is object-oriented and compositional, thus advocating modularity and reusability. CLEOPATRA is semantically sound; its objects can be transformed, mechanically and unambiguously, into formal TRA automata for verification purposes, which can be pursued using model-checking or theorem proving techniques. Since 1989, an ancestor of CLEOPATRA has been in use as a specification and simulation language for embedded time-critical robotic processes.