Active teaching-learning methodologies: medical students' views of problem-based learning

The prevailing undergraduate medical training process still favors disconnection and professional distancing from social needs. The Brazilian Ministries of Education and Health, through the National Curriculum Guidelines, the Incentives Program for Changes in the Medical Curriculum (PROMED), and the National Program for Reorientation of Professional Training in Health (PRO-SAÚDE), promoted the stimulus for an effective connection between medical institutions and the Unified National Health System (SUS). In accordance to the new paradigm for medical training, the Centro Universitário Serra dos Órgãos (UNIFESO) established a teaching plan in 2005 using active methodologies, specifically problem-based learning (PBL). Research was conducted through semi-structured interviews with third-year undergraduate students at the UNIFESO Medical School. The results were categorized as proposed by Bardin's thematic analysis, with the purpose of verifying the students' impressions of the new curriculum. Active methodologies proved to be well-accepted by students, who defined them as exciting and inclusive of theory and practice in medical education.

Jämställdhet som politiskt problem i Finland och Frankrike

Kirjallisuusarvostelu

General terms and rigidity: another solution to the trivialization problem

In this paper I am concerned with the problem of applying the notion of rigidity to general terms. In Naming and Necessity, Kripke has clearly suggested that we should include some general terms among the rigid ones, namely, those common nouns semantically correlated with natural substances, species and phenomena, in general, natural kinds -'water', 'tiger', 'heat'- and some adjectives -'red', 'hot', 'loud'. However, the notion of rigidity has been defined for singular terms; after all, the notion that Kripke has provided us with is the notion of a rigid designator. But general terms do not designate single individuals: rather, they apply to many of them. In sum, the original concept of rigidity cannot be straightforwardly applied to general terms: it has to be somehow redefined in order to make it cover them. As is known, two main positions have been put forward to accomplish that task: the identity of designation conception, according to which a rigid general term is one that designates the same property or kind in all possible worlds, and the essentialist conception, which conceives of a rigid general term as an essentialist one, namely, a term that expresses an essential property of an object. My purpose in the present paper is to defend a particular version of the identity of designation conception: on the proposed approach, a rigid general term will be one that expresses the same property in all possible worlds and names the property it expresses. In my opinion, the position can be established on the basis of an inference to the best explanation of our intuitive interpretation and evaluation, relative to counterfactual circumstances, of statements containing different kinds of general terms, which is strictly analogous to our intuitive interpretation and evaluation, relative to such circumstances, of statements containing different kinds of singular ones. I will argue that it is possible to offer a new solution to the trivialization problem that is thought to threaten all versions of the identity of designation conception of rigidity. Finally, I will also sketch a solution to the so-called 'over-generalization and under-generalization problems', both closely related to the above-mentioned one.

Researching Manufacturing Planning and Control system and Master Scheduling in a manufacturing firm.

The objective of this thesis is to research Manufacturing Planning and Control (MPC) system and Master Scheduling (MS) in a manufacturing firm. The study is conducted at Ensto Finland Corporation, which operates on a field of electrical systems and supplies. The paper consists of theoretical and empirical parts. The empirical part is based on weekly operating at Ensto and includes inter-firm material analysis, learning and meetings. Master Scheduling is an important module of an MPC system, since it is beneficial on transforming strategic production plans based on demand forecasting into operational schedules. Furthermore, capacity planning tools can remarkably contribute to production planning: by Rough-Cut Capacity Planning (RCCP) tool, a MS plan can be critically analyzed in terms of available key resources in real manufacturing environment. Currently, there are remarkable inefficiencies when it comes to Ensto’s practices: the system is not able to take into consideration seasonal demand and react on market changes on time; This can cause significant lost sales. However, these inefficiencies could be eliminated through the appropriate utilization of MS and RCCP tools. To utilize MS and RCCP tools in Ensto’s production environment, further testing in real production environment is required. Moreover, data accuracy, appropriate commitment to adapting and learning the new tools, and continuous developing of functions closely related to MS, such as sales forecasting, need to be ensured.

Harvesting and wood transport planning with SNAP III program (Scheduling and Network Analysis Program) in a pine plantation in Southeast Brazil

