Judul: Inventarisasi parasit trematoda pada itik dari Pasar Anyar Bogor
Abstrak: Penelitian telah dilakukan untuk mengidentifikasi parasit cacing trematoda pada itik yang dijual di Pasar Anyar, Kota Bogor. Cacing trematoda dikoleksi dari organ pencernaan dan organ pernafasan 46 ekor bebek. Hasil penelitian menunjukkan 5 genus trematoda pada itik yaitu Notocotylus, Opisthorchis, Echinostoma, Dicrocoelium, dan Tracheophilus. Kejadian infeksi trematoda pada bebek sebanyak 23 ekor (50%). Infeksi ini terdiri dari infeksi tunggal sebanyak 11 ekor (24%) dan infeksi campuran sebanyak 12 ekor (26%). Infeksi trematoda 5 mengakibatkan penurunan rataan berat badan itik sehingga kurang dari berat badan standar. Curah hujan yang tinggi menyebabkan rendahnya jumlah trematoda.
Keyword: 

Judul: Diversity and Degree of Endoparasite Infection in  Gastrointestinal Tract of Duck from Chicken Slaughter Houses in Bogor, West  Java
Abstrak: Itik merupakan unggas yang dimanfaatkan daging dan telurnya. Salah satu penyakit yang sering ditemui oleh peternak yaitu infeksi endoparasit pada saluran pencernaan itik. Penelitian ini bertujuan mengetahui jenis dan menghitung infeksi endoparasit pada saluran pencernaan itik di tempat pemotongan ayam di Bogor, Jawa Barat. Itik yang digunakan sebanyak 10 ekor yang masing-masing 5 ekor itik tersebut berasal dari tempat pemotongan ayam di Bojong Gede dan pasar Cibinong. Setiap sampel usus dibagi menjadi 4 bagian yaitu usus atas, tengah, bawah dan sekum. Metode yang digunakan dalam penelitian ini adalah pemeriksaan natif dan metode pengapungan. Cacing yang ditemukan diwarnai dan diidentifikasi menggunakan mikroskop. Hasil penelitian menunjukkan 4 dari 10 itik yang diperiksa positif infeksi endoparasit. Infeksi tertinggi yaitu oleh Strongyloides sp. (30%) pada usus halus, diikuti oleh Capillaria sp. di usus halus, Echinostoma revolutum di sepanjang usus dan sekum, Raillietina cesticillus di usus halus dan usus besar, Hymenolepis nana dan Eimeria sp. di usus halus dengan derajat infeksi masing-masing sebesar 20%. Infeksi yang paling rendah yaitu oleh Hypoderaeum conoideum dan Choanotaenia infundibulum di usus halus (10%) yang jarang ditemukan pada itik. Berbagai macam endoparasit yang ditemukan pada itik memiliki tempat predileksinya masing-masing mulai dari usus halus, usus besar dan sekum., Duck is poultry that is raised for meat and eggs. One of disease that often be found in duck is gastrointestinal endoparasite infection. The aims of this study to identify and calculate degree of endoparasite infection in gastrointestinal tract of ducks from chicken slaughter houses in Bogor. This research used 10 duck’s gastrointestinal tract which 5 of them came from Bojong Gede and 5 the rest are from Cibinong Market. The intestines are divided into 4 parts include upper, middle and lower part. Intestine was examined by making slides using native and floatation methods. Helminths were stained to identify each species. The result of this study showed 4 out of 10 ducks were positive for endoparasite infection. The highest infection was observed by Strongyloides sp. (30%) in small intestine, followed by Capillaria sp. in small intestine, Echinostoma revolutum in small, large intestine and caecum, Raillietina cesticillus in small and large intestine, Hymenolepis nana and Eimeria sp. in small intestine which each of them has 20% number of infection. The lowest infection were observed by Hypoderaeum conoideum and Choanotaenia infundibulum in small intestine (10%). Various gastrointestinal endoparasites in duck have different predilection site such as small, large intestine and caecum.
Keyword: endoparasit, itik, sekum, usus besar, usus halus, caecum, duck, endoparasite, large intestine, small intestine

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