Judul: Pengaruh pemasakan sayuran di rumah tangga terhadap daya retensi zat yodium dari beryodium
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh proses pemasakan sayuran secara rumah tangga terhadap daya retensi zat yodium yang berasal dari garam beryodium. Selain itu untuk mengetahui cara pemasakan yang paling efisien dalam mempertahankan kadar zat yodium dari garam beryodium yang dipergunakan. Penelitian berlangsung selama tiga bulan, mulai dari bulan Mei sampai dengan bulan Juli 1983. Bahan yang dipergunakan adalah garam beryodium merek 'Jempol', sayuran wortel, bayam dan labu siam. Bahan-bahan tersebut diperoleh dari Pasar Bogor di Bogor.
Keyword: sayuran

Judul: Mempelajari retensi iodium pada makanan berbagai tingkat keasaman
Abstrak: Tujuan umum penelitian ini adalah untuk mempelajari retensi iodium pada makanan olahan yang mempunyai tingkat keasaman berbeda (sayur asem, sayur sop dan tumis buncis) Tujuan khusus penelitian adalah menentukan nilai keasaman (pH) sayur matang, menentukan kadar iodium dari garam beriodium dan tiap jenis bahan makanan sebagai bahan dasar pembuat sayur asem, sayur sop, dan tumis buncis, menentukan kadar iodium makanan setelah dimasak dengan dan tanpa garam beriodium, serta mempelajari retensi iodium akibat proses pemasakan. Retensi iodium diartikan sebagai ba- nyaknya iodium yang dapat ditahan didalam sayur matang. Penelitian dilakukan di Laboratorium Pengolahan Pangan dan Laboratorium Analisis Makanan, Jurusan Gizi Masyarakat dan Sumberdaya Keluarga, IPB dari bulan Oktober sampai Desember 1995. Bahan-bahan yang digunakan untuk membuat sayur olahan adalah bahan untuk membuat sayur asem, sayur sop, dan tumis buncis yang terdiri dari kacang panjang, labu siam, jagung, kentang, wortel, kol, buncis, tomat, asam muda, kaldu sapi "maggi", kacang tanah, santan serta bumbu-bumbu yang biasa ditambahkan dalam makanan tersebut. Bahan-bahan diperoleh dari pedagang sayur di Jakarta. Bahan-bahan kimia yang digunakan merupakan bahan kimia untuk analisis kadar air metode immiscible solvent distillation dan bahan kimia untuk analisis kadar iodium metode spektrofotometri serium sulfat (PAMM Method). Analisis kadar air dan kadar iodium pada sayur dilakukan terhadap sayur yang telah dihomogenkan bersama cairan (kuahnya).
Keyword: retensi iodium

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