Evaluation of the relationship between education and sustainability in peasant movements: The experience of the National Education Program in Agrarian Reform

Brazil is one of the largest agricultural producers in the world. However, its agrarian composition is based on two markedly different production models, particularly in relation to sustainability: a peasant family agriculture, which plays an important role in food production for domestic consumption and advocates agro-ecological practises; and agribusiness, the politically and economically hegemonic model that produces commodities for export based on monoculture and intensive use of pesticides. Therefore, in order to create the means to develop peasant lands, social movements and peasants have engaged themselves politically and defended an education model grounded in sustainable practises of production and social organisation. Taking this into account, the main purpose of this paper is to analyse and assess the Brazilian experience of integration between education and sustainability, in the National Education Program in Agrarian Reform (PRONERA). To accomplish this aim, a survey with a semi-structured questionnaire was carried out among teachers, students, monitors, and coordinators of the course offered by PRONERA. The surveys showed that the courses are promoting the concepts of sustainability among peasants. However, many adjustments need to be taken into consideration during the planning process for the next courses offered by PRONERA.

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

A heuristic method for reactive power planning

An approach for solving reactive power planning problems is presented, which is based on binary search techniques and the use of a special heuristic to obtain a discrete solution. Two versions were developed, one to run on conventional (sequential) computers and the other to run on a distributed memory (hypercube) machine. This latter parallel processing version employs an asynchronous programming model. Once the set of candidate buses has been defined, the program gives the location and size of the reactive sources needed(if any) in keeping with operating and security constraints.

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

Barriers related to non-adherence in a mammography breast-screening program during the implementation period in the interior of São Paulo State, Brazil

Mammography is the best exam for early diagnosis of breast cancer. Developing countries frequently have a low income of mammography and absence of organized screening. The knowledge of vulnerable population and strategies to increase adherence are important to improve the implementation of an organized breast-screening program. A mammography regional-screening program was implemented in a place around 54.238 women, aged 40-69 years old. It was proposed to perform biannual mammography free of cost for the women. We analyze the first 2 years of the implementation of the project. Mammography was realized in 17.964 women. 42.1% of the women hadn't done de mammography in their lives and these women were principally from low socio-economic status (OR=2.99), low education (OR=3.00). The best strategies to include these women were mobile unit (OR=1.43) and Family Health Program (OR=1.79). The incidence of early breast tumors before the project was 14.5%, a fact that changed to 43.2% in this phase. Multivariate analysis showed that the association of illiterate and the mobile unit achieve more women who had not performed mammography in their lives. The strategies to increase adherence to mammography must be multiple and a large organization is necessary to overpass the barriers related to system health and education.