Judul: Studi penanganan buah ketimun (Cucumis sativus L.) pada periode konservasi dengan menggunakan modifikasi atmosfir untuk mempertahankan viabilitas benih
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh cara penanganan buah ketimun (Cucumis sativus L.) selama periode konservasi dengan modifikasi atmosfir. Penelitian dilaksanakan pada bulan Maret sampai bulan Juli 1994 di Ciawi, Bogor untuk pengadaan benih; pengisian gas di PT Aneka Gas industri (Persero), Jakarta; Penyim- panan buah di Laboratorium Biokimia dan Ilmu Hayat PAU- IPB; Pengujian benih di Laboratorium Ilmu dan Teknologi Benih IPВ. Penelitian disusun secara faktorial dengan menggunakan Rancangan Acak Kelompok yang terdiri dari tiga faktor. Faktor pertama adalah tingkat kemasakan terdiri dari buah 27 hari setelah berbunga (HSB) dan 32 HSB. Fak- tor kedua adalah kondisi konservasi terdiri dari kondisi atmosfir normal (78% N2: 21% 02 0.03% CO2) pada suhu din- gin; kondisi atmosfir dimodifikasi (90% N2: 5% 02: 5% CO2) pada suhu dingin; kondisi atmosfir normal pada suhu kamar. Faktor ketiga adalah periode konservasi buah terdiri dari konservasi 0, 4 8, dan 12 hari. Masing-masing perlakuan diulang tiga kali sehingga terdapat 24 kombinasi perlakuan. ...
Keyword: 

Judul: Pengaruh perlakuan priming pada beberapa taraf kadar air benih kayumanis (Cinnamomum zaylanicum) terhadap viabilitasnya selama periode konservasi
Abstrak: Tujuan penelitian ini adalah untuk mengetahui pengaruh perlakuan priming pada beberapa taraf kadar air benih kayumanis (Cinnamomum zeylanicum) terhadap viabilitasnya selama periode konservasi. Penelitian dilaksanakan di Laboratorium Fisiologi Balai Penelitian Tanaman Rempah dan Obat Cimanggu-Bogor, mulai dari bulan Agustus 1995 sampai dengan Februari 1996. Bahan yang digunakan adalah benih kayumanis (C. zeylanicum) yang dipanen saat kulit buah berwarna hitam (masak penuh) dan belum lepas dari tangkainya, kertas merang, serbuk gergaji, aquadest, KNO3, KH2PO4, Delsene MX-200, Dithane M-45. Alat yang digunakan adalah APB IPB 72-1, alat pengepres kertas merang IPB 75-1, Oven 105 °C. Dryer Heraus, Aluminium Foil, kantung plastik, box plastik, timbangan, thermometer, desikator, erlenmeyer 100 ml. Rancangan percobaan yang dipakai adalah Split-Split Plot dalam rancangan dasar RAK dengan tiga faktor. Faktor pertama (petak utama) periode konservasi (K) dengan empat taraf yaitu K_{1} = 0 hari, K_{2} = 7 hari, K_{3} = 14 hari dan K_{4} = 21 hari. Faktor kedua (anak petak) adalah kadar air (A) dengan tiga taraf yaitu A = >35%, A_{2} = 31 - 35% * dan*A_{3} = 25 - 30% Faktor ketiga (anak-anak petak) ada- Jah priming (P) dengan delapan taraf yaitu P₁ = kontrol, P₂ = Air, P3 KNO3 0.1 M. P_{4} = KN*O_{3} * 0.05M P_{5} = KN*O_{3} * 0.025M P_{6} = K*H_{2}*P*O_{4} * 0.1M P7 KH2PO4 0.05 M. P_{8} = K*H_{2}*P*O_{4} * 0.025M Keseluruhan terdapat 96 kombinasi perlakuan dan diulang sebanyak tiga kali sehingga diperoleh 288 satuan percobaan. Penggunaan serbuk gergaji lembab yang memiliki kadar air rata-rata 52.43% dan suhu dalam boks penyimpanan terukur rata-rata 25.5 °C berhasil menjaga kadar...
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