Evaluation of Multicenter Integrals by Polished Brute‐Force Techniques. II. Accuracy, Timing, Integral Values, and General Computational Considerations

Arnold C. Wahl; Robert H. Land

doi:10.1063/1.1670962

Evaluation of Multicenter Integrals by Polished Brute‐Force Techniques. II. Accuracy, Timing, Integral Values, and General Computational Considerations

The Journal of Chemical Physics ◽

10.1063/1.1670962 ◽

1969 ◽

Vol 50 (11) ◽

pp. 4725-4738 ◽

Cited By ~ 22

Author(s):

Arnold C. Wahl ◽

Robert H. Land

Keyword(s):

Brute Force ◽

Multicenter Integrals

Download Full-text

The evaluation of multicenter integrals by polished brute force techniques: I. Analysis, numerical methods, and computational design of the potential-charge distribution scheme

International Journal of Quantum Chemistry ◽

10.1002/qua.560010644 ◽

2009 ◽

Vol 1 (S1) ◽

pp. 375-401 ◽

Cited By ~ 13

Author(s):

Arnold C. Wahl ◽

Robert H. Land

Keyword(s):

Numerical Methods ◽

Charge Distribution ◽

Computational Design ◽

Brute Force ◽

Multicenter Integrals ◽

Distribution Scheme

Download Full-text

Implementasi Algoritma Hamming Distance dan Brute Force dalam Mendeteksi Kemiripan Source Code Bahasa Pemrograman C

Jurnal ULTIMATICS ◽

10.31937/ti.v8i2.514 ◽

2017 ◽

Vol 8 (2) ◽

Author(s):

Andreas Budiman ◽

Dennis Gunawan ◽

Seng Hansun

Keyword(s):

College Presidents ◽

Hamming Distance ◽

Source Code ◽

Structural Type ◽

Brute Force ◽

Important Thing ◽

The Past ◽

Index Terms ◽

Better Than

Plagiarism is a behavior that causes violence of copyrights. Survey shows 55% of college presidents say that plagiarism in students’ papers has increased over the past 10 years. Therefore, an application for detecting plagiarism is needed, especially for teachers. This plagiarism checker application is made by using Visual C# 2010. The plagiarism checker uses hamming distance algorithm for matching line code of the source code. This algorithm works by matching the same length string of the code programs. Thus, it needs brute will be matched with hamming distance. Another important thing for detecting plagiarism is the preprocessing, which is used to help the algorithm for detecting plagiarized source code. This paper shows that the application works good in detecting plagiarism, the hamming distance algorithm and brute force algorithm works better than levenstein distance algorithm for detecting structural type of plagiarism and this thesis also shows that the preprocessing could help the application to increase its percentage and its accuracy. Index Terms—Brute Force, Hamming Distance, Plagiarisme, Preprocessing.

Download Full-text