Judul: Studi potensi rekreasi di Kawasan obyek wisata Tirta Waduk Cacaban Dati II Tegal
Abstrak: Waduk Cacaban merupakan kawasan sumberdaya alam yang dilindungi, karena merupakan sumber air untuk pengembangan ekonomi di daerah Kabupaten Tegal. Disamping sebagai sumber air, Waduk Cacaban juga mempunyai potensi yang sangat besar untuk dikembangkan sebagai obyek wisata dikarenakan keindahan alam yang dikandungnya. Tujuan penelitian ini adalah untuk mengetahui Potensi Kawasan Obyek Wisata Tirta Waduk Cacaban dan Kemungkinan untuk mengembangkannya. Metoda yang digunakan adalah dengan mengamati langsung keadaan fisik lapangan, komunikasi dan studi literatur. Data yang diperoleh dinilai berdasarkan Pedoman Ukuran Baku Penilaian dan Pengembangan Obyek Wisata Alam (Anonimous, 1983), yang meliputi unsur-unsur Daya Tarik, Potensi Pasar, Kadar Hubungan, Kondisi Lingkungan, Pengelolaan, Perawatan dan Pelayanan, Kondisi Iklim, Akomodasi, Prasarana dan Sarana Penunjang, Ketersediaan Air Bersih, dan Hubungan Dengan Obyek Wisata Lain. ...
Keyword: 

Judul: Perencanaan Lanskap Tirta Waduk Cacaban Sebagai Kawasan Ekowisata di Kabupaten Tegal
Abstrak: Tegal Regency is one of Central Java regencies which is located in a very strategic position. It is located on the main road of transportation from Jakarta and West Java to Central Java via northbound lane. Its topographical diversity becomes a specific property and allows the people to practice a wide range of agricultural commodities. Tirta Waduk Cacaban area is one of tourism potency that can be developed in addition to agricultural sector in Tegal Regency. Until now, the principal purpose of Tirta Waduk Cacaban is a water reservoir that become the major irrigation source facility for agricultural activities in Tegal Regency. This research is purposed to arrange a landscape planning of Tirta Waduk Cacaban as an ecotourism area with local wisdom adaptation. The method used for this study based on the planning process by Gold (1980) which includes preparation, inventory, analysis, synthesis and planning with several adjustments. The main aspects that are identified and analysed includes the natural, tourism, and human resources. The product of this research presented as a landcape plan that includes space, tourism activities, facility, circulation, and vegetation development plans. The spatial plan consists of three main spaces include conservation, non-intensive utilization, and intensive utilization spaces. The conservation space is for less intensive use which includes water and soil conservation areas. The non-intensive utilization space is allocated as buffer areas that accommodate natural tourism activities. The intensive utilization space allocated for intensive use which includes tourism, entrance and service, and cultivation areas. The circulation plan consist of land and water tourism ways which includes linear and loop lane systems. The vegetation plan consist of several functional used which includes conservation, aesthetics, directional, shade-provider, and cultivation functions. The carrying capacity plan is considered to preserve the ecological value of the site and anticipating of tourist accumulation which can cause tourism pleasure decrement
Keyword: 

Judul: Algorithm construction of HLI hash function
Abstrak: Cryptography is a study of mathematical techniques related to aspects of information security regarding on confidentiality, data integrity, entity authentication, and data origin authentication. Data integrity is a service, which is associated with the conversion of data carried out by unauthorized parties. To maintain data integrity, one can use hash functions. An hash function is a computationally efficient function to map an arbitrary length bitstring to a fixed length bitstring called as hash value. The use of hash function in maintaining the information integrity and authentication is in digital signatures, virus protection, and software distribution. Illustration of the hash function in the integrity and authentication of information that is emailed as follow. The sender sends the information and hash value to the recipient. If the hash value of the information is equal to the hash value that is sent by the sender, then information has not been changed. Otherwise the information has been changed. An hash function has two properties, one way and collision resistance. An hash function is called one way if it is computationally infeasible to find any input such that when given any hash value . Meanwhile an hash function is called collision resistant if it is computationally infeasible to find any two inputs where such that . The purpose of this study is to construct a HLI hash function algorithm, to analyze the speed and security of the hash functions as a results of construction. Furthermore, it is to compare it with SWIFFT. Hash function is constructed based on the result of algebraic operations on modular polynomial ringwith . Modular polynomial ring noted as is a set of all polynomials of degree at most with coefficients in . can be represented as a set of integer vector of modulo in dimension . So, it is simple to implement in a computer. In vector operations, is lattice . Furthermore, alattice that is defined from certain polynomial ring is called ideal lattice. HLI hash function is consists of addition and multiplication algorithm in the ring. Addition algorithm consists of sumation operations of modulo and multiplication consists of multiplication operations of modulo . Generally, algorithm of HLI hash function consists of multiplication operations of modulo and addition operations of modulo . However, if the input is binary number then multiplication algorithm only consists of multiplication operation of modulo , so algorithm of HLI hash function consists of multiplication operations of modulo and addtion operations of modulo . An hash function is secured if it has two properties, i.e., one way and collision resistance. HLI hash function hash is one way, it is following the proof of Micciancio. It is has collision resistant because of polynomial is irreducible over and monic. Moreover, it is proved that for every unit vector , the vector is small vector. If the input of hash function is a binary number then HLI hash function only involves addition operations of modulo . So the time that used almost same with SWIFFT. The excellence of HLI hash function is the key size smaller than SWIFFT. This effect on
Keyword: hash function, modular polynomial ring, lattice