Judul: Kombinasi air hangat (50 derajat celcius) dengan asam asetat 1,0 dan 2,0 sebagai dekontaminal daging ayam
Abstrak: Dalam penelitian ini dipelajari pengaruh air hangat (50°C) yang dikombinasikan dengan asam asetat 1,0% dan 2,0% terhadap jumlah total mikroorganisme pada daging ayam yang disimpan pada suhu kamar. Contoh daging ayam diambil dari Tempat Pemotongan Ayam (TPA) di Kebon Pedes Bogor, kemudian dibawa ke laboratorium untuk dilakukan pengujian terhadap jumlah total mikroorganisme. Contoh terlebih dahulu dicelupkan ke dalam air hangat, baru kemudian dicelupkan ke dalam asam asetat 1,0% dan 2,0%, lalu disimpan pada suhu kamar selama 4 jam, Pengamatan terhadap jumlah total mikroorganisme dilakukan pada jam ke-1 dan ke-4. Hasil penelitian menunjukkan bahwa rata-rata jumlah total mikroorganisme awal pada daging ayam dari TPA adalah 6.4 ± 0,6 logo cfu/g, berada di atas Standar Nasional Indonesia (SNI) No. 01-6366-2000 (maksimum jumlah total mikroorganisme 5,0 logo cfu/g). Selama penyimpanan jumlah total mikroorganisme meningkat pada kontrol, tetapi menurun pada hampir semua perlakuan. Jumlah total mikroorganisme pada daging dengan perlakuan berbeda nyata dari kontrol (p<0,05). Kombinasi perlakuan yang mampu menurunkan jumlah mikroorganisme sampai di bawah batas cemaran mikroba yaitu pada kombinasi air (25°C) dengan asam asetat 2,0% sebesar 4,6 ± 1,4 logo cfu/g.
Keyword: chicken meat, microorganisms, microbial contamination

Judul: Pencelupan daging ayam dalam asam asetat 1,0 dan 2,0 untuk dekontaminasi Escherichia coli
Abstrak: Dalam penelitian ini dipelajari pengaruh asam asetat dengan konsentrasi 1,0% dan 2,0% terhadap jumlah total E. coli. Daging ayam didapatkan dari Tempat Potong Ayam (TPA) Kebon Pedes Bogor. Sampel dicelupkan selama 10 detik ke dalam asam asetat 1,0% dan 2,0%, kemudian diuji terhadap jumlah total E. coli pada waktu pengamatan jam ke-1 dan jam ke-4 pada suhu kamar. Hasil penelitian menunjukan tingkat kontaminasi E. coli pada daging ayam yang didistribusikan ke Pasar Bogor adalah 5,2 0,9 logio cfu/gram. Jumlah ini melebihi batas maksimum cemaran mikroba yang ditetapkan oleh Standar Nasional Indonesia No. 01-6366-2000 dan Pusat Pengawasan Obat dan Makanan Indonesia (maksimum cemaran E. coli 1,0 logio cfu/gram). Penambahan asam asetat dapat menurunkan jumlah E. coli pada daging ayam, Asam asetat 1,0% dan 2,0% dapat menurunkan jumlah E. coli menjadi 4,3 1,3 logic cfu/gram dan 3,7 +0,8 logie cfu/gram (penurunan sampai 0,9 1,5 logo cfu/gram).
Keyword: acetic acid's effect, Chicken Slaughter Place, E. coli contamination

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