Abstract

Abstract-The research has implemented document summarizing system uses TextRank algorithms and Semantic Networks and Corpus Statistics. The use of TextRank allows extraction of the main phrases of a document that used as a sentence in the summary output. The TextRank consists of several processes, namely tokenization sentence, the establishment of a graph, the edge value calculation algorithms using Semantic Networks and Corpus Statistics, vertex value calculation, sorting vertex value, and the creation of a summary. Testing has done by calculating the recall, precision, and F-Score of the summary using methods ROUGE-N to measure the quality of the system output. The quality of the summaries influenced by the style of writing, the selection of words and symbols in the document, as well as the length of the summary output of the system. The largest value of the F-Score is 10% of the length ta of the document with the F-Score 0.1635 and 150 words with the F-Score 0.1623.

This paper proposed processing framework in essay answer for Automatic Scoring System based on computational. Framework is built with the initial process by normalizing through stop words removal, building case homogeneous, stemming, common spelling mistakes correction, and acronym and common abbreviation analysis. The next step is to examine the similarity by carrying out similarity and classification analysis. The process in the Framework that has been built using reference essay answers as references that will be examined for similarity with the answer to the question. Similarities are matched by using features generated in the features extraction process. Then the training classification process is carried out to produce the model. The model is used to determine the classification score. Classification scores are validated by looking at the value of accuracy and the resulting similarity scores. This framework can be used to process essay problem patterns which have 2 predetermined classification classes, although for more classifications it can be handled with an improved algorithm implemented.

Data security is a very important compilation using cloud computing; one of the research that is running and using cloud technology as a means of storage is G-Connect. One of the developments made by the G-Connect project is about data security; most of the problems verification of the data sent. In previous studies, Keccak and RSA algorithms have implemented for data verification needs. But after a literature study of other algorithms that can make digital signatures, we found what is meant by an algorithm that is better than RSA in rectangular speeds, namely Digital Signature Algorithm (DSA).DSA is one of the key algorithms used for digital signatures, but because DSA still uses Secure Hash Algorithm (SHA-1) as an algorithm for hashes, DSA rarely used for data security purposes, so Keccak is used instead of the hash algorithm on DSA. Now, Keccak become the standard for the new SHA-3 hash function algorithm. Because of the above problems, the focus of this research is about data verification using Keccak and DSA. The results of the research are proven that Keccak can run on DSA work system, obtained a comparison of execution time process between DSA and RSA where both use Keccak.

No abstract

No abstract

No abstract

No abstract