Judul: Literature Review on Caracteristic of Honey and Mint Leaf Extract as A Candidate of Functional Drink
Abstrak: Madu merupakan produk hasil ternak yang bermanfaat untuk menjaga kesehatan tubuh dan dapat diolah menjadi minuman fungsional. Penambahan ekstrak daun mint pada produk minuman fungsional madu dilakukan untuk memberi efek rasa dingin dan khasiat produk. Kajian pustaka ini bertujuan menganalisis karakteristik madu dan daun mint sebagai bahan baku produk minuman fungsional. Kajian pustaka dilakukan dengan penelusuran karya tulis ilmiah pada media dalam jaringan (daring). Hasil yang didapatkan berupa data sekunder mengenai karakteristik beberapa madu di Indonesia, jenis-jenis daun mint yang umum digunakan dalam produk pangan, senyawa bioaktif kedua bahan, metode ekstraksi senyawa bioaktif, dan pencampuran bahan sebagai minuman fungsional. Data kemudian dianalisis secara deskriptif. Madu-madu tropis yang lazim ditemui di Indonesia yaitu madu kaliandra, madu randu, madu kelengkeng, madu karet, dan madu rambutan potensial sebagai kandidat minuman fungsional dengan penambahan ekstrak daun mint dari spesies Mentha piperita, Mentha spicata, dan Mentha arvensis karena memenuhi ketentuan minuman fungsional berdasarkan karakteristik dan komponen bioaktif yang terdapat pada madu dan ekstrak daun mint., Honey is a livestock product that is useful for maintaining body health and can be processed into functional honey drinks. The addition of mint leaf extract to functional drink products is carried out to provide a cooling effect and product properties. This study aims to analyze the characteristics of honey and mint leaves as raw materials for functional drink products. Literature review is carried out by tracing scientific papers on online media. The results obtained were the form of secondary data about characteristics of honeys in Indonesia, types of mint leaves that are commonly used in food products, the bioactive compounds of the two ingredients, the extraction method for bioactive compounds, and the mixing of ingredients as functional drinks. The data were analysed using descriptive analysis. Tropical honey that is commonly found in Indonesia, namely calliandra honey, randu honey, longan honey, karet honey, and rambutan honey, are potential as a candidate for functional drinks with the addition of mint leaf extracts from the species Mentha piperita, Mentha spicata, and Mentha arvensis because they are fulfill the functional drink requirements based on the characteristics and bioactive components that found in honey and mint leaf extract.
Keyword: Bioactive compounds, functional drink, honey, mint lea

Judul: Characteristics of Manuka compared Forest Honey Herbal Drinks with The Addition of Qusthul Hindi and Turmeric
Abstrak: Madu manuka dan madu hutan merupakan jenis madu yang sering dikonsumsi karena sifat antioksidannya yang tinggi. Penelitian ini bertujuan untuk menganalisis karakteristik madu hutan dan manuka serta aplikasi madu tersebut sebagai minuman herbal dengan penambahan qusthul hindi dan temulawak. Penambahan qusthul hindi dan temulawak diberikan masing-masing dalam dua formulasi (0,125 g dan 0,375 g). Penelitian ini dilakukan dalam dua tahap, yaitu menganalisis karakteristik madu manuka dan madu hutan serta pembuatan minuman herbal untuk kemudian dianalisis karakteristiknya. Hasil penelitian menunjukkan karakteristik madu hutan belum memenuhi standar pada variabel pH, nilai HMF, dan aktivitas enzim diastase, sedangkan untuk madu manuka hanya memenuhi standar pada variabel kadar air, nilai HMF, dan aktivitas enzim diastase. Penambahan qusthul hindi dan temulawak pada minuman herbal menyebabkan peningkatan nilai pH, aktivitas penghambatan DPPH, dan kapasitas antioksidan, namun secara sensori tidak disukai karena penambahan rempah menyebabkan perubahan rasa dan penampilan., Manuka and forest honeys are types of honeys that are widely consumed because for their high antioxidant properties. In this study, the properties of forest and manuka honey and the use honey as a herbal drink with the addition of qusthul hindi and turmeric were analyzed. The addition of qusthul hindi and turmeric is given in two formulations (0,125 g and 0,375 g, respectively). This study was conducted in two sphase, namely analyzing the characteristics of manuka and forest honey and preparing herbal drinks to then analyzing their properties. The results showed that the properties of forest honey do not meet the standards for the variables of pH, HMF value, and diastase enzyme activity, while manuka honey meets the standards only for variables of moisture, HMF value, and diastase enzyme activity. The addition of qusthul hindi and turmeric to herbal drinks results in an increase in pH, DPPH inhibitoty activity, and antioxidant capacity, as well as a decrease of water content, but is not sensory evaluated because the addition of spices causes changes in taste and appearance.
Keyword: antioxidant, forest honey, manuka honey, qusthul hindi, turmeric

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