Case Study of Applied LIP Approach/Activities in the Philippines The Training Services Enhancement Project for Rural Life Improvement (TSEP-RLI) Experience

TSEP-RLI was a technical cooperation project jointly conducted by GOP thru DA-Agricultural Training Institute (ATI) and GOJ thru JICA aimed at institutionalizing the training program for Rural Life Improvement (RLI) at the (ATI). As expected, farmers, fisherfolk, women, youth and extension agents were provided with efficient and effective training services from ATI leading to the improvement of quality of life in the rural areas through efforts of human resource development. The ATI- Bohol was chosen as the model center where participatory trials and various activities of the project were undertaken for five years. These activities were participatory surveys and data collection of on-farm and off-farm productive activities; planning workshop for RLI; feedbacking of survey results and action plans to the community and the Local Government Units (LGUs), and signing of Memorandum of Agreement between the Project and participating LGUs. The above activities were done to facilitate the planning and development of most effective and necessary rural life improvement activities, to confirm the willingness of the people to support and participate and to formalize the partnership between the Project and the LGUs. Since the concept of rural life covers a vast range of activities, a consensus had been reached that the total aspects of rural life be grasped in three spheres, namely, Production & Livelihood (P/L), Rural Living Condition (RLC) and Community Environment (C/E). The RLI for Ubi (Yam) Growers was one of the pilot activities undertaken in two pilot barangays and the target beneficiaries were members of the Rural Improvement Club (RIC- a group of organized women) with the LGU of the Municipality of Corella as the implementing partner. During the planning workshop, the barangay residents articulated their desire to promote production and processing of ubi (sphere on P/L - as the entry point), lack of nutritious food was one of the identified problem (sphere on RLC- expansion point) and environmental degradation such as deforestation, and soil erosion was another problem articulated by the community people (sphere on C/E- expansion point). Major activities that were undertaken namely, Ubi cooking contest, cooking/processing seminar, training courses on entrepreneurial development, ubi production and storage technology, packaging and product design, human resource development and simplified bookkeeping motivated the beneficiaries as well as developed and enhanced their skills & capabilities while strengthening their associations. Their participation to the 5 ubi festivals and other related activities had brought some impacts on their economic and rural life improvement activities. The seven principles of TSEP-RLI include the participatory process, holistic approach, dialogical approach, bottom -up training needs assessment, demand-driven approach, cost sharing approach and collaborative implementation with other agencies including LGUs and the community.

Parameterization of applied general equilibrium models with flexible trade specifications based on the Armington, Krugman, and Melitz models

This paper explains how the Armington-Krugman-Melitz supermodel developed by Dixon and Rimmer can be parameterized, and demonstrates that only two kinds of additional information are required in order to extend a standard trade model to include Melitz-type monopolistic competition and heterogeneous firms. Further, it is shown how specifying too much additional information leads to violations of the model constraints, necessitating adjustment and reconciliation of the data. Once a Melitz-type model is parameterized, a Krugman-type model can also be parameterized using the calibrated values in the Melitz-type model without any additional data. Sample code for the General Algebraic Modeling System (GAMS) has also been prepared to promote the innovative supermodel in the AGE community.

Behavioral characteristics of applied general equilibrium models with an Armington-Krugman-Melitz encompassing module

This paper explore how simulation results change with different choice of trade specification, and the strength of preference for traded variety by economic agent differs, utilizing two types of three-region, three-sector AGE model that includes the Armington-Krugman-Melitz Encompassing module based on Dixon and Rimmer (2012). Simulation experiments reveal that: (1) the Melitz-type specification does not always enhance effectiveness of a certain policy change more than the one obtained with the Krugman-type, especially when economic agents' preference for traded variety is not so strong; (2) there are likely to be points where the volumes of effects obtained with the Melitz-type exceed the ones with the Krugman-type; and (3) the preference of the producers, those who are in the sectors that exhibit increasing returns to scale, for traded variety might be the engine of explosive effects as suggested by Fujita, et al. (2000).

