Generalizing repeating patterns: a study with children aged four

This paper presents part of a study that aimed to understand how the emergence of algebraic thinking takes place in a group of four-year-old children, as well as its relationship to the exploration of children‘s literature. To further deepen and guide this study the following research questions were formulated: (1) How can children's literature help preschoolers identify patterns?; (2) What strategies and thinking processes do children use to create, analyze and generalize repeating and growing patterns?; (3) What strategies do children use to identify the unit of repeat of a pattern? and (4) What factors influence the identification of patterns? The paper focuses only on the strategies and thinking processes that children use to create, analyze and generalize repeating patterns. The present study was developed with a group of 14 preschoolers in a private school in Lisbon, and it was carried out with all children. In order to develop the research, a qualitative research methodology under the interpretive paradigm was chosen, emphasizing meanings and processes. The researcher took the dual role of teacher-researcher, conducting the study with her own group and in her own natural environment. Participant observation and document analysis (audio and video recordings, photos and children productions) were used as data collection methods. Data collection took place from October 2013 to April 2014. The results of the study indicate that children master the concept of repeating patterns, and they are able to identify the unit of repeat, create and analyze various repeating patterns, evolving from simpler to more complex forms.

A parallel programming model for ada

Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone. To take advantage of multi-core processors, parallel programming models are proposed as promising solutions for more effectively using multi-core processors. This paper discusses some of the existent models and frameworks for parallel programming, leading to outline a draft parallel programming model for Ada.

Pattern operators for grid

The definition and programming of distributed applications has become a major research issue due to the increasing availability of (large scale) distributed platforms and the requirements posed by the economical globalization. However, such a task requires a huge effort due to the complexity of the distributed environments: large amount of users may communicate and share information across different authority domains; moreover, the “execution environment” or “computations” are dynamic since the number of users and the computational infrastructure change in time. Grid environments, in particular, promise to be an answer to deal with such complexity, by providing high performance execution support to large amount of users, and resource sharing across different organizations. Nevertheless, programming in Grid environments is still a difficult task. There is a lack of high level programming paradigms and support tools that may guide the application developer and allow reusability of state-of-the-art solutions. Specifically, the main goal of the work presented in this thesis is to contribute to the simplification of the development cycle of applications for Grid environments by bringing structure and flexibility to three stages of that cycle through a commonmodel. The stages are: the design phase, the execution phase, and the reconfiguration phase. The common model is based on the manipulation of patterns through pattern operators, and the division of both patterns and operators into two categories, namely structural and behavioural. Moreover, both structural and behavioural patterns are first class entities at each of the aforesaid stages. At the design phase, patterns can be manipulated like other first class entities such as components. This allows a more structured way to build applications by reusing and composing state-of-the-art patterns. At the execution phase, patterns are units of execution control: it is possible, for example, to start or stop and to resume the execution of a pattern as a single entity. At the reconfiguration phase, patterns can also be manipulated as single entities with the additional advantage that it is possible to perform a structural reconfiguration while keeping some of the behavioural constraints, and vice-versa. For example, it is possible to replace a behavioural pattern, which was applied to some structural pattern, with another behavioural pattern. In this thesis, besides the proposal of the methodology for distributed application development, as sketched above, a definition of a relevant set of pattern operators was made. The methodology and the expressivity of the pattern operators were assessed through the development of several representative distributed applications. To support this validation, a prototype was designed and implemented, encompassing some relevant patterns and a significant part of the patterns operators defined. This prototype was based in the Triana environment; Triana supports the development and deployment of distributed applications in the Grid through a dataflow-based programming model. Additionally, this thesis also presents the analysis of a mapping of some operators for execution control onto the Distributed Resource Management Application API (DRMAA). This assessment confirmed the suitability of the proposed model, as well as the generality and flexibility of the defined pattern operators

A framework for programming sensor networks with scheduling and resource-sharing optimizations

Several projects in the recent past have aimed at promoting Wireless Sensor Networks as an infrastructure technology, where several independent users can submit applications that execute concurrently across the network. Concurrent multiple applications cause significant energy-usage overhead on sensor nodes, that cannot be eliminated by traditional schemes optimized for single-application scenarios. In this paper, we outline two main optimization techniques for reducing power consumption across applications. First, we describe a compiler based approach that identifies redundant sensing requests across applications and eliminates those. Second, we cluster the radio transmissions together by concatenating packets from independent applications based on Rate-Harmonized Scheduling.

sMapReduce: a programming pattern for wireless sensor networks

