Judul: Kemungkinan Penggunaan Enzyme Linked Immuno Sorbent Assay (ELISA) Dalam Diagnosa Serologis Brucellosis
Abstrak: Masalah yang utama dari Brucellosis adalah kesukaran dalam diagnosa. dimana kasus Bruoellosis baru dapat terdeteksi apabila gejala klinis telah tampak yang berarti penoemaran lingkungan pada tempat sekitar kandang serta ternak yang lain telah terjadi. Masalah lain adalah dimana hewan. tidak menunjukkan gejala yang jelas sedangken hewan tersebut dapat bertindak sebagai reaktor penyakit.
Keyword: 

Judul: Tinjauan imunokimia monoklonal antibodi
Abstrak: Brucellosis adalah salah satu penyakit zoonosis yang di- sebabkan oleh Brucella abortus. Penyakit ini terutama menyerang sapi dan menimbulkan kerugian yang cukup besar di bidang peternakan. Saat ini, hampir semua diagnosa untuk pengendalian brucel- losis dibuat dengan metoda serologis yang didasarkan pada prinsip aglutinasi bakteri. Hasil yang didapat umumnya kurang tepat dan tidak spesifik. Salah satu pendekatan dalam tehnik diagnosa dan pengembangan vaksin untuk brucellosis adalah penggunaan mono- klonal antibodi dengan spesifisitas terhadap antigen permukaan sel. Monoklonal antibodi dari sel-sel hibrida yang dibuat dengan tehnologi hibridoma memiliki banyak keuntungan yang melebihi antisera/antibodi konvensional dalam lapangan imunokimiawi, ter- utama karena sifat monospesifitasnya. Penting juga diketahui tentang klas dan subklas Ig monoklonal antibodi untuk penilaian hasil suatu fusi. Dalam mengembangkan monoklonal antibodi B.abortus, pengeta- huan tentang sifat antigenik yang spesifik pada B.abortus sangat diperlukan. Lapisan LPS (lipopolisakarida) pada membran terluar bakteri gram negatip sangat berperanan sebagai faktor antigenic dan karenanya diberi perhatian khusus dalam penyediaan monoklonal antibodi terhadap B. abortus. Monoklonal antibodi B.abortus diperoleh dari sel-sel hibrida hasil penggabungan sel mieloma mencit penghasil monoklonal antibodi Ig G dengan sel-sel limpa mencit yang telah diimunisasi dengan sel-sel utuh B.abortus. Monoklonal antibodi yang didapatkan dari hasil penggabungan dengan tehnik hibridoma ini, memiliki spesifisitas terhadap antigen permukaan sel B.abortus. Aktivitas antibodi anti Brucella dari hibridoma-hibridoma monoklonal tersebut, diuji menggunakan ELISA, baik reaktivitas maupun spesifisitasnya…dst
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