Judul: Pengaruh Pendinginan dan Umur Kambing terhadap Flavor Daging Kambing Mentah dan Matang
Abstrak: Kebutuhan daging sebagai salah satu bahan pangan dan sumber protein meningkat sejalan dengan meningkatnya jumlah penduduk Indonesia. Untuk itu, perlu diusahakan cara-cara untuk mempcrpanjang masa simpan daging, misalnya dengan menyimpan daging pada kondisi pendinginan yang tepat, dengan tetap mempertahankan mutu daging. Salah satu atribut mutu daging yang penting adalah flavor daging tersebut. Penelitian ini bertujuan untuk mempclajari sejauh mana pengaruh kondisi pendinginan daging kambing dan perbedaan umtlr krtmbing terhadap flavor daging kambing mcntah dan flavor sate kambing yang ditlasilkan. Tahap pcrtarna pcnclitian ini adalah pengujian organolcptik tcrhadap daging mcntah dan sate kambing, masing-masing dengan uji hedonik dan uji skoring. Sctclah hasil uji organoleptik diperoleh, dilakukan penelitian tahap kedua yaitu ekstraksi tlavor daging kambing dan analisis ekstrak flavor daging kambing dengan kromatograf gas untuk mendapatkan profil kromatografi gas.
Keyword: 

Judul: Pengaruh Suhu dan Lama Pemeraman Daging Kambing Kacang Jantan terhadap Sifat Fisik dan Organoleptik
Abstrak: Kambing kacang merupakan ternak lokal yang mempunyai potensi besar untuk dimanfaatkan karena populasinya tertinggi dibandingkan ternak lainnya. Dibandingkan dengan daging domba, penelitian tentang mutu daging kambing selama pemeraman masih belum banyak dilakukan terutama kambing lokal. Penelitian ini bertujuan untuk mengetahui terjadinya perubahan pada daging kambing kacang jantan selama pemeraman dingin berhubungan dengan keempukan, pH, daya ikat air, warna dan citarasanya. Sebelum melakukan penelitian utama terlebih dahulu ditentukan suhu pemanggangan optimal untuk memperoleh keempukan dan citarasa yang sesuai. Suhu pemanggangan daging matang diperoleh sebesar 800C. Kambing kacang yang digunakan dalam penelitian adalah kambing kacang jantan yang yang diperoleh dari pengumpul di Ciampea. Sebelum dilakukan pemotongan dilakukan pengkondisian dengan cara dipelihara pada kondisi yang sama dan dipuasakan serta diistirahatkan selama 18 jam.
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