Judul: Karakteristik Suara Song Murai Batu (Copsychus malabaricus) yang Dipelihara di Penangkaran.
Abstrak: Murai batu (Copsychus malabaricus) merupakan burung pesuara Indonesia yang memiliki suara song yang bermelodi dan lantang, memiliki variasi lagu suara yang tidak terputus-putus yang dilakukan dengan satu tarikan nafas. Penelitian ini bertujuan untuk menganalisis karakter suara song burung murai batu yang tidak terlatih dan yang terlatih. Penelitian dilakukan pada bulan April sampai Juni 2017 di 3 penangkaran di Bogor. Perekaman suara song murai batu dilakukan dengan menggunakan mikrofon Sennheiser ME66 dan alat perekam Sony PCM-D50. Parameter yang diukur adalah oschilogram, spectogram, tipe syllable, durasi, amplitudo, frekuensi, dan kekuatan yang dianalisis menggunakan software Raven Pro 1.4 dan dilanjutkan dengan uji T. Hasil analisis suara song burung murai batu menunjukan bahwa murai batu terlatih menghasilkan suara song yang cepat dan tidak jeda antar syllable sehingga terdengar seperti pengulangan suara song. Burung murai batu yang tidak terlatih menghasilkan suara song dengan jarak yang jelas antar syllable dengan amplitudo yang rendah.
Keyword: amplitudo, durasi, frekuensi, kekuatan, murai batu, suara song, syllable

Judul: Manajemen Penangkaran Murai Batu (Copsychus malabaricus) sebagai Penghasil Burung Siap Kontes di NSM BF Bogor
Abstrak: Murai batu (Copsychus malabaricus) merupakan kelompok burung the best song birds atau burung dengan suara kicauan paling bagus, sehingga termasuk burung yang paling diminati dalam kontes burung berkicau. Sementara itu, populasi murai batu terus menurun di alam akibat perburuan liar yang berlebihan. Tujuan penelitian ini adalah mengidentifikasi karakteristik suara murai batu, mengidentifikasi manjemen penangkaran murai batu sebagai burung siap kontes, dan mengidentifikasi manajemen kesehatan murai batu. Data manajemen murai batu siap kontes di NSM BF Bogor diperoleh dengan observasi lapang dan studi pustaka. Karakteristik suara murai batu dalam kontes terbagi menjadi 2, yaitu suara isian dan suara tembakan. Manajemen murai batu sebagai burung kontes terdiri dari manajemen jenis kontes, manjemen perawatan harian dan manajemen persiapan kontes. Manjemen kesehatan terdiri dari kegiatan pengenalan, pengobatan, dan upaya pencegahan terhadap penyakit.
Keyword: Kontes burung, kesehatan, karakteristik suara

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