Judul: Pengamatan kualitas susu pasteurisasi di DKI Jakarta, Bogor dan Bandung
Abstrak: Susu pasteurisasi adalah produk olahan susu yang mempunyai bentuk dan rasa seperti susu segar dengan masa simpan lebih lama. ...
Keyword: Milk, Pasteuration

Judul: Inspection of Milk Quality from Milk Shops in the Student Settlement Areas of IPB Dramaga and Cilibende
Abstrak: Susu merupakan sumber pangan hewani yang berperan dalam kehidupan manusia karena mengandung berbagai komponen gizi. Indonesia memiliki tingkat konsumsi susu masih tergolong rendah. Sebagai salah satu upaya untuk meningkatkan konsumsi susu, berbagai macam produk olahan susu dengan aroma dan bentuk yang lebih “kekinian” dibuat. Namun, jaminan terhadap kualitas produk olahan susu yang dijual tidak semua diketahui. Penelitian ini bertujuan untuk mengetahui kualitas sampel susu yang diperoleh dari kedai susu yang berada di sekitar kawasan permukiman mahasiswa kampus Institut Pertanian Bogor Dramaga dan Cilibende. Total sampel susu yang dibeli dari 13 kedai susu di lokasi penelitian sebanyak 39 sampel berupa susu plain tanpa tambahan pemanis, perasa ataupun es batu. Berdasarkan uji Kesempurnaan Pasteurisasi dan Sterilisasi dapat diketahui bahwa seluruh sampel merupakan susu pasteurisasi, bahkan 30.8% merupakan susu sterilisasi. Hasil uji komposisi dan uji pH menunjukkan nilai rata-rata berat jenis, kadar lemak, kadar protein, kadar laktosa, bahan kering, bahan kering tanpa lemak dan pH sampel susu daerah Dramaga secara berturut-turut adalah 1.0190 g/mL, 2.66%, 2.02%, 3.03%, 8.18%, 5.52% dan 6.89, sedangkan sampel susu daerah Cilibende adalah 1.026 g/mL, 3.80%, 2.75%, 4.13%, 11.34%, 7.54% dan 6.54. Berdasarkan hasil penelitian ini dapat disimpulkan bahwa kualitas dari susu siap minum yang dijual di kedai sekitar permukiman mahasiswa Institut Pertanian Bogor kurang baik karena tidak memenuhi syarat standar minimum SNI No. SNI 01-3951-1995 tentang Susu Pasteurisasi.
Keyword: IPB University, milk, pasteurized, quality

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