Judul: Pengetahuan tentang manfaat kesehatan temulawak (Curcuma xanthorrhiza Roxb.) dan uji klinis minuman instan temulawak terhadap limfosit T, B, dan Sel NK pada obesitas
Abstrak: The objectives of the following study were to analyze the health benefit knowledge of curcuma on adult and clinical efficacy of curcuma instant drink to increasing lymphocytes count. Design for knowledge survey was cross sectional study and involving 79 subjects (40 male and 39 female) while the design for clinical trial was pre and post test design and involving 21 subjects. Result of this study showed that the health benefits of curcuma most widely known by subjects were to increase appetite (93.4%) and to maintain stamina (92.1%). Female subjects have higher knowledge (58.0 ± 25.8) than male subjects (57.0 ± 28.3) altough there isn’t significance difference (p > 0.05) and the knowledge of curcuma health benefit inversely with the level of education (p < 0.05). The study showed that there was significant increase (p = 0.034 and p = 0.045) in T cell population (CD3+, CD4+) and significant decreasing (p = 0.000 and p = 0.001) in B cell (CD 19+) and CD8+ after intervention of 13.24 g curcuma instant drink per day. It was concluded that curcuma has potential beneficial effect in enhancing cellular immunity but decreasing in humoral immunity in obese human subjects.
Keyword: 

Judul: Aktivitas ekstrak etanol temulawak [Curcuma xanthorrhiza Roxb] pada proliferasi sel limfosit secara In Vitro
Abstrak: Penelitian ini bertujuan untuk menguji aktivitas ekstrak etanol (70% dan 96%) temulawak (Curcuma xanthoriza Roxb.) dalam peningkatan proliferasi sel limfosit secara in vitro. Penelitian dilakukan dengan menanam sel limfosit pada tissue culture plate yang dibubuhi berbagai konsentrasi ekstrak dengan 3 kali ulangan. Konsentrasi ekstrak yang digunakan adalah 0 (kontrol negatif), 25 (P1), 50 (P2), 75 (P3), 200 (P4), 400 (P5), dan 600 ppm (P6). Pemanenan dilakukan setelah sel pada cawan kontrol negatif mencapai confluence atau koloni mencapai 70% pertumbuhan. Penghitungan sel dilakukan dengan pewarnaan Trypan blue menggunakan hemositometer Neubauer. Hasil penelitian menunjukan adanya aktivitas proliferasi ekstrak etanol temulawak pada sel limfosit. Dosis ekstrak etanol 25 ppm-70% menunjukkan hasil paling rendah dengan aktivitas proliferasi sebesar 81% dan hasil paling tinggi adalah dosis ekstrak etanol 600 ppm-96% sebesar 178%. Hasil tersebut menunjukkan potensi temulawak sebagai tanaman yang memiliki aktivitas sebagai imunomodulator…
Keyword: Temulawak, Ekstrak, Etanol, Proliferation, Lymphocyte, In vitro

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