Judul: Determinasi Pemberian Minyak Trans Terhadap Stres Oksidatif pada Tikus Galur Wistar dengan Malondialdehida Pankreas sebagai Indikator
Abstrak: Trans fatty acids (TFAs) are the entire unsaturated fatty acids containing one or more double bonds isolated in trans configuration believed as predisposing factor of oxidative stress, excluding conjugated double bond fatty acids. Malondialdehyde (MDA) is a product of lipid peroxidation used as oxidative stress marker. The objective of this study was to see the correlation between TFAs containing-oil (consists of 3-6% TFAs) intake at various administration doses and pancreatic MDA levels in Wistar rats. Twelve rats were grouped according to administration doses (20%, 40%, 60% of given feed total energy and control group). TFAs containing-oil was administered orally once a day for 70 days at given doses by force feeding. Pancreatic MDA were measured using TBARS assay adapted from Singh et al. (2006). Increase of TFAs containing-oil administration dose caused insignificant increase of pancreatic MDA level.
Keyword: Bogor Agricultural University (IPB), palm oil, Wistar rats, malondialdehyde, oxidative stress, trans fatty acids

Judul: Pengaruh Pemberian Diet Tinggi Lemak terhadap Profil Lipid dan serum MDA (Malonaldehida) pada Tikus Percobaan
Abstrak: Trans fat is one of the causes of coronary heart disease (CHD). The highest intake of trans fat come from hydrogenated oil. Margarine and shortening are hydrogenated oil products that are widely consumed. The objective of this study was to determine the effect of high-fat diet with varioustrans fat content on lipid profile (total cholesterol, HDL, LDL, and triglycerides) and MDA (Malondialdehyde). Male Sprague Dawley rats aged ± 8 weeks were given high-fat diet. Source of fat was from local margarine, import margarine, and shortening. Observation was conducted for six weeks. Local margarine had the lowest trans fat content (0.10%). The highest unsaturated fatty acids content was in import margarine (47.76%). Shortening had the highest saturated fatty acids (53.48%). The lowest increasement of total cholesterol level was found in rat local margarine group (86.6 ± 5.41 mg/dL). HDL cholesterol level in rat local margarine and shortening groups was decrease while in import margarine group was increase. LDL cholesterol levels of each group of rat decrease. The highest decreasement was seen in rat local margarine group 2.39 ± 3.2 mg/dL. Triglyceride level in import margarine group was increase while in rat local margarine and shortening groups were decrease. MDA level in rat local margarine and shortening groups were increase while in rat import margarine was decrease.
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