Judul: Study on Histopathology of Duodenum and Pancreas broiler  chickens fed with Essential Oil enriched diet
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh pemberian essential oil kombinasi minyak kayu putih (Eucalyptus sp.), minyak lavender (Lavandula sp.), dan minyak pinus (Pinus sp.) sebagai imbuhan pakan terhadap organ pencernaan ayam broiler. Sebanyak delapan ekor ayam broiler berumur tiga puluh lima hari yang digunakan, empat ekor sebagai kontrol, dan empat ekor diberikan pakan yang telah diperkaya essential oil. Pemberian essential oil pada penelitian ini memberikan efek yang cukup baik pada organ pencernaan, duodenum pada kedua kelompok lapisan tunika mukosa dan lapisan submukosa dalam kondisi normal. Tidak terlihat adanya lesio, hanya terlihat adanya pelepasan vili usus yang sedang beregenerasi. Sementara pada organ pankreas kelompok yang diberikan essential oil, tidak tampak adanya perubahan para sel-sel asinar tetapi meningkatnya sel pada pulau langerhans yang berperan penting dalam pertumbuhan otot ayam broiler.
Keyword: broiler, duodenum, Essential oil, histopatologi, pankreas

Judul: Histopathological (HP) of small intestine and cecal tonsil in Broiler that was infection by Marek’s disease and the effect of dietary zinc, garlic, and curcumin
Abstrak: Penelitian ini bertujuan untuk memberikan informasi dasar tentang gambaran histopatologi usus broiler setelah penambahan zink, serbuk bawang putih dan kunyit dalam ransum basal dan terjadinya infeksi virus Marek secara alami. Ayam broiler strain Ross 1 Super Jumbo 747 berumur satu hari (DOC) yang berjumlah 100 ekor dibagi dalam lima kelompok. Kelompok pertama (R0) adalah ayam yang diberi pakan basal dan dijadikan sebagai kontrol. Kelompok kedua (R1) adalah ayam yang diberi pakan basal, serbuk bawang putih 2,5 % dan serbuk kunyit 1,5 %. Kelompok ketiga (R2) adalah ayam yang diberi pakan basal, serbuk bawang putih 2,5 % dan ZnO 120 ppm. Kelompok keempat (R3) adalah ayam diberi pakan basal, serbuk kunyit 1,5 % dan ZnO 120 ppm. Kelompok kelima (R4) adalah ayam yang diberi pakan basal, serbuk bawang putih 2,5 %, serbuk kunyit 1,5 % dan ZnO 120 ppm. Pada akhir penelitian ternak ayam broiler diambil satu ekor pada masing-masing unit percobaan secara acak untuk dinekropsi. Pengamatan dilakukan untuk melihat histopatologi usus halus dan sekal tonsil ayam broiler. Saat pemeliharaan ayam terinfeksi virus Marek. Secara histopatologi terjadi demielinasi pada saraf usus halus ayam, akumulasi sel tumor limfoid, proliferasi sel goblet, dan peningkatan folikel limfoid sekunder pada sekal tonsil., The research was aimed to inform the histopathological of small intestine and cecal tonsil in Broiler that were adapted garlic powder, curcumin powder and zinc into fed basis and infection by Marek disease. This research used 100 Broilers of Ross 1 strain and start from day old chick (DOC). They were divided into 5 groups. Group R0 was treated with fed basis (as control). Group R1 was treated with fed basis, garlic powder (2,5%), and curcumin powder (1,5%). Group R2 was treated with fed basis, garlic powder (2,5%), and ZnO was 120 ppm. Group R3 was treated with fed basis, curcumin powder (1,5%), and ZnO was 120 ppm. Group R4 was treated with fed basis, garlic powder (2,5%), curcumin powder (1,5%), and ZnO was 120 ppm. At the end of the maintenance period, four chickens from each pen of five treatment groups were necroption. The observe was conducted to histopathological of small intestine and cecal tonsil of chickens. When the maintenance, chickens were naturally infected by Marek’s disease. According to histopathological, there were demyelination of small intestine nerves, accumulation of lymphoid tumor cell, proliferation of Goblet cells and increase of limfoid cells in cecal tonsil.
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