Judul: Identifikasi dan kajian keamanan mikrobiologi produk-produk minuman sari jahe yang beredar di sekitar kota Bogor
Abstrak: Minuman sari jahe yang kini banyak dijumpai di pasaran sudah sejak dulu dikonsumsi masyarakat karena dipercaya mempunyai khasiat khusus bagi kesehatan dan kebugaran tubuh. Seperti makanan tradisional lainnya, minuman tradisional yang diproduksi dengan cara kurang higienis memiliki resiko cemaran mikrobiologi yang tinggi. Meskipun penggunaan pestisida dan food additive serta adanya kontaminasi zat kimia dari lingkungan banyak menyebabkan bahaya bagi keamanan dan kesehatan konsumen, tetapi menurut FAO (1979) yang dikutip oleh Winarno (1997) sebagiau besar keracunan makanan dan penyakit yang ada kaitannya dengan konsumsi pangan terjadi karena mikroba serta toksin yang diproduksinya. Lebih dari 80% keracunan makanan disebabkan oleh kontaminasi bakteri patogen. Tujuan dari penelitian ini adalah untuk mengidentifikasi dan mengevaluasi keamanan mikrobiologi produk- produk minuman sari jahe hasil olahan pabrik yang beredar di sekitar kota Bogor. Hasil analisis mikrobiologi juga dihubungkan dengan komposisi produk, kode pendaftaran dari Departemen Kesehatan, jenis kemasan serta tanggal kadaluarsa, dan kondisi tempat penjualan yang berbeda...
Keyword: 

Judul: Keamanan Mikrobiologi dan Survei Lapangan Sayuran di Tingkat Petani dan Pasar Tradisional di Daerah Bogor
Abstrak: Penelitian ini bertujuan untuk mengetahui mutu mikrobiologi dan cara penanganan sayuran segar, yaitu tauge, kol, wortel dan kacang panjang di tingkat petani dim pedagang yang dijajakan di pasar tradisional di daerah Bogor. Penelitian juga dilakukan untuk mengevaluasi media yang paling efektif untuk mengisolasi Salmonella. Evaluasi mutu mikrobiologi sayuran segar dan media isolasi Salmonella dilakukan di laboratorium, sedangkan evaluasi penanganan sayuran segar dilakukan di lapangan dengan cara survei terhadap petani dan pedagang.
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