137 resultados para Scenario-based problem solving
Resumo:
We present an educational proposal for the study of combinatorial reasoning and calculation of probabilities based on a game and problem solving methodology, aiming to support the teaching of mathematical content. A review of the literature related to the teaching and learning of the concepts of combinatorial reasoning and probability is presented. The game is original, using a board game similar to Tic-tac-toe, and the movements of its parts have some similarities, in particular those made with the rook and pawn pieces of the game of chess. We formulate various activities (problems) involving the game which, in the process of solving them, using the problem solving methodology and with the appropriate intervention of the teacher, encourage students to develop strategies for counting, an indispensable tool in the initial study of Combinatorial Analysis and Calculation of Probabilities.
Resumo:
We present in this paper a pedagogical-didactic proposal for the teaching of Laplace Probability. The starting point for building the concept of probability is a game situation associated with the methodology of problem-solving. The theoretical reference for the concept of game is constructivist teaching of mathematics. Mathematical knowledge is constructed based on problems that generate new concepts and / or new content. The proposed game is original. Our proposal can be used both in the last cycle of basic education but also in high school, and may inform the practice of teachers who teach basic concepts of probability.
Resumo:
Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve TEP problem. In this paper a modified constructive heuristic algorithm (CHA) is proposed for solving such a crucial problem. Most of research papers handle TEP problem by linearization of the non-linear mathematical model while in this research TEP problem is solved via CHA using non-linear model. The proposed methodology is based upon Garver's algorithm capable of applying to a DC model. Simulation studies and tests results on the well known transmission network such as: Garver and IEEE 24-bus systems are carried out to show the significant performance as well as the effectiveness of the proposed algorithm. © 2011 IEEE.
Resumo:
Different from the first attempts to solve the image categorization problem (often based on global features), recently, several researchers have been tackling this research branch through a new vantage point - using features around locally invariant interest points and visual dictionaries. Although several advances have been done in the visual dictionaries literature in the past few years, a problem we still need to cope with is calculation of the number of representative words in the dictionary. Therefore, in this paper we introduce a new solution for automatically finding the number of visual words in an N-Way image categorization problem by means of supervised pattern classification based on optimum-path forest. © 2011 IEEE.
Resumo:
We discuss the knowledge that has been constructed regarding Problem Solving in Math Education as a result of research developed by GTERP - Work and Study Group in Problem Solving, UNESP-Rio Claro/SP. The research is guided by the following general questions: How do students construct mathematical knowledge and how do teachers implement the methodology of Math Teaching-Learning-Evaluation through Problem Solving? Historical aspects of Problem Solving are very important in the configuration of the current trends for Problem Solving. One of them is the Methodology of Math Teaching-Learning- Evaluation through Problem Solving, based on clear foundations and an approach of renewal. In addition to that methodology, two aspects have been developed by the group: The conception of Math as a science of pattern and order and Discrete Mathematics. The knowledge constructed and the scientific production of GTERP prove its relevant contribution to intensifying dialogues between research and educational practice, students and teachers, and to increasing the possibilities of that practice particularly in Math work.
Resumo:
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.
Resumo:
The aim was to identify the perception of Oral Health Planning (OHP) of basic care (BC) dental surgeons (DSs) in João Pessoa, Paraíba State, Brazil. Seventeen BC DSs from João Pessoa were interviewed. A qualitative analysis was performed using the Discourse of the Collective Subject (DCS) methodology. DCS obtained: Impact - My work is effective when the user's need remains at the BC. Social Control - The population participates in the organization of promotional activities, but I think it doesn't have enough maturity to opine on OHP. OHP Basis and Organization - The OHP has a diverse organization and is based on user needs. It can be concluded that the knowledge of the DSs on OHP is varied. There is limited understanding about problem-solving. Social control is considered incipient and weak. It is understood that the organization of the local OHP assumes a diverse character and should be based on user demands.
Resumo:
Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the bats behaviour, which has never been applied to this context so far. The wrapper approach combines the power of exploration of the bats together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in five public datasets have demonstrated that the proposed approach can outperform some well-known swarm-based techniques. © 2012 IEEE.
Resumo:
Goal Programming (GP) is an important analytical approach devised to solve many realworld problems. The first GP model is known as Weighted Goal Programming (WGP). However, Multi-Choice Aspirations Level (MCAL) problems cannot be solved by current GP techniques. In this paper, we propose a Multi-Choice Mixed Integer Goal Programming model (MCMI-GP) for the aggregate production planning of a Brazilian sugar and ethanol milling company. The MC-MIGP model was based on traditional selection and process methods for the design of lots, representing the production system of sugar, alcohol, molasses and derivatives. The research covers decisions on the agricultural and cutting stages, sugarcane loading and transportation by suppliers and, especially, energy cogeneration decisions; that is, the choice of production process, including storage stages and distribution. The MCMIGP allows decision-makers to set multiple aspiration levels for their problems in which the more/higher, the better and the less/lower, the better in the aspiration levels are addressed. An application of the proposed model for real problems in a Brazilian sugar and ethanol mill was conducted; producing interesting results that are herein reported and commented upon. Also, it was made a comparison between MCMI GP and WGP models using these real cases. © 2013 Elsevier Inc.
Resumo:
Pós-graduação em Educação - IBRC
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Educação Matemática - IGCE
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Educação Matemática - IGCE
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)