Judul: Mechanism of virulence inhibition of enterophatogenic bacteria by ginger (Zingiber officinale Roscoe) rhizome extract
Abstrak: Jahe segar merupakan bahan pemberi citarasa, yang biasanya ditambahkan dalam bahan pangan. Jahe berhngsi sebagai pengawet yang tidak toksik, dapat menstimulir, menghambat atau membunuh mikroba tergantung pada dosis yang digunakan. Senyawa utama pada jahe adalah senyawa minyak atsiri dan non volatil, yang mempunyai aktivitas antimikroba dan digunakan sebagai obat tradisional
Keyword: 

Judul: Aktivitas antimikroba ekstrak jahe (Zingiber officinale Roscoe) terhadap beberapa bakteri patogen
Abstrak: hazards to the human health. Ginger (Zingiber officinale Roscoe) is commonly used as traditional medicine. It has a potential as antimicrobial agent by inhibit or kill microbes in dose dependent manner. The principle compounds of ginger are essential oils and non volatile compounds which maximum have antimicrobial activity. The objectives of this research are: (1) to study the yield of ginger extracts by multistage maceration with different polarity solvents, (2) to study antimicrobial activity of hexane, ethyl acetate and ethanol extract of ginger against foodborne pathogen such as Staphylococcus aureus, Bacillus cereus and Salmonella enterica serovar Typhimurium. Ginger extracts were prepared by multistage maceration method using solvent hexane, ethyl acetate and ethanol. The ginger extracts were assayed for antimicrobial activity by agar well diffusion method with Diameter Inhibition Zone (DIZ) and dillution broth method. The yield of hexane, ethyl acetate and ethanol ginger extracts from multistage maceration were respectively 3,57; 3,17; 3,02 g/100 g dry ginger. The DIZ value for Staphylococcus aureus were 5,0; 5,7; 1,3 mm with hexane, ethyl acetate and ethanol ginger extracts respectively 6,1; 6,6; 6,0 mm for Bacillus cereus and Salmonella Typhimurium were show no inhibitory zone. This results showed that the ginger extracts from multistage maceration have a weak antimicrobial activity (1,3 – 6,6 mm) against Gram-positive bacterial. The inhibition activity was determined for ethyl acetate ginger extract that showed the relatively highest inhibition zone. The minimum inhibition concentration did not reach in a range concentration between 5 – 20 mg/ml against Staphylococcus aureus and Bacillus cereus, therefore ginger extracts from multistage maceration with rotavapor temperature 50 o C and freeze dry process were not efficient to developed as natural antimicrobial.
Keyword: 

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