Judul: Peran Ekstrak Etanol Tempe Terhadap Kadar Dna Dan Rna Testis Tikus Usia 70 Hari
Abstrak: Fitoesterogen merupakan senyawa mirip estrogen yang terkandung didalam kedelai. Kedelai adalah bahan baku utama pembuatan tempe. Fitoesterogen termasuk esterogen alami golongan isoflavon. Penelitian ini dilakukan untuk mengetahui pengaruh kinerja ekstrak tempe terhadap kinerja reproduksi tikus jantan dewasa. Sebanyak 9 ekor tikus jantan usia 21 hari dibagi menjadi 3 kelompok yaitu kelompok kontrol, kelompok perlakuan 0.25 g/ekor/hari, dan kelompok perlakuan 0.5 g/ekor/hari yang diberi ekstrak tempe sampai usia 48 hari. Parameter yang diamati meliputi bobot basah testis, bobot kering testis, kadar DNA, kadar RNA, dan jumlah spermatozoa. Pengambilan data dilakukan ketika tikus berusia 70 hari. Data yang dihasilkan dianalisis dengan uji ANOVA dan dilanjutkan dengan uji Duncan dengan selang kepercayaan 95% (a=0.05). Hasil penelitian pemberian ekstrak tempe terjadi penurunan kadar DNA pada perlakuan 0.25 g/ekor/hari, peningkatan kadar RNA dan peningkatan jumlah spermatozoa pada perlakuan 0.5 g/ekor/hari.
Keyword: dna, rna, ekstrak tempe, tikus jantan

Judul: Peran Ekstrak Etanol Tempe Terhadap Kadar DNA dan RNA Testis Tikus Jantan Usia 70 hari
Abstrak: Phytoestrogen is a subtance in soybean that have similiar structure with natural estrogen. Soybean is the main raw material of making tempe. Phytoestrogen are natural estrogen in isoflavon group. This study was conducted to investigate the role of tempe extract in reproduction performance of adult male rats. Nine male rats weaning age (21 days) were divided into 3 groups, control, treatment groups that were given a tempe extract 0.25 g/rat/day and 0.5 g/rat/day until ages of 48 days. Testicular wet weight, testicular dry weight, concentration of DNA levels, concentration of RNA levels, and sperms quantity in each group were measured. Data were collected at the age of 70 days and were analyzed using ANOVA test and Duncan test with 95% confidence interval (a=0.05).The results show that tempe extract of 0.25 g/rat/day could decrease the concentration of DNA levels and 0.5 g/rat/day increase the RNA levels and the sperm quantity.
Keyword: Bogor Agricultural University, tempe extract, male rats, rna, dna

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