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: Physicochemical Properties and Antioxidant Activities Multiflora Honey from Kerinci Regency Jambi
Abstrak: Madu merupakan cairan kental yang dihasilkan oleh lebah madu (Apis sp.) dari nektar bunga atau bagian tanaman lainnya. Penelitian ini bertujuan menganalisis sifat fisikokimia dan aktivitas antioksidan madu multiflora (madu hutan Apis dorsata) dan (madu budidaya Apis cerana) dari Kabupaten Kerinci, Jambi. Sifat fisikokimia yang dianalisis adalah warna, pH, viskositas, kadar air, kadar abu, kadar gula, kadar HMF, keasaman, dan aktivitas antioksidan. Hasil penelitian menunjukkan bahwa madu hutan berwarna Light Amber, sedangkan madu budidaya berwarna Extra Light Amber. Kualitas madu hutan yang memenuhi SNI 01-3545-2013 adalah pH, viskositas, kadar air, kadar gula, kadar HMF, dan keasaman, namun memiliki kadar abu yang melebihi batas SNI 01- 3545-2013. Madu budidaya memiliki pH, kadar gula, dan kadar HMF yang memenuhi SNI 01-3545-2013, namun memiliki viskositas, kadar air, kadar abu, dan keasaman yang belum memenuhi SNI 01-3545-2013. Madu hutan dan madu budidaya memiliki kapasitas antioksidan masing-masing sebesar 16,74 mgVCE/g dan 16,60 mgVCE/g, sedangkan aktivitas antioksidannya berturut-turut adalah 63,80% dan 63,28%, Honey is a thick liquid produced by honey bees (Apis sp.) from flower nectar or other parts of plants. This study aims to examine the physicochemical properties and antioxidant activities of multifloral honey (Apis dorsata forest honey) and (Apis cerana cultivated honey) from Kerinci, Jambi. The analysed physicochemical properties were colour, pH, viscosity, water content, ash content, sugar content, HMF content, acidity and antioxidant activity. The results showed that forest honey has Light Amber colour while cultivated honey has Extra Light Amber colour. The quality of forest honey that meet SNI 01-3545-2013 is pH, viscosity, water content, ash content, sugar content, HMF content, and acidity, however the ash content exceeded SNI 01-3545-2013. Cultivated honey has pH, sugar content, and HMF content is which meet the SNI 01-3545-2013, however the viscosity, water content, ash content, and acidity was that didn't meet SNI 01- 3545-2013. Forest honey and cultivated honey have antioxidant capacities of 16,74 mgVCE/g and 16,60 mgVCE/g, meanwhile the antioxidant activity were 63,80% and 63,28%.
Keyword: antioxidant activities, cultivated honey, forest honey, multifloral honey, physicochemical properties

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