Judul: Kualitas Mikrobiologi Ayam Suwir Bubur Ayam yang Dijual di Wilayah Kampus IPB Dramaga Berdasarkan Jumlah Total Mikroba.
Abstrak: Ayam suwir dalam bubur ayam diperoleh dengan cara menarik serat daging menggunakan tangan dan pisau kecil menjadi bentuk yang lebih kecil dan halus sehingga berisiko menimbulkan cemaran mikroba. Tujuan penelitian ini adalah mengetahui kualitas mikrobiologi ayam suwir dalam bubur ayam yang dijual di wilayah kampus IPB Dramaga berdasarkan jumlah total mikroba. Sebanyak 15 sampel ayam suwir diperoleh dari 15 pedagang bubur ayam di sekitar kampus IPB Dramaga. Jumlah total mikroba dihitung menggunakan metode hitungan cawan. Hasil penelitian menunjukkan rata-rata jumlah total mikroba dalam ayam suwir bubur ayam adalah 40.65x106 ± 68.361x106 CFU/g. Rata-rata jumlah mikroba dalam ayam yang disuwir di rumah pedagang (69.08x106 ± 74.142x106 CFU/g) lebih tinggi dibandingkan dengan ayam yang disuwir di gerobak (30.31x106 ± 66.727x106 CFU/g). Sebanyak 53.33% sampel mengandung jumlah total mikroba di atas batas maksimum ketetapan SNI 7388:2009 tentang batas maksimum cemaran mikroba pada pangan. Pedagang bubur ayam di wilayah kampus IPB Dramaga belum menerapkan praktik higiene dan sanitasi dengan baik sehingga kualitas mikrobiologi ayam suwir bubur ayam sebagian besar tergolong rendah.
Keyword: ayam suwir, bubur ayam, jumlah total mikroba

Judul: Staphylococcus aureus dalam Daging Ayam Suwir Bubur Ayam yang Dijual di Lingkar Kampus IPB Dramaga Bogor.
Abstrak: Kasus keracunan pangan yang disebabkan oleh toksin dari Staphylococcus aureus cukup banyak di Indonesia. Bubur ayam merupakan salah satu pangan yang banyak dikonsumsi oleh masyarakat untuk sarapan. Tujuan penelitian ini adalah mengidentifikasi cemaran S. aureus dalam daging ayam suwir bubur ayam yang dijual di Lingkar Kampus IPB Dramaga Bogor. Penelitian ini menggunakan sebanyak 15 sampel daging ayam suwir yang diperoleh dari 15 pedagang bubur ayam. Pengujian jumlah S. aureus dilakukan menggunakan metode hitungan cawan. Penghitungan jumlah S. aureus sesuai dengan aturan American Public Health Association (APHA). Hasil nenunjukkan rata-rata jumlah S. aureus adalah 720,857 CFU/g ± 2,716,447.41 CFU/g. Jumlah S. aureus dalam daging ayam suwir yang telah disuwir dari rumah pedagang lebih rendah (78,387.5 ± 53,826.84 CFU/g) dibandingkan dengan yang disuwir di tempat berjualan (954,482 ± 3,067,378.633 CFU/g). Jumlah cemaran S. aureus yang tinggi mengindikasikan bahwa pedagang bubur ayam di Lingkar Kampus IPB Dramaga masih belum menerapkan higiene personal yang baik.
Keyword: ayam suwir, bubur ayam, higiene personal, Staphylococcus aureus

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