Judul: Pengaruh Proses Penyiangan terhadap Nilai Organoleptik dan Komposisi Kimia Pindang Ikan Kantung Semar (Mene maculata).
Abstrak: Mene maculata merupakan salah satu ikan ekonomis yang banyak dikonsumsi oleh masyarakat. Pengolahan yang umum dilakukan pada ikan tersebut yaitu pemindangan. Proses pemindangan dapat mempengaruhi kualitas dan nilai gizi ikan. Salah satu upaya untuk mengurangi tingkat kemunduran mutu ikan adalah dengan cara penyiangan. Penyiangan ikan dapat menghilangkan sebagian besar bakteri pembusuk yang terdapat pada organ ikan, yaitu insang, sisik, dan isi perut. Penelitian ini bertujuan menentukan pengaruh proses penyiangan serta suhu penyimpanan terhadap nilai organoleptik dan komposisi kimia pindang ikan Mene maculata. Pemindangan dilakukan menggunakan ikan yang diberi perlakuan penyiangan dan tanpa penyiangan pada suhu 95-100oC selama ± 70 menit, dengan konsentrasi garam 7.5%, disimpan pada suhu ruang dan suhu dingin selama 6 hari. Pengujian yang dilakukan meliputi uji organoleptik, analisis proksimat, protein larut air dan protein larut garam. Hasil penelitian menunjukkan proses penyiangan pada pembuatan pindang ikan serta suhu penyimpanan memberikan pengaruh yang nyata terhadap parameter organoleptik, namun tidak memberikan pengaruh nyata pada komposisi kimia. Penyimpanan suhu chilling mampu menahan laju kemunduran mutu pindang ikan kantung semar.
Keyword: komposisi kimia, Mene maculata, pemindangan, penyiangan

Judul: Kemunduran Mutu Ikan Patin (Pangasius sp.) selama Penyimpanan Suhu Dingin melalui Pengamatan Kimia dan Histologis Daging.
Abstrak: Ikan patin (Pangasius sp.) merupakan ikan komoditas penting. Oleh karena itu, perlu upaya dalam mengubah persepsi konsumen terhadap kondisi mutu ikan patin. Ikan patin mudah sekali mengalami kerusakan dan kemundran mutu. Tujuan penelitian ini adalah menentukan kemunduran mutu ikan patin secara organoleptik, kimia (pH dan TVB), dan histologi (daging dorsal, kulit, dan insang) selama penyimpanan suhu dingin. Hasil penelitian menunjukkan bahwa nilai organoleptik ikan patin fase pre rigor terjadi pada hari ke-0 sampai hari ke-2, rigor mortis terjadi pada hari ke-2 sampai hari ke-8, post rigor terjadi pada hari ke-8 sampai hari ke-14, dan busuk terjadi pada hari ke-14. Nilai pH dan TVB mengalami peningkatan selama kemunduran mutu. Perubahan struktur daging dorsal dan kulit terjadi pada fase rigor mortis dan post rigor, sementara kerusakan insang terjadi pada fase post rigor.
Keyword: Histologi, ikan patin, kemunduran mutu, organoleptik, 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