Judul: Indikator Karotenoid untuk Menentukan Masak Fisiologi Benih Cabai Rawit (Capsicum /rulescens L.) Varietas Sulawesi dan Rama
Abstrak: Penelitian ini dilaksanakan di kebun percobaan Leuwikopo, Laboratorium Ilmu dan Teknologi Benih dan Laboratorium RGCI (Research Group on Crop Improvement) Departemen .Agronomi dan Holtikultura, Fakultas Penanian. Institut Penanian Bogor. Pelaksanaan penelitian dilakukan pada bulan September 2006 - Juni 2007. Penelitian ini bertujuan untuk mengetahui kemungkinan total karotenoid benih dapat digunakan sebagai indikasi tingkat masak fisiologi pada benih cabai rawit dan hubungannya dengan tolak ukur tingkat masak fisiologi lainnya.
Keyword: 

Judul: Kemungkinan karotenoid sebagai indikator tingkat masak fisiologi benih jagung manis, Zea mays saccharata Sturt.
Abstrak: Penelitian ini bertujuan untuk mendapatkan cara penentuan masak fisiologi benih yang cepat menggunakan total karotenoid benih sebagai indikator dan hubungannya dengan tolok ukur fisiologi tingkat kemasakan benih yang lain. Penelitian ini dilaksanakan di Kebun Produksi Benih Kampung Neglasari, Desa Tugujaya Kecamatan Cigombong dan Laboratorium Pusat Studi Pemuliaan Tanaman serta Laboratorium Ilmu dan Teknologi Benih Fakultas Pertanian IPB. Percobaan dilaksanakan pada bulan Februari 2005 sampai Juli 2005. Rancangan yang digunakan dalam penelitian ini adalah Rancangan Acak Kelompok (RAK) dengan faktor tunggal dan tiga ulangan. Setiap ulangan terdiri dari tujuh satuan percobaan dengan tujuh taraf umur panen yang ditempatkan secara acak. Setiap satu satuan percobaan terdapat 36 tanaman. Ketujuh taraf perlakuan umur panen adalah: K, umur panen 76 hari setelah tanam (HST), K₂= umur panen 80 HST, K₁ = umur panen 84 HST, K, umur panen 88 HST, Ks = umur panen 92 HST, K₁ = umur panen 96 HST, K₁ = umur panen 100 HST. Pengamatan dilakukan terhadap indikasi fisiologi yang meliputi kadar air, bobot kering benih, daya berkecambah, kecepatan tumbuh, bobot 1000 butir dan terhadap indikasi biokimiawi yaitu total karotenoid benih jagung manis kering, masing-masing pada umur panen K1, K2, K3, K4, K5, K6 dan K₁. Keeratan hubungan antara tolok ukur total karotenoid benih dengan tolok ukur fisiologi tingkat kemasakan dilihat dengan menggunakan analisis regresi dan korelasi. Hasil percobaan menunjukkan bahwa perlakuan umur panen berpengaruh sangat nyata terhadap kadar air dan vigor benih dengan tolok ukur bobot 1000 butir, kecepatan tumbuh, bobot kering benih dan total karotenoid benih. Perlakuan umur panen 78100 HST tidak mempengaruhi viabilitas potensial dengan tolok ukur daya berkecambah. ...
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