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.

Evaluación del impacto de una intervención educativa en atención farmacéutica y farmacia clínica

Introduction: The World Health Organization considers pharmaceutical care (PC) of fundamental importance for the patient and the community. Its exercise requires knowledge and skills, which can be acquired in academic and/or continuing educations, credited for effectiveness and impact evaluation. However, few manuscripts in the literature have showed the contribution of the educational interventions on the knowledge, skill and attitude of students and professionals who participate in scientifi c events related to PC. Objective: To evaluate the impact of an educational intervention (EI), and its degree of satisfaction, to pharmacists and pharmacy students. Method: A quasi-experimental study was performed, through an extension course with 40 hours of lectures approaching issues related to PC and clinical pharmacy (CP). Participants answered a survey which was handed out before and after the EI. The statistic tests of Sinais and Mann-Whitney were applied to evaluate the EI signifi cance. Results: Participants (n= 49) were mostly (n= 34) students and performing activities related to PC and CP (n= 20). Statistics differences, before and after the EI, were found in the scores of knowledge, skill and attitude (p <0.001). The evaluated item which showed the most improvement was the last one. Most (n= 30) had exceeded or met their expectations (n= 19). Conclusions: The analysis of the data led us to conclude that an EI of 40 h/week about knowledge, skill and attitude in PC using traditional methods, improves knowledge and problem-solving skills of participants. ©2012 Ediciones Mayo, S.A. 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.

Meio ambiente e enfermagem: suas interfaces e inserção no ensino de graduação

A degradação ambiental vem modificando nosso cenário de forma acelerada e interferindo negativamente no processo saúde-doença de toda a comunidade. No entanto, o meio ambiente vem sendo concebido como um simples cenário, algo externo ao ser humano, não onde estamos inseridos e no qual acontecem suas interações e inter-relações. A complexidade dos problemas ambientais clama pela adoção de medidas que superem práticas assistencialistas, levando à adoção de práticas transdisciplinares que avancem na promoção da saúde. Neste artigo procura-se discutir, nesta perspectiva, a necessidade de inserção nos cursos de graduação em saúde a temática saúde e meio ambiente, adotando como exemplo um curso de enfermagem do interior paulista que inseriu uma disciplina relacionada ao tema. Analisa também o papel do enfermeiro na relação com o meio ambiente segundo a representação social dos alunos, trabalhada a partir do Discurso do Sujeito Coletivo. Nota-se que é fundamental discutir essa temática ambiental entre os profissionais da saúde, a fim de que eles se empoderem desse conhecimento e consigam identificar problemas relacionados à questão ambiental, propondo ações resolutivas e preventivas, juntamente com a comunidade, procurando amenizar os riscos ambientais a que todos estão expostos. Reforça-se a profundidade do papel dos profissionais de saúde diante dos problemas ambientais, buscando a saúde em uma perspectiva ampliada de promoção da saúde.

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.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

A new method for real time computation of power quality indices based on instantaneous space phasors

One of the important issues about using renewable energy is the integration of dispersed generation in the distribution networks. Previous experience has shown that the integration of dispersed generation can improve voltage profile in the network, decrease loss etc. but can create safety and technical problems as well, This work report the application of the instantaneous space phasors and the instantaneous complex power in observing performances of the distribution networks with dispersed generators in steady state. New IEEE apparent power definition, the so called Buccholz-Goodhue apparent power, as well as new proposed power quality (oscillation) index in the three-phase distribution systems with unbalanced loads and dispersed generators, are applied. Results obtained from several case studies using IEEE 34 nodes test network are presented and discussed.

A branch-and-bound algorithm for the multi-stage transmission expansion planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.

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.

A genetic neuro-model reference adaptive controller for petroleum wells drilling operations

Motivated by rising drilling operation costs, the oil industry has shown a trend towards real-time measurements and control. In this scenario, drilling control becomes a challenging problem for the industry, especially due to the difficulty associated to parameters modeling. One of the drill-bit performance evaluators, the Rate of Penetration (ROP), has been used in the literature as a drilling control parameter. However, the relationships between the operational variables affecting the ROP are complex and not easily modeled. This work presents a neuro-genetic adaptive controller to treat this problem. It is based on the Auto-Regressive with Extra Input Signals model, or ARX model, to accomplish the system identification and on a Genetic Algorithm (GA) to provide a robust control for the ROP. Results of simulations run over a real offshore oil field data, consisted of seven wells drilled with equal diameter bits, are provided. © 2006 IEEE.

Heuristic algorithm to solve the short term transmission network expansion planning

In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In order to And a solution of excellent quality for this problem, a constructive heuristic algorithm is presented in this paper. In each step of the algorithm, a sensitivity index is used to add a circuit (transmission line or transformer) or a capacitor bank (fixed or variable) to the system. This sensitivity index is obtained solving the problem considering the numbers of circuits and capacitors banks to be added (relaxed problem), as continuous variables. The relaxed problem is a large and complex nonlinear programming and was solved through a higher order interior point method. The paper shows results of several tests that were performed using three well-known electric energy systems in order to show the possibility and the advantages of using the AC model. ©2007 IEEE.

Distribution network reconfiguration using an efficient evolutionary algorithm

Network reconfiguration is an important tool to optimize the operating conditions of a distribution system. This is accomplished modifying the network structure of distribution feeders by changing the open/close status of sectionalizing switches. This not only reduces the power losses, but also relieves the overloading of the network components. Network reconfiguration belongs to a complex family of problems because of their combinatorial nature and multiple constraints. This paper proposes a solution to this problem, using a specialized evolutionary algorithm, with a novel codification, and a brand new way of implement the genetic operators considering the problem characteristics. The algorithm is presented and tested in a real distribution system, showing excellent results and computational efficiency. © 2007 IEEE.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.