Judul: Kontribusi usaha ternak ayam buras terhadap pendapatan keluarga peternak di Desa Tamansari Kecamatan Tamansari Bogor
Abstrak: Almost of native chicken farmers in Bogor to be their farm as secondary income. The purpose of this research are, to know about the farmers and their farm characteristic, income from this farm, to analyze the worthiness of this native chicken farm, the farmers productivity, and the and also the contribution of this farm to the farmers household income. This research is a study case native chicken farm in Tamansari village, Bogor. The population of this research are native chickens farmers in Tanjung I dan Tanjung II group in Tamansari vilage, Bogor.
Keyword: 

Judul: Sumbangan ternak ayam buras terhadap pendapatan dan kecukupan gizi keluarga pedesaan : studi kasus di Desa Bangun Jaya, Kecamatan Cigudeg, Kabupaten Bogor, Propinsi Jawa Barat
Abstrak: Tujuan penelitian ini adalah untuk mengetahui sejauh mana potensi ternak ayam buras (Gallus Domesticcus) dalam menunjang kehidupan keluarga perdesaan, terutama sumbangannya terhadap pendapatan dan kecukupan energi dan protein keluarga, juga untuk mengetahui pengelolaan ayam buras oleh keluarga perdesaan. Penelitian ini dilakukan di desa Bangun Jaya kecamat- an Cigudeg kabupaten Bogor Propinsi Jawa Barat, mulai dari awal bulan September hingga akhir bulan Oktober 1994. Data yang dikumpulkan adalah data primer, yang diperoleh melalui wawancara langsung dengan responden dengan menggunakan kuesioner. Juga data sekunder yang diperoleh dari kantor desa Bangun Jaya, dan Dinas Peternakan Kab. Bogor. Data yang diperoleh dianalisa baik secara manual maupun menggunakan bantuan komputer. Pendapatan dihitung dalam rupiah per kapita per bulan. Sedang konsumsi pangan keluarga dihitung dalam gram per kapita per hari, kemudian dikonversikan ke dalam kkal energi dan gram protein. Ke- cukupan energi dan protein dihitung berdasarkan anjuran Komisi Ahli FAO/WHO/UNU (Khumaidi, 1994) serta contoh penerapannya dari (Hardinsyah & Martianto, 1989). Sumbangan ayam buras terhadap pendapatan, dihitung dengan membandingkan antara pendapatan yang berasal dari penjualan ayam buras dengan pendapatan total keluarga (keduanya dalam per kapita per bulan. Sedang sumbangan ayam buras terhadap kecukupan gizi, dihitung dengan membandingkan antara konsumsi energi dan protein asal ayam buras dengan kecukupan energi dan protein (dalam per kapita per hari).
Keyword: kecukupan gizi

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