cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota semarang,
Jawa tengah
INDONESIA
MATEMATIKA
Published by Universitas Diponegoro
ISSN : -     EISSN : -     DOI : -
Core Subject : Education,
Mathematics
Arjuna Subject : -
Articles 300 Documents
 26   27   28   29   30 
KAJIAN PERBAIKAN KECEPATAN WAKTU EKSEKUSI TERHADAP UNJUK KERJA PIRANTI INPUT/OUTPUT suhartono, suhartono
MATEMATIKA Vol 4, No 2 (2001): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Unjuk kerja komputer merupakan permasalahan yang sering dibicarakan bagi pengguna dan perancang komputer. Unjuk kerja komputer dapat ditingkatkan dengan memperbaiki teknologinya, baik dari segi perangkat keras maupun perangkat lunaknya. Dalam penelitian ini dikaji mengenai unjuk kerja dari piranti Input /Output Indikator unjuk kerja yang diteliti adalah  waktu I/O. Pengkajian dilakukan menggunakan hubungan antara waktu CPU, Waktu I/O dan Elapsed Time. Berdasarkan hasil komputasi diperoleh bahwa perbaikan Waktu CPU berpengaruh terhadap perbaikan waktu I/O
PENGANTAR UJI STABILITAS UNTUK MODEL KOMPETISI ANTARA DUA POPULASI Warsiki, Endang; Parhusip, Hanna Arini
MATEMATIKA Vol 2, No 8 (2005): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

The stability analysis for a competition model between two populations is the main topic in this paper. Stability is studied by considering the  eigenvalues of system differential equations according to the logistic equations which are developed for two populations. This paper can also be used as an introduction of the qualitative theory through a stability analysis. Additionally, this paper is proposed to the beginners in differential equations.  
APLIKASI BS RUTEKU, NAVIGASI BLOK SENSUS MENGGUNAKAN ALGORITMA DJIKSTRA Muna, Muna; Kusmaiwanto, Herry
MATEMATIKA Vol 20, No 2 (2017): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

