Judul: Cemaran Enterobacteriaceae pada Daging Ayam dari Tempat Potong Unggas Kota Bogor
Abstrak: One of the popular meat in community of Indonesia is chicken meat. The information on microbiological status in chicken meat is required to determine the quality and safety. The objective of this research was to determine the contamination of Enterobacteriaceae in chicken meat collected from poultry slaughterplace at Sentra Pemotongan Ayam Pondok Rumput, Bogor City. A total of 30 samples of chicken carcass was analysed for total of Enterobacteiaceae using plate count method with violet red bile glucose agar (VRBGA). The average number of Enterobacteriaceae in chicken was 37 536.7 cfu/g (minimum 0 and maximum 500 000 cfu/g). This results indicated a lack of hygiene practices.
Keyword: Enterobacteriaceae, chicken meat, poultry slaughterplace Bogor

Judul: Cemaran Enterobacteriaceae dalam Daging Ayam yang Dijual di Kota Dili, Timor Leste
Abstrak: Negara Timor-Leste melakukan importasi daging ayam beku dari beberapa negara serta hasil peternakannya sendiri, untuk memenuhi kebutuhan protein hewani masyarakatnya. Kontaminasi mikrob dalam daging ayam yang dijual di Timor Leste dapat terjadi di tingkat penjualan, sehingga tujuan penelitian ini yaitu mengetahui cemaran Enterobacteriaceae pada daging ayam yang dijual di pasar Kota Dili, Timor-Leste. Sebanyak 150 sampel daging ayam segar dan beku diambil dari pasar tradisional dan modern di Timor-Leste. Pengujian jumlah Enterobacteriaceae dilakukan menggunakan metode hitungan cawan dengan media Violet Red Bile Glucose agar. Hasil penelitian ini menunjukkan jumlah Enterobacteriaceae pada sampel daging ayam yang dijual di Timor-Leste adalah 28.613,1±99.322,8 CFU/g dengan jumlah cemaran Enterobacteriaceae paling tinggi sebesar 103.658,3±199.900,4 CFU/g pada sampel daging ayam broiler Timor Leste dan paling rendah sebesar 1.216,7±2.975,2 CFU/g pada daging ayam lokal Timor Leste. Rata-rata jumlah cemaran Enterobacteriaceae pada sampel daging ayam segar yang berasal dari Timor Leste sebesar 52.437±101.437,8 CFU/g, sedangkan pada sampel daging ayam beku yang diimpor Malaysia, Amerika dan Brazil sebesar 16.562,233±34.391,067 CFU/g. Tingginya jumlah Enterobacteriaceae dalam daging ayam yang dijual di pasar menunjukkan tingkat higiene dan sanitasi yang buruk pada saat penanganan dan penjualan ayam di Timor Leste., Timor-Leste imports frozen chicken meat from multiple countries and from their own farm to fulfill the population’s need for animal protein. Microbial contamination of chicken meat may occur during the trading stage, hence, the aim of this study was to determine the microbiological quality of chicken meat based on the number of Enterobacteriaceae contamination in chicken meat from Kota Dili, Timor-Leste. A total of 150 fresh and frozen chicken meat samples were taken from traditional and modern markets in Dili, Timor-Leste. The total plate count method with a Violet Red Bile Glucose agar media was used to determine the Enterobacteriaceae number. The results obtained shows that the number of Enterobacteriaceae on the chicken meat sample sold in Timor-Leste is 28.613,1±99.322,8 CFU/g, with the highest being 103.658,3±199.900,4 CFU/g and the lowest 1.216,7±2.975,2 CFU/g for Timor Leste broiler and native chicken meatrespectively. The average number of Enterobacteriaceae contamination in fresh chicken meat samples was 52,437±101,437.8 CFU/g and in frozen chicken meat samples was 16,562.233±34,391.067 CFU/g.The high total average of Enterobacteriaceae indicates high contamination in chicken meat, which is associated with poor hygiene and sanitation during the handling and trading of chicken meat in Timor-Leste.
Keyword: chicken meat, Enterobacteriaceae, sanitation, Timor-Leste

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