cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kab. banyumas,
Jawa tengah
INDONESIA
BIOMATH
ISSN : -     EISSN : -     DOI : -
Core Subject : Education,
Arjuna Subject : -
Articles 13 Documents
PEMECAHAN MASALAH KECEMASAN BELAJAR MENGGUNAKAN SISTEM PAKAR Mustafidah, Hindayati
BIOMATH Vol 8, No 1 (2007)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

The research aims to develop an expert system for identifying studyapprehensive problems and advising students to cope with the problems. There are three stages in the development of the expert system. The first stage is acquiring knowledge. The second stage is representing knowledge and building an expert system shell.The knowledge of the expert system is adopted from the books of educational psicology and education experts. The knowledge is represented in the production rule form. The expert system shell is written in the C programming language with backward chainning inference. This system has nine menus : load, sum of rule, consultation, edit, update knowledge, list rule, print rule, help information, and exit. This system can diagnose the causes of study apprehensive problems and advises students to cope with the problems based on a degree ofbelief.For students who get many apprehensive problems in their study, thissystem can help them as an academic advisor. For anyone interested in Expert Systems, this expert system shell can be used as a reference on implementing expert system with conventional programming language especially.Keywords : expert system, study apprehensive, knowledge, shell, rule.
ANALISIS MATEMATIK TERHADAP KOMPLEKSITAS ALGORITMA PENGURUTAN DATA METODE GELEMBUNG (BUBBLESORT) (Mathematic Analysis of The Bubblesort Algorithm Complexity) Mustafidah, Hindayati; Ariyanto, Dwi
BIOMATH Vol 9, No 2 (2007)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

This research addresses to get complexity model depended on mathematic analysis of time and space of bubblesort algorithm depending on its graphical and mathematic computing growth rate. To get the time and steps for sorting the data built a computer program with programming language Turbo C++ ver 3.0. The program run at a computer with specifications as follows AT-386 Cache 256 Kbyte RAM 8 MB, and a printer. Mathematic analysis result of Bubblesort method wth various data states, data amount, and data setting, shows that Bubblesort algorithm has a time complexity according to O(n lg n). Result of perception pursuant to tables of data and speed process of data sorting and also graph of time growth of data sorting process show the consistent process time go up to data amount.Keywords : complexity, algorithm, bubblesort.
ANALISIS DATA PANEL (Panel Data Analysis) Purwanto, Joko
BIOMATH Vol 9, No 2 (2008)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

In this research, we present: estimator from the parameter of panel data and character from the parameter of panel data. This research will be emphasized to determine an estimator using Generalized Least Square (GLS) approach then brought to Ordinary Least Square (OLS) form and minimize OLS using Sum Square Error (SSE) approach. Then, we give an application for Bank Mandiri share data. The result of the analysis, we obtain: the estimator of B estimator which have the BLUEs character
ANALISIS DATA PANEL MODEL DINAMIK (Dynamic Models of Panel Data Analysis) Purwanto, Joko
BIOMATH Vol 10, No 1 (2009): BIOMATH
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

In this research, we present: estimator from the parameter of dynamic models of panel data, character from the parameter of dynamic model of panel data. This research will be emphasized to determine an estimator using Generalized Least Square (GLS) approach then brought to Ordinary Least Square (OLS) form and minimize OLS using Sum Square Error (SSE) approach. Then, we give an application for Bank Mandiri share data. The result of the analysis, we obtain: estimator y is consistent estimator. The estimator of 0 estimator which have the BLUEs character.
VISUALISASI INTEGRAL TENTU METODE KUADRAT GAUSS MENGGUNAKAN BAHASA PEMROGRAMAN MATLAB (Visualization of Kuadrat Gauss Method in Certain Integration Using MATLAB Programming Language) Mustafidah, Hindayati; Priyanto, Aji; Setyaningsih, Eka
BIOMATH Vol 7, No 2 (2006)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

This research aims to visualize certain integration especially Kuadrat Gauss method using MATLAB programming language. This research uses study literature and computer program implementation methods. The stages of making computer program are identify problem, determine solution, coding, testing the program with several cases or debugging, and documentation. Programming language that used in this research is MATLAB version 5.3. The result is software that is a computer program to visualize in graph mode of Kuadrat Gauss method in certain integration and compute its value.Keywords : MATLAB, Kuadrat Gauss Method, visualize.
ANALISIS KOMPLEKSITAS WAKTU DAN RUANG TERHADAP LAJU PERTUMBUHAN ALGORITMA HEAPSORT (Time and Space Complexity Analysis for Heapsort Algorithm Growth Rate) Irianto, Sony; Mustafidah, Hindayati
BIOMATH Vol 7, No 2 (2006)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

