cover
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,
Arjuna Subject : -
Articles 6 Documents
Search results for , issue "Vol 10, No 2 (2007): JURNAL MATEMATIKA" : 6 Documents clear
DESAIN XML SEBAGAI MEKANISME PETUKARAN DATA DALAM HERBARIUM VIRTUAL Adi wibowo; Muhammad Abdullah
MATEMATIKA Vol 10, No 2 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

The Indonesian Herbaria hold about million records in LIPI and any databases at the universities in the each state and territory. The current system, databases herbarium is applied in the physical collections and there are some computerized databases however usage only in the institution. One of information technology which was applied to support the expansion of virtual herbarium is XML technology for data exchange mechanism in web application. In this article will be studied a design in data exchange mechanism which applied to XML technology for herbarium databases.
BANACH LATTICE YANG MEMUAT cO Farikhin, Farikhin
MATEMATIKA Vol 10, No 2 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Let Banach lattices E and F. Lattice homomorphism T : E ® F is called lattice embedding if there exists positive numbers m and n such that  for all xÎE implies m.|||| £ ||T()|| £ n.||||. In others word, Banach lattice E is said to be lattice embeddable in F if there exist closed subspace F0 Í F such that F0 and E are lattice isomorphic. As well known that dual space of E is Levi-s, i.e.     sup{ / n = 1, 2,...} in E* exist for every increasing bounded (in the norm) sequences { / n = 1, 2,...} in E*. If sequences space c0 is lattice embeddable in E* then sequences space l¥ is lattice embeddable in E*, within E* is dual space of E. This theorem is proven by Groenewegen in [4]. For Levi-s Banach lattice E, we proof that sequences space c0 is lattice embeddable in E if only if sequences space l¥ is lattice embeddable in E.  
ESTIMASI DATA HILANG PADA RANCANGAN ACAK KELOMPOK LENGKAP widiharih, Tatik
MATEMATIKA Vol 10, No 2 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Randomized complete block design is a design to reduce the residual error in an experiment by removing variability due to a known and controllable nuisance variable. Missing observations introduce a new problem into the analysis since treatments are no longer orthogonal to blocks, that is, every treatment does not occur in every block, There are two general approaches to the missing values problem. The first is an exact analysis, the second is an approaximate analysis in which the missing observations are estimated and usual analysis of variance is performed just as if the estimated observations were real data, with the error degrees of freedom reduced by the number of missing observations. In this paper was discussed the second approach with completely analysis. Bigger’s method is a simple method for estimating missing observations by using matrix approximation.  
TEOREMA ELIMINASI CUT PADA SISTEM LOGIKA FLgc DAN FLw,gc Surarso, Bayu
MATEMATIKA Vol 10, No 2 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

It is well known that the cut elimination theorem does not hold for FLc dan FLw,c, neither for propositional level nor predicate level. On the other hand, it has been proved that for the propositional level the cut elimination theorem holds for FL with global contraction (FLgc), which is equivalent to FLc. Similar result is also shown for system FL with both weakening and global contraction rule (FLw,gc), which is equivalent to FLw,c. In the present paper we modify and develop the method used to prove the cut elimination for proportional logic FLgc to show that the cut elimination theorem even holds for the predicate logics FLgc dan FLw,gc.  
PERTIDAKSAMAAN AZUMA PADA MARTINGALE UNTUK MENENTUKAN SUPREMUM PELUANG sudarno, Sudarno
MATEMATIKA Vol 10, No 2 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Counting probability a two-tailed hypothesis determine level of the significance. This case follows positive and negative random variables. So that the probability distribution is a symmetric. The probability will be counted by Azuma inequality on martingales. The lowest upper bound is a decay exponential function. It is determined in some a, n, m, and e value by a simulation. The conclusion of this paper is that the random variable value is higher than the probability value (supremum) is lower, vise versa. Therefore, Its property is same as the distribution function.  
ESTIMASI REGRESI WAVELET THRESHOLDING DENGAN METODE BOOTSTRAP Suparti, Suparti; Mustofa, Achmad; Rusgiyono, Agus
MATEMATIKA Vol 10, No 2 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Wavelet is a function that has the certainly characteristic for example, it oscillate about zero point ascillating, localized in the time and frequency domain and construct the orthogonal bases in  L2(R) space. On of the wavelet application is to estimate non parametric regression function. There are two kinds of wavelet estimator, i.e., linear and non linear wavelet estimator. The non linear wavelet estimator is called a thresholding wavelet rstimator. The application of the bootstrap methode in the thresholding wavelet function estimation is resample the wavelet coefficient of residual. The best of the thresholding wavelet estimator with bootstrap method has minimal of mean square error (MSE). The minimal MSE depend from the number of replication.  

Page 1 of 1 | Total Record : 6


Filter by Year

2007 2011


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