A refinement calculus for logic programs

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.

Cognitive style factors affecting database query performance

As end-user computing becomes more pervasive, an organization's success increasingly depends on the ability of end-users, usually in managerial positions, to extract appropriate data from both internal and external sources. Many of these data sources include or are derived from the organization's accounting information systems. Managerial end-users with different personal characteristics and approaches are likely to compose queries of differing levels of accuracy when searching the data contained within these accounting information systems. This research investigates how cognitive style elements of personality influence managerial end-user performance in database querying tasks. A laboratory experiment was conducted in which participants generated queries to retrieve information from an accounting information system to satisfy typical information requirements. The experiment investigated the influence of personality on the accuracy of queries of varying degrees of complexity. Relying on the Myers–Briggs personality instrument, results show that perceiving individuals (as opposed to judging individuals) who rely on intuition (as opposed to sensing) composed queries more accurately. As expected, query complexity and academic performance also explain the success of data extraction tasks.

The variety of variables in automated real-time refinement

The refinement calculus is a well-established theory for deriving program code from specifications. Recent research has extended the theory to handle timing requirements, as well as functional ones, and we have developed an interactive programming tool based on these extensions. Through a number of case studies completed using the tool, this paper explains how the tool helps the programmer by supporting the many forms of variables needed in the theory. These include simple state variables as in the untimed calculus, trace variables that model the evolution of properties over time, auxiliary variables that exist only to support formal reasoning, subroutine parameters, and variables shared between parallel processes.

Structural refinement of systems specified in object-z and CSP

This paper is concerned with methods for refinement of specifications written using a combination of Object-Z and CSP. Such a combination has proved to be a suitable vehicle for specifying complex systems which involve state and behaviour, and several proposals exist for integrating these two languages. The basis of the integration in this paper is a semantics of Object-Z classes identical to CSP processes. This allows classes specified in Object-Z to be combined using CSP operators. It has been shown that this semantic model allows state-based refinement relations to be used on the Object-Z components in an integrated Object-Z/CSP specification. However, the current refinement methodology does not allow the structure of a specification to be changed in a refinement, whereas a full methodology would, for example, allow concurrency to be introduced during the development life-cycle. In this paper, we tackle these concerns and discuss refinements of specifications written using Object-Z and CSP where we change the structure of the specification when performing the refinement. In particular, we develop a set of structural simulation rules which allow single components to be refined to more complex specifications involving CSP operators. The soundness of these rules is verified against the common semantic model and they are illustrated via a number of examples.

The role of discriminant analysis in the refinement of customer satisfaction assessment

OBJECTIVE: To test discriminant analysis as a method of turning the information of a routine customer satisfaction survey (CSS) into a more accurate decision-making tool. METHODS: A 7-question, 10-multiple choice, self-applied questionnaire was used to study a sample of patients seen in two outpatient care units in Valparaíso, Chile, one of primary care (n=100) and the other of secondary care (n=249). Two cutting points were considered in the dependent variable (final satisfaction score): satisfied versus unsatisfied, and very satisfied versus all others. Results were compared with empirical measures (proportion of satisfied individuals, proportion of unsatisfied individuals and size of the median). RESULTS: The response rate was very high, over 97.0% in both units. A new variable, medical attention, was revealed, as explaining satisfaction at the primary care unit. The proportion of the total variability explained by the model was very high (over 99.4%) in both units, when comparing satisfied with unsatisfied customers. In the analysis of very satisfied versus all other customers, significant relationship was identified only in the case of the primary care unit, which explained a small proportion of the variability (41.9%). CONCLUSIONS: Discriminant analysis identified relationships not revealed by the previous analysis. It provided information about the proportion of the variability explained by the model. It identified non-significant relationships suggested by empirical analysis (e.g. the case of the relation very satisfied versus others in the secondary care unit). It measured the contribution of each independent variable to the explanation of the variation of the dependent one.

Iterative refinement approach for QOS-Aware service configuration

In heterogeneous environments, diversity of resources among the devices may affect their ability to perform services with specific QoS constraints, and drive peers to group themselves in a coalition for cooperative service execution. The dynamic selection of peers should be influenced by user’s QoS requirements as well as local computation availability, tailoring provided service to user’s specific needs. However, complex dynamic real-time scenarios may prevent the possibility of computing optimal service configurations before execution. An iterative refinement approach with the ability to trade off deliberation time for the quality of the solution is proposed. We state the importance of quickly finding a good initial solution and propose heuristic evaluation functions that optimise the rate at which the quality of the current solution improves as the algorithms have more time to run.

