Judul: Studi Kasus Q Fever Pada Sapi “Idul Adha” Di Wilayah Jakarta Pusat Dengan Metode Imunohistokimia
Abstrak: Q fever merupakan zoonosis yang disebabkan oleh Coxiella burnetii, bakteri gram negatif, bersifat intraseluler obligat. Hewan ternak dan hewan kesayangan merupakan reservoir utama infeksi, dan transmisi ke manusia terutama terjadi melalui inhalasi aerosol. Q fever merupakan penyakit yang ada di seluruh dunia kecuali Selandia Baru. Q fever memiliki gejala subklinis yang bervariasi dan tidak patognomonis, sehingga untuk mendiagnosanya perlu dilakukan uji dengan akurasi tinggi. Penelitian tentang Q fever pada sapi “idul adha” di wilayah Jakarta Pusat dengan metode imunohistokimia dilakukan dari oktober 2014 sampai september 2015 di Divisi Patologi FKH IPB. Hasil penelitian menunjukkan 3 sampel imunoreaktif dan 15 sapi non imunoreaktif terhadap antibodi anti Coxiella burnetii. Hasil pewarnaan HE sampel positif menunjukkan terdapat lesio pada organ limpa, hati dan paru-paru. Lesio pada limpa berupa deplesi folikel limfoid, peradangan, dan edema. Lesio pada hati berupa degenerasi hidropis. Lesio pada paru-paru berupa kongesti, dan hemoragi. Hasil penelitian ini merupakan laporan kejadian Q fever pada sapi kurban yang pertama kali dilaporkan di Wilayah Jakarta Pusat.
Keyword: Coxiella burnetii, idul adha, Q fever, zoonosis

Judul: Studi Q Fever Pada Sapi ”Idul Adha” di Wilayah Jakarta Dengan Metode Imunohistokimia
Abstrak: Query Fever (Q Fever) is a zoonotic disease caused by bacteria Coxiella burnetii (C. burnetii). The reservoirs are extensive but only partially known as ruminants, mammals, poultry, pets, and tick which also act as a vector. The transmission of this disease commonly through inhalation but other transmission such as ingestion may possible. The objective of this study was to know the histopathological changes of cattle slaughtered during Eid Adha celebration and were diagnosed Q Fever using immunohistochemistry method. The research conducted in samples of Eid Adha 2011 indicated that 1 sample from North Jakarta was found positive in liver out of 7 samples (0.14%). Whereas in samples of Eid Adha 2012 the positive results were found in 2 samples (100%) each derived from West Jakarta in liver and North Jakarta in lungs. This result showed that Q Fever in cattle has spread, so the preventive and control action is important to do
Keyword: Cattle, Coxiella burnetii, Eid Adha, immunohistochemistry, Q Fever, zoonosis

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