Aplicação de classificadores Bayesianos e regressão logística na análise de desempenho dos alunos de graduação

Este trabalho minera as informações coletadas no processo de vestibular entre 2009 e 2012 para o curso de graduação de administração de empresas da FGV-EAESP, para estimar classificadores capazes de calcular a probabilidade de um novo aluno ter bom desempenho. O processo de KDD (Knowledge Discovery in Database) desenvolvido por Fayyad et al. (1996a) é a base da metodologia adotada e os classificadores serão estimados utilizando duas ferramentas matemáticas. A primeira é a regressão logística, muito usada por instituições financeiras para avaliar se um cliente será capaz de honrar com seus pagamentos e a segunda é a rede Bayesiana, proveniente do campo de inteligência artificial. Este estudo mostre que os dois modelos possuem o mesmo poder discriminatório, gerando resultados semelhantes. Além disso, as informações que influenciam a probabilidade de o aluno ter bom desempenho são a sua idade no ano de ingresso, a quantidade de vezes que ele prestou vestibular da FGV/EAESP antes de ser aprovado, a região do Brasil de onde é proveniente e as notas das provas de matemática fase 01 e fase 02, inglês, ciências humanas e redação. Aparentemente o grau de formação dos pais e o grau de decisão do aluno em estudar na FGV/EAESP não influenciam nessa probabilidade.

Graphical constraints: a graphical user interface for constraint problems

A constraint satisfaction problem is a classical artificial intelligence paradigm characterized by a set of variables (each variable with an associated domain of possible values), and a set of constraints that specify relations among subsets of these variables. Solutions are assignments of values to all variables that satisfy all the constraints. Many real world problems may be modelled by means of constraints. The range of problems that can use this representation is very diverse and embraces areas like resource allocation, scheduling, timetabling or vehicle routing. Constraint programming is a form of declarative programming in the sense that instead of specifying a sequence of steps to execute, it relies on properties of the solutions to be found, which are explicitly defined by constraints. The idea of constraint programming is to solve problems by stating constraints which must be satisfied by the solutions. Constraint programming is based on specialized constraint solvers that take advantage of constraints to search for solutions. The success and popularity of complex problem solving tools can be greatly enhanced by the availability of friendly user interfaces. User interfaces cover two fundamental areas: receiving information from the user and communicating it to the system; and getting information from the system and deliver it to the user. Despite its potential impact, adequate user interfaces are uncommon in constraint programming in general. The main goal of this project is to develop a graphical user interface that allows to, intuitively, represent constraint satisfaction problems. The idea is to visually represent the variables of the problem, their domains and the problem constraints and enable the user to interact with an adequate constraint solver to process the constraints and compute the solutions. Moreover, the graphical interface should be capable of configure the solver’s parameters and present solutions in an appealing interactive way. As a proof of concept, the developed application – GraphicalConstraints – focus on continuous constraint programming, which deals with real valued variables and numerical constraints (equations and inequalities). RealPaver, a state-of-the-art solver in continuous domains, was used in the application. The graphical interface supports all stages of constraint processing, from the design of the constraint network to the presentation of the end feasible space solutions as 2D or 3D boxes.

Da atividade dialógica: aspectos lógicos

CRUZ, Ângela M. P.; Lycurgo, Tassos. Da atividade dialógica: aspectos lógicos. Revista Vivência, Natal, v. 26, p. 51-58, 2004.

GRIOT - sistema CAD inteligente para design de calçados

O presente trabalho é o estudo dos aspectos da metodologia projetual, face às novas tecnologias da informática, Inteligência Artificial (Sistemas Especialistas) e CAD, consideradas as reais possibilidades de automatização no processo de concepção em Design. Esse artigo propõe uma metodologia para a construção de sistema inteligente capaz de auxiliar o designer nas tarefas projetuais. A indústria de calçados foi utilizada como estudo de caso para a aplicação da metodologia, onde as reais possibilidades de automação são verificadas.

Especificação de um bloco funcional implementando rede neural para redes industriais foundations fieldbus