Questing one Brazilian query: reporting 16 cases of Q fever from Minas Gerais, Brazil

Q fever has been considered non-existing in Brazil where reports of clinical cases still cannot be found. This case-series of 16 patients is a result of a systematic search for such illness by means of clinical and serologic criteria. Serologic testing was performed by the indirect microimmunofluorescence technique using phase I/II C. burnetii antigens. Influenza-like syndrome was the most frequent clinical form (eight cases - 50%), followed by pneumonia, FUO (fever of unknown origin), mono-like syndrome (two cases - 12.5% each), lymphadenitis (one case - 6.3%) and spondylodiscitis associated with osteomyelitis (one case - 6.3%). The ages varied from four to 67 years old with a median of 43.5. All but one patient had positive serologic tests for phase II IgG whether or not associated with IgM positivity compatible with acute infection. One patient had both phase I and phase II IgG antibodies compatible with chronic Q fever. Seroconvertion was detected in 10 patients. Despite the known limitations of serologic diagnosis, the cases here reported should encourage Brazilian doctors to include Q fever as an indigenous cause of febrile illness.

A qualitive reasoning approach for improving query results for sketch based queries by topological analysis of spatial aggregation

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Leber Congenital Amaurosis: Comprehensive Survey of the Genetic Heterogeneity, Refinement of the Clinical Definition, and Genotype-Phenotype Correlations as a Strategy for Molecular Diagnosis

Leber congenital amaurosis (LCA) is the earliest and most severe form of all inherited retinal dystrophies, responsible for congenital blindness. Disease-associated mutations have been hitherto reported in seven genes. These genes are all expressed preferentially in the photoreceptor cells or the retinal pigment epithelium but they are involved in strikingly different physiologic pathways resulting in an unforeseeable physiopathologic variety. This wide genetic and physiologic heterogeneity that could largely increase in the coming years, hinders the molecular diagnosis in LCA patients. The genotyping is, however, required to establish genetically defined subgroups of patients ready for therapy. Here, we report a comprehensive mutational analysis of the all known genes in 179 unrelated LCA patients, including 52 familial and 127 sporadic (27/127 consanguineous) cases. Mutations were identified in 47.5% patients. GUCY2D appeared to account for most LCA cases of our series (21.2%), followed by CRB1 (10%), RPE65 (6.1%), RPGRIP1 (4.5%), AIPL1 (3.4%), TULP1 (1.7%), and CRX (0.6%). The clinical history of all patients with mutations was carefully revisited to search for phenotype variations. Sound genotype-phenotype correlations were found that allowed us to divide patients into two main groups. The first one includes patients whose symptoms fit the traditional definition of LCA, i.e., congenital or very early cone-rod dystrophy, while the second group gathers patients affected with severe yet progressive rod-cone dystrophy. Besides, objective ophthalmologic data allowed us to subdivide each group into two subtypes. Based on these findings, we have drawn decisional flowcharts directing the molecular analysis of LCA genes in a given case. These flowcharts will hopefully lighten the heavy task of genotyping new patients but only if one has access to the most precise clinical history since birth.

Expressiveness improvements of OutSystems DSL query primitives

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Refinement and variability techniques in model transformation of software requirements

Tese de Doutoramento em Tecnologias e Sistemas de Informação

Refinement in hybridised institutions

Hybrid logics, which add to the modal description of transition structures the ability to refer to specific states, offer a generic framework to approach the specification and design of reconfigurable systems, i.e., systems with reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimuli or internal performance measures. A formal representation of such systems is through transition structures whose states correspond to the different configurations they may adopt. Therefore, each node is endowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics of the services provided in the corresponding configuration. This paper characterises equivalence and refinement for these sorts of models in a way which is independent of (or parametric on) whatever logic (propositional, equational, fuzzy, etc) is found appropriate to describe the local configurations. A Hennessy–Milner like theorem is proved for hybridised logics.

Meaning refinement to improve cross-lingual information retrieval

Magdeburg, Univ., Fak. für Informatik, Diss., 2012

Refinement of neuronal networks in the rodent prefrontal cortex and hippocampus : critical impact of early and late social experiences

Weaning, social environment, dendrites, dendritic spines, limbic system