Wireless Sensor Networks (WSNs) are increasingly used in various application domains like home-automation, agriculture, industries and infrastructure monitoring. As applications tend to leverage larger geographical deployments of sensor networks, the availability of an intuitive and user friendly programming abstraction becomes a crucial factor in enabling faster and more efficient development, and reprogramming of applications. We propose a programming pattern named sMapReduce, inspired by the Google MapReduce framework, for mapping application behaviors on to a sensor network and enabling complex data aggregation. The proposed pattern requires a user to create a network-level application in two functions: sMap and Reduce, in order to abstract away from the low-level details without sacrificing the control to develop complex logic. Such a two-fold division of programming logic is a natural-fit to typical sensor networking operation which makes sensing and topological modalities accessible to the user.

Design and implementation of a behaviorally typed programming system for web services

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática.

Direct search optimization application programming interface with remote access

Search Optimization methods are needed to solve optimization problems where the objective function and/or constraints functions might be non differentiable, non convex or might not be possible to determine its analytical expressions either due to its complexity or its cost (monetary, computational, time,...). Many optimization problems in engineering and other fields have these characteristics, because functions values can result from experimental or simulation processes, can be modelled by functions with complex expressions or by noise functions and it is impossible or very difficult to calculate their derivatives. Direct Search Optimization methods only use function values and do not need any derivatives or approximations of them. In this work we present a Java API that including several methods and algorithms, that do not use derivatives, to solve constrained and unconstrained optimization problems. Traditional API access, by installing it on the developer and/or user computer, and remote API access to it, using Web Services, are also presented. Remote access to the API has the advantage of always allow the access to the latest version of the API. For users that simply want to have a tool to solve Nonlinear Optimization Problems and do not want to integrate these methods in applications, also two applications were developed. One is a standalone Java application and the other a Web-based application, both using the developed API.

A Java expression evaluator for nonlinear programming

Finding the optimal value for a problem is usual in many areas of knowledge where in many cases it is needed to solve Nonlinear Optimization Problems. For some of those problems it is not possible to determine the expression for its objective function and/or its constraints, they are the result of experimental procedures, might be non-smooth, among other reasons. To solve such problems it was implemented an API contained methods to solve both constrained and unconstrained problems. This API was developed to be used either locally on the computer where the application is being executed or remotely on a server. To obtain the maximum flexibility both from the programmers’ and users’ points of view, problems can be defined as a Java class (because this API was developed in Java) or as a simple text input that is sent to the API. For this last one to be possible it was also implemented on the API an expression evaluator. One of the drawbacks of this expression evaluator is that it is slower than the Java native code. In this paper it is presented a solution that combines both options: the problem can be expressed at run-time as a string of chars that are converted to Java code, compiled and loaded dynamically. To wide the target audience of the API, this new expression evaluator is also compatible with the AMPL format.

Web-based application programming interface to solve nonlinear optimization problems

Nonlinear Optimization Problems are usual in many engineering fields. Due to its characteristics the objective function of some problems might not be differentiable or its derivatives have complex expressions. There are even cases where an analytical expression of the objective function might not be possible to determine either due to its complexity or its cost (monetary, computational, time, ...). In these cases Nonlinear Optimization methods must be used. An API, including several methods and algorithms to solve constrained and unconstrained optimization problems was implemented. This API can be accessed not only as traditionally, by installing it on the developer and/or user computer, but it can also be accessed remotely using Web Services. As long as there is a network connection to the server where the API is installed, applications always access to the latest API version. Also an Web-based application, using the proposed API, was developed. This application is to be used by users that do not want to integrate methods in applications, and simply want to have a tool to solve Nonlinear Optimization Problems.

Prescription, dispensation and marketing patterns of methylphenidate

OBJECTIVE To analyze the patterns and legal requirements of methylphenidate consumption. METHODS We conducted a cross-sectional study of the data from prescription notification forms and balance lists of drugs sales – psychoactive and others – subject to special control in the fifth largest city of Brazil, in 2006. We determined the defined and prescribed daily doses, the average prescription and dispensation periods, and the regional sales distribution in the municipality. In addition, we estimated the costs of drug acquisition and analyzed the individual drug consumption profile using the Lorenz curve. RESULTS The balance lists data covered all notified sales of the drug while data from prescription notification forms covered 50.6% of the pharmacies that sold it, including those with the highest sales volumes. Total methylphenidate consumption was 0.37 DDD/1,000 inhabitants/day. Sales were concentrated in more developed areas, and regular-release tablets were the most commonly prescribed pharmaceutical formulation. In some regions of the city, approximately 20.0% of the prescriptions and dispensation exceeded 30 mg/day and 30 days of treatment. CONCLUSIONS Methylphenidate was widely consumed in the municipality and mainly in the most developed areas. Of note, the consumption of formulations with the higher abuse risk was the most predominant. Both its prescription and dispensation contrasted with current pharmacotherapeutic recommendations and legal requirements. Therefore, the commercialization of methylphenidate should be monitored more closely, and its use in the treatment of behavioral changes of psychological disorders needs to be discussed in detail, in line with the concepts of the quality use of medicines.

Type System for the ComponentJ Programming Language

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Informática.

Dietary patterns in pregnancy and birth weight

