Judul: Kondisi Financial Distress pada Sektor Pertambangan Batubara yang terdaftar di BEI Periode 2011 sampai 2015.
Abstrak: Harga batubara yang mengalami penurunan selama periode 2011 sampai 2015 tidak dapat menutupi biaya operasional perusahaan. Biaya operasional yang cukup tinggi dan turunnya harga batubara membuat pendapatan perusahaan menurun sehingga profitabilitas perusahaan juga menurun. Kondisi profitabilitas menurun memunculkan indikasi terjadinya financial distress. Penelitian ini bertujuan untuk (1) untuk menganalisis tingkat kondisi financial distress yang terjadi di perusahaan sektor pertambangan batubara (2) menganalisis rasio – rasio keuangan yang dapat digunakan sebagai alat prediksi kondisi financial distress (3) menganalisis dampak financial distress pada profitabilitas perusahaan sektor pertambangan batubara. Metode penarikan sampel menggunakan purposive sampling dan diperoleh sampel sebanyak 10 perusahaan. Data diolah dengan analisis MDA, analisis regresi logistik dan analisis regresi linier dengan menggunakan SPSS 23. Dari hasil penelitian diperoleh kesimpulan bahwa terjadi kondisi financial distress pada beberapa perusahaan batubara, rasio DER memiliki pengaruh negatif terhadap financial distress, ROA berpengaruh positif secara signifikan terhadap financial distress, sedangkan rasio lancar dan modal kerja tidak memiliki pengaruh terhadap financial distress.
Keyword: financila distress, rasio keuangan, profitabilitas, z-score

Judul: Prediksi Tingkat Kondisi Financial Distress Pada Perusahaan Sektor Pertambangan Yang Tercatat di Bursa Efek Periode 2011- 2015.
Abstrak: Financial distress merupakan suatu tahap penurunan kondisi keuangan perusahaan yang terjadi sebelum timbulnya kebangkrutan. Penelitian ini bertujuan untuk menguji pengaruh rasio keuangan seperti : ROA, current ratio, quick ratio, dan current liabilities to total asset terhadap kondisi financial distress. Penelitian ini menggunakan data sekunder berupa laporan keuangan perusahaan sektor pertambangan yang dipublikasikan di BEI. Teknik analisis yang digunakan adalah discriminant analysis. Hasil dari penelitian ini menyatakan bahwa rasio ROA memiliki pengaruh yang signifikan untuk memprediksi kondisifinancial distress, rasio current liabilities to total asset memiliki pengaruh signifikan untuk memprediksi kondisifinancial distress, rasio current ratio dan quick ratio tidak memiliki pengaruh signifikan untuk memprediksi kondisifinancial distress.
Keyword: financial distress, rasio keuangan, disciminant analysis

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm