Judul: Analisa biaya dan harga pokok makanan ternak di PT. Hirema Industri Makanan Ternak Desa Cijujung Kecamatan Kedunghalang, Bogor (Suatu studi kasus)
Abstrak: Makanan ternak yang dihasilkan oleh industri makanan ternak saat ini merupakan makanan utama ternak unggas khususnya ayam ras. Usaha peternakan ayam ras yang berkembang saat ini adalah usaha pe ternakan kecil, dimana biaya makanan.ternaknya 50- 75 persen dari biaya produksi yang dikeluarkan karena peternak kecil tidak memproduksi sendiri makanan ternak.
Keyword: 

Judul: Analisis Struktur Biaya dan Pendapatan Usaha Peternakan Rakyat Ayam Ras Petelur di Kecamatan Cibinong Kabupaten Bogor
Abstrak: Sektor peternakan merupakan salah satu subsektor yang berperan dalam pemenuhan kebutuhan protein bagi masyarakat Indonesia. Tujuan dari penelitian ini adalah menganalisis struktur biaya, pendapatan, dan menganalisis titik impas usaha peternakan rakyat ayam ras petelur di Kecamatan Cibinong Kabupaten Bogor. Metode yang digunakan adalah dengan menghitung struktur biaya berdasarkan biaya yang diperhitungkan, struktur penerimaan, pendapatan atas biaya tunai, pendapatan atas biaya total, R/C, dan Break Event Point (BEP). Hasil dari penelitian ini adalah skala usaha dengan biaya yang paling efisien adalah skala III yaitu sebesar Rp 14 094/kg telur. Skala paling menguntungkan atas biaya tunai adalah pada skala I dengan R/C atas biaya tunai 1.39. Skala yang paling menguntungkan atas biaya total adalah skala III dengan R/C atas biaya total sebesar 1.31. Sedangkan berdasarkan penggunaan bibit, peternak yang menggunakan pullet lebih menguntungkan dengan nilai R/C tunai dan total sebesar 1.37 dan 1.25. Nilai titik impas terendah adalah pada skala I persentase sebesar 40.86 persen dari produksi aktual dan BEP penerimaan terkecil dengan persentase sebesar 38.56 persen dari penerimaan aktual. Berdasarkan penggunaan bibit, peternak yang menggunakan pullet sebagai bibitnya memiliki nilai titik impas terendah dengan persentase 43.05 persen dari produksi aktual dan BEP penerimaan dengan persentase 40.58 persen dari total penerimaan aktual.
Keyword: costs structure, farm business, income analysis, laying chicken, revenues

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