OBJECTIVE To analyze if dietary patterns during the third gestational trimester are associated with birth weight.METHODS Longitudinal study conducted in the cities of Petropolis and Queimados, Rio de Janeiro (RJ), Southeastern Brazil, between 2007 and 2008. We analyzed data from the first and second follow-up wave of a prospective cohort. Food consumption of 1,298 pregnant women was assessed using a semi-quantitative questionnaire about food frequency. Dietary patterns were obtained by exploratory factor analysis, using the Varimax rotation method. We also applied the multivariate linear regression model to estimate the association between food consumption patterns and birth weight.RESULTS Four patterns of consumption – which explain 36.4% of the variability – were identified and divided as follows: (1) prudent pattern (milk, yogurt, cheese, fruit and fresh-fruit juice, cracker, and chicken/beef/fish/liver), which explained 14.9% of the consumption; (2) traditional pattern, consisting of beans, rice, vegetables, breads, butter/margarine and sugar, which explained 8.8% of the variation in consumption; (3) Western pattern (potato/cassava/yams, macaroni, flour/farofa/grits, pizza/hamburger/deep fried pastries, soft drinks/cool drinks and pork/sausages/egg), which accounts for 6.9% of the variance; and (4) snack pattern (sandwich cookie, salty snacks, chocolate, and chocolate drink mix), which explains 5.7% of the consumption variability. The snack dietary pattern was positively associated with birth weight (β = 56.64; p = 0.04) in pregnant adolescents.CONCLUSIONS For pregnant adolescents, the greater the adherence to snack pattern during pregnancy, the greater the baby’s birth weight.

Spatial patterns of leprosy in a hyperendemic state in Northern Brazil, 2001-2012

ABSTRACT OBJECTIVE To describe the spatial patterns of leprosy in the Brazilian state of Tocantins. METHODS This study was based on morbidity data obtained from the Sistema de Informações de Agravos de Notificação (SINAN – Brazilian Notifiable Diseases Information System), of the Ministry of Health. All new leprosy cases in individuals residing in the state of Tocantins, between 2001 and 2012, were included. In addition to the description of general disease indicators, a descriptive spatial analysis, empirical Bayesian analysis and spatial dependence analysis were performed by means of global and local Moran’s indexes. RESULTS A total of 14,542 new cases were recorded during the period under study. Based on the annual case detection rate, 77.0% of the municipalities were classified as hyperendemic (> 40 cases/100,000 inhabitants). Regarding the annual case detection rate in < 15 years-olds, 65.4% of the municipalities were hyperendemic (10.0 to 19.9 cases/100,000 inhabitants); 26.6% had a detection rate of grade 2 disability cases between 5.0 and 9.9 cases/100,000 inhabitants. There was a geographical overlap of clusters of municipalities with high detection rates in hyperendemic areas. Clusters with high disease risk (global Moran’s index: 0.51; p < 0.001), ongoing transmission (0.47; p < 0.001) and late diagnosis (0.44; p < 0.001) were identified mainly in the central-north and southwestern regions of Tocantins. CONCLUSIONS We identified high-risk clusters for transmission and late diagnosis of leprosy in the Brazilian state of Tocantins. Surveillance and control measures should be prioritized in these high-risk municipalities.

Living bacteria rheology: Population growth, aggregation patterns, and collective behaviour under diferente shear flows

The activity of growing living bacteria was investigated using real-time and in situ rheology-in stationary and oscillatory shear. Two different strains of the human pathogen Staphylococcus aureus-strain COL and its isogenic cell wall autolysis mutant, RUSAL9-were considered in this work. For low bacteria density, strain COL forms small clusters, while the mutant, presenting deficient cell separation, forms irregular larger aggregates. In the early stages of growth, when subjected to a stationary shear, the viscosity of the cultures of both strains increases with the population of cells. As the bacteria reach the exponential phase of growth, the viscosity of the cultures of the two strains follows different and rich behaviors, with no counterpart in the optical density or in the population's colony-forming units measurements. While the viscosity of strain COL culture keeps increasing during the exponential phase and returns close to its initial value for the late phase of growth, where the population stabilizes, the viscosity of the mutant strain culture decreases steeply, still in the exponential phase, remains constant for some time, and increases again, reaching a constant plateau at a maximum value for the late phase of growth. These complex viscoelastic behaviors, which were observed to be shear-stress-dependent, are a consequence of two coupled effects: the cell density continuous increase and its changing interacting properties. The viscous and elastic moduli of strain COL culture, obtained with oscillatory shear, exhibit power-law behaviors whose exponents are dependent on the bacteria growth stage. The viscous and elastic moduli of the mutant culture have complex behaviors, emerging from the different relaxation times that are associated with the large molecules of the medium and the self-organized structures of bacteria. Nevertheless, these behaviors reflect the bacteria growth stage.

Consistent state software transactional memory

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática