Judul: Residu Hormon dan Bahan Kimia Berbahaya pada Daging di Kota Bogor 2014-2017
Abstrak: Peningkatan pengawasan daging telah dilakukan oleh Dinas Pertanian Bidang Peternakan Seksi Kesehatan Masyarakat Veteriner (Kesmavet), Pengolahan, dan Pemasaran Hasil Peternakan Pemerintah Kota Bogor, dengan cara melakukan berbagai pengujian yaitu pengujian residu hormon dan bahan kimia berbahaya lain. Tulisan ini bertujuan menganalisa tingkat keamanan daging berdasarkan kegiatan pengawasan yang dilakukan oleh Dinas, sehingga mampu memberikan informasi tentang efektifitas kegiatan pengawasan tersebut. Desain penelitian yang digunakan adalah studi kasus deskriptif dengan pendekatan analisis data sekunder di Kota Bogor tahun 2014-2017. Penelitian ini menunjukkan residu hormon Trenbolone Acetate (TBA) yang ditemukan tidak pernah melebihi ambang batas dan residu formalin yang ditemukan tahun 2014- 2015 tidak ditemukan lagi pada tahun 2016-2017.
Keyword: formalin, hormon trenbolon asetat (TBA), daging, residu

Judul: Residu Antibiotik pada Pangan Asal Hewan di Kota Bogor Tahun 2015-2018 (Studi Kasus).
Abstrak: Residu antibiotik pada pangan asal hewan dapat menimbulkan berbagai dampak negatif, oleh karena itu Dinas Pertanian Kota Bogor setiap tahun melakukan pengawasan terhadap kejadian tersebut. Studi kasus ini dilakukan untuk mengevaluasi adanya residu antibiotik pada pangan asal hewan di Kota Bogor tahun 2015-2018. Data primer diperoleh dengan melakukan wawancara kepada Staf Dinas Pertanian Kota Bogor dan data sekunder diperoleh dari monitoring pangan asal hewan Dinas Pertanian Kota Bogor tahun 2015-2018. Analisis data dilakukan secara deskriptif. Kasus residu antibiotik tertinggi terdapat pada golongan makrolida (10), aminoglikosida (7), dan penisilin dan tetrasiklin (2). Kasus residu antibiotik terdapat pada susu sapi 20.0% (5/25), telur ayam 18.5% (5/27), daging sapi 13.6% (3/22), telur itik 10.0% (2/20), telur puyuh 5.2% (1/19), daging ayam 3.8% (1/26), dan yoghurt 100.0% (1/1). Kasus residu antibiotik golongan makrolida dan aminoglikosida cenderung meningkat pada tahun 2015-2017, akan tetapi menurun pada tahun 2018. Kasus residu antibiotik penisilin dan tetrasiklin cenderung menurun pada tahun 2015-2016, dan tidak ditemukan pada tahun 2017- 2018.
Keyword: Antibiotik, Kota Bogor, pangan asal hewan, residu antibiotik

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