Judul: Dinamika populasi wereng pucuk teh, empoasca flavescens (F) (Homoptera : Cicadellidae), dan kajian pemangsaan salticidae
Abstrak: Wereng pucuk teh (WPT), Empoasca flavescens (F.) (Homoptera : Cicadellidae), merupakan hama baru di perkebunan teh di Indonesia. Belum banyak diketahui tentang kehidupan dan dinamika populasi hama ini. Penelitian dilakukan di perkebunan teh rakyat, Desa Cirumput, Kecamatan Cugenang, Kabupaten Cianjur, Jawa Barat, mulai dari bulan April hingga September 2004, dengan tujuan untuk memahami perkembangan dan pola tebaran populasi WPT serta preferensi dan kemampuan pemangsaan laba-laba Salticidae.
Keyword: 

Judul: Kelimpahan Populasi Wereng Batang Cokelat, Nilaparvata lugens Stảl (Hemiptera: Delphacidae) dan Cendawan Entomophthorales pada Tanaman Padi.
Abstrak: Wereng batang cokelat (WBC), Nilaparvata lugens Stảl merupakan salah satu hama paling merugikan di Indonesia. Pada keadaan populasi wereng yang tinggi, serangannya dapat menyebabkan tanaman padi mengering seperti terbakar yang disebut hopperburn. Cendawan Entomophthorales diketahui sebagai salah satu musuh alami penting WBC. Namun, sampai saat ini informasi mengenai cendawan Entomophthorales yang menginfeksi WBC di pertanaman padi masih sangat sedikit. Sehingga penelitian ini bertujuan menentukan keberadaan cenda-wan Entomophthorales dan tingkat infeksinya serta hubungannya dengan kelim-pahan populasi wereng batang cokelat pada pertanaman padi di Bogor dan Su-bang. Penelitian dilaksanakan dari bulan Desember 2015 hingga Juni 2016. Po-pulasi WBC diamati setiap minggu sebanyak 3 kali. Sampel serangga diperoleh dari Desa Cibitung Kulon dan Desa Cibitung Wetan, Kecamatan Pamijahan, Ka-bupaten Bogor dan Desa Kiarasari, Kecamatan Compreng, Kabupaten Subang. Sampel tersebut dimasukkan ke dalam alkohol 70% dan dibuat preparat dengan pewarna lactophenol cotton blue. Preparat diamati di bawah mikroskop untuk me-nentukan keberadaan fase cendawan yang menginfeksi WBC, yaitu: konidia se-kunder, badan hifa, konidiofor dan konidia primer, resting spores, dan cendawan saprofit. Hasil pengamatan menunjukkan bahwa WBC terinfeksi cendawan Ento-mophthorales. Fase cendawan yang ditemukan menginfeksi WBC adalah konidia sekunder, badan hifa, konidia primer, dan cendawan saprofit. Rata-rata rata-rata tingkat infeksi cendawan pada WBC sebesar 85.94%, 93.40%, dan 100% masing-masing dari Cibitung Wetan, Cibitung Kulon, dan Kiarasari.
Keyword: cendawan Entomophthorales, hama, padi, wereng batang cokelat

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