This work proposes the specification of a new function block according to Foundation Fieldbus standards. The new block implements an artificial neural network, which may be useful in process control applications. The specification includes the definition of a main algorithm, that implements a neural network, as well as the description of some accessory functions, which provide safety characteristics to the block operation. Besides, it also describes the block attributes emphasizing its parameters, which constitute the block interfaces. Some experimental results, obtained from an artificial neural network implementation using actual standard functional blocks on a laboratorial FF network, are also shown, in order to demonstrate the possibility and also the convenience of integrating a neural network to Fieldbus devices

Análise de um controlador baseado no Jacobiano estimado da planta através de uma rede neural

This work presents an analysis of the control law based on an indirect hybrid scheme using neural network, initially proposed for O. Adetona, S. Sathanathan and L. H. Keel. Implementations of this control law, for a level plant of second order, was resulted an oscillatory behavior, even if the neural identifier has converged. Such results had motivated the investigation of the applicability of that law. Starting from that, had been made stability mathematical analysis and several implementations, with simulated plants and with real plants, for analyze the problem. The analysis has been showed the law was designed being despised some components of dynamic of the plant to be controlled. Thus, for plants that these components have a significant influence in its dynamic, the law tends to fail

Controle inteligente de sistemas eletroidráulicos utilizando redes neurais artificiais

This work describes the development of a nonlinear control strategy for an electro-hydraulic actuated system. The system to be controlled is represented by a third order ordinary differential equation subject to a dead-zone input. The control strategy is based on a nonlinear control scheme, combined with an artificial intelligence algorithm, namely, the method of feedback linearization and an artificial neural network. It is shown that, when such a hard nonlinearity and modeling inaccuracies are considered, the nonlinear technique alone is not enough to ensure a good performance of the controller. Therefore, a compensation strategy based on artificial neural networks, which have been notoriously used in systems that require the simulation of the process of human inference, is used. The multilayer perceptron network and the radial basis functions network as well are adopted and mathematically implemented within the control law. On this basis, the compensation ability considering both networks is compared. Furthermore, the application of new intelligent control strategies for nonlinear and uncertain mechanical systems are proposed, showing that the combination of a nonlinear control methodology and artificial neural networks improves the overall control system performance. Numerical results are presented to demonstrate the efficacy of the proposed control system

EFFICIENT FAULT LOCATION IN UNDERGROUND DISTRIBUTION SYSTEMS THROUGH OPTIMUM-PATH FOREST

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

An Optimum-Path Forest framework for intrusion detection in computer networks

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

HOW FAR do WE GET USING MACHINE LEARNING BLACK-BOXES?

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

CENSUS HISTOGRAMS: A SIMPLE FEATURE EXTRACTION and MATCHING APPROACH FOR FACE RECOGNITION

Most face recognition approaches require a prior training where a given distribution of faces is assumed to further predict the identity of test faces. Such an approach may experience difficulty in identifying faces belonging to distributions different from the one provided during the training. A face recognition technique that performs well regardless of training is, therefore, interesting to consider as a basis of more sophisticated methods. In this work, the Census Transform is applied to describe the faces. Based on a scanning window which extracts local histograms of Census Features, we present a method that directly matches face samples. With this simple technique, 97.2% of the faces in the FERET fa/fb test were correctly recognized. Despite being an easy test set, we have found no other approaches in literature regarding straight comparisons of faces with such a performance. Also, a window for further improvement is presented. Among other techniques, we demonstrate how the use of SVMs over the Census Histogram representation can increase the recognition performance.

Modeling of optoelectronic devices through neuro-fuzzy architectures

The advantages offered by the electronic component LED (Light Emitting Diode) have caused a quick and wide application of this device in replacement of incandescent lights. However, in its combined application, the relationship between the design variables and the desired effect or result is very complex and it becomes difficult to model by conventional techniques. This work consists of the development of a technique, through comparative analysis of neuro-fuzzy architectures, to make possible to obtain the luminous intensity values of brake lights using LEDs from design data.

Implementation of two-stage Hopfield model and its application in nonlinear systems

This paper presents an efficient neural network for solving constrained nonlinear optimization problems. More specifically, a two-stage neural network architecture is developed and its internal parameters are computed using the valid-subspace technique. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty or weighting parameters for its initialization.