<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://ejournal.undip.ac.id/lib/pkp/xml/oai2.xsl" ?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
		http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-05-31T19:25:29Z</responseDate>
	<request metadataPrefix="oai_dc" set="matematika:ART" verb="ListRecords">https://ejournal.undip.ac.id/index.php/index/oai</request>
	<ListRecords>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3882</identifier>
				<datestamp>2012-08-09T04:19:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OPERASI GABUNGAN, JOIN, KOMPOSISI DAN HASIL KALI KARTESIAN  PADA GRAF FUZZY SERTA KOMPLEMENNYA</dc:title>
	<dc:creator>Novia, Tina Anggitta</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:description xml:lang="en-US">A fuzzy graphs                                                    is a nonempty set    together with a pair function     and     satisfied     This paper described about some operations on fuzzy graphs such as union, join, compositions and cartesian product. Complement of union two fuzzy graphs is join of their complement, join complement of two fuzzy graphs is union their complement. Complement of composition two strong fuzzy graphs is composition of their complement, but complement of cartesian product two stong fuzzy graphs is need not cartesian product of their complement.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3882</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 3 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3882/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1312</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">WAKTU OPTIMUM  PRODUKSI DAN KONSUMSI OKSIGEN RUMPUT LAUT GRACILARIA VERRUCOSA</dc:title>
	<dc:creator>Kartono, Kartono</dc:creator>
	<dc:creator>Izzati, Munifatul Izzati</dc:creator>
	<dc:description xml:lang="en-US">Seaweed Gracilaria verrucosa not only produce oxygen but also consume oxygen. Consider   the production and consumption of the oxygen, we can determined that the production and consumption models of oxygen like a logistic models. Finally, in this paper  presented a role to determine an optimum time of the oxygen production and consumption.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1312</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1312/1075</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12261</identifier>
				<datestamp>2016-10-11T04:03:05Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PELABELAN PRIME CORDIAL PADA BEBERAPA GRAF YANG TERKAIT DENGAN GRAF SIKEL</dc:title>
	<dc:creator>Hapsari, Nindita Yuda</dc:creator>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:description xml:lang="en-US">Prime cordial labeling of a graph                                                    is a bijective mapping of the set vertex     to the set     where     is the number of vertex . The edge labeling induced the vertex labeling, which is obtained by finding the great common divisor (gcd) of the label of vertex which it’s adjacent. If gcd of the adjacent vertex label is 1 then the label of edge is 1, but if gcd of the adjacent vertex label value other than 1 then the label of edge is 0, and the absolute value of the difference between the number of edges labeled 0 and the number of edges labeled 1 is less than equal with 1. A graph admits prime cordial labeling is called prime cordial graph. In this paper, we study about edge duplication cycle graph     (except for    ), vertex duplication cycle graph    , path union union of cycle the graph     and friendship graph one point union of      copies of cycle    .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12261</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12261/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/617</identifier>
				<datestamp>2013-05-29T04:32:36Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS PENYALURAN RASKIN DI KOTA SEMARANG</dc:title>
	<dc:creator>eko, Rosiana</dc:creator>
	<dc:creator>tatik, widiharih</dc:creator>
	<dc:description xml:lang="en-US">Raskin Program is national program with aim to support impecunious household in fulfilling sufficiency of requirement of food and lessen burden of finansial through readying of rice subsidize. BPS have specified 14 ( fourteen) impecunious family criterion which become base of division of raskin. Household told impecunious if fulfilling one of the impecunious criterion. To analyze distributing of raskin conserning to the number of variable which is used in determining household receiver of raskin by logistics regression. Household owning highest probability accept raskin is household with floor is earth, residence wall type is bamboo, usage of facility defecate public, source of improtected wellspring drinking water, fuel to cook firewood, not capable to pay [for] the expense of medication, revenue of earnings of family head less than Rp 600.000,00 highest education of family head is Madrasah Ibtidaiyah, owning things which can be sold for the price of less than Rp 500.000,00   </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/617</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 1 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/617/487</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1351</identifier>
				<datestamp>2012-01-25T04:58:23Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">INTERPOLATION THEOREM FOR NONCOMMUTATIVE STANDARD EXTENSIONS OF LOGIC BB’I</dc:title>
	<dc:creator>Surarso, Bayu</dc:creator>
	<dc:description xml:lang="en-US">Maehara in [Maehara, 1960/1961] introduces a proof-theoretical method for proving the interpolation theorem for standard logics. In the present paper we modify Maehara’s method to prove the interpolation theorem for the systems LBB’IK, LBB’IW and LBB’IKW introduced in [Bayu Suraraso, 2005] and consequently the interpolation theorem holds for the logics BB’IK, BB’IW and BB’IKW.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1351</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 2 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1351/1112</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15280</identifier>
				<datestamp>2017-07-21T04:14:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL OPTIMASI ECONOMIC ORDER QUANTITY DENGAN SISTEM PARSIAL BACKORDER DAN INCREMENTAL DISCOUNT</dc:title>
	<dc:creator>Nurhayati, Neri</dc:creator>
	<dc:creator>Puspita, Nikken Prima</dc:creator>
	<dc:creator>SRRM, Titi Udjiani</dc:creator>
	<dc:description xml:lang="en-US">Economic Order Quantity model with partial backorder system and incremental discount is an integration of several model of inventory optimation, they were Economic Order Quantity optimation model, Economic Order Quantity optimation model with partial backorder system and Economic Order Quantity optimation model with incremental discount. Beside the discounts are given by supplier, in this model there were two stockout conditions, where the consumers disposed to wait until the order came and consumers did not disposed to wait until the order came. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-07-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15280</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 1-7</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15280/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/712</identifier>
				<datestamp>2010-12-21T06:17:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SILINDER BERPENAMPANG AIRFOIL DARI PENJUMLAHAN DUA LINGKARAN</dc:title>
	<dc:creator>sihwaningrum, Idha</dc:creator>
	<dc:description xml:lang="en-US">In two dimensional nonviscous incompressible irrotational fluid flow, the equipotential lines and the streamlines can be related to the real and imaginary part of the complex function respectively.  By taking the streamlines equal to zero as the boundary fluid flows, we get several types of fluid flows such as fluid flow past a circular cylinder.  Having addition of two cylinder in a certain position result in an airfoil, it it reseanoble for asking whether addition of two equation of fluid flow past a cylinder give an equation of fluid flow past an airfoil cylinder.  This can be answer by examining  a lift from the airfoil equation. It is difficult to obtain the actual value of the lift.  To gain an understanding, we examine the change of square of the velocity in the neighbourhood of the airfoil.  Bernoulli's equation provides the connection between the pressure and the square of the velocity . Then the knowledge of the square of the fluid flow velocity gives an indication of the pressure.  Since the square of the fluid flow velocity in the neighbourhood below the airfoil is smaller than it is in the neighbourhood above the airfoil, then the pressure in the neighbourhood below the airfoil is greater than it is the neighbourhood above the airfoil.  This indicates that we have a lift from the equation of fluid flow past an airfoil in which its equation formed by summing two equation of fluid flow past a cylinder.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/712</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 1 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/712/574</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1383</identifier>
				<datestamp>2012-01-26T01:32:56Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS PERANAN TANAMAN HERBA MENIRAN  SEBAGAI ANTIMALARIA TERHADAP PERTUMBUHAN PLASMODIUM BERGHEI DALAM KULTUR IN VIVO PADA MENCIT</dc:title>
	<dc:creator>Latra, I Nyoman</dc:creator>
	<dc:creator>Fauzi, Emil Amalia</dc:creator>
	<dc:description xml:lang="en-US">Malaria disease is a parasite’s infection disease that can infect healthy human through Anopheles mosquito bite that contains parasite.  In this modern century, traditional medicines has grown better whether in it’s purpose or it’s presentation.  Meniran herb plant (Phyllanthus Niruri Linn) is one of plants that can be used tradisionally where it contains a compound from alkaloid’s, flavonoid’s, and lignan’s group.  Several researches show that the group compounds has an antimalaria activity.  The objectives of this research are to detect the influence of dosages, and days factors and their interaction to parasitemia Plasmodium Berghei percentage in extract test of meniran herb plant with metanol solvent that experimented in ”in vivo” culture on mice (Mus Musculus).  The objectives is to determine optimal dosage (per-centage) in diffusing parasitemia growth.  From examination and discussion result that both factors are inspected with its dosages, days, and their interaction influence significantly to pa-rasitemia percentage.  Refer to diffusing percentage, the highest percentage in 800.128 mg/kg mouse WG dosage is 61.82%.  So it can be explained that 800.128 mg/kg  mouse WG dosage are optimal to diffusing  6182 parasitemia growth for every 10000 eritrosit in mouse’s body.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1383</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 2 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1383/1147</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/788</identifier>
				<datestamp>2011-01-19T07:34:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERBANDINGAN ANALISA IMAGE WAJAH DIGITAL MENGGUNAKAN METODE COSINUS PAKET (CPT) DAN METODE WAVELET (DWT)</dc:title>
	<dc:creator>suparti, Suparti</dc:creator>
	<dc:creator>Farikhin, Farikhin</dc:creator>
	<dc:description xml:lang="en-US">Dalam perkembangan IPTEK seringkali dilakukan pengiriman image melalui suatu media misalnya satelit. Dalam proses pengiriman image ini seringkali mengalami noise (gangguan) yang mengakibatkan image yang diterima menjadi tidak jelas (kabur). Untuk mendapatkan image yang mirip dengan aslinya maka ganguan ini harus dihilangkan (denoising). Dalam analisa image, dapat ditentukan image terbaik dengan menghilangkan gangguan. Analisa image ini dapat dilakukan dengan metode cosinus Fourier (DCT) yang kemudian dikembangkan dalam metode cosinus paket (CPT) maupun dengan metode wavelet (DWT) yang kemudian dikembangkan menjadi metode wavelet paket (WPT). Kebaikan dalam analisa dapat dilihat dari besar kecilnya penyimpangan yang terjadi. Semakin kecil penyimpangannya semakin baik analisa imagenya. Salah satu ukuran untuk menentukan besar penyimpangan adalah dengan menentukan besar MSE (Mean Squared Error). Dalam penelitian ini dilakukan perbandingan analisa image wajah digital menggunakan metode cosinus paket (CPT) dan metode wavelet (DWT) dengan tujuan menentukan image wajah terbaik menggunakan metode CPT dan DWT serta menentukan metode yang lebih efektif. Penelitian ini merupakan kajian literatur yang dikembangkan dengan simulasi menggunakan software S+Wavelets. Dalam analisa image wajah digital metode DWT lebih efektif dari metode CPT.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/788</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 3 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/788/649</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3873</identifier>
				<datestamp>2012-08-09T03:39:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">REPRESENTATION OF SM OPERATORS    ON SEQUENCE SPACES WITH A NEW NORM</dc:title>
	<dc:creator>Ansori, Muslim</dc:creator>
	<dc:description xml:lang="en-US">We give some representations of SM-operator on sequence spaces                                                   ,   using a new norm different from that of ones in the beginning and some examples are given</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3873</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 3 (2011): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3873/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/863</identifier>
				<datestamp>2011-04-21T02:17:12Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KAJIAN MATEMATIS DISTRIBUSI TEKANAN   PADA AIRFOIL JOUKOWSKY</dc:title>
	<dc:creator>MARYANTO, EDDY</dc:creator>
	<dc:description xml:lang="en-US">The objectives of this research are to investigate the effect of the translation of the coordinate system to the shape of the Joukowsky airfoils formed and to compute lift coefficient of the Joukowsky airfoils. The result of the research is the higher the absisca and ordinate of the translation the higher the lift coefficient (with absisca must be greater than ordinate and  both are greater to zero).  If the circle is translated along positive x-axis, the airfoil formed is symmetrical with respect to x-axis.  While if it is  translated along positive y-axis, the airfoil formed is curve shaped.   From the research we also have found the fact the higher the distance of the translation from the center of the coordinate system the higher the thickness of the airfoil formed.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/863</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 1 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/863/733</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12248</identifier>
				<datestamp>2016-10-11T03:28:25Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERLUASAN HARNACK DAN SIFAT CAUCHY INTEGRAL HENSTOCK-DUNFORD PADA RUANG EUCLIDE</dc:title>
	<dc:creator>., Solikhin</dc:creator>
	<dc:description xml:lang="en-US">In this paper we study Henstock-Dunford integral on the Euclidean space . We discuss some properties of the integrable. We prove  the Harnack Extension theorems and the Cauchy extension theorems for Henstock-Dunford integral on the Euclidean space .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12248</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 16, No 1 (2013): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12248/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12248/pdf_1</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/608</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL DINAMIK PERTUMBUHAN BIOMASSA UDANG WINDU DENGAN FAKTOR MORTALITAS BERGANTUNG WAKTU</dc:title>
	<dc:creator>sulanjari, Sulanjari</dc:creator>
	<dc:creator>sutimin, sutimin</dc:creator>
	<dc:description xml:lang="en-US">In this paper will be discussed the growth model of shrimp biomass. Biomass is total weight from population. The growth model of shrimp biomass is influenced by the growth model of weight and of population. The growth model of weight, here will be governed and based on Von Bertalanffy’s model. The growth model of number population based on the exponential model and it has been constructed by mortality formula. From the growth model of shrimp biomass will be predicted when accurate harvest time to know the optimal harvest product.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/608</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/608/479</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1342</identifier>
				<datestamp>2012-01-25T04:43:58Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROGRAM NONLINEAR FUZZY</dc:title>
	<dc:creator>Khairudin, Khairudin</dc:creator>
	<dc:description xml:lang="en-US">Nonlinear programming problems have not been developed yet and still to be attention for research just recently. In this paper will be introduced simple fuzzy nonlinear programming problem with any membership nonlinear function, like proposed by Wang and Tang in their paper at 1995 to 1997(Gen and Cheng, 2000). Via defuzzyfication process by Belmann and Zadeh (1970) so that will be improved that fuzzy nonlinear programming problem can be transformed into conventional nonlinear problems.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1342</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 1 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1342/1103</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12371</identifier>
				<datestamp>2016-10-21T01:25:53Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SIFAT-SIFAT LANJUT NEUTROSOFIK MODUL</dc:title>
	<dc:creator>., Suryoto</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:creator>Puspita, Nikken Prima</dc:creator>
	<dc:description xml:lang="en-US">Neutrosophic module over the ring with unity is an algebraic structure formed by a neutrosophic abelian group by providing actions scalar multiplication on the structure. The elementary properties of neutrosophic module have been looked at, that are intersection dan summand among neutrosophic submodules are neutrosophic submodule again, but it not true for union of neutrosophic submodules. In this article discussed the advanced properties of the neutrosophic module and the algebraic aspects respect to this structure, including neutrosophic quotient module and neutrosophic homomorphism module and can be shown that most of the properties of the classical module still true to the neutrosophic structure, especially with regard to the properties of neutrosophic homomorphism module and the fundamental theorem of neutrosophic homomorphism module.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12371</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 2 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12371/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/703</identifier>
				<datestamp>2010-12-21T05:35:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EKUIVALENSI  INTEGRAL  BOCHNER  DENGAN  INTEGRAL  MCSHANE  KUAT  UNTUK  FUNGSI  DENGAN  NILAI  DI  DALAM  RUANG  BANACH</dc:title>
	<dc:creator>Sumanto, Y.D</dc:creator>
	<dc:description xml:lang="en-US">Integral  McShane  fungsi-fungsi  bernilai  real  ekuivalen  dengan  Integral  Lebesque,  namun  untuk  fungsi  bernilai  vektor  tidak  selalu  demikian.  Dapat  ditunjukkan  bahwa  Integral  Bochner  (Integral  Lebesque  untuk  fungsi  bernilai  vektor)  ekuivalen  dengan  Integral  McShane  kuat.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/703</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 3 (2001): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/703/565</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1374</identifier>
				<datestamp>2012-01-25T06:51:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENERAPAN DISTRIBUSI PELUANG UNTUK IDENTIFIKASI PERUBAHAN KLIMATOLOGIS CURAH HUJAN EKSTRIM</dc:title>
	<dc:creator>Visa, Juniarti</dc:creator>
	<dc:description xml:lang="en-US">Climatological change analysis of rain fall in Maros and Ciamis had been done using rain fall data for 103 years. The rain fall process was focused in wet months (DJF) and dry months (JJA). The results show that in Maros and Ciamis area there had been a rain fall climatological change in every 30 years an average period. Using Statistical Distribution method, an extreme rain fall occurred in each period. The maximum rain fall in Maros was 1937 mm/month for wet months (DJF) and 316 mm/month, while in Ciamis was 1039 mm/month for wet month and 1199mm/month for dry month.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1374</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 3 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1374/1137</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/768</identifier>
				<datestamp>2011-01-11T05:09:54Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SYARAT CUKUP AGAR  SUATU FUNGSI TERINTEGRAL HENSTOCK MUTLAK DI DALAM RUANG METRIK KOMPAK LOKAL</dc:title>
	<dc:creator>manuharawati, Manuharawati</dc:creator>
	<dc:creator>Darmawijaya, Soeparna</dc:creator>
	<dc:description xml:lang="en-US">Lee (1989) dan Widodo (1992) telah memperlihatkan bahwa integral Henstock di dalam ruang metrik biasa R bukan merupakan integral mutlak. Berdasarkan kenyataan tersebut, makalah ini membahas  syarat cukup agar suatu fungsi terintegral Henstock mutlak di dalam ruang metrik kompak lokal, khususnya ruang metrik nondiskrit.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/768</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 2 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/768/629</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/854</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">K-ALJABAR</dc:title>
	<dc:creator>ISWATI, ISWATI</dc:creator>
	<dc:creator>suryoto, Suryoto</dc:creator>
	<dc:description xml:lang="en-US">K-algebra is an algebra structure built on a group so that characters of a group will apply also at K-algebra. If at group there is subgroup and homomorfism group, hence at K-algebra there is K-subalgebra and K-homomorfism. By using characters of group, will be proved characters applied at K-algebra.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/854</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/854/724</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12243</identifier>
				<datestamp>2016-10-11T02:44:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KINERJA ARSITEKTUR INTEROPERABILITAS  E-GOVERMENT MULTI PLATFORM</dc:title>
	<dc:creator>Widodo, Aris Puji</dc:creator>
	<dc:description xml:lang="en-US">The implementation of e-Government (e-Gov)The implementation of e-Government (e-Gov) to produce a form of relationship Government to Government (G2G). The main factor G2G about interoperability between national and local governments that have a development platform heterogeneity of e-Gov. Interoperability happens is done by creating a new architecture that has the function so that the E-Gov existing ones can communicate with each other. E-Gov Indonesia still developed separately between the central (national) and regional (province, district) or between agencies, so interoperability is happening yet fully able to walk properly. This Paper is focused on making application interoperability architecture of the E-Gov Indonesia as case studies in order to model the heterogeneous platform interoperability scheme. Architecture developed using the approach to Services Oriented Architecture (SOA) in the form of services layer to perform interoperability between heterogeneous platforms. Performance measurement is done by measuring the length of time the execution of the services contained on this architecture by using varying amounts of data.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12243</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 1 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12243/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1326</identifier>
				<datestamp>2012-02-16T06:37:48Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PEMBENTUKAN ANTI-AUTOMORFISMA PADA  GELANGGANG OPERATOR DIFERENSIAL</dc:title>
	<dc:creator>Amir, Amir Kamal</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿. Let  R be any ring with identity 1,  be an endomorphism of  R and  be a left -derivation. The skew polynomial  ring over R in an indeterminate x, denoted by  , is the set of    polynomials  where  with  multiplication rule  for all  For    the skew polynomial ring is written as  and is called differential operator ring. In this paper will be constructed  anti-automorphism on this ring, i.e., .  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1326</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1326/1089</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12276</identifier>
				<datestamp>2016-10-11T05:15:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PELABELAN GRACEFUL GENAP BARU PADA GRAF CmPn</dc:title>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:creator>Surarso, Bayu</dc:creator>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:description xml:lang="en-US">Pelabelan Graceful pada graf                                                   dengan q sisi merupakan pemetaan injektif     , yang mengakibatkan pemetaan    , yang didefinisikan dengan    bersifat bijektif. Graf yang memenuhi pelabelan graceful disebut graf graceful. T. Mahalaksmi Senthil Kumar, T. Abarna Parthiban dan T. Vanadhi [4], membuktikan graf CmÈPn merupakan graf graceful genap untuk m ganjil yang memenuhi kondisi tertentu. Marry U dan Saranya D [2], membuktikan bahwa graf CmÈPn merupakan graf graceful genap untuk m genap yang memenuhi kondisi tertentu. Pelabelan graceful genap didefinisikan sebagai pemetaan injektif     yang mengakibatkan pemetaan    , yang didefinisikan     bersifat bijektif.  Tetapi pada pembuktian [4] dan [2], syarat injektif dan bijektif fungsinya tidak terpenuhi. Artikel ini mendefinisikan kembali pelabelan graceful genap pada graf CmÈPn sehingga syarat injektif dan bijektif fungsinya terpenuhi.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12276</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 2 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12276/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/673</identifier>
				<datestamp>2010-12-17T05:42:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KLASIFIKASI INTERAKSI GELOMBANG PERMUKAAN BERTIPE DUA SOLITON</dc:title>
	<dc:creator>sutimin, Sutimin</dc:creator>
	<dc:creator>Rusgiyono, Agus</dc:creator>
	<dc:description xml:lang="en-US">Pada tulisan ini diselidiki, masalah klasifikasi interaksi gelombang bertipe dua soliton Kadomtsev-Petviashvilli (KP). Disini dianalisis berdasarkan parameter interaksi dua solusi soliton baik melalui harga eksak maupun proses pelimitan. Proses pelimitan ini dilakukan untuk mengetahui resonansi diantara dua soliton. Selanjutnya  resonansi soliton ini dikaji untuk mendapatkan soliton yang baru.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/673</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 1 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/673/540</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1365</identifier>
				<datestamp>2012-01-25T06:25:05Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS KOMPONEN UTAMA DENGAN MENGGUNAKAN MATRIK VARIAN KOVARIAN YANG ROBUST</dc:title>
	<dc:creator>Sujatmiko, Irwan</dc:creator>
	<dc:creator>Linuwih, Susanti</dc:creator>
	<dc:creator>AW, Dwi Atmono</dc:creator>
	<dc:description xml:lang="en-US">The present of outlier data causes the estimator of variance-covariance be overestimated. As a consequent, in the principle component analysis, the variability of the data in the main component becomes biger than as expected. To cope this condition, one can use robust estimator, i.e. MVE and MCD. Using simulation of Monte Carlo Experiments, the Principal Component Analysis  using estimator MCD has the better performance than the estimator MVE and also classic estimator.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1365</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 2, No 8 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1365/1126</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/757</identifier>
				<datestamp>2011-01-10T02:33:45Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGARUH SUATU DATA OBSERVASI DALAM MENGESTIMASI PARAMETER MODEL REGRESI</dc:title>
	<dc:creator>Utami, Herni</dc:creator>
	<dc:creator>I, Ruri</dc:creator>
	<dc:creator>abdurrakhman, abdurrakhman</dc:creator>
	<dc:description xml:lang="en-US">Observasi yang mempengaruhi model regresi sedemikian hingga elipsoid konfidensi untuk estimasi parameter regresinya menjadi kecil apabila observasi tersebut “dihilangkan” adalah observasi penting.  Sehingga observasi penting tersebut bisa merupakan observasi berpengaruh sesungguhnya atau bisa juga sebagai outlier. Salah satu cara menentukan observasi ke-i penting atau tidak, melihat  elipsoid konfidensi parameter model regresi linear dengan “menghilangkan”  observasi tersebut.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/757</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 3 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/757/616</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1397</identifier>
				<datestamp>2012-01-26T04:33:15Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROBLEM ELIMINASI CUT  PADA LOGIKA LBB’Ink</dc:title>
	<dc:creator>Surarso, Bayu</dc:creator>
	<dc:description xml:lang="en-US">In the present paper we study the problem of  the cut elimination in logics LBB’Ink , i.e. logics obtained from LBB’I by adding a rule called (n®k) rule. It is known that  the cut elimination theorem for LBB’I and its standard extensions can be proved using some modifications of the method used by Gentzen in 1935 to prove the cut elimination theorem for Intuitionistic Logic. We extend the modifications to show that LBB’Ink  enjoy the cut elimination theorem when k=1. On the  other side, we give a counter example sequent to show that the cut elimination theorem does not work for  LBB’Ink  when k&gt;1.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1397</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 3 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1397/1161</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/845</identifier>
				<datestamp>2023-02-27T19:53:02Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">VALUATION OF LONG TERM CARE (LTC)  HEALTH INSURANCE CONTRACT USING MULTISTATE MODEL</dc:title>
	<dc:creator>Effendi, Adhitya Ronie</dc:creator>
	<dc:description xml:lang="en-US">In this paper, we are using multistate model to evaluate Long Term Care (LTC) health insurance contract. Some products in LTC contract such as stand alone Annuity, LTC as a rider benefit, Enhanced pension and Insurance package are discussed. We use Discrete Time Markov Chains (DTMC) to model health status of each of the patients. Every time, a patient is exposed to one of the status that already set in the status space, for example: health, ill and death. We also consider evaluating premiums and reserves generated by this model which also useful for the practioneers and insurance companies.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/845</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/845/1177</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/downloadSuppFile/845/12942</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/4907</identifier>
				<datestamp>2013-05-14T03:50:24Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SIFAT-SIFAT ISOMORFISMA GRAF FUZZY PADA GRAF FUZZY KUAT</dc:title>
	<dc:creator>Handayani, Anik</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:description xml:lang="en-US">Fuzzy graph is a graph consists pairs of vertex and edge that have degree of membership containing closed interval of real number [0,1] on each edge and vertex. A fuzzy graph  is said to be a strong fuzzy graph if degree of membership edge  with the same minimum degree of membership vertex  and degree of membership vertex  for each edge   with . In this paper describes the properties of fuzzy graphs isomorphism include weak isomorphism, co-weak isomorphism, and isomorphism on strong fuzzy graph.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/4907</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 15, No 1 (2012): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/4907/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1317</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGGUNAAN BEBERAPA TEORI MATRIKS DALAM TEORI GRAF</dc:title>
	<dc:creator>Amir, Amir Kamal</dc:creator>
	<dc:description xml:lang="en-US">In a simple graf G, two veritces u and v are called adjacent in G if {u,v} ia an edge of G. The adjacency matrix A of G is the n x n zero-one matrix with 1 as its (i,j)th entry when vi and vj are adjacent, and 0 as its (i,j)th entry when they are not  adjacent. In this paper will be described the characteristic of characteristic polynomial of a graph. Moreover, the relationship between the characteristic polynomial of a graph with characteristic polynomial of its subgraph will also be outlined. In addition, will also be described the shape of eigenvalues and eigenvectors of certain graph.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1317</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1317/1080</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12267</identifier>
				<datestamp>2016-10-11T04:47:39Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">STRATEGI DASAR PENGENDALIAN MULTI ROBOT APUNG  DAN MANFAATNYA</dc:title>
	<dc:creator>Tjahjana, Redemtus Heru</dc:creator>
	<dc:description xml:lang="en-US">This paper describes floating multi-robot control strategies. Exposure starts from inspiration and the use of floating multi-robot in daily life, especially in the industrial world. Furthermore, with the model of multi-robot and functional model that describe the state of the cost to be met the floating robots, floating multi-robot control designed with optimal control strategy. The design of optimal control is done through the Pontryagin Maximum Principle, brings the model to a system of equations consisting of state equations and costate equations. In the system of states equations, each having initial and final condition, in the costate equations system has no requirements at all. The next problem is converted to the initial value problem and search for the approximate initial condition equation of state auxiliary systems which has no requirements using a modified method of steepest descent. Thus, the control of multi-robot successfully performed and the simulation results presented on the results and discussion.   </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12267</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 1 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12267/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/624</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">FUZZY MODEL BASED SOLVING NONLINEAR SYSTEMS WITH CASE STUDY OF  TRUCK-TRAILER SYSTEM</dc:title>
	<dc:creator>sasongko, priyo Sidik</dc:creator>
	<dc:creator>indriyati, Indriyati</dc:creator>
	<dc:creator>sarwoko, Eko adi</dc:creator>
	<dc:description xml:lang="en-US"> In this paper, we consider the fuzzy controller problem for nonlinear system using fuzzy models. The controller is constructed using a design model of the dynamical process to be controlled. The design model obtained from the truth model using a fuzzy modeling approach. The Takagi-Sugeno fuzzy model is adopted for fuzzy modeling of the nonlinear system. The truth model represents a detailed description of the process dynamic. The model is used in a simulation to evaluate the performance of the controller design. Stabilization of the closed-loop discrete Takagi-Sugeno systems using the well-known PDC (Paralel Distributed Compensation) technique is investigated. The design procedure we adopt is to convert the design of the controller to a Linear Matrix Inequality (LMI) problem so that the stability of the whole system can be assured.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/624</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/624/1187</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1356</identifier>
				<datestamp>2012-01-25T05:12:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Perbandingan Grafik Pengendali Moving Average dan Geometric Moving Average pada Data Berkelompok</dc:title>
	<dc:creator>sudarno, sudarno</dc:creator>
	<dc:description xml:lang="en-US">Untuk mengetahui proses produksi sudah memenuhi standar mutu dapat menggunakan grafik pengendali mutu. Pemilihan dan penggunaan metode pengendali mutu yang benar akan menghasilkan keputusan yang optimal. Dalam tulisan ini akan dibandingkan dua metode untuk perubahan nilai yang kecil, yaitu grafik pengendali moving average dan grafik pengendali geometric moving average pada masalah kekentalan cat. Dengan mengetahui sifat-sifat yang dihasilkan oleh masing-masing grafik tersebut dan membandingkannya, maka dapat dipilih salah satu dari metode tersebut lebih baik dari metode lainnya. Sehingga metode yang lebih baik itu diharapkan dipakai pada masalah yang serupa, agar didapat keputusan yang lebih akurat.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1356</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 3 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1356/1117</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15284</identifier>
				<datestamp>2017-07-21T04:14:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE URUTAN PARSIAL UNTUK MENYELESAIKAN MASALAH PROGRAM LINIER FUZZY TIDAK PENUH</dc:title>
	<dc:creator>Jiwangga, Sesar Sukma</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:description xml:lang="en-US">Not fully fuzzylinear programming problem have two shapes of objecyive function. that is triangular fuzzy number and trapezoidal fuzzy number. The decision variables and constants right segment only has a triangular fuzzy number. Partial order method can be used to solve not fully fuzzy linear programming problem with decision variables and constants right segment are triangular fuzzy number. The crisp optimal objective function value generated from the partial order method.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15284</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 32-37</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15284/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/723</identifier>
				<datestamp>2010-12-22T06:42:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENDIDIKAN MATEMATIKA PADA ERA OTONOMI DAERAH :PROFIL KURIKULUM, PARADIGMA PEMBELAJARAN DAN PENGADAAN BUKU AJAR</dc:title>
	<dc:creator>Asikin, Mohammad</dc:creator>
	<dc:description xml:lang="en-US">PENDIDIKAN MATEMATIKA PADA ERA OTONOMI DAERAH : PROFIL KURIKULUM, PARADIGMA PEMBELAJARAN DAN PENGADAAN BUKU AJAR[1][2]  [1]  Makalah disajikan dalam Seminar Nasional  Dalam Rangka Konferda Himpunan Matematika Indonesia Wilayah Jateng dan DIY di UNDIP Semarang, 9 Maret 2002  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/723</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 2 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/723/579</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1388</identifier>
				<datestamp>2012-01-26T01:32:56Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SINGULARITAS JUMLAHAN SOLUSI FUNDAMENTAL  PERSAMAAN DIFUSI DALAM PEMODELAN TRANSFER MASSA</dc:title>
	<dc:creator>Cahyono, Edi</dc:creator>
	<dc:creator>Kartono, Kartono</dc:creator>
	<dc:description xml:lang="en-US">This paper discusses the sum of fundamental solutions of 2-D diffusion equation (for constant diffusion rate). Although a linear diffusion equation is considered, the sum of fundamental solutions is not automatically a solution. This is because of the presence of a singularity at the origin O. In this paper, it will be shown that the sum of fundamental solutions is a solution of the primitive of diffusion equation, diffusion equation in an integral form. It is also shown that the sum of fundamental solutions represents mass tranfer process caused by a source that impulsively releases  some amount of mass.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1388</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 2 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1388/1152</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3878</identifier>
				<datestamp>2012-08-09T04:19:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KESTABILAN SISTEM KONTROL JARINGAN TERHADAP WAKTU TUNDA</dc:title>
	<dc:creator>br. Ginting, Juliana</dc:creator>
	<dc:creator>widowati, widowati</dc:creator>
	<dc:description xml:lang="en-US">. In this paper, we proposed the stability analysis of networked control system with time delay. Delay in a network is something that can not be avoided when transmitted digital data over control devices. Network control system is discussed here consists of clock driven sensor, event driven controller, actuator, and plant. In the network control system usually contains delays and sampling period with effect the system stability. Stability region in a network control system can be represented through the relationship between Maximum Allowable Transfer Interval and sampling period.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3878</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 3 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3878/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/868</identifier>
				<datestamp>2011-04-21T07:27:21Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BANACH LATTICE  YANG MEMUAT cO</dc:title>
	<dc:creator>Farikhin, Farikhin</dc:creator>
	<dc:description xml:lang="en-US">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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/868</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 2 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/868/738</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12257</identifier>
				<datestamp>2016-10-11T04:00:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SEMIGRUP – Γ YANG DIBANGKITKAN DARI SUATU SEMIGRUP</dc:title>
	<dc:creator>Sumanto, Y.D</dc:creator>
	<dc:description xml:lang="en-US">Every Element  on semigroup   can be regarded as binary operation on . Furthermore every element semigroup  can be defined a binary operation on , if   is set of binary operation that is defined from element semigroup , then  can be formed become semigroup .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12257</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12257/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/613</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">STRATEGI MODEL PENGENDALIAN PENYEBARAN VIRUS INFLUENZA</dc:title>
	<dc:creator>Pratiwi, Noviana</dc:creator>
	<dc:creator>kartono, Kartono</dc:creator>
	<dc:description xml:lang="en-US">Influenza or more popular is called flu is a kind of disease caused by virus which infect system of respiratory. Virus of influenza spread by direct contact with a host, so it is needed a quarantine and isolate program to rein it. By quarantine and isolate, formulation of reproduction number are made, by then is to determine a strategy to rein the virus. As a verification of formula obtained, we study the avian influenza at Central Java on September 2005 – April 2008.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/613</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/613/483</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1347</identifier>
				<datestamp>2012-01-25T04:58:23Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ALGORITMA GENETIKA UNTUK PENYELESAIAN MASALAH VEHICLE ROUTING</dc:title>
	<dc:creator>sarwadi, Sarwadi</dc:creator>
	<dc:creator>Krismi, Anjar</dc:creator>
	<dc:description xml:lang="en-US">Masalah vehicle routing (VRP) merupakan suatu permasalahan penting yang terdapat pada sistem transportasi yang bertujuan meminimalkan total jarak tempuh supaya biaya pengoperasian kendaraan minimal. Masalah vehicle routing termasuk ke dalam kelas NP-hard yang pada umumnya menggunakan pendekatan heuristik untuk mencari solusinya. Algoritma genetika merupakan salah satu metode heuristik yang analog dengan proses evolusi alam dengan tahap seleksi, crossover dan mutasi. Pada tulisan ini simulasi dilakukan dengan mencari solusi dari beberapa kasus VRP dengan jumlah titik N = 10 sampai dengan N = 100. Selanjutnya solusi dari kasus tersebut dibandingkan dengan hasil yang diperoleh dengan menggunakan Metode Saving. Hasil perbandingan memperlihatkan bahwa solusi yang dihasilkan algoritma genetika mempunyai kualitas lebih baik untuk jumlah titik yang kecil.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1347</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 2 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1347/1108</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/13543</identifier>
				<datestamp>2017-03-02T04:45:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">APLIKASI INVERS GRUP  PADA KARAKTERISASI INVERS MOORE PENROSE</dc:title>
	<dc:creator>SRRM, Titi Udjiani</dc:creator>
	<dc:description xml:lang="en-US">Let  be a ring with identity and equipped with  involution &quot; &quot;. If  is element of  and has the Moore Penrose inverse, then  and  also have the  Moore Penrose inverse. This paper  found thatMoore Penrose inverse of is the same with the group inverse of   Also the Moore Penrose inverse of  is the same with the group inverse of Then the results of this  investigation  are  used to   discusse the characteristic of the Moore Penrose inverse of elements in  through the group inverse .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-03-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/13543</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 3 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/13543/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/708</identifier>
				<datestamp>2010-12-21T05:35:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EFEK DISKRITASI METODE GALERKIN SEMI DISKRET TERHADAP AKURASI DARI SOLUSI MODEL RAMBATAN PANAS TANPA SUKU KONVEKSI</dc:title>
	<dc:creator>kushartantya, Kushartantya</dc:creator>
	<dc:creator>kurniastuti, Awalina</dc:creator>
	<dc:description xml:lang="en-US">Penelitian ini bertujuan menyelidiki efek diskretisasi terhadap akurasi dari solusi model rambatan panas tanpa suku konveksi menggunakan diskretisasi perubah ruang metode Galerkin Semi Diskret. Dalam penelitian ini sebagai indicator akurasi diambil nilai error (error maksimum). Untuk menentukan akurasi tersebut sebagai pembanding digunakan diskretisasi perubah ruang metode Beda Hingga. Permasalahan yang akan diteliti disini adalah bagaimana mentransformasikan model rambatan panas tanpa suku konveksi kebentuk sistem persamaan diferensial ordiner dengan melakukan diskretisasi pada perubah ruang dengan menggunakan metode Galerkin Semi Diskret. Selanjutnya system persamaan diferensial ordiner yang diperoleh dari diskretisasi tersebut diintegrasikan dengan menggunakan metode Runge Kutta Implisit Diagonal (RKID). Error diperoleh dari selisih solusi persamaan diferensial ordiner dengan solusi sebenarnya yang dihitung pada titik yang sesuai. Hasil pengukuran menunjukkan bahwa solusi model rambatan panas tanpa suku konveksi yang diperoleh berdasarkan diskretisasi, perubah ruang menggunakan metode Galerkin Semi Diskret relatif lebih akurat dibandingkan dengan solusi yang diperoleh dengan diskretisasi perubah ruang menggunakan metode Beda Hingga.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/708</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 3 (2001): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/708/570</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1379</identifier>
				<datestamp>2012-01-25T07:12:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OPTIMASI PRODUKSI DAN PENGENDALIAN BAHAN BAKU STUDI KASUS PADA PT. JOSHUA INDO EXPORT</dc:title>
	<dc:creator>Susanto, Tedy</dc:creator>
	<dc:creator>Sarwadi, Sarwadi</dc:creator>
	<dc:description xml:lang="en-US">Production optimization and inventory control on raw materials are among the main problem in company’s management. These two issues are the subjets of this article. This article is a case study on a furniture exporter company PT.Joshua Indo Export, where the data was collected. The aim of this article is to compare the policy in the production and inventory control on raw materials in the company with the one which is the result of its optimization. We use Economic Order Quantity (EOQ) model to optimize the production and inventory control on raw materials in the company. The computation and the analysis produce a policy which show that there are some saving in the cost of production and the inventory compared with the currently implemented policy.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1379</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 1 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1379/1142</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/784</identifier>
				<datestamp>2011-01-19T07:34:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL PERAMBATAN PANAS PADA PROSES PENGERINGAN BALOK KAYU</dc:title>
	<dc:creator>Cahyono, Edi</dc:creator>
	<dc:creator>Solekan, Solekan</dc:creator>
	<dc:description xml:lang="en-US">Tulisan ini membahas aplikasi persamaan panas pada proses pengeringan balok kayu, yang sering digunakan pada industri mebel. Solusi dari model ini dapat digunakan untuk memprediksi panas di pusat balok. Informasi ini penting untuk menentukan efisiensi proses pengeringan di ruangan pengering (kiln chamber), yaitu untuk menjawab kapan proses ini dari sudut pandang kualitas dan ekonomi dapat dihentikan. Meneruskan proses yang sudah cukup, akan mengeluarkan banyak energi, yang meningkatkan biaya. Sedangkan menghentikan proses di mana kayu belum cukup kering akan mengakibatkan kayu bengkok setelah beberapa lama. Kalau hal ini terjadi, akan sangat menurunkan kualitas mebel yang dihasilkan, khususnya mebel dengan ukiran yang berkualitas tinggi.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/784</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 3 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/784/645</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/859</identifier>
				<datestamp>2011-04-21T02:17:12Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGGUNAAN REGRESI LOGISTIK STEPWISE DAN ALGORITMA GENETIKA DALAM PEMILIHAN RASIO KEUANGAN YANG BERPENGARUH TERHADAP RATING ISSUER</dc:title>
	<dc:creator>wibowo, wahyu</dc:creator>
	<dc:creator>kurniawan, gangsar</dc:creator>
	<dc:description xml:lang="en-US"> Obligation is one of the financial instruments that can be traded in stock exchange.  To help investors, an obligation has rating that shows its prospect.  Obligation rating is influenced by many factors.  This research will study the effects of financial ratio to rating.  Unfortunately, there are many financial ratios that influence rating, so selection to financial ratio must be done.  For this purpose, two methods will be applied, i.e stepwise logistics regression and genetics algorithm-artificial neural network.  The result shows, that for stepwise logistic regression correctly gives classification 71%, and genetics algorithm 100% training data. For testing data, both methods give the same result, 62% correctly.  Genetics algorithm results selected financial ratio more better than stepwise logistic regression.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/859</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 1 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/859/729</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12252</identifier>
				<datestamp>2016-10-11T03:29:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PELABELAN GRACEFUL SISI BERARAH  PADA GRAF GABUNGAN GRAF SIKEL DAN GRAF STAR</dc:title>
	<dc:creator>Octafiani, Putri</dc:creator>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:description xml:lang="en-US">Let G is simple and finite graph. Graph G is called a directed edge-gracefull graph  if there exists an orientation of G and bijective map  f : A(G) → {1,2, ..., q} such as a map g on V defined by g(v) = [f +(v) – f –(v)] (mod p) is bijective map, which is  f +(v) is the sum of the labels of arcs with v as a head and  f –(v) is the sum of the labels of all arc with v as a tail.  Graph with directed edge-gracefull labeling is called directed edge-gracefull graph. In this paper we will discussed about directed edge-gracefull labeling of cycle and star related graph</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12252</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 16, No 1 (2013): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12252/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12252/pdf_1</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1334</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">K–ALJABAR HIPER</dc:title>
	<dc:creator>Suryoto, Suryoto</dc:creator>
	<dc:description xml:lang="en-US">In this paper will be introduced a form of hyper algebraic structure called a hyper K-algebra and proved the main properties of this algebraic structure. By utilizing the concept of scalar element and simple property of this structure, will be reviewedthe specified forms of this structure and equivalency of them, corresponding to implicative conditions (weak, strong). The discussion only at the structure of hyper algebra of orderthree</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1334</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1334/1098</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12281</identifier>
				<datestamp>2016-10-11T05:32:44Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENDEKATAN PEMROGRAMAN MULTIOBJEKTIF INTERAKTIF UNTUK MENYELESAIKAN MASALAH ALOKASI ASET OPTIMAL DAN STUDI KASUS PADA LIMA SEKURITAS DI INDONESIA</dc:title>
	<dc:creator>., Sutrisno</dc:creator>
	<dc:creator>Munawarroh, Dita Anies</dc:creator>
	<dc:description xml:lang="en-US">. In this paper, we use an interactive multiobjective programming approach to solve an optimal asset allocation problem. This problem contains two objective functions which are function of expected return that will be maximized and function of risk that will be minimized. We gives a case study for this problem to find the optimal asset allocation for five securities in Indonesia. The approachmentthat was used in this paper gives the percentage of each of the given five securities that gives the optimalexpected return and the optimal risk</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12281</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 3 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12281/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/681</identifier>
				<datestamp>2010-12-20T04:37:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENANGANAN MULTIKOLINEARITAS (KEKOLINEARAN GANDA) DENGAN ANALISIS REGRESI KOMPONEN UTAMA</dc:title>
	<dc:creator>Widiharih, Tatik</dc:creator>
	<dc:description xml:lang="en-US">Multikolinearitas yang tinggi diantara peubah-peubah bebas, mengakibatkan pendugaan dengan metode kuadrat terkecil tidak dapat diandalkan, ditandai dengan koefisien regresi tidak nyata dan adanya multikolinieritas. Pendeteksian multikolinearitas dapat dilakukan secara informal salah satunya dengan koefisien korelasi lenear antar peubah bebas maupun dengan cara formal dengan faktor inflasi ragam. Analisis regresi komponen utama digunakan untuk menghilangkan multikolinieritas dan semua peubah bebas masuk dalam model, analisis regresi ini merupakan teknik analisis regresi yang dikombinasikan dengan teknik analisis komponen utama . Analisis komponen utama bertujuan menyederhanakan peubah yang diamati dengan mereduksi dimensinya , hal ini dilakukan dengan jalan menghilangkan korelasi diantara peubah-peubah melalui transformasi . Teknik analisis komponen utama dijadikan sebagai tahap analisis antara untuk memperoleh hasil akhir dalam analisis regresi.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/681</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 2 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/681/545</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1370</identifier>
				<datestamp>2012-01-25T06:25:05Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PEMETAAN AREA PELAYANAN DAN JARINGAN PT. PLN (PERSERO) DISTRIBUSI JAWA TIMUR BERDASARKAN GOLONGAN PELANGGARAN PELANGGAN</dc:title>
	<dc:creator>Akbar, Muhammad Sjahid Akbar Sjahid</dc:creator>
	<dc:creator>Amin, Saiful</dc:creator>
	<dc:description xml:lang="en-US">PT. PLN (Persero) East Java Distribution (PLN Jatim) is one of the biggest providing electrics companies in East Java. Electrics is very important need  for people. If PLN experiences some financial losses, then the society will sufter from the impact. One of the causes of PLN losses is the illegal usage of the electricity by some customers.  PLN Jatim has recorded five categories of cutomer violation. The research aimed is to know the position of service area and the network (APJ) based on the violation category. This research uses Cross Tabulation Analysis method and Correspondence Analysis method. The Result shows that Malang and Situbondo’s APJs tend to be A violation category. Mojokerto and Kediri’s APJs tend to be B violation category Banyuwangi, Jember and Pamekasan’s APJs tend to be C violation category. Madiun, Pasuruan and Sidoarjo’s APJs tend to be D violation category. Gresik’s APJs tend to be E violation category.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1370</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 2, No 8 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1370/1131</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/764</identifier>
				<datestamp>2011-01-11T05:07:33Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGARUH  GRAVITASI  DAN  TEGANGAN  PERMUKAAN PADA  ALIRAN FLUIDA DI  ATAS  GUNDUKAN  DALAM  SALURAN TERBUKA*</dc:title>
	<dc:creator>Widodo, Basuki</dc:creator>
	<dc:description xml:lang="en-US">Pada makalah ini dikembangkan Teknik  Integral Batas (TIB) untuk mengetahui pengaruh gravitasi dan tegangan permukaan pada aliran fluida di atas gundukan dalam saluran yang mana aliran fluidanya dalam dua-dimensi, tak-mampu-mampat, tak-berputar dan tak-kental. Bentuk penyelesaiannya adalah sistem persamaan integral-batas yang berasal dari teknik Riemann-Hilbert untuk masalah batas campuran dari fungsi analitis.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/764</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 1 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/764/625</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3869</identifier>
				<datestamp>2012-08-09T03:39:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KAITAN ANTARA SUPLEMEN SUATU MODUL  DAN EKSISTENSI AMPLOP PROYEKTIF MODUL FAKTORNYA DALAM KATEGORI [M]</dc:title>
	<dc:creator>., Fitriani</dc:creator>
	<dc:description xml:lang="en-US">Let M be an R-module and N Î s[M]. A projective module P with a superfluous epimorphism p : P ® N is called projective cover of N in s[M]. Even if there are enough projective module in s[M], a module need not have a projective cover. To get projective cover, we need supplement which do not always exist. In this paper, we will investigate relation between supplement of a module M and existence projective cover of a factor module of M.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-12-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3869</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 3 (2011): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3869/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/850</identifier>
				<datestamp>2012-01-30T05:04:00Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OPTIMAL GROVES MECHANISM AND OPTIMAL MECHANISM DESIGN</dc:title>
	<dc:creator>Purisha, Zenith</dc:creator>
	<dc:description xml:lang="en-US">In this paper we will discuss about mechanisms design, the mechanisms used to implement optimal market structure with private fixed cost of N firms. The discussion includes definitions, goal, concepts, basic assumptions of mechanism, properties of feasible mechanism, Revenue Equivalence Theorem, and Groves mechanism. Moreover, we discuss the optimal Groves mechanism and optimal mechanism. There are two things involved in both mechanisms, those are social welfare and tax revenue.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/850</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/850/1183</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12370</identifier>
				<datestamp>2016-10-21T01:25:28Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISA KESTABILAN MODEL MATEMATIKA UNTUK PENYEMBUHAN KANKER MENGGUNAKAN ONCOLYTIC VIROTHERAPY</dc:title>
	<dc:creator>Novellina, Via</dc:creator>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:creator>., Widowati</dc:creator>
	<dc:description xml:lang="en-US">Oncolytic virotherapy is one type of cancer treatment using oncolytic virus. In this paper, we will present a mathematical model for treatment of cancer using  oncolytic virotherapy with the burst size of a virus (the number of new viruses released from lysis of an infected cell) and we considering the presence of syncytia which is a fusion between infected tumor cell and uninfected tumor cell. In this mathematical model we introduced the population of uninfected tumor cells which fusion in syncytia. So, in this model contains four population, which are, uninfected tumor cell population, infected tumor cell population, uninfected tumor cell population which fusion in syncytia, and free virus particles which are outside cells. Then, these models are analyzed to determine the stability of the equilibrium points. The stability of the equilibrium points criteria is based on basic reproduction number () and we show that there exist a disease free equilibrium point and a disease endemic equilibrium point. By the Routh-Hurwitz criterion of stability, we prove that the disease free equilibrium point is locally asymptotically stable if  and the disease endemic equilibrium point is locally asymptotically stable if . In this numerical simulations using software Maple we have, if  then the graphic of this mathematical model will reach the disease free equilibrium point, then virotherapy fails. While, if  then the graphic of this mathematical model will reach the disease endemic equilibrium point, then virotherapy success.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12370</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 2 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12370/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1322</identifier>
				<datestamp>2012-02-16T06:37:48Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SISTEM INFORMASI GEOGRAFIS PENCARIAN RUTE OPTIMUM OBYEK WISATA KOTA YOGYAKARTA DENGAN ALGORITMA FLOYD-WARSHALL</dc:title>
	<dc:creator>Saputra, Ragil</dc:creator>
	<dc:description xml:lang="en-US">The Information system based on spatial or Geographic Information System (GIS) is growing faster. GIS can be used to solve many problems, one of the solutions that GIS could address is for look optimum route base on start location and destination. By using GIS, user can get visual information. This research is implementing Floyd-Warshall algoritm for optimize route in Yogyakarta. Floyd-Warshall algoritm is part of dynamic programming which used for seek shorthes paths for every node/ verteks. The result of GIS application, it can beimplemented to determine the shortest path. The optimum shortes path information can help us to go to our destination faster.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1322</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1322/1085</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12272</identifier>
				<datestamp>2016-10-11T05:13:30Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESSENTIALLY SMALL RIEMANN SUMS FUNGSI TERINTEGRAL HENSTOCK-DUNFORD PADA [a,b]</dc:title>
	<dc:creator>., Solikhin</dc:creator>
	<dc:creator>Sumanto, Y.D</dc:creator>
	<dc:creator>Khabibah, Siti</dc:creator>
	<dc:description xml:lang="en-US">In this paper we study Henstock-Dunford integral on [a,b]. We discuss some properties of the integrable. We shall define essentially small Riemann sums (ESRS)  and show that it is necessary and sufficient condition for function to be Henstock-Dunford integral on [a,b].</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12272</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 2 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12272/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/629</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ASURANSI KESEHATAN KUMPULAN UNTUK PERAWATAN RUMAH SAKIT</dc:title>
	<dc:creator>munadi, MUnadi</dc:creator>
	<dc:creator>sunarsih, Sunarsih</dc:creator>
	<dc:description xml:lang="en-US">Health insurance is a guarantee to minimize financial loss from sickness. Group health insurance spital care is health insurance. Health insurance used for Pegawai Negeri Sipil (PNS) and retering PNS and TNI/Polri and also their family that called ASKES service insurance. Computation hospital health insurance premiums affected by age and sex, also use Daily Hospital Benefit table for group health insurance, while ASKES service premiums based on class and work time and the computation and fixed by Departemen Keuangan Republik Indonesia. To difference between group health insurance premiums with ASKES service premiums for hospital care is grat 1:7.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/629</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA; 61-69</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/629/1192</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1361</identifier>
				<datestamp>2012-01-25T05:31:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KETAHANAN WATERMARKING TERHADAP SERANGAN KOMPRESI JPEG</dc:title>
	<dc:creator>Sugiharto, Aris</dc:creator>
	<dc:creator>Wibawa, Helmie Arif</dc:creator>
	<dc:description xml:lang="en-US">Watermarking is one of the methods that proposed to protected digital data from illegally copy.  A lot of technic to destroy watermarking that inserted to digital data, one of them are JPEG compression. In this research will be focus as far JPEG compression can influence watermarking integrated especially at similarity test before and after digital data have JPEG compression attact.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1361</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 1 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1361/1122</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/753</identifier>
				<datestamp>2011-01-10T02:33:45Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGAJARAN MATEMATIKA SEKOLAH DENGAN KELOMPOK-KECIL DAN PERSEORANGAN (MODEL KKP)</dc:title>
	<dc:creator>Jaeng, Maxinus</dc:creator>
	<dc:description xml:lang="en-US">Dalam proses pembelajaran di kelas, biasanya terjadi aktivitas guru dan siswa agar terlaksana proses pembelajaran yang efektif dan efisien. Aktivitas kelompok-kecil dan perseorangan, diawali dengan aktivitas kelompok-menyeluruh (kelas). Aktivitas kelompok-menyeluruh digunakan untuk membentuk siswa memperoleh informasi fakta-fakta, gambaran umum, rangkaian-rangkaian komponen yang menyusun basis-pengetahuan (pengetahuan prasyarat plus). Agar terjadi interaksi guru-siswa dan siswa-siswa, maka digunakan model pembelajaran dengan variasi kelompok kecil dan perseorangan (Model KKP). Variasi pembelajaran dengan model KKP dilaksanakan melalui kegiatan sebagai berikut: (1) Kegiatan awal : Guru memberi informasi tentang model pembelajaran, guru mengorganisasikan siswa ke dalam kelompok-kecil (4 orang), menyampaikan TPK, informasi latar belakang pentingnya pelajaran , informasi materi prasyarat, dan memberi motivasi kepada siswa. (2) Kegiaan Inti : Guru menyajikan materi kepada siswa. mendemonstrasi dan memberi tugas latihan terbimbing, selanjutnya memberi tugas latihan mandiri (perseoranan) dan latihan kelompok kecil secara bergantian. Tugas perseorangan pertama untuk memberikan latihan persiapan diri segingga dapat berpartisipasi dalam kelompok. Dalam kelompok kecil ini siswa bekerja bersama-sama mengerjakan tugas lanjutan lain secara kolaboratif. Sesudah kerja sama dalam kelompak, siswa secara perseorangan mengerjakan tugas (kuis) mandiri. Kegiatan ini untuk melihat unjuk kerja siswa secara perseorangan yang akan menjadi sumbangan kepada kelompok danuntuik melihat poin peningkatan perseorangn.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/753</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 3 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/753/612</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1393</identifier>
				<datestamp>2012-01-26T01:55:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PEMILIHAN ARSITEKTUR OPTIMAL MODEL NN DENGAN METODE KONTRIBUSI INCREMENT</dc:title>
	<dc:creator>Wuryandari, Triastuti</dc:creator>
	<dc:description xml:lang="en-US">Neural Network is an information processing system that has certain characteristic in common with biological neural network. In development NN has been many applied in several surface, one of them is for forecasting. For the best application of NN, architecture has determined. One of methode to get optimal architecture NN is incremental contribution methods. This methods will to determine the size of hidden and input cell in the network with excluding respectively. One of the unit cell with a low incremental contribution will be exclution from network. The result shows that the incremental contribution methods is capable reducing the size of the network is propozed, so getting optimal architecture from network.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1393</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 3 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1393/1157</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/789</identifier>
				<datestamp>2011-01-19T07:34:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE SIMPLEKS PRIMAL MENGGUNAKAN WORKING BASIS</dc:title>
	<dc:creator>sunarsih, Sunarsih</dc:creator>
	<dc:creator>Ramdani, Ahmad Khairul</dc:creator>
	<dc:description xml:lang="en-US">Program linier yang mensyaratkan nilai variabelnya terbatas, maka fungsi tujuannya sanagat bergantung pada nilai variabel tersebut. Fungsi tujuan optimal mensyaratkan nilai variabel memenuhi batas-batasnya. Untuk menyelesaikan program linier ini, metode simpleks dimodifikasi sedemikian hingga didapatkan solusi optimal yang kemudian dikenal sebagai “metode simpleks primal menggunakan working basis”. Pencarian solusi basis fisibel dilakukan jika tiga kriteria optimalitas terpenuhi yaitu koefisien fungsi tujuan bernilai negatif variabelnya akan bernilai sama dengan batas atasnya, bernilai positif variabelnya akan bernilai sama dengan nol dan untuk variabel tanpa batas atas koefisien fungsi tujuannya non negatif.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/789</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 3 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/789/650</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/4903</identifier>
				<datestamp>2013-05-14T03:50:24Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MATRIKS JORDAN DAN APLIKASINYA PADA SISTEM LINIER WAKTU DISKRIT</dc:title>
	<dc:creator>., Soleha</dc:creator>
	<dc:creator>Setyawati, Dian Winda</dc:creator>
	<dc:description xml:lang="en-US">Matrix  is diagonalizable (similar with matrix diagonal) if and only if the sum of geometric multiplicities of its eigenvalues is n.If we search for an upper triangular form that is nearly diagonal as possible but is still attainable by similarity for every matrix, especially the sum of geometric multiplicities of its eigenvalues is less than n, the result is the Jordan canonical form, which is denoted by  , and  . In this paper, will be described how to get matrix S(in order to get matrix    ) by using generalized eigenvector. In addition, it will also describe the Jordan canonical form and its properties, and some observation and application on discrete time linear system.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/4903</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 15, No 1 (2012): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/4903/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1313</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TEOREMAINTERPOLASI UNTUK LOGIKA PREDIKAT SUBSTRUKTUR DENGAN ATURAN MINGLE</dc:title>
	<dc:creator>surarso, Bayu</dc:creator>
	<dc:description xml:lang="en-US">It is known that the interpolation theorem for Full Lambek Substructural Logic and its standard extensions can be proved using proof-theoretical methods. In fact, they can be proved by a well known method called Maehara’s method, or its modifications. In the present paper, by proving the cut elimination theorem and then using a modification of  Maehara’s method, we prove the interpolation problem for logics obtaining from some standard extensions of Full Lambek Logic by adding rule called mingle.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1313</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1313/1076</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12263</identifier>
				<datestamp>2016-10-11T04:46:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KESTABILAN MODEL SUSCEPTIBLE VACCINATED INFECTED RECOVERED (SVIR) PADA PENYEBARAN PENYAKIT  CAMPAK (MEASLES) (Studi Kasus di Kota Semarang)</dc:title>
	<dc:creator>Haryati, Melita</dc:creator>
	<dc:creator>., Kartono</dc:creator>
	<dc:creator>., Sunarsih</dc:creator>
	<dc:description xml:lang="en-US">Measles is the disease that caused by paramixovirus that infected to the humans by direct contact with infected person. Measles in Semarang was still as endemic disease. The aim of this study is analyze the SVIR (Susceptible Vaccinated Invected Recovered) model of the spread of Measles. This model is a system of nonlinear differential equation which solved by numerical solution with Euler’s method. The study use the data from Semarang Health Department, from the SVIR model generated                                                   , disease free equlibrium    . If the vaccination rate is increasing, so susceptible people will be decreased and increasing the recovered people. Based on the result of analysis SVIR model in the strategy to control the spread of Measles can be done by developing the program of Measles’ vaccination.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12263</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 1 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12263/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/618</identifier>
				<datestamp>2013-05-29T04:32:36Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODIFIKASI MODEL PENJALARAN GELOMBANG MULTI ARAH</dc:title>
	<dc:creator>Marwan, Marwan</dc:creator>
	<dc:description xml:lang="en-US">In this paper we derived a modification of the model of waves evolution in two-directional spatial coordinates. Using KP equation as the basic model, we improved dispersive property in spatial x coordinate and named it as improved KP (iKP) equation. iKP has an exact dispersion relation in spatial x coordinate. Using this model, we derived second order regular waves and  analyzed the expression of Maximum Temporal Amplitude.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/618</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 1 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/618/488</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1352</identifier>
				<datestamp>2012-01-25T04:58:23Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL ASIMETRIS GABUNGAN INVENTORY DAN ROUTING UNTUK MINIMISASI HARGA KOMODITI</dc:title>
	<dc:creator>sarwadi, Sarwadi</dc:creator>
	<dc:creator>hariyanto, susilo</dc:creator>
	<dc:description xml:lang="en-US">Dalam penelitian ini, akan dirumuskan suatu model matematik yang merupakan gabungan antara masalah inventory dan routing. Model dibangun  dengan memperhatikan sifat asimetris matrik jarak antar kota. Masalah ini diselesaikan dengan menggunakan teori graph. Perumusan masalah dinyatakan ke model Mixed Integer Linier Programming. Model ini disusun untuk kasus minimisasi suatu harga komoditi. Selanjutnya, model yang dibangun dikaji karakteristik-karakteristiknya untuk membuktikan kesahihannya, sehingga diperoleh suatu model MILP yang valid untuk permasalahan inventory dan routing.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1352</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 2 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1352/1113</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15281</identifier>
				<datestamp>2017-07-21T04:14:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISA KINERJA SISTEM KONTROL DISKRIT CHAOS LUP TERBUKA DAN TERTUTUP DENGAN PENGENDALI IMPULSIF</dc:title>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:creator>Widowati, Widowati</dc:creator>
	<dc:creator>Munawwaroh, Dita Anies</dc:creator>
	<dc:creator>Asnawi, Yuliyan Hambyah</dc:creator>
	<dc:description xml:lang="en-US">tability the discrete chaotic systems is interesting to be discussed, given that chaos is closely related to random and irregular state. Stability of discrete chaotic system can be obtained using impulsive control law and applying Lyapunov stability theory. So it can show sufficient conditions for the design of impulsive controllers and  globally exponentially set-stable can be reached. Based on the results of the impulsive  control, it is seen that the behavior of chaos in a discrete chaos system which originally the trajectory are irregular, can be control and become stable, and there is a globally exponentially attracting set earned in the system. The numerical simulation on the discrete chaotic system is presented to illustrate the effectiveness of the obtained results from control impulsive.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-07-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15281</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 8-14</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15281/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/713</identifier>
				<datestamp>2010-12-21T06:17:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">IMPLEMENTASI  OTONOMI DAERAH BIDANG PENDIDIKAN DAN DAMPAKNYA TERHADAP PEMBELAJARAN MATEMATIKA SEKOLAH</dc:title>
	<dc:creator>Suyitno, Amin</dc:creator>
	<dc:description xml:lang="en-US">Genderang otonomi daerah telah ditabuh. Dampak pengiringnya juga telah mulai dirasakan. Di bidang pendidikan, paling tidak, telah mulai dikenalkan Manajemen Peningkatan Mutu Berbasis Sekolah, program akselerasi, otonomi sekolah dalam penerimaan siswa SLTP karena dihapuskannya Ebtanas SD / MI, sulitnya guru pindah ke luar kota, dan juga munculnya pahlawan pendidikan di daerah yang tidak merasa perlu melibatkan atasan atau pihak akademisi di PT. Dasar pelaksanaan otonomi daerah bidang pendidikan adalah pasal 11 ayat (2) UU No. 22 / 1999 tentang Pemerintah daerah, yang berbunyi “Bidang pemerintahan yang wajib dilaksanakan oleh Daerah Kabupaten dan Daerah Kota meliputi pekerjaan umum, kesehatan, pendidikan dan kebudayaan, dll”, dan operasionalnya oleh PP No. 25 / 2000 Pasal 2 ayat (11) yang antara lain menyatakan bahwa kewenangan pusat adalah mengatur penetapan kurikulum nasional dan evaluasinya, serta penetapan standar materi pelajaran pokok. Dampak yang mungkin terjadi karena implementasi otonomi daerah bidang pendidikan, khususnya dalam pembelajaran matematika antara lain sebagai berikut. (1) Bisa muncul anggapan bahwa karena era otonomi maka pengajaran matematika mutlak di tangan guru termasuk pengaturan kurikulumnya, jelas ini perlu diluruskan. (2) Karena otonomi maka tak ada ebtanas, yang berarti guru matematika tidak perlu lagi dituntut kerja keras meraih NEM tinggi bagi anak didiknya. Akibatnya, salah satu tolok ukur kinerja guru menjadi hilang. Dalam hal ini, perlu dicari model tes yang sejenis dengan ebtanas. (3) Pemahaman yang benar tentang PP No. 25 / 2000 Pasal 2 ayat (11) yang menyatakan bahwa kewenangan pusat adalah mengatur penetapan kurikulum nasional dan evaluasinya, serta penetapan standar materi pelajaran pokok, dan guru memiliki otonomi dalam cara pembelajarannya. Jika pemahaman ini merata di kalangan guru, maka keberhasilan pengajaran matematika sekolah tak perlu dikawatirkan. Hal ini perlu disosialisasikan. Di lain pihak, kemajuan teknologi di dunia internasional semakin pesat. Agar dicapai mutu pendidikan dengan standar internasional, maka penanganan pendidikan di Indonesia perlu ditata secara nasional. Apalagi, matematika bersifat universal.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/713</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 1 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/713/575</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1384</identifier>
				<datestamp>2012-01-26T01:32:56Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESTIMASI PARAMETER REGRESI TERPOTONG KIRI DENGAN METODE MAKSIMUM LIKELIHOOD</dc:title>
	<dc:creator>Pratiwi, Ratna</dc:creator>
	<dc:creator>Ispriyanti, Dwi</dc:creator>
	<dc:description xml:lang="en-US">Left truncated regression model is a regression model which the parameters prevailed for the dependent variable values y &gt; a, with a is a left truncation point that is choosen according to the experiment goals, and a is also the observation object itself at once. Thus, truncated regression model is more correct if it is used for the experiment that oriented on a specific characteristic of the observation object, that is dependent variable. The distribution that is used for this regression model is normal left truncated distribution. Estimation of regression parameters used Maksimum Likelihood method with Newton’s iteratif method.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1384</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 2 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1384/1148</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3874</identifier>
				<datestamp>2012-08-09T03:39:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ALGORITMA MENENTUKAN HIMPUNAN TERBESAR  DARI SUATU MATRIKS INTERVAL DALAM ALJABAR MAX-PLUS</dc:title>
	<dc:creator>Novitasari, Ratna</dc:creator>
	<dc:description xml:lang="en-US">This research discussed about how to obtained largest set from an interval matrix if given a possible eigen vector. For obtained the largest set, we would doing some iteration and then determined the best algorithm.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3874</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 3 (2011): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3874/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/864</identifier>
				<datestamp>2011-04-21T02:17:12Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE UNWEIGHTED MEANS UNTUK FAKTORIAL   TAK SEIMBANG  DISPROPORSIONAL</dc:title>
	<dc:creator>WURYANDARI, TRIASTUTI</dc:creator>
	<dc:description xml:lang="en-US">A factorial design should be used when there are several factors of interest in experiment. The problem which arises when the factorial experiment does not contain equal sized samples in the cells is that the design is nonorthogonal. In other words, the total sums of squares in the ANOVA table cannot be decomposed into a series of additive components which permit the analysis of the separate effect. There are possible situations when the cell sample sized are unequal, allocated proportionately or disproportionately. On the allocated disproportionately, approximate F test using the method of unweighted means.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/864</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 1 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/864/734</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12247</identifier>
				<datestamp>2016-10-11T03:28:25Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PATH KUAT TERKUAT DAN JARAK KUAT TERKUAT DALAM  GRAF FUZZY</dc:title>
	<dc:creator>Ekawati, Lusia Dini</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:description xml:lang="en-US">Fuzzy graph is a graph consists pair of vertex and edge that have degree of membership containing closed interval of real number [0,1] on each node and edge. A graph fuzzy   is connected if the strength of connectedness between nodes u and v larger than zero for each . This paper will be explained about ss-path and ss-distance. Strongest stong path (ss-path) between two nodes in connected fuzzy graph if path is a strongest path as well as strong path. If G is a connected fuzzy graph then for each  there exists a strongest strong path for u to v . While ss-distane between two nodes u and v in connected fuzzy graph as the reciprocal of  the strength of connectedness between nodes u and v. Using metric can be known that every connected fuzzy graph is ss-selfcentered</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12247</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 16, No 1 (2013): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12247/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12247/pdf_1</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12247/pdf_2</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/609</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">GEOMETRI PROYEKTIF PG(2, pn) UNTUK MEMBENTUK RANCANGAN BLOK TIDAK LENGKAP SEIMBANG SIMETRIS</dc:title>
	<dc:creator>H, Yuni</dc:creator>
	<dc:creator>Bambang, Irawanto</dc:creator>
	<dc:description xml:lang="en-US">A Symmetric Balanced Incomplete Block design with parameters  is Balanced Incomplete Block (BIB) design with  and . Projective geometry PG (2, pn) is the finite geometry of two dimensions over the Galois Field GF(pn). Projective geometry PG (2, pn) can be used to construct symmetric BIB design if the points of PG(2, pn) are assumed same with the object of symmetric BIB design and the lines which contain the points from PG(2, pn) same with the blocks of symmetric BIB design.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/609</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/609/478</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1343</identifier>
				<datestamp>2012-01-25T04:43:58Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TAKSIRAN UMUR SISTEM DENGAN UMUR KOMPONEN BERDISTRIBUSI SERAGAM</dc:title>
	<dc:creator>sudarno, sudarno</dc:creator>
	<dc:description xml:lang="en-US">Sistem yang dibentuk oleh beberapa komponen, rangkaiannya dapat secara seri atau paralel. Untuk mengetahui suatu sistem berfungsi atau tidak, dapat dilihat dari fungsi bentuk. Dari fungsi bentuk ini, fungsi reliabilitas sistem akan dapat ditentukan. Selanjutnya berdasarkan fungsi reliabilitas sistem, dapat diketahui umur sistem. Khusus dalam tulisan ini, umur komponennya diasumsikan berdistribusi seragam. Dengan mengetahui umur sistem, maka dapat ditentukan waktu garansi produk.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1343</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 1 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1343/1104</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12373</identifier>
				<datestamp>2016-10-21T01:26:20Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE KUMAR UNTUK MENYELESAIKAN PROGRAM LINIER FUZZY PENUH PADA MASALAH TRANSPORTASI FUZZY</dc:title>
	<dc:creator>S., Mohammad Ervan</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">In this paper, we discusses fully fuzzy linear programming in transportation problem. To find the fuzzy optimal solution of the problem with equality constraints, we use Kumar’s Method. The value of the fuzzy optimal solution obtained is used to find the optimal value of fuzzy objective function. Then do defuzzification to obtain crisp optimal solutions by using Ranking Function. To illustrate the Kumar’s Method, we give a example as iteration</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12373</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 2 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12373/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/704</identifier>
				<datestamp>2010-12-21T05:35:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">AUTOMORFISMA GRAPH</dc:title>
	<dc:creator>Suryoto, Suryoto</dc:creator>
	<dc:description xml:lang="en-US">Automorfisma dari graph sederhana G adalah suatu permutasi P dari himpunan titik – titik dari G yang bersifat mengawetkan ketetanggaan. Misalkan A matriks ketetanggaan dari G, maka syarat perlu dan cukup P suatu automorfisma adalah berlakunya hubungan PA = AP, dengan P adalah matriks (permutasi) penyajian dari P. Pada tulisan ini hanya akan dikaji graph transitif titik dan graph transitif sisi dengan memanfaatkan konsep aksi dan orbit dari suatu grup. Diperlihatkan juga bahwa kedua tipe graph di atas saling bebas, yaitu bahwa graph transitif titik belum tentu transitif sisi demikian juga berlaku sebaliknya, graph transitif sisi tidak harus berakibat graphnya transitif titik.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/704</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 3 (2001): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/704/566</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1375</identifier>
				<datestamp>2012-01-25T06:51:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL LOGIT KUMULATIF UNTUK RESPON ORDINAL</dc:title>
	<dc:creator>Raharjanti, Robiah Peni Raharjanti</dc:creator>
	<dc:creator>Widiharih, Tatik</dc:creator>
	<dc:description xml:lang="en-US">Logit cumulative model is used to discribe the relationship between a response variable and one or more explanatory variables which response variable is of ordinal scale. To estimate the parameters, use maximum likelihood method with Newton Raphson iteration. Testing for the significance of the coefficients is done to fit the model. Test for overall significance of the variables in the model is performed by likelihood ratio test and test on individual coefficient is done using Wald’s test</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1375</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 3 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1375/1138</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/769</identifier>
				<datestamp>2011-01-11T05:10:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">DISTRIBUSI WAKTU BERHENTI PADA PROSES PEMBAHARUAN</dc:title>
	<dc:creator>sudarno, Sudarno</dc:creator>
	<dc:description xml:lang="en-US">Dalam proses stokhastik yang mana kejadian dapat muncul kembali membentuk proses pembahauruan. Proses pembaharuan adalah proses menghitung dengan variabel acaknya bernilai intejer dan kejadiannya dapat terulang lagi. Pada proses pembaharuan akan muncul waktu berhenti, yaitu waktu suatu proses selesai dan disambung dengan proses yang baru berikutnya. Distribusi waktu berhenti merupakan selisih konvolusi dari distribusinya. Menurut persamaan Wald bahwa nilai harapan waktu berhenti sama dengan ekspektasi waktu tunggu dibagi dengan rataannya. Sedangkan persamaan Wald dapat dipakai bilamana rataannya berhingga.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/769</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 2 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/769/630</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/855</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MENYELESAIKAN SISTEM PERSAMAAN LINIER MENGGUNAKAN ANALISIS SVD</dc:title>
	<dc:creator>ahmad, irdam haidir</dc:creator>
	<dc:creator>ratnasari, lucia</dc:creator>
	<dc:description xml:lang="en-US">Linear equation system, Ax = b, may be consistent or inconsistent. The approximate solution of  inconsistent of linear equation system can be determined. Gauss elimination or Gauss-Jordan elimination can be used to determine the solution of the consistent of linear equation system, but can’t for the inconsistent of linear equation system. Singular Value Decomposition (SVD) is matrix factorization method that closely associated with the singular value of the matrix. SVD analysis can be used to determined the orthonormal bases for the four fundamental subspaces associated with matrix A. That bases can be used to compute thesolution of the consistent and inconsistent of  linear equation system.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/855</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/855/725</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12244</identifier>
				<datestamp>2016-10-11T02:44:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KEKONVERGENAN BARISAN FUNGSI TERINTEGRAL HENSTOCK-DUNFORD PADA [a,b]</dc:title>
	<dc:creator>., Solikhin</dc:creator>
	<dc:creator>Zaki, Solichin</dc:creator>
	<dc:creator>Tjahjana, Redemtus Heru</dc:creator>
	<dc:description xml:lang="en-US">Artikel ini membahas tentang kekonvergenan barisan fungsi yang terintegral Henstock-Dunford pada [a,b]. Dalam hal ini dikaji syarat cukup agar limit barisan nilai integral suatu fungsi terintegral Henstock-Dunford sama dengan limit barisan fungsinya. Diperoleh bahwa  untuk menjamin fungsi                                                    terintegral Henstock-Dunford dan limit barisannya sama dengan nilai fungsinya maka barisan fungsi yang terintegral Henstock-Dunford harus konvergen seragam atau barisan fungsi yang terintegral Henstock-Dunford harus konvergen lemah dan monoton lemah serta limitnya ada, atau barisan fungsinya konvergen lemah dan terbatas.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12244</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 1 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12244/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1330</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ON THE BREAKING OF GENERATED WAVES RUNNING IN STILL WATER</dc:title>
	<dc:creator>Kusumawinahyu, W.M. Kusumawinahyu</dc:creator>
	<dc:description xml:lang="en-US">This research is motivated by the requirement of hydrodynamics laboratories to generate extreme waves for testing ships in steep, large amplitude wave fields. For this purpose, finding criteria that determine if wave breaking will occur is important. Different from initial value problems, in this contribution we will consider the signaling problem: a time signal is prescribed to a wave maker in a wave tank that produces propagating waves running in initially still water. The aim is to observe the resulting nonlinear effects on the waves and to study in which cases the waves will or will not break. This also leads to a threshold value for generated waves, and, moreover, to the location in the tank where wave breaking may occur. To study this, we consider Bichromatic waves and Benjamin Feir-waves, and investigate the evolution by using a numerical simulation code HUBRIS developed by Westhuis; the validity of this code has been tested against laboratory experiments. The result of our investigations is that for both classes the parameters of wave breaking are more extreme in the signaling case than in the case of initial value problem.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1330</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1330/1093</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12279</identifier>
				<datestamp>2016-10-11T05:31:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">GRUP GAMMA PADA KELAS-KELAS EKUIVALENSI  G(S)</dc:title>
	<dc:creator>Sumanto, Y.D</dc:creator>
	<dc:description xml:lang="en-US">Finite set S with n element can be operated by   binary operation. In this paper if    is set of binary operation on S that formed as a group, then    can be partioned as unintersection classes and every class can be construct as over S.   </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12279</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 3 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12279/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/674</identifier>
				<datestamp>2010-12-17T05:42:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KETERHUBUNGAN GALOIS FIELD DAN LAPANGAN PEMISAH</dc:title>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿﻿In this paper, it was learned of the necessary and sufficient condition for finite field with pn elements, p prime and n ³ 1 an integer. A field F is an extention field of a field K if K subfield F. The extension field F of field K is Splitting field of collection polinomial { fi (x) | i Î I } of K if F smallest subfield containing K and all the zeros in of the polinomial fi(x). The zeros of polinomial fi(x) are elements of field F and the elements of F is finite then F is finite field (Galois fileld). F is finite with pn elements, p prime and n ³ 1 an integer if only if F is Splitting field of  - x over Zp.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/674</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 1 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/674/541</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1366</identifier>
				<datestamp>2012-01-25T06:25:05Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENENTUAN UNIT HIDDEN OPTIMAL PADA MODEL NEURAL NETWORK DENGAN ANALISIS KONTRIBUSI INCREMENTAL SEL</dc:title>
	<dc:creator>Budi, Warsito</dc:creator>
	<dc:description xml:lang="en-US">This paper discusses about choosing the optimal number of hidden units at neural network models which is applied to the Composite Stock Price Index data in Surabaya Stock Exchange. One of the problem in fitting NN models is  an NN model which fits well may give poor out-of-sample forecasts. Thus it is required traditional methods such as ACF and PACF to select a good NN model, e.g. to select appropiate lagged variables as the ‘inputs’. The Incremental Contribution of Cells methods which belong to the general-to-specific procedure is used to choose the optimal number of hidden units. The size and topology of networks is selected by reducing the size of the network through the use of kuadratic correlation coefficients and graphical analysis of network output for every  hidden layer cell. The resulted of NN model is compared with models with different architecture those obtain from the Box-Jenkins methods. The Akaike’s Information Criterion and Schwartz Bayesian Criterion are used for comparing different models.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1366</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 2, No 8 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1366/1127</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/758</identifier>
				<datestamp>2011-01-10T02:33:45Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SOLUSI MASALAH KNAPSACK COLLAPSING DENGAN PENDEKATAN MASALAH KNAPSACK BAKU DAN PROGRAM DINAMIK</dc:title>
	<dc:creator>indarsih, Indarsih</dc:creator>
	<dc:creator>widodo, widodo</dc:creator>
	<dc:description xml:lang="en-US">Masalah knapsack collapsing merupakan generalisasi masalah knapsack 0-1. Kapasitas pada masalah knapsack collapsing merupakan fungsi turun ( non-increasing function ) atas jumlah item yang dimuat. Masalah ini dapat diselesaikan dengan dua pendekatan, yaitu : reduksi ke masalah knapsack 0-1 dan pendekatan program dinamik. Masalah knapsack collapsing dapat diselesaikan dalam waktu pseudo-polinomial dengan kedua algoritma tersebut. Kedua algoritma tersebut akan diimplementasikan ke program dalam bahasa Pascal/C. Data instance yang diberikan akan dijalankan pada kedua program tersebut. Kemudian waktu tempuhnya dicatat. Eksperimen komputasi membuktikan bahwa kedua algoritma tersebut efisien.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/758</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 3 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/758/617</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1398</identifier>
				<datestamp>2012-01-26T04:33:15Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TERAPAN FUNGSI DENSITAS EMPIRIK DENGAN PENDEKATAN DERET FOURIER UNTUK ESTIMASI DIAGRAM PENGENDALI KUALITAS</dc:title>
	<dc:creator>Santoso, Rukun</dc:creator>
	<dc:description xml:lang="en-US">Any continues function on the Hilbert space L2[-p,p] can be represented as Fourier series. By this fact, a density function can be estimated by Fourier series as estimator of continues function on L2[-p,p]. Further, this function estimator will be used to derive process parameters that needed on the control quality chart design  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1398</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 3 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1398/1162</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/846</identifier>
				<datestamp>2012-01-30T05:04:00Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">INTEGRASI NUMERIK MENGGUNAKAN METODE GAUS KUADRATUR DENGAN PENDEKATAN INTERPOLASI HERMIT DAN POLINOMIAL LEGENDRE</dc:title>
	<dc:creator>sutrisno, Sutrisno</dc:creator>
	<dc:creator>Soelistyo, R. Heri</dc:creator>
	<dc:description xml:lang="en-US">Gaus Quadrature Formula is better alternative than Newton Cotes Formula. The principal of Gaus Quadrature Formula determine unequal interval to minimize the error of approximation of integration. Formulation Gaus Quadrature on limited interval for numerical integration can use Hermite Interpolation Formula. Then, using the properties of Legendre polynomial which orthogonal on [-1,1] can determined nodes and weights. So, based on nodes and weight can be determined a Gaus – Legendre Quadratur Formula.           </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/846</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/846/1179</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/4908</identifier>
				<datestamp>2013-05-14T03:50:24Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROGRAM APLIKASI KEAMANAN CITRA DENGAN ALGORITMA DES   DAN TRANSFORMASI WAVELET  DISKRIT</dc:title>
	<dc:creator>Solichin, Zaki</dc:creator>
	<dc:creator>Bayu, Surarso</dc:creator>
	<dc:creator>Sarwoko, Eko Adi</dc:creator>
	<dc:description xml:lang="en-US">Application program security image using DES cryptographic algorithm and discrete wavelet transform is an application program that is used to secure image transmission through the Internet. Manufacturing processes are as follows, first is to make the program application for image encryption ciphertext is a program that is used to transform the initial image into the form of a compressed image using advanced discrete wavelet transform (DWT) and the Haar filter, then encrypt image transformation results with using the DES encryption algorithm specified by the encryption key, the encrypted form of information in the form of ciphertext. The second process is the process for making an application program to restore the initial image into the form ciphertext, the ciphertext decrypt the encrypted image and the particular key (the key with encryption) using DES decryption algorithm, the decrypted image, then decrypted form of the image is brought back into form initial image using inverse discrete wavelet transformation (IDWT) and reconstruction program.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/4908</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 15, No 1 (2012): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/4908/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1318</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">HIMPUNAN SEMI BUKA DALAM RUANG TOPOLOGI</dc:title>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:description xml:lang="en-US">For study this paper we required about topological space, in particular the topology on the real numbers, while for assessing semi-open set are expected to know about an open set, closed set, closure (closure) set, interior sets, etc.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1318</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1318/1081</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12268</identifier>
				<datestamp>2016-10-11T04:48:08Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PELABELAN GRACEFUL SISI-GANJIL  PADA GRAF WEB W(2,n)</dc:title>
	<dc:creator>Rizky, Putri Dentya</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:creator>., Djuwandi</dc:creator>
	<dc:description xml:lang="en-US">Let G = (V(G),E(𝐺)) be a graph with vertex set 𝑉(𝐺) and edge set 𝐸(𝐺). Assume that graph G have 𝑞 edge. Graceful edge-odd labeling is a bijective map  𝑓 ∶ 𝐸(𝐺) →  {1, 3, 5,…,2𝑞 – 1} that resulting map 𝑓+ : 𝑉(𝐺) → {0,1,2,…,2𝑞 −1} with                                                   such as obtained different edge label. Graph G ia called Graceful edge-odd labeling if there is graceful edge-odd labeling on G. Let     and     are two cycle graph with vertex set     and    . Graph     is obtained by conected every vertex from     to      such as we have edge     Graph Web W(2,n) is a graph obtained by adding a pendant edge on each outer cycle vertex from graph    . In this paper we will discussed about Graceful edge-odd labeling on Web (2,𝑛) graph and we have that Web W(2,𝑛) graph is graceful edge odd graph for n odd.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12268</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 1 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12268/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/625</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MATRIKS INVERS MOORE-PENROSE DALAM PENYELESAIAN SISTEM PERSAMAAN LINIER</dc:title>
	<dc:creator>R., IDA M.</dc:creator>
	<dc:creator>Udjiani, Titi</dc:creator>
	<dc:description xml:lang="en-US">In this paper we define and study about The Moore Penrose Inverse of any matrices under the rank. We apply our result to study of Solution Linear Equation Sistem  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/625</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/625/1188</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1357</identifier>
				<datestamp>2012-01-25T05:12:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">UJI LINEARITAS DATA TIME SERIES DENGAN RESET TEST</dc:title>
	<dc:creator>Budi, Warsito</dc:creator>
	<dc:creator>Ispriyanti, Dwi</dc:creator>
	<dc:description xml:lang="en-US">  Tulisan ini membahas prosedur pengujian linearitas data time series menggunakan uji RESET test versi Ramsey dan Lagrange Multiplier. Uji yang digunakan adalah uji yang telah diperbaiki dengan pembentukan komponen utama dari bentuk polinomial pada persamaan uji. Prosedur uji kemudian diterapkan pada data simulasi untuk model linear AR(2), AR(2) dengan outlier dan model nonlinear  LSTAR(2) dengan n = 200. Pengujian menunjukkan hasil yang mirip diantara kedua uji dimana data simulasi dari model linear tidak menjamin kelinearan, sedangkan data simulasi model nonlinear secara signifikan berbentuk nonlinear pada taraf 5%.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1357</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 3 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1357/1118</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15311</identifier>
				<datestamp>2017-07-21T04:14:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL DINAMIK TRANSMISIPENYAKIT HEPATITIS B TANPA KEKEBALAN</dc:title>
	<dc:creator>Rumariyanti, Atik</dc:creator>
	<dc:creator>Kartono, Kartono</dc:creator>
	<dc:creator>Sutrisno, Sutrisno</dc:creator>
	<dc:description xml:lang="en-US">Liver is an important organ for humans. One of the liver disease that received both national and international attention is caused by Hepatitis B. Hepatitis B has the first rank in term of number and spread which it is transmitted through blood or body fluids. In this paper, we discussthe mathematical model in facing Hepatitis B spread.Firstly, we formulate the dynamics of Hepatitis B spread by dividing the population into five classes namely susceptible, exposed, infected, carrier and recovered subpopulation. By using the basic reproduction number value,we analyze the spread of Hepatitis B. From the result, the increasing of the recover rate for infected and carrier subpopulation and the decreasing of infected individu are the best strategy in order to make the rate of Hepatitis B spread is decreasing.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15311</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 38-44</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15311/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/724</identifier>
				<datestamp>2010-12-22T06:42:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MENUJU KEMANDIRIAN LEMBAGA PENDIDIKAN</dc:title>
	<dc:creator>Soedjoko, Edy</dc:creator>
	<dc:description xml:lang="en-US">Lahirnya undang-undang tentang otonomi daerah telah membawa kehidupan baru dalam penyelenggaraan pemerintahan daerah. Pada sektor pendidikan, tuntutan perubahan juga bergulir sejalan dengan arus perubahan di sektor-sektor lain. Salah satu isu perubahan dalam sistem pendidikan adalah desentralisasi pendidikan dalam konteks kebijakan otonomi daerah yang luas. Sesuai dengan PP No.60 dan PP No.61/1999, empat PTN yaitu UI, ITB, IPB, dan UGM dijadikan pilot projeck otonomi PTN. Statusnya menjadi badan hukum  seperti Perusahaan Umum (Perum) atau BHBN (Badan Hukum Milik Negara). Status pegawai menjadi  PU (Pegawai Universitas). Pimpinan PTN bertanggung jawab kepada Majelis Wali Amanat (Board of Trustees). Di bidang akademik Pimpinan PTN bertanggung jawab kepada kepada Senat Akademik. Untuk menghindari konflik manajemen perlu aturan jelas dan adil antara PTN dan PTS. Implementasi konsep otonomi pendidikan tingkat sekolah dilakukan melalui School Based Managemen (SBM) dilaksanakan melalui termi-nologi Manajemen Peningktan Mutu Berbasis Sekolah (MPMBS). Beberapa masalah implementasi otonomi pendidikan adalah  capacity building, transparansi manajemen, akuntabilitas, tarik menarik kepentingan, dan kesenjangan anggaran pendidikan.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/724</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 2 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/724/580</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1389</identifier>
				<datestamp>2012-01-26T01:55:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EFISIENSI SISTEM BONUS MALUS SEBAGAI MODEL RANTAI MARKOV</dc:title>
	<dc:creator>Supandi, Supandi</dc:creator>
	<dc:description xml:lang="en-US">. Developed bonus malus system (BMS) is to make the premium paid by insured will be as closed as possible with expected occurrence of claim in every year basis. To study the efficiency of a BMS, we must previously observe the effect of claim frequency on value of premium. The efficiency of Bonus Malus System can be found through its Markov model; that is by found a stationary distribution in form of line vectors of its BMS Markov chain with its components as a function of claim frequency. In this paper, the BMS used is that of Brazil. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1389</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 3 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1389/1153</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3879</identifier>
				<datestamp>2012-08-09T04:19:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PELABELAN TOTAL TITIK AJAIB  PADA COMPLETE  GRAPH   DENGAN  n GANJIL</dc:title>
	<dc:creator>Irawati, Novi</dc:creator>
	<dc:creator>Soelistyo, Robertus Heri</dc:creator>
	<dc:description xml:lang="en-US">Let G be a graph consists of edges and vertex. A vertex-magic total labeling of a graph  is a bijection map of union edges and vertex to the integers such that there exists a positive integer  satisfying , for every elements of vertex. Then k  is called a magic constant and G is called vertex-magic total graph. In this article, we consider a vertex-magic labeling of complete graph  for odd with use an algorithm which is composed of a modified construction magic square algorithm.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3879</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 3 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3879/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/869</identifier>
				<datestamp>2011-04-21T07:27:21Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESTIMASI DATA HILANG PADA RANCANGAN ACAK KELOMPOK LENGKAP</dc:title>
	<dc:creator>widiharih, Tatik</dc:creator>
	<dc:description xml:lang="en-US">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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/869</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 2 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/869/739</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12258</identifier>
				<datestamp>2019-02-01T02:56:31Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Application of Model Predictive Control to Reduce The Vibrationof Two Connected Buildings</dc:title>
	<dc:creator>Sutrisno, Sutrisno</dc:creator>
	<dc:creator>Munawarroh, Dita Anies</dc:creator>
	<dc:description xml:lang="en-US">In this paper, model predictive control (MPC) will be applied to reduce the vibration of two connected buildings (TCB) that can be caused by, for example, seismic activities. Mathematical model of TCB can be formulated as a linear time invariant state space equation. The state of this plant is the displacement of each building measured from the origin. We will regulate or bring the state to the origin as fast as possible with optimal control input. This optimal control input will be determined using MPC. We give a numerical simulation to observe how this control method is working. From the simulation result, MPC reduces the vibration of TCB and bring the displacement of each building to the origin faster than uncontrolled system.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12258</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12258/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/614</identifier>
				<datestamp>2013-05-29T04:32:36Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">NILAI DAN VEKTOR EIGEN MATRIKS INTERVAL ATAS ALJABAR MAX-PLUS</dc:title>
	<dc:creator>M, Dwi Suci</dc:creator>
	<dc:creator>suryoto., Suryoto</dc:creator>
	<dc:description xml:lang="en-US">An interval matrix A with given  and  is the set of all matrices  such that . Eigenvalue and eigenvector of A is called possible eigenvalue and eigenvector of an interval matrix </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/614</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 1 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/614/484</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1348</identifier>
				<datestamp>2012-01-25T04:58:23Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Perancangan dan Pengembangan Antarmuka Pengguna Berbasis Task Analysis Model</dc:title>
	<dc:creator>widodo, Aris Puji</dc:creator>
	<dc:description xml:lang="en-US">Pada makalah ini diuraikan mengenai perancangan dan pengembangan antarmuka pengguna berdasarkan task analysis model, yaitu berdasarkan kategori spesifikasi pekerjaan yang dilakukan oleh pengguna terhadap perangkat lunak .Model pengembangan yang digunakan adalah model lifecycle, yang meliputi tahapan pembentukan problem domain, task analysis yang direpresentasikan dengan struktur pohon yang selanjutnya dijabarkan menjadi urutan aksi penguna, dan task design yang meliputi task synthesis, task optimation, pengelompokan task, state transition dan perancangan dialog untuk setiap antarmuka pengguna.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1348</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 2 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1348/1109</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/13544</identifier>
				<datestamp>2017-03-02T04:45:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">NEUTROSOFIK LIMIT DAN PENGHITUNGANNYA</dc:title>
	<dc:creator>Suryoto, Suryoto</dc:creator>
	<dc:description xml:lang="en-US">Neutrosophic limit means the limit of a neutrosophic function. This article discusses the neutrosophic limit and the algebraic aspects related, including neutrosophic function, neutrosophic mereo-limit, neutrosophic limit and it’s calculation. The rules and the calculation method of neutrosophic limit similar to the rules and the method for calculating the classical limit, only the role of independent variables in the classical limit is taken over by a closed interval which is a subset of the set of real numbers. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-03-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/13544</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 3 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/13544/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/709</identifier>
				<datestamp>2010-12-21T06:17:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">APLIKASI OPTIMASI DINAMIS DENGAN PENDEKATAN MAXIMUM PRINCIPLE PADA PERTUMBUHAN EKONOMI DAERAH DAN ALOKASI PENDAPATAN BELANJA DAERAH</dc:title>
	<dc:creator>Supena, Yusup</dc:creator>
	<dc:creator>yayan, Yayan</dc:creator>
	<dc:description xml:lang="en-US">This papers derives a applied maximum principle for dynamic system regional development progam with continous lags, i.e. systems governed by integrodifferential equations. The result show that dynamic optimization technically is powerfull analysis to show optimization of government revenue practically.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/709</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 1 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/709/571</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1380</identifier>
				<datestamp>2012-01-25T07:12:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERANCANGAN MODEL PENDUKUNG KEPUTUSAN UNTUK  PENENTUAN LOKASI INDUSTRI BERDASARKAN  PROSES HIERARKI ANALITIK</dc:title>
	<dc:creator>Kusumaningrum, Retno</dc:creator>
	<dc:description xml:lang="en-US">The Analytic Hierarchy Process (AHP), a decision-making method based upon division of problem spaces into hierarchies. This paper looks at AHP as a tool used in determination of industrial location. Solution of AHP method finished with the iteration process of through at scheme of  Pascal computer program to assist the calculation process. From result of program device which have been made to be obtained the highest total priority value (TPV) was potential distribution and promotion track</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1380</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 1 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1380/1144</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/785</identifier>
				<datestamp>2011-01-19T07:34:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Transformasi Dokumen XML</dc:title>
	<dc:creator>Widodo, Aris Puji</dc:creator>
	<dc:description xml:lang="en-US">Dokumen Extensible Markup Language (XML) merupakan dokumen standar yang memiliki sifat menstrukturkan informasi, portable dan tidak tergantung pada satu platform tertentu, sehingga memberikan efisiensi dalam melakukan proses manipulasi informasi pada suatu dokumen. Pada makalah ini dibahas mengenai transformasi dokumen XML ke format dokumen lainnya dengan memanfaatkan Cocoon Framework, Parser dan sejumlah Prosesor XML Stylesheets Language (XSL) yang merupakan hasil open source project. Dokumen XML dibangkitkan melalui Generator, kemudian dokumen XML ditransformasikan ke dokumen lainnya melalui Transformer dengan menggunakan stylesheet untuk masing-masing format dokumen hasil transformasi. Dokumen XML dikumpulkan pada Aggregator dan selanjutnya dilakukan rendering terhadap dokumen XML melalui serializer untuk menghasilkan format dokumen lainnya, untuk dapat ditampilkan ke berbagai persentasi yang bervariasi.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/785</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 3 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/785/646</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3870</identifier>
				<datestamp>2012-08-09T03:39:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL REDUKSI PADA PARAMETER MARKOV</dc:title>
	<dc:creator>Farikhin, Farikhin</dc:creator>
	<dc:description xml:lang="en-US">As well known that the model reduction for large-scale linear dynamical systems based on Krylov subspace is called moments matching. In this method, one or more interpolation points is needed to construct  a certain Krylov subspace. In this paper, we propose the proof of theorem for moment matching at Markov parameter using the theorem which is obtained from standard block Arnoldi algorithm.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3870</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 3 (2011): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3870/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/860</identifier>
				<datestamp>2011-04-21T02:17:12Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGENDALI  LPV  POLYTOPIC  UNTUK  SISTEM  DENGAN  PARAMETER  BERUBAH-UBAH</dc:title>
	<dc:creator>widowati, widowati</dc:creator>
	<dc:description xml:lang="en-US">This paper proposes a polytopic LPV controller design for air craft lateral-directional dynamics. The state space matrices of the plant and the controller are represented by using polytopic linear parameter varying model. A controller synthesis is derived by an approach linear matrix inequalities evaluated at the 32 vertices of the polytopic model. From the simulation results, it can be show that a polytopic LPV controller can maintain the closed loop systems stability and performance.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/860</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 1 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/860/730</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12251</identifier>
				<datestamp>2016-10-11T03:29:08Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KONSTRUKSI, SIFAT DAN DIMENSI HIMPUNAN CANTOR MIDDLE THIRD</dc:title>
	<dc:creator>Alfiana, Khoiroh</dc:creator>
	<dc:creator>Khabibah, Siti</dc:creator>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:description xml:lang="en-US">This paper discussed about the construction of Cantor middle third set which is formed from unit interval                                                   . To construct the Cantor set, take a line and remove the middle third and remain two line segments. This Process is repeated infinite number of times. This process produces some interesting properties on Cantor middle third set, such as has uncountable many elements, contains no intervals, and is compact, perfect, and nowhere dense. By using Hausdorff dimension and self similar set, it discussed the dimension of Cantor middle third set which is a unique positive number</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12251</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 16, No 1 (2013): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12251/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12251/pdf_1</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1335</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL KALIBRASI DENGAN PENDEKATAN WAVELET DAN  PARTIAL LEAST SQUARE SERTA PENERAPANNYA DENGAN OSS-R</dc:title>
	<dc:creator>Ana, Elly</dc:creator>
	<dc:creator>chamnidah, Nur</dc:creator>
	<dc:creator>Saifudin, Toha</dc:creator>
	<dc:creator>Atiqi, Aniq</dc:creator>
	<dc:creator>Erfiana, Erfiana</dc:creator>
	<dc:description xml:lang="en-US">Determination process of active compound concentration which contained by a drug plant quantitatively and qualitative can know by HPLC (High Performance Liquid Chromatography) and FTIR (Fourier TrasformInfrared)  methods. Calibration aim to find relation between a group of size measure which is relative reached and cheap with a group of other size measure which is difficult and relative costly. Measurement of FTIR was done by nsampel at pwaves number. Based on these information, problems occur because the number of predictor bigger thanthe number of perception, so that require to reduce dimension. Discrete Wavelet Transform (DWT) can reduce dimension become new variables. with . But, result of reduction still have high collinearity between coefficients of wavelet.Partial Least Squares (PLS) can be the good solving for the problems. Combining of DWT and PLS methods on calibration models use OSS-R give a good criterion of model .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1335</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1335/1099</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12282</identifier>
				<datestamp>2016-10-11T05:33:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS KINERJA UNIT USAHA MENGGUNAKAN MODEL CCR (STUDI KASUS PADA APOTEK KIMIA FARMA SEMARANG)</dc:title>
	<dc:creator>Rahmania, Laily</dc:creator>
	<dc:creator>Farikhin, Farikhin</dc:creator>
	<dc:creator>Surarso, Bayu</dc:creator>
	<dc:description xml:lang="en-US">Data envelopment analysis (DEA) is a non-parametric technique for performace evaluation. In DEA context, we know two model which are CCR model and BCC model. With these model we break all of decision making units (DMU) into two classess, efficiency DMU and inefficiency DMU. In this note, we discuss CCR model and its application to evaluate DMU’s on Kimia Farma Semarang. Further, we find that dual problem is better than primal problem to evaluate effiency DMU.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12282</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 3 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12282/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/682</identifier>
				<datestamp>2010-12-20T04:37:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MATRIKS  HANKEL</dc:title>
	<dc:creator>Tjahjana, R. Heru</dc:creator>
	<dc:description xml:lang="en-US">In  this paper,  we talk  about Hankel  Operator and  Hankel Matrix. Operator Hg:F[z]®z-1F[[z-1]] defined by  Hg(f)=p_(gf) is called the Hankel Operator. Hankel Operator can be represented by a Hankel matrix.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/682</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 2 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/682/546</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1371</identifier>
				<datestamp>2012-01-25T06:51:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SOLUSI-SOLUSI PERIODIK PADA PERLUASAN FRACTIONAL  VAN-DER POL TAK LINEAR</dc:title>
	<dc:creator>Waluya, S Budi</dc:creator>
	<dc:description xml:lang="en-US">In this paper will be studied a Generalized Non Linear Rayleigh Oscillator. It will be shown that the recently developed perturbation method based on integrating factors can be used to approximate first integrals and periodic solutions. Not only approximations of first integrals will be given, but it will also be shown how in a rather efficient way the existence and stability of time-periodic solutions can be obtained from these approximations.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1371</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 3 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1371/1132</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/765</identifier>
				<datestamp>2011-01-11T05:07:33Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">¬¬MATRIKS STOKASTIK GANDA DAN SIFAT-SIFATNYA</dc:title>
	<dc:creator>suryoto, suryoto</dc:creator>
	<dc:description xml:lang="en-US">Suatu matriks tak negatif dikatakan stokastik ganda, jika jumlah entri-entri pada tiap baris dan tiap kolomnya sama dengan 1. Karakterisasi yang tampak dari matriks jenis ini adalah mempunyai entri pada diagonal yang positif dan diantara sifat penting dari matriks ini adalah perkalian antara matriks stokastik ganda menghasilkan matriks stokastik ganda lagi. Pada tulisan ini akan dibahas matriks stokastik ganda di atas beserta sifat-sifat pentingnya. Juga dipelajari hubungan matriks jenis ini dengan matriks orthostokastik dan matriks uniter-stokastik.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/765</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 1 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/765/626</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/851</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS MATEMATIKA PERBANDINGAN METODE DIVIDE &amp; BROADCAST DAN METODE DIVIDE &amp; PARTIAL BROADCAST</dc:title>
	<dc:creator>adam, Pasrun</dc:creator>
	<dc:creator>Cahyono, Edi</dc:creator>
	<dc:description xml:lang="en-US">In this article we discuss the comparison of Divide &amp; Broadcast Method (DBM) and Divide &amp; Partial Broadcast Method. Both are data processing methods. From mathematical point of view the methods are to seek a relation of two sets of a large amount of data, too large for one processor. The comparison is based on three basic computations of the matching of two sets i.e. multiplication, addition and logarithm. The comparison is to obtain the efficiency of the methods. Previous researches have shown that based on multiplication and addition DPBM is more efficient than DBM, but the result based on logarithm is still unknown. In this article we report our result on the comparison of DBM and DPBM based on logarithm computation.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/851</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/851/721</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12240</identifier>
				<datestamp>2016-10-11T02:44:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">APLIKASI SEMIGRUP OPERATOR LINEAR PADA PENYESELESAIAN  MASALAH CAUCHY ABSTRAK DEGENERATE HOMOGEN</dc:title>
	<dc:creator>Haryanto, Susilo</dc:creator>
	<dc:description xml:lang="en-US">In this article, we will investigate how to apply the linear operator semigroup to solve the abstract degenerate Cauchy problem. The problem is treated under  the assumption that the Hilbert space of the system can be written as a direct sum of  the kernel of M (KerM ) and the range of adjointM (RanM*). By certain assumptions this problem can be reduced into nondegenerate Cauchy problem. By assumptions the operator A is a infinitesimal generator, the canonic problem has a unique solution.  And then by using the particular operator, any solution of nondegenerate problem can be mapped to the solution of degenerate Cauchy problem.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12240</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 1 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12240/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1323</identifier>
				<datestamp>2012-02-16T06:37:48Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">AUTOMORFISMA GRAF WARNA CAYLEY  YANG DIBANGUN OLEH  SUATU  GRUPOID</dc:title>
	<dc:creator>Kristina Ningrum, Bety Dian</dc:creator>
	<dc:creator>Bambang, Irawanto</dc:creator>
	<dc:description xml:lang="en-US">Groupoid                                                    adalah suatu himpunan tak kosong yang tertutup terhadap operasi biner, himpunan generator     grupoid merupakan subset dari grupoid dimana setiap elemen grupoid dapat ditulis sebagai hasilkali berhingga pada elemen generator.Graph warna Cayley     digraph dengan titik-titiknya adalah     dan himpunan busurnya    . Generator grupoid befungsi sebagai warna dan arah busur digraph.Pemetaan     adalah pemetaan bijektif antara graph       dengan dirinya sendiri.. Automorphism parsial pada graph warna Cayley     adalah pemetaan bijektif antara dua tail graph warna Cayley    .  Himpunan Automorphisma Parsial graph warna  Cayley    adalah    </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1323</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1323/1086</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12273</identifier>
				<datestamp>2016-10-11T05:14:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENYELESAIAN MODEL DISTRIBUSI SUHU BUMI DI SEKITAR SUMUR PANAS BUMI DENGAN METODE KOEFISIEN TAK TENTU</dc:title>
	<dc:creator>Niswah, Lutfiyatun</dc:creator>
	<dc:creator>., Widowati</dc:creator>
	<dc:creator>., Djuwandi</dc:creator>
	<dc:description xml:lang="en-US">Mathematical model in this paper describes the formation temperature distribution related to the process of heat transfer in geothermal wellbore. The model of formation temperature is based on the single thermal conduction equation. The form of the model is ordinary differential equation. Further, we derived an analytical solution with the method of undetermined coeffisient. The simulation  is done to determine the model’s behavior based on the secondary data. Based  on the simulation result is found that if the increasing depth hence the temperature increases.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12273</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 2 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12273/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/670</identifier>
				<datestamp>2010-12-17T05:42:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENDEKATAN REGRESI POLINOMIAL ORTHOGONAL PADA RANCANGAN DUA FAKTOR (DENGAN APLIKASI SAS DAN MINITAB)</dc:title>
	<dc:creator>widiharih, Tatik</dc:creator>
	<dc:description xml:lang="en-US">            Pendekatan regresi polinomial orthogonal dapat dilakukan pada rancangan dengan faktor kuantitatif dan jarak antar taraf faktor sama. Pendekatan ini dilakukan bila peneliti ingin menentukan taraf faktor dari masing-masing faktor yang mengoptimalkan respon yang diamati. Penentuan derajat polinomial berdasarkan kontras-kontras orthogonal yang nyata (significant) dari masing-masing faktor, kemudian dapat ditemukan bentuk regresi pendekatannya. Persamaan yang diperoleh merupakan fungsi matematika dengan dua peubah. Dengan menggunakan hitung differensial dapat ditentukan titik ekstrem dari fungsi tersebut. Bila dikembalikan kebentuk rancangan berarti dapat ditentukan taraf faktor dari masing-masing faktor yang mengoptimalkan respon yang diamati.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/670</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 1 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/670/537</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1362</identifier>
				<datestamp>2012-01-25T05:31:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OPTIMASI KETEBALAN INSULATOR  PADA JARINGAN PIPA GEOTHERMAL</dc:title>
	<dc:creator>Isnani, Isnani</dc:creator>
	<dc:description xml:lang="en-US">Geothermal is one of cheap and huge energy resaources in Indonesia. Geothermal power supply generated by thermal steam, where is transmitted through geothermal pape line was usually built near  a geothermal source. To minimize heat losses pipe surface is patched by insulator. Furthermore to decide insulator thickness for optimum result, the mathematical model is applied. The insulator optimum thicknes  (5,733575488) is obtained the cost needed is $1488,373278</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1362</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 1 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1362/1123</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/754</identifier>
				<datestamp>2011-01-10T02:33:45Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TELAAH TENTANG BUKU AJAR UNTUK PEMBELAJARAN KALKULUS &quot;REFORMASI&quot;</dc:title>
	<dc:creator>harta, Idris</dc:creator>
	<dc:description xml:lang="en-US">Pada akhir tahun 1980-an muncul berbagai gerakan pembaharuan pembelajaran kalkulus perguruan tinggi Amerika Serikat.  Gerakan-gerakan tersebut akhirnya menghasilkan berbagai kurikulum atau program.  Makalah ini merupakan ulasan tentang buku ajar kalkulus &quot;reformasi&quot; yang ditulis dan diterbitkan oleh Clemson University.  Analisa meliputi managemen berbagai topik, berfikir matematis, penggunaan teknologi dan kegiatan menulis, serta pendekatan terhadap pedagogis dan penilaian.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/754</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 3 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/754/613</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1394</identifier>
				<datestamp>2012-01-26T01:55:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERANCANGAN DAN IMPLEMENTASI  PERANGKAT LUNAK SISTEM PENCOCOKAN SIDIK JARI  DENGAN ALGORITMA FILTERBANK GABOR</dc:title>
	<dc:creator>Widodo, Aris Puji</dc:creator>
	<dc:creator>Adi, Kusworo</dc:creator>
	<dc:description xml:lang="en-US">From research result used filterbank gabor algorithms, can give 96 (24 x 4) featurres from 24 sector with 4 filter. Gabor filter use 23 x 23 with orientation change 00, 450, 900, dan 1350. Each orientation angle change will be rotation gabor filter on to its. Make feature vector or FingerCode with Avarage Absolute Deviation (AAD) are average value from difference pixels number for each sector and centre value on sector. Error system on disjoint between FAR dan FRR with value 3,6% and threshold value 39. Then slope from GAR graphic value 400, this is proving that this system is running a good, cause slope recommendation value 450.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1394</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 3 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1394/1158</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/790</identifier>
				<datestamp>2011-01-19T07:34:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENURUNAN PERSAMAAN GELOMBANG SOLITON DENGAN DERET FOURIER ORDE DUA SECARA NUMERIK</dc:title>
	<dc:creator>sarwadi, sarwadi</dc:creator>
	<dc:description xml:lang="en-US">Salah satu solusi dari persamaan Korteweg - de  Vries (KdV) adalah gelombang soliton. KdV merupakan persamaan umum gelombang yang solusinya tidak selalu bisa diturunkan secara exact. Penelitian ini mengkaji teknik numerik untuk menurunkan persamaan gelombang soliton dari  persamaan KdV. Dengan MAPLE dibuat algoritma yang didasarkan pada minimisasi hamiltonian persamaan KdV atas suatu gelombang yang didekati dengan deret Fourier orde dua. Secara iteratif gelombang ini diperbaiki dengan menerapkan metode Steepest Descent dan kombinasi  Euler - Aitken.  Hasil  menunjukkan bahwa pendekatan deret Fourier orde dua cukup bagus dan teknik numeriknya valid (dibuktikan dengan paket WAVEPACT)  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/790</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 3 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/790/651</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/4904</identifier>
				<datestamp>2013-05-14T03:50:24Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BILANGAN DOMINASI DAN BILANGAN KEBEBASAN GRAF BIPARTIT KUBIK</dc:title>
	<dc:creator>Santoso, Budi</dc:creator>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:creator>S.U, Robertus Heri</dc:creator>
	<dc:description xml:lang="en-US">Let a graph    , is a pair of sets V vertices and set E edges. Let     be a subset of    . If each vertex of     is adjacent to atleast one vertex of    , then     is called a dominating set in    . The domination number of a graph     denoted as     is the minimum cardinality of a dominating set in    . A set of vertices in a graph is said to be an independent set if no two vertices in the set are adjacent. the number of vertices in the largest independent set of a graph     is called the independence number and denoted by    . In this final project, we consider the relation between independent set and dominating set of finite simple graphs. In particular, discuss them for some cubic bipartite graphs and find that the domination number    is less than     of the number of vertices and independence number     is half of the number of vertices.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/4904</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 15, No 1 (2012): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/4904/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1314</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ON SOLUTIONS OF THE DISCRETE-TIME ALGEBRAIC RICCATI EQUATION</dc:title>
	<dc:creator>Soleha, Soleha</dc:creator>
	<dc:description xml:lang="en-US">. On solving the optimal control for the linear discrete-time system based on quadratic performance indexes will be obtained the hermitian solutions of discrete-time algebraic Riccati equation. The existence of that solution can be identified by an invariant subspace which has certain properties. In this paper we investigate some properties of discrete-time algebraic Riccati equation related to an invariant subspace as steps to identify them.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1314</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1314/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12264</identifier>
				<datestamp>2016-10-11T04:46:33Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">HIMPUNAN BILANGAN BULAT NON NEGATIF PADA SEMIRING LOKAL DAN SEMIRING FAKTOR</dc:title>
	<dc:creator>Fatimah, Meryta Febrilian</dc:creator>
	<dc:creator>Puspita, Nikken Prima</dc:creator>
	<dc:creator>., Farikhin</dc:creator>
	<dc:description xml:lang="en-US">Let commutative Semiring S. Ideal on Semiring S defined in the same way with the Ideal on the ring. On Semiring                                                   there are special Ideals such as    -ideal,    -maximal Ideal and    -ideal. Semiringwith a unique    -maximal Ideal is called local Semiring. In This paper we will discussed that from non negative integer     we can determined a local Semiring and quotient Semiring.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12264</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 1 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12264/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/619</identifier>
				<datestamp>2013-05-29T04:32:36Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A NUMERICAL SOLUTION OF SURFACE WAVE IN  POROUS MEDIA</dc:title>
	<dc:creator>Wiryanto, L.H</dc:creator>
	<dc:description xml:lang="en-US">A model of wave propagation in porous medium is derived, based on the pressure, giving a diffusive-like equation. The model is then solved numerically by a finite difference method. Taylor approximation is applied to the nonlinear term to obtain a diagonal dominant matrix corresponding to the finite difference equations, so that Gauss-Seidel iteration can used to solve the system of equations. As the result, over-damped wave is performed in this paper, related to quality of the medium.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/619</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 1 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/619/489</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1353</identifier>
				<datestamp>2012-01-25T05:12:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">AKAR-AKAR POLINOMIAL SEPARABEL  SEBAGAI PEMBENTUK PERLUASAN NORMAL</dc:title>
	<dc:creator>Daruni, Sulastri</dc:creator>
	<dc:creator>Surarso, Bayu</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">Misalnya F adalah lapangan perluasan dari lapangan K dan f(x) adalah  polinomial tidak tereduksi dalam K maka f(x) dapat difaktorkan sebagai hasil kali dari faktor linear dalam lapangan pemisahnya . Jika akar-akar dari polinomial tersebut tidak ada yang ganda maka polinomial tersebut merupakan polinomial separabel. Selanjutnya untuk Lapangan pemisah yang memuat kesemua akar-akar yang berlainan dari polinomial tak tereduksi f(x) maka lapangan pemisah tersebut merupakan  perluasan normal.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1353</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 3 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1353/1114</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15296</identifier>
				<datestamp>2017-07-21T04:14:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SOLUSI PERSAMAAN DIOPHANTINE DENGAN IDENTITAS BILANGAN FIBONACCI DAN BILANGAN LUCAS</dc:title>
	<dc:creator>puspitasari, Ayu</dc:creator>
	<dc:creator>Sumanto, YD</dc:creator>
	<dc:creator>Widowati, Widowati</dc:creator>
	<dc:description xml:lang="en-US">In this paper we propose diophantine equations with the form  and . These equations has integer solutions which can form Fibonacci numbers and Lucas numbers. Integer solutions of the Diophantine equations in the form of Fibonacci number and Lucas number are determined by using recursive formula, Binet’s Formula, and the most important is identity of Fibonacci numbers and Lucas numbers.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15296</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 15-19</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15296/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/714</identifier>
				<datestamp>2010-12-21T06:17:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MENCARI SOLUSI PENAKSIR PARAMETER  PADA ANALISIS VARIANSI DENGAN PENDEKATAN GENERAL INVERS</dc:title>
	<dc:creator>sukestiyarno, Sukestiyarno</dc:creator>
	<dc:description xml:lang="en-US">Pada model linear metode kuadarat terkecil digunakan untuk mencari penaksir koefisien parameter. Pada model linier analisis regresi akan diperoleh solusi penaksir yang unik (tunggal), karena pada matriks regresornya mempunyai rank penuh. Akan tetapi pada model linear analisis variansi akan diperoleh solusi penaksir yang tidak tunggal. Hal tersebut terjadi karena pada matriks koefisien regresornya mempunyai rank tak penuh (vektor kolom matriks regressor bergantung linier). Untuk mendapatkan solusi yang tunggal maka orang menempuh jalan menambahkan persyaratan dengan memasukkan suatu kendala. Pada makalah ini akan membahas masalah mencari alternatif solusi penaksir parameter dengan tanpa memasukkan kendala.  Dengan memilih salah satu general invers perkalian matriks regresor yang mempunyai sifat khusus dapat diperoleh suatu penaksir yang lebih baik dari pada penaksir yang diperoleh dengan memasukkan kendala.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/714</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 1 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/714/576</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1385</identifier>
				<datestamp>2012-01-26T01:32:56Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS  VARIABILITAS  CURAH  HUJAN  WILAYAH  INDONESIA BERDASARKAN  PENGAMATAN  TAHUN  1975-2004</dc:title>
	<dc:creator>Juaeni, Ina</dc:creator>
	<dc:description xml:lang="en-US">Tropical rainfall is the most important  atmospheric  variable, because it can be  affect directly to human life.  Tropical rainfall is also important for global climate and weather.  The annual total of  tropical rainfall differs from year to year and from place to place. Other characteristics, such as its seasonal and diurnal distribution, intensity, and duration  also demonstrate spatial and temporal variations. Results of  the statistical analysis to rainfall data indicate that rainfall variation coefficients in the southern Indonesia are  higher than its in the northern Indonesia .  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1385</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 2 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1385/1149</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3875</identifier>
				<datestamp>2012-08-09T03:39:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MENENTUKAN INVERS DRAZIN DARI MATRIKS SINGULAR</dc:title>
	<dc:creator>Khasanah, Lisnilwati</dc:creator>
	<dc:creator>Bambang, Irawanto</dc:creator>
	<dc:description xml:lang="en-US">A singular matrix A with size  has a inverse be called Drazin inverse and denoted by . This inverse can be obtained by specifying a generalized Modal matrix and Jordan canonical form  of matrix A. Generalized Modal matrix  is a matrix where its columns consisting of generalized eigen vectors  from the matrix A, while the Jordan canonical form  is a matrix which entries on its main diagonal consisting of Jordan block matrix . Next, two matrices were used to determine Drazin inverse of matrix A.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3875</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 3 (2011): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3875/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/865</identifier>
				<datestamp>2011-04-21T07:27:21Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TEOREMA ELIMINASI CUT PADA SISTEM LOGIKA FLgc DAN FLw,gc</dc:title>
	<dc:creator>Surarso, Bayu</dc:creator>
	<dc:description xml:lang="en-US">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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/865</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 2 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/865/735</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12254</identifier>
				<datestamp>2016-10-11T04:00:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODUL BERSUPLEMEN UTAMA SEBAGAI GENERALISASI  DARI MODUL BERSUPLEMEN</dc:title>
	<dc:creator>., Fitriani</dc:creator>
	<dc:description xml:lang="en-US">An R-module M is called supplemented if every submodule of M has a supplement in M. Principally supplemented modules are defined as generalizations of lifting, principally lifting and supplemented modules. In this paper, we will characterize principally supplemented modules as a generalization of supplemented module respect to duo module and distributive module.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12254</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12254/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/610</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL DIFRAKSI SINYAL PADA BIDANG MIRING TAJAM</dc:title>
	<dc:creator>suhartono, Suahrtono</dc:creator>
	<dc:creator>Kushartantya, Kushartantya</dc:creator>
	<dc:creator>sugiharto, Aris</dc:creator>
	<dc:description xml:lang="en-US">Signal is a wave that can be expressed by physical phenomenon. Mathematically signal wave can be represented as a function of single or many independent variables, for example signal wave over hill or mountain as a function of distance or time. In fact, signal spreading as a wave have many attenuation, for example is caused by difraction  when the signal over hill or building. The purpose of this writing scientific jurnal is to make a model of knife edge difraction, that seen by two cases, such as transmitter has same height to receiver and transmitter has different height to receiver. Computation result show that transmitter has same height to receiver then the increasing of value of v cause reduction of difraction variable. And  in case of the height transmitter and receiver is not the same, the degradation of v variable has an effect to the increasing of difraction variable.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/610</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/610/480</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1344</identifier>
				<datestamp>2012-01-25T04:43:58Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">INVERS MATRIKS MOORE PENROSE ATAS RING KOMUTATIF DENGAN ELEMEN SATUAN</dc:title>
	<dc:creator>SRRM, Titi udjiani</dc:creator>
	<dc:description xml:lang="en-US">Jika A adalah matriks  dengan elemen Ring komutatif dengan elemen satuan yang berukuran mxn maka matriks invers  dari A yang disebut dengan matriks invers Moore Penrose dari A ditulis G(A) dapat diperoleh dengan memenuhi syarat perlu dan cukup agar G(A) merupakan invers Moore Penrose dari A</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1344</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 1 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1344/1105</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/13540</identifier>
				<datestamp>2017-03-02T04:45:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">DIMENSI PARTISI nGRAF AMALGAMASI  BINTANG YANG DIHUBUNGKAN SUATU LINTASAN</dc:title>
	<dc:creator>Asmiati, Asmiati</dc:creator>
	<dc:description xml:lang="en-US">Let  be a connected graph, vertex , and .  For an ordered k-partition,  the representation v with respect to π is the k-vector ) , are distinct. The minimum k for which there is a resolving k-partition of  is the partition dimension of denoted by  .  In this paper, we determine the partition dimension for certain amalgamation of stars, namely nSk,m. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-03-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/13540</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 3 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/13540/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/705</identifier>
				<datestamp>2010-12-21T05:35:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MENGENAL JARINGAN LAN (LOCAL AREA NETWORK)</dc:title>
	<dc:creator>kurniastuti, awalina</dc:creator>
	<dc:description xml:lang="en-US">Jaringan LAN adalah jaringan komputer yang terdiri dari beberapa komputer sampai ratusan komputer dalam sebuah gedung/kampus. Sehingga penggunaan jaringan LAN hanya sampai pada jarak beberapa kilometer. Pada jaringan LAN, komputer terbagi degan istilah komputer server dan komputer workstation yang memakai bersama resource (printer) dan saling bertukar informasi.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/705</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 3 (2001): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/705/567</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1376</identifier>
				<datestamp>2012-01-25T06:51:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL SPLINE DENGAN ERROR BERKORELASI</dc:title>
	<dc:creator>Nalim, Nalim</dc:creator>
	<dc:creator>Budiantara, I Nyoman</dc:creator>
	<dc:description xml:lang="en-US">Spline smoothing is a popular method for estimating the function in nonparametric regression  model. Its performance depends greatly on the choice of smoothing parameters. Many methods of selecting smoothing parameters such as GCV, GML and UBR are developed under the assumption of independent observations. They fail badly when data are correlated. In nonparametric regression, correlated error could be solved by finding weighted estimator and determine the correlation matrix from the error. Estimation of nonparametric function is obtained by minimizing the penalized weighted least-square (PWLS). In this paper, the extension of the GML method to estimate the smoothing parameters and correlation simulataneously is presented. Simulation was conducted to evaluate and to compare the performance of  the original GML and the extended GML method. The extended GML is recommended since it works well in all simulation scheme. This method is also able to illustrate the data concentration data in a continous chemical process</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1376</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 3 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1376/1139</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/770</identifier>
				<datestamp>2011-01-11T05:11:23Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MENCERMATI BERBAGAI JENIS PERMASALAHAN DALAM PROGRAM LINIER KABUR</dc:title>
	<dc:creator>Asikin, Mohammad</dc:creator>
	<dc:description xml:lang="en-US">Konsep baru tentang himpunan yang dapat dipandang sebagai perluasan dari himpunan klasik/tegas adalah himpunan kabur. Perluasan ini membawa pengaruh pula  pada beberapa konsep lain seperti relasi kabur, bilangan kabur, logika kabur serta program linier kabur. Dalam program linier kabur dikenal pengklasifikasian: program linier dengan sumber kabur, program linier dengan sasaran kabur serta program linier dengan kendala kabur.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/770</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 2 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/770/631</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/856</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERANCANGAN KONTROL SISTEM INTEGRATOR MULTI AGEN DENGAN FORMASI SEGITIGA</dc:title>
	<dc:creator>tjahjana, remedetus heru</dc:creator>
	<dc:description xml:lang="en-US">In this paper, a model of swarm movement in triangular formation is considered. The flocking of geese happening in nature motivates this model. The model  is described by several integrator systems. The movement of the swarm formation is required to preserve a triangle formation from one particular position to the other position. The triangular formation above is translated to a functional cost that must be minimized.  This functional cost consists of an error function, repellant term and energy put to control each agent. The theorem  of swarm movement in a triangular formation and some simulation results are presented in the end of the paper.   </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/856</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/856/726</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12245</identifier>
				<datestamp>2016-10-11T02:44:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MATRIKS RELASI PREFERENSI FUZZY TERITLAK DAN APLIKASINYA UNTUK PEMBUATAN KEPUTUSAN</dc:title>
	<dc:creator>Siti, Khabibah</dc:creator>
	<dc:creator>., Farikhin</dc:creator>
	<dc:creator>Puspita, Nikken Prima</dc:creator>
	<dc:description xml:lang="en-US">In the paper, we explore Dempster-Shaver’s theory and fuzzy preference relations for a decision making. Firstly, we discuss some necessary anf suficient conditions for constructing additive consistency fuzzy preference relation. With respect to the Deng et. al.’s work, we combined these to construct a method for decision making. Finally, two examples are presented as illustrations of the effectiveness of the proposed method.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12245</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 1 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12245/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1331</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS KEKONTINUAN, KETERDIFERENSIALAN  DAN KETERINTEGRALAN FUNGSI BLANCMANGE</dc:title>
	<dc:creator>Soelistyo, Robertus Heri</dc:creator>
	<dc:creator>Sumanto, YD</dc:creator>
	<dc:description xml:lang="en-US">. This article presents differentiable characteristics of the Blancmange function on ℝ. The function has singularities of each point on ℝ. The first, it will be proven  that function is continuous at each point on ℝ, and then by constructing of an infinite series of the saw tooth function, will be proven that the Blancmange function is differentiable nowhere at each point on ℝ. At the end of this article, also discussed integrable analysis of Blancmange function.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1331</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1331/1094</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12278</identifier>
				<datestamp>2016-10-11T05:31:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KENDALI LQR DISKRIT UNTUK SISTEM TRANSMISI DATA  DENGAN SUMBER JARINGAN TUNGGAL</dc:title>
	<dc:creator>Munawarroh, Dita Anies</dc:creator>
	<dc:creator>., Sutrisno</dc:creator>
	<dc:description xml:lang="en-US">In this research discussed about control of data transmission systems with a single network source. Linier quadratic regulator (LQR) control with discrete time is used to control the systems. The linier quadratic regulator (LQR) control is optimal control with quadratic objective function and has linear constrains. The control has aim to optimizing the acceptance rate of data transmission. The data transmission systems have a single network source, can receive 100 % the entering data, although have time delay.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12278</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 3 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12278/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/675</identifier>
				<datestamp>2010-12-17T05:42:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PEMILIHAN MODEL REGRESI LINIER DENGAN  BOOTSTRAP</dc:title>
	<dc:creator>tarno, Tarno</dc:creator>
	<dc:creator>subanar, subanar</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿Tulisan ini membicarakan tentang penerapan bootstrap untuk pemilihan model regresi linier terbaik. Model regresi linier terbaik yang terpilih adalah model dengan estimasi sesatan prediksi kuadrat minimal atas semua model regresi  yang mungkin yaitu sebanyak 2p-1 model dengan p: banyaknya variabel prediktor. Metode Bootstrap memilih suatu model dengan meminimalkan rata-rata sesatan prediksi kuadrat berdasarkan  resampling data yang dibangkitkan melalui pasangan data dan residual, dengan mempertimbangkan juga variabel prediktor yang terlibat sesedikit mungkin. Pemilihan variabel berdasarkan bootstrap pasangan data dan bootstrap residual dengan n ukuran sampel bootstrap adalah konsisten. Dan jika ukuran sampel bootstrap diambil m dengan , pemilihan variabel bootstrap juga konsisten. Hasil dari suatu simulasi dengan SPLUS disajikan dalam tulisan ini.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/675</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 1 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/675/542</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1367</identifier>
				<datestamp>2012-01-25T06:25:05Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISA DISTRIBUSI PANAS PADA ALAT PENGERING RUMPUT LAUT (STUDI KASUS PADA ALAT PENGERING RUMPUT LAUT DI SITUBONDO)</dc:title>
	<dc:creator>Widodo, Basuki</dc:creator>
	<dc:description xml:lang="en-US">In Situbondo, seaweed drying is currently conducted tradityonally. This process produces low quality seaweeds. An alternative way to cope this problem is to develop an hybrid power drying equipment utilizing heat energy from fuel and solar energy. The result of this drying depends on heat distribution. To understand the heat dispersion, one need to analyse temperature distribution in the drying equipment, in particular in the drying plate. Therefore, a model distribution on plate is developed when the heat in  from solar and stove. The model is solved using Finite Different Method. The solution will be formulating to the central, side and corner of the plate. Computation with Matlab will be compared with the result of complements Fluent 6.0 software. The result show that the heat transfer occurs from one area in the plate to others areas due to temperature difference. The profile of the temperature distribution decreases and dispers vertically and horizontally to the edge and the bottom of the plate.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1367</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 2, No 8 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1367/1128</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/759</identifier>
				<datestamp>2011-01-10T02:33:45Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESTIMASI PARAMETER MODEL TAHAP AWAL AR(1) REGRESI RESPON BINER LONGITUDINAL</dc:title>
	<dc:creator>Fajriyah, Rohmatul</dc:creator>
	<dc:creator>subanar, subanar</dc:creator>
	<dc:description xml:lang="en-US">Data yang diperoleh dari hasil pengukuran berulang pada subyek tertentu, biasanya akan berkorelasi. Pada regresi respon biner, jika digunakan model autoregressif order -, AR(1), maka diperlukan pengetahuan tentang  outcome sebelumnya, , yang tak terobservasi. Model untuk menginferensi data dengan model AR(1), diantaranya adalah model AR(1) kondisional. Pada model ini, nilai  diambil sembarang, yaitu   atau . Model di atas akan dibahas dan dibandingkan hasil estimasinya melalui studi simulasi</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/759</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 3 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/759/618</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1399</identifier>
				<datestamp>2012-01-26T04:33:15Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENENTUAN  SUATU PENGONTROL DENGAN INDEKS PERFORMANSI  BERUPA NORMA CAMPURAN   DAN</dc:title>
	<dc:creator>Soelistyo, Robertus Heri</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿﻿﻿. This paper considers the mix-norm / standard problem. Specifically an LQG control design problem involving a constraint on  disturbance attenuation is addressed. It is shown that the / dynamic compensator gains are completely characterized via coupled Riccati/Lyapunov equation. The principle result involves sufficient condition for characterizing full order guaranteeing closed loop stability, constrained  disturbance attenuation and an optimized  performance bound.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1399</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 3 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1399/1163</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/847</identifier>
				<datestamp>2012-01-30T05:04:00Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS KESTABILAN MODEL DINAMIK NITROGEN  DAN HUBUNGANNYA DENGAN PERTUMBUHAN LOGISTIK ALGA</dc:title>
	<dc:creator>widowati, widowati</dc:creator>
	<dc:creator>sutimin, sutimin</dc:creator>
	<dc:creator>ps, hermin</dc:creator>
	<dc:creator>is, Tarita</dc:creator>
	<dc:description xml:lang="en-US">The nitrogen dynamics model  related to algae growth is proposed. The form of the model is nonlinear differential equation system. From these model, the stability of the equilibrium point is disscussed. The stability is analized through the eigen values of the Jacobian matrix that is obtained from linearized system.  From the simulation results is found that ammonia-nitrogen, nitrite-nitrogen, and nitrate-nitrogen concentration will achieve to a certain value. The changed of ammonia-nitrogen, nitrite-nitrogen,  and nitrate-nitrogen concentration are effected by the algae density. If the alga density increase then the ammonia-nitrogen and nitrite-nitrogen concentrations will increase but the nitrate concentration will decrease.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/847</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/847/1180</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/5016</identifier>
				<datestamp>2013-05-29T04:32:36Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">DESAIN KONTROL VIBRASI SEMI AKTIF REAKSI FIXED POINT MENGGUNAKAN PENGONTROL H</dc:title>
	<dc:creator>Sutrisno, Sutrisno</dc:creator>
	<dc:creator>widowati, widowati</dc:creator>
	<dc:description xml:lang="en-US">The semi active fixed point reaction type of Structure Vibration Control Design contain of mass, spring, dashpot, sensor and controller. The controller in this system designed using H∞ method. Case study of Hard Disk Protection System make to analysis the performance of close loop system and appeal with the performance of open loop system viewed from output of simulation using MATLAB with step function and impulse function as input.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-05-29</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/5016</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 1 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/5016/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1319</identifier>
				<datestamp>2012-02-16T06:37:48Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KONTROL OPTIMAL  PREY  DAN  PREDATOR  MODEL RANTAI MAKANAN ROSENZWEIG-MACARTHUR TIGA SPESIES</dc:title>
	<dc:creator>Cahyono, budi</dc:creator>
	<dc:description xml:lang="en-US">The development of knowledge study about ecosistem grows fast in this last decade, one of the study is a model of food chain that include prey-predator. Rosenzweig-MacArthur’s food chain model  is one of the model that develop in the study about  prey and predator’s correlation  which at first include two species only. To approach the real situation, Rosenzweig-MacArthur added one new variable (super-predator) on super-predator model so that it became three species food chain model. Population density  function of prey-predator in the food chain model was influenced by time function and control profile to search optimal control function from model can be gained through the information that construct Rosenzweig-MagArthur food chain model. By optimal control principal, prey population and super-predator will be controlled through the prey carrying capacity (k) and death rate (mortality) of super-predator (d3) to minimize variation agreed for the model of Rosenzweig-MacArthur three species. It was expected that from optimal control function which has been obtained, the three species will not extinct</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1319</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1319/1082</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12269</identifier>
				<datestamp>2016-10-11T04:48:28Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL DINAMIKA PENYEBARAN DBD DENGAN MENERAPKAN TIGA STRATEGI PENGENDALIANNYA</dc:title>
	<dc:creator>., Kartono</dc:creator>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:creator>., Farikhin</dc:creator>
	<dc:description xml:lang="en-US">The information of the dynamic of dengue fever is needed to build the model of its controlling strategy. Therefore, this research is aimed to develop a mathematical model such that the effectiveness of several controlling strategy for example 3M campaign, treatment to the infected people, andthe applying ofinsecticide can be evaluated. This mathematical model is constructed by classifying the human population into three class that are Suspectible (S), Infected (I) and Removed (R) while the vector population (aedes aegypti mosquito) is assumed belongs to the Infected (I) class. The effectiveness of the controlling strategy is analyzed using maximum Pontryagin principle. The result of this analysis shows that the 3M campaign affects the size of the suspect population.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12269</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 1 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12269/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/626</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGENALAN CITRA WAJAH MANUSIA DENGAN MENGGUNAKAN METODE EIGENFACE</dc:title>
	<dc:creator>supiyanto, Supiyanto</dc:creator>
	<dc:creator>suparwati, Titik</dc:creator>
	<dc:description xml:lang="en-US">Face applicable to identify the somebody identity for security. Intention of this research is study the face recognition by using eigenface method and make the application program which can be used to recognize the face in so many expression, position as well as face experienced of the trouble  effect  existence of noise. In Eigenface method, decoding is done by calculating eigenvector then represented in a large matrix. Eigenvector is also declared as facial characteristics, therefore why this method is called with Eigenface. Face input which at this application is in the form of face image of the size and same resolution. Output Application is in the form of class closest from face which wish recognized. This application made with the program delphi 7 which enough rely on and easy to in calculation mathematic. Result of examination of face recognition by using approach eigenface to used sampel, program can recognize the face truly with the efficacy 88,2%.   </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/626</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/626/1189</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1358</identifier>
				<datestamp>2012-01-25T05:12:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TEOREMA KEKONVERGENAN FUNGSI TERINTEGRAL RIEMANN .</dc:title>
	<dc:creator>Farikhin, Farikhin</dc:creator>
	<dc:description xml:lang="en-US">Teorema kekonvergenan merupakan bagian yang penting dalam mempelajari  teori  integral. Limit fungsi barisan fungsi yang terintegral Riemann pada suatu interval belum tentu fungsi tersebut juga terintegral Riemann pada interval itu. Dengan demikian diperlukan syarat lain agar limit fungsi juga terintegral Riemann. Tulisan ini bertujuan membahas syarat cukup agar limit fungsi dari barisan fungsi yang konvergenan di mana-mana juga terintegral Riemann. Selanjutnya, dibahas juga syarat cukup agar limit fungsi dari barisan fungsi yang konvergen hampir di mana-mana juga terintegral Riemann.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1358</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 3 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1358/1119</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15313</identifier>
				<datestamp>2017-07-21T04:14:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SYARAT PERLU DAN CUKUP INTEGRAL HENSTOCK-BOCHNER DAN INTEGRAL HENSTOCK-DUNFORD PADA [a,b]</dc:title>
	<dc:creator>Solikhin, Solikhin</dc:creator>
	<dc:creator>Hariyanto, Susilo</dc:creator>
	<dc:creator>Sumanto, Y.D</dc:creator>
	<dc:creator>Aziz, Abdul</dc:creator>
	<dc:description xml:lang="en-US">In this paper we study Henstock-Bochner and Henstock-Dunford integral on [a,b]. We discuss some properties of  the integrable. For every function which Henstock-Bochner integrable then it is Hentsock-Dunford integrable. The contrary is not true. Further more, let for any  and collection  is Henstock-equi-integrable. We will show that function   is Henstock-Bochner  integrable on   if only if  it is Henstock-Dunford integrable on .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15313</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 45-52</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15313/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/725</identifier>
				<datestamp>2010-12-22T06:42:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EKSISTENSI PENGENDALI SUBOPTIMAL  H tak hingga</dc:title>
	<dc:creator>widowati, widowati</dc:creator>
	<dc:description xml:lang="en-US">Dikemukakan masalah pengendali (controller) suboptimal , yaitu mencari pengendali yang diperkenankan sehingga kinerja dari obyek terkendali (sistem lup tertutup) sesuai dengan yang diharapkan.  Pembahasan diawali dengan gambaran singkat mengenai persamaan Riccati aljabar, kemudian dikaji  syarat perlu dan cukup untuk eksistensi pengendali suboptimal . Selanjutnya, verifikasi dari kinerja pengendali yang diperoleh dilakukan dengan mengaplikasikannya pada struktur fleksibel  untuk meredam vibrasi.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/725</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 2 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/725/582</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1390</identifier>
				<datestamp>2012-01-26T01:55:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">LOKALISASI ORE</dc:title>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿Let  be a noncommutative ring and  be a multiplicative subset of . The right (left) ring of quotients does not exist for every. A necessary condition of existence right (left) ring of quotients is  right (left) permutable and right (left) reversible. A multiplication subset  is called a right (left) denominator if it is right (left) permutable and right (left) reversible. The ring  has a right (left) ring of quotients with respect to  if and only if  is a right (left) denominator set. We can construct right (left) ring of quotients by using Ore localizations.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1390</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 3 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1390/1154</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3880</identifier>
				<datestamp>2012-08-09T04:19:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EFEK FUNGSI RCC DALAM AUTENTIKASI CITRA BERWARNA BERBASIS TRANSFORMASI INTEGER</dc:title>
	<dc:creator>Wibawa, Helmi Arif</dc:creator>
	<dc:description xml:lang="en-US">One method that can be used to authenticate the image is an integer transformation method. This method works on a single layer of color, so for the authentication process on a color image having more than one color layer, then the RCC function can be used to reduce existing color layer. For some cases, RCC function turns out to give a negative effect on the image authentication process and the quality of the image. This article discusses about the effect of the use of RCC functions in the process of image authentication. Testing is done by comparing the results between processes that use RCC functions and processes that do not use it. The parameters used are the values ​​saved bits, storage capacity, PSNR values ​​and ability to perform the authentication process  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3880</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 3 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3880/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/870</identifier>
				<datestamp>2011-04-21T07:27:21Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERTIDAKSAMAAN AZUMA PADA MARTINGALE UNTUK MENENTUKAN SUPREMUM PELUANG</dc:title>
	<dc:creator>sudarno, Sudarno</dc:creator>
	<dc:description xml:lang="en-US">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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/870</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 2 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/870/740</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12259</identifier>
				<datestamp>2016-10-11T04:01:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">NEUTROSOFIK MODUL DAN SIFAT-SIFATNYA</dc:title>
	<dc:creator>., Suryoto</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:creator>Puspita, Nikken Prima</dc:creator>
	<dc:description xml:lang="en-US">Given any ring with unity and a commutative neutrosophic group under the additional operation, then from the both structures can be constructed a neutroshopic module by define the scalar multiplication between elements of the ring and elements of the commutative group. Further by generalized the neutrosophic module can be obtained a substructure of the neutrosophic module called a neutrosophic submodule. In this paper, from the concept of neutrosophic module and the ring with unity we study a generalization of classical module, that is a neutrosophic module and its properties. By utilizing the neutroshopic element as an indeterminate and an idempotent element under multiplication can be shown that most of the basic properties of clasiccal module generally still true on this neutrosophic struture.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12259</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12259/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/615</identifier>
				<datestamp>2013-05-29T04:32:36Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MENENTUKAN DEVIASI DARI  HIMPUNAN TERURUT PARSIAL</dc:title>
	<dc:creator>Amir, Amir Kamal</dc:creator>
	<dc:description xml:lang="en-US">To measure of how close the ring is to being Artinian ring is used usually so called Krull dimention. In the case of noncommutative rings, the Krull dimention is measured on the lattice of ideals. In this situation, the lattice of  ideals is seen as a poset (partial ordered  set) and then the deviation of the poset is measured. This paper will describe, completely, deviation of posets including the deviation of product of two posets. Moreover, this paper also will present characteristic of poset which has a deviation and does not have.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/615</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 1 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/615/485</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1349</identifier>
				<datestamp>2012-01-25T04:58:23Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Studi Banding antara Metode Minimum Distance dan Gaussian Maximum Likelihood Sebagai Pengklasifikasi Citra Multispektral</dc:title>
	<dc:creator>sarwoko, eko adi</dc:creator>
	<dc:description xml:lang="en-US">Metode Minimum Distance merupakan metode sederhana (metrik jarak) yang digunakan untuk alat pengklasifikasi pada masalah pengenalan pola. Demikian pula Metode Gaussian Maximum Likelihood, informasi yang ditunjukkan metode ini cukup lengkap, karena selain rata-rata, juga memperhitungkan informasi variansi pada variable yang diukur. Tulisan ini mengkaji mekanisme dan kinerja kedua metode, yang diujikan pada data citra multispektral daerah Riau dan Jawa Tengah. Dari hasil penelitian ini, ternyata penggunaan metode Gaussian Maximum Likelihood mempunyai akurasi yang lebih baik dibandingkan metode Minimum Distance.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1349</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 2 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1349/1110</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/13545</identifier>
				<datestamp>2017-03-02T04:45:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SOLUSI MASALAH TRANSPORTASI MENGGUNAKAN TOCM-SUM APPROACH DENGAN INDIKATOR DISTRIBUSI</dc:title>
	<dc:creator>Astuti, Nita Dwi</dc:creator>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:description xml:lang="en-US">Transportation problems are related to the transport of a product from some sources to a number of different destination. In general, the different delivery will produce different shipping cost, therefore the purpose of solving classic transportation problems with the allocation of delivery from the source to destination is to determine the minimum transportation costs. The appropriate allocating in each case will produce an optimal solution for both minimize case and maximize case. TOCM-SUM approach with the indicator distribution is a new method for seeking initial feasible solution of the transportation problem. This method was proposed by Aminur Rahman Khan, Adrian Vilcu, MD.Sharif Uddin and FlorinaUngureanu. The first step is create a table of transportation, the second step is reduce the elements in each row and column with the smallest elements in every row and column, the third case is form the tables of Total Opportunity Cost Matrix (TOCM), the fourth case is calculate the indicators of distribution of each row and column in the TOCM table, and thereafter, the allocation is given to the cell that has the minimum distribution indicator. Repeat the steps until the total allocation of supply and demand is met, for optimal solutions the method of Stepping Stone is being used. This article discusses the application of TOCM-SUM Approach with the indicator distribution – Stepping Stone in the CV. Tirta Makmur Ungaran.    </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-03-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/13545</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 3 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/13545/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/710</identifier>
				<datestamp>2010-12-21T06:17:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SYARAT PERLU DAN CUKUP SUBMODUL TERKOMPLEMEN</dc:title>
	<dc:creator>wahyuni, Sri</dc:creator>
	<dc:description xml:lang="en-US">Dipresentasikan syarat perlu dan cukup agar suatu submodul S dalam suatu modul M atas ring komutatif dengan elemen satuan R merupakan submodul terkomplemen. Diperoleh suatu sifat bahwa jika S terkomplemen akan berakibat  bebas; dan juga jika S terkomplemen maka akan berlaku: untuk setiap x Î S  jika berlaku x = ay dengan y Î M dan  a ¹ 0 dalam R, maka haruslah y juga barada dalam M. Selanjutnya dapat ditunjukkan  kebalikannya juga benar jika M merupakan modul yang dibangun secara hingga atas daerah ideal utama R.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/710</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 1 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/710/572</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1381</identifier>
				<datestamp>2012-01-25T07:12:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">DEFORMASI INTERAKSI DUA PAKET GELOMBANG DARI PERSAMAAN IMPROVED KdV (IKdV</dc:title>
	<dc:creator>Sutimin, Sutimin</dc:creator>
	<dc:description xml:lang="en-US">Here, We will study the nonlinear two waves packet interaction. The two waves packet is modeled by Improved Koreteweg de-Vries (IKdV) equation. The primary amplitudes are modulated by two-soliton of the nonlinear Schrődinger (NLS) equation. In this paper, we analyzed the interaction patterns of the two waves packet at the peak interaction. We have shown here, that during under going to the interaction region, the deformation of amplitudes profile will be occurred. The large deformation is characterized by the ratio of the amplitudes parameter and the wave numbers of each wave packets. The symmetry interaction also can be analyzed by the characterization of the parameters.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1381</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 1 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1381/1145</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/786</identifier>
				<datestamp>2011-01-19T07:34:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERANCANGAN ARSITEKTUR PEMARALELAN UNTUK MENCARI SHORTEST PATH DENGAN ALGORITMA DIJKSTRA</dc:title>
	<dc:creator>sarwoko, Eko Adi</dc:creator>
	<dc:description xml:lang="en-US">Perancangan arsitektur pemaralelan merupakan salah satu tahap penting dalam komputasi paralel. Tahap ini bertujuan agar kompleksitas komputasi dan komunikasi dapat efisien. Tulisan ini merupakan kajian perancangan arsitektur pemaralelan mencari Shortest Path dengan Algoritma Dijkstra. Rancangan ini ditinjau berdasarkan aspek analisis algoritma baik kompleksitas komputasi maupun  komunikasi.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/786</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 3 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/786/647</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3871</identifier>
				<datestamp>2012-08-09T03:39:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Graf Fuzzy Produk</dc:title>
	<dc:creator>Firmansyah, Fery</dc:creator>
	<dc:creator>Bayu, Surarso</dc:creator>
	<dc:description xml:lang="en-US">Fuzzy graph is a graph which is consists of a pairs of vertex and edge that have degree contained on closed interval of real number [0,1] on each edge and vertex. Product fuzzy graph was defined by Dr. V. Ramaswamy and Poornima B by replacing “infimum” in definition of fuzzy graph by “product”. In this paper we study product fuzzy graph complete, in connection  complement of produk fuzzy graph, join of produk fuzzy graph and multiplication of produk fuzzy graph. We show that complement of the multiplication of two product fuzzy graphs complete is a multiplication of its complement, in which this disposition produces nil graph.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3871</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 3 (2011): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3871/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/861</identifier>
				<datestamp>2011-04-21T02:17:12Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENDEKATAN REGRESI UNTUK ANALISIS RAGAM KLASIFIKASI DUA-ARAH</dc:title>
	<dc:creator>Ispriyanti, Dwi</dc:creator>
	<dc:description xml:lang="en-US">Regression approach can be used for solving analysis of variance problems, wether of one way or two ways ANOVA . In ANOVA, model is an important factor. In this paper, we will study two ways classification ANOVA with regression approach for solving the fixed effect model. It can be done if the model is indentified truly and if the preventive procedure have been done so we have an independent normal equation. A characteristic of ANOVA is that the analysis model is overparameterized, so we have to make constraint for the parameters. In the Regression model approach for ANOVA problems, the independent variable X at categorical form 0 and 1 , or we have to make dummy variables at row and colom factors.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/861</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 1 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/861/731</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12250</identifier>
				<datestamp>2016-10-11T03:28:39Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BILANGAN RADIO PADA GRAF GEAR</dc:title>
	<dc:creator>Puspasari, Ambar</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">Let d(u,v) denote the distance between two distinct vertices of connected graph G, and diam (G) be the diameter of G. A radio labeling c of G is an assignment of positive integer to the vertices of G satisfying  d(u, v) + |c(u) − c(v)| ≥ diam(G) + 1.The maximum integer in the range of the labeling is its span. The radio number of G, rn(G), is the minimum possible span. Radio number of gear graph G’n  , for n ≥ 4  is rn(G’n) ≥ 4n + 2, and n ≥ 7 is rn(G’n) ≤ 4n + 2. The labeling of gear graph G’n  , n=4,5,6 is rn(G’4) = 18, rn(G’5) = 22, rn(G’6) = 26 than for n ≥ 4 , the radio number rn(G’n) is  4n + 2.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12250</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 16, No 1 (2013): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12250/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12250/pdf_1</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/606</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">NILAI SOLUSI PENDEKATAN SISTEM LINEAR SKALA BESAR MENGGUNAKAN GMRES</dc:title>
	<dc:creator>dkk, Farikhin</dc:creator>
	<dc:description xml:lang="en-US">Many engineering process require the solution of linear system of the form , where A is a  nonsingular real matrix,  , and vector  is solution of the linear system. There are two methods for solving large scale linear system which are full orthogonalization method (FOM) and Generalized minimal residual (GMRES). GMRES is most popular method to solve large scale linear equations. In this paper, we proven that GMRES preserved the magnitude of approximations solution of linear system.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/606</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/606/476</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1336</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">GRAF FUZZY REGULER DAN HUBUNGANNYA  DENGAN GRAF FUZZY REGULER TOTAL</dc:title>
	<dc:creator>Natalia, Priskila Denny</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:description xml:lang="en-US">Fuzzy graph is a graph consists pairs of vertex set and edge set that have degree of membership containing closed interval of real number [0,1] on each edge and vertex. Regular fuzzy graph and totally regular fuzzy graph were defined by A.Nagoor Ghani and K.Radha. This paper studied the definitions of regular fuzzy graph and totally regular fuzzy graph. Next, showed that a necessary and sufficient condition under which regular fuzzy graph and totally regular fuzzy graph were equivalent</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1336</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1336/1100</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12283</identifier>
				<datestamp>2016-10-11T05:33:31Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROGRAM LINIER FUZZY PENUH DENGAN METODE KUMAR</dc:title>
	<dc:creator>Wahyudy, Shintia Devi</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">Fully fuzzy linear programing is part of a crisp linear programming (linear programimg with a number of crisp) which the numbers used are fuzzy numbers. Solving a fully fuzzy linear programming problems by using Kumar method to fuzzy optimal solution and crisp optimal value.. Solving fuzzy optimal solution by Kumar method  on triangular fuzzy number to divide into tree objective functions and defuzzification  by using ranking function and  α - cutting to get crisp  optimal solution. This paper discusses about Kumar methods method for solving fully fuzzy linear programming in which fuzzy numbers used are triangular fuzzy numbers.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12283</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 3 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12283/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/683</identifier>
				<datestamp>2010-12-20T04:37:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ELEMEN  PEMBANGUN  T   DALAM   SEMIGRUP - T</dc:title>
	<dc:creator>Sumanto, Y.D</dc:creator>
	<dc:description xml:lang="en-US">Misalkan M himpunan tak kosong dan G himpunan operasi biner assosiatif pada M. Jika untuk setiap  a, b  Î G dan untuk setiap  x, y,z  Î M  berlaku  (xay) bz = xa(ybz), maka M disebut  semigrup-G. Dalam tulisan ini akan ditunjukkan bahwa jika a Î G dan untuk setiap x Î M ada y, z Î M sedemikian hingga x = yaz, maka untuk setiap b Î G ada b Î M sedemikian hingga  b  =  aba.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/683</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 2 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/683/547</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1372</identifier>
				<datestamp>2012-01-25T06:51:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TRANSITIF KLOSUR DARI  GABUNGAN DUA RELASI EKUIVALENSI PADA SUATU HIMPUNAN DENGAN STRUKTUR DATA DINAMIS</dc:title>
	<dc:creator>Endah, Sukmawati Nur</dc:creator>
	<dc:description xml:lang="en-US">A relation R on set A is an equivalence relation on A if and only if R is reflexive, symmetric and transitive. If two equivalence relations on set A are  combined, the combination of them is not surely an equivalence relation, because it is not surely transitive relation. In this paper is found the smallest transitive relation (transitive closure) of the combination, to be an equivalence relation. Then the steps to determine transitive closure are programmed in Pascal programming language with dynamic data structure that is multilist.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1372</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 3 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1372/1135</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/766</identifier>
				<datestamp>2011-01-11T05:07:33Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">APLIKASI  MATEMATIKA DALAM PERENCANAAN DAN PENGENDALIAN DI BIDANG INDUSTRI</dc:title>
	<dc:creator>Kartono, Kartono</dc:creator>
	<dc:description xml:lang="en-US">Pengambilan keputusan d­alam encanaan dan pengendalian di bidang Industri harus didukung oleh suatu analisis kwantitatif dan kwalitatif, sehingga hasil yang diperoleh menjadi optimal. Dalam tulisan ini dibahas beberapa analisis kwantitatif yang dapat digunakan dalam pangambilan keputusan yang optimal.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/766</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 1 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/766/627</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/852</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MEMBANGUN KODE GOLAY (24, 12, 8)  DENGAN MATRIKS GENERATOR DAN MENGGUNAKAN  ATURAN KONTRUKSI</dc:title>
	<dc:creator>rizki, ikhsan</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">The binary (24, 12, 8) extended Golay code can be constructed through the direct sum operation with involve two product codes. This method form the generator matrix framework of the (24, 12, 8) Golay code that is based on the so-called Turyn or |a + x|b + x|a + b + x| construction, where a,b C1 and x C. C1 and C is the (8, 4, 4) linear block codes. C can be gotten by applying construction rules to get the generator matrix of C. With C1 and C and by applying the generator matrix framework of the (24. 12, 8) Golay code get the binary (24, 12, 8) extended Golay code.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/852</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/852/722</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12241</identifier>
				<datestamp>2016-10-11T02:44:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISA BEBAN PENGEREMAN TERHADAP KUALITAS  KAMPAS REM TROMOL MOBIL DENGAN METODE OGHOSI</dc:title>
	<dc:creator>Taufiq, M. Qurohman</dc:creator>
	<dc:creator>., Syarifudin</dc:creator>
	<dc:description xml:lang="en-US">The development of technology is currently grows rapidly now and the impact from the development is there will be a wide variety of design technology, especially in the field of automotive engine and methods. Therefore it needs a lot of research and analysis, one of them is the braking load for the braking pressure, wearing and the resulting of quality. The purpose of this study was to determine the thickness of the wearing of the brake drum testing and to know the quality of the brake drum car. The method in this research by collecting data with the literature, observation and experimentation, and used analytical Oghosi method. The type of vehicle in this study is Diesel Isuzu Panther. To get a good quality of brake linings, the material must have these characteristics such as : a high coefficient of friction, the material characteristic is not influenced by the environment and condition, the resistance to high temperatures and the resistance to wearing and friction. In the research braking loads is started from 5 kg to 25 kg which is obtained values ​​ranging from 0,00381 mm2/Kg up to 0,00809 mm2/Kg. Therefore, in this study concluded that the addition of loads was greater than the addition of a specific value shrinking, it is influenced by the presence of a higher traction due to greater loading.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/msword</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12241</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 1 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12241/9254</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1324</identifier>
				<datestamp>2012-02-16T06:37:48Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BARISAN SIMBOL DAN UKURAN INVARIAN FUNGSI MONOTON SEPOTONG-SEPOTONG KONTINU</dc:title>
	<dc:creator>Kristina Ningrum, Rinurwati</dc:creator>
	<dc:description xml:lang="en-US">. Let  is piecewise continuous monotone function. In this paper we going to construct g-invariant measure from piecewise continuous monotone function g using minus symbol sequences and plus symbol sequences. This space is generalization from invariant measure piecewise linear transformation</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1324</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1324/1087</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12274</identifier>
				<datestamp>2016-10-11T05:14:50Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KELAS-KELAS BCI-ALJABAR  DAN HUBUNGANNYA SATU DENGAN YANG LAIN</dc:title>
	<dc:creator>., Winarsih</dc:creator>
	<dc:creator>., Suryoto</dc:creator>
	<dc:description xml:lang="en-US">Several classes of BCI-algebras as the class of weakly implicative BCI-algebras, BCK-algebras, medial BCI-algebras, branchwise implicative BCI-algebras and branchwise commutative BCI-algebras have relation one another. A branchwise implicative BCI-algebras is a class of BCI-algebras which to fulfill condition of branchwise implicative. By using characters of the class of BCK-algebras and element of the class of medial BCI-algebras, we investigate relations between branchwise implicative BCI-algebras exist with others classes of the class of BCI-algebras as the class of weakly implicative BCI-algebras and branchwise commutative BCI-algebras.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12274</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 2 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12274/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/671</identifier>
				<datestamp>2010-12-17T05:42:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SUBRUANG MARKED</dc:title>
	<dc:creator>suryoto, Suryoto</dc:creator>
	<dc:description xml:lang="en-US">Misalkan V suatu ruang vektor berdimensi hingga atas lapangan kompleks C, T operator linier nilpoten pada V dan  W subruang T-invariant dari V. W dikatakan marked jika terdapat basis Jordan untuk W yang dapat diperluas menjadi basis Jordan untuk V. Dalam tulisan ini ditunjukkan bahwa suatu basis Jordan untuk W dapat diperluas menjadi basis Jordan untuk V jika dan hanya jika basis tersebut mempunyai sifat ketetapan dan sifat kedalaman. Syarat perlu dan cukup suatu subruang T-invariant adalah marked juga diberikan secara geometri dengan memanfaatkan Inti dan Peta dari T.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/671</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 1 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/671/538</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1363</identifier>
				<datestamp>2012-01-25T05:31:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERAMALAN  VOLATILITAS INDEKS HARGA SAHAM  MENGGUNAKAN MODEL ASIMETRIK GARCH  (GENERALIZED AUTOREGRESSIVE CONDITIONAL HETEROSCEDASTICITY) DENGAN DISTRIBUSI SKEWED STUDENT-t</dc:title>
	<dc:creator>Wahyuni, Susi Tri</dc:creator>
	<dc:creator>Iriawan, Nur</dc:creator>
	<dc:creator>AW, Dwi Atmono</dc:creator>
	<dc:description xml:lang="en-US">The condition of Indonesian economic in the last fiew years fluctuatics following  konjungtur cycle. Besides in economic problem, non economic problem such as social and politic are also influence that fluctuation. It means, the instability had influenced of stock exchange practition in analyzing and predicting return. Financial data, such as stock exchange price indices often has heteroscedasticity. One of modeling technique to analyze the condition is using GARCH models. Unfortunately, GARCH models often do not fully capture the thick  tails property of high frequency financial time series. To cope this weakness, we’ll an Asymmetric GARCH model will be used. Using Box-Jenkins methods, the Composite Price Indices have mean model ARIMA (10 17 69,1,0). With the same data we can having  GARCH (2,1) model.  The Asymmetric GARCH (AGARCH) model in this research was not properly  proper to model the Composite Price Indices Volatility.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1363</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 1 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1363/1124</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/755</identifier>
				<datestamp>2011-01-10T02:33:45Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PEMANFAATAN MODEL-MODEL PEMBELAJARAN MATEMATIKA SEKOLAH SEBAGAI KONSEKUENSI LOGIS OTONOMI DAERAH BIDANG PENDIDIKAN</dc:title>
	<dc:creator>pujiastuti, emi</dc:creator>
	<dc:description xml:lang="en-US">Pelaksanaan otonomi daerah bidang pendidikan didasarkan atas pasal 11 ayat (2) UU No. 22/1999 tentang Pemerintahan Daerah dan diikuti oleh PP No. 25/2000 Pasal 2 ayat (11) yang antara lain menuliskan tentang kewenangan pusat untuk mengatur penetapa kurikulum nasional dan evaluasinya, serta penetapan standar materi pelajaran pokok. Sedangkan guru memiliki kewenangan untuk menyelenggarakan proses pembelajaran secara otonomi. Konsekuensi logisnya, guru dapat mengembangkan kreativitasnya dalam menerapka model-model pembelajaran. Model pembelajaran adalah pola pembelajaran yang diterapkan/dipilih guru dalam menyampaikan materi bahan ajar, sehingga tujuan pembelajaran dapat dicapai sesuai dengan yang dikehendaki guru. Dalam menerapkan/memanfaatkan suatu model pembelajaran matematika, diasumsikan bahwa guru dianggap telah menguasai materi bahan ajar dan dapat menyajikannya dengari baik, hangat, dan penuh keantusiasan. Model-model pembelajaran yang dapat diterapkan guru banyak sekali ragamnya. Di antaranya, (1) model pembelajaran Ekspositori., yakni guru mengajarkan materi diselingi dengan latihan-latihan soal, (2) model pembelajaran Quantum Teaching, yang mencoba menciptakan suasana pembelajaran matematika menjadi menyenangkan, menakjubkan dan setiap keberhasilan perlu dirayakan. (3) model pembelajaran Konstruktivis, yakni meminta kepada para siswa untuk mempelajari dahulu materi yang akan diajarkan, (4) model pembelajaran Realistic Mathematics Education (RME), yang dalam hal ini guru harus menyiapkan soal tentang kehidupan sehari-hari yang harus dipecahkan dengan materi pelajaran yang akan diterangkan kemudian, (5) model pembelajaran Problem Posing, yang mengharuskan siswa mengajukan soal dan solusinya, serta (6) model pembelajaran Pengajaran Berbalik (Reciprocal Teaching), yakni meminta siswa untuk menyajikan materi yang dipilih guru, di depan kelas. Diharapkan, dengan adanya otonomi daerah bidang pendidikan ini, dapat dijadikan wahana bagi guru untuk mengembangkan kreativitasnya di bidang penyajian materi bahan ajar.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/755</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 3 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/755/614</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1395</identifier>
				<datestamp>2012-01-26T04:33:15Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ASURANSI KESEHATAN INDIVIDU PERAWATAN RUMAH SAKIT</dc:title>
	<dc:creator>Wilandari, Yuciana</dc:creator>
	<dc:description xml:lang="en-US">The Individual Insurance Health of the Hospital Care is a cooperation form to reduce hospital expenses. The calculation of the annual net premium is influenced by age and sex at the policy released time. The premium can be paid once in each year by renewing the premium every year and also cannot be renewed.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1395</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 3 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1395/1159</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/843</identifier>
				<datestamp>2012-01-30T05:04:00Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISA KESTABILAN MODEL SIRC UNTUK INFLUENZA TIPE A</dc:title>
	<dc:creator>sari, Eminugroho Ratna Sari Ratna</dc:creator>
	<dc:description xml:lang="en-US">Influenza is a disease caused by virus that always changes genetically. This paper will explain the spread of influenza type A. We introduce cross-immune (C) class i.e., those that recovered after being infected by different strains of the same viral subtype in the past years. Generally, the mathematical model for the spread of influenza A has two kinds of equilibrium point: free disease equilibrium and endemic equilibrium. Furthermore, the equilibrium point of system is investigated its stability. There is no influenza in the nature if contact rate less than sum of death rate and recovery rate. Then, there is influenza in the nature if contact rate more than sum of death rate and recovery rate    </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/843</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/843/1175</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/4905</identifier>
				<datestamp>2013-05-14T03:50:24Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENENTUAN  TRAJEKTORI  KERETA  DUBIN  MELALUI  KONTROL  OPTIMUM</dc:title>
	<dc:creator>Tjahjana, Redemtus Heru</dc:creator>
	<dc:description xml:lang="en-US">This paper addressed the control of a Dubin’s vehicle. The Dubin’s vehicle control design, using the Pontryagin Maximum Principle. The application of this principle, bring the matter to the Hamiltonian system with some partial equations excess conditions, while others do not have any conditions. The difference approach, which used  in this paper to design of the control. This paper solve the problem by transforming the problem into the initial values problem, by finding the best approach to obtain the initial condition equations for some equations that do not have any conditions.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/4905</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 15, No 1 (2012): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/4905/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1315</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGARUH PEMILIHAN ARAH KETETANGGAAN PIKSEL DALAM PROSES WATERMARKING PADA METODE TRANSFORMASI INTEGER</dc:title>
	<dc:creator>Wibawa, Helmie Arif Wibawa</dc:creator>
	<dc:description xml:lang="en-US">.  Integer transformation as one of the reversible watermarking method can be used to embed the information into the image and be able to recover the original image. This method works on a single color layer by using properties of inter-pixel neighborhood. This paper discusses the influence of the direction selection of the neighborhood when assigning a pair of pixels to the number of saved bits, the maximum payload of quantity and quality of the watermarked image. The tested image is RGB color images. In the observations, the watermarking process performed on the two possible directions then analyze PSNR values of the watermarked image and quantity of data space to embed the information.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1315</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1315/1078</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12265</identifier>
				<datestamp>2016-10-11T04:46:54Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS KESTABILAN MODEL DINAMIK ALIRAN FLUIDA DUA FASE PADA SUMUR PANAS BUMI</dc:title>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:creator>., Widowati</dc:creator>
	<dc:creator>Tjahjana, Redemtus Heru</dc:creator>
	<dc:creator>Niswah, L</dc:creator>
	<dc:description xml:lang="en-US">In this paper is discussed about the analysis of the stability of fluid flow dynamical model of two phases on the geothermal wells. The form of the model is non-linear differential equation. To analyze the local stability around the equilibrium point, first, the non linear models of is linearized around the equilibrium point using Taylor series. Further, from linearized model, we find a Jacobian matrix, where all of the real eigen values of the Jacobian matrix are zeros. So that the behviour of the dynamical system obtained around the equilibrium point is stable.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12265</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 1 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12265/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/622</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EKUIVALENSI RING RICKART DAN RING BAER BESERTA *-RINGNYA</dc:title>
	<dc:creator>hanifah, Hanifah</dc:creator>
	<dc:description xml:lang="en-US">Rickart ring and Baer ring as well as its *-ring are a particular form of ring where its annihillator is generated by an idempotent element or projection. By using concept of annihilator, idempotent, projection and inexistence of zero divisor on ring can be showed equivalent among the rings.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/622</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/622/1184</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1354</identifier>
				<datestamp>2012-01-25T05:12:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PEMODELAN STATISTIKA  DENGAN TRANSFORMASI BOX COX</dc:title>
	<dc:creator>Ispriyanti, Dwi</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1354</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 3 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1354/1115</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15283</identifier>
				<datestamp>2017-07-26T05:23:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BILANGAN DOMINASI PERSEKITARAN PADA GRAF LENGKAP DAN GRAF BIPARTIT LENGKAP</dc:title>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:creator>Surarso, Bayu</dc:creator>
	<dc:creator>Harjito, Harjito</dc:creator>
	<dc:creator>Maunah, Uun</dc:creator>
	<dc:description xml:lang="en-US">Given graph  with set of vertex  and set of edge E. Set  subset of  is called domination set if every point in  is adjacent with at least one point in  in graph . The minimum cardinality of all set of domination graph  is called domination number. Let  be a subset of , set  is called a neighborhood set if  with   induced subgraph  of . The minimum cardinality of all the neighborhood set of graph  is called the neighborhood number. There are several types of neighborhood domination number depending on the parameters. In this paper we examine the transversal neighborhood domination number and global neighborhood domination number in complete graph and complete bipartite graph.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15283</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 20-26</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15283/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/721</identifier>
				<datestamp>2010-12-22T06:42:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGEFEKTIFAN USAHA MEDIS DALAM MEMBATASI EPIDEMI DENGAN KONTROL BANG-BANG</dc:title>
	<dc:creator>cahyadi, heru</dc:creator>
	<dc:creator>ponidi, ponidi</dc:creator>
	<dc:description xml:lang="en-US">Dalam makalah ini akan dibahas mengenai aplikasi kontrol optimal dengan kontrol bang-bang pada efektifitas usaha medis dalam membatasi epidemi. Mula-mula dimodelkan tingkat perubahan jumlah penduduk yang terinfeksi penyakit dengan adanya usaha medis yang dilakukan yang menjadi kendala pada kontrol optimal ini, kemudian dimodelkan fungsi objektif yaitu akan diminimumkannya cost usaha medis dalam membatasi epidemi dengan batas akhir yang ditentukan. Kemudian dengan teori kontrol optimal yang menggunakan kontrol bang-bang akan dihasilkan sistem yang optimal. Dan hasilnya akan disimulasikan dengan kompute menggunakan software Mathlab.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/721</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 2 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/721/577</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1386</identifier>
				<datestamp>2012-01-26T01:32:56Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">HUBUNGAN ANTARA LOGIKA PROPOSISI DENGAN  LOGIKA PREDIKAT (SUATU KAJIAN EPISTEMOLOGIS)</dc:title>
	<dc:creator>Suyitno, Hardi</dc:creator>
	<dc:description xml:lang="en-US">This paper presents  epistemological studies  of  propositional  logic and  predicate logic. The topic is a part of the dissertation proposal under title “Ëpistemology of Mathematical Logic According to Ludwig Wittgenstein”.   Author is a student of the Doctor Program  of Gajah Mada University,  the majorstudy  is  philosophy. There are some  difference, equality, and relation between propositional  logic and  predicate logic.  Both of them use the same ope-rator, method, and rule of  inference. There are five  operator of logic, that  are  disjunction, conjunction, negation, implication,  and biimplication. The truth value of proposition deter-minated by definition.  There are eighteen rules of  inference, four rules for removing quan-tifiers,  and four rules for  introducing quantifiers. There are two methods of validity test, that are direct proof and indirect proof; and  there is one common method for invalidity test , that is Counter Exampel Method. The basic component of  propositional logic is  simple statement. The basic component of predicate logic is predicate. In the predicate logic beside Counter Exampel Method for invalidity test,  there is another method for invalidity test that is Finite Universe Method.  The conclusion  of this research is  propositional logic  which a part of  predicate logic. If  a form is valid in propositional  logic, then  the form  is valid in predicate logics. Thus scope of predicate logic is wider than propositional logic.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1386</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 2 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1386/1150</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3876</identifier>
				<datestamp>2012-08-09T04:19:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL SISTEM MULTI AGEN LINEAR DENGAN FORMASI SEGITIGA</dc:title>
	<dc:creator>Tjahjana, Redemtus Heru</dc:creator>
	<dc:description xml:lang="en-US">In this paper, a linear model of multi agent movement in equilateral triangle formation is considered. The agents have initial and final state in triangular formation. Along the motion, all agents can not move far away and collide. The agents are steered from initial position to final position in fixed time. For this goal, optimal control with Pontryagin Maximum Principle  is applied and the classic difficulty in the optimal control problem is appear. To solve the classic difficulty above, the steepest descent method is used.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3876</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 3 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3876/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/866</identifier>
				<datestamp>2011-04-21T07:27:21Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESTIMASI REGRESI WAVELET THRESHOLDING  DENGAN METODE BOOTSTRAP</dc:title>
	<dc:creator>Suparti, Suparti</dc:creator>
	<dc:creator>Mustofa, Achmad</dc:creator>
	<dc:creator>Rusgiyono, Agus</dc:creator>
	<dc:description xml:lang="en-US">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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/866</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 2 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/866/736</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12255</identifier>
				<datestamp>2016-10-11T04:00:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL PERTUMBUHAN LOGISTIK  DENGAN  KONTROL OPTIMAL PENYEBARAN DEMAM BERDARAH DENGUE</dc:title>
	<dc:creator>., Kartono</dc:creator>
	<dc:creator>., Widowati</dc:creator>
	<dc:creator>Utomo, Robertus Heri Soelistyo</dc:creator>
	<dc:creator>Tjahjana, Redemtus Heru</dc:creator>
	<dc:description xml:lang="en-US">Controlling of spread of dengue fever was sought by the government together with the people by, among others, campaigning “3M controlling” and eradicating of the vector population using insecticide and threating the infected people. The aim of this research is constructing the optimal control dynamic model by applying several strategies to control the spread of dengue fever. In this paper, the optimal control is constructed by using host logistic growth population model approach and then it is solved by using maximum Pontryagin principle. The results show that in the equilibrium condition, the effect of the control variable u1 (“3M campaigning” and eradicating of the mosquito by using insecticide) is strongly affected by the rate of the direct contact between host population and the infected and susceptible vector whereas the control variable u2 is strongly affected by the number of the infected host population</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12255</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12255/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/611</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE PENYELESAIAN MASALAH CAUCHY DEGENERATE NONHOMOGEN MELALUI PENYELESAIAN MASALAH CAUCHY NONDEGENERATE NONHOMOGEN</dc:title>
	<dc:creator>hariyanto, Susilo</dc:creator>
	<dc:description xml:lang="en-US">In this article, we investigate how to solve abstract degenerate Cauchy problems nonhomogen via abstract nondegenerate Cauchy problems nonhomogen. The problem are discussed in the Hilbert space H  which can be written as an orthogonal direct sum of Ker M and . Under certain assumptions it is possible to reduce the problems to an equivalent  nondegenerate Cauchy problem in the factor space   H/Ker M  which can be easier to solve. Moreover we defines an operator ZA which maps the solutions of abstract nondegenerate Cauchy problems nonhomogen to abstract degenerate Cauchy problems nonhomogen  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/611</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/611/481</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1345</identifier>
				<datestamp>2012-01-25T04:43:58Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Penentuan Kestabilan Sistem Kontrol Lup Tertutup Waktu Kontinu dengan Metode Transformasi ke Bentuk Kanonik Terkontrol</dc:title>
	<dc:creator>Heri, Robertus</dc:creator>
	<dc:description xml:lang="en-US">Kestabilan suatu sistem kontrol lup tertutup, baik waktu kontinu maupun waktu diskrit ditentukan oleh letak pole (pembuat nol untuk suku banyak penyebut) di bidang s atau z. Suatu sistem control lup tertutup waktu kontinu dikatakan stabil jika polenya terletak di sebelah kiri sumbu imajiner (bagian real dari nilai eigen bertanda negatif). Meskipun suatu sistem sudah stabil, belum tentu pole-pole dari system tersebut sesuai yang diinginkan, sebab hal ini menentukan tingkat kecepatan terjadinya kestabilan system tersebut. Penempatan pole sesuai yang diinginkan, dimungkinkan jika dan hanya jika sistem dalam keadaan terkontrol lengkap. Tulisan ini membahas suatu teknik penempatan pole dari sistem waktu kontinu dengan mengubah suatu sistem menjadi bentuk kanonik terkontrol</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1345</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 1 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1345/1106</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/13541</identifier>
				<datestamp>2017-03-02T04:45:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KONSTRUKSI INTEGRAL MENGGUNAKAN  FUNGSI SEDERHANA –  PADA  [A,B]</dc:title>
	<dc:creator>Aziz, Abdul</dc:creator>
	<dc:creator>Sumanto, YD</dc:creator>
	<dc:description xml:lang="en-US">In this paper, weconstruct the δ –  simple functionusing the δ- fine Perron partition. By this function, we defineintegral, which is called Ho integral. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-03-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/13541</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 3 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/13541/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/706</identifier>
				<datestamp>2010-12-21T05:35:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS RAGAM MULTIVARIAT UNTUK RANCANGAN ACAK LENGKAP DENGAN PENGAMATAN BERULANG</dc:title>
	<dc:creator>tatik, widiharih</dc:creator>
	<dc:description xml:lang="en-US">            Rancangan satu faktor dengan satuan percobaan yang dipergunakan relatif homogen dan pengamatan dilakukan secara berulang dalam waktu yang berbeda selama periode percobaan dikenal dengan RAL in Time. Waktu pengamatan dipandang sebagai faktor tambahan yang dialokasikan kedalam anak petak, sehingga RAL in time seolah olah dipandang sebagai rancangan split plot. Analisis ragam multivariat digunakan bila respon yang diamati dalam suatu penelitian lebih dari satu. Setiap model rancangan mempunyai analisis ragam multivariat yang bersesuaian. Statistik hitung yang digunakan salah satunya Wilk’s Lamda, yang dibandingkan dengan statistik tabel U. Dengan suatu transformasi statistik Wilk’s Lamda dapat didekati dengan statistik F yang berdistribusi F Fisher. Asumsi dalam manova adalah galat menyebar multinormal dengan vektor rata rata  vektor nol dan matriks peragam (varian-kovarian) homogen. Penyelidikan asumsi multinormal dilakukan dengan plot quantil-quantil didekati dengan quantil chi-kuadrat , sedangkan asumsi kehomogenan matriks peragam dilakukan dengan uji Box’s M. Uji lanjut dari faktor yang berpengaruh nyata terhadap respon yang diamati digunakan uji pembanding ortogonal.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/706</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 3 (2001): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/706/568</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1377</identifier>
				<datestamp>2012-01-25T07:12:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODA BEDA HINGGA PADA PERSAMAAN KDV GELOMBANG INTERFACE</dc:title>
	<dc:creator>Wiryanto, L.H</dc:creator>
	<dc:creator>Djohan, Warsoma</dc:creator>
	<dc:description xml:lang="en-US">Propagation of interfacial wave, modeled in an equation of KdV type, is solved numerically. A finite different method is used to construct a system of linear equations from the model, and the system is solved by Gauss-Seidel method. This numerical procedure is firstly tested for solitary wave, which gives agreement to the analytical solution, and is then used to observe a simulation of wave propagation generated on the left by a generator, for some various values of parameters, depth and fluid density</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1377</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 1 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1377/1140</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/771</identifier>
				<datestamp>2011-01-11T05:12:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE PENENTUAN BENTUK PERSAMAAN RUANG KEADAAN WAKTU DISKRIT</dc:title>
	<dc:creator>Heri, Robertus</dc:creator>
	<dc:description xml:lang="en-US">Tulisan ini membahas penentuan persamaan ruang keadaan dari sistem waktu diskrit dalam bentuk: kanonik terkontrol, kanonik terobservasi, kanonik diagonal, serta kanonik Jordan dengan menggunakan metoda pemrograman langsung, pemrograman bersarang dan perluasan pecahan sebagian. Juga dibahas ketidaktunggalan persamaan ruang keadaan dari suatu sistem yang diberikan, yang dibuktikan dengan relasi antara dua vektor keadaan yang berdimensi sama, dimana satu sama lain dihubungkan oleh sebarang matriks non singular.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/771</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 2 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/771/632</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/857</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PELABELAN TOTAL TITIK AJAIB GRAF HASIL KALI KARTESIUS DARI GRAF SIKEL</dc:title>
	<dc:creator>nita, maria</dc:creator>
	<dc:creator>Soelistyo, R. Heri</dc:creator>
	<dc:description xml:lang="en-US">A vertex-magic total labeling of graph , with the vertices  and the edges  is the bijection from  to the set of integers , and for each vertex  in  satisfying ,  is the vertex that adjacent with , then  named a magic constant in . The sum of the label of  and the labels of all edges  incident to the  is the same for all vertices of  and  named vertex-magic total graph. Vertex-magic total labeling of cartesian products of cycles, with the type , with  and  is odd are the labeling to the  and the concept used to label  is -vertex antimagic total labeling and to label  it is used vertex magic total labeling of cycles, with the cycle is odd.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/857</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/857/727</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12246</identifier>
				<datestamp>2016-10-11T02:44:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE DEKOMPOSISI DAN METODE BIG-MUNTUK MENYELESAIKAN PROGRAM LINIER VARIABEL FUZZY TRIANGULAR STUDI KASUS: HOME INDUSTRI BOROBUDUR FURNITURE, BOGOR, INDONESIA</dc:title>
	<dc:creator>Puspitasari, Nanda</dc:creator>
	<dc:creator>Irawanto, bambang</dc:creator>
	<dc:creator>., Widowati</dc:creator>
	<dc:description xml:lang="en-US">Fuzzy Variable Linear Programming (FVLP) with triangular fuzzy variable is part of not fully fuzzy linear programming with decision variables and the right side is a fuzzy number. Solving  FVLP with triangular fuzzy variables used Decomposition Methods and Big-M Methods by using Robust Ranking to obtain crisp values. DecompositionMethods of resolving cases maximization and minimization FVLP by dividing the problems into three parts CLP. Solving FVLP with Big-M Methods to directly solve the minimization case FVLP do without confirmation first. The optimal solution fuzzy, crisp optimal solution, optimal objective function fuzzy and crisp optimal objective function  generated from Decomposition Methods and Big-M Methods for minimizing case has same solution. Decomposition Methods has a longer process because it divides the problem into three parts CLP and Big-M Methods has a fewer processes but more complicated because the process without divide the problems into three parts</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12246</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 1 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12246/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1332</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SIFAT PERIODIK JARINGAN ANTRIAN SERI TERTUTUP  DENGAN PENDEKATAN ALJABAR MAX-PLUS</dc:title>
	<dc:creator>Rudhito, M Andy</dc:creator>
	<dc:creator>Wahyuni, Sri</dc:creator>
	<dc:creator>Suparwanto, Ari</dc:creator>
	<dc:creator>Susilo, Frans</dc:creator>
	<dc:description xml:lang="en-US">  Abstract. This article discussed about the properties of  closed periodic queuing network series susing max-plus algebra. The result showed that the properties of  closed periodic dinamic queuing network series can be determined by using the concept of eigen values ​​and eigen vectors of max-plus matrix in the network model. Through the max-plus eigen vector fundamental, can be determined faster early time departure of customers of departure to the next customer periodically, with a large period of max-plus eigenvalue</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1332</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1332/1095</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1332/1096</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12277</identifier>
				<datestamp>2016-10-11T05:31:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERSAMAAN UMUM JUMLAH EDGE DAN TITIK  PADA CYCLE EXTENSION CUBIC GRAPH</dc:title>
	<dc:creator>Hambali, Mohamad Ibnu</dc:creator>
	<dc:creator>., Wamiliana</dc:creator>
	<dc:creator>., Fitriani</dc:creator>
	<dc:description xml:lang="en-US">In this research we will discuss about cycle extension  of  cubic graph. The cubic graphs used are the cucic graph with n(V(G)) ≤ 8 and k ≥ 3, ;  k is the length of the cycle C and li is the number of vertices or points on  that located between  and  .  The construction process for determining the  use six operations which are M1, M2, M3, M4, M5, dan M6. The result of M1 process on     is a non Hamiltonian cycle while the results of M2, M3, M4, M5, and M6 are Hamiltonian cycles. We also show that the  number of vertives on the   is  n(V()) = n (V(G)) + 2 k  , and  the number of edges on the   is  n(E() = n (E(G)) + 3 k.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12277</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 3 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12277/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/679</identifier>
				<datestamp>2010-12-20T04:37:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KAJIAN PERBAIKAN  KECEPATAN  WAKTU EKSEKUSI  TERHADAP UNJUK KERJA PIRANTI INPUT/OUTPUT</dc:title>
	<dc:creator>suhartono, suhartono</dc:creator>
	<dc:description xml:lang="en-US">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</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/679</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 2 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/679/543</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1368</identifier>
				<datestamp>2012-01-25T06:25:05Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGANTAR UJI STABILITAS UNTUK MODEL KOMPETISI ANTARA DUA POPULASI</dc:title>
	<dc:creator>Warsiki, Endang</dc:creator>
	<dc:creator>Parhusip, Hanna Arini</dc:creator>
	<dc:description xml:lang="en-US">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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1368</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 2, No 8 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1368/1129</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/762</identifier>
				<datestamp>2011-01-11T05:07:33Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EFISIENSI PENGGUNAAN V-CYCLE DALAM METODE FUNGSI WALSH UNTUK MENYELESAIKAN PERSAMAAN INTEGRAL FREDHOLM LINEAR</dc:title>
	<dc:creator>Widyaningsih, Purnami</dc:creator>
	<dc:description xml:lang="en-US">Uljanov and Blyth have developed a new numerical method for the solution of linear  Fredholm integral equations using Walsh functions. The approximate solution is constructed by rewriting the functions as truncated (to m terms) Walsh series and the kernel as truncated double Walsh series. For the equations, this method gives linear systems. The systems then solved using Gauss elimination.  In order to improve the efficiency,  the idea of multigrid, especially v-cycle, is proposed to solve  the linear systems. Here, numerical experiment with standard test problems for numerical solution of linear Fredholm integral equations show that this approach is effective in improving the efficiency of the Walsh function method.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/762</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 1 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/762/623</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1400</identifier>
				<datestamp>2012-01-26T04:33:15Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">GEOMETRI EUCLID EG(2, pn) UNTUK MEMBENTUK  RANCANGAN BLOK TIDAK LENGKAP SEIMBANG</dc:title>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:creator>Hidayati, Yuni</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿A Balanced Incomplete Block (BIB) design with parameters  is an arrangement of v distinct objects into b bloks such that each block contains exactly k distinct objects, each object occurs in exactly r different blocks, and every pair of distinct object  occurs together in exactly l blocks. Euclidean geometry EG (2, pn) is the finite geometry of two dimensions over the Galois Field GF(pn). By considering that the object of BIB design is same with the points of EG(2, pn) and the blocks which contain those objects are same with the lines which contain the points from EG(2, pn),  EG (2, pn) can be used to construct BIB design.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1400</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 3 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1400/1164</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/848</identifier>
				<datestamp>2012-01-30T05:04:00Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KONSTRUKSI LEXICOGRAPHIC UNTUK MEMBANGUN KODE HAMMING (7, 4, 3)</dc:title>
	<dc:creator>Aini, Aurora Nur</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">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.   </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/848</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/848/1181</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12374</identifier>
				<datestamp>2016-10-21T01:24:56Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PELABELAN AKAR RATA-RATA KUADRAT PADA GRAF LADDER〖 L〗_n DAN GRAF CORONA〖 P〗_n⨀K_2</dc:title>
	<dc:creator>Mubarok, Azhar</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:description xml:lang="en-US">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. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12374</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 2 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12374/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1320</identifier>
				<datestamp>2012-02-16T06:37:48Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BEBERAPA SIFAT SMALL RIEMANN SUMS  FUNGSI TERINTEGRAL HENSTOCK-KURZWEIL  DARI RUANG EUCLIDn KE RUANG BANACH X</dc:title>
	<dc:creator>Khabibah, Siti</dc:creator>
	<dc:creator>Darmawijaya, Soeparna</dc:creator>
	<dc:description xml:lang="en-US">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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1320</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1320/1083</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12270</identifier>
				<datestamp>2016-10-11T05:12:54Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ENDOMORFISMA RIGID DAN COMPATIBLE PADA  RING DERET PANGKAT TERGENERALISASI MIRING</dc:title>
	<dc:creator>Faisol, Ahmad</dc:creator>
	<dc:description xml:lang="en-US">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    .  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12270</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 2 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12270/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/627</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">RUANG BANACH    SEBAGAI RUANG OPERATOR YANG DIBANGKITKAN OLEH FUNGSI TERUKUR DAN TERBATAS ESSENSIAL</dc:title>
	<dc:creator>A, Muslim</dc:creator>
	<dc:creator>sumanto, sumanto</dc:creator>
	<dc:description xml:lang="en-US">In this paper, we construct a new normed Banach space  from collection of all Carleman operators from Hilbert spaceinto Lebesgue space , denoted by   with respect to the norm for every  generated by an essensially bounded measurable function . </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/627</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/627/496</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1359</identifier>
				<datestamp>2012-01-25T05:31:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENILAIAN EFISIENSI BANK UMUM SWASTA NASIONAL DEVISA DAN BANK ASING DENGAN MENGGUNAKAN DATA ENVELOPMENT ANALYSIS (DEA)</dc:title>
	<dc:creator>Sulistiyo, Sulistiyo</dc:creator>
	<dc:creator>Sumitro, Sumitro</dc:creator>
	<dc:description xml:lang="en-US">Banking Industry the improvement of Indonesia cause increasing of competition level between bank, so the appraisal of bank’s efficiency becomes more important, because the efficiency is the describes the performance of the company work. The method used to measure bank efficiency in this paper is Data Envelopment Analysis (DEA), a technic linear programming that calculating output ratio to input of each DMU. DMU is called efficient if the efficiency value is one, if the value is less than one it means DMU not efficient. DEA is also ready to give solution for other banks on sample which was not efficient to be more efficient. Bank’s efficiency which is valuated in this paper are national commercial banks in Indonesia and foreign banks. The determination of input and output of bank based on bank behavior theory was using intermediation approach. The used optimization method in this paper to increase bank efficiency  of inefficiency bank is optimization of input oriented method.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1359</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 1 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1359/1120</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/726</identifier>
				<datestamp>2010-12-22T06:42:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">REFORMULASI DARI SOLUSI 3-SOLITON  UNTUK PERSAMAAN KORTEWEG-de VRIES</dc:title>
	<dc:creator>mustikaningsih, Dian</dc:creator>
	<dc:creator>sutimin, sutimin</dc:creator>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/726</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 2 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/726/583</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1391</identifier>
				<datestamp>2012-01-26T01:55:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">INFERENSI FUNGSI KETAHANAN  DENGAN METODE KAPLAN-MEIER</dc:title>
	<dc:creator>Widiharih, Tatik</dc:creator>
	<dc:creator>Andriani, Nasichah Siska</dc:creator>
	<dc:description xml:lang="en-US">. 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.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1391</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 3 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1391/1155</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3881</identifier>
				<datestamp>2012-08-09T04:19:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL DINAMIS RANTAI MAKANAN TIGA SPESIES</dc:title>
	<dc:creator>Pratikno, Wiji Budi</dc:creator>
	<dc:creator>Sunarsih, Sunarsih</dc:creator>
	<dc:description xml:lang="en-US">. Three species food chain models are model that express the interaction of three populations of prey, first predator and second predator populations. The models are derived from a combination of logistic growth model between prey population and predator population. Model that is used is a Holling type II functional response. The model consists of non linear differential equations with three dependent variables, there are                                                    representing size of prey population at time    ,     is size of  first predator population at time    , and     is size of second predator population at time    . From the result of stability analysis conducted on the food chain model of three species are found six equilibrium points based on the value eigen, and six cases of different stability.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3881</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 3 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3881/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1311</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TITIK TETAP NADLR FUNGSIMULTI NILAI KONTRAKTIF PADA RUANG METRIK ϰ(X)</dc:title>
	<dc:creator>Rinurwati, Rinurwati</dc:creator>
	<dc:description xml:lang="en-US">In this paper to be discussed about Nadlr fixed point of contractive multivalued function on. This results can be considered as a generalizations of Bollobus et al result complete metrice space X.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1311</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1311/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12260</identifier>
				<datestamp>2016-10-11T04:02:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROGRAM LINIER FUZZY PENUH DENGAN ALGORITMA MULTI OBJECTIVE LINEAR PROGRAMMING</dc:title>
	<dc:creator>S, Mohammad Ervan</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:creator>., Sunarsih</dc:creator>
	<dc:description xml:lang="en-US">In the linear programming there is one of the certainty assumptions, where each parameters has been known with certainty, but in this real life, the parameters is often can not be stated with certainty, so that the linear programming developed into fully fuzzy linear programming (FFLP). This paper discusses the problem solving FFLP problem with Multi Objective Linear Programming Algorithm. FFLP problem will be converted to MOLP problem with three objective functions by using a new lexicographic ordering on triangular fuzzy numbers and then it is solved by lexicographic method. The value of the fuzzy optimal solution obtained is used to find the optimal value of fuzzy objective function and then do defuzzification to obtain crisp optimal solutions</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12260</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12260/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/616</identifier>
				<datestamp>2013-05-29T04:32:36Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENERAPAN MATEMATIKA PADA SISTEM PEMBAYARAN DISKRET DAN KONTINU ASURANSI KEMATIAN</dc:title>
	<dc:creator>Nuraeni, Gina</dc:creator>
	<dc:creator>sunarsih, Sunarsih</dc:creator>
	<dc:description xml:lang="en-US">As guarantee in a life insurance is which caused by death. The death results loss of income of someone or the family. With the result that, a life insurance provides a payment of specified amount upon the death of a given life. There are two systems in this payment, that the insurance payable at the moment of death (continuing insurance) and the insurance payable at the end of the year of death (discrete insurance). If life table are uniformly distributed, so there is a relationship that an immediate payment is equivalent on the average to a payment of  at the end of the year of death.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/616</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 1 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/616/486</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1350</identifier>
				<datestamp>2012-01-25T04:58:23Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SIFAT–SIFAT IDEAL KUASI REGULAR</dc:title>
	<dc:creator>Tjahjana, Redemtus Heru</dc:creator>
	<dc:description xml:lang="en-US">Tulisan ini membahas sifat ideal kuasi regular dimulai dari pengertian elemen kuasi regular dan sifat-sifatnya. Dari pengertian elemen kuasi regular dapat dipergunakan untuk membangun pengertian ideal kuasi regular. Ideal kuasi regular kanan adalah ideal kanan dari suatu ring dan setiap elemennya adalah elemen kuasi regular kanan. Ideal kuasi regular kiri adalah ideal kiri dari suatu ring dan setiap elemennya adalah elemen kuasi regular kiri. Untuk mempelajari  ideal kuasi lebih lanjut juga dituliskan tentang Jacobson radikal.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1350</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 2 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1350/1111</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/13546</identifier>
				<datestamp>2017-03-02T04:45:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE SIMPLEKS PRIMAL-DUAL PADA PROGRAM LINIER FUZZY PENUH DENGAN BILANGAN TRAPEZOIDAL</dc:title>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:creator>Suryoto, Suryoto</dc:creator>
	<dc:creator>Handayani, Rizky</dc:creator>
	<dc:description xml:lang="en-US">Program linier dengan koefisien fungsi tujuan bilangan trapezoidal fuzzy (FNLP) dan program linier dengan variabel trapezoidal fuzzy (FVLP) merupakan bentuk dari program linier fuzzy tidak penuh. FNLP memiliki bentuk bilangan trapezoidal fuzzy hanya pada koefisien fungsi tujuannya saja, sedangkan FVLP memiliki bentuk bilangan trapezoidal fuzzy pada variabel keputusan dan konstanta ruas kanannya. Kasus minimasi dari FNLP dan FVLP dapat diselesaikan dengan metode simpleks dual. Bentuk bilangan trapezoidal fuzzy harus diubah ke bentuk bilangan crisp terlebih dahulu dengan menggunakan fungsi peringkat untuk menentukan entering variable dan leaving variablenya.Nilai fungsi tujuan optimalyang dihasilkan berupa bilangan trapezoidal fuzzy dan bilangan crisp.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-03-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/13546</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 3 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/13546/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/711</identifier>
				<datestamp>2010-12-21T06:17:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">METODE ELEMEN HINGGA UNTUK MASALAH SYARAT BATAS DARI OPERATOR DIFERENSIAL POSITIF</dc:title>
	<dc:creator>sutrima, sutrima</dc:creator>
	<dc:description xml:lang="en-US">The purpose of this research is to investigate numerical solutions of boundary value problems of positive differential operator by finite-element methods.  The results showed that the finite-element methods can be implemented to obtained numerical solutions of boundary value problems of second-order positive differential operator.  Moreover, rate of convergence of Ritz finite-element with Lagrange quadratic interpolation be  in the the -norm and  in the energy norm.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/711</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 1 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/711/573</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1382</identifier>
				<datestamp>2012-01-25T07:12:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGGUNAAN ANALISIS REGRESI LOGISTIK UNTUK MENGANALISIS PERILAKU DAN FAKTOR-FAKTOR YANG MEMPENGARUHI MINAT BACA PENGUNJUNG BADAN PERPUSTAKAAN PROPINSI JAWA TIMUR</dc:title>
	<dc:creator>Kusrini, Dwi Endah</dc:creator>
	<dc:creator>Puspitasari, Dwi</dc:creator>
	<dc:description xml:lang="en-US">This research aim is to know factors and behavior influencing enthusiasm read  Library  visitor Province East Java (Baperpus) by using primary data obtained from survey as much 340 visitor. Method used in this research is Logistic Regression Analysis where the respon variable  is level enthusiasm read visitor ( 1=high, 2= low), while the prediktor variables are visitor behaviors and characteristics variable and got result that there is dependency which signifikan between three variable that is visitor education variable, visit time and visitor work. There no dependency which signifikan between three variable that is between visitor age variable, visitor work and frequency to visit  Baperpus. There no dependency which signifkan between three variable that is between visitor age variable, work and time reside in Baperpus. While based on the model which is formed by Logistic Regression Analysis that one who come when morning with frequency  visit to Baperpus less than once within a week and time reside in Baperpus less than one clock have opportunity of enthusiasm read high equal to 0,19. While one who come when daytime with frequency pay a visit to Baperpus 1-2 times within a week and time reside in Baperpus 1-2 clock have opportunity of enthusiasm read high equal to 0,61. One who come when morning with frequency visit to Baperpus less than once within a week and old reside in Baperpus 2-3 clock have opportunity of enthusiasm read high equal to 0,275 and one who come when daytime with frequency visit to Baperpus 1-2 times within a week and time reside in Baperpus 2-3 clock have opportunity of enthusiasm read high equal to 0,57.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1382</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 1 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1382/1146</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/787</identifier>
				<datestamp>2011-01-19T07:34:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">HUKUM SYLVESTER INERSIA</dc:title>
	<dc:creator>Tjahjana, R. Heru</dc:creator>
	<dc:description xml:lang="en-US">Matriks representasi suatu bentuk kuadrat dapat disajikan sebagai matriks diagonal. Elemen pada diagonal utama matriks representasi tersebut dapat dipandang sebagai fungsi linear yang tidak tunggal. Karena tidak tunggal maka diperlukan teorema atau hukum yang mengatur karakterisasi representasi yang dapat disajikan dengan tidak tunggal. Hukum inilah yang dikenal sebagai hukum Sylvester Inersia.Hukum Sylvester tentang Inersia menyatakan bila U ruang produk dalam real dan f(x,y) form  bilinear simetri di U maka terdapatlah suatu basis B={f1,…,fn} dari U sedemikian hingga adalah matriks diagonal dengan f(fi,fj)= ei dij,  dengan   ei =1, jika 0&lt;i&lt;k, ei =-1, jika k&lt;i&lt;r, dan ei =0, jika r&lt;i&lt;n, lebih lanjut k dan r tertentu dengan tunggal oleh f.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/787</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 3 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/787/648</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3872</identifier>
				<datestamp>2012-08-09T03:39:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">CITIZEN CENTERED MODELS USING MOBILE TECHNOLOGY  APPLICATIONS FOR M-GOVERNMENT</dc:title>
	<dc:creator>Nugraheni, Dinar Mutiara Kusumo</dc:creator>
	<dc:description xml:lang="en-US">This research paper will present an existing application and the opportunity m-government services base on mobile technology applications. First we examine the existing applications in mobile technology that can be used for m-government services around world. Secondly, we will look at the benefit and disadvantages those mobile technology applications for m-government services. In addition, it will provide an overview the development of ICT in Indonesia and recognizing the particular challenges that exist for e-government in Indonesia. Then, we will create an analysis as the citizen centered models for m-government base on smart phone mobile technology application.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3872</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 3 (2011): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3872/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/862</identifier>
				<datestamp>2011-04-21T02:17:12Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SIMULASI LINTASAN JALUR TERPENDEK ALGORITMA DIJKSTRA BERBASIS EXTENSIBLE MARKUP LANGUAGE (XML)</dc:title>
	<dc:creator>WIDODO, ARIS PUJI</dc:creator>
	<dc:description xml:lang="en-US"> An optimation is a classical problem to use determine decision making. Traditionally to solve an optimation problem, it is needed a precission and long time. The improvement of this problem, needs simulation software development, less time relatively, and the result more than manually calculated, cause error probability to much. This research concern to make a simulation software based on Dijkstra Algorithm, as tool to give informations on the optimation decision making.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/862</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 1 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/862/732</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12249</identifier>
				<datestamp>2016-10-11T03:28:25Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KINERJA SISTEM LUP TERTUTUP DENGAN PENGENDALI  LINEAR QUADRATIC GAUSSIAN PADA SISTEM MASSA PEGAS</dc:title>
	<dc:creator>., Predesia</dc:creator>
	<dc:creator>., Widowati</dc:creator>
	<dc:description xml:lang="en-US">Linear Quadratic Gaussian (LQG) controller is one of the controllers used to stabilize a plant.  The plant is an object that is controlled.  The procedure to find this controller as follows; first, the plant is balanced so that controllability and observability Grammians is equal to square Hankel singular values diagonal matrix, then look for the controller gain and estimator gain that are solutions of Riccati equations.  Next, construct a state space realization of LQG controller.  To verify the performance of  the obtained controller, its was applied for the spring mass system.  Further, by using MATLAB program, the performance of the closed loop system with the LQG controller and the open loop system is compared.  The simulation results show that the closed loop system can be stabilized in less than 10 seconds, whereas the open loop system can be stabilized in 3000 seconds. This indicate that the performance of the closed loop system with LQG controller better than the open loop system</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12249</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 16, No 1 (2013): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12249/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12249/pdf_1</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/607</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SIFAT-SIFAT GRAF  (2n)</dc:title>
	<dc:creator>L., Erly</dc:creator>
	<dc:creator>Hariyanto, Susilo</dc:creator>
	<dc:description xml:lang="en-US">A sequence of non negative integers d = (d1, d2, …, dn) is said a sequence of graphic if it is the degree sequence of a simple graph G. In this case, graph G is called realization for d. The set of all realizations of  non isomorfic 2-regular graph with order n (n ≥ 3) is denoted R(2n), whereas a graph with R(2n) as set of  their vertices is denoted (2n) . Two vertices in graph (2n)  are called adjacent if one of these vertices can be derived from the other by switching. In the present paper, we  prove that  for n ≥ 6, (2n) is a connected and bipartite graph.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/607</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/607/477</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1337</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">HIMPUNAN SEMI KONTINU DALAM RUANG TOPOLOGI</dc:title>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:description xml:lang="en-US">It should be noted to understand some material about the topology of real number, continuous function in topological spaces, open function, closed function in topological spaces. For semi-continous function expected to understand the concept of semi-open sets in topological spaces.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1337</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1337/1101</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12368</identifier>
				<datestamp>2016-10-21T01:23:50Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL ECONOMIC ORDER QUANTITY (EOQ) DENGAN MEMPERTIMBANGKAN SEBAGIAN PENUNDAAN WAKTU PEMBAYARAN  PADA SISTEM PARSIAL BACKORDER</dc:title>
	<dc:creator>Maslahah, Heny</dc:creator>
	<dc:creator>., Sunarsih</dc:creator>
	<dc:creator>., Farikhin</dc:creator>
	<dc:description xml:lang="en-US">The problem of inventories commonly facing the company is determining the optimal order quantities so the demand must be fulfilled. In transaction betwen seller and buyer specified delay of payment is offered by the seller, so given one of alternative the inventory model an Economic Order Quantity (EOQ) with consider partial delayed payment on the partial backordering system. In the inventory model, retailer allowed to make partial payment at the beginning of the period to supplier and the remaining amount can be paid at the end of the period has been determined. There are two condition of stockout are stockout on the condition of lost sales  and stockout on the condition of backorder . Based on the inventory model can determined when the period to make order and how many should be order, so the total cost of inventory issued to be minimum and total profit can be maximum. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12368</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 2 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12368/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/684</identifier>
				<datestamp>2010-12-20T04:37:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROSES STOKASTIK KELAHIRAN-KEMATIAN DENGAN DUA JENIS KELAMIN SECARA KELOMPOK PADA PROSES YULE-FURRY</dc:title>
	<dc:creator>samsuryadi, samsuryadi</dc:creator>
	<dc:description xml:lang="en-US">The research is carried out to build stochastic model from cluster birth-death process with two sexes on Yule-Furry process, since the formula or stochastic model from that stochastic process is not presented yet, where as a lot of phenomena are represented about that stochastic process. Model development is basically to find postulate form and differential equation. The final results of this research are postulate and differential equation from stochastic process, partial differential equation for transition probability generating function, and joint moment generating function.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/684</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 2 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/684/548</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1373</identifier>
				<datestamp>2012-01-25T06:51:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERBANDINGAN ESTIMATOR REGRESI NONPARAMETRIK MENGGUNAKAN METODE FOURIER DAN METODE WAVELET</dc:title>
	<dc:creator>Suparti, Suparti</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿﻿﻿Let  be independent observation data and follows a model  Yi = f(Xi) + eI ,  i =1,2,...,n  with f is an unknown regression function and ei are independent random variables with mean 0 and variance s2. The function f could be estimated by parametric and nonparametric appro-aches. In nonparametric approach, the function f is assumed to be a smooth function or quadratic integrable function. If f belongs to the Hilbert space L2(R) then the function f could be estimated by estimator of orthogonal series, especially by Fourier series estimator. Another estimator of orthogonal series  which could be use  to estimate f is wavelet estimator. Wavelet estimator is an extention of Fourier series estimator  but it is more effective than the Fourier series estimator because the its IMSE converges to zero quicker than the Fourier series estimator.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1373</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 3 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1373/1136</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/767</identifier>
				<datestamp>2011-01-11T05:09:28Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MASALAH RUTE TERPENDEK PADA JARINGAN JALAN MENGGUNAKAN LAMPU LALU-LINTAS Studi Kasus: Rute Perjalanan Ngesrep – Simpang Lima</dc:title>
	<dc:creator>P, Eko Budi</dc:creator>
	<dc:creator>sunarsih, Sunarsih</dc:creator>
	<dc:description xml:lang="en-US">Permasalahan rute terpendek pada jaringan jalan yang menggunakan lampu lalu-lintas bertujuan untuk menentukan rute yang menghubungkan titik asal s dan titik tujuan j, yang mempunyai waktu perjalanan total minimum. Lampu lalu-lintas pada jaringan jalan ini diasumsikan hanya terdiri dari dua fase yaitu merah dan hijau, dengan periode waktu siklus adalah konstan. Permasalahan ini dapat direpresentasikan kedalam graph berarah, dengan waktu perjalanan untuk tiap-tiap jalan adalah bobot arc, dan waktu tunggu pada persimpangan jalan merupakan bobot titik. Waktu perjalanan dari titik asal ke titik tujuan dipengaruhi oleh dua faktor yaitu waktu perjalanan untuk tiap jalan dan waktu tunggu pada persimpangan jalan, dengan lamanya waktu tunggu diatur oleh lampu lalu-lintas. Untuk menyelesaikan permasalahan rute terpendek ini digunakan algoritma Ford Moore Bellman yang telah dimodifikasi. Pada studi kasus: rute perjalanan Ngesrep – Simpang Lima, dengan menggunakan algoritma ini diperoleh waktu perjalanan minimum dari rute tersebut adalah 10 menit 59 detik, melalui rute Setya Budi  Teuku Umar  Sultan Agung  Diponegoro  Pahlawan  Simpang Lima, dengan beberapa asumsi yaitu: kecepatan kendaraan ketika melewati rute ini adalah konstan yaitu 40 km/jam, tidak terdapat kemacetan pada rute tersebut dan kendaraan hanya berhenti di persimpangan jalan karena lampu lalu-lintas.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/767</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 2 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/767/628</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/853</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS  SISTEM NON LINEAR MELALUI  PENDEKATAN  SISTEM LINEAR DENGAN PARAMETER BERUBAH-UBAH</dc:title>
	<dc:creator>widowati, widowati</dc:creator>
	<dc:description xml:lang="en-US">This paper proposes  the relation between nonlinear systems with LPV systems (Linear  Parameter Varying  systems) where the non-linear systems can be described as LPV systems. Based  on the LPV systems description, the nonlinearity of the systems is represented by parameters  varying. Local properties of nonlinear systems are presented. It is assumed that all the conditions for the existence and uniqueness of solutions have been met. It is also assumed that the origin is a stationary point. Then, we will discuss how to analyze the stability of non-linear systems using the LPV systems approach. Furthermore, the bounds  of parameters to ensure the asymptotic stability of nonlinear systems  are given. To verify the proposed method, numerical simulations are demonstrated  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/853</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/853/723</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12242</identifier>
				<datestamp>2016-10-11T02:44:26Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MOTIVASI DEFINISI INVERS MOORE PENROSE PADA RING DENGAN ELEMEN SATUAN YANG DILENGKAPI INVOLUSI</dc:title>
	<dc:creator>SRRM, Titi Udjiani</dc:creator>
	<dc:description xml:lang="en-US">Development on the research of the  inverse  matrix until the Moore Penrose inverse matrix motivate researchers to conduct the research on the Moore Penrose inverse and the inverse of element in the ring with a unit element. The  used method  is  expanding the definition of   inverse in matrix to the ring with a unit element. Also  generalizing the  transpose  operation of matrix to  be a function of involution on the ring.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12242</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 1 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12242/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12242/pdf_1</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1325</identifier>
				<datestamp>2012-02-16T06:37:48Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS BIFURKASI MODEL PERTUMBUHAN TUMOR DENGAN PERSAMAAN LOGISTIK WAKTU TUNDA</dc:title>
	<dc:creator>Dewi, Febriana</dc:creator>
	<dc:creator>sutimin, sutimin</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿﻿﻿﻿In this paper is being studied about the logistic tumor growth model with time delay. The mathematical model is in non-linear differential equation with time delay difficult to find the solution analytically, so here we analyze the behavior of the model through perturbation. The tumor growth model has two equilibriums (i.e.at and ). Because this growth model is non-linear hence to analyze the stability of each equilibrium point is done through the linearization method. By using a perturbation procedure, the equilibrium point is unstable and is stable. The equilibrium is stable for , unstable for  and Hopf bifurcation occurs at .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1325</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1325/1088</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12275</identifier>
				<datestamp>2016-10-11T05:15:18Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OPTIMALISASI  LAMA PEMANFAATAN AREA TEPI DANAU BUATAN SEBAGAI FASILITAS REKREASI DI LINGKUNGAN PERUMAHAN</dc:title>
	<dc:creator>Alifiani, Amalia</dc:creator>
	<dc:creator>Supriyadi, Bambang</dc:creator>
	<dc:creator>Prianto, Eddy</dc:creator>
	<dc:creator>Irawanto, Bambang</dc:creator>
	<dc:description xml:lang="en-US">Much residential  built by developers who are equipped with an artificial lake as its attractiveness. Recreation area in a residential environment promotes the maintenance of security and generally are closed. Likely users recreation area is a internal  residential community and has more  the long term to do recreation activities. To take advantage of the length time of community recreation activities it could take effective visit, but in fact the use of recreation area on the time of artificial lake tends to be limited due to security In this paper to determine the optimal value of long utilization of the limited time constrains of use for users from within and outside the housing. Linear Programming method to use for analysis the three approach maximal visit time from deferent time, visit time 12 our, 15 our and 24 our,  obtained the higher of visitation time the longer  utilization.The users most optimal to use recreation area the community from internal residential because it is influenced by environment.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12275</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 2 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12275/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/672</identifier>
				<datestamp>2010-12-17T05:42:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KAJIAN DISKRETISASI DENGAN METODE GALERKIN SEMI DISKRET  TERHADAP EFISIENSI SOLUSI  MODEL RAMBATAN PANAS TANPA SUKU KONVEKSI</dc:title>
	<dc:creator>suhartono, Suhartono</dc:creator>
	<dc:creator>Zaki, Solikhin</dc:creator>
	<dc:description xml:lang="en-US">Penelitian ini bertujuan menyelidiki  efek  diskretisasi  dengan metode Galerkin Semi Diskret terhadap efisiensi solusi model rambatan panas tanpa suku konveksi. Indikator efisiensi yang diukur dalam penelitian ini adalah lama waktu proses komputasi dan lama waktu proses komputasi perlangkah. Sebagai pembanding  digunakan metode Beda Hingga. Permasalahan yang  diteliti adalah bagaimana mentranformasikan model rambatan panas tanpa suku konveksi  kebentuk sistem persamaan diferensial ordiner dengan melakukan diskretisasi pada peubah ruang dengan menggunakan metode Galerkin Semi Diskret. Selanjutnya sistem persamaan diferensial biasa yang diperoleh dari diskretisasi tersebut diintegrasikan dengan menggunakan  metode Runge  Kutta  Implisit  Diagonal (RKID). Hasil pengukuran menunjukkan bahwa solusi model rambatan panas tanpa suku konveksi  yang diperoleh berdasarkan diskretisasi perubah ruang menggunakan metode Galerkin Semi Diskret kurang efisien jika dibandingkan dengan solusi model rambatan panas tanpa suku konveksi yang diperoleh dengan diskretisasi perubah ruang menggunakan metode Beda Hingga. Hal tersebut dapat ditunjukkan berdasarkan lama waktu proses komputasi dan lama waktu proses komputasi perlangkah.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/672</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 1 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/672/539</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1364</identifier>
				<datestamp>2012-01-25T05:31:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">REDUKSI MASALAH CAUCHY ABSTRAK DEGENERATE  KE MASALAH CAUCHY ABSTRAK NONDEGENERATE</dc:title>
	<dc:creator>Haryanto, Susilo</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿﻿In this article, we investigate how to reduce an abstract degenerate Cauchy problem to an abstract nondegenerate Cauchy problems. This problem is discussed in the Hilbert space which can be writen as an orthogonal direct sum of Ker M and . Under certain assumptions, abstract degenerate Cauchy problems can be reduced to abstract nondegenerate Cauchy problems which is easier to solve. If we have a solution of abstract nondegenerate Cauchy problem, then using certain transformation we can find the solution of abstract degenerate Cauchy problems.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1364</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 1 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1364/1125</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/756</identifier>
				<datestamp>2011-01-10T02:33:45Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERANAN MATEMATIKA DAN STATISTIKA DALAM PEMBANGUNAN DAERAH</dc:title>
	<dc:creator>Miyasto, Miyasto</dc:creator>
	<dc:description xml:lang="en-US">PERANAN MATEMATIKA DAN STATISTIKA DALAM PEMBANGUNAN DAERAH</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/756</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 3 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/756/615</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1396</identifier>
				<datestamp>2012-01-26T04:33:15Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL LOGISTIK DENGAN DIFUSI PADA PERTUMBUHAN SEL TUMOR EHRLICH ASCITIES</dc:title>
	<dc:creator>Nirwansah, Hendi</dc:creator>
	<dc:creator>Widowati, Widowati</dc:creator>
	<dc:description xml:lang="en-US">This paper presents an approach of the Ehrlich ascities tumor growth modelling based on the logistic equation with diffusion. This model is constructed by using the concept of the reaction-diffusion equation. Besides that by using the principle of the travelling wave, a model equation with diffusion at tumor cell growth can be formed into the two non linear differential equation system. Then the equilibrium points of the non linear system will be obtained so that the stability of the model can be analized.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1396</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 3 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1396/1160</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/844</identifier>
				<datestamp>2012-01-30T05:04:00Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS LINTASAN KRITIS JARINGAN PROYEK  DENGAN PENDEKATAN ALJABAR MAX-PLUS</dc:title>
	<dc:creator>Rudhito, Andi</dc:creator>
	<dc:creator>wahyuni, sri</dc:creator>
	<dc:creator>suparwanto, Ari</dc:creator>
	<dc:creator>Susilo, F</dc:creator>
	<dc:description xml:lang="en-US">This paper proposes a method to critical path analysis in the project network using max-plus algebra approach.  The project network would be represented as a matrix over max-plus algebra. The dynamic of the project would be modeled and analyzed using max-plus algebra approach. The critical path analysis consists of determining earliest start time, latest completion time and float time. The finding show that the dynamic of the project is could be modeled in a systems of max-plus linear equations. The earliest start times of every node in the project are the solution of the system. The latest completion times of every node in the project are the solution of the modified system. The float time of every activity in the project could be detemined by modify and do some matrices operation over earliest start time vector and latest completion time vector. An example for modeling and computing a project using MATLAB example show that the result was appropriated with the critical path method (CPM).</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/844</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/844/1176</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/4906</identifier>
				<datestamp>2013-05-14T03:50:24Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">GRUP – Γ DUAL DARI SUATU GRUP–Γ</dc:title>
	<dc:creator>Sumanto, Y.D</dc:creator>
	<dc:description xml:lang="en-US">On                                                    of      can be considered as binary operation on    . If there are     such that     is a group, then for any    ,     is also a group and S  called as     . Otherwise for every element of     can be considered as binary operation on     . There are     such that     is    - group and every    is a group, troughout in this paper     is called  as dual group from  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/4906</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 15, No 1 (2012): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/4906/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1316</identifier>
				<datestamp>2013-03-21T01:59:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OBYEK GRUP DAN OBYEK KOGRUP DARI SEBUAH KATEGORI</dc:title>
	<dc:creator>Puspita, Nikken Prima</dc:creator>
	<dc:creator>Wijayanti, Indah Emilia</dc:creator>
	<dc:creator>Susanti, Yeni</dc:creator>
	<dc:description xml:lang="en-US">. A category contained a classes of objects and morphism between  two object. For any chategory with initial object, terminal object, product and coproduct can defined a special object i.e group object and cogroup object. Object group obtained from cathegory object which have fulfil definition like definition a group. The cogroup object is dual from group object.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1316</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 2 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1316/1079</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12266</identifier>
				<datestamp>2016-10-11T04:47:19Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROGRAM PECAHAN LINEAR</dc:title>
	<dc:creator>Endarwati, Erlin Dwi</dc:creator>
	<dc:creator>Khabibah, Siti</dc:creator>
	<dc:creator>., Farikhin</dc:creator>
	<dc:description xml:lang="en-US">. Linear Fractional Programming (LFP) problem is general form of Linear Programming (LP) problem. LFP problem arise when there is requirement to optimalize the efficiency of some activity. The efficiency related to the most productive way to use the scarce resources. Many method have been published to solve LFP problem. In this final project explained two methods, Charnes-Cooper’s method and Hasan-Acharjee’s method. The both method use a transformation to change LFP problem become LP problem, then solved by simplex method. Finally, it is concluded that there is comparison that the Charnes-Cooper’s method can be applied in all of LFP form which the set of feasible solutions is non-empty and bounded, but the formed LP becoming more complex than Hasan-Acharjee’s method. Hasan-Acharjee’s method cannot be used when the constanta of denominator in objective function is zero.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12266</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 1 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12266/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/623</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">BILANGAN KROMATIK UNTUK GRAF FUZZY LENGKAP DAN GRAF FUZZY BIPARTISI LENGKAP</dc:title>
	<dc:creator>R, Isnaini</dc:creator>
	<dc:description xml:lang="en-US">A fuzzy graph G(V,σ,μ) is a graph which consist of a set of fuzzy nodes σ : V ® [0,1] and a set of fuzzy edges µ: E® [0,1], so that μ(uv) ≤ σ (u) Ùσ (v) &quot;u,vÎV. A fuzzy graph  G = (V,σ,μ) is called complete if μ(uv) = min{σ(u),σ (v)} &quot;u,vÎV. A fuzzy graph G = (V,σ,μ) is called a bipartite fuzzy graph if set of nodes V can divide into two disjoint sets V1 and V2 so that μ(v1v2) = 0 if v1,v2ÎV1 or v1,v2ÎV2.  If on a bipartite fuzzy graph G, satisfy μ(uv) = min{σ (u),σ(v)} for all uÎV1 and vÎV2, then G is called a complete bipartite fuzzy graph.  A k-colouring on a fuzzy graph G(V,σ,μ) is a family of fuzzy sets on V:  G = {g1, g2, g3,…, gk} which satisfy the following conditions : i) Ú G = σ;  ii) gi Ù gj = 0, for all pair of nodes u, v, which adjacent in a fuzzy graph G and min{gi(u),gi(v)} = 0 (1 ≤ i ≤ k). The smallest positive integer k on k-colouring of a fuzzy graph G is called chromatic number of G. Then can be proved that the chromatic number of a complete fuzzy graph with n nodes is cF(Kσ) = n and the chromatic number of a complete bipartite fuzzy graph is cF(Kσ1,σ2) = 2.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/623</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/623/1185</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1355</identifier>
				<datestamp>2012-01-25T05:12:42Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">WATERMARKING PADA BEBERAPA KELUARGA WAVELET</dc:title>
	<dc:creator>Sugiharto, Aris</dc:creator>
	<dc:creator>Sarwoko, Eko Adi</dc:creator>
	<dc:description xml:lang="en-US">Teknik Watermarking banyak digunakan untuk melindungi data digital dari upaya pembajakan dalam bentuk penggandaan secara illegal. Banyak metode yang sudah dikembangkan baik dalam domain spasial, frekuensi maupun domain wavelet. Dalam tulisan ini sistem watermarking yang dibahas adalah domain wavelet dengan menggunakan transformasi wavelet diskrit (discrete wavelet transform) yang diujikan pada beberapa keluarga wavelet dengan menggunakan faktor skala yang berbeda. Kata kunci : watermarking, wavelet, skala</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1355</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 3 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1355/1116</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/15310</identifier>
				<datestamp>2017-07-21T04:14:03Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL ECONOMIC PRODUCTION QUANTITY (EPQ) UNTUK PERENCANAAN TERKOORDINASI PADA PRODUK DENGAN BACKORDER PARSIAL DAN KOMPONENNYA</dc:title>
	<dc:creator>Oktavia, Ayu</dc:creator>
	<dc:creator>Djuwandi, Djuwandi</dc:creator>
	<dc:creator>Khabibah, Siti</dc:creator>
	<dc:description xml:lang="en-US">Economic Production Quantity (EPQ) used to determined policy and oversee inventory levels. This article discussed on EPQ models for  planed of product with partial backordered and its component. The final product is assummed have m component and coordinated planning used to coordinate component of product and final product which is the components used for basic EPQ models and for final product planned using partial backorder EPQ. Numerical simulation given based  data on UD. Adi Mulya.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/15310</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 20, No 1 (2017): JURNAL MATEMATIKA; 27-31</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/15310/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/722</identifier>
				<datestamp>2010-12-22T06:42:59Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">FORMULASI VARIASIONAL DAN PENYELESAIAN DARI MASALAH SYARAT BATAS DARI PERSAMAAN ORDER DUA</dc:title>
	<dc:creator>sutrima, sutrima</dc:creator>
	<dc:description xml:lang="en-US">The purpose of this research is to investigate solutions of boundary value problems of second-roder differential operator by  variational methods. Using variational formulation of the problems, existence of solutions of boundary value problems of second-order differential operator can be obtained. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/722</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 5, No 2 (2002): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/722/578</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1387</identifier>
				<datestamp>2012-01-26T01:32:56Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL REGRESI NONPARAMETRIK ADITIF DENGAN FUNGSI LINK</dc:title>
	<dc:creator>Nasfirah, Siti</dc:creator>
	<dc:creator>Budiantara, I Nyoman</dc:creator>
	<dc:creator>Fitriasari, Kartika</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿If  given a couple of data  and  the  relationship  between  variable x and y is revealed as nonparametric regression model with is an error which is random variable with zero mean and variance  and is unknown function. If is an additive function with x  Rd, d ≥ 2. By using link function F, this research is focused on the way to get the estimator in additive component with link function by using two-stage methode and completed with simulation using logit link function. The result shows that two-stage estimator is eisier be used to model nonparametric regression by link function rather than Nadaraya-Watson and local linear. From the simulation, it’s obtained that of the mean and R2 value of the estimator is similar. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1387</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 2 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1387/1151</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/3877</identifier>
				<datestamp>2012-08-09T04:19:29Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SEMI-HOMOMORFISMA BCK-ALJABAR</dc:title>
	<dc:creator>A, Deffyana Prastya</dc:creator>
	<dc:creator>suryoto, suryoto</dc:creator>
	<dc:description xml:lang="en-US">A BCK-algebra is one of the algebraic structure generated over an abelian group. So that, some concepts in group also can be found this structure, for instance, if at a group we have a homomorphism, then at the BCK-algebras we also have a homomorphism, exactly a homomorphism of BCK-algebras. In this paper we discussed a semi-homomorphism of BCK-algebara as generalization of a homomorphism of BCK-algebras. It can be shown every homomorphism of BCK-algebras is a semi-homomorphism of BCK-algebras, conversely not true. By utilizing concept of ideal of BCK-algebras can be proved a semi-homomorphism of BCK-algebras is a homomorphism of BCK-algebras.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-08-09</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/3877</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 3 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/3877/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/867</identifier>
				<datestamp>2011-04-21T07:27:21Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">DESAIN XML SEBAGAI MEKANISME PETUKARAN DATA DALAM HERBARIUM VIRTUAL</dc:title>
	<dc:creator>wibowo, Adi</dc:creator>
	<dc:creator>Abdullah, Muhammad</dc:creator>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/867</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 2 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/867/737</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12256</identifier>
				<datestamp>2016-10-11T04:00:19Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">NILAI EKSAK BILANGAN DOMINASI COMPLEMENTARY TREE  TERHUBUNG-3 PADA GRAF CYCLE, GRAF LENGKAP DAN GRAF WHEEL</dc:title>
	<dc:creator>Agustiarini, Efni</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:creator>., Widowati</dc:creator>
	<dc:description xml:lang="en-US">Given a graph G with a set of vertices V and the set of edges E. Let                                                    be a subset of    , if each vertex of     is adjacent to at least one vertex of    , then     is called a dominating set in    . The domination number of a graph     denoted as     is the minimum cardinality taken from all dominating sets of    . Sometypes of dominating set has been developed based on domination perameter, such as connected dominating set, triple connected dominating set, complementary tree dominating set and triple connected complementary tree dominating set. A subset     with    , a nontrivial connected graph is said to be triple connected complementary tree dominating set, if     dominating set,     is a triple connected graph and     is a tree. The triple connected complementary tree domination number of G is denoted as     In this paper we study about triple connected complementary tree domination number, especially on the cycle graph, complete graph and wheel graph. For any cycle graph and complete graph of order     have    . For any wheel graph of order     have</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12256</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 18, No 1 (2015): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12256/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/612</identifier>
				<datestamp>2010-12-10T06:50:11Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENENTUAN ESTIMASI PARAMETER  REGRESI DENGAN VARIABEL DEPENDEN TERSENSOR</dc:title>
	<dc:creator>L., Ignasia Diana</dc:creator>
	<dc:creator>Dwi, Ispriyanti</dc:creator>
	<dc:description xml:lang="en-US">Regression analysis is a statistical analysis that use relation between two or more variables. To use regression analysis, the value of each variable (dependent or independent) must be available. In fact, not all of  the information is available. Missing value on dependent variable cause Ordinary Least Square is no longer to be used. One method to handle this problem is censored regression. On this regression, missing value is replaced with a censored point. This censored point may occur naturally or  made by researcher, depend on the goal of research. Maximum Likelihood Method following Newton-Raphson Iteration Method, is used to get parameter estimation of censored regression. Test of model signification uses Likelihood Ratio-test and Wald-test.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/612</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 11, No 3 (2008): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/612/482</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1346</identifier>
				<datestamp>2012-01-25T04:43:58Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESTIMASI PARAMETER MODEL REGRESI NON STASIONER  DENGAN VARIABEL DEPENDEN LAG : STUDI KASUS PADA  PERKEMBANGAN  EKSPOR INDONESIA KE JEPANG TAHUN 1980 - 2000</dc:title>
	<dc:creator>I Maruddani, Di Asih</dc:creator>
	<dc:description xml:lang="en-US">The clasiccal regression model was devised to handle relationship between stationary variables. But, many economic variables that frequently faced by econometricians when dealing with time series data, are nonstationary variables. This clearly places severe restrictions on their analysis by standard regression method. In this paper, we study regression models with a lagged dependent variable when both the dependent and independent variables are nonstationary, and the regression model is not cointegrated. In particular, we discuss the limiting properties of least squares estimates of the parameters in such regression models. We show that the estimate of the lagged dependent variable tends to unity and the estimates of the independent variables tend to zero. The results might also allow us to investigate the growth of export from Indonesian to Japan.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1346</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 7, No 1 (2004): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1346/1107</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/13542</identifier>
				<datestamp>2017-03-02T04:45:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SISTEM PENDUKUNG KEPUTUSAN PENENTUAN NILAI KENAIKAN PANGKAT TNI ANGKATAN DARAT MENGGUNAKAN METODE COMPOSITE PERFORMANCE INDEX (CPI)</dc:title>
	<dc:creator>Nugroho, Adam Hasbi</dc:creator>
	<dc:creator>Bahtiar, Nurdin</dc:creator>
	<dc:description xml:lang="en-US">Rank promotion is a part ofpreparationunits in the implementation management of Main Functionwhich is one of the functions that organized by Puspenerbad (Army Aviation Center) in performing the basic tasks of the Army. Rank is required to assist in supporting the placement decisions of the assessment team of Puspenerbad in supporting the decision of placement task or filling vacant positions as officials had previously been moved or changed their title.Therefore, rank promotionneeds to be calculated, computerize, and ranked using a Decision Support Systems (DSS). Decision support systems can helpthe assessment team of Puspenerbad indetermining members that passed or not pass and determine the pass members ranking to get a rank promotion. One method that can be used to help support decisions for determining the value of the Army's promotion is Composite Performance Index (CPI) method. Composite Performance Index (CPI) is one method of calculation of the index-based decision making combined performance that can be used to determine the ratings or rankings of various alternatives based on several criteria, although the criteria vary. Based on the results of comparative testing of samples manually, the accuracy of the CPI method can be considered good.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-03-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/13542</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 3 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/13542/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/707</identifier>
				<datestamp>2010-12-21T05:35:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">APLIKASI METODE BESARAN PIVOTAL DALAM PENENTUAN SELANG KEYAKINAN TAKSIRAN PARAMETER POPULASI.</dc:title>
	<dc:creator>Rusgiyono, Agus</dc:creator>
	<dc:description xml:lang="en-US">Diberikan populasi dengan densitas  dengan  parameter , dan dari padanya  diambil sample acak . Selanjutnya taksiran titik  adalah suatu fungsi  dari   bernilai riil . Interval taksiran terhadap  berdasarkan taraf keyakinan , dengan  , ditentukan berdasarkan bantuan besaran pivotal  yang mempunyai distribusi tidak bergantung pada . Diketahui  dan  adalah dua statistik yang memenuhi  untuk mana  dengan  tidak bergantung pada ,  maka interval acak adalah interval keyakinan untuk .</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/707</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 3 (2001): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/707/569</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1378</identifier>
				<datestamp>2012-01-25T07:12:41Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALISIS REGRESI SEMIPARAMETRIK PADA KASUS HILANGNYA RESPON</dc:title>
	<dc:creator>Yahya, Irma</dc:creator>
	<dc:creator>Budiantara, I Nyoman</dc:creator>
	<dc:creator>Fitriasari, Kartika</dc:creator>
	<dc:description xml:lang="en-US">In the specific cases of experiment, not all data (response) may be available, which is called missing response cases. It’s appear for various reasons.  For the existing problem, inference statistics cannot be applied directly.  The aim of this research is to consider about certain method to impute the missing response which is related to semiparametric regression, as a goodness of fit measurement of the used method, suppose an estimator  which is compared to the mean of complete response, then consider asymptotic distribution, consistency and efficiency of parametrics component estimator. By using Kernel approximation, the resulted of nonparametrics estimator and by least square method, the resulted parametric component .The application to minimum temperature’s data in 56 cities at USA, estimator value of  for several confidence interval tend to be similar to the mean value of complete response.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1378</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 1 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1378/1141</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/772</identifier>
				<datestamp>2011-01-11T05:12:55Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">INTERVAL SELISIH RATA-RATA DENGAN METODE BOOTSTRAP PERSENTIL</dc:title>
	<dc:creator>Akhmad, Fauzy</dc:creator>
	<dc:description xml:lang="en-US">We usually use traditional method to construct interval for the difference between two population means. This interval needs an assumption that sample is random and has normal distribution (symmetric). This article will discuss another method, namely bootstrap percentile. Bootstrap percentile method is more potential in constructing this interval and give shorter interval than the traditional method. This method does not need an assumption that the sample has to have a normal distribution.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/772</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 2 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/772/633</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/858</identifier>
				<datestamp>2011-04-20T06:48:17Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL PREDATOR DAN PREY DENGAN MODEL  SUSCEPTIBLE - INFECTED – SUSCEPTIBLE</dc:title>
	<dc:creator>HIDAYATI, FIRSTY Nur</dc:creator>
	<dc:creator>SUNARSIH, SUNARSIH</dc:creator>
	<dc:description xml:lang="en-US"> A predator-prey model with infected prey is an interaction between a predator and a prey population with infected prey. This model is a result of the predator-prey model with logistic growth in the prey population which is combined with Susceptible-Infected-Susceptible (SIS) model in the prey. The equations in this model are non linear differential equation with three dependent variables. In this system,                                                   is size of prey population at time    ,    is the fraction of the prey that are infectious at time    and    is size of predator population at time    . It is assumed that infected prey are vulnerable than by a factor    . Stability analysis system is done to all five equilibriain this linearized. Each of stability in those equilibria points is based on theeigen values.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/858</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 13, No 1 (2010): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/858/728</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12253</identifier>
				<datestamp>2016-10-11T03:30:27Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ENDOMORFISMA L0 DARI BCH-ALJABAR</dc:title>
	<dc:creator>Citra, Restia Sarasworo</dc:creator>
	<dc:creator>., Suryoto</dc:creator>
	<dc:description xml:lang="en-US">BCH-algebras is an algebraic structure which built on a commutative group. In BCH-algebra there is a mapping from this structure to itself which called  a BCH-endomorphism. In BCH-algebra context, we denote L as a set of all left mapping and it contains L0 which the only non-identity BCH-endomorphism in L with some properties : the left map L0 is a center of BCH-endomorphism, L0 both be a periodic mapping dan an epimorphism on BCH-algebra. Such as a group with the fundamental group homomorphism theorem, in a BCH-algebra we have a fundamental BCH-algebra homomorphism theorem.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12253</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 16, No 1 (2013): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12253/pdf</dc:relation>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12253/pdf_1</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1333</identifier>
				<datestamp>2012-01-17T02:22:51Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">APLIKASI SISTEM MULTI AGEN  PADA PENGENDALIAN TIGA KAPAL SEKALIGUS</dc:title>
	<dc:creator>Tjahjana, R. Heru</dc:creator>
	<dc:description xml:lang="en-US">This paper presented a problem controlling the three ships as the application of multi-agent system. The multi-agent system model which used in this exposition is linear multi-agent system  and the ship model  which used in this paper is linear ship model from Hocking. The Control design completion for each ship used the optimal control design strategy by utilizing Pontryagin Maximum Principle. This principle leads to the classical problem of optimum control  that treatment using the steepest descent method.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1333</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 2 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1333/1097</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12280</identifier>
				<datestamp>2016-10-11T05:32:21Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROGRAM FRAKSIONAL LINIER  DENGAN KOEFISIEN INTERVAL</dc:title>
	<dc:creator>Sari, Annisa Ratna</dc:creator>
	<dc:creator>., Sunarsih</dc:creator>
	<dc:creator>., Suryoto</dc:creator>
	<dc:description xml:lang="en-US">Linear fractional programming is a special case of nonlinear programming which the objective function is a ratio of two linear function with linear constraints. Linear fractional programming is used to optimize the efficiency of the activities  of the other activities. In some case, coefficients of the objective function is uncertain. Therefore, It can be selected the interval numbers as coefficients. First step in solving linear fractional programming with interval coefficients in the objective function is transforming it into linear programming using the Charnes - Cooper method. The result of the transformation is linear programming with interval coefficients (LPIC). To solve the LPIC is used method proposed by K Ramadan. In this method, LPIC converted into two linear programming that obtains the best optimum solution and the worst optimum solution, respectively. This optimum solution is the optimum solution for linear fractional programming problem with interval coefficients in the objective function.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12280</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 3 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12280/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/680</identifier>
				<datestamp>2010-12-20T04:37:38Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SYARAT PERLU LAPANGAN PEMISAH</dc:title>
	<dc:creator>Irawanto, bambang</dc:creator>
	<dc:description xml:lang="en-US">﻿﻿Field is integral domain and is a such that every non-zero elemen in it has multiplicative inverse. Extension field F of field K is splitting field of collections polinomial { fi(x) | i Î I } of K if F is the smallest  subfield  containing K and all the zeros in  of the polinomial fi(x). Elemen a Î F is algebra over K if f (a) = 0 for some 0 ¹ f (x) Î K[x]. Splitting field is extension algebra.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/680</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 4, No 2 (2001): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/680/544</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1369</identifier>
				<datestamp>2012-01-25T06:25:05Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MATRIKS INVERS MOORE PENROSE ATAS DAERAH INTEGRAL</dc:title>
	<dc:creator>SRRM, Titi udjiani</dc:creator>
	<dc:description xml:lang="en-US">The Inverse Moore Penrose matrix has been applied in various areas, for example in statistic and optimization. In this paper we study Inverse Moore Penrose matrix which is applied to Integral Domain. We will first discuss the characterization of all matrices over Integral Domain which admits Moore Penrose Inverse. With this characterization we will derive  necessary and sufficient conditions for a matrix to have a Moore Penrose Inverse. We also show the relations between Moore Penrose Inverse matrix and Compound matrix. The aim of this paper is to obtain an explicit formula for the Moore Penrose Inverse when it exist and gives a necessary and sufficient condition for a matrix to have a Moore Penrose Inverse under the assumption that a matrix has a rank factorization.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1369</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 2, No 8 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1369/1130</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/763</identifier>
				<datestamp>2011-01-11T05:07:33Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESTIMASI VARIANSI PADA PENARIKAN SAMPEL DUA TAHAP UNTUK DATA TIDAK LENGKAP</dc:title>
	<dc:creator>Subanti, Sri</dc:creator>
	<dc:description xml:lang="en-US">Rasio estimation under two – phase simple random sampling is studied. A new linearisation variance estimator that makes more complete use of the sample data than a standard one is proposed. A jackknife variance estimator and its linearised version are also obtained. Unconditional and conditional repeated sampling properties of these variance estimaters are studied through simulation. Applications to ‘mass’ imputation under two – phase sampling and deterministie imputation for missing data are also given.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/763</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 1 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/763/624</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1401</identifier>
				<datestamp>2012-01-26T04:33:15Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">RESULTAN DARI POLINOMIAL DENGAN n - INDETERMINATE</dc:title>
	<dc:creator>Harjito, Harjito</dc:creator>
	<dc:creator>Soelistyo, Robertus Heri</dc:creator>
	<dc:creator>DR, Karuniawati</dc:creator>
	<dc:description xml:lang="en-US">Let  be polynomials where K is a field. To determine whether two polynomials have a common factor without doing any divisions in K[x] can be seen from its resultant, that is determinant from Sylvester matrix. Two polynomials will have a common factor if and only if its resultant is zero. If its resultant isn’t zero so two polynomials have not a common factor. Wants to be look for resultant  where  in  where C is the set of all complex numbers. To make the easy resultant computations is used by maple 8.                 </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1401</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 10, No 3 (2007): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1401/1165</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/849</identifier>
				<datestamp>2012-01-30T05:04:00Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">KOMPUTASI  KERUGIAN LINTASAN SINYAL DENGAN MODEL HATA</dc:title>
	<dc:creator>Suhartono, Suhartono</dc:creator>
	<dc:description xml:lang="en-US">Signal is a wave that can be expressed by physical phenomenon. Mathematically signal wave can be represented as a function of single or many independent variables, for example signal wave over building as a function of distance or time. In fact, signal spreading as a wave have many attenuation, for example is caused by difraction  when the signal over the urban area or building. The purpose of the research  is to present  the signal path loss model in the urban area by using Hata model. The  result of the computation has shown  that the decreasing of the  signal  path  loss in urban area can be effected by  the increasing of  the receiver antenna height.   </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-04-20</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/849</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 3 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/849/1182</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12369</identifier>
				<datestamp>2016-10-21T01:24:22Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENGENALAN POLA IRIS MATA MENGGUNAKAN METODE TEMPLATE MATCHING DENGAN LIBRARY OPENCV</dc:title>
	<dc:creator>Afrizal, Sahid Nur</dc:creator>
	<dc:creator>Sarwoko, Eko Adi</dc:creator>
	<dc:description xml:lang="en-US">Biometrics is a technology that used on computer systems in the introduction of a person using a part of the human body. One part of the body that can be used in biometric systems are human iris, due to the nature of the iris of the eye that will not change and is unique among person with another person. One application of biometrics using human iris is on the smartphone. The system was built using OpenCV as the main library. Proposed recognition system was divided into two stages, there was iris recognition stage and iris matching stage. Recognition stage began with taking the image, and then do the pre-processing stage which consists of scaling operations to a smaller size and grayscaling, then proceed to the segmentation stage, using Canny edge detection method, circle Hough transform method for detecting circle of the iris and the pupil, and Daugman's rubber sheet models for normalization, then proceed to the feature extraction stage using Gabor Filter and Average Absolute Deviation. Matching phase was made using euclidean distance method to measure the similarity distance between two iris features. Tests carried out with 10 eye images, each of which 5 left and right eye images are derived from the research subjects. The results of this study concluded that the optimal threshold for this system was 475 with a percentage of 36% False Reject Rate, False Acceptance Rate 40%, 38% system error ratio, and the Genuine Acceptance Rate 64%.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12369</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 19, No 2 (2016): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12369/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 MATEMATIKA</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1321</identifier>
				<datestamp>2012-02-16T06:40:28Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PRIME IDEAL ON SEMIRINGS D_nxn (Z^+)</dc:title>
	<dc:creator>Setyawati, Dian Winda</dc:creator>
	<dc:description xml:lang="en-US">Let R be a semirings. A subset I of R is called an ideal of R if                                                   and   then    and   I is called prime ideal if    for     then   or    On semirings   ,  a non zero ideal I is prime if and only if     , for p is prime or I = &lt;2,3&gt;. A paper will show form of prime ideal of semirings</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/vnd.openxmlformats-officedocument.wordprocessingml.document</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1321</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 14, No 1 (2011): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1321/1693</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/12271</identifier>
				<datestamp>2016-10-11T05:13:06Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">MODEL OPTIMASI ECONOMIC PRODUCTION QUANTITY  DENGAN SISTEM DELIVERY ORDER</dc:title>
	<dc:creator>Puspita, Nikken Prima</dc:creator>
	<dc:creator>Khabibah, Siti</dc:creator>
	<dc:creator>Ratnasari, Lucia</dc:creator>
	<dc:description xml:lang="en-US">The aims of Economic Production Quantity models are for manage the production schedule and product inventory. The first Economic Production Quantity model developed by E.W Taft on 1918. Taft make some asumption such as daily demand rate constant, daily production rate constant, not stockout allowed, single item product and daily production rate are more than daily demand rate. On the process of delivery product,  there is not transportation cost. Pasandideh dan Niaki on 2010 was constructed an Economic Production Quantity models with discrete delivery order. In this research we discussed the Economic Production Quantity model which products delivered by multiple palet system and with transportation cost.</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2016-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/12271</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 17, No 2 (2014): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/12271/pdf</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/628</identifier>
				<datestamp>2018-08-02T02:00:35Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">UJI KOMPARATIF TERHADAP DUA STATISTIK UJI TYPE KOLMOGOROV SMIRNOV</dc:title>
	<dc:creator>Rusgiyono, Agus</dc:creator>
	<dc:description xml:lang="en-US">In several statistics handbooks of statistics gave the following formula for the computation of the Kolmogorov goodness of fit statistic is    . And the alternative formula test statistic  to  measure  distance for two distribution functions is used    For actual data, the difference is likely to be less than the upper bound. This form makes it clear that an upper bound on the difference between these two formulas is  For example, for N = 20, the upper bound on the difference between these two formulas is 0.05  For N = 100, the upper bound is 0.01. In practice, to large sample sizes (say N ≥ 50), these formulas are essentially equivalent. </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2010-12-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/628</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 12, No 2 (2009): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/628/1191</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1360</identifier>
				<datestamp>2012-01-25T05:31:52Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">APLIKASI PRINSIP KURVA TUTUP</dc:title>
	<dc:creator>Maspupu, John</dc:creator>
	<dc:description xml:lang="en-US">In this paper we study the use of the closed graph principle applied to direct sum closed subspace of a Banach Space. We will first discuss the concept of a closed graph described in  the form of theorem or principle. The properties of closed linear mapping  related to the concept of a closed graph will also be explained in detail in the  form of two lemmas. In order to prove the  closed graph principle we utiliize an  open mapping principle. The objective of this study is to show that each  direct sum of a closed subspace will exactly resulted one linear mapping that has  a property of bounded projection. Our results show that a uniqueness of bounded projection on Banach Space can always be obtained from direct sum of two closed subspace. Furthermore, open mapping can be generated  from  premise of a closed graph having certain  conditions</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1360</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 8, No 1 (2005): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1360/1121</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/761</identifier>
				<datestamp>2011-01-11T05:07:33Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">OPTIMASI PORTOFOLIO INVESTASI DENGAN MENGGUNAKAN MODEL MARKOWITZ</dc:title>
	<dc:creator>Priyatna, Yayat</dc:creator>
	<dc:creator>Sukono, F</dc:creator>
	<dc:description xml:lang="en-US">Permasalahan pokok dalam paper ini adalah memilih dua saham unggulan dan proporsi dana yang akan diinvestasikan dalam pembentukan suatu portofolio. Optimasi portofolio investasi di sini dilakukan dengan menggunakan model Markowitz. Dari empat saham unggulan versi LQ 45 yang dianalisis menunjukkan bahwa saham HM Sampurna dan Telkom memberikan hasil yang optimum dalam pembentukan portofolio investasi dengan proporsi dana berturut-turut sebesar 51% dan 49%.  </dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2011-01-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/761</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 6, No 1 (2003): Jurnal Matematika</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/761/622</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs.ejournal.undip.ac.id:article/1392</identifier>
				<datestamp>2012-01-26T01:55:07Z</datestamp>
				<setSpec>matematika:ART</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SISTEM PERSAMAAN LINEAR ATAS RING KOMUTATIF</dc:title>
	<dc:creator>SRRM, Titi udjiani</dc:creator>
	<dc:description xml:lang="en-US">Linear systems  equations over commutatif ring are linear systems  equations with the coeffici-ents of these equations are elements from commutatif ring. This paper discusses about basic theorems on solution of linear systems equations over commutatif ring. The basic theorems will be found by using characteristic of ideal ,annihilator and rank of coefficient matrices of linear systems equations over commutatif ring. The ideal  is generated by minors of coefficient matrices of linear systems equations over commutatif ring. Computing the annihilator of ideal we get the rank of coefficient matrices of linear systems equations over commutatif ring</dc:description>
	<dc:publisher xml:lang="en-US">MATEMATIKA</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2012-01-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ejournal.undip.ac.id/index.php/matematika/article/view/1392</dc:identifier>
	<dc:source xml:lang="en-US">MATEMATIKA; Vol 9, No 3 (2006): JURNAL MATEMATIKA</dc:source>
	<dc:source>1410-8518</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ejournal.undip.ac.id/index.php/matematika/article/view/1392/1156</dc:relation>
</oai_dc:dc>
			</metadata>
		</record>
	</ListRecords>
</OAI-PMH>
