Judul: Studi imunohistokimia perkembangan aksis sel-sel hormon adrenokortikotropik/ACTH - kelenjar adrenal monyet ekor panjang (Macaca fascicularis) pada masa pre dan postnatal
Abstrak: Penelitian ini bertujuan untuk mempelajari perkembangan aksis sel-sel ACTH - kelenjar adrenal selama periode pre dan postnatal pada monyet ekor panjang (Macaca fascicularis). Sampel yang digunakan pada penelitian ini adalah 5 fetus umur 70,85, 100, 120 dan 150 hari serta 2 anak umur 10 dan 105 hari. Metode penelitian menggunakan pewarnaan imunohistokimia untuk hipofise dan pewarnaan Hematoksilin-Eosin untuk adrenal. Hasil penelitian menunjukan bahwa hipofise fetus M. fascicularis selama perkembangannya mengalami peningkatan densitas sel-sel imunoreaktif ACTH (ir-ACTH) dan perubahan pola distribusi.
Keyword: 

Judul: Perkembangan Kelenjar Adrenal Monyet Ekor Panjang (Macaca fascicularis) pada Masa Pra- dan Pascalahir
Abstrak: Penelitian ini bertujuan mempelajari dinamika perkembangan sel-sel pembentuk serta lapisan-lapisan pada korteks dan medula adrenal monyet ekor panjang (Macaca fascicularis), pada masa pra dan pascalahir. Sampel kelenjar adrenal monyet yang digunakan dalam penelitian ini berasal dari 5 fetus umur 70, 85, 100, 120, dan 150 hari serta 2 anak umur 10 dan 105 hari. Sediaan histologis kelenjar adrenal diwarnai dengan pewarnaan standar hematoksilineosin dan Masson trichrome (Modifikasi Goldner). Hasil penelitian memperlihatkan struktur korteks kelenjar adrenal pada masa pralahir terdiri atas zona definitif dan zona fetus, dan pada akhir kebuntingan (fetus umur 150 hari) terbentuk zona transisional di antara kedua zona tersebut. Setelah kelahiran, sel-sel zona definitif mengalami diferensiasi menjadi sel-sel zona glomerulosa, sedangkan sel-sel zona transisional bagian perifer berdiferensiasi menjadi sel-sel zona fasikulata yang tersusun radial. Hasil penelitian menunjukkan bahwa zona fetus masih ada pada M. fascicularis sampai lahir dan perlahan menghilang setelah kelahiran. Sel-sel penyusun medula adrenal sudah dapat diidentifikasi pada kelenjar adrenal fetus umur 70 hari, yang masih tersusun secara iregular berapa struktur pulau-pulau sel chromaffin di zona fetus. Struktur tersebut perlahan- lahan bermigrasi ke pusat kelenjar. Berdasarkan karakteristik sel-sel chromaffin pada kelenjar adrenal M. fascicularis pascalahir yang berinti lebih besar dan sitoplasma mengecil, diduga aktivitas sel-sel chromaffin mulai berfungsi pada masa setelah kelahiran…
Keyword: Adrenal, M. fascicularis, Development, Masson trichrome

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