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.

Immunological changes after cancer treatment and participation in an exercise program

Purpose: The purpose of this investigation was to evaluate the impact of undertaking peripheral blood stem cell transplantation (PBST) on T-cell number and function, and to determine the role of a mixed type, moderate intensity exercise program in facilitating the recovery of T-cell number and function. Methods: Immunological measures of white blood cell, lymphocyte, CD3(+), CD4(+), and CD8(+) counts, and CD3(+) cell function were assessed pretransplant (PI), immediately posttransplant (PII), and 1 month (II), 2 months (12) and 3 months (PIII) posttransplant. After PII, 12 patients were divided equally into a control group (CG) or exercise intervention group (EG). Results: Lower total T-cell, helper T-cell, and suppressor T-cell counts (P < 0.01), as well as lower T-cell function (P < 0.01), when compared with normative data, were found at PI. More specifically, 88% of the group had CD3(+), CD4(+), and CD8(+) counts that were more than 40%, 20%, and 50% below normal at PI, respectively. Undertaking a PBST caused further adverse changes to the total leukocyte, lymphocyte, CD3(+), CD4(+) and CD8(+) count. and the helper/suppressor ratio. Although CD8(+) counts had returned to normal by PIII, CD3(+), CD4(+), and the CD4(+)/CD8(+) ratio remained significantly lower than normative data (P < 0.01), with 66%, 100%, and 100% of the subject group reporting counts and ratios, respectively, below the normal range. Conclusion: The PBST patients were immunocompromised before undertaking the transplant, and the transplant procedure imposed further adverse changes to the leukocyte and lymphocyte counts. The leukocyte and CD8(+) counts returned to normal within 3 months posttransplant; however, the other immunological parameters assessed demonstrated a delayed recovery. Although participation in the exercise program did not facilitate a faster immune cell recovery, neither did the exercise program hinder or delay recovery.

API documentation with executable examples

The rise of component-based software development has created an urgent need for effective application program interface (API) documentation. Experience has shown that it is hard to create precise and readable documentation. Prose documentation can provide a good overview but lacks precision. Formal methods offer precision but the resulting documentation is expensive to develop. Worse, few developers have the skill or inclination to read formal documentation. We present a pragmatic solution to the problem of API documentation. We augment the prose documentation with executable test cases, including expected outputs, and use the prose plus the test cases as the documentation. With appropriate tool support, the test cases are easy to develop and read. Such test cases constitute a completely formal, albeit partial, specification of input/output behavior. Equally important, consistency between code and documentation is demonstrated by running the test cases. This approach provides an attractive bridge between formal and informal documentation. We also present a tool that supports compact and readable test cases; and generation of test drivers and documentation, and illustrate the approach with detailed case studies. (C) 2002 Elsevier Science Inc. All rights reserved.

Document retrieval for e-mail search and discovery using Formal Concept Analysis

This paper discusses a document discovery tool based on Conceptual Clustering by Formal Concept Analysis. The program allows users to navigate e-mail using a visual lattice metaphor rather than a tree. It implements a virtual. le structure over e-mail where files and entire directories can appear in multiple positions. The content and shape of the lattice formed by the conceptual ontology can assist in e-mail discovery. The system described provides more flexibility in retrieving stored e-mails than what is normally available in e-mail clients. The paper discusses how conceptual ontologies can leverage traditional document retrieval systems and aid knowledge discovery in document collections.

Methodologies for calibration and predictive analysis of a watershed model

The use of a fitted parameter watershed model to address water quantity and quality management issues requires that it be calibrated under a wide range of hydrologic conditions. However, rarely does model calibration result in a unique parameter set. Parameter nonuniqueness can lead to predictive nonuniqueness. The extent of model predictive uncertainty should be investigated if management decisions are to be based on model projections. Using models built for four neighboring watersheds in the Neuse River Basin of North Carolina, the application of the automated parameter optimization software PEST in conjunction with the Hydrologic Simulation Program Fortran (HSPF) is demonstrated. Parameter nonuniqueness is illustrated, and a method is presented for calculating many different sets of parameters, all of which acceptably calibrate a watershed model. A regularization methodology is discussed in which models for similar watersheds can be calibrated simultaneously. Using this method, parameter differences between watershed models can be minimized while maintaining fit between model outputs and field observations. In recognition of the fact that parameter nonuniqueness and predictive uncertainty are inherent to the modeling process, PEST's nonlinear predictive analysis functionality is then used to explore the extent of model predictive uncertainty.

Portal do software p??blico brasileiro

O Portal do Software P??blico Brasileiro consolida-se como uma iniciativa que conseguiu criar um ambiente comum para compartilhar solu????es de software no setor p??blico, racionalizar a gest??o dos recursos de inform??tica, reaproveitar as solu????es de software existentes para diminuir custos e atividades redundantes, estabelecer parcerias e a????es cooperadas, refor??ar a pol??tica p??blica de estimular o uso de software livre e definir uma forma de licenciamento de software que sustente o compartilhamento de solu????es entre os ??rg??os do setor p??blico de acordo com as prerrogativas legais brasileiras e a Constitui????o Federal. Esta iniciativa trouxe como inova????o o compartilhamento de ???software p??blico???, que oficializou um novo modelo de licenciamento e de gest??o das solu????es desenvolvidas na administra????o p??blica, estabelecendo parceria entre diversos ??rg??os, institui????es, empresas e cidad??os, e hoje conta com mais de 100 mil participantes

