Judul: Evaluasi karakter morfologi galur mutan cabai keriting(Capsicum annuum L.) hasil radiasi gamma
Abstrak: Penelitian ini dilakukan untuk mengevaluasi karakter morfologi galur mutan cabai keriting (C. annuum L.) hasil iradiasi gamma. Penelitian dilaksanakan di lahan produksi PT. Surya Bumi Manunggal (SBM) yang berlokasi di Ciawi pada bulan Juni-Desember 2004. Penelitian menggunakan Rancangan Kelompok Lengkap Teracak dengan empat ulangan. Galur yang dievaluasi adalah sembilan galur mutan cabai keriting (C. annuum) yaitu MKr 1411, MKr 1423, MKr 1711, MKr 1723, MKr 1011, MKr 1013, MKr 1052, MKr 3011, MKr 6052, Pembanding pertama adalah varietas cabai keriting lokal yang tidak diiradiasi dan merupakan induk atau asal mutan cabai yang dievaluasi dan pembanding kedua varietas Tegar yang sering ditanam di lahan petani. Pengamatan dilakukan terhadap tinggi tanaman, lebar tajuk, umur berbunga, umur panen pertama, jumlah tanaman per plot, bobot dan jumlah buah baik per plot, bobot dan buah rusak per plot, jumlah tanaman yang terserang per plot, tingkat serangan hama dan penyakit, panjang buah, diameter buah pada pangkal dan tengah. Pengamatan deskriptif dilakukan terhadap warna buah dan sifat buah, menggantung atau tegak. ...
Keyword: 

Judul: Evaluasi karakter morfologi dan daya hasil 11 galur cabai (Capsicum annuum L.) introduksi AVRDC di kebun percobaan IPB Tajur
Abstrak: Pecobaan ini bertujuan untuk mengevaluasi karakter morfologi dan daya hasil 11 galur cabai (Capsicum annuum L.) introduksi dari Asian Vegetable Research Development Center (AVRDC). Percobaan ini dilaksanakan pada bulan Februari hingga Agustus 2008 di Kebun Percobaan IPB Tajur, Bogor, Jawa Barat. Rancangan yang digunakan adalah Rancangan Kelompok Lengkap Teracak (RKLT) sedangkan galur yang dievaluasi adalah 11 galur cabai dan 2 varietas pembanding dengan tiga ulangan sehingga terdapat 39 satuan percobaan. Galur yang digunakan adalah galur 0706-6584-4, 0706-6587-1, 0706-6587-2, 0707-7504-BK, 0707-7505-BK, 0707-7643-2, 0707-7644-1, 0707-7645-1, 0707- 7646-1, 0707-7650-1, dan 0707-7651-1. Varietas yang digunakan sebagai pembanding adalah Tit Super dan Tanjung.
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