Judul: Serangan Asphondylia sp(Diptera:Cecidomyiidae) pada pertanaman cabai keriting di Desa Tugu Selatan, Kecamatan Cisarua dan Desa Cibanteng, Kecamatan Dramaga, Kabupaten Bogor
Abstrak: Hama puru Asphondylia sp. pada tanaman cabai merupakan hama yang relatif baru. Untuk itu dilakukan penelitian mengenai serangan hama puru ini di dua desa di daerah Cisarua dan Darmaga, Bogor yang meliputi keadaan luas serangan, intensitas serangan dan keberadaan parasitoidnya. Penelitian dilakukan baik di lapangan maupun di laboratorium sejak bulan Februari sampai dengan bulan Mei 2005. Luas serangan Asphondylia sp. di Desa Tugu Selatan berkisar antara 21 hingga 41% relatif lebih tinggi dari pada di Desa Cibanteng yang berkisar antara 11 hingga 37%. Intensitas serangan hama ini di Desa Tugu Selatan relatif lebih rendah (0,91% 3,97%) dari pada di Desa Cibanteng (0,69%- 7,49%). Parasitoid yang muncul dari Asphondylia sp. adalah dua spesies dari genus Sigmophora dari Famili Eulophidae dan satu spesies dari genus Erytoma dari Famili Erytomidae. Kedua famili ini termasuk ke dalam Ordo Hymenoptera. Parasitoid di Desa Tugu Selatan ditemukan lebih banyak daripada di Desa Cibanteng.
Keyword: 

Judul: Serangan Asphondylia capsicicola sp. n. (Diptera: Cecidomyiidae) pada Pertanaman Cabai Rawit (Capsicum frutescens L.) di Pertanian Organik Cisarua Bogor
Abstrak: Cabai rawit (Capsicum frutescens L.) merupakan komoditas holtikultura penting dan memiliki nilai ekonomi yang tinggi. Serangan hama Asphondylia capsicicola sp. n. (Diptera: Cecidomyiidae) berpotensi menggangu produksi tanaman cabai rawit. Serangga ini menyebabkan puru pada cabai, dengan gejala terhambatnya pertumbuhan buah. Serangan A. capsicicola juga ditemukan menyerang cabai keriting. Penelitian ini bertujuan untuk mengamati gejala yang ditimbulkan oleh hama A. capsicicola pada tanaman cabai serta mengetahui luas dan intensitas serangannya di pertanaman cabai rawit organik Yayasan Bina Sarana Bakti Cisarua, Bogor. Penelitian dilaksanakan pada bulan Mei-Agustus 2016. Gejala serangan A. capsicicola pada tanaman cabai rawit terjadi pada bagian kuncup, bunga, dan buah muda. Gejala puru lebih banyak ditemukan pada buah muda daripada kuncup dan bunga. Luas serangan A. capsicicola yaitu 32.80 sampai 48.40% dengan total intensitas serangan tinggi pada buah muda yaitu 23.84%. Intensitas serangan pada kuncup adalah 2.07%, dan pada bunga 5.91%. Parasitoid yang ditemukan dalam pengamatan di lapangan yaitu Sigmophora sp. dari Ordo Hymenoptera, Famili Eulophidae
Keyword: hama, intensitas serangan, luas serangan, puru, Sigmophora sp.

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