An Abstract Method Linearization for Detecting Source Code Plagiarism in Object-Oriented Environment

Despite the fact that plagiarizing source code is a trivial task for most CS students, detecting such unethical behavior requires a considerable amount of effort. Thus, several plagiarism detection systems were developed to handle such issue. This paper extends Karnalim's work, a low-level approach for detecting Java source code plagiarism, by incorporating abstract method linearization. Such extension is incorporated to enhance the accuracy of low-level approach in term of detecting plagiarism in object-oriented environment. According to our evaluation, which was conducted based on 23 design-pattern source code pairs, our extended low-level approach is more effective than state-of-the-art and Karnalim's approach. On the one hand, when compared to state-of-the-art approach, our approach can generate less coincidental similarities and provide more accurate result. On the other hand, when compared to Karnalim's approach, our approach, at some extent, can generate higher similarity when simple abstract method invocation is incorporated.Comment: The 8th International Conference on Software Engineering and Service Scienc

TRIQS/CTHYB: A Continuous-Time Quantum Monte Carlo Hybridization Expansion Solver for Quantum Impurity Problems

We present TRIQS/CTHYB, a state-of-the art open-source implementation of the continuous-time hybridisation expansion quantum impurity solver of the TRIQS package. This code is mainly designed to be used with the TRIQS library in order to solve the self-consistent quantum impurity problem in a multi-orbital dynamical mean field theory approach to strongly-correlated electrons, in particular in the context of realistic calculations. It is implemented in C++ for efficiency and is provided with a high-level Python interface. The code is ships with a new partitioning algorithm that divides the local Hilbert space without any user knowledge of the symmetries and quantum numbers of the Hamiltonian. Furthermore, we implement higher-order configuration moves and show that such moves are necessary to ensure ergodicity of the Monte Carlo in common Hamiltonians even without symmetry-breaking.Comment: 19 pages, this is a companion article to that describing the TRIQS librar

On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)

AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment problem

A tabu search procedure for generating robust project baseline schedules under stochastic resource availabilities.

The majority of research efforts in project scheduling assume a static and deterministic environment with complete information. In practice, however, these assumptions will hardly, if ever, be satisfied. Proactive scheduling aims at the generation of robust baseline schedules that are as much as possible protected against anticipated disruptions that may occur during project execution. In this paper, we focus on disruptions that may be caused by stochastic resource availabilities and aim at generating stable baseline schedules, where the solution robustness (stability) of the baseline schedule is measured by the weighted deviation between the planned and the actually realized activity starting times during project execution. We present a tabu search procedure that operates on a surrogate free slack based objective function. The effectiveness of the procedure is demonstrated by extensive computational results obtained on a set of randomly generated test instances.

Desain dan Analisis Algoritma Penyelesaian Permasalahan Penugasan Bersyarat dengan Representasi Bipartite Graph

Permasalahan dalam penelitian ini adalah permasalahan penugasan bersyarat dimana terdapat beberapa pekerjaan dan beberapa orang pekerja. Setiap pekerjaan harus dilakukan oleh semua orang yang ada serta setiap orang memiliki waktu yang dibutuhkan tersendiri dalam menyelesaikan pekerjaan tersebut. Setiap orang hanya dapat mengerjakan sebuah pekerjaan dan sebuah pekerjaan hanya dapat dikerjakan oleh satu orang dalam satu waktu. Pekerjaan yang dimaksud juga bersifat independen dalam artian dapat dilakukan kapanpun oleh setiap orang. Semua orang juga dapat berhenti kapanpun untuk melakukan sebuah pekerjaan tersebut. Penelitian ini akan mengimplementasikan metode pencarian maximum-size matching pada sebuah bipartite graph yang mengacu pada permasalahan penugasan bersyarat. Dalam penelitan ini dibahas algoritma Hopcroft-Karp untuk menyelesaikan permasalahan penugasan bersyarat tersebut dengan menggunakan bahasa pemrograman C++. Dari serangkaian proses penelitian yang telah dilakukan, didapatkan kesimpulan bahwa algoritma yang dirancang sesuai dengan permasalahan ini dipengaruhi secara kuadratik baik oleh jumlah pekerjaan ataupun pekerjanya