Incremental analysis of constraint logic programs

Global analyzers traditionally read and analyze the entire program at once, in a nonincremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a program which has already been analyzed. In these cases, it appears inecient to perform the analysis of the program again from scratch, as needs to be done with current systems. We describe how the xed-point algorithms used in current generic analysis engines for (constraint) logic programming languages can be extended to support incremental analysis. The possible changes to a program are classied into three types: addition, deletion, and arbitrary change. For each one of these, we provide one or more algorithms for identifying the parts of the analysis that must be recomputed and for performing the actual recomputation. The potential benets and drawbacks of these algorithms are discussed. Finally, we present some experimental results obtained with an implementation of the algorithms in the PLAI generic abstract interpretation framework. The results show signicant benets when using the proposed incremental analysis algorithms.

Global analysis of constraint logic programs

This article presents and illustrates a practical approach to the dataow analysis of constraint logic programming languages using abstract interpretation. It is rst argued that from the framework point of view it suces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for exist. This is shown by proposing a simple extension of Bruynooghes traditional framework which allows it to analyze constraint logic programs. Then and using this generalized framework two abstract domains and their required abstract functions are presented the rst abstract domain approximates deniteness information and the second one freeness. Finally an approach for cobining those domains is proposed The two domains and their combination have been implemented and used in the analysis of CLP and Prolog III applications. Results from this implementation showing its performance and accuracy are also presented

Combined static and dynamic assertion-based debugging of constraint logic programs

We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions for expressing properties of programs. We define several assertion schemas for writing (partial) specifications for constraint logic programs using quite general properties, including user-defined programs. The framework is aimed at detecting deviations of the program behavior (symptoms) with respect to the given assertions, either at compile-time (i.e., statically) or run-time (i.e., dynamically). We provide techniques for using information from global analysis both to detect at compile-time assertions which do not hold in at least one of the possible executions (i.e., static symptoms) and assertions which hold for all possible executions (i.e., statically proved assertions). We also provide program transformations which introduce tests in the program for checking at run-time those assertions whose status cannot be determined at compile-time. Both the static and the dynamic checking are provably safe in the sense that all errors flagged are definite violations of the pecifications. Finally, we report briefly on the currently implemented instances of the generic framework.

On the role of semantic approximations in validation and diagnosis of constraint logic programs

Abstract is not available.

An assertion language for constraint logic programs

In an advanced program development environment, such as that discussed in the introduction of this book, several tools may coexist which handle both the program and information on the program in different ways. Also, these tools may interact among themselves and with the user. Thus, the different tools and the user need some way to communicate. It is our design principie that such communication be performed in terms of assertions. Assertions are syntactic objects which allow expressing properties of programs. Several assertion languages have been used in the past in different contexts, mainly related to program debugging. In this chapter we propose a general language of assertions which is used in different tools for validation and debugging of constraint logic programs in the context of the DiSCiPl project. The assertion language proposed is parametric w.r.t. the particular constraint domain and properties of interest being used in each different tool. The language proposed is quite general in that it poses few restrictions on the kind of properties which may be expressed. We believe the assertion language we propose is of practical relevance and appropriate for the different uses required in the tools considered.

The role of computational logic as a hinge paradigm among deduction, problem solving, programming, and parallelism

This paper presents some brief considerations on the role of Computational Logic in the construction of Artificial Intelligence systems and in programming in general. It does not address how the many problems in AI can be solved but, rather more modestly, tries to point out some advantages of Computational Logic as a tool for the AI scientist in his quest. It addresses the interaction between declarative and procedural views of programs (deduction and action), the impact of the intrinsic limitations of logic, the relationship with other apparently competing computational paradigms, and finally discusses implementation-related issues, such as the efficiency of current implementations and their capability for efficiently exploiting existing and future sequential and parallel hardware. The purpose of the discussion is in no way to present Computational Logic as the unique overall vehicle for the development of intelligent systems (in the firm belief that such a panacea is yet to be found) but rather to stress its strengths in providing reasonable solutions to several aspects of the task.

