Judul: Respon laju respirasi mitokondria terhadap pemberian jamu kuat dan ekstrak tanaman afrodisiak
Abstrak: Mitokondria merupakan organel di sitoplasma sel eukariot. Fungsi utama organel ini adalah sebagai reaktor energi yang mengubah energi kimia yang terkandung dalam molekul substrat menjadi energi kimia yang tersimpan dalam bentuk adenosin trifosfat (ATP) melalui proses respirasi selular. Peningkatan aktifitas tubuh menyebabkan peningkatan kebutuhan energi yang berarti proses respirasi selular di mitokondria untuk membentuk ATP meningkat. Peningkatan proses respirasi selular dapat diamati dengan mengukur peningkatan konsumsi oksigen. Tanaman afrodisiak dan jamu kuat diduga mampu meningkatkan kemampuan seksual dan stamina penggunanya, namun mekanisme yang pasti mengenai peningkatan tersebut masih belum jelas. Penelitian ini bertujuan untuk mempelajari pengaruh jamu kuat dan ekstrak tanaman afrodisiak terhadap laju konsumsi oksigen di mitokondria. Penelitian ini mempelajari pengaruh pemberian jamu Kuku Bima TL (KBTL) terhadap perubahan laju konsumsi oksigen isolat mitokondria sel hati tikus putih. Komponen penyusun jamu KBTL yang berupa tanaman afrodisiak, yaitu ginseng, pasak bumi, jahe dan kencur, juga diujikan ke dalam isolat mitokondria. Hal ini bertujuan untuk mengetahui pengaruh dari masing-masing komponen jamu tersebut. Pemberian ekstrak jamu dan tanaman afrodisiak meyebabkan penurunan laju konsumsi oksigen yang mengindikasikan terjadinya penurunan respirasi selular di mitokondria. Semua bahan uji tersebut diduga berperan sebagai inhibitor bagi proses respirasi selular, jika diberikan langsung ke dalam isolat mitokondria.
Keyword: 

Judul: Respon laju respirasi mitokondria terhadap pemberian ekstrak kasar tanaman afrodisiak
Abstrak: Aphrodisiac is believed can increase human stamina and sexuality enhancement. The mechanism can be performed in hormonally and non hormonally way. Hormonal mechanism is thought to be related to cell respiration in mitochondria. The objective of this research was to know the effect of aphrodisiac plant crude extract addition to the mitochondria respiration rate, especially Krebs cycle. Fresh mitochondria was isolated from the liver, kidney and limph of Wistar strain rat. Several plants that used in this research were ginseng (Panax ginseng), pasak bumi (Eurycorna longijolia), cabe jawa (Pepper retrofracttrm), kayu lanang (Oroxylttnt indicttm), tapak liman (Elephantophris scaber) dan purwoceng (Pimpinella prtraljan). Oxidation rate was measured by the ratio of NADH and NADi and performed by ultraviolet spectrophotometer. Aphrodisiac plant crude extract addition to the fresh mitochondria isolate generally decrease its respiration rate, especially by the addition of ginseng, cabe jawa, tapak liman, and kayu lanang. These plant extract addition caused a lower oxidation rate than the control treatment almost in every concentration that used in this research. The control oxidation rate value was 0.620.
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