Judul: Effectiveness of Onion Peel (Allium cepa L.) Infusion as Antidiarrheals  in Mice (Mus musculus).
Abstrak: Penggunaan obat tradisional telah mengalami perkembangan dan pembaharuan secara intensif, salah satunya dalam penanganan diare. Hal ini tercermin dari sebagian besar komposisi bahan baku obat tradisonal antidiare terdiri dari ekstrak tanaman yang mengandung metabolit sekunder seperti flavonoid dan alkaloid. Kulit bawang bombay merupakan salah satu tanaman yang mengandung metabolit sekunder berpotensi sebagai antidiare. Penelitian ini bertujuan menetapkan efek antidiare infusa kulit bawang bombay, menetapkan konsentrasi infusa yang memberikan efek antidiare terbaik, serta melakukan penapisan metabolit sekunder dalam sediaan secara kualitatif menggunakan uji fitokimia. Efek antidiare diteliti pada 25 ekor mencit yang dikelompokkan menjadi 5 kelompok perlakuan yakni kelompok kontrol positif yang diberi suspensi loperamide HCl, kelompok kontrol negatif yang diberi tween-80 (1%), dan tiga kelompok perlakuan yang diberi infusa konsentrasi 25%, 50%, dan 100%. Pengujian efek antidiare dilakukan menggunakan metode proteksi intestinal. Hasil penelitian menunjukkan infusa kulit bawang bombay dapat memperbaiki konsistensi feses dan memperkecil durasi diare. Pada konsentrasi 50% konsistensi feces lebih baik dan dan durasi diare paling pendek dari konsentrasi lainnya. Hasil pemeriksaan fitokimia kulit bawang bombay mengidentifikasi adanya kandungan alkaloid, flavonoid, dan tanin. Dengan demikian sediaan infusa kulit bawang bombay memiliki aktivitas antidiare dan efek optimal sebagai antidiare terdapat pada konsentrasi 50%. Senyawa alkaloid, flavonoid, dan tanin diduga berperan penting dalam menimbulkan efek antidiare infusa kulit bawang bombay., The use of traditional medicine has experienced intensive development and renewal, one of which is in the handling of diarrhea. This is reflected in the fact that most of the raw material composition of antidiarrheal traditional medicine consists of plant extracts containing secondary metabolites such as flavonoids and alkaloids. Onion skin is one of the plants that contain secondary metabolites with potential as antidiarrheal. This study aims to determine the antidiarrheal effect of onion skin infusa, determine the concentration of infusa that gives the best antidiarrheal effect, and qualitatively screen secondary metabolites in the preparation using phytochemical tests. The antidiarrheal effect was studied on 25 mice grouped into 5 treatment groups, namely the positive control group given loperamide HCl suspension, the negative control group given tween-80 (1%), and three treatment groups given 25%, 50%, and 100% concentration infusions. Testing the antidiarrheal effect was carried out using the intestinal protection method. The results showed that onion skin infusion can improve stool consistency and reduce the duration of diarrhea. At 50% concentration, the consistency of feces was better and the duration of diarrhea was shorter than other concentrations. The results of the phytochemical examination of onion skin identified the presence of alkaloids, flavonoids, and tannins. Thus, onion skin infusa preparation has antidiarrheal activity and the optimal effect as antidiarrheal is found at 50% concentration. Alkaloid, flavonoid, and tannin compounds are thought to play an important role in causing the antidiarrheal effect of onion skin infusa.
Keyword: diarrhea, onion peel, antidiarrheal, phytochemical, intestinal protection

Judul: Effectiveness of Bombay Onion Infusion as Antidiarrheal in Mice (Mus musculus)
Abstrak: Bombay onion is a commonly consumed vegetable with known medicinal properties, is hypothesized to possess anti-diarrheal effects due to its rich phytochemical composition including flavonoids, phenolic compounds, and sulfur- containing compounds, has demonstrated various biological activities, such as anti- inflammatory, antioxidant, and antimicrobial effects. In this study, Bombay onion infusion was evaluated for its anti-diarrheal efficacy using intestinal protection method and determine the most effective concentration. Phytochemical analysis was carried out to identify the bioactive compounds present in plant materials. This research used 25 mice which divided into five groups: negative control, positive control and three treatment groups was given orally with concentration of 25%, 50% and 100%. The parameters used in the intestinal protection method were frequency of defecation, consistency of feces and duration of diarrhea. This study concluded that Bombay onion infusion contain secondary metabolites such as alkaloid, saponin and tannin and infusion with concentration of 25% showed the most effective result.
Keyword: antidiarrheal, Bombay onion, infusion, intestinal protection

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