Judul: Gambaran Sel Darah Putih dan Indeks Stres Ayam Broiler yang Diberi sirup Temulawak Plus
Abstrak: Curcuma has xanthorrizol curcuminoids and volatile oils as its main contents that are beneficial as antioxidant, antiinflammatory, and antitumor. Twenty broiler chickens aged 21 days were divided into 4 groups of treatment, each group consisted of 5 chickens. Group I was the control group that was not given any curcuma extract, while group II, III, and IV were the group that was given curcuma syrup plus at the concentration of 1, 3, and 5 ppm syrup curcuma plus were given twice a day. Blood samplings were performed at week 1, 2, and 3. The blood was taken from venna axillaris to make blood smear. The blood smear were stained by using 10% Giemsa and to abserve leukocyte differentiation. The result showed that curcuma syrup effect the average value of leucocytes and lymphocytes amount, but there was a tendency of decrease in average amount of monocytes, eosinophils, and basophils in the third week. The curcuma syrup plus decreased index stress of chicken broiler
Keyword: index stress, lymphocytes, temulawak syrup plus, broiler chicken

Judul: Gambaran Sel Darah Merah Ayam Broiler yang Diberi SirupTemulawak (Curcuma xanthorrizha ROXB.) Plus
Abstrak: Curcuma is a herbal plant that contain xanthorrizol curcuminoid and volatile oil as its main active ingredient that are beneficial as antioxidant, antiinflammatory, and antitumor. The research was conducted to examine the influence of curcuma at various concentration levels1, 3, and 5 ppm on total red blood cells, hematocrit value and haemoglobin concentration of broiler chickens. Twenty day old chick were divided into 4 groups, each group consisted of 5 chickens. Group I was the control group that was not given any curcuma syrup, while group II, III, and IV were given curcuma syrup at the concentration of 1, 3, and 5 ppm for 21 days. Blood samplings were performed at week 1, 2, and 3. The control group had lower total red blood cells, haematocrit, and haemoglobin concentration than the other groups. It was concluded that curcuma plus (group III and IV) could increase total red blood cells of chickens and there was not significant effects in hematocrit value and haemoglobin concentrations
Keyword: broiler chiken, haemoglobin concentration, hematocrit, red blood cells, Curcuma syrup plus

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