Genetic divergence in cocoa progenies for backcrossing program to witches' broom disease resistance

Backcrossing has been little used in cacao breeding, particularly due to the long time required to transfer genes and recover the genetic background of the recurrent parent. The objective of this study was to select individuals, resulting from the backcross CEPEC-42 x SIC-19, genetically related to the recurrent parent SIC-19 by using RAPD molecular markers, among those with resistance to witches' broom. Of the 31 plants that clustered with SIC-19, 18 from the replanted material remained free of the disease in the field, with good vegetative aspect and, therefore can be used for backcross to reach the desired objective.

Uso do software Estradas para determinação do espaçamento entre desaguadouros em estradas não pavimentadas do interior de Goiás

Estradas não pavimentadas correspondem a aproximadamente 90% da malha rodoviária brasileira. Estas, na maioria das vezes, são construídas sem a realização de estudos prévios, estando sujeitas a vários tipos de problemas. Um dos principais fatores de deterioração dessas vias é a ineficiência do sistema de drenagem. Neste trabalho simulou-se o espaçamento entre desaguadouros em estradas não pavimentadas, utilizando-se um software desenvolvido com base num modelo matemático de dimensionamento de sistemas de drenagem em estradas não pavimentadas. Utilizaram-se valores de erodibilidade, tensão crítica de cisalhamento e massa específica para diferentes solos de estradas, localizadas no Estado de Goiás. Simularam-se cenários considerando alterações na declividade (1, 5, 10 e 15%) e na seção transversal do canal com relações entre altura e largura de 1:1, 1:2, 1:5 e 1:10. O modelo respondeu sensivelmente às alterações na declividade, na seção transversal do canal e nas de resistência do solo. Os espaçamentos obtidos indicaram que, estradas com declividades inferiores a 5%, mesmo com elevados valores de erodibilidade permitiram espaçamentos viáveis em aspectos construtivos. No entanto, para as declividades de 10 e 15%, os espaçamentos, na maioria dos casos, apresentaram dimensões reduzidas, tornando-se impraticáveis, sendo necessário, nestes casos, proteção do canal ou alteração de suas características hidráulicas.

GUIsurfer: A Reverse Engineering Framework for User Interface Software

GUIsurfer: A Reverse Engineering Framework for User Interface Software

Component identification through program slicing

This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic code. An associated tool is also introduced. This piece of research is part of a broader project on program understanding and re-engineering of legacy code supported by formal methods

Higher-order lazy functional slicing

Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, and corresponding tools, target either the imperative or the object oriented paradigms, where program slices are computed with respect to a variable or a program statement. Taking a complementary point of view, this paper focuses on the slicing of higher-order functional programs under a lazy evaluation strategy. A prototype of a Haskell slicer, built as proof-of-concept for these ideas, is also introduced

COORDINSPECTOR: a tool for extracting coordination data from legacy code

More and more current software systems rely on non trivial coordination logic for combining autonomous services typically running on different platforms and often owned by different organizations. Often, however, coordination data is deeply entangled in the code and, therefore, difficult to isolate and analyse separately. COORDINSPECTOR is a software tool which combines slicing and program analysis techniques to isolate all coordination elements from the source code of an existing application. Such a reverse engineering process provides a clear view of the actually invoked services as well as of the orchestration patterns which bind them together. The tool analyses Common Intermediate Language (CIL) code, the native language of Microsoft .Net Framework. Therefore, the scope of application of COORDINSPECTOR is quite large: potentially any piece of code developed in any of the programming languages which compiles to the .Net Framework. The tool generates graphical representations of the coordination layer together and identifies the underlying business process orchestrations, rendering them as Orc specifications

On the discovery of business processes orchestration patterns

COORDINSPECTOR is a Software Tool aiming at extracting the coordination layer of a software system. Such a reverse engineering process provides a clear view of the actually invoked services as well as the logic behind such invocations. The analysis process is based on program slicing techniques and the generation of, System Dependence Graphs and Coordination Dependence Graphs. The tool analyzes Common Intermediate Language (CIL), the native language of the Microsoft .Net Framework, thus making suitable for processing systems developed in any .Net Framework compilable language. COORDINSPECTOR generates graphical representations of the coordination layer together with business process orchestrations specified in WSBPEL 2.0

Discovering coordination patterns

A large and growing amount of software systems rely on non-trivial coordination logic for making use of third party services or components. Therefore, it is of outmost importance to understand and capture rigorously this continuously growing layer of coordination as this will make easier not only the veri cation of such systems with respect to their original speci cations, but also maintenance, further development, testing, deployment and integration. This paper introduces a method based on several program analysis techniques (namely, dependence graphs, program slicing, and graph pattern analysis) to extract coordination logic from legacy systems source code. This process is driven by a series of pre-de ned coordination patterns and captured by a special purpose graph structure from which coordination speci cations can be generated in a number of di erent formalisms

Slicing for architectural analysis

Current software development often relies on non-trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such a coordination layer is strongly woven within the application at source code level. Therefore, its precise identification becomes a major methodological (and technical) problem and a challenge to any program understanding or refactoring process. The approach introduced in this paper resorts to slicing techniques to extract coordination data from source code. Such data are captured in a specific dependency graph structure from which a coordination model can be recovered either in the form of an Orc specification or as a collection of code fragments corresponding to the identification of typical coordination patterns in the system. Tool support is also discussed