9 resultados para problem-based learning
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Resumo:
Lellis-Santos C, Giannocco G, Nunes MT. The case of thyroid hormones: how to learn physiology by solving a detective case. Adv Physiol Educ 35: 219-226, 2011; doi:10.1152/advan.00135.2010.Thyroid diseases are prevalent among endocrine disorders, and careful evaluation of patients' symptoms is a very important part in their diagnosis. Developing new pedagogical strategies, such as problem-based learning (PBL), is extremely important to stimulate and encourage medical and biomedical students to learn thyroid physiology and identify the signs and symptoms of thyroid dysfunction. The present study aimed to create a new pedagogical approach to build deep knowledge about hypo-/hyperthyroidism by proposing a hands-on activity based on a detective case, using alternative materials in place of laboratory animals. After receiving a description of a criminal story involving changes in thyroid hormone economy, students collected data from clues, such as body weight, mesenteric vascularization, visceral fat, heart and thyroid size, heart rate, and thyroid-stimulating hormone serum concentration to solve the case. Nevertheless, there was one missing clue for each panel of data. Four different materials were proposed to perform the same practical lesson. Animals, pictures, small stuffed toy rats, and illustrations were all effective to promote learning, and the detective case context was considered by students as inviting and stimulating. The activity can be easily performed independently of the institution's purchasing power. The practical lesson stimulated the scientific method of data collection and organization, discussion, and review of thyroid hormone actions to solve the case. Hence, this activity provides a new strategy and alternative materials to teach without animal euthanization.
Resumo:
Case-Based Reasoning is a methodology for problem solving based on past experiences. This methodology tries to solve a new problem by retrieving and adapting previously known solutions of similar problems. However, retrieved solutions, in general, require adaptations in order to be applied to new contexts. One of the major challenges in Case-Based Reasoning is the development of an efficient methodology for case adaptation. The most widely used form of adaptation employs hand coded adaptation rules, which demands a significant knowledge acquisition and engineering effort. An alternative to overcome the difficulties associated with the acquisition of knowledge for case adaptation has been the use of hybrid approaches and automatic learning algorithms for the acquisition of the knowledge used for the adaptation. We investigate the use of hybrid approaches for case adaptation employing Machine Learning algorithms. The approaches investigated how to automatically learn adaptation knowledge from a case base and apply it to adapt retrieved solutions. In order to verify the potential of the proposed approaches, they are experimentally compared with individual Machine Learning techniques. The results obtained indicate the potential of these approaches as an efficient approach for acquiring case adaptation knowledge. They show that the combination of Instance-Based Learning and Inductive Learning paradigms and the use of a data set of adaptation patterns yield adaptations of the retrieved solutions with high predictive accuracy.
Resumo:
The Learning Object (OA) is any digital resource that can be reused to support learning with specific functions and objectives. The OA specifications are commonly offered in SCORM model without considering activities in groups. This deficiency was overcome by the solution presented in this paper. This work specified OA for e-learning activities in groups based on SCORM model. This solution allows the creation of dynamic objects which include content and software resources for the collaborative learning processes. That results in a generalization of the OA definition, and in a contribution with e-learning specifications.
Resumo:
Sociable robots are embodied agents that are part of a heterogeneous society of robots and humans. They Should be able to recognize human beings and each other, and to engage in social, interactions. The use of a robotic architecture may strongly reduce the time and effort required to construct a sociable robot. Such architecture must have structures and mechanisms to allow social interaction. behavior control and learning from environment. Learning processes described oil Science of Behavior Analysis may lead to the development of promising methods and Structures for constructing robots able to behave socially and learn through interactions from the environment by a process of contingency learning. In this paper, we present a robotic architecture inspired from Behavior Analysis. Methods and structures of the proposed architecture, including a hybrid knowledge representation. are presented and discussed. The architecture has been evaluated in the context of a nontrivial real problem: the learning of the shared attention, employing an interactive robotic head. The learning capabilities of this architecture have been analyzed by observing the robot interacting with the human and the environment. The obtained results show that the robotic architecture is able to produce appropriate behavior and to learn from social interaction. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
Objective: We carry out a systematic assessment on a suite of kernel-based learning machines while coping with the task of epilepsy diagnosis through automatic electroencephalogram (EEG) signal classification. Methods and materials: The kernel machines investigated include the standard support vector machine (SVM), the least squares SVM, the Lagrangian SVM, the smooth SVM, the proximal SVM, and the relevance vector machine. An extensive series of experiments was conducted on publicly available data, whose clinical EEG recordings were obtained from five normal subjects and five epileptic patients. The performance levels delivered by the different kernel machines are contrasted in terms of the criteria of predictive accuracy, sensitivity to the kernel function/parameter value, and sensitivity to the type of features extracted from the signal. For this purpose, 26 values for the kernel parameter (radius) of two well-known kernel functions (namely. Gaussian and exponential radial basis functions) were considered as well as 21 types of features extracted from the EEG signal, including statistical values derived from the discrete wavelet transform, Lyapunov exponents, and combinations thereof. Results: We first quantitatively assess the impact of the choice of the wavelet basis on the quality of the features extracted. Four wavelet basis functions were considered in this study. Then, we provide the average accuracy (i.e., cross-validation error) values delivered by 252 kernel machine configurations; in particular, 40%/35% of the best-calibrated models of the standard and least squares SVMs reached 100% accuracy rate for the two kernel functions considered. Moreover, we show the sensitivity profiles exhibited by a large sample of the configurations whereby one can visually inspect their levels of sensitiveness to the type of feature and to the kernel function/parameter value. Conclusions: Overall, the results evidence that all kernel machines are competitive in terms of accuracy, with the standard and least squares SVMs prevailing more consistently. Moreover, the choice of the kernel function and parameter value as well as the choice of the feature extractor are critical decisions to be taken, albeit the choice of the wavelet family seems not to be so relevant. Also, the statistical values calculated over the Lyapunov exponents were good sources of signal representation, but not as informative as their wavelet counterparts. Finally, a typical sensitivity profile has emerged among all types of machines, involving some regions of stability separated by zones of sharp variation, with some kernel parameter values clearly associated with better accuracy rates (zones of optimality). (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
In this paper, we deal with a generalized multi-period mean-variance portfolio selection problem with market parameters Subject to Markov random regime switchings. Problems of this kind have been recently considered in the literature for control over bankruptcy, for cases in which there are no jumps in market parameters (see [Zhu, S. S., Li, D., & Wang, S. Y. (2004). Risk control over bankruptcy in dynamic portfolio selection: A generalized mean variance formulation. IEEE Transactions on Automatic Control, 49, 447-457]). We present necessary and Sufficient conditions for obtaining an optimal control policy for this Markovian generalized multi-period meal-variance problem, based on a set of interconnected Riccati difference equations, and oil a set of other recursive equations. Some closed formulas are also derived for two special cases, extending some previous results in the literature. We apply the results to a numerical example with real data for Fisk control over bankruptcy Ill a dynamic portfolio selection problem with Markov jumps selection problem. (C) 2008 Elsevier Ltd. All rights reserved.
Resumo:
Using a numerical implicit model for root water extraction by a single root in a symmetric radial flow problem, based on the Richards equation and the combined convection-dispersion equation, we investigated some aspects of the response of root water uptake to combined water and osmotic stress. The model implicitly incorporates the effect of simultaneous pressure head and osmotic head on root water uptake, and does not require additional assumptions (additive or multiplicative) to derive the combined effect of water and salt stress. Simulation results showed that relative transpiration equals relative matric flux potential, which is defined as the matric flux potential calculated with an osmotic pressure head-dependent lower bound of integration, divided by the matric flux potential at the onset of limiting hydraulic conditions. In the falling rate phase, the osmotic head near the root surface was shown to increase in time due to decreasing root water extraction rates, causing a more gradual decline of relative transpiration than with water stress alone. Results furthermore show that osmotic stress effects on uptake depend on pressure head or water content, allowing a refinement of the approach in which fixed reduction factors based on the electrical conductivity of the saturated soil solution extract are used. One of the consequences is that osmotic stress is predicted to occur in situations not predicted by the saturation extract analysis approach. It is also shown that this way of combining salinity and water as stressors yields results that are different from a purely multiplicative approach. An analytical steady state solution is presented to calculate the solute content at the root surface, and compared with the outputs of the numerical model. Using the analytical solution, a method has been developed to estimate relative transpiration as a function of system parameters, which are often already used in vadose zone models: potential transpiration rate, root length density, minimum root surface pressure head, and soil theta-h and K-h functions.
Resumo:
The subject of this paper is the secular behaviour of a pair of planets evolving under dissipative forces. In particular, we investigate the case when dissipative forces affect the planetary semimajor axes and the planets move inwards/outwards the central star, in a process known as planet migration. To perform this investigation, we introduce fundamental concepts of conservative and dissipative dynamics of the three-body problem. Based on these concepts, we develop a qualitative model of the secular evolution of the migrating planetary pair. Our approach is based on the analysis of the energy and the orbital angular momentum exchange between the two-planet system and an external medium; thus no specific kind of dissipative forces is invoked. We show that, under the assumption that dissipation is weak and slow, the evolutionary routes of the migrating planets are traced by the Mode I and Mode II stationary solutions of the conservative secular problem. The ultimate convergence and the evolution of the system along one of these secular modes of motion are determined uniquely by the condition that the dissipation rate is sufficiently smaller than the proper secular frequency of the system. We show that it is possible to reassemble the starting configurations and the migration history of the systems on the basis of their final states and consequently to constrain the parameters of the physical processes involved.
Resumo:
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an outer trust-region (OTR) modification of A is the result of adding a trust-region constraint to each subproblem. The trust-region size is adaptively updated according to the behavior of crucial variables. The new subproblems should not be more complex than the original ones, and the convergence properties of the OTR algorithm should be the same as those of Algorithm A. In the present work, the OTR approach is exploited in connection with the ""greediness phenomenon"" of nonlinear programming. Convergence results for an OTR version of an augmented Lagrangian method for nonconvex constrained optimization are proved, and numerical experiments are presented.