Combining artificial intelligence and human problem solving: Proposing a new architecture for ITS's

This paper shows a comparative study between the Artificial Intelligence Problem Solving and the Human Problem Solving. The study is based on the solution by many ways of problems proposed via multiple-choice questions. General techniques used by humans to solve this kind of problems are grouped in blocks and each block is divided in steps. A new architecture for ITS - Intelligent Tutoring System is proposed to support experts' knowledge representation and novices' activities. Problems are represented by a text and feasible answers with particular meaning and form, to be rigorously analyzed by the solver to find the right one. Paths through a conceptual space of states represent each right solution.

Pesquisa em Resolução de Problemas: caminhos, avanços e novas perspectivas

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.

Inteligência artificial e teoria de resolução de problemas

Este artigo é uma tentativa de delinear as principais características da pesquisa numa nova área de estudos a chamada Inteligência Artificial (AI). Os itens 1 e 2 constituem um rápido histórico da AI e seus pressupostos básicos. O item 3 trata da teoria de resolução de problemas, desenvolvida por A. Newell e H. Simon. O item 4 procura mostrar a relevância da AI para a Filosofia, em especial para a filosofia da Mente e para a Teoria do Conhecimento.

Modelo operacional do estudo de caso como estratégia de ensino na disciplina de enfermagem médico-cirúrgica: avaliação dos alunos

O estudo trata-se de uma pesquisa descritiva, com o objetivo de avaliar as contribuições e dificuldades sentidas pelos alunos, na utilização do Modelo Operacional do Estudo de Caso, proposto pelas autoras como uma das estratégias de ensino utilizada pela disciplina de Enfermagem Médico-Cirúrgica. Para instrumentalizar e operacionalizar a análise de conteúdo das respostas concedidas pelos alunos, utilizamos da análise temática, segundo Bardin. Com a realização desta investigação concluímos que os alunos reconhecem o modelo como estratégia de ensino na formação dos mesmos, principalmente, quanto ao conhecimento teórico-prático da assistência (70%) que este oferece, estimulando-os à autonomia na tomada de decisões e solução de problemas na área, além de incentivá-los na utilização do acervo da biblioteca. A outra contribuição está relacionada ao conhecimento referente à metodologia científica (30%), onde o modelo emerge a eles como uma estratégia de iniciação a esta atividade. As dificuldades sentidas pelos alunos na elaboração do estudo de caso ocorreram nas seguintes etapas: - no levantamento bibliográfico (58%), principalmente, quanto a falta de bibliografia específica e recente na área de enfermagem e ao não acesso dos alunos da graduação aos índices informatizados: - na redação do trabalho(27%), porém ao mesmo tempo revelando que o estudo de caso propiciou conhecimentos básicos de como elaborar e escrever um trabalho científico; dentre outras (15%).

Avaliação do rendimento escolar: estudos e concepção

No presente artigo, além de lançar mão de informações da literatura, como comumente se faz, peço licença e me autorizo a emitir sobre avaliação escolar, minhas próprias idéias e opiniões, fruto de muitos anos de investigação, vivência em salas de aula, problemas e reflexão.

O modelo de Romberg e o percurso metodológico de uma pesquisa qualitativa em educação de uma pesquisa qualitativa em educação

The objective of this study is to present the trajectory of a research project (ALLEVATO, 2005) whose phenomenon of interest is the teaching of mathematics using problem solving with computers. The text is an attempt to portray this trajectory, from the point of view of the methodological route followed by the researcher, which was based on two main axes: the guidance of the educator Thomas A. Romberg (1992), and the guidelines provided by the foundations of qualitative research. The study was developed during a doctoral course offered by the Graduate Program in Mathematics Education at the State University of São Paulo (UNESP), Rio Claro campus.

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Fourth-order method for solving the Navier-Stokes equations in a constricting channel

