Judul: Kecukupan dan perkembangan sediaan energi dan protein penduduk Kabupaten Daerah tingkat II Cirebon Propinsi Jawa Barat selama pelita III
Abstrak: Tujuan umum penelitian adalah untuk mengetahui perkembangan tingkat kecukupan sediaan pangan penduduk Kabupaten Cirebon per tahun selama PELITA III (1979-1983), sedangkan tujuan khusus adalah untuk mengetahui sediaan pangan pada tingkat produksi per tahun selama PELITA III, untuk mengetahui sediaan pangan pada tingkat eceran per orang per hari selama PELITA III, untuk mengetahui sediaan pangan yang dinyatakan dalam nilai energi dan protein per orang per hari selama PELITA III, dan untuk mengetahui tingkat kecukupan energi dan protein per orang per hari. Data sediaan pangan dihitung dari data sekunder dengan mengikuti metode penyusunan "Food Balance Sheet" (Neraca Bahan Makanan). Data tersebut diperoleh dari berbagai di- nas tingkat kabupaten, antara lain: Dinas Pertanian, Dinas Peternakan, Dinas Perikanan, Dinas Perkebunan, Dinas Perda- gangan, Kantor Sub Dolog, Kantor Sensus dan Statistik, dan Dinas Perindustrian. Data yang dikumpulkan meliputi data produksi pangan setempat, perubahan stok (stok akhir dikurangi awal tahun), data keluar dan masuk daerah, untuk pakan ternak, bibit, penggunaan untuk industri non makanan, penyusutan, dan tingkat ekstraksi. ...
Keyword: 

Judul: Analisis tingkat persediaan energi dan protein selama Pelita III dan IV serta perkiraannya selama Peita V di daerah Khusu Ibukota Jakarta
Abstrak: Tujuan penelitian ini adalah untuk mengetahui perkembangan persediaan serta kecukupan energi dan protein, mengetahui tingkat persediaan energi dan protein, dan mengetahui tingkat ketergantungan pangan selama Pelita III dan IV (1979 - 1988), serta memperkirakan kecukupan, persediaan, dan tingkat persediaan energi dan protein pada Pelita V. Penelitian ini dilakukan selama lima bulan, mengguna- kan data sekunder DKI Jakarta selama tahun 1979 1988. Data diperoleh dari Biro Pusat Statistik, Badan Pengem- bangan Ekspor Nasional, Badan Urusan Logistik, Direktorat Jenderal Perikanan, Direktorat Jenderal Peternakan, Direktorat Jenderal Tanaman Pangan Departemen Pertanian, Kantor Statistik DKI Jakarta, Dinas Pertanian Tanaman Pangan, Dinas Perikanan, Dinas Peternakan, Dinas Perkebunan, Dinas Perdagangan, Depot Logistik DKI Jakarta, Pasar Induk Beras Cipinang, Pasar Induk Sayur-Buah Kramat Jati, dan Rumah Pemotongan Hewan Cakung Jakarta.
Keyword: kecukupan energi

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