Judul: Aktivitas Antibakteri dan Antioksidan Tiga Jenis Madu Hutan Indonesia
Abstrak: This study was conducted to determine the antibacterial and antioxidant activity of three types Indonesian forest honey, including honey forests of West Kalimantan (KB1), Sumatra (SM1) and Sumbawa (SB1). Antibacterial testing, was determined by sumur method with three concentration, ie 25%, 50% and 100% on four types of bacteria, Staphylococcus aureus, Salmonella typhi, Escherichia coli and Pseudomonas aeruginosa, while its antioxidant activity, was determined by DPPH (1-diphenyl-2-picrylhydrazil) method. The test results indicate that all three forest honey has antibacterial and antioxidant activity. SB1 forest honey has the best antibacterial activity specifically against S.thypi and E.coli with inhibitory diameter 32.5 mm dan 27.5 mm. In order of goodness with EC50 successively acquired KB1, SM1 and SB1 forest honey is 2725.722 ppm, 2872.765 ppm dan 4341.545 ppm. Antibacterial and antioxidant honey sourced from the content of one group of active compounds such as honey, alkaloids, phenolics, flavonoids, triterpenoids, saponins and glycosides.
Keyword: forest honey, antioxidant, antibacterial

Judul: Diastase Enzyme Activity and Antibacterial Effectiveness to Gastroenteritis by Apis mellifera Honey from Indonesia
Abstrak: Kualitas madu monoflora (Apis mellifera) sebagai antibakteri dapat dipengaruhi oleh aktivitas enzim diastase dan metabolit sekunder sumber nektar. Penelitian ini bertujuan untuk membandingkan aktivitas enzim diastase dan efektivitas madu monoflora yang berasal dari lebah Apis mellifera sebagai antibakteri alami terhadap bakteri Staphylococcus aureus, Escherichia coli, dan Salmonella typhi. Metode pengambilan sampel madu monoflora dari sembilan sumber nektar yang berbeda (akasia, kaliandra, rambutan, kayu putih, randu, mangga, kopi robusta 1, kopi robusta 2, dan karet) dilakukan dengan menentukan nilai diastase menggunakan spektrofotometri UV-Vis dan zona hambat bakteri menggunakan cakram difusi. Analisis multivariatif kadar brix, aktivitas enzim diastase, dan antibakteri menggunakan Principal Component Analysis (PCA). Hasil penelitian menunjukkan bahwa aktivitas enzim diastase tertinggi sebesar 20,00 DN pada madu mangga, rambutan, dan kopi robusta 2, sedangkan terendah sebesar 4,00 DN pada madu kaliandra. Aktivitas antibakteri terhadap S. aureus tertinggi sebesar 19,47 mm pada madu kopi robusta 2, terhadap E. coli sebesar 27,93 mm pada madu randu, dan terhadap S. typhi sebesar 18,53 mm pada madu kopi robusta 2. Nilai konsentrasi hambat minimum (KHM) tehadap bakteri yang diuji sebesar 8 µg/mL pada madu akasia, kayu putih, randu, kopi robsuta 1, dan kopi robusta 2. Analisis klasterisasi berdasarkan kadar brix, aktivitas enzim diastase, dan antibakteri yaitu klaster 1 (kaliandra); klaster 2 (akasia, kayu putih, randu, kopi robusta 1); klaster 3 (mangga, rambutan, kopi robusta 2); klaster 4 (karet)., The quality of monoflora honey (Apis mellifera) as an antibacterial can be influenced by the activity of the diastase enzyme and the secondary metabolites of the nectar source. This study aims to compare the activity of the diastase enzyme and the effectiveness of monoflora honey derived from Apis mellifera bees as a natural antibacterial agent against Staphylococcus aureus, Escherichia coli, and Salmonella typhi. The sampling method for monoflora honey from nine different nectar sources (acacia, calliandra, rambutan, eucalyptus, randu, mango, robusta coffee 1, robusta coffee 2, and rubber) was carried out by determining the diastase value using UV-Vis spectrophotometry and the bacterial inhibition zone using the diffusion disc. Multivariate analysis of brix content, diastase enzyme and antibacterial activity using Principal Component Analysis (PCA). The results showed that the highest diastase enzyme activity was 20.00 DN in mango, rambutan, and robusta coffee 2 honeys, while the lowest was 4.00 DN in calliandra honey. The highest antibacterial activity against S. aureus was 19.47 mm in robusta coffee 2 honey, against E. coli was 27.93 mm in randu honey, and against S. typhi was 18.53 mm in robusta coffee 2 honey. Minimum inhibitory concentration (MIC) values for the tested bacteria were 8 g/mL on acacia honey, eucalyptus, randu, robsuta coffee 1, and robsuta coffee 2. Clusterization analysis was based on brix content, diastase enzyme activity, and antibacterial activity, namely cluster 1 (calliandra); cluster 2 (acacia, eucalyptus, randu, robusta coffee 1); cluster 3 (mango, rambutan, robusta coffee 2); and cluster 4 (rubber).
Keyword: antibakteri, enzim diastase, madu Apis mellifera, antibacterial, diastase enzyme, Apis mellifera honey

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