From software extensions to product lines of dataflow programs

Abstract Dataflow programs are widely used. Each program is a directed graph where nodes are computations and edges indicate the flow of data. In prior work, we reverse-engineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations. In MDE-speak, our derivations were PIM-to-PSM mappings. In this paper, we show how extensions complement refinements, optimizations, and PIM-to-PSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable. We explain how optional functionality in transformations can be encoded, thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs. We describe the implementation of extensions in the ReFlO tool and present two non-trivial case studies as evidence of our work’s generality

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.

Dataflow Computation for the J-Machine

The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction- level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a "hybrid'' model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism --- such as among loop iterations. I describe this system and provide an analysis of its strengths and weaknesses and those of the J-Machine, along with ideas for improvement.

Design and Analysis of Optical Interconnection Networks for a Dataflow Parallel Computer

This work shows the design, simulation, and analysis of two optical interconnection networks for a Dataflow parallel computer architecture. To verify the optical interconnection network performance on the Dataflow architecture, we have analyzed the load balancing among the processors during the parallel programs executions. The load balancing is a very important parameter because it is directly associated to the dataflow parallelism degree. This article proves that optical interconnection networks designed with simple optical devices can provide efficiently the dataflow requirements of a high performance communication system.

A practical approach to the global analysis of CLP programs

This paper presents and illustrates with an example a practical approach to the dataflow analysis of programs written in constraint logic programming (CLP) languages using abstract interpretation. It is first argued that, from the framework point of view, it sufnces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for which efncient fixpoint algorithms have been developed. This is shown by proposing a simple but quite general extensión of Bruynooghe's traditional framework to the analysis of CLP programs. In this extensión constraints are viewed not as "suspended goals" but rather as new information in the store, following the traditional view of CLP. Using this approach, and as an example of its use, a complete, constraint system independent, abstract analysis is presented for approximating definiteness information. The analysis is in fact of quite general applicability. It has been implemented and used in the analysis of CLP(R) and Prolog-III applications. Results from the implementation of this analysis are also presented.

Some considerations on the compile-time analysis of constraint logic programs

This paper discusses some issues which arise in the dataflow analysis of constraint logic programming (CLP) languages. The basic technique applied is that of abstract interpretation. First, some types of optimizations possible in a number of CLP systems (including efficient parallelization) are presented and the information that has to be obtained at compile-time in order to be able to implement such optimizations is considered. Two approaches are then proposed and discussed for obtaining this information for a CLP program: one based on an analysis of a CLP metainterpreter using standard Prolog analysis tools, and a second one based on direct analysis of the CLP program. For the second approach an abstract domain which approximates groundness (also referred to as "definiteness") information (i.e. constraint to a single valué) and the related abstraction functions are presented.

Efeito de diferentes protocolos de treinamento sobre o risco cardiovascular global = : Effects of different training programs on global cardiovascular risk

Universidade Estadual de Campinas . Faculdade de Educação Física

Adherence to cervical and breast cancer programs is crucial to improving screening performance

Introduction: Cervical and breast cancer are the most common malignancies among women worldwide. Effective screening can facilitate early detection and dramatically reduce mortality rates. The interface between those screening patients and patients most needing screening is complex, and women in remote areas of rural counties face additional barriers that limit the effectiveness of cancer prevention programs. This study compared various methods to improve compliance with mass screening for breast and cervical cancer among women in a remote, rural region of Brazil. Methods: In 2003, a mobile unit was used to perform 10 156 mammograms and Papanicolaou smear tests for women living in the Barretos County region of Sao Paulo state, Brazil (consisting of 19 neighbouring cities). To reach the women, the following community outreach strategies were used: distribution of flyers and pamphlets; media broadcasts (via radio and car loudspeakers); and community healthcare agents (CHCAs) making home visits. Results: The most useful intervention appeared to be the home visits by healthcare agents or CHCAs. These agents of the Family Health Programme of the Brazilian Ministry of Health reached an average of 45.6% of those screened, with radio advertisements reaching a further 11.9%. The great majority of the screened women were illiterate or had elementary level schooling (80.9%) and were of 'poor' or 'very poor' socioeconomic class (67.2%). Conclusions: Use of a mobile screening unit is a useful strategy in developing countries where local health systems have inadequate facilities for cancer screening in underserved populations. A multimodal approach to community outreach strategies, especially using CHCAs and radio advertisements, can improve the uptake of mass screening in low-income, low-educational background female populations.

Professional development and a discussion of the professional preparation provided by information and library science degree programs in public universities in Madrid, 2000-2005

A study was designed to determine how the degree programs in Information and library science available in 2000-2005 at the public universities of Madrid fit the tabour market needs of their students. The methodology used was the development of a questionnaire addressed to graduates. Although the number of surveys completed is not high (118), the authors believe that the results obtained permit a series of conclusions that may be extrapolated to the entire cohort.

Proposal of a High-Level Language for Writing Self Modifying Programs

