Judul: Landscape Planning of Taman Margasatwa Ragunan Jakarta Based on Bioregion
Abstrak: Taman Margasatwa Ragunan (TMR) mempunyai fungsi sebagai tempat konservasi, edukasi, penelitian, dan rekreasi alam. Sejalan dengan upaya menyejahterakan satwa serta memberikan pengalaman di dunia satwa bagi pengunjung, TMR perlu menata kawasan konservasi satwa ex-situ dengan tema lanskap alami yang menyerupai habitat aslinya. Simulasi habitat yang alami dapat terbentuk dari penataan kawasan berbasis bioregion. Oleh karena itu, diperlukan suatu studi untuk mengetahui karakteristik habitat satwa yang mempengaruhi perencanaan lanskap tersebut. Tujuan dari penelitian ini adalah menyusun rencana lanskap TMR berbasis bioregion. Metode perencanaan lanskap dilakukan dengan survei, analisis deskriptif, dan analisis spasial. Tahap analisis yang dilakukan yaitu menganalisis konsep bioregion melalui analisis karakteristik bioklimat yang merupakan faktor signifikan penyusun bioregion, menganalisis karakteristik eksisting kawasan konservasi ex-situ TMR, dan menyusun rencana lanskap. Hasil penelitian berupa perencanaan lanskap kebun binatang yang berupaya menyediakan ruang untuk mendukung fungsi utama dari kebun binatang tersebut. Perencanaan lanskap TMR ini menghasilkan rencana ruang, rencana aktivitas dan fasilitas, rencana sirkulasi, dan rencana vegetasi., Taman Margasatwa Ragunan has been serviced as a conservation, education, research, and outdoor recreation functions. TMR arranges an ex-situ wildlife conservation area with a natural landscape resembles its natural habitat. This is in line to supports the welfare of its animal, and provide to visitors a total environtmental experience and an opportunity to rediscover the beauty and value of natural fauna and flora in urban oasis. In line with the efforts, TMR needs to organize ex-situ animal conservation areas with natural landscape themes that resemble their natural habitat. Natural habitat simulation can be formed from the arrangement of bioregion-based areas. Therefore, a study is needed to determine the characteristics of animal habitats that affect landscape planning. The purpose of this study is to develop a bioregion-based TMR landscape plan. This landscape planning method is based on a field survey, descriptive and spatial analysis. The results of research in the form of zoo landscape planning which seeks to provide space to support the main functions of the zoo. The TMR landscape planning then produces spatial plans, activity and facility plans, circulation path plans, and vegetation plans.
Keyword: bioregion, ex-situ conservation, habitat simulation, landscape planning, Taman Margasatwa Ragunan

Judul: Pengelolaan Lanskap Taman Margasatwa Ragunan Jakarta Selatan
Abstrak: Taman Margasatwa Ragunan (TMR) has been serviced as a conservation, education, research, and outdoor recreation functions. Meantime an evaluation related to the landscape management in TMR is needed to know either management is good and compatible or not. Therefore, the study to identify the aspects that affect the landscape management in TMR has been done by having internship activity. The data needed in this internship include the physical/biophysical aspects, management aspects, legal aspects, economic and social aspects of the TMR. Thus, it will produce a landscape management strategy for TMR. Analysis of data is performed by using the descriptive analysis, visitor comfort analysis, and SWOT analysis. The results of SWOT analysis found that there are nine point of strategies for landscape management of TMR. TMR has some shortcomings in its management. TMR needs more professional management with support from various parties. TMR is under the responsibility of the Dinas Kelautan dan Pertanian of DKI Jakarta, so that TMR needs more attention from the Government of DKI Jakarta
Keyword: 

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: