Judul: Evaluasi ruang terbuka hijau kota depok sebagai kawasan konservasi air menggunakan data satelit multi temporal
Abstrak: Penelitian ini berawal dari permasalahan semakin menurunnya kualitas resapan air di kawasan kota Depok, akibat pertumbuhan kota secara fisik cepat dan tidak terkendali yang mempengaruhi keersediaan air bersih dan sistem drainase alami bagi daerah di sekitarnya. Fenomena ini memberikan kondisi yang merugikan bagi pemanfaatan ruang terbuka perkotaan berupa penurunan kualitas dan kuantitas ruang terbuka hijau (RTH) kota. Tujuan penelitian ada tiga yaitu untuk menganalisis secara spasial penurunan RTH kota Depok menggunakan data satelit Landsat multi temporal, menganalisis RTH kota Depok melalui pendekatan model konservasi air dan memberikan arahan revegetasi yang menunjang Kota Depok sebagai kawasan konservasi air.
Keyword: 

Judul: Evaluation of the Program Pengembangan Kota Hijau in Depok City
Abstrak: Pesatnya laju urbanisasi dan pertumbuhan kota berdampak pada berkurangnya ketersediaan ruang terbuka hijau (RTH). Hal ini juga terjadi pada Kota Depok sebagai penyangga ibu kota. Dalam upaya memenuhi amanat 30% RTH di perkotaan, Kementerian Pekerjaan Umum dan Perumahan Rakyat (PUPR) bersama pemerintah daerah menginisiasi sebuah program yang disebut dengan Program Pengembangan Kota Hijau (P2KH). Penelitian ini bertujuan untuk mengevaluasi apakah pelaksanaan P2KH di Kota Depok memberikan dampak positif terhadap peningkatan RTH. Peningkatan RTH tersebut akan dilihat menggunakan metode remote sensing. Selain terpenuhinya amanat 30% RTH, P2KH juga membangun taman percontohan dengan penerapan atribut kota hijau. Untuk itu penelitian ini juga akan mengamati apakah taman P2KH tersebut masih terjaga dengan baik dan membandingkan penerapan atribut kota hijaunya dengan taman non P2KH. Hasilnya menunjukkan penurunan kawasan terbuka hijau Kota Depok pada tahun 2003-2013 sebanyak 22.73%, kemudian melandai dari tahun 2013-2023 dengan penurunan 2,99%. Meskipun adanya pelandaian, kawasan terbuka hijau yang tersedia diakhir tahun 2023 masih tidak mencapai 30%. Di sisi lain, hasil evaluasi atribut kota hijau pada taman P2KH mendapatkan nilai 71,61%. Dibandingkan dengan taman non P2KH yang mendapatkan 64,58%, perbedaan terbesar terdapat pada atribut green water, The rapid urbanization and city growth has reduced the availability of green open space (GOS). This case also occurs in Depok City as a buffer for the capital city. In order to fulfill the mandate of 30% GOS in urban areas, the Ministry of Public Works and Public Housing and local governments initiated a program called the Program Pengembangan Kota Hijau (P2KH). This study aims to evaluate the implementation of P2KH in Depok City has a positive impact on increasing GOS. The increase in green space will be seen using the remote sensing method. In addition to the fulfillment of the 30% RTH mandate, P2KH also builds pilot parks with the application of green city attributes. For this reason, this research will also observe whether the P2KH parks are still well maintained and compare the application of green city attributes with non-P2KH parks. The results show that the green open area of Depok City in 2003-2013 was 22.73%, then sloped from 2013-2023 with a decrease of 2.99%. Despite the slope, the availability of green open area at the end of 2023 still does not meet the 30%. On the other hand, the evaluation results of green city attributes in P2KH park received a score of 71.61%. Compared to non P2KH parks that get 64.58%, the biggest difference is in the green water.
Keyword: penginderaan jauh, P2kh, ruang terbuka hijau, kota hijau

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