Gallery — Algorithm

Simple template for Rice COMP 382 Fall 2017.

The minted package provides automatic syntax highlighting for source code listings. It uses the excellent pygments highlighter, which provides very high quality highlighting for a wide range of languages. This example also shows how you can use minted to typeset LaTeX math embedded in your source code.

We are given spans of the target text which align to concepts in the AMR graph.These alignment do not cover every token in the target sentnce. Typically function words are not aligned to any graph fragment. Next, we obtain word alignments between the target sentence and source sentence. Since we have word alignments between target and source, and phrase alignments between target and AMR graph, we must convert the word alingments into phrase alignments. The phrases on the source side will then be projected to the AMR concepts via the target sentence

An indoor positioning system relying on time difference of arrival measurements of ultrasonic pings from fixed transmitters. Code available at https://github.com/YingVictor/ultrasonic-positioning

Considering the growing impact of ideas nowadays, via quaternary sector, the plagiarism detection has become constant in texts, songs, as well as source codes. This work proposes the creation of the tool \nameOfProgram \ for plagiarism detection in simple texts with GNU GPL license. \nameOfProgram \ was designed to allow your extension for plagiarism detection in source codes. The tool was tested and results are presented in this paper.

Alg3 assessment

Euclid's algorithm written out using the algorithmic environment in LaTeX.

By adapting a previously written percolation model in C, the threshold probabilities for square, triangular, and cubic lattice types were confirmed. An algorithm to count the distribution of cluster sizes at a variety of percolation probabilities was developed, and the expected trends towards the so called infinite cluster was achieved. An equivalent bond percolation model was adapted to the original site algorithm, and by treating occupied bonds as springs, a total compression trend for the model was constructed, which implied that structures under the boundary conditions that were imposed does not have behavior that changes the total compression constant significantly at the percolation threshold.\\

Algorithm Template for COMP 182