Judul: Pemberian Infusa Biji Adas (Foeniculum Vulgare Mill.) Terhadap Perkembangan Uterus Tikus Putih Produktif Dan Premenopause
Abstrak: Fitoestrogen pada adas memiliki efek seperti estrogen alami. Penelitian ini bertujuan untuk mempelajari pengaruh pemberian infusa adas (Foeniculum vulgare Mill.) terhadap ketebalan endometrium dan jumlah kelenjar uterus tikus putih secara histopatologi. Sebanyak 5 ekor tikus produktif dan 5 ekor tikus premenopause dibagi menjadi 5 kelompok yaitu kontrol positif (KP) diberi etinil estradiol dosis 9x10-3 mg/200 g BB, kontrol negatif (KN) diberi aquades 1 mL, dan tiga kelompok lain diberi infusa adas dosis 1 (D1) 36.5 mg/100 g BB, dosis 2 (D2) 73 mg/100 g BB, dan dosis 3 (D3) 146 mg/100 g BB. Pemberian ekstrak adas dan etinil estradiol dilakukan dengan cara dicekok setiap hari selama 16 hari. Hasil penelitian menunjukan bahwa infusa adas tidak berpengaruh pada ketebalan endometrium dan jumlah kelenjar uterus tikus produktif dan premenopause.
Keyword: Adas, etinil estradiol, fitoestrogen

Judul: Pengaruh Pemberian Infusa Biji Adas (Foeniculum vulgare Mill.) Terhadap Perkembangan Folikel Ovarium Tikus Putih (Rattus norvegicus) Produktif dan Premenopause
Abstrak: Biji adas (Foeniculum vulgare Mill.) diketahui mengandung fitoesrogen, yang mempunyai efek kerja seperti hormon estrogen. Penelitian ini bertujuan untuk mengetahui pengaruh pemberian infusa adas (Foeniculum vulgare Mill.) pada berbagai dosis terhadap perkembangan folikel ovarium tikus putih (Rattus norvegicus) produktif dan premenopause. Sebanyak 50 puluh ekor tikus yang terdiri atas 25 ekor tikus produktif dan 25 ekor tikus premenopause, masing- masing dibagi menjadi 5 kelompok yaitu kelompok kontrol negatif (KN) yang diberi aquades 1 ml, kelompok kontrol positif (KP) yang diberi etinil estradiol 9x10 mg/200 g BB, kelompok dosis I (D1) yang diberi infusa adas dengan dosis 36.5 mg/100 g BB, kelompok dosis 2 (D2) yang diberi infusa adas dengan dosis 73 mg100 g BB, dan kelompok dosis 3 (D3) yang diberi infusa adas dengan dosis 146 mg/100 g BB. Pemberian infusa adas dilakukan dengan cara pencekokan selama 16 hari. Hasil penelitian menunjukkan bahwa pemberian infusa adas dosis 36.5 mg/100 g BB, 73 mg/100 g BB, dan 146 mg/100 g BB selama 16 hari tidak berpengaruh terhadap tingkat perkembangan folikel ovarium tikus putih (Rattus norvegicus).
Keyword: Adas, Fitoestrogen, Premenopause

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