Judul: Daya simpan benih pepaya (Carica papaya L.) hasil ekstraksi dengan larutan kapur tohor
Abstrak: Penelitian daya simpan benih pepaya genotipe IPB I dilakukan untuk mengetahui viabilitas benih yang diekstrasi dengan larutan kapur tohor pada berbagai taraf konsentrasi selama penyimpanan dalam kondisi ruang AC maupun ruang suhu kamar.
Keyword: 

Judul: Ketahanan benih beberapa genotipe pepaya(Carica papaya L.) terhadap pengeringan
Abstrak: Tujuan dari penelitian ini adalah untuk mengetahui ketahanan benih beberapa genotipe pepaya (Carica papaya L.) terhadap pengeringan. Penelitian dilakukan pada bulan April 2005 sampai dengan Mei 2006 bertempat di kebun percobaan IPB Tajur dan Laboratorium Ilmu dan Teknologi Benih Leuwikopo kampus Darmaga. Sumber benih diambil dari buah pepaya koleksi Pusat Kajian Buah-buahan Tropika (PKBT) yang ditanam di Kebun Percobaan IPB Tajur, Bogor dengan ketinggian 250 m dpl. Penelitian ini menggunakan metode Rancangan Acak Lengkap (RAL) dengan 3 kali ulangan. Perlakuan yang digunakan adalah lama pengeringan dengan beberapa tahapan waktu. Tahapan waktu mencakup 9 tahap pengeringan yaitu 0, 0.5, 1, 1.5, 2, 2.5, 3, 3.5 dan 4 jam. Benih pepaya yang berasal dari 12 genotipe yaitu IPB 1, IPB 2, IPB 3, IPB 4, IPB 5, IPB 6, IPB 7, IPB 8, IPB 10, G10U2, G12U2, Boyolali dan STR 6-4. Benih pepaya dipanen tidak serentak dengan kisaran waktu 3 hari sekali karena waktu masak buah yang tidak sama. Pada akhir lama pengeringan dilakukan uji Tetrazolium (TTZ) untuk mengetahui viabilitas benih. Hasil penelitian menunjukkan bahwa setiap genotipe tahan terhadap pengeringan berdasarkan nilai viabilitas benih. Benih-benih tersebut mampu tumbuh walau dalam kadar air yang sangat rendah (<6%). Genotipe IPB 5 memiliki viabilitas yang tetap tinggi hingga akhir waktu pengeringan yang diindikasikan oleh nilai PTM (87.50%), DB (80%) dan KCT (6.36%/etmal) maksimum.
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