A fourth-order numerical method for solving the Navier-Stokes equations in streamfunction/vorticity formulation on a two-dimensional non-uniform orthogonal grid has been tested on the fluid flow in a constricted symmetric channel. The family of grids is generated algebraically using a conformal transformation followed by a non-uniform stretching of the mesh cells in which the shape of the channel boundary can vary from a smooth constriction to one which one possesses a very sharp but smooth corner. The generality of the grids allows the use of long channels upstream and downstream as well as having a refined grid near the sharp corner. Derivatives in the governing equations are replaced by fourth-order central differences and the vorticity is eliminated, either before or after the discretization, to form a wide difference molecule for the streamfunction. Extra boundary conditions, necessary for wide-molecule methods, are supplied by a procedure proposed by Henshaw et al. The ensuing set of non-linear equations is solved using Newton iteration. Results have been obtained for Reynolds numbers up to 250 for three constrictions, the first being smooth, the second having a moderately sharp corner and the third with a very sharp corner. Estimates of the error incurred show that the results are very accurate and substantially better than those of the corresponding second-order method. The observed order of the method has been shown to be close to four, demonstrating that the method is genuinely fourth-order. © 1977 John Wiley & Sons, Ltd.

Concept of Matching Parallelepiped and its use in the correspondence problem

In this paper, the concept of Matching Parallelepiped (MP) is presented. It is shown that the volume of the MP can be used as an additional measure of `distance' between a pair of candidate points in a matching algorithm by Relaxation Labeling (RL). The volume of the MP is related with the Epipolar Geometry and the use of this measure works as an epipolar constraint in a RL process, decreasing the efforts in the matching algorithm since it is not necessary to explicitly determine the equations of the epipolar lines and to compute the distance of a candidate point to each epipolar line. As at the beginning of the process the Relative Orientation (RO) parameters are unknown, a initial matching based on gradient, intensities and correlation is obtained. Based on this set of labeled points the RO is determined and the epipolar constraint included in the algorithm. The obtained results shown that the proposed approach is suitable to determine feature-point matching with simultaneous estimation of camera orientation parameters even for the cases where the pair of optical axes are not parallel.

On the regular-geometric-figure solution to the N-body problem

The regular-geometric-figure solution to the N-body problem is presented in a very simple way. The Newtonian formalism is used without resorting to a more involved rotating coordinate system. Those configurations occur for other kinds of interactions beyond the gravitational ones for some special values of the parameters of the forces. For the harmonic oscillator, in particular, it is shown that the N-body problem is reduced to N one-body problems.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

Prevalência de reagentes ao teste de tuberculinização no rebanho bovino leiteiro da região de São Carlos - SP

Tuberculosis (TB), an infectious disease readily transmitted between animals and humans, is an great threat to public and animal health a like and has been declared an international emergency. According to the WHO, animal TB is a source of much concern, especially in the poorer countries where there is little awareness of the problem. Thus, improvements in veterinary health are essential, with regard to infection by Mycobacterium bovis, particularly in areas where the public is at risk. The prevalence of infected animals in Brazil is about 1%, whereas, in the dairy cattle region of São Carlos, the average proportion of positive tests was found to be 3. 1% from 1987 to 1996. The current research was carried out to investigate the prevalence, in the region, of dairy cattle reacting positively to the tuberculin test, from 1997 to the first half of 2001. The results were obtained by searching through the data collected by the Federal Inspection Authority, and they indicated an average prevalence of 1.3% over the period, similar to the official national average. It was concluded that bovine TB continues to be present in the region, posing a potential threat of infection to the human population.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry's own practice. © 2006 Elsevier Ltd. All rights reserved.

Meta-heuristic approaches for a soft drink industry problem

The present paper evaluates meta-heuristic approaches to solve a soft drink industry problem. This problem is motivated by a real situation found in soft drink companies, where the lot sizing and scheduling of raw materials in tanks and products in lines must be simultaneously determined. Tabu search, threshold accepting and genetic algorithms are used as procedures to solve the problem at hand. The methods are evaluated with a set of instance already available for this problem. This paper also proposes a new set of complex instances. The computational results comparing these approaches are reported. © 2008 IEEE.