The eectiveness of a type checking tool strongly depends on the accuracy of the positional information that is associated with type errors. We present an approach where the location associated with an error message e is dened as a slice Pe of the program P being type checked. We show that this approach yields highly accurate positional information: Pe is a program that contains precisely those program constructs in P that caused error e. Semantically, w e h a v e the interesting property that type checking Pe is guaranteed to produce the same error e. Our approach is completely language-independent, and has been implemented for a signicant subset of Pascal.
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds, scalar fields, tensors, and the like, but these algebraic structures are hardly recognizable in actual PDE solvers. The general aim of the Sophus programming style is to bridge the gap between theory and practice in the domain of PDE solvers. Its main ingredients are a library of abstract datatypes corresponding to the algebraic structures used in the mathematical theory and an algebraic expression style similar to the expression style used in the mathematical theory. Because of its emphasis on abstract datatypes, Sophus is most naturally combined with object-oriented languages or other languages supporting abstract datatypes. The resulting source code patterns are beyond the scope of current compiler optimizations, but are sufficiently specific for a dedicated source-to-source optimizer. The limited, domain-specific, character of Sophus is the key to success here. This kind of optimization has been tested on computationally intensive Sophus style code with promising results. The general approach may be useful for other styles and in other application domains as well.
Aim: The main aim of the study proposed is to perform higher classification of fake political news by implementing fake news detectors using machine learning classifiers by comparing their performance. Materials and Methods: By considering two groups such as Decision Tree algorithm and Naive Bayes algorithm. The algorithms have been implemented and tested over a dataset which consists of 44,000 records. Through the programming experiment which is performed using N=10 iterations on each algorithm to identify various scales of fake news and true news classification. Result: After performing the experiment the mean accuracy of 99.6990 by using Decision Tree algorithm and the accuracy of 95.3870 by using Naive Bayes algorithm for fake political news in. There is a statistical significant difference in accuracy for two algorithms is p<0.05 by performing independent samples t-tests. Conclusion: This paper is intended to implement the innovative fake news detection approach on recent Machine Learning Classifiers for prediction of fake political news. By testing the algorithms performance and accuracy on fake political news detection and other issues. The comparison results shows that the Decision Tree algorithm has better performance when compared to Naive Bayes algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.