Judul: Pengaruh seduhan daun teh(Camelia sinensis) terhadap peristaltik ileum dan khasiatnya sebagai antidiare
Abstrak: Dewasa ini pengobatan menggunakan obat tradisional semakin disukai oleh masyarakat Indonesia, baik yang tinggal di pedesaan maupun di kota, seiring dengan perkembangan pengobatan secara moderen. Pemerintah Indonesia telah menetapkan bahwa salah satu program pembangunan dibidang kesehatan adalah upaya pengadaan bahan baku obat atas usaha sendiri, dengan cara memanfaatkan kekayaan alam yang dimiliki. Bahan baku obat tersebut dapat berasal dari bahan sintesis maupun bahan alam seperti tumbuhan, hewan, mikroorganisme dan mineral. Bahan alam yang terdapat di Indonesia terutama bahan alam asal tumbuhan masih belum dimanfaatkan secara optimal. Pemakaian tumbuhan obat untuk menanggulangi penyakit mempunyai keuntungan seperti: mudah didapatkan, banyak tersedia di alam dan khasiatnya dipercaya terbukti dan telah digunakan sejak dahulu kala secara turun temurun. Sebagai salah satu contoh tumbuhan yang mempunyai khasiat dalam pengobatan secara tradisional adalah tumbuhan teh (Camelia sinensis). (Armita dan Syarif, 1995). Penelitian ini bertujuan untuk mengetahui seduhan daun teh (Camelia sinensi) sebagai antidiare dan pengaruhnya terhadap peristaltik ileum.
Keyword: Camelia sinensis, tea, anti-diarrhea

Judul: Effectiveness of Combined Leaf Decoction of Keji Beling (Strobilanthes crispa (L.) Blume) and Kentutan (Paederia foetida) Plants as Antidiarrheals in Mice
Abstrak: Diare masih menjadi masalah kesehatan utama di negara berkembang. Keanekaragaman hayati yang tinggi di Indonesia, menjadi peluang penggunaan herbal sebagai salah satu solusi pengobatan diare. Herbal memiliki banyak kandungan nutrisi, mineral, dan senyawa aktif yang memiliki efek antidiare seperti tumbuhan keji beling dan kentutan. Penelitian ini bertujuan mengetahui efek dan konsentrasi terbaik antidiare dari kombinasi dekok daun keji beling dan kentutan. Kelompok perlakuan terdiri dari kelompok kontrol negatif, kelompok kontrol positif (loperamid) dan kombinasi dekok (konsentrasi 100%, 50%, 25%, dan 12,5%). Metode yang digunakan adalah proteksi dan transit intestinal pada mencit. Induksi diare menggunakan oleum ricini. Hasil penelitian menunjukkan bahwa kombinasi dekok kedua tanaman dapat menurunkan motilitas usus, mempertahankan konsistensi feses, dan memiliki nilai rasio transit intestinal yang baik. Konsentrasi 50% memiliki hasil terbaik., Diarrhea is still a major health problem in developing countries. The high biodiversity in Indonesia is an opportunity for the use of herbal plants as a solution for treating diarrhea. Herbal plants contain many nutrients, minerals, and active compounds that have anti-diarrheal effects, such as keji beling and kentutan plant. This study aims to determine the effect and the best concentration of antidiarrheals from the combination of leaf decoction of keji beling and kentutan. The group consisted of a negative control group, a positive control group (loperamide), and decoction combination (100%, 50%, 25%, and 12,5% concentrations). The method used is intestinal protection and transit in mice. Diarrhea is induced using oleum ricini. The results showed that the combination of decoction of the two plants could reduce intestinal motility, maintain stool consistency, and have a good intestinal transit ratio. The decoct concentration of 50% has the best results.
Keyword: diarrhea, keji beling, kentutan, intestinal protection, intestinal transit

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