The activities of the Badan Pusat Statistik (BPS) in conducting the census and survey generally begin with the tracing of the census block (BS) by using map map print-out census block  If the officer gets a new working area he / she knows not too many officers who have difficulty to block the census of his working area and in determining its boundaries. Error determining the location or limits of the selected Censusblock is a Major Error, for that BS Ruteku as a tool of navigation fast and cheap, because it does not need to connect to the internet and does not make the battery run out quickly. The method used in BS Ruteku application uses Djikstra Algorithm method. This application is designed with the aim to find the route of the nearest road from one area to another. The Ruteku BS Application is the result of the Censusblock Digit Map Overlay with Indonesian Basic Map (http://navigasi.net/goptd.php), which added some Local Content and uses the android / GPS navigation system as the Navigator Engine. To be able to provide the Shortest Distance, Fastest Distance or Distance straight, then the existing Polyline autoruting process. The test results show that the accuracy of the use of the earth map is reliable, this application is also able to find the nearest route from a region or census block and can provide direction through the sound.
REFORMULASI DARI SOLUSI 3-SOLITON UNTUK PERSAMAAN KORTEWEG-de VRIES mustikaningsih, Dian; sutimin, sutimin
MATEMATIKA Vol 5, No 2 (2002): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

The solution of  3-soliton for Korteweg-de Vries (KdV) equation can be obtained by the Hirota Method. The reformulation of the 3-soliton solution was represented as the superposition of the solution of each individual soliton. Moreover, the asymptotic form of 3-soliton solution was obtained by limiting of the t parameter. The phase shift of each individual soliton are analysed in detail based its asymptotic form. The results of the analysis shown that the first soliton always have a phase shift called forward, the second soliton have some possibility (there is no phase shift, have a  forward phase shift, or have a backward phase shift), and for the third soliton always have a phase shift called backward.
INFERENSI FUNGSI KETAHANAN DENGAN METODE KAPLAN-MEIER Widiharih, Tatik; Andriani, Nasichah Siska
MATEMATIKA Vol 9, No 3 (2006): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

. Let T be a nonnegatif random variable representing the life time of individuals in some population. Life time data of individuals are devided in two kinds, cencored and uncencored data. The probability of an individual surviving till time t is given by the survival function S(t)=P(T≥t). Product Limit estimator (Kaplan-Meier estimator) is a nonparametric method to find the survival function for cencored data.  
KONSTRUKSI LEXICOGRAPHIC UNTUK MEMBANGUN KODE HAMMING (7, 4, 3) Aini, Aurora Nur; Irawanto, Bambang
MATEMATIKA Vol 12, No 3 (2009): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Hamming code can correct single error in massages transmission. Hamming codes can be constructed by Lexicographic codes. Lexicographic construction is a greedy algorithm that produces error correcting codes known as lexicographic codes. There are two ways to construct lexicographic codes. They are greedy construction and lexicographic constructions. Given codes with minimum distance d and length n. To construct the greedy algorithm, the codeword with length n are processed in some fixed order, and the next codeword is inserted in the code when its distance from all codewords previously selected is  d. The Lexicographic Construction is a different approach with a goal to speed up the process of generating lexicodes by storing the reusable information in the memory.  
PELABELAN AKAR RATA-RATA KUADRAT PADA GRAF LADDER〖 L〗_n DAN GRAF CORONA〖 P〗_n⨀K_2 Mubarok, Azhar; Ratnasari, Lucia; Djuwandi, Djuwandi
MATEMATIKA Vol 19, No 2 (2016): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

A graph G with p vertices and q edges. A Root Square Mean Labeling of graph  is an injective function from the set of vertices  to the set  with  edge is the number of side on the graph such that when each edges  is labeled by a function that defines as  ceilling function or floor function from root square mean  and , then the edge labels are distinct. For each of graphs that uses root square mean labeling is called as Root Square Mean graph. In this paper, the study is about root square mean labeling on Ladder graph, Corona graph . Then, we prove that  and  graph  are included as the root square mean graph. 
KOMPRESI CITRA MEDIS MENGGUNAKAN DISCRETE WAVELET TRANSFORM (DWT) DAN EMBEDDED ZEROTREE WAVELET Anwar, Khairil
MATEMATIKA Vol 11, No 2 (2008): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Medical image usually have a large sizely, this might be a problem when saving and sending, so compression of medical image are needed. One of method of compression is using DWT and EZW. Discrete Wavelet Transform (DWT) can compact the energy of image into a small number of coefficient, give combination information of frequency and time, so that more accurate to reconstruct of image.  Embedded Zerotree Wavelet (EZW) is very effective for the quantization of discrete wavelet coefficients, can generate the bits in the bit stream in order of importance, yielding a fully embedded code, so that reacing maximal compression. From examination, can be concluded that compression at image of grayscale and RGB with different type of wavelet and level dekomposisi, result  reasonable compression, because from all compression image yielded have value of PSNR > 40 dB.  
BEBERAPA SIFAT SMALL RIEMANN SUMS FUNGSI TERINTEGRAL HENSTOCK-KURZWEIL DARI RUANG EUCLIDn KE RUANG BANACH X Khabibah, Siti; Darmawijaya, Soeparna
MATEMATIKA Vol 14, No 1 (2011): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

In this paper we discussed some properties of Henstock-Kurzweil integrable functions from the Euclidean Spaces Âninto Banach space , Locally Small Riemann Sums dan Globally Small Riemann Sums.  
ENDOMORFISMA RIGID DAN COMPATIBLE PADA RING DERET PANGKAT TERGENERALISASI MIRING Faisol, Ahmad
MATEMATIKA Vol 17, No 2 (2014): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Given a ring R, a strictly ordered monoid and monoid homomorphism  .  Constructed the set of all function from S to R whose support is artinian and narrow, with pointwise addition and the skew convolution multiplication, it becomes a ring called the skew generalized power series rings (SGPSR)  and denoted by . A ring R is called  reduced if it contains no nonzero nilpotent elements, reversible if for all ,  implies .  Let  be a ring endomorphism,  if for ,  implies , then  is called rigid. If for all ,  if and only if , then  is called compatible.  In this paper we will discuss about the constructing of SGPSR homomorphism.  Beside that, we also discuss about rigid and compatible endomorphism on SGPSR .

Page 28 of 30 | Total Record : 300

 26   27   28   29   30 

Filter by Year

2001 2017


Reset
Filter By Issues
All Issue Vol 20, No 2 (2017): JURNAL MATEMATIKA Vol 20, No 1 (2017): JURNAL MATEMATIKA Vol 19, No 3 (2016): Jurnal Matematika Vol 19, No 2 (2016): Jurnal Matematika Vol 19, No 1 (2016): Jurnal Matematika Vol 18, No 1 (2015): Jurnal Matematika Vol 17, No 3 (2014): Jurnal Matematika Vol 17, No 2 (2014): Jurnal Matematika Vol 17, No 1 (2014): Jurnal Matematika Vol 16, No 1 (2013): Jurnal Matematika Vol 15, No 1 (2012): JURNAL MATEMATIKA Vol 14, No 3 (2011): Jurnal Matematika Vol 14, No 2 (2011): JURNAL MATEMATIKA Vol 14, No 1 (2011): JURNAL MATEMATIKA Vol 10, No 2 (2007): JURNAL MATEMATIKA Vol 13, No 3 (2010): JURNAL MATEMATIKA Vol 13, No 2 (2010): JURNAL MATEMATIKA Vol 13, No 1 (2010): JURNAL MATEMATIKA Vol 12, No 3 (2009): JURNAL MATEMATIKA Vol 12, No 2 (2009): JURNAL MATEMATIKA Vol 12, No 1 (2009): JURNAL MATEMATIKA Vol 11, No 3 (2008): JURNAL MATEMATIKA Vol 11, No 2 (2008): Jurnal Matematika Vol 11, No 1 (2008): JURNAL MATEMATIKA Vol 10, No 3 (2007): JURNAL MATEMATIKA Vol 10, No 1 (2007): JURNAL MATEMATIKA Vol 9, No 3 (2006): JURNAL MATEMATIKA Vol 9, No 2 (2006): JURNAL MATEMATIKA Vol 9, No 1 (2006): JURNAL MATEMATIKA Vol 8, No 3 (2005): JURNAL MATEMATIKA Vol 8, No 1 (2005): JURNAL MATEMATIKA Vol 2, No 8 (2005): JURNAL MATEMATIKA Vol 7, No 3 (2004): JURNAL MATEMATIKA Vol 7, No 2 (2004): JURNAL MATEMATIKA Vol 7, No 1 (2004): JURNAL MATEMATIKA Vol 6, No 3 (2003): Jurnal Matematika Vol 6, No 2 (2003): Jurnal Matematika Vol 6, No 1 (2003): Jurnal Matematika Vol 5, No 3 (2002): Jurnal Matematika Vol 5, No 2 (2002): Jurnal Matematika Vol 5, No 1 (2002): Jurnal Matematika Vol 4, No 3 (2001): Jurnal Matematika Vol 4, No 2 (2001): JURNAL MATEMATIKA Vol 4, No 1 (2001): JURNAL MATEMATIKA More Issue