Judul: Analisis Pengembangan Usaha Pabrik Tahu Bandung Di Desa Bojong Rangkas Kecamatan Ciampea Kabupaten Bogor
Abstrak: Pabrik tahu Bandung merupakan usaha kecil menengah. Penelitian ini bertujuan untuk (1) Menganalisis tingkat kelayakan usaha pabrik tahu Bandung apabila dilihat dari berbagai aspek non finansial dan (2) Menganalisis tingkat kelayakan usaha pabrik tahu Bandung apabila dilihat dari aspek finansialnya. Data yang diperoleh yaitu data primer dari hasil wawancara pemilik pabrik dan data sekunder didapat dari literatur-literatur terkait, informasi dari dinas-dinas terkait, jurnal, internet, serta dari penelitian terdahulu. Berdasarkan aspek non finansial usaha pabrik tahu Bandung dikatakan layak secara pasar, layak secara teknis dan teknologi, layak secara aspek manajemen, serta layak secara sosial ekonomi. Dari analisis finansialnya, usaha pabrik tahu Bandung yang telah ditentukan umur proyeknya yaitu selama 10 tahun menghasilkan NPV sebesar Rp. 940.026.679,-, IRR 22%, Net B/C atau PI adalah 3,57 dan PBP 2,09 tahun. Nilai tersebut menunjukkan bahwa usaha tahu Bandung layak untuk dijalankan, baik secara aspek finansial maupun aspek non finansial. Perhitungan analisis sensitivitas pada usaha tahu Bandung ini menunjukkan kenaikan harga kedelai lebih sensitif dibandingkan dengan penurunan jumlah produksi.
Keyword: studi kelayakan pengembangan usaha, tahu

Judul: Analisis Kelayakan Usaha Tahu Bandung Kayun-Yun Desa Cihideung Ilir Kecamatan Ciampea Kabupaten Bogor
Abstrak: Usaha Tahu Bandung Kayun-Yun is one of the small soybean industries that uses soybean as the main material. Soybean price increased that occured in 2013 involved the business interruption. The purpose of this research was to analyze feasibility of financial and non financial aspects. Data analysis methods used are qualitative and quantitative. Qualitative data used to analyze non financial aspects (market, technical, management and legal, social and economic, and enviromental aspects). While, quantitative data used to analyze financial aspects through four investment criteria, that is NPV, IRR, Net B/C and payback period. The value of NPV obtained at Rp 293 316 530, Net B/C obtained at 3.07, IRR obtained at 39 persen, and payback period obtained five year seven months seventeen days. The results is both of the financial and non financial aspects showed that Usaha Tahu Bandung Kayun-Yun is feasible to run, except the management aspects because the bussiness does not have financial record keeping and environmental aspects because waste water allowed to flow directly into the river so that in long impact can cause environmental pollution. Sensitivity analysis showed that soybean price increased is more sensitive variable than the decrease in number of production of tofu.
Keyword: feasibility study, Usaha Tahu Bandung Kayun-Yun, Sensitivity analysis

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