This research addresses to get time and space complexity analysis model of heapsort algorithm depending to its graphical and mathematic analysis growth rate. To get the time and steps for sorting the data used computer program with programming language Turbo C++ ver 3.0. The program run at three computers with specifications as follows: Processor Intel Pentium 166 RAM 32M Cache Memory 512Kbyte, AT-386 Cache 256 Kbyte RAM 8 MB, and AT-486 Cache 256Kbyte RAM 16 MB, and a printer. Conclusion that reaches of this research is that heapsort algorithm is one of the algorithm sorting methods that has a high speed level with procces time O(n log n) of the complexity and sorting time speed level to sort data. Analysis results of the various data condition, sum of data, and data setting, this algorithm has a consistance time complexity. The results of the observation based on data table, sorting procces speed, and proccess time growth graphically, this algorithm has an up consistance proccess time of sum data.Keywords: algorithm, heapsort, time proccess, complexity analyze.
KEMAMPUAN AFEKTIF SISWA KELAS II SMP MUHAMMADIYAH SUMBANG KABUPATEN BANYUMAS POKOK BAHASAN LINGKARAN MENGGUNAKAN PEMBELAJARAN CONTEXTUAL TEACHING AND LEARNING (CTL) Mustafidah, Hindayati; Budiana, Irkham; Setyaningsih, Eka
BIOMATH Vol 9, No 2 (2007)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

This research aim to know the student’s affective ability evaluated fromstudent’s enthusiasm and attitude aspect at circle subtopic in 2nd class of SMP Muhammadiyah Sumbang Banyumas Regency using Contextual Teaching and Learning ( CTL). This research’s subject is student student amount 30 people.Technique of data collecting conducted to use the observation and enquette. Data analyse technique used qualitative descriptive analysis technique. Result of data analyse obtained a class percentage for the enthusiasm of equal to 72,99% and attitude of equal to 76,51%, so that ability of student’s affective evaluated from enthusiasm and attitude obtained percentage of equal to 74,83%. According to assessment criterion that ability of student’s affevtive is goodKeywords : affective ability, CTL, enthusiasm, attitude.
KOMPUTASI REDUKSI GAUSS-JORDAN PADA APLIKASI PENGHITUNGAN TEGANGAN DAN ARUS LISTRIK (Gauss-Jordan ReductionComputation for Computing Application in Voltage and Current) Mustafidah, Hindayati
BIOMATH Vol 9, No 1 (2008)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

This research addresses to apply Gauss-Jordan reduction system for solving electrical circuit problems and making computation model from mathematic solution systems. Gauss-Jordan Reduction system is used for counting voltage and current electricity measures consist some branch points, where resistance and voltages measures at the end of each branches is known. This computational is done with C++ language programming. There are four stages in development of this research. Thefirst stage is analyzing electrical circuit problems. The second stage is making equalization system from the problems, and the third is making a flow chart for knowing the program steps. The last stage is making a computer programming with C++ language programming.Keywords : Gauss-Jordan Reduction, Electrical Circuit, Computation.
PENGEMBANGAN SISTEM PENGHITUNGAN ZAKAT MENGGUNAKAN BAHASA PEMROGRAMAN VISUAL BASIC (Tithe Counting System Development Using Programming Language Visual Basic) Setiawan, Purwoko Dedi; Mustafidah, Hindayati
BIOMATH Vol 9, No 2 (2008)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

This research aims to build a system of alms counting in the form of thecomputer program (software) using the programming language Visual Basic 6.0. This research is conducted in Laboratory of Development of Mathematic Education of FKIP of Muhammadiyah University of Purwokerto. Steps that are done in this research are (1). defining the problem (problem definition), (2). create a design of algorithms such as the flowchart; (3). build the program; (4). test program. Results of this research is a software that can be used to calculate the alms, which include: alms of livestock (cows and goats), money, jewelry, trade, profession, and agriculture alms.Keywords: alms, calculation, computer program
REPRESENTASI KASUS MENGGUNAKAN INDUCTIVE RETRIEVAL DENGAN ALGORITMA C4.5 PADA KASUS KLASIFIKASI PRESTASI MAHASISWA BERDASARKAN NEM, TINGKAT KEDISIPLINAN, DAN MOTIVASI Mustafidah, Hindayati; Hartati, Sri
BIOMATH Vol 9, No 2 (2008)
Publisher : BIOMATH

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

C4.5 algorithm is an extension of ID3 that has a function to case partitionwith Inductive Retrieval used in CBR (Case Based Reasoning) method. This case representation is represented as a decision tree that requires informations about some data records. Each record has the same structure, consisting of a number of attribute/value pairs. One of these attributes represents the category of the record.Case sample here is to determine classification of student’s achievement based on his NEM, discipline level, and motivation. As a category attribute is Achievement whose values : LESS, ENOUGH, and GOOD. Using decision tree in this case representation, finding solusion according to existed cases becomes more fast and easily of this case arranged systematically.Keywords : C4.5 algorithm, Inductive Retrieval, category attribute.

Page 1 of 2 | Total Record : 13