Judul: Evaluasi Sistem Rekrutmen Karyawan Di Departemen Human Capital PT Wijaya Karya (Persero), Tbk
Abstrak: According to database AKI (Asosiasi Kontraktor Indonesia), until the period of October 2013 no less than 129 companies active official contractor. To be a great company to be supported by the availability of human resources with the capabilities and higher performance so as to provide added value for the company. A large number of candidates will be recruited, it takes a good recruitment system for the company to get quality employees, reliable and in accordance with the company's expectations. This study aims to 1) identify the evaluation indicator system of recruitment of employees who applied PT Wijaya Karya, 2) identify employee recruitment system assessment of PT Wijaya Karya, 3) identify problems during the employee recruitment process takes place, and 4) establish recommendations for the company based on the problems that occur in employee recruitment system. Data processing methods used in this study was Crosstab with the help of IBM software SPSS STATISTICS verse 20.00. The results showed respondents rate employee recruitment system is good company. Respondents' assessment is supported by the data evaluation indicator system of recruitment of employees of the company in 2010-2012 that employee turnover rate is still within the normal range is 10 %, the cost of recruitment every year tend to be at around Rp 3 billion, the time required during the recruitment process that is the same every year 7-8 months, and assessment of newly hired employees in accordance with company expectations
Keyword: system, recruitment, employees, evaluation

Judul: Analisis hubungan sistem penilaian kinerja dengan motivasi kerja dan kepuasan kerja karyawan pada divisi human resources & general affairs (HR & GA) PT Indocement Tunggal Prakarsa (ITP), Tbk Citeureup
Abstrak: Penelitian ini bertujuan (1) mengetahui sistem penilaian kinerja yang diterapkan PT ITP, Tbk, (2) menganalisis hubungan sistem penilaian kinerja dengan motivasi kerja dan kepuasan kerja karyawan Divisi HR & GA PT ITP, Tbk, dan (3) merumuskan implikasi manajerial untuk meningkatkan motivasi dan kepuasan kerja karyawan. Metode pengambilan sampel yang digunakan proporsional random sampling dengan 97 responden karyawan Divisi HR & GA PT ITP, Tbk Citeureup. Analisis menggunakan analisis deskriptif dengan software Microsoft Excell 2007 dan analisis Rank Spearman dengan SPSS 15.0 for Windows. Hasil penelitian yang diperoleh yaitu persepsi karyawan terhadap sistem penilaian kinerja karyawan PT ITP, Tbk adalah baik. Uji korelasi Rank Spearman menunjukkan bahwa terdapat hubungan yang positif, agak lemah, dan nyata antara sistem penilaian kinerja dengan motivasi kerja dan kepuasan kerja karyawan. Hal ini berarti indikator sistem penilaian kinerja yang terdiri dari tujuan penilaian kinerja, waktu penilaian kinerja, prosedur penilaian kinerja, metode penilaian kinerja, efektivitas penilaian kinerja, dan implementasi penilaian kinerja mampu meningkatkan motivasi kerja dan kepuasan kerja karyawan Divisi HR & GA PT ITP, Tbk Citeureup.
Keyword: 

Judul: The Exploration of Discrete Logarithm over Finite Field GF(3m)
Abstrak: The security of many public~key algorithms is based on the problem of finding discrete logarithms. The generalized discrete logarithm problem is the following: given a finite cyclic group G of order n, a generator a of G, and an element fl E G, find the integer x, 0 ~ x ~ n - 1, such that 0: = fl. Algorithm for discrete logarithm problem focused on Menezes et al. (1997) that consist of exhaustive search algorithm, the baby-step giant-step algorithm, Pollard's rho algorithm, Pohlig-Hellman algorithm, and index-calculus algorithm. These algorithms are explorated to be used in discrete logarithm problem over finite field GF(3m ). The exploration also produces some algorithms, i.e. naif negative algorithm, baby-step mother-step algorithm, baby-step mother free-step algorithm, and baby-step free-step algorithm. All algorithms implemented using Maple 11. The Pohlig-Hellman and baby-step giant-step algorithms are efficient enough to be used in discrete logarithm problem over finite field GF(3m ) for m < 20.
Keyword: