Judul: Pengaruh Ketiadaan Inang Terhadap Tanggap Reproduksi Trichogrammatoidea armigera Nagaraja dan Trichogramma japonicum Ashmed (Hymenoptera Trichogrammatidae) dan Implikasinya Terhadap Penerimaan Inang
Abstrak: Penditian dilaksanakan bulan Febnzari sampai dmgan bulan Juni 2001 di Labmatorium Bioekologi ParasiCod dan Redator? Jurusaa Hama dan Penyakit Tumbuhan IPB. Tujuan dari ptnelitian ini adalah untuk mengetahui pengad ketiadaan inang terhadap tanggap reproduksi Trichogrammatoi&a armigera dan Trichogrumma japonicum .
Keyword: 

Judul: Pengaruh Ketiadaan Inang terhadap Biologi Reproduksi Parasitoid Apanteles taragamae Viereck (Hymenoptera: Braconidae).
Abstrak: Apanteles taragamae Viereck (Hymenoptera: Braconidae) merupakan endoparasitoid utama larva Diaphania indica Saunders (Lepidoptera: Crambidae) yang bersifat gregarius. Keberhasilan pengendalian hayati menggunakan parasitoid sangat tergantung pada perilaku reproduksi imago betina parasitoid, terutama yang berhubungan dengan ketersediaan inang yang dapat memengaruhi perilaku peletakkan telur. Penelitian ini bertujuan untuk memelajari pengaruh dari ketiadaan inang terhadap perilaku dan kapasitas reproduksi parasitoid A. taragamae. Penelitian dilakukan dengan cara memberikan perlakuan ketiadaan inang selama 1, 2, 3, dan 4 hari di awal kemunculan A. taragamae menjadi imago (ketiadaan inang di depan) dan setelah A. taragamae mendapatkan inang terlebih dahulu (ketiadaan inang di belakang). Parameter yang diamati adalah jumlah telur yang diletakkan dan tingkat parasitisasi pada hari pertama setelah perlakuan, waktu pencarian dan penanganan inang pertama setelah perlakuan, total telur yang diletakkan, sisa telur dalam ovari, potensi produksi telur, serta lama hidup imago A. taragamae. Hasil penelitian menunjukkan bahwa perlakuan ketiadaan inang memberikan pengaruh terhadap jumlah telur yang diletakkan pada hari pertama setelah perlakuan, waktu pencarian dan penanganan inang pertama setelah perlakuan, serta telur yang tersisa dalam ovari. Peningkatan lama hari ketiadaan inang dapat meningkatkan jumlah telur yang diletakkan pada hari pertama setelah perlakuan serta lama hidup, tetapi menurunkan total telur yang diletakkan dan potensi produksi telur. Imago A. taragamae pada perlakuan ketiadaan inang di depan meletakkan telur yang lebih banyak pada hari pertama setelah perlakuan, namun memerlukan waktu lebih lama dalam mencari dan menangani inang pertama dibandingkan imago A. taragamae pada perlakuan ketiadaan inang di belakang.
Keyword: Diaphania indica, oviposisi, parasitoid, penyerapan telur

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