Judul: Parasit pada Sayur Konsumsi di Sekitar Kampus IPB Dramaga Bogor.
Abstrak: Sayur merupakan makanan penting karena sangat manfaat untuk kesehatan dan metabolisme tubuh. Kebelakangan ini dengan kemajuan ilmu pengetahuan dan teknologi ditemukan ada peningkatan jumlah kasus food-borne disease karena mengonsumsi sayur mentah. Food-borne disease akibat penularan parasit intestinal atau protozoa merupakan suatu masalah kesehatan masyarakat yang umum pada negara berkembang. Tujuan penelitian ini dilakukan adalah untuk mengidentifikasi dan mengetahui prevalensi parasit yang mengontaminasi sayur yang umum dikonsumsi masyarakat di sekitar Dramaga, Bogor. Sebanyak 5 sampel sayur diantaranya bayam, kangkung, pakcoy, kol dan kemangi yang berasal dari pasar Cibeureum, Dramaga, Bogor. Metode penelitian ini dilakukan dengan metode sedimentasi (24 jam) dan sentrifugasi (2 jam) dipergunakan untuk mengetahui adanya parasit dalam sayur. Hasil penelitian menunjukkan semua sayur positif terkontaminasi parasit. Jenis parasit yang ditemukan adalah Tetrahymena spp., Rotifera spp., ektoparasit dan nematoda bebas. Prevalensi parasit paling tinggi dijumpai pada bayam dan prevalensi parasit paling rendah dijumpai pada pakcoy. Rata-rata jenis parasit yang paling banyak ditemukan pada tiap sayur adalah protozoa Tetrahymena spp. Tetrahymena spp. merupakan siliata bebas yang hidup di berbagai habitat termasuk air tercemar. Protozoa bebas dan nematoda bebas dapat berpotensi sebagai agen zoonotik dan karrier. Oleh karena itu. pencegahan dan penanganan yang baik penting untuk memastikan keamanan pangan dan mencegah food-borne disease.
Keyword: parasit, protozoa, sayur

Judul: Keanekaragaman dan Parasitisasi Parasitoid pada Pertanaman Sayuran di Bogor
Abstrak: In an agricultural area, agroecosystem could influence diversity and parasitism of parasitoids as natural enemies of insect pests. A survey to learn diversity and rate of parasitism of insect pests by parasitoids had been conducted in several agricultural fields with different criteria, such as farming practice (organic and convensional), species richness of vegetable crops (5-8 sp. and 9-15 sp.) and different crop ages (3, 4 and 5 months), in Bogor from August to October 2012. By making a 50 steps line transect for every field, eggs, larvae and pupa of insect pests were collected monthly, reared in laboratory and incidence of parasitism were calculated. The results showed that there were no significant differences on diversity and rate of parasitism based on three criterias used. However, based on the diversity of vegetable plant species around, the rate of parasitism in field with less plant species diversity (5-8 sp.) was higher than the field with more vegetable plant species diversity (9-15 sp.). These results might be caused by the limited number of samplings conducted and other potential factors such as surrounding habitat, seasonal fluctuation, and complex interactions between species in agroecosystem.
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