Judul: Kajian morfopatologi dan klinis dari infeksi Coccidia spp. pada satwa burung sakit di Instalasi Karantina Hewan Sementara (IKHS) CV Harmaco, Tangerang periode November 2001 - Maret 2002
Abstrak: Penelitian ini bertujuan mengadakan penelusuran terhadap adanya infeksi coccidia dari 21 burung yang dikarantinakan di CV. Harmaco, Tangerang periode November 2001-Maret 2002. Dengan menggunakan metode observasi klinis, patologi anatomi dan histopatologi dari organ saluran pencernaan, hati, ginjal, jantung, paru, limpa, otak dan mata. Dari 21 burung 11 ditemukan terpapar coccidia. Pada penelitian ini terdapat beberapa stadium dari Eimeria spp. atau Isospora sp. Adanya kerusakan ditemukan bersama adanya infeksi dari stadium coccidia disertai adanya enteritis katarrhal, deskuamasi epitel, kriptitis, kongesti pembuluh darah di propria, bentukan ookista dan beberapa stadium ookista. Gejala klinis yang ditemukan berupa adanya diare, anemia, dan terkadang terdapat darah di feses….
Keyword: 

Judul: Infeksi Cacing Saluran Pencernaan pada Burung Kasuari (Casuarius spp.) di Taman Margasatwa Ragunan.
Abstrak: Kasuari (Casuarius spp.) merupakan satwa asli Indonesia yang terdapat di Pulau Papua. Spesies ini dinyatakan rentan punah, sehingga tindakan konservasi diperlukan bagi kasuari. Penelitian ini bertujuan untuk mempelajari jenis cacing, persentase infeksi dan intensitas kecacingan saluran pencernaan pada kasuari gelambir tunggal (Casuarius unappendiculatus) dan kasuari gelambir ganda (Casuarius casuarius) di Taman Margasatwa Ragunan. Sebanyak 45 sampel tinja dikumpulkan dari 13 kandang individu dan 2 kandang kelompok. Sampel tinja dianalisis secara copromicroscopic menggunakan teknik modifikasi McMaster, flotasi sederhana, dan modifikasi filtrasi-sedimentasi. Jenis cacing yang ditemukan diidentifikasi berdasarkan morfometrik telur cacing. Hasil penelitian menunjukkan bahwa 10 (67%) dari semua kasuari yang diperiksa terinfeksi cacing, yaitu Strongyloides (33.3%), Ascaridia spp. (13.3%), dan Capillaria spp. (40%). Kasuari jantan masing-masing terinfeksi Ascaridia spp., Capillaria spp., Strongyloides sebesar 10 %, 60%, dan 30%, sedangkan kasuari betina sebesar 20%, 0%, dan 40%. Berdasarkan tipe lantai kandang, kasuari pada lantai tanah dan paving block masing-masing terinfeksi Ascaridia spp., Capillaria spp., Strongyloides sebesar 12.5%, 50%, 50% dan 14.3%, 28.5%, 14.3%. Derajat infeksi kecacingan pada burung kasuari di TMR adalah 0-400 telur per gram tinja (TTGT). Jumlah TTGT tertinggi pada Capillaria spp. (0-400 TTGT), diikuti oleh Strongyloides (0-200 TTGT). Jumlah TTGT terendah pada Ascaridia spp. (0-50 TTGT) yang ditemukan di Taman Margasatwa Ragunan.
Keyword: cacing saluran pencernaan, kasuari gelambir ganda, kasuari gelambir tunggal, Taman Margasatwa

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