Judul: Tungau merah tanaman pepaya: Biologi dan keadaan populasinya di Bogor
Abstrak: Tujuan penelitian ini adalah untuk mengetahui biologi tungau merah (Acari: Tetranychidae), keadaan populasi dan musuh alaminya pada pertanaman pepaya di daerah Bogor. Metode yang dilakukan yaitu mengambil tungau Tetrannychus sp. di daerah Cikabayan secara sembarang untuk keperluan perbanyakan. Setelah populasinya cukup banyak dan seragam lalu diambil 120 imago betina dan dimasukkan ke dalam cawan petri yang berisi busa , kapas, dan potongan daun pepaya yang digenangi air untuk menjaga tuangau tidak keluar dari daun. Setiap cawan petri terdapat empat tungau dalam empat potong daun pepaya berukuran 2 x 2 cm. Kemudian dibiarkan selaam satu jam hingga bertelur semua.
Keyword: 

Judul: Populasi Kutu Putih Pepaya Paracoccus marginatus Williams & Granara de Willink (Hemiptera: Pseudococcidae) dan Musuh Alaminya pada Tanaman Pepaya di Kecamatan Dramaga dan Rancabungur, Kabupaten Bogor
Abstrak: Kutu putih pepaya P. marginatus adalah hama penting di Indonesia yang memiliki daya rusak tinggi. Di tempat asalnya, populasi hama P. marginatus dapat dikendalikan oleh berbagai jenis musuh alaminya. Keberadaan musuh alami sangat penting untuk mengendalikan kutu putih pepaya. Namun, pemanfaatan musuh alami saat ini belum pernah diterapkan di lapangan, karena informasi mengenai musuh alami kutu putih pepaya masih sedikit. Oleh karena itu pengamatan langsung di lapangan untuk mengetahui populasi kutu putih pepaya dan musuh alaminya perlu dilakukan. Penelitian ini bertujuan untuk mengetahui populasi kutu putih pepaya dan musuh alaminya di Kecamatan Dramaga dan Rancabungur, Kabupaten Bogor, Jawa Barat. Pemilihan Desa Babakan, Desa Cikarawang, dan Desa Caringin di Kecamatan Dramaga, serta Desa Rancabungur dan Desa Pasir Gaok di Kecamatan Rancabungur dilakukan secara acak. Sampel di Kecamatan Dramaga diambil dari tanaman pepaya di pekarangan. Sampel tanaman pepaya di Kecamatan Rancabungur diambil dari tanaman kebun yang dilakukan dengan pola diagonal. Daun pepaya yang diamati adalah daun nomor 4 yang dihitung dari bawah. Penghitungan populasi kutu putih pepaya dan musuh alaminya dilakukan di laboratorium. Jumlah populasi kutu putih pepaya ditemukan lebih banyak pada tanaman pepaya di Kecamatan Dramaga. Musuh alami yang ditemukan di lapangan adalah Acerophagus papayae, parasitoid famili Encyrtidae, dan kumbang Cryptolaemus montrouzieri. Selain parasitoid dan predator, ditemukan pula cendawan Entomophthorales yang menyerang kutu putih dan serangga hiperparasitoid yang menyerang Acerophagus papayae.
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