Judul: Uji Toksisitas Ekstrak Etanol Rimpang Temu Putih terhadap Larva Udang dan Embrio Ikan Zebra
Abstrak: Curcuma zedoaria, known as temu putih, is commonly used as traditional medicine in Indonesia. The toxicity of this herb needs to be studied to improve its application. This research aims to evaluate the toxicity of the crude ethanol extract of temu putih rhizome against brine shrimp (Artemia salina) larvae and zebrafish (Danio rerio) embryos and to analyze the suspected active compounds contained in the extract. The crude ethanol extract showed 50% lethal concentration value (LC50) at 588 ppm against brine shrimp larvae and 215 ppm against zebrafish embryos. In zebrafish embryos, exposure of the crude ethanol extract has caused major malformation in development of head, namely brain and eyes organs. Based on the gas chromatography-mass spectrometry analysis, the suspected active compound that play a role in the toxicity are epicurzerenone, curzerene, and curzerenone, which 2,4,6-trimethylacetophenone as the predominant compound.
Keyword: Bogor Agricultural University (IPB), LC50, Danio rerio, Curcuma zedoaria, Artemia salina

Judul: Perkembangan Embrio Ikan Zebra (Danio Rerio) Setelah Paparan Ekstrak Etanol Temu Lawak (Curcuma Xanthorrhiza) Dan Temu Putih (Curcuma Zedoaria).
Abstrak: Temu lawak dan temu putih merupakan obat tradisional yang telah digunakan secara turun-temurun. Kedua tanaman ini telah dilaporkan bersifat toksik pada embrio ikan zebra. Penelitian ini bertujuan untuk mempelajari perkembangan embrio ikan zebra setelah paparan ekstrak temu lawak, temu putih, dan campurannya. Nilai LC50 ekstrak etanol temu lawak, temu putih, dan campurannya berturut-turut adalah 16.9, 112.1, dan 82.9 ppm. Ekstrak temu lawak menyebabkan penghambatan proses menetas pada embrio ikan zebra, sebaliknya ekstrak temu putih tidak menunjukkan efek penghambatan tersebut. Malformasi mayor yang terjadi pada embrio ikan zebra akibat paparan ekstrak temu lawak adalah edema perikardium, koagulasi darah, notokorda, dan edema kantong kuning telur; akibat paparan temu putih adalah edema perikardium dan koagulasi darah; serta akibat paparan campuran keduanya adalah edema perikardium, koagulasi darah, dan sirkulasi darah. Ekstrak temu putih memiliki sifat antagonis terhadap ekstrak temu lawak, yaitu mampu menghilangkan efek penghambatan proses menetas serta menurunkan kelainan pada notokorda dan kantong kuning telur.
Keyword: abnormalitas, embrio ikan zebra, LC50, temu lawak, temu putih

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