Some design issues in the visualization of constraint logic program execution

Visualization of program executions has been found useful in applications which include education and debugging. However, traditional visualization techniques often fall short of expectations or are altogether inadequate for new programming paradigms, such as Constraint Logic Programming (CLP), whose declarative and operational semantics differ in some crucial ways from those of other paradigms. In particular, traditional ideas regarding flow control and the behavior of data often cannot be lifted in a straightforward way to (C)LP from other families of programming languages. In this paper we discuss techniques for visualizing program execution and data evolution in CLP. We briefly review some previously proposed visualization paradigms, and also propose a number of (to our knowledge) novel ones. The graphical representations have been chosen based on the perceived needs of a programmer trying to analyze the behavior and characteristics of an execution. In particular, we concéntrate on the representation of the program execution behavior (control), the runtime valúes of the variables, and the runtime constraints. Given our interest in visualizing large executions, we also pay attention to abstraction techniques, Le., techniques which are intended to help in reducing the complexity of the visual information.

Survey on integration of Applied Geology and Geomorphology in Civil Engineering curricula in the framework of the European Higher Education Area (EHEA) by using practical trips

The engineer must have sufficient theoretical knowledge to be applied to solve specific problems, with the necessary capacity to simplify these approaches, and taking into account factors such as speed, simplicity, quality and economy. In Geology, its ultimate goal is the exploration of the history of the geological events through observation, deduction, reasoning and, in exceptional cases by the direct underground exploration or experimentation. Experimentation is very limited in Geology. Reproduction laboratory of certain phenomena or geological processes is difficult because both time and space become a large scale. For this reason, some Earth Sciences are in a nearly descriptive stage whereas others closest to the experimental, Geophysics and Geochemistry, have assimilated progress experienced by the physics and chemistry. Thus, Anglo-Saxon countries clearly separate Engineering Geology from Geological Engineering, i.e. Applied Geology to the Geological Engineering concepts. Although there is a big professional overlap, the first one corresponds to scientific approach, while the last one corresponds to a technological one. Applied Geology to Engineering could be defined as the Science and Applied Geology to the design, construction and performance of engineering infrastructures in and field geology discipline. There has been much discussion on the primacy of theory over practice. Today prevails the exaggeration of practice, but you get good workers and routine and mediocre teachers. This idea forgets too that teaching problem is a problem of right balance. The approach of the action lines on the European Higher Education Area (EHEA) framework provides for such balance. Applied Geology subject represents the first real contact with the physical environment with the practice profession and works. Besides, the situation of the topic in the first trace of Study Plans for many students implies the link to other subjects and topics of the career (tunnels, dams, groundwater, roads, etc). This work analyses in depth the justification of such practical trips. It shows the criteria and methods of planning and the result which manifests itself in pupils. Once practical trips experience developed, the objective work tries to know about results and changes on student’s motivation in learning perspective. This is done regardless of the outcome of their knowledge achievements assessed properly and they are not subject to such work. For this objective, it has been designed a survey about their motivation before and after trip. Survey was made by the Unidad Docente de Geología Aplicada of the Departamento de Ingeniería y Morfología del Terreno (Escuela Técnica Superior de Ingenieros de Caminos, Canales y Puertos, Universidad Politécnica de Madrid). It was completely anonymous. Its objective was to collect the opinion of the student as a key agent of learning and teaching of the subject. All the work takes place under new teaching/learning criteria approach at the European framework in Higher Education. The results are exceptionally good with 90% of student’s participation and with very high scores in a number of questions as the itineraries, teachers and visited places (range of 4.5 to 4.2 in a 5 points scale). The majority of students are very satisfied (average of 4.5 in a 5 points scale).