Judul: Pengetahuan dan persepsi kader posyandu dan ibu balita pengguna posyandu tentang kurang energi protein KEP pada balita serta partisipasi dalam upaya penanggulangannya
Abstrak: Tujuan umum penelitian adalah mempelajari pengetahuan dan persepsi kader posyandu dan ibu balita pengguna posyandu tentang Kurang Energi Protein (ΚΕΡ) pada balita serta partisipasi dalam upaya penanggulangannya. Sedangkan Tujuan khusus penelitian adalah mempelajari (1). Profil sosial ekonomi kader posyandu dan ibu balita serta status gizi (KEP) balita, (2). Perbandingan pengetahuan dan persepsi antara kader posyandu dengan ibu balita tentang masalah KEP balita, (3). Partisipasi kader posyandu dan ibu balita dalam upaya penanggulangan KEP balita, (4). Hubungan antara pengetahuan dan persepsi tentang KEP balita pada kader posyandu dan ibu balita, dan (5). Hubungan antara faktor pendidikan, pendapatan keluarga, besar keluarga, pengetahuan dan persepsi tentang KEP balita pada kader posyandu dan ibu balita dengan partisipasi dalam upaya penanggulangan KEP balita.
Keyword: posyandu

Judul: Pengetahuan Gizi dan Persepsi Ibu Rumahtangga Kader dan Bukan Kader Posyandu tentang Kurang Energi Protein (KEP) Balita Serta Pertisipasi Penanggulangannya
Abstrak: Penelitian ini secara umum bertujuan untuk mempelajari pengetahuan gizi dan persepsi kader dan bukan kader posyandu tentang KEP balita serta partisipasi mereka dalam penanggulangan masalah tersebut. Tujuan khususnya adalah untuk (I) mengetahui pengetahuan gizi kader dan bukan kader posyandu tentang KEP balita (2) mengetahui persepsi kader dan bukan kader posyandu tentang KEP balita; (3) mengetahui partisipasi kader dan bukan kader posyandu dalam upaya penanggulangan KEP balita; (4) mengetahui hubungan pengetahuan gizi dengan persepsi contoh tentang KEP balita; (5) mengetahui hubungan persepsi, pendapatan per kapita, dan besar keluarga dengan partisipasi contoh dalam upaya penanggulangan KEP balita.
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