Judul: Karakteristik Bakso Ikan dari Campuran Sumiri dari Ikan Layang (Decapterus spp) dan Ikan Merah (Lutjanus sp) pada Penyimpanan Suhu Dingin
Abstrak: The utilization of Mackerel Scand (Decapterus spp) has not been done yet optimally. This species is potential fish to be processed into sumiri that is a raw material of fish jelly product, such as fishball. Mackerel Scad contains red meat in greater proportion compared using alkaline leaching methode; and mixed with Red Snapper (Lutjanus sp) sumiri to be used a raw material of fishball.
Keyword: 

Judul: Karakteristik Fisik, Kimia, Sensori Gel dan Bakso dari Surimi  Ikan Layaran (Istiophorus orientalis)
Abstrak: Ikan layaran (Istiophorus orientalis.) berpotensi diolah menjadi produk berbasis gel seperti surimi dan bakso ikan. Tujuan penelitian ini adalah untuk mempelajari karakteristik fisik, kimia, sensori gel dan bakso ikan layaran serta membandingkan dengan bakso ikan komersial. Hasil uji karakteristik fisik gel ikan layaran adalah kekuatan gel 1937,0 gf, derajat putih 62,63% dan WHC 87,27%. Karakteristik kimia gel ikan layaran adalah kadar protein 15,63%, kadar lemak 0,20%, kadar air 72,64%, kadar abu 1,98%, kadar karbohidrat 9,54%, dan protein larut garam 2,58%. Hasil uji karakteristik fisik bakso ikan layaran adalah derajat putih bernilai 69,22%, WHC bernilai 65,56% dan kekuatan gel bernilai 766,38 gf. Karakteristik kimia bakso ikan layaran adalah kadar air bernilai 65,97%, kadar protein 10,71%, kadar lemak 3,47%, kadar abu 0,99%, kadar karbohidrat 18,92%, protein larut garam 2,56%, dan nilai pH 7,24. Bakso hasil penelitian lebih baik dibandingkan bakso komersial I dan lebih rendah dari bakso komersial II, tetapi belum sesuai SNI, namun mendapat respon baik dari panelis.
Keyword: 

Judul: Penggunaan Trie dalam Membangun Frequent ltemset Menggunakan Algoritmc FPGrowth
Abstrak: FP-growth algorithm search for frequent itemset using the FP-tree data structure which is a prefix tree structure based on pattern growth algorithm. Prefix tree in FP-Growth uses the trie structure in the relationship pattern among the items in the database. Trie is a tree structure that uses strings as key, where each descendant represents a character or prefix. To find frequent itemset, FP-growth algorithm build prefix tree recursively. However, recursive function may need longer time than the Iterative (Manolopoulos 2003). Goal of this research is to create alternatives iteratively to the development of frequent iternset using trie on the FP-Growth. Research was conducted on several stages for the development of the frequent itcmset using a trie, stage through pruning and without pruning. In the last stages of testing is done using the input parameters, enter the difference in support, the number of transactions, and the items involved. Testing stage compare the execution time in the computing process through the stage with pruning and without pruning. Thing that affects the execution time is the number of items involved in development process of the frequent itemset. Frequent itemset development with the pruning process will he faster than without pruning, hecause at the time to build a combination of frequent itemset, infrequent items are not in the development process.
Keyword: