Judul: Pengaruh Program Pemberian Tablet Tambah Darah (TTD) Terhadap Perbaikan Status Besi pada Remaja Putri di Kota Bogor
Abstrak: Anemia merupakan masalah gizi mikro yang banyak terjadi di seluruh dunia terutama di negara berkembang yang diperkirakan terjadi pada 30% populasi penduduk dunia. Sebesar 29% Wanita Usia Subur (WUS) yang tidak hamil mengalami anemia serta 38% wanita hamil usia 15-49 tahun mengalami anemia (WHO 2011). Anemia pada remaja putri sampai saat ini masih cukup tinggi. Data Kemenkes (2013) menunjukkan prevalensi anemia gizi pada kelompok usia remaja (≥15 tahun) adalah 22.2%, meningkat dari data Kemenkes tahun 2007 yakni 19.7% terkait kejadian anemia pada usia remaja (Kemenkes RI 2007; Kemenkes RI 2013). ...
Keyword: anemia, efektivitas, remaja putri, suplementasi besi

Judul: Pola Konsumsi Pangan Sumber Zat Besi Pada Remaja Putri Peserta Program Pemberian Tablet Tambah Darah Di Kota Bogor.
Abstrak: Tujuan penelitian ini adalah mengkaji pola konsumsi pangan sumber zat besi dan bioavailabilitas zat besi pada remaja putri peserta pemberian tablet tambah darah di Kota Bogor. Desain penelitian yang digunakan adalah cross sectional study dengan subjek penelitian berjumlah 3798 orang yang berada di 19 SMP dan 20 SMA. Pangan sumber zat besi yang sering sering dikonsumsi adalah daging ayam dan telur ayam. Asupan zat besi 7.5 mg dengan tingkat kecukupan gizi 30.3%. Bioavailabilitas zat besi subjek tergolong rendah. Tidak terdapat hubungan antara pekerjaan orangtua, tingkat pendidikan orangtua, besar pendapatan orangtua dan jumlah uang saku dengan tingkat kecukupan zat besi (p>0.05).
Keyword: anemia, bioavailabilitas zat besi, konsumsi pangan, tablet tambah parah

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