The objective of this study was to verify the potential of SNAP III (Scheduling and Network Analysis Program) as a support tool for harvesting and wood transport planning in Brazil harvesting subsystem definition and establishment of a compatible route were assessed. Initially, machine operational and production costs were determined in seven subsystems for the study area, and quality indexes, construction and maintenance costs of forest roads were obtained and used as SNAP III program input data. The results showed, that three categories of forest road occurrence were observed in the study area: main, secondary and tertiary which, based on quality index, allowed a medium vehicle speed of about 41, 30 and 24 km/hours and a construction cost of about US$ 5,084.30, US$ 2,275.28 and US$ 1,650.00/km, respectively. The SNAP III program used as a support tool for the planning, was found to have a high potential tool in the harvesting and wood transport planning. The program was capable of defining efficiently, the harvesting subsystem on technical and economical basis, the best wood transport route and the forest road to be used in each period of the horizon planning.

Solving Challenging Real-World Scheduling Problems

This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use. The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems. The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.

Delay reduction in courts of justice – possibilities and challenges of process improvement in professional public organizations

Delays in the justice system have been undermining the functioning and performance of the court system all over the world for decades. Despite the widespread concern about delays, the solutions have not kept up with the growth of the problem. The delay problem existing in the justice courts processes is a good example of the growing need and pressure in professional public organizations to start improving their business process performance.This study analyses the possibilities and challenges of process improvement in professional public organizations. The study is based on experiences gained in two longitudinal action research improvement projects conducted in two separate Finnish law instances; in the Helsinki Court of Appeal and in the Insurance Court. The thesis has two objectives. First objective is to study what kinds of factors in court system operations cause delays and unmanageable backlogs and how to reduce and prevent delays. Based on the lessons learned from the case projects the objective is to give new insights on the critical factors of process improvement conducted in professional public organizations. Four main areas and factors behind the delay problem is identified: 1) goal setting and performance measurement practices, 2) the process control system, 3) production and capacity planning procedures, and 4) process roles and responsibilities. The appropriate improvement solutions include tools to enhance project planning and scheduling and monitoring the agreed time-frames for different phases of the handling process and pending inventory. The study introduces the identified critical factors in different phases of process improvement work carried out in professional public organizations, the ways the critical factors can be incorporated to the different stages of the projects, and discusses the role of external facilitator in assisting process improvement work and in enhancing ownership towards the solutions and improvement. The study highlights the need to concentrate on the critical factors aiming to get the employees to challenge their existing ways of conducting work, analyze their own processes, and create procedures for diffusing the process improvement culture instead of merely concentrating of finding tools, techniques, and solutions appropriate for applications from the manufacturing sector

Finnisch-ugrisches Substrat in der Toponymie des Russischen Nordens : eine neue Einstellung zum alten Problem

Kirjallisuusarvostelu

The knapsack problem approach in solving partial hedging problems of options

En option är ett finansiellt kontrakt som ger dess innehavare en rättighet (men medför ingen skyldighet) att sälja eller köpa någonting (till exempel en aktie) till eller från säljaren av optionen till ett visst pris vid en bestämd tidpunkt i framtiden. Den som säljer optionen binder sig till att gå med på denna framtida transaktion ifall optionsinnehavaren längre fram bestämmer sig för att inlösa optionen. Säljaren av optionen åtar sig alltså en risk av att den framtida transaktion som optionsinnehavaren kan tvinga honom att göra visar sig vara ofördelaktig för honom. Frågan om hur säljaren kan skydda sig mot denna risk leder till intressanta optimeringsproblem, där målet är att hitta en optimal skyddsstrategi under vissa givna villkor. Sådana optimeringsproblem har studerats mycket inom finansiell matematik. Avhandlingen "The knapsack problem approach in solving partial hedging problems of options" inför en ytterligare synpunkt till denna diskussion: I en relativt enkel (ändlig och komplett) marknadsmodell kan nämligen vissa partiella skyddsproblem beskrivas som så kallade kappsäcksproblem. De sistnämnda är välkända inom en gren av matematik som heter operationsanalys. I avhandlingen visas hur skyddsproblem som tidigare lösts på andra sätt kan alternativt lösas med hjälp av metoder som utvecklats för kappsäcksproblem. Förfarandet tillämpas även på helt nya skyddsproblem i samband med så kallade amerikanska optioner.