This paper proposes a simple high-level programming language, endowed with resources that help encoding self-modifying programs. With this purpose, a conventional imperative language syntax (not explicitly stated in this paper) is incremented with special commands and statements forming an adaptive layer specially designed with focus on the dynamical changes to be applied to the code at run-time. The resulting language allows programmers to easily specify dynamic changes to their own program`s code. Such a language succeeds to allow programmers to effortless describe the dynamic logic of their adaptive applications. In this paper, we describe the most important aspects of the design and implementation of such a language. A small example is finally presented for illustration purposes.

Prerequisite Programs at Schools: Diagnosis and Economic Evaluation

In this study, 20 Brazilian public schools have been assessed regarding good manufacturing practices and standard sanitation operating procedures implementation. We used a checklist comprised of 10 parts ( facilities and installations, water supply, equipments and tools, pest control, waste management, personal hygiene, sanitation, storage, documentation, and training), making a total of 69 questions. The implementing modification cost to the found nonconformities was also determined so that it could work with technical data as a based decision-making prioritization. The average nonconformity percentage at schools concerning to prerequisite program was 36%, from which 66% of them own inadequate installations, 65% waste management, 44% regarding documentation, and 35% water supply and sanitation. The initial estimated cost for changing has been U.S.$24,438 and monthly investments of 1.55% on the currently needed invested values. This would result in U.S.$0.015 increase on each served meal cost over the investment replacement within a year. Thus, we have concluded that such modifications are economically feasible and will be considered on technical requirements when prerequisite program implementation priorities are established.

Print versus website physical activity programs: A randomized trial

Mediated physical activity interventions can reach large numbers of people at low cost. Programs delivered through the mail that target the stage of motivational readiness have been shown to increase activity. Communication technology (websites and e-mail) might provide a means for delivering similar programs. Randomized trial conducted between August and October 2001. Participants included staff at an Australian university (n=655; mean AGE=43, standard deviation, 10 years). Participants were randomized to either an 8-week, stage-targeted print program (Print) or 8-week, stage-targeted website (Web) program. The main outcome was change in self-reported physical activity.

Analysis of Approaches to Controllership in Mater`s Thesis from Post-graduate Programs in Accounting Sciences

The objective of the Study is to analyze approaches in master`s thesis in Brazilian Post-Graduate Programs in Accounting Sciences in relation to Controllership, in terms of their conceptual, procedural and organizational aspects, as proposed by Borinelli (2006). The research is descriptive and it uses a quantitative approach. The sample consists of 26 master`s thesis which have the word ""Controllership"" in their titles. Resulting from analysis, in Perspective I (conceptual aspects), in which the elements of definition, object of study and relationship with other sciences were referenced, consensus among authors of the master`s thesis was not verified. In Perspective II (procedural aspects), which deals with activities and functions of Controllership by means of how they materialize as areas of knowledge within organizations, it was observed that the approach in the master`s thesis is quite differentiated in terms of the scope of activities. In relation to Perspective III (organizational aspects), there is also no consensus about what constitutes typical Controllership activities, but master`s thesis do include in the definition of Controllership the idea that it is a service or function of information. It was concluded that the approach to controllership, in terms of its conceptual, procedural and organizational aspects is similar to the elements proposed by Borinelli (2006).

Customer Perception about Loyalty Programs in Agricultural Market: a case study

This study discusses the use of loyalty programs and Customer perception in, agricultural market. The theoretical review includes relationship marketing, its objectives, dimensions and instruments, and loyalty programs. The method for the empirical part consisted on qualitative research, through a case study conducted at one of the largest crop protection chemical companies in Brazil. The case is representative once this company was pioneer in its segment in adopting the customer relationship management. (CRM) approach to-their clients: It has been a consensus that customer relationship is a tool to amplify the Customer share. This.,is so, due the. increasing competition generated by the entrance of generic products and the retaliation actions adopted by the multinational groups. The case study includes a market overview, a description of the company, its loyalty program, the image of the program from the customer`s perspective, and the main results acquired with the CRM program. The Study also presents some recommendations for-companies that are pursuing strategies to. increase their customer share through loyalty programs.

ANNA: A new prediction method for bioassessment programs

1. Cluster analysis of reference sites with similar biota is the initial step in creating River Invertebrate Prediction and Classification System (RIVPACS) and similar river bioassessment models such as Australian River Assessment System (AUSRIVAS). This paper describes and tests an alternative prediction method, Assessment by Nearest Neighbour Analysis (ANNA), based on the same philosophy as RIVPACS and AUSRIVAS but without the grouping step that some people view as artificial. 2. The steps in creating ANNA models are: (i) weighting the predictor variables using a multivariate approach analogous to principal axis correlations, (ii) calculating the weighted Euclidian distance from a test site to the reference sites based on the environmental predictors, (iii) predicting the faunal composition based on the nearest reference sites and (iv) calculating an observed/expected (O/E) analogous to RIVPACS/AUSRIVAS. 3. The paper compares AUSRIVAS and ANNA models on 17 datasets representing a variety of habitats and seasons. First, it examines each model's regressions for Observed versus Expected number of taxa, including the r(2), intercept and slope. Second, the two models' assessments of 79 test sites in New Zealand are compared. Third, the models are compared on test and presumed reference sites along a known trace metal gradient. Fourth, ANNA models are evaluated for western Australia, a geographically distinct region of Australia. The comparisons demonstrate that ANNA and AUSRIVAS are generally equivalent in performance, although ANNA turns out to be potentially more robust for the O versus E regressions and is potentially more accurate on the trace metal gradient sites. 4. The ANNA method is recommended for use in bioassessment of rivers, at least for corroborating the results of the well established AUSRIVAS- and RIVPACS-type models, if not to replace them.