Judul: Identification and Resistance Pattern of Klebsiella sp. Isolated from the Feces of the Bornean Orang Utan (Pongo pygmaeus) at Taman Safari Indonesia, Bogor
Abstrak: Orang utan merupakan satu-satunya kera besar yang masih bertahan di Wilayah Asia Tenggara. Saat ini, populasi orang utan di habitatnya terus mengalami penurunan. Diperkirakan selama 60 tahun terakhir populasi orang utan berkurang sebanyak 50%. Data mikrobiologi yang membahas resistansi bakteri Klebsiella sp. terhadap antibiotik pada feses orang utan kalimantan (Pongo pygmaeus) belum banyak dilakukan. Penelitian ini bertujuan untuk mengidentifikasi keberadaan bakteri Klebsiella sp. serta mengetahui pola resistansinya terhadap beberapa antibiotik pada feses P. pygmaeus. Metode penelitian terdiri dari isolasi, identifikasi, dan uji resistansi antibiotik. Hasil isolasi dan identifikasi ditemukan sebanyak tiga isolat (37,5%) yang positif bakteri Klebsiella sp. Berdasarkan uji sensitivitas, isolat Klebsiella sp. yang berasal dari feses P.pygmaeus sehat di Taman Safari Indonesia, Bogor, berhasil didapatkan dua pola resistansi berbeda yang memberikan gambaran adanya sensitivitas dan resistansi terhadap beberapa antibiotik. Klebsiella sp. telah mengalami resistan terhadap antibiotik golongan β-laktam dan masih sensitif terhadap antibiotik golongan aminoglikosida, tetrasiklin, dan fluorokuinolon., Orangutans are the only great apes that still survive in the Southeast Asian Region. Currently, the orangutans population in their habitat continues to decline. It is estimated that over the last 60 years, the orang utan population has decreased by 50%. Microbiological data discussing the resistance of Klebsiella sp. against antibiotics in the feces of the bornean orangutans (Pongo pygmaeus) has not been widely carried out. This study aims to identify the presence of Klebsiella sp. as well as know the pattern of resistance to several antibiotics in the feces of bornean orangutans. The research method consisted of isolation, identification, and antibiotic resistance testing. The results of isolation and identification found that three isolates (37.5%) were positive for Klebsiella sp. Based on the sensitivity test, Klebsiella sp. isolates which come from the feces of healthy P.pygmaeus in Taman Safari Indonesia, Bogor, two different patterns of resistance have been obtained which provide an overview of sensitivity and resistance to several antibiotics. Klebsiella sp. has experienced resistance to β-lactam class antibiotics and is still sensitive to aminoglycoside, tetracycline, and fluoroquinolone antibiotics.
Keyword: antibiotik, Klebsiella sp., Pongo pygmaeus, resistansi

Judul: Resistance Test of Escherichia coli Pathogen from  Feces Sample of Bornean Orangutan (Pongo pygmaeus) at Taman Safari Indonesia-Bogor
Abstrak: Orang utan merupakan salah satu primata dan satu-satunya kera besar yang hidup di Asia. Gangguan saluran pencernaan pada orang utan biasanya berupa diare yang disebabkan oleh bakteri enteropatogen E. coli. Pengobatan dengan antibiotik pada orang utan harus mempertimbangkan sensitivitas bakteri terhadap antibiotik. Penelitian ini bertujuan mengetahui gambaran resistansi Escherichia coli patogen pada sampel feses orangutan kalimantan (Pongo pygmaeus) di Taman Safari Indonesia – Bogor terhadap beberapa antibiotik. Sebanyak 10 sampel diisolasi dan diidentifikasi keberadaan E. coli patogen dan sebanyak 10 isolat terdeteksi sebagai E. coli patogen. Uji resistansi dilakukan dengan metode Kirby-Baurer Disk Diffusion Test menggunakan 7 antibiotik yang berbeda. Hasil uji menunjukkan 20% isolat telah resistan terhadap tetrasiklin, 30% isolat resistan terhadap antibiotik streptomisin, trimetoprim dan trimetoprim-sulfametoksazol, dan 90% telah resistan terhadap ampisilin. Sementara itu 100% isolat sensitif terhadap kloramfenikol, 70% sensitif terhadap trimetoprim dan trimetoprim-sulfametoksazol, serta 50% sensitif terhadap siprofloksasin. Antibiotik yang menunjukkan hasil resistan tidak direkomendasikan untuk pengobatan infeksi oleh E. coli pada orang utan., Orangutans are one of the primates and the only great apes which live in Asia. Gastrointestinal problem in orangutans usually characterized by diarrhea which comes from enteropathogenic bacteria E. coli. Moreover, treatment with antibiotics in orangutans should take into account the sensitivity of the bacteria to antibiotics. The aim of this study is to describe the resistance of pathogenic Escherichia coli in fecal samples of the Bornean orangutan (Pongo pygmaeus) at Taman Safari Indonesia – Bogor to several antibiotics. A total of 10 samples were isolated and identified the presence of pathogenic E. coli and as many as 10 isolates were detected as pathogenic E. coli. Moreover, the resistance test was conducted by using the Kirby-Bauer Disk Diffusion Test method using 7 different antibiotics. The test results show that 20% of the isolates were resistant to tetracycline, 30% of the isolates were resistant to the antibiotics streptomycin, trimethoprim and trimethoprim-sulfamethoxazole, and 90% were resistant to ampicillin. Meanwhile, 100% of isolates were sensitive to chloramphenicol, 70% sensitive to trimethoprim and trimethoprim-sulfamethoxazole, and 50% sensitive to ciprofloxacin. Antibiotics that show resistance are not recommended for the treatment of infections by Escherichia coli in orangutans.
Keyword: antibiotic, Escherichia coli, orangutan, resistance

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