Judul: Antimicrobial activity of Kecombrang (Nicolaia speciosa Horan) flower extract againts some pathogenic and spoilage microorganisms.
Abstrak: Kecombrang merupakan tanaman rempah yang sudah lama digunakan masyarakat, terutama bagian bunganya sebagai rempah-rempah yang dapat memberi citarasa pada masakan, seperti urab, pecel, sambal dan berbagai masakan lain. Batang kecombrang juga telah digunakan sebagai pemberi citarasa pada masakan daging. Tujuan penelitian ini adalah untuk : mempelajari (1) aktivitas antibakteri dan menentukan nilai MIC (Minimum Inhibition Concentration) ekstrak bunga kecombrang terhadap beberapa bakteri patogen dan perusak pangan, (2) mekanisme dan kerusakan sel, (3) menentukan pengaruh pH, NaCl, pemanasan dan sistem pangan terhadap aktivitas antrimikroba, (4) aktivitas antibakteri fraksi bunga kecombrang terhadap bakteri patogen dan perusak pangan, (5) aktivitas antikapang dan nilai MIC (Minimun Inhibition Concentration) ekstrak bunga kecombrang dan mengamati mekanisme kerusakan sel kapang dan (6) menidentifikasi dan menguji aktivitas antibakteri dari komponen minyak atsiri bunga kecombrang.
Keyword: 

Judul: Aktivitas Antimikroba Kecombrang (Etlingera elatior) terhadap Mikroorganisme Pembusuk Pangan dan Patogen Bawaan Pangan: Tinjauan Pustaka
Abstrak: Indonesian cuisines have long employed kecombrang as spice, which is also commonly used as a traditional herb. The antimicrobial properties of kecombrang's extracts against food spoilage and foodborne pathogenic microorganisms have been the subject of numerous studies. The objective of this literature review was to study the potential of kecombrang as a source of antimicrobials against pathogens that cause foodborne illness and food spoilage microorganisms. A descriptive review was used to conduct this literature review. Flowers, shoots, fruits, leaves, rhizomes, and the entire plant are among the kecombrang parts that are extracted for antimicrobial testing utilizing solvent extraction, distillation, liquid CO2 extraction, and fractionation. Proteus vulgaris, Staphylococcus aureus, Escherichia coli, Klebsiella pneumoniae, Bacillus subtilis, Listeria monocytogenes, Bacillus cereus, and Cryptococcus neoformans are among the microorganisms that can be inhibited by kecombrang extract with similar activity to corresponding control. The essential oil from the kecombrang flower and rhizome exhibits strong antimicrobial activity (MIC <0.60 mg/mL) against a variety of Gram-positive and Gram-negative bacteria along with yeasts. Cryptococcus neoformans is the most susceptible towards flower essential oil, whereas Salmonella enteritidis is the most susceptible towards rhizome essential oil., Masakan Indonesia telah lama menggunakan kecombrang sebagai rempah, yang juga biasa digunakan sebagai ramuan tradisional. Sifat antimikroba ekstrak kecombrang terhadap mikroba pembusuk makanan dan patogen bawaan makanan telah menjadi subyek dari berbagai penelitian. Kajian pustaka ini bertujuan untuk mempelajari potensi kecombrang sebagai sumber antimikroba terhadap patogen penyebab penyakit bawaan makanan dan mikroorganisme pembusuk makanan. Tinjauan deskriptif digunakan untuk melakukan tinjauan literatur ini. Bunga, pucuk, buah, daun, rimpang, dan seluruh tanaman dari kecombrang telah diekstraksi dan telah diuji sebagai agen antimikroba dengan menggunakan ekstraksi pelarut, distilasi, ekstraksi CO2 cair, dan fraksinasi. Proteus vulgaris, Staphylococcus aureus, Escherichia coli, Bacillus subtilis, Listeria monocytogenes, Bacillus cereus, Klebsiella pneumoniae, dan Cryptococcus neoformans adalah mikroorganisme yang dapat dihambat oleh ekstrak kecombrang dengan aktivitas yang mirip dengan kontrol yang sesuai. Minyak atsiri dari bunga dan rimpang kecombrang menunjukkan aktivitas antimikroba yang kuat (MIC <0,60 mg/mL) terhadap berbagai bakteri Gram-positif dan Gram-negatif bersama dengan ragi. Cryptococcus neoformans paling rentan terhadap minyak atsiri bunga, sedangkan Salmonella enteritidis paling rentan terhadap minyak atsiri rimpang.
Keyword: Antimicrobial, foodborne pathogen, Food spoilage, kecombrang

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