cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota semarang,
Jawa tengah
INDONESIA
PROXIES
Published by Universitas Katolik Soegijapranata
ISSN : -     EISSN : -     DOI : -
Core Subject : Education,
Education
Arjuna Subject : -
Articles 25 Documents
 1   2   3 
SENTENCE ANALYSIS WITH ARTIFICIAL INTELLIGENCE MACHINE LEARNING USING FINITE STATE AUTOMATA Raditya Putra, Yos Merry
PROXIES Vol 1, No 1 (2017)
Publisher : Universitas Katolik Soegijapranata

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Sentence pattern in Indonesian is very important. Incorrect pattern can cause misinterpretation and different meaning. The basic sentence pattern consists of subject, predicate, and object (SPO). To analyze the sentence, this project implements Finite State Automata (FSA) algorithm, which is useful to identify the class of words in a sentence. The given sentence processed through parsing process to break down the sentence into array of tokens. The program will then examine the tokens to determine the class of each word. The discovered pattern will be checked against existing vocabularies on the database. If the word exists, the program will return a response in accordance to the existing one. Otherwise, the program will store the word onto a temporary file until it find the class of the word. The Intelligence of the program depends on the number of vocabularies on the database. This program supports learning process, so the more sentences given, the more intelligent it gets.
MENEMUKAN AKAR PERSAMAAN POLINOMIAL MENGGUNAKAN PARTICLE SWARM OPTIMIZATION Darmawan, Oei, Edwin Wicaksono; Antonius, Suyanto Edward
PROXIES Vol 1, No 1 (2017)
Publisher : Universitas Katolik Soegijapranata

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Polynomial is a mathematic function which involves multiplication, exponent, and variable. There are some methods to find the root of the function. The method will be more complicated if the highest exponent of the function is 3 or greater. This project will solve the problem using Particle Swarm Optimization algorithm to find the root with an accurate number
CHEAT ENGINE SCRABLE GAME DENGAN ALGORITMA GADDAG Widjaja, Antonius
PROXIES Vol 1, No 2 (2017)
Publisher : Universitas Katolik Soegijapranata

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Scrabble is a word game that tests the players vocabulary. The difficulty of this game depends on the players vocabulary knowledge. The more vocabularies known by the players, the easier it is to play. This project aims to help players who only know a few vocabularies by building a cheat engine application which implements GADDAG Algorithm. All vocabularies stored in trie data structure as a dictionary. This dictionary will be processed using GADDAG Algorithm to find all vocabularies that can be formed. This application will help player to find the vocabulary with the highest value.
PENGHITUNGAN LINGKARAN TAHUN DENGAN EDGE LINKING DAN CHAIN CODE Stephanus, Panji; Wahyuningrum, Shinta Estri
PROXIES Vol 1, No 1 (2017)
Publisher : Universitas Katolik Soegijapranata

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Annual ring is growth ring which exists on tree trunk. Every year, this ring will expand and form new ring. These rings can be the standard to determine the age of a tree. This project aims to count the annual rings using edge linking adn chain code. The image of annual rings will be first converted to grayscale image, then applying median filtering process. And then doing the edge detection process then continued with edge linking. After finished, the next step is doing thresholding to separate the detected annual rings object with the background then count the rings using chain codennual rings object with the background then count the rings using chain code.
VIRTUAL PARALLEL ENVIRONMENT USING PVM CASE STUDY BUBBLE SORT ALGORITHM Pratama, Iwan
PROXIES Vol 1, No 2 (2017)
Publisher : Universitas Katolik Soegijapranata

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Parallel computing is a technique to solve a problem using many CPUs. To perform parallel computing, it requires parallel computer, which is commonly known as supercomputer or multiprocessor computer. Nowadays, a supercomputer is still very expensive. Therefore, parallel algorithm is difficult to be applied in general. To resolve this problem, virtual parallel workstation is created. Virtual parallel workstation is a network of computers controlled by a program that can regulate the allocation of computational processes to processors across the entire network. This project uses PVM (Parallel Virtual Machine) to implement the parallel workstation environment to perform Bubble Sort Algorithm in parallel approach

Page 3 of 3 | Total Record : 25

 1   2   3 

Filter by Year

2012 2017


Reset
Filter By Issues
All Issue Vol 1, No 2 (2017) Vol 1, No 1 (2017) Vol 2, No 1 (2013) Vol 1, No 1 (2012)