Judul: Kemunduran Mutu Ikan Mas (Cyprinus carpio) selama Penyimpanan pada Suhu Ruang.
Abstrak: Kurangnya pemahaman tentang kualitas ikan menyebabkan banyaknya kerusakan (pembusukan ikan) pada saat pasca panen ikan. Penelitian ini bertujuan untuk mempelajari laju perubahan mutu ikan mas segar dengan cara pembuangan isi perut dan penyusunan melalui uji organoleptik, uji TVB, uji TPC dan uji hiatologis selama penyimpanan pada suhu ruang. Penentuan kesegaran ikan pada penelitian ini dilakukan berdasarkan pengujian Organoleptik, TVB, TPC, dan jaringan daging ikan mas. Pengamatan dilakukan setiap 2 jam sekali selama 8 jam. Nilai uji organoleptik ikan mas selama pengamatan 8 jam yaitu 8. Nilai TVB menunjukkan bahwa terdapat peningkatan, nilai tertinggi ditemukan pada perlakuan gelar dan dengan isi perut sebesar 8,19 mg N/100 g. Jumlah total mikroba ikan mas selama 8 jam mengalami peningkatan pada jam ke-8 untuk semua perlakuan nilai berkisar antara 4,89-6,20 log CFU/g. Perlakuan yang diberikan terhadap ikan mas (gantung dan gelar) dan (tanpa isi perut dan utuh) tidak menunjukkan adanya perbedaan pada keadaan jaringan fillet bagian dorsal dan anal, sedangkan kerusakan miomer terjadi secara massif pada jam ke-8. Ikan mas setelah dilakukan pengujian selama 8 jam masih layak untuk dikonsumsi berdasarkan nilai TVB dan TPC.
Keyword: Ikan mas, jaringan daging ikan mas, organoleptik, TVB, TPC

Judul: Pengaruh Pemuasaan dan Transportasi terhadap Kemunduran Mutu Ikan Mas (Cyprinus carpio).
Abstrak: Ikan mas (Cyprinus carpio) banyak digemari masyarakat baik dari kalangan menengah ke bawah maupun kalangan menengah ke atas. Metode yang dilakukan menggunakan pemuasaan 0, 2, 4, dan 6 hari serta melakukan pengamatan kemunduran mutu dengan cara penilaian organoleptik, pengukuran pH daging, dan menghitung nilai Total Volatile Base (TVB). Penelitian ini bertujuan menentukan perubahan komposisi kimia ikan setelah mengalami pemuasaan sebelum ditransportasikan maupun pasca transportasi, serta untuk menentukan pengaruh pemuasaan dan transportasi terhadap kemunduran mutu ikan. Kadar air ikan mas tertinggi sebesar 81,57% dan kadar air terendah sebesar 79,75%. Kadar protein ikan mas tertinggi 16,50% dan kadar protein terndah sebesar 12,25%. Kadar lemak ikan mas tetinggi sebesar 3,37% dan kadar lemak terendah sebesar 1,09%. Nilai pH tertinggi ikan mas pada fase postrigor sebesar 6,71 dan terendah pada fase prerigor sebesar 6,15. Nilai TVB mengalami peningkatan selama penyimpanan. Nilai terendah TVB pada fase prerigor sebesar 9,21 mgN/100g dan fase postrigor tertinggi sebesar 22,15 mgN/100g.
Keyword: ikan mas, pemuasaan, pH, TVB

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