Judul: Kandungan curcin, komposisi kimia, retensi bahan kering, kalsium dan fosfor bungkil biji jarak pagar (Jatropha curcas) terdetoksifikasi
Abstrak: The rise of Jatropha curcas processing factor for biodiesel causes an increase in production of Jatropha curcas mela. Jatropha curcas meal has high protein content, 53-58% (Becket and Makkar, 1998) and it is potential to substitute soya bean meal that is commonly used polutry diets. Toxic substances present in Jatropha curcas meal such as curcin and phorbolester reduced its use as feed. Therefore, it is realized to detoxify toxin present in Jatropha curcas meal.
Keyword: 

Judul: Pengaruh Perlakuan Kimiawi dan Biologis terhadap Penyusutan Bahan, Kandungan Antitripsin, Lektin dan Nutrien Bungkil Biji Jarak Pagar (Jatropha curcas L.)
Abstrak: The Jatropha curcas meal is by product of Jatropha curcas oil production and contain high amount of nutrient (56-68% protein). The problem in using of Jatropha curcas meal as feed is its antinutritive content and toxic compounds such as lectin (curcin) and trypsin inhibitor. This experiment was conducted to evaluate the effectiveness of chemical and biological methods in decreasing or eliminating antinutrient content and to know the change of nutrient content due to processing of Jatropha curcas meal. This research consisted of four treatments : P0 (control, non treated meal), P1 (methanol 90% extraction, with the proportion of meal and methanol was 1:4), P2 (fermentation using Rhizopus oryzae) and P3 (fermentation using Trichoderma viride). The parameters observed were weight loss, trypsin inhibitor, lectin activity and nutrient content. The data were analyzed with descriptive analysis. The results showed that chemical and biological treatments decreased the weight with the values P1 (3.18%), P2 (14.44%) and P3 (3.7%). The results showed that fermentation using Rhizopus oryzae was the most effective in decreasing the activity of trypsin inhibitor (67.95%). However, this treatment decreased protein content (9.39%), increased crude fiber (35.73%) and it did not influence lectin activity. The fermentation using Trichoderma viride was the most effective in degrading lectin activity with the value of 50% compared to the untreated meal. The conclusion of this experiment is that fermentation Jatropha curcas meal using Rhizopus oryzae could decrease the trypsin inhibitor up to 67.95% and the fermentation Jatropha curcas meal using Trichederma viride could decrease lectin activity up to 50%.
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