Avaliação da aplicabilidade de correlações matemáticas e redes neurais na predição de parâmetros de especificação do diesel

Diesel fuel is one of leading petroleum products marketed in Brazil, and has its quality monitored by specialized laboratories linked to the National Agency of Petroleum, Natural Gas and Biofuels - ANP. The main trial evaluating physicochemical properties of diesel are listed in the resolutions ANP Nº 65 of December 9th, 2011 and Nº 45 of December 20th, 2012 that determine the specification limits for each parameter and methodologies of analysis that should be adopted. However the methods used although quite consolidated, require dedicated equipment with high cost of acquisition and maintenance, as well as technical expertise for completion of these trials. Studies for development of more rapid alternative methods and lower cost have been the focus of many researchers. In this same perspective, this work conducted an assessment of the applicability of existing specialized literature on mathematical equations and artificial neural networks (ANN) for the determination of parameters of specification diesel fuel. 162 samples of diesel with a maximum sulfur content of 50, 500 and 1800 ppm, which were analyzed in a specialized laboratory using ASTM methods recommended by the ANP, with a total of 810 trials were used for this study. Experimental results atmospheric distillation (ASTM D86), and density (ASTM D4052) of diesel samples were used as basic input variables to the equations evaluated. The RNAs were applied to predict the flash point, cetane number and sulfur content (S50, S500, S1800), in which were tested network architectures feed-forward backpropagation and generalized regression varying the parameters of the matrix input in order to determine the set of variables and the best type of network for the prediction of variables of interest. The results obtained by the equations and RNAs were compared with experimental results using the nonparametric Wilcoxon test and Student's t test, at a significance level of 5%, as well as the coefficient of determination and percentage error, an error which was obtained 27, 61% for the flash point using a specific equation. The cetane number was obtained by three equations, and both showed good correlation coefficients, especially equation based on aniline point, with the lowest error of 0,816%. ANNs for predicting the flash point and the index cetane showed quite superior results to those observed with the mathematical equations, respectively, with errors of 2,55% and 0,23%. Among the samples with different sulfur contents, the RNAs were better able to predict the S1800 with error of 1,557%. Generally, networks of the type feedforward proved superior to generalized regression.

Components of learning and assessment in linear algebra

Linear algebra provides theory and technology that are the cornerstones of a range of cutting edge mathematical applications, from designing computer games to complex industrial problems, as well as more traditional applications in statistics and mathematical modelling. Once past introductions to matrices and vectors, the challenges of balancing theory, applications and computational work across mathematical and statistical topics and problems are considerable, particularly given the diversity of abilities and interests in typical cohorts. This paper considers two such cohorts in a second level linear algebra course in different years. The course objectives and materials were almost the same, but some changes were made in the assessment package. In addition to considering effects of these changes, the links with achievement in first year courses are analysed, together with achievement in a following computational mathematics course. Some results that may initially appear surprising provide insight into the components of student learning in linear algebra.

Sequential development of algebra knowledge : a cognitive analysis

Learning to operate algebraically is a complex process that is dependent upon extending arithmetic knowledge to the more complex concepts of algebra. Current research has shown a gap between arithmetic and algebraic knowledge and suggests a pre-algebraic level as a step between the two knowledge types. This paper examines arithmetic and algebraic knowledge from a cognitive perspective in an effort to determine what constitutes a pre-algebraic level of understanding. Results of a longitudinal study designed to investigate students' readiness for algebra are presented. Thirty-three students in Grades 7, 8, and 9 participated. A model for the transition from arithmetic to pre-algebra to algebra is proposed and students' understanding of relevant knowledge is discussed.

RcppArmadillo : accelerating R with high-performance C++ linear algebra

The R statistical environment and language has demonstrated particular strengths for interactive development of statistical algorithms, as well as data modelling and visualisation. Its current implementation has an interpreter at its core which may result in a performance penalty in comparison to directly executing user algorithms in the native machine code of the host CPU. In contrast, the C++ language has no built-in visualisation capabilities, handling of linear algebra or even basic statistical algorithms; however, user programs are converted to high-performance machine code, ahead of execution. A new method avoids possible speed penalties in R by using the Rcpp extension package in conjunction with the Armadillo C++ matrix library. In addition to the inherent performance advantages of compiled code, Armadillo provides an easy-to-use template-based meta-programming framework, allowing the automatic pooling of several linear algebra operations into one, which in turn can lead to further speedups. With the aid of Rcpp and Armadillo, conversion of linear algebra centered algorithms from R to C++ becomes straightforward. The algorithms retains the overall structure as well as readability, all while maintaining a bidirectional link with the host R environment. Empirical timing comparisons of R and C++ implementations of a Kalman filtering algorithm indicate a speedup of several orders of magnitude.

Colour by numbers in Excel 2007 : solving algebraic equations without algebra

This is an update of an earlier paper, and is written for Excel 2007. A series of Excel 2007 models is described. The more advanced versions allow solution of f(x)=0 by examining change of sign of function values. The function is graphed and change of sign easily detected by a change of colour. Relevant features of Excel 2007 used are Names, Scatter Chart and Conditional Formatting. Several sample Excel 2007 models are available for download, and the paper is intended to be used as a lesson plan for students having some familiarity with derivatives. For comparison and reference purposes, the paper also presents a brief outline of several common equation-solving strategies as an Appendix.

Path algebra for mobile robots

In this paper, we introduce a path algebra well suited for navigation in environments that can be abstracted as topological graphs. From this path algebra, we derive algorithms to reduce routes in such environments. The routes are reduced in the sense that they are shorter (contain fewer edges), but still connect the endpoints of the initial routes. Contrary to planning methods descended from Disjktra’s Shortest Path Algorithm like D , the navigation methods derived from our path algebra do not require any graph representation. We prove that the reduced routes are optimal when the graphs are without cycles. In the case of graphs with cycles, we prove that whatever the length of the initial route, the length of the reduced route is bounded by a constant that only depends on the structure of the environment.