Judul: Pengaruh perendaman filet ikan dalam air kelapa terhadap kandungan histamin
Abstrak: Bahan yang diteliti adalah dua jenis ikan yaitu ikan cakalang (katsuwonus pelamis L) dan ikan layang (Decapterus sp). Ikan cakalang dibeli dari TPI Manado dan ikan layang dibeli dari CV Sinar Galaksi Bitung. Untuk ikan cakalang analisa dilakukan ± 27 jam setelah penangkapan, sedangkan untuk ikan layang ± 29 jam setelah penangkapan. Untuk cakalang filet dibuat berukuran 10 x 5 x 4 CM. ikan Analisa dilakukan pada dua lapis yaitu lapisan I adalah pada 0 - 1 cm dan lapisan II pada pada 1 - 2 cm. di buat berukuran 10 x 5 x 1,5 cm. Untuk ikan layang filet Filet dibagi grup. Grup I filet tidak direndam, grup II dalam 4 direndam dengan aquades, grup III direndam dengan air kelapa A direndam dengan air kelapa B. grup Waktu perendaman adalah: ..dst
Keyword: Fish food, Filet ikan, Ikan cakalang

Judul: Pengaruh perendaman dalam air kelapa suhu dan lama pengasapan terhadap komponen zat gizi cakalang (Katsuwonus pelamis) asap khususnya asam lemak tak jenuh omega-3
Abstrak: Penelitian ini bertujuan untuk mempelajari pengaruh perendaman, suhu dan lama pengasapan terhadap komponen zat gizi cakalang, khususnya kandungan asam lemak tak jenuh omega-3. Selain itu juga diamati total asam lemak tak jenuh, total asam lemak jenuh, kadar lemak kasar, kadar protein kasar, kadar air dan penilaian organoleptik meliputi cita rasa dan kesan umum dari fillet cakalang asap. Perlakuan yang diberikan terdiri dari perlakuan perendaman, yang terdiri dari 2 taraf yaitu tidak direndam (A1) dan direndam dalam air kelapa (A2), suhu pengasapan terdiri dari 2 taraf yaitu 80°C (B1) dan 120°C (B2), lama pengasapan 3 taraf yaitu 4jam (C1), 7 jam (C2) dan 10 jam (C3). Analisis asam lemak secara kwalitatif dan kwantitatif dilakukan dengan cara membuat ekstraksi dengan metode Folch et al., 1957. Selanjutnya dimetilasi (pembuatan metil ester) ..dst
Keyword: Smoked fish, Katsuworus pelamis, Nutrition, fillet cakalang asap

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