Chelyabinsk CHP-3 “locked power” problem solving

All over the world power systems become bigger and bigger every day. New equipment is installed, new feeders are constructed, new power units are installed. Some old elements of the network, however, are not changed in time. As a result, “bottlenecks” for capacity transmission can occur. By locked power problem the situation when a power plant has installed capacity exceeding the power it can actually deliver is usually meant. Regime, scheme or even technical restrictions-related issues usually cause this kind of problem. It is really important, since from the regime point of view it is typical decision to have a mobile capacity reserve, in case of malfunctions. And, what can be even more significant, power plant owner (JSC Fortum in our case) losses his money because of selling less electrical energy. The goal of master`s thesis is to analyze the current state of Chelyabinsk power system and the CHP-3 (Combined Heat and Power plant) in particular in relation with it`s ability to deliver the whole capacity of the CHP in it`s existing state and also taking into consideration the prospect of power unit 3 installation by the fourth quarter of 2010. The thesis contains some general information about the UPS of Russia, CPS of Ural, power system of Chelyabinsk and the Chelyabinsk region itself. Then the CHP-3 is described from technical point of view with it`s equipment observation. Regimes for the nowadays power system and for the system after the power unit 3 installation are reviewed. The problems occurring are described and, finally, a solution is offered.

Scheduling of guarded command based models

Formal methods provide a means of reasoning about computer programs in order to prove correctness criteria. One subtype of formal methods is based on the weakest precondition predicate transformer semantics and uses guarded commands as the basic modelling construct. Examples of such formalisms are Action Systems and Event-B. Guarded commands can intuitively be understood as actions that may be triggered when an associated guard condition holds. Guarded commands whose guards hold are nondeterministically chosen for execution, but no further control flow is present by default. Such a modelling approach is convenient for proving correctness, and the Refinement Calculus allows for a stepwise development method. It also has a parallel interpretation facilitating development of concurrent software, and it is suitable for describing event-driven scenarios. However, for many application areas, the execution paradigm traditionally used comprises more explicit control flow, which constitutes an obstacle for using the above mentioned formal methods. In this thesis, we study how guarded command based modelling approaches can be conveniently and efficiently scheduled in different scenarios. We first focus on the modelling of trust for transactions in a social networking setting. Due to the event-based nature of the scenario, the use of guarded commands turns out to be relatively straightforward. We continue by studying modelling of concurrent software, with particular focus on compute-intensive scenarios. We go from theoretical considerations to the feasibility of implementation by evaluating the performance and scalability of executing a case study model in parallel using automatic scheduling performed by a dedicated scheduler. Finally, we propose a more explicit and non-centralised approach in which the flow of each task is controlled by a schedule of its own. The schedules are expressed in a dedicated scheduling language, and patterns assist the developer in proving correctness of the scheduled model with respect to the original one.

Contact with friction using the augmented Lagrangian Method: a conditional constrained minimization problem

This work presents a formulation of the contact with friction between elastic bodies. This is a non linear problem due to unilateral constraints (inter-penetration of bodies) and friction. The solution of this problem can be found using optimization concepts, modelling the problem as a constrained minimization problem. The Finite Element Method is used to construct approximation spaces. The minimization problem has the total potential energy of the elastic bodies as the objective function, the non-inter-penetration conditions are represented by inequality constraints, and equality constraints are used to deal with the friction. Due to the presence of two friction conditions (stick and slip), specific equality constraints are present or not according to the current condition. Since the Coulomb friction condition depends on the normal and tangential contact stresses related to the constraints of the problem, it is devised a conditional dependent constrained minimization problem. An Augmented Lagrangian Method for constrained minimization is employed to solve this problem. This method, when applied to a contact problem, presents Lagrange Multipliers which have the physical meaning of contact forces. This fact allows to check the friction condition at each iteration. These concepts make possible to devise a computational scheme which lead to good numerical results.