Judul: Study of Fennel (Foeniculum vulgare Mill.) and Pink and Blue Ginger (Curcuma aeruginosa Roxb.) Ethanol Extracts as Medicinal Alternative against Avian Influenza.
Abstrak: Avian influenza or bird flu is becoming a global issue, especially in Indonesia. The cumulative number of bird flu in Indonesia until February 2009 was 141 people, which was 35,3% from the total of people in the world that infected by bird flu virus. Oseltamivir carboxylate (Tamiflu@), amantadin, and rimantadin had been pledged as drugs of choice for the bird flu. Unfortunately, those drugs becomes very expensive and difficult to find. Moreover, the latest researchs indicated of resistancy to these drugs. Traditional medicine has been used by Indonesian people for many years, but the scientific research concerning to this subject was limited. This study try to evaluate pink and blue ginger (Curcuma aeruginosa Roxb.) and fennel (Foeniculum vulgare Mill.) as alternative medicine against bird flu in in vitro methode. Extracts of Pink and Blue Ginger and fennel were divided into three kind of concentration, which are 10%,20%, and 30% (v/v). The result indicated that temu ireng had strong potency as alternative medicine against bird flu, and concentration 20% was the strongest from the others. Fennel also showed its potency as alternative medicine against bird flu, but less potential than temu ireng. The three kind concentration of adas did not indicate different potency as alternative medicine against bird flu.
Keyword: 

Judul: Kajian Potensi Ekstrak Tanaman Tanaman Obat Sambiloto (Andrographis paniculata Ness) dan Beluntas (Pluchea indica Less) Sebagai Alternatif Bahan Obat Flu Burung:
Abstrak: Avian Influenza (AI) atau flu burung merupakan penyakit yang menyita perhatian dunia beberapa tahun terakhir ini, khususnya Indonesia. Kasus flu burung pada manusia di Indonesia terus bertambah, bahkan menurut laporan World Health Organization (2009) jumlah kasus positif flu burung di Indonesia adalah yang tertinggi di dunia, yaitu 141 orang, dari jumlah total kasus positif flu burung di dunia 399 orang. Pemerintah Indonesia telah menetapkan bahwa obat untuk penderita flu burung adalah oseltamivir carboxylate (Tamiflu®), akan tetapi terdapat beberapa masalah dari obat ini yaitu, bahan bakunya berasal dari tanaman star anise (Illicium verum) harus diimpor seluruhnya dari Vietnam atau China, harganya mahal, dan terdapat kecenderungan resistensi terhadap oseltamivir. Oleh karena itu perlu secepatnya mencari alternatif sumber bahan baku obat flu burung yang diharapkan tidak saja dapat lebih efektif mengatasi penyakit ini tetapi juga lebih mudah diperoleh dan murah biayanya. Metode penelitian dibagi menjadi dua tahapan, yaitu persiapan ekstrak dan pengujian hambatan virus ke sel. Pembuatan ekstrak meliputi sortasi, pencucian, pengeringan, pengilingan dan ekstrasi. Ekstraksi dilakukan dengan pelarut alkohol 95%. Penentuan kadar komponen kimia dalam ekstrak dilakukan dengan menggunakan metode kromatografi gas-spektrometri massa (KG-SM). Tahap akhir dari penyiapan ekstrak adalah sterilisasi ekstrak menggunakan radiasi, kemudian masing-masing ekstrak sambiloto dan beluntas dibagi menjadi tiga macam konsentrasi, yaitu 10% (μL/ μL), 20%, 30%.
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