Judul: Karakteristik Fisikokimia, Aktivitas Antioksidan, dan Kandungan Malondialdehida Ayam Panggang dengan Bumbu Marinasi yang Berbeda
Abstrak: Penelitian ini bertujuan menganalisis karakteristik sifat fisikokimia, aktivitas antioksidan, dan kadar senyawa malondialdehida pada daging ayam panggang dengan perlakuan bumbu marinasi yang berbeda. Penelitian ini menggunakan ayam broiler bagian paha atas yang dimarinasi dengan bumbu sesuai perlakuan selama 12 jam. Ayam marinasi dipanggang di atas pemanggangan hingga suhu internal mencapai 70 °C dan setiap 5 menit ayam dibalik selama proses pemanggangan. Hasil penelitian menunjukkan bahwa penggunaan bumbu marinasi yang berbeda pada ayam panggang tidak berpengaruh nyata terhadap sifat fisikokimia yang meliputi kadar air, pH, dan daya putus, aktivitas antioksidan yang meliputi aktivitas penghambatan radikal DPPH dan kapasitas antioksidan, serta nilai TBARS. Kesimpulannya adalah perlakuan bumbu marinasi yang berbeda tidak menghasilkan karakteristik fisikokimia dan aktivitas antioksidan ayam panggang yang berbeda. Secara umum, kandungan MDA pada ayam panggang dengan perlakuan bumbu marinasi lengkuas, manis, dan pedas tidak menghasilkan aroma ketengikan yang dapat tercium oleh indra penciuman., This study aims to analyze the physicochemical characteristics, antioxidant activity, and levels of malondialdehyde compounds in grilled chicken meat threated with different marinades. This research used broiler chicken upper thighs which were marinated with spices according to the treatment for 12 hours. The marinated chicken is grilled on the grill until the internal temperature reaches 70 °C and every 5 minutes the chicken is turned over during the grilling process. The results showed that the use of different marinades in grilled chicken had no significant effect on the physicochemical properties which includes water content, pH, and separated strength, antioxidant activity which includes DPPH radical inhibition activity and antioxidant capacity, and the TBARS value. The conclusion is that the treatment of different marinades didn’t produce different physicochemical characteristics and antioxidant activity of grilled chicken. In general, the MDA content in grilled chicken treated with galangal, sweet, and spicy marinades doesn’t produce a rancid aroma that can be detected by the sense of smell.
Keyword: aktivitas antioksidan, bumbu marinasi, karakteristik fisikokimia, daging ayam panggang, malondialdehida

Judul: Physicochemical Characteristics and Antioxidant Activity of Fried-Braised Broiler Chicken Meat with Various Marinades.
Abstrak: Bumbu marinasi diketahui dapat menghambat oksidasi karena mengandung komponen senyawa antioksidan. Penelitian ini bertujuan mengkaji pengaruh perlakuan berbagai bumbu marinasi dalam pembuatan ayam ungkep yang digoreng terhadap karakteristik fisikokimia (kadar air, pH, keempukan), aktivitas antioksidan, dan kadar malondialdehida. Daging ayam dimarinasi dengan perlakuan kontrol, bumbu kuning asin, bumbu lengkuas, bumbu manis, dan bumbu pedas selama 30 menit, kemudian diungkep dan digoreng. Hasil penelitian menunjukkan bahwa pemberian perlakuan bumbu marinasi memberikan pengaruh nyata (p, Marination is known to inhibit oxidation due to the presence of antioxidant compounds. This research aimed to investigate the effect of various marinade treatments on the physicochemical characteristics (water content, pH, tenderness), antioxidant activity, and malondialdehyde content of fried-braised chicken. Chicken meat was marinated with a control treatment, salty yellow marinade, galangal marinade, sweet marinade, and spicy marinade for 30 minutes, then parboiled and fried. The results showed that marinade treatments had a significant effect (p
Keyword: antioxidant, marinade, fried-braised chicken meat, physicochemical characteristics

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