Judul: Manajemen usaha toge goreng sebagai makanan khas Bogor, cakupan konsumen, dan prospek usahanya
Abstrak: Penelitian ini bertujuan untuk memperoleh gambaran manajemen usaha toge goreng sebagai makanan tradisional khas Bogor, cakupan konsumen, serta prospek usaha toge goreng. Penelitian dilakukan di Kotamadya Bogor pada Bulan Nopember 1995 sampai dengan Januari 1996. Pengambilan sampel dilakukan secara purposif. Data yang dikumpulkan terdiri dari data primer dan data sekunder. Data primer digali melalui wawancara dengan menggunakan kuisioner dan pengamatan langsung sedangkan data sekunder diperoleh dari Pemerintah Daerah Kotamadya Bogor. Data mengenai keadaan umum responden, manajemen usaha, dan cakupan konsumen dianalisis secara deskriptif. Prospek usaha penjualan toge goreng yang berkenaan dengan keuangan dan permodalan dianalisis dengan analisis finansial yaitu laju keuntungan, Break Event Point (BEP), Lama Pengembalian Modal, Net Present Value (NPV), dan Internal Rate of Return (IRR). Hasil penelitian menunjukkan bahwa semua pedagang responden berdomisili di Bogor dan merupakan penduduk asli Kota Bogor. Umur responden berkisar antara 39-55 tahun. Jumlah pengunjung dalam sehari berkisar antara 20-90 orang pada hari biasa dan 50-300 orang pada hari libur. Umumnya penjualan dilakukan mulai pukul 07.30 4-6 hari kerja.
Keyword: toge goreng

Judul: Prospek Pengembangan Usaha Itik Goreng Warung Tenda di Kota Bogor
Abstrak: Perubahan gaya hidup masyarakat kota dalam pola konsumsi memberi peluang munculnya rumah makan maupun warung makan di sekitar Kota Bogor. Salah satu jenis warung makan yang mempunyai banyak konsumen yaitu warung tenda. Menu yang ditawarkan pada warung tenda beragam, salah satunya yaitu itik goreng yang lebih dikenal dengan sebutan bebek goreng. Harga menu itik goreng relatif mahal sehingga konsumennya masih terbatas. Di sisi lain, pedagang warung tenda sering kesulitan mencari itik untuk dipotong, karena pasarnya relatif kurang kontinyu. Oleh karena itu perlu dikaji prospek pengembangan usaha itik goreng warung tenda, dilihat dari faktor-faktor lingkungan eksternal dan internal Kota Bogor untuk usaha itik goreng warung tenda dan faktor-faktor lain yang mempengaruhi pengembangan usaha itik goreng seperti permintaan, sumber -sumber penawaran akan daging itik, dan pendapatan usaha itik goreng.
Keyword: 

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