Judul: Analisis Strategi Bisnis Obat-Obatan Tradisional Studi Kasus di PT. Indofarma (Persero), Jakarta
Abstrak: PT. Indofarma (persero) adalah badan usaha milik negara yang bergerak di bidang farmasi. Perusahaan ini memproduksi obat-obatan modern dan peralatan kesehatan lainnya. Pada tahun 1996 PT. Indofarma (Persero) memproduksi obat-obatan tradisional dengan menggunakan teknologi modern.
Keyword: 

Judul: Development Strategy and Feasibility Study on the Pharmaceutical Industry in the face of local competition in PT Bouti Usabda Farma, Solo.
Abstrak: The pharmaceutical industry in Indonesia has undergone many developments, both in terms of management, the products or services. The pharmaceutical industry is a strategic industry, because it has helped bring about national defense purposes. Important factor which plays an important role in the pharmaceutical industry lies in the raw materials of drugs. Raw materials that exist during childbirth is just the usual drug products, but the times have been a lot of progress and a high need for medication. This encourages entrepreneurs engaged in the pharmaceutical industry has innovation and improvement in creating better drug product and delivered many entrepreneurs to engage in the pharmaceutical field, giving rise to competition today. Innovation arising by employers in the pharmaceutical field bore competition. It is also shared by one of the local small and medium industries (SMEs) in Solo, PT Bouti Usabda Farma who had undergone pharmaceutical business for 25 years so it has had plenty of experience and problems in running their business. This study aims to: (1) analyze the problems faced by Farma PT Bouti Usabda and solutions, (2) identify the factors that become barriers PT Bouti Usabda Farma in the face of competition, (3) find a way of developing strategy and business feasibility PT Bouti Usabda Farma. Collecting data in this study consisted of primary data obtained from observations in the form of qualitative and quantitative data using the method of direct interview with the owner of the company and questionnaires given to pharmacies who are the partners and their PT Bouti Usabda Farma its suppliers and employees of the company by using sampling methods. Secondary data were obtained from magazines, newspapers, journals and online media. In this study, the methods used are (1) a method Internal Factor Evaluation (IFE) and External Factor Evaluation (EFE) to identify the issues involved, both from within and outside the company PT Bouti Usabda Farma and solutions, (2) analysis of Strengths, Weaknesses, Opportunities and Threats (SWOT), Quantitative Strategic Planning Matrix (QSPM), payback period (PBP) and Break Event Point (BEP) to analyze financial data available for the development and feasibility of PT Bouti Usabda Farma. Based on internal and external data Farma PT Bouti Usabda, found that the main strength of the company is located in the capital that is strong enough and that becomes its weakness is the lack of power the Human Resource Department (HRD). Opportunities are held outstanding service to pharmacy suppliers and partners, as well as a threat to the company is the number of peers. Another thing PT Bouti Usabda Farma be in a position quadrant V hold and maintain, in a state where the company maintain and develop the business. Alternative strategies that can be used by the company is maximizing energy salesman who owned businesses or to expand the network of regional distributors and the feasibility of their business requires a period of four years to achieve payback.
Keyword: Bogor Agricultural University (IPB)

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