Judul: Reaksi silang antibodi monoklonal dari sel utuh excherichia coli enteropatogenik (EPEC) galur 007.6 dengan beberapa bakteri patogen
Abstrak: Kurang lebih 55% Escherichia coli enteropatogenik (EPEC) ditemukan pada anak-anak penderita diare. Faktor-faktor yang mempengaruhi terjadinya diare antara lain makanan yang terkontaminasi akibat sanitasi yang kurang baik. Adanya kontaminan tersebut dapat dideteksi dengan menggunakan antibodi monoklonal (Mab). Pada penelitian ini telah disintesis antibodi monoklonal dari sel utuh EPEC 007.6, kemudian dilakukan uji reaksi silang Mab tersebut dengan beberapa bakteri patogen antara lain EPEC D4.4, RB1.2, RC2.2, E coli non patogen, Salmonella, Shigella, Yersinia sp., Staphylococcus aurcus, Vibrio cholera, dan Bacillus cereus. Hasil fusi antara sel mieloma dan sel limpa dapat menghasilkan hibridoma yang mensekresi antibodi monoklonal spesifik terhadap EPEC 007.6. Hasil uji reaksi silang dengan beberapa bakteri patogen menunjukkan bahwa antibodi tersebut bereaksi dengan EPEC D4.4, R51.2, RC2.2, E. coli non patogen, dan Salmonella, tetapi tidak dengan S. aureus, Shigella, Yersinia, B. cereus, dan V. cholera.
Keyword: Antibody, Cell

Judul: Keberadaan Antibodi Antiprotease Escherichia Coli Enteropatogenik Pada Neonatus dan Balita Penderita Diare
Abstrak: Pengambilan serum dilakukan pada 5 orang balita penderita diare dan 30 orang neonatus. Sebagai antigen digunakan protease EPEC K.l.l yang merupakan protein ekstraselular. Antigen diperoleh dengan menumbuhkan bakteri pada media minimaI M, dan isolasi protein dilakukan dengan amonium sulfat 45%. Keberadaan antibodi antiprotease EPFlC pada serum penderita diare dan neonatus dilihat dengan uji Dot Blot. Sebagai kontrol positif, digunakan serum meneit Balb/c yang telah diimunisasi dengan antigen protease EPEC. Produksi serum tersebut dilakukan dengan imunisasi protease EPEC ditambah adjuvant dilakukan sebanyak lima kali, dengan dosis 25 ~g'"per ekor, rute subkutan, interval 8-10 hari. Dari penelitian ini diperoleh hasil pada 40% serum balita penderita diare dan 13,3% serum neonatus terdapat antibodi antiprotease EPEC. Semua serum neonatus dari ibu yang sehat, pada uji Dot Blot menunjukkan hasil negatif. Pada serum neonatus dari ibu yang tidak pernah menderita diare namun pernah menderita penyakit lain, didapatkan tiga sampel positif. Hal ini menunjukkan adanya kemungkinan antigen protease EPEC K. 1.1 dapat bereaksi silang dengan antigen penyebab penyakit lain.
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