Judul: Efek imunoglobulin Y(IgY) anti-enteropathogenic Escherichia coli(EPEC) K1.1 terhadap pertumbuhan bakteri EPEC
Abstrak: Penelitian ini dilaksanakan untuk mengetahui efektivitas Imunoglobulin Y (IgY) anti-Enteropathogenic Escherichia coli (EPEC) K1.1 dalam menghambat pertumbuhan bakteri EPEC pada media Trypticase Soy Broth (TSB). Efek IgY anti-EPEC K1.1 dalam menghambat pertumbuhan bakteri EPEC telah diketahui dengan penambahan 900 µl IgY anti-EPEC K1.1 (100 mg/ml) dan penghitungan jumlah bakteri ditentukan dengan metode Total Plate Count (TPC). Kestabilan IgY anti-EPEC K1.1 yang dirusak oleh 5 µl pepsin (5 µg/ml) dengan preinkubasi yang berbeda (2 dan 4 jam) dan suhu (60 °C-35 menit dan 70 °C-15 menit) telah diketahui aktivitasnya dalam menghambat pertumbuhan bakteri EPEC. IgY anti-EPEC K1.1 murni maupun IgY anti-EPEC K1.1 yang terdenaturasi menunjukkan hasil yang berbeda dalam menghambat pertumbuhan bakteri EPEC pada media TSB.
Keyword: 

Judul: Pengaruh pemberian imunoglobulin(IgY) anti enteropathogenic Escherichia coli(EPEC) secara peroral pada anak kelinci yang diinfeksi bakteri Epec K1.1
Abstrak: Diare pada umumnya disebabkan karena infeksi bakteri, virus, dan protozoa. Enteropathogenic Escherichia coli (EPEC) merupakan penyebab utama penyakit diare pada anak-anak di negara berkembang diseluruh dunia serta menyebabkan ratusan ribu anak meninggal setiap tahunnya. Gejala klinis diare yang disebabkan oleh EPEC adalah diare tanpa darah atau lendir, demam dan muntah, bila berlanjut akan menyebabkan dehidrasi dan akhirnya bisa menimbulkan kematian. Pengobatan alternatif yang sedang diteliti adalah penggunaan immunoglobulin Y secara peroral. Sebanyak dua belas ekor anak kelinci berumur 1-2 minggu dikelompokkan menjadi 4 kelompok (A, B, C, dan D). Kelompok A, B, dan C diinfeksi bakteri EPEC K 1.1 sebanyak 1 ml (10 sel/ml) peroral sedangkan kelompok D digunakan sebagai kontrol negatif. Dua jam setelah diinfeksi, kelompok B diberikan IgY dosis tinggi (100 mg/ml PBS) sekali selama 7 hari dan kelompok C. diberikan IgY dosis rendah (10 mg/ml PBS) tiga kali selama 7 hari. Pada semua kelompok dilakukan pengulangan. Pengamatan terhadap gejala diare, nafsu makan, frekuensi pernafasan, mukosa dan konsistensi kotoran tidak memberikan perbedaan nyata pada semua kelompok. Perbedaan nyata diantara semua kelompok dapat diamati pada perubahan suhu badan dan pertambahan berat badan (p<0,05). Pemberian IgY pada kelompok C menunjukkan hasil yang lebih efektif dibandingkan dengan kelompok B. Hal ini diperkuat dengan hasil histopatologis yang menunjukkan bahwa pemberian IgY anti EPEC dapat mengurangi perlekatan bakteri EPEC pada mikrovili saluran intestinal anal kelinci.
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