Judul: Pengaruh perendaman dalam larutan kapur dan lama perendaman dalam larutan gula terhadap kandungan vitamin C dan daya terima manisan nenas
Abstrak: Tujuan penelitian ini adalah untuk mengetahui pengaruh perendaman dalam larutan kapur dan larutan gula terhadap kandungan vitamin C dan daya terima manisan nenas. Perlakuan yang diberikan adalah perendaman dalam larut- an kapur selama 30 menit dengan tiga tingkat konsentrasi yaitu 1, 2.5 dan 5 persen serta perendaman dalam larutan gula konsentrasi 65 persen selama satu, dua dan tiga hari. Pengamatan dilakukan terhadap sifat kimia dan fisik meliputi analisis vitamin C, kadar air, total asam, pH, zat padat terlarut (soluble solid) dan pengukuran kekerasan serta sifat organoleptik (rasa, kekerasan, warna dan bau) manisan nenas.
Keyword: vitamin c

Judul: Pengaruh Perendaman Pepaya (Carica Papaya L.) Dalam Larutan Kapur Dan Larutan Gula Pada Pembuatan Manisan Pepaya Terhadap Mutu Manisan Pepaya
Abstrak: Tujuan penelitian ini adalah untuk mengetahui pengaruh perendaman pepaya dalam larutan kapur dan larutan gula terhadap mutu manisan pepaya yang mencakup kandungan vitamin C dan daya terima konsumen. Penelitian dilakukan selama dua bulan, yang mencakup penelitian pendahuluan dan penelitian lanjutan yaitu mulai pertengahan bulan Mei sampai pertengahan bulan Juli 1984. Perlakuan yang dicobakan adalah perendaman pepaya dalam larutan gula dalam empat tingkat konsentrasi, yaitu 0% (w/w), 5%(w/w), 10%(w/w) dan 15%(w/w) serta perendaman dalam larutan gula dalam empat tingkat lama perendaman, yaitu 1, 2, 3 dan 4 hari. Uji Obyektif meliputi analisis vitamin C, pH, kadar air, kekerasan, kandungan gula dan warna. Untuk mengetahui daya terima konsumen dilakukan uji organoleptik meliputi rasa, kekerasan, dan warna manisan pepaya. Rancangan yang digunakan adalah Rancangan Acak Lengkap dengan percobaan faktorial 4 x 4.
Keyword: manisan pepaya

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