Judul: Pengaruh pengolahan dan penyimpanan terhadap kandungan mikroorganisma dan dayacerna protein Naniura ikan mas (Cyprinus carpio L)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh pengolahan dan penyimpanan naniura ikan mas terhadap kandungan mikroorganisme dan dayacerna protein. Penelitian dilakukan dalam dua tahap yaitu pendahuluan dan lanjutan. Pada penelitian pendahuluan dilakukan penentuan proporsi bahan yang diperlukan untuk pembuatan naniura; penentuan lama perendaman ikan mas dalam larutan garam air perasan jeruk nipis dan rempah-rempah; dan penentuan lama waktu ikan mas mengalami kerusakan. Pada penelitian lanjutan, ikan mas yang digunakan terdiri dari tiga kondisi yaitu : kontrol, segar dan agak rusak, dan dilakukan penyimpanan pada suhu kamar dan suhu es (6°C). Sela Selanjutnya dilakukan penentuan kadar protein, dayacerna protein, pH, kandungan mikroba proteolitik, mikroba lipolitik, mikroba patogen Salmonella dan test organoleptik. Test organoleptik dilakukan untuk mengetahui dayaterima konsumen, panelis yang berjumlah 30 orang. Data hasil penelitian yang diperoleh, diolah secara statistik menggunakan sidik ragam Rancangan Acak Lengkap Faktorial dan uji Tukey serta ujit sebagai uji lanjutannya, sedangkan hasil uji organoleptik dianalisis dengan uji Friedman dan uji perbandingan berganda (Steel dan Torrie, 1984). Hasil uji bakteri patogen Salmonella ditabulasi dan dianalisis secara deskriptif.
Keyword: ikan mas

Judul: Mempelajari Pengaruh Suhu Dan lama Penyimpanan Terhadap Daya Simpan Ikan Mas (Cyprinus carpio LINN)
Abstrak: Tujuan penelitian ini adalah mengetahui pengaruh suhu dan lana penyimpanan torhadep daya simpan ikan Mas (Cyprinus carpio LINN). Penyimpanan ikan lias dilakukan dengan menggunakan lemari es pada dua taraf suhu, yaitu -10 sampai -5°C dan O sampai 5°C selane 12 hari. Analisis dilakukan terhadap kadar air, kadar protein, TVN, VRS, pH, uji mikrobiologi dan uji organoleptik selama dua hari satu kali. Hasil percobaan menunjukkan kenaikan nilai-nilai TVN, VRS, PH dan jumlah koloni bakteri, serta penurunan kadar air, kadar protein, dan nilai organoleptik selama penyimpanan. Hasil analisis keragaman menunjukkan pengaruh yang sangat nyata pada setiap perlakuan suhu, lena penyiapanan, dan interaksi antara suhu dan lama penyimpanan ter hadap kadar air, kadar protein, TVA, VIS, pil, dan uji mikrobiologi. Hasil analisis keraganan uji organoleptik menunjuk- kan pengaruh yang sangat nyata untuk porlakuan suhu dan lama penyimpanan, tetapi interaksi di antara ke dua faktor tersebut tidak menunjukkan pengaruh yang nyata. Dengan perkataan lain, bahwa ko dua faktor tersebut bebas satu sana lain. Daya simpan ikan Mas lebih tahen pada suhu -10 sampai -5°C dibandingkan dengan suhu O sampai 5°C. Ikan Mas yang disimpan pada suhu 0 sampai 5°C hanya bertahan sampai sekitar 12 hari, sedangkan pada suhu -10 sampai -5°C tahan sampai sekitar 16 hari berdasarkan uji kimiawi dan organo- leptik secara visual.
Keyword: 

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm