Judul: Penelitian pendahuluan residu antibiotik dan bahan pengawet dalam air susu serta uji masak air susu di daerah Cipanas - Kabupaten Cianjur Jawa Barat
Abstrak: Susu dalam pengertian air susu sapi, merupakan bahan makanan yang mempunyai nilai gizi tinggi dan sangat baik untuk kesehatan, terutama untuk pertumbuhan badan; biasa dikonsumsi oleh masyarakat sebagai pelengkap menu "Empat Sehat Lima Sempurna". Menurut WHO, air susu ialah air susu sapi yang tidak dikurangi atau ditambah sesuatu apapun dan diperoleh dari pemerahan sapi-sapi sehat secara teratur dan sekaligus. Agar air susu sampai Kekonsumen dalam keadaan utuh dan sehat, serta tidak menjadi sumber penyakit, maka perlu diadakan pemeriksaan yang teratur. Penelitian ini bertujuan untuk mengetahui apakah air susu yang berasal dari peternakan rakyat di daerah Cipanas - Kabupaten Cianjur Jawa Barat mengandung antibiotik (dengan menggunakan Uji Yoghurt) dalam jumlah yang dapat membahayakan kesehatan masyarakat. Juga untuk mengetahui apakah ada residu bahan pengawet formalin (dengan menggunakan Uji Formalin dan sebagai pereaksi dipakai asam chlo rida yang mengandung Fe), serta mendeteksi air susu yang sudah mengalami pemasakan (dengan menggunakan Uji Guajaktinktur). Hasil penelitian menunjukkan bahwa air susu yang ber- asal dari daerah Cipanas 25% mengandung antibiotik, 2,8% mengalami proses pemasakan, akan tetapi tidak mengandung bahan pengawet formalin (0%). Perlu diketahui bahwa, keadaan di atas dipengaruhi oleh beberapa faktor, antara lain penanganan air susu, penanganan sapi perah produktif, latar belakang peternak, lokasi peternakan, dan faktor-faktor lainnya….
Keyword: 

Judul: Pengujian residu antibiotika dalam susu segar dari beberapa peternakan sapi perah di provinsi Jawa Barat menggunakan metode bioassay
Abstrak: The objective of this study was to determine the presence of antibiotic residues in raw milk from various dairy farms in the region of West Java, including Tasikmalaya, Sumedang, Bandung, Bogor, and Cianjur. Five samples were taken from each district (total n = 25) and analyzed using bioassay method. The results showed that none of the 25 raw milk samples contained detectable amounts of beta lactam, tetracyclines, makrolida, and aminoglycosides.
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