Judul: pH Analysis of Tapanuli Orangutan Diet
Abstrak: Tapanuli orangutans are the newest and most endangered great ape species that have been known. Meanwhile, the pH values of Tapanuli orangutan diet is not available. Therefore, the aim of this study is to analysis the pH values of Tapanuli orangutan diet. The study was conducted from February to April 2019 at Camp Mayang, Batang Toru Research Station, North Sumatera. Next, foraging activity data were collected using focal animal sampling method. The pH values of diet sample were measured by MColorpHastTM as universal indicator of pH. SPSS 16.0 software was used in data processing. Data analysis was done with Shapiro-Wilk for normality test, while Kruskal-Wallis and Mann-Whitney for significant diferences test. In this study, five Tapanuli orangutans, two adolescent female and three adult female, have been followed. Fruits are their dominant food types. Camnosperma auriculatum fruits are their dominant diet during the observation. There is no significant differences between adolescent and adult female Tapanuli orangutans in the numbers of diet items at each pH values. On one hand, Tapanuli orangutan diets have pH values range between 3-7. On the other hand, Bornean and Sumatran orangutans prefer to eat fruits with range of pH values between 4-5.
Keyword: diet, food types, foraging activity, pH values, Tapanuli orangutans

Judul: Daily Activities and Food Selection Bornean Orangutan (Pongo pygmaeus) at Taru Jurug Animal Park, Surakarta City
Abstrak: Orangutan Kalimantan atau Bornean Orangutan (Pongo pygmaeus) merupakan satwa endemik yang hanya dapat dijumpai di Pulau Kalimantan dan tergolong ke dalam ordo Primata serta famili Hominidae. Pada umumnya, aktivitas harian yang biasa dilakukan orangutan diantaranya ialah makan, bergerak, istirahat, dan sosial. Orangutan sebagai satwa yang termasuk frugivor cenderung memiliki preferensi pakan pada buah. Penelitian ini bertujuan menganalisis aktivitas harian, preferensi pakan, serta palatabilitas pakan yang dikonsumsi orangutan kalimantan di Taman Satwa Taru Jurug, Kota Surakarta. Subjek yang diamati ialah dua individu orangutan berjenis kelamin betina dan jantan. Metode yang digunakan ialah focal animal sampling, penyajian pakan berupa cafetaria, penimbangan bobot konsumsi pakan. Hasil pengamatan menunjukkan bahwa lokomosi dan istirahat menjadi aktivitas yang dominan dilakukan oleh individu tori (♀) dan didi (♂). Apel, pear, pisang dan tempe rebus menjadi preferensi pakan dari kedua individu tersebut dengan bobot konsumsi pakan yang tidak berbeda signifikan berdasarkan perhitungan uji t terhadap jenis kelamin dengan jumlah bobot konsumsi pakan., Bornean Orangutan (Pongo pygmaeus) is an endemic animal that can only be found on the island of Borneo and belongs to the order Primate and family Hominidae. Orangutans' daily activities generally include eating, moving, resting, and social activity. Orangutans, as frugivores, tend to have a preference for food on fruit. This study aims to analyze the daily activities, feed preferences, and palatability of the feed consumed by the Bornean orangutan at Taru Jurug Animal Park, Surakarta City. The subjects observed were two male and female orangutans. The method used was focal animal sampling, serving food in the form of a cafeteria, and weighing feed consumption. The results showed that locomotion and resting were the dominant activities carried out by tori (♀) and didi (♂). Apples, pears, bananas, and boiled tempeh became the feed preferences of the two individuals with feed consumption weights that were not significantly different based on the calculation of the t-test for sex with the total weight of feed consumption.
Keyword: endemic, focal animal sampling, palatability, preference, Taru Jurug Animal Park

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