Judul: Efektivitas Penambahan Madu Rambutan pada Kombucha Bunga Telang dalam Menghambat Pertumbuhan Sel Kanker Kolorektal
Abstrak: Madu adalah salah satu produk hasil ternak yang memiliki berbagai manfaat. Senyawa fenolik dan flavonoid dalam madu memiliki potensi sebagai agen antikanker. Penelitian ini bertujuan menganalisis penambahan madu rambutan pada kombucha bunga telang yang dipasteurisasi dalam menghambat pertumbuhan sel kanker kolorektal. Metode penelitian dilakukan secara in vitro. Kombucha bunga telang yang diberi penambahan madu rambutan 5%, 10%, dan 15% serta gula 10% sebagai kontrol kemudian dilakukan pengujian pH, kadar alkohol, uji organoleptik, uji MTT (micro tetrazolium assay) untuk mengevaluasi daya hambat terhadap sel kanker (HCT-116), dan profil metabolik. Hasil penelitian menunjukkan bahwa penambahan madu rambutan pada kombucha bunga telang memiliki karakteristik pH rendah (2,85-2,89), kadar alkohol <0,5%, dan mutu organoleptik yang berbeda nyata pada atribut warna dan rasa. Kombucha yang dipasteurisasi memiliki efektivitas penghambatan sel HCT-116 tertinggi, hingga 94,98% kematian sel pada penambahan madu rambutan 15%. Uji profil metabolik dengan LC-MS mengidentifikasi glukosamin dan kaempferol sebagai senyawa aktif yang berperan sebagai antikanker pada kombucha bunga telang dengan penambaan madu rambutan. Dapat disimpulkan bahwa penambahan madu rambutan pada kombucha bunga telang yang dipasteurisasi efektif dalam menghambat sel kanker kolorektal dan berpotensi sebagai minuman fungsional antikanker kolorektal.
Keyword: Bunga telang, Madu Rambutan, Kanker kolorektal, Kombucha

Judul: Proximate Analysis and Inhibition Activities of Forest Honey, Rambutan Honey and Longan Honey on Cancer Cells MCF-7
Abstrak: Kanker adalah penyakit akibat pertumbuhan sel-sel jaringan tubuh yang abnormal. Penanganannya yang mahal dan berbahaya mendorong pencarian pengobatan alternatif dengan sumber alam. Madu diketahui memiliki komposisi senyawa yang bersifat antikanker. Penelitian ini bertujuan untuk mengkaji aktivitas antikanker madu rambutan, kelengkeng, dan hutan dan kandungan proksimatnya. Analisis proksimat terdiri atas analisis kadar air, abu, protein, lemak, energi total dan karbohidrat. Hasil uji menunjukkan bahwa madu mengandung lemak total (<0,02%) dan protein (0,04%) yang rendah. Selanjutnya, aktivitas antikanker diuji menggunakan sel kanker payudara MCF-7 dengan metode MTT (3-(4,5- dimethylthiazole-2-yl)-2,5-diphenyltetrazolium bromide) dengan tiga kali pengulangan. Madu menunjukkan aktivitas penghambatan yang sangat lemah terhadap sel MCF-7. Madu rambutan memiliki aktivitas penghambatan tertinggi (121,81±2,04 ppm) diikuti madu kelengkeng (199,32±1,60 ppm) dan madu hutan (339,24±1,02 ppm). Kendati aktivitas penghambatannya yang lemah, madu menjanjikan untuk dikembangkan lebih lanjut sebagai pengobatan antikanker dengan mengisolasi senyawa yang bertanggung jawab untuk aktivitas antikanker., Cancer is a disease caused by abnormal growth of body tissue cells. Expensive and dangerous treatment encourage the search for alternative medicine with natural sources. Honey is known for its anticancer properties. This study aims to examine the anticancer activity of rambutan, longan, and forest honey and their proximate content. Proximate analysis consisted of analysis of water content, ash, protein, fat, total energy and carbohydrates. The proximate test results showed that honey contained very low total fat (<0.02%) and protein (0.04%). Furthermore, the anticancer activity of honey was tested using MCF-7 breast cancer cells with the MTT test (3-(4,5-dimethylthiazole-2-yl)-2,5-diphenyltetrazolium bromide) with three repetitions. Honey showed very weak inhibitory activity against MCF-7. Rambutan honey had the best inhibitory activity (121.81±2.04 ppm) followed by longan honey (199.32±1.60 ppm) and forest honey (339.24±1.02 ppm). The weak inhibition, nevertheless, promises the honey to be further developed as anticancer treatments by isolating the compounds responsible for the anticancer activity.
Keyword: anticancer activity, cancer, honey, MTT assay

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