Judul: Pengaruh Bahan Pemutih Hidrogen Peroksida (H₂0₂) Terhadap Mutu Kerupuk Teripang Pasir (Holothuria scabra)
Abstrak: Kerupuk teripang merupakan salah satu hasil diversifikasi pengolahan teripang yang mulai berkembang di Indonesia. Tempat yang menghasilkan produk ini adalah Madura dan Surabaya. Cara pengolahannya masih bersifat tradisonal sehingga mutu produk yang dihasilkan kurang menarik perhatian konsumen, khususnya dari segi penampakan. Salah satu alternatif untuk menarik perhatian konsumen pada penampakan produk teripang adalah dengan mengolahnya menjadi bentuk yang lebih menarik. Untuk memperbaiki penampakan pada produk kerupuk teripang, diperlukan suatu usaha untuk memutihkannya. Bahan kimia yang digunakan pada penelitian ini adalah hidrogen peroksida (H₂0₂). Hidrogen peroksida (H₂0₂) sebagai bahan pemutih sudah digunakan dalam pembuatan FPC (Fish Protein Concentrate).
Keyword: 

Judul: Pengaruh perendaman dalam bahan pemutih Hidrogen Peroksida (H2O2) terhadap mutu dan rendemen kerupuk kulit Cucut Lanyam (Carcharinus limbatus)
Abstrak: Tujuan penelitian ini adalah untuk mempelajari pengaruh perendaman dalam bahan pemutih hidrogen peroksida terhadap mutu dan rendemen kerupuk kulit cucut lanyam (Carcharhinus limbatus) serta untuk menentukan waktu perendaman yang menguntungkan agar didapatkan mutu kulit cucut yang lebih baik. R Parameter yang diamati adalah rendemen kerupuk kulit, kadar air, kadar protein, residu hidrogen peroksida, derajat keputihan, kemekaran, dan kerenyahan. Rancangan percobaan yang digunakan adalah rancangan acak lengkap faktorial dengan dua faktor dan dua kali ulangan. Adapun faktor-faktornya adalah konsentrasi hidrogen peroksida (A) yang terdiri atas 3 taraf (0% (Al), 1% (A2), 2% (A3)) dan lama perendaman dalam bahan pemutih hidrogen peroksida (B) yang terdiri atas 4 taraf (3 jam (B1), 6 jam (B2), 9 jam (B3), dan 12 jam (B4)}; adapun data uji organoleptik warna, tekstur, penampakan, aroma, dan rasa analisanya menggunakan metode Friedman Test serta uji lanjutnya menggunakan Multiple Comparison. Hasil analisa rendemen kerupuk kulit 14.59 % 32.19%, kadar air 7.45 % 12.50%, kadar protein 40.51 % 43.66%, residu hidrogen peroksida 0.06 ppm 0,15 ppm, ...
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