Judul: Pengaruh Penggunaan Ikan Remang (Muraenasox talabon) dan Telur Itik terhadap Sifat Kimia dan Fisik Kerupuk Udang Cendana (Metapenaeus brevicornis)
Abstrak: Penelitian ini bertujuan untuk mengetahui sampai sejauh mana pengaruh penggunaan ikan remang (Muraenasox -talabon) dan telur itik terhadap sifat kimia dan sifat fisik kerupuk udang cendana (Metapenaeus brevicornis). Rancangan percobaan yang digunakan adalah Rancangan Acak Lengkap pola faktorial dengan ulangan dua kali. Perlakuan yang diterapkan meliputi jumlah telur (0, 1 dan 2 butir ) dan perbandingan berat daging udang dengan daging ikan (4 kg : 0 kg, 2 kg : 2 kg dan 1 kg : 3 kg). Pengamatan secara objektif dilakukan terhadap kadar air , kadar lemak, kadar protein dan kemekaran kerupuk udang. Sedangkan pengamatan secara organoleptik dilakukan terhadap warna, aroma, rasa, kemekaran dan kerenyahan kerupuk udang tersebut.
Keyword: 

Judul: Pengaruh penambahan susu dan pengurangan udang terhadap kandungan bahan kimia dan nilai organoleptik kerupuk udang
Abstrak: Penelitian ini bertujuan untuk mengetahui sampai seja- uh mana pengaruh penambahan susu dan pengurangan udang ter- hadap kandungan bahan kimia dan nilai organoleptik kerupuk udang. Dalam penelitian ini digunakan susu bubuk "full cream" cap "Bendera", jumlah susu yang digunakan adalah: 0 g, 25 g, 50 g, dan 75 g. Sedangkan jumlah udang yang diguna- kan adalah 250g, 200g dan 150 g untuk setiap 500 g te- pung tapioka. Udang yang digunakan adalah udang putih (Penaeus merguiensis). Rancangan yang digunakan adalah Rancangan Acak Lengkap pola Faktorial dengan 2 kali ulangan. Pengamatan dilakukan terhadap kadar protein, kadar air dan tingkat kemekaran ob- yektif. Pengamatan secara organoleptik terdiri atas dua metoda, yaitu pengamatan organoleptik hedonik, di mana peng- amatan dilakukan terhadap warna, aroma, rasa, kemekaran dan kerenyahan; kemudian pengamatan organoleptik deskripsi, di mana pengamatan dilakukan terhadap kenampakan, bau, rasa, dan konsistensi. Penggunaan kedua metoda ini adalah untuk lebih meyakinkan dan untuk memberikan informasi yang lebih banyak tentang sifat-sifat organoleptik kerupuk udang. Dari pengamatan diperoleh hasil bahwa penambahan susu dapat meningkatkan kadar protein, kadar air, nilai ...
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