Judul: Potensi Penyu Hijau (Chelonia mydas L.) sebagai Daya Tarik Ekowisata di Kawasan Pantai Sindangkerta Kabupaten Tasikmalaya
Abstrak: Sindangkerta beach is one of the spreading locations of green turtles (Chelonia mydas) in Indonesia. The existence of the green turtles can potentially become one of the ocean ecotourism objects. The purpose of the research is investigating the potential of green turtles (environment, habit, spreading of nest, and laying eggs period), knowing the interest of visitors to the green turtle and arranging the planning of development of ocean tourism program based on green turtles to the organizer of wildlife reserve and the organizer around it. The data collection includes of green turtles potential data, data of visitors, community around Sindangkerta Beach, and the supporting data (accessibility, accommodation, and supporting instruments). The collected data will be tabulated and analyzed descriptively to get the information about the development and potential of green turtles and the activities of the tourism that have been done. For the development of tourism plan will be done by SWOT analysis. The green turtles which get off on the beach every year will be different in amount and will fluctuate. It can be influence by the weather (speed of wind). The potential of green turtles which can become the activity of ocean tourism based on the interest of the visitors is seeing the habit of green turtles in finding food and laying eggs, the activity of maintenance, and releasing the small green turtles. Most of the visitors are students (including students of colleges). Development of the ocean tourism is also supported by the local community. Visitors and local community hope that the development of ocean tourism can preserve the green turtles and increase the economic level for the local community by involving them in managing the program. Ocean tourism based on green turtles program can be done such as introducing and informing the visitors about characteristic of environment and the habit of green turtles at Sindangkerta Beach. Increasing the corporation with all stakeholders is needed in order to preserve the green turtles and to make a continuity of ocean tourism object.
Keyword: 

Judul: Status Populasi Penyu Hijau (Chelonia mydas, Linnaeus 1758) di Taman Pesisir Pantai Penyu Pangumbahan, Kabupaten Sukabumi, Jawa Barat.
Abstrak: The populations of green turtles in Indonesia tend to decline in linearly over the time that affects the sustainability of green turtle. The turtles beach of Pangumbahan consist of productive area for green turtles landing and nesting habitat. Research to assess the status of sea turtle population from the past few years was carried out using data from management and from field survey on the coast of Pangumbahan beach in March until April 2014. The purpose of this research is to study green turtles population change and the production of eggs from 2007-2013, and to assess threat to green turtles (biophysical properties of habitat, number of tourist, villas and the number of building), and to recommends management strategy for green turtles conservation. Social data was taken using purposive sampling methods and length of green turtles was taken using curve carapace line method. The frequency of green turtle landing in 2009 to 2013 is dominated un nested. There is a declining trend of number of green turtles that nest in 2007-2013. This has an impact to production of eggs and hatchlings which showed a decline. A decrease in the frequency of green turtles that landed in the beach might be caused by variation of nesting activity, the number of eggs, and hatching success. Another threat to the population of nesting green turtles changes in turtles habitat at Pangumbahan beach, the level of lighting of the beach, the increasing number of buildings villa, and social condition.
Keyword: Bogor Agricultural University (IPB), status population green turtles, Pangumbahan, frequency egg laying green turtles, change habitats

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: