Judul: Efek proteksi komponen bioaktif oleoresin rimpang jahe (Zingiber offcinale Roscoe) terhadap fungsi limfosit secara in vitro
Abstrak: Pangan fungsional (functional food) merupakan paradigma yang berkembang sejak abad 19, dan didukung oleh studi interaksi antara komponen pangan (komponen gizi makro dan mikro serta komponen non gizi) dengan fungsi spesifik di dalam tubuh, fungsi sel-sel pertahanan tubuh_ Komponen non gizi pangan dari rempah dan bumbu yang biasanya berfungsi sebagai aroma, rasa dan flavor makanan, kini sebagian besar diketahui nilai fungsionalnya terhadap kesehatan tubuh_ Senyawa fenol jahe yaitu gingerol, shogaol dan zingeron meuunjukkan kemampuan antioksidatif yang tinggi, namun mekanisme efek positif senyawa antioksidan jahe tersebut terhadap sistem pertahanan tubuh masih belum diketahui dan diteliti sampai pada tingkat seluler_ Penelitian ini dilakukan pada sistem in vitro dan bertujuan untuk : 1) menguji efek komponen oleoresin jahe terbadap respons proliferatif limfosit (sel B dan T), persentase CD3+ dan subset sel T yaitu Th (CD3+CD4+) dan sitolitik sel Natural Killer (NK), dalam kondisi normal dan kondisi sires oksidatif, 2) menguji efek antioksidatif komponen oleoresin jahe terhadap terhadap kadar glutation total, malondialdehida (MDA) dan radikal bebas limfosit pada kondisi normal clan kondisi stres oksidatif ...dst
Keyword: ginger (Zingiber officinale Roscoe), oleoresin fractions, stress oxidative, protective effect, antioxidative activity, lymphocyte, proliferation, cytolytic activity, glutathion, free radical and malondialdehyde.

Judul: Kajian Literatur Identifikasi Komponen Bioaktif Antiinflamasi Rimpang Jahe (Zingiber officinale) dan Stabilitasnya terhadap Suhu Pengolahan
Abstrak: Jahe (Zingiber officinale R) adalah rempah-rempah yang sejak dahulu dikenal oleh masyarakat Indonesia. Pemanfaatan jahe adalah sebagai penambah cita rasa makanan dan obat tradisional. Berbagai penyakit yang mewabah dunia mendorong ilmuwan untuk mencari herbal yang membantu meringankan gejala penyakit yang salah satunya bersumber dari jahe. Jahe diketahui memiliki aktivitas antiinflamasi sehingga dapat mengendalikan inflamasi yang merupakan gejala berbagai penyakit infeksi. Aktivitas antiinflamasi pada jahe terutama karena kandungan gingerol dan shogaol yang bekerja dengan cara menghambat kerja enzim COX dan produksi NO. [6]-shogaol adalah senyawa bioaktif yang paling efektif dalam menghambat inflamasi. Pengolahan jahe yang melibatkan pemanasan memberikan dampak positif terhadap aktivitas antiinflamasi jahe. Kadar [6]-shogaol jahe meningkat selama pemanasan akibat reaksi dehidrasi [6]gingerol menjadi [6]-shogaol.
Keyword: Antiinflamasi, jahe, pengolahan jahe, stabilitas panas, [6]-shogaol

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