Hasil Pencarian  ::  Simpan CSV :: Kembali

"In this paper, we give another proof about the relationship AB and BA with eigenvalue zero that reduced by structure Jordan for nilpoten matrix"

"In this paper, we give another proof about the relationship between AB and BA with eigenvalue zero that reduced by structure Jordan for nilpotent matrix"

"Invers Moore-Penrose merupakan perumuman invers pada matriks bujur sangkar. Setiap matriks dengan entri bilangan kompeks memiliki invers Moore-Penrose dan invers Moore-Penrose dari suatu atriks adalah tunggal. Ketunggalan invers Moore-Penrose dapat digunakan sebagai pengganti invers pada matriks persegi maupun persegi panjang. Dalam skripsi ini, dibahas konstruksi invers Moore-Penrose melalui f1g􀀀invers, f1;2g􀀀invers, f1;2;3g􀀀invers, f1;2;4g􀀀invers, f1;3g􀀀invers, dan f1;4g􀀀invers. Kemudian, dibahas pula konstruksi invers Moore-Penrose dari matriks Laplacian dan beberapa sifat invers Moore-Penrose dari matriks Laplacian. Pada Teorema 4.4, invers Moore-Penrose dari matriks Laplacian memenuhi persamaan LL† = L†L = I􀀀 1n J, dengan J merupakan matriks berukuran nn yang setiap entrinya bernilai satu. Sehingga, invers Moore-Penrose dari matriks Laplacian dapat digunakan sebagai pengganti invers matriks Laplacian.

---

Moore-Penrose inverse is a generalized inverse from square matrices. Every matrix with complex entries has a unique Moore-Penrose inverse. Uniqueness of Moore-Penrose inverse can be used as a substitute inverse on square or rectangular matrices. In this skripsi, the construction of Moore-Penrose inverse is explain through f1g􀀀inverse, f1;2g􀀀inverse, f1;2;3g􀀀inverse, f1;2;4g􀀀inverse, f1;3g􀀀invers, and f1;4g􀀀invers. Moreover, the construction of Moore-Penrose inverse for Laplacian matrices, as well as some properties of the inverse, is also discussed. In Theorem 4.4, Moore-Penrose inverse satisfy the equation LL† = L†L = I􀀀 1 nJ, where J is an nn matrix with all entries are one.;Moore-Penrose inverse is a generalized inverse from square matrices. Every matrix with complex entries has a unique Moore-Penrose inverse. Uniqueness of Moore-Penrose inverse can be used as a substitute inverse on square or rectangular matrices. In this skripsi, the construction of Moore-Penrose inverse is explain through f1g􀀀inverse, f1;2g􀀀inverse, f1;2;3g􀀀inverse, f1;2;4g􀀀inverse, f1;3g􀀀invers, and f1;4g􀀀invers. Moreover, the construction of Moore-enrose inverse for Laplacian matrices, as well as some properties of the inverse, is also discussed. In Theorem 4.4, Moore-Penrose inverse satisfy the equation LL† = L†L = I􀀀 1 nJ, where J is an nn matrix with all entries are one."

"Structurally relationship of variables is important in deeply analysis of path models, but the process of effect distribution must be concerned. In this situation, one or more variable would be a mediator variable which assessing effect of an independent to a dependent variable. We studied the simple mediation model that is one of path analytical models which contain of one independent variable, dependent variable and mediator variable. A necessary component of mediation is effectiveness that is a statistically significant indirect effect, formal significance tests of indirect effects are early conducted by Sobel (1982). According to sequential regression analysis on a simple mediation model, a mediator variable come after an independent variable exist in the model, the contribution of upcoming variable to the model could be obtained. We argue the importance of investigating empirical relationship between the significance of indirect effects and sequential contribution of mediator variable with a normal theory approach using Microsoft Excel simulation tools developed by Myerson (2000). We find that the higher contribution of mediator variable to the model, the more effectiveness is. this result comes up with three level correlation of independent and dependent variable which each 1000 times iteration that gives relatively immediate information about the recent empirical relationship between the significance of indirect ffects and sequential contribution of mediator in the simple mediation models."

"Teorema Menelaus dan Teorema Ceva merupakan teorema pada planegeometry. Kedua teorema tersebut pertama kali dikemukakan pada segitiga, untukselanjutnya kedua teorema tersebut dapat berlaku juga pada poligon. Pada tugasakhir ini akan dibahas pembuktian kedua teorema tersebut pada poligonmenggunakan perbandingan luas pada segitiga.Kata kunci: Teorema Menelaus, Teorema Ceva, perbandingan luas segitiga, planegeometry, dan poligon.vi + 33 hlmn.;lamp."

"Misalkan 𝐺𝐺(𝑝𝑝, 𝑞𝑞) adalah sebuah graf dengan 𝑝𝑝 = |𝑉𝑉(𝐺𝐺) | dan 𝑞𝑞 = |𝐸𝐸(𝐺𝐺) | masing-masing adalah banyaknya simpul dan busur dari 𝐺𝐺. Pelabelan total (a, d)-busur anti ajaib ((a, d)-PTBAA) dari sebuah graf 𝐺𝐺(𝑝𝑝, 𝑞𝑞) adalah sebuah pemetaan satu-satu f dari 𝑉𝑉(𝐺𝐺) ∪ 𝐸𝐸(𝐺𝐺) ke himpunan {1, 2,?, 𝑝𝑝 + 𝑞𝑞} sedemikian hingga himpunan bobot busur { 𝑓𝑓(𝑢𝑢) + 𝑓𝑓(𝑢𝑢𝑢𝑢) + 𝑓𝑓(𝑣𝑣) ∶ 𝑢𝑢𝑢𝑢 ∈ 𝐸𝐸(𝐺𝐺)} sama dengan {𝑎𝑎, 𝑎𝑎 + 𝑑𝑑, 𝑎𝑎 + 2𝑑𝑑,?, 𝑎𝑎 + (𝑞𝑞 − 1)𝑑𝑑 } untuk suatu bilangan bulat a > 0 dan d ≥ 0. Jika 𝑓𝑓(𝑉𝑉) = {1, 2,?, 𝑝𝑝} maka pelabelan f disebut pelabelan total super (a, d)-busur anti ajaib ((a, d)-PTSBAA), dan jika d = 0 maka pelabelan f disebut juga pelabelan total busur ajaib (PTBA). Pada tesis ini dibangun suatu konstruksi (a, d)-PTBAA pada gabungan m graf korona 𝐶𝐶𝑛𝑛 ⊚ 𝑃𝑃2 isomorfik untuk 𝑑𝑑 = 0 dan 𝑑𝑑 = 2, dan gabungan m graf prisma 𝐶𝐶𝑛𝑛 × 𝑃𝑃2 isomorfik untuk 𝑑𝑑 = 0, 𝑑𝑑 = 1 dan 𝑑𝑑 = 2.

---

Let 𝐺𝐺(𝑝𝑝, 𝑞𝑞) is a graph with 𝑝𝑝 = |𝑉𝑉(𝐺𝐺) | and 𝑞𝑞 = |𝐸𝐸(𝐺𝐺) | be respectively the number of vertices and the number of edges of 𝐺𝐺. An (a, d)-edge antimagic total labeling ((a, d)-EAT labeling) of a 𝐺𝐺(𝑝𝑝, 𝑞𝑞) graph is defined as a one-to-one mapping f from 𝑉𝑉(𝐺𝐺) ∪ 𝐸𝐸(𝐺𝐺) onto the set {1, 2,?, 𝑝𝑝 + 𝑞𝑞}, so that the set of weight { 𝑓𝑓(𝑢𝑢) + 𝑓𝑓(𝑢𝑢𝑢𝑢) + 𝑓𝑓(𝑣𝑣) ∶ 𝑢𝑢𝑢𝑢 ∈ 𝐸𝐸(𝐺𝐺)} is equal to {𝑎𝑎, 𝑎𝑎 + 𝑑𝑑, 𝑎𝑎 + 2𝑑𝑑, ?,𝑎𝑎+𝑞𝑞−1𝑑𝑑 for two integer a > 0 and d ≥ 0. If 𝑓𝑓𝑉𝑉=1, 2, ?, 𝑝𝑝 then f labeling is called super (a, d)-edge antimagic total labeling (super (a, d)-EAT labeling) and when d = 0 then f labeling is called edge magic total labeling (EMT labeling). In this thesis was constructed (a, d)-EAT labeling on union of isomorphic corona 𝐶𝐶𝑛𝑛 ⊚ 𝑃𝑃2 graphs for 𝑑𝑑 = 0 and 𝑑𝑑 = 2, and union of isomorphic prisms 𝐶𝐶𝑛𝑛 × 𝑃𝑃2 graphs for 𝑑𝑑 = 0, 𝑑𝑑 = 1 and 𝑑𝑑 = 2."

"Aljabar Banach adalah ruang Banach yang dilengkapi dengan operasi biner perkalian yang kontinu. Teorema Mazur mengatakan bahwa setiap aljabar Banach pembagian atas lapangan bilangan real isomorfik dengan salah satu aljabar R, C, atau quaternion Q. Lebih lanjut, Gelfand kemudian membuktikan bahwa setiap aljabar Banach pembagian atas lapangan bilangan kompleks isomorfik dengan C. Bukti asli dari Gelfand menggunakan teori fungsi harmonik dan persamaan integral namun pada skripsi ini dibuktikan Teorema Gelfand-Mazur menggunakan sifat-sifat dari aljabar bernorm. Skripsi ini juga membahas teori transformasi Gelfand yang diturunkan dari Teorema Gelfand-Mazur serta hubungan antara fungsional linier multiplikatif dan ruang ideal maksimal. Transformasi Gelfand digunakan untuk membuktikan Teorema Wiener yang menyebutkan bahwa jika f bukan fungsi nol dan memiliki deret Fourier dengan koefisien yang konvergen mutlak maka 1=f juga memiliki sifat yang sama.

---

Banach algebras are Banach spaces equipped with continuous binary operation of multiplication. The Mazur theorem states that every division Banach algebra over the field of real numbers is isomorphic to either the algebra R, C, or the quaternion Q. Gelfand then proved that every division Banach algebra over the field of complex numbers is isomorphic to C. The original proof by Gelfand was based on the theory of harmonic functions and integral equations but in this skripsi we prove the Gelfand-Mazur theorems using only the properties of normed algebra.

This skripsi discussed the theory of Gelfand transform, which was derived from the Gelfand-Mazur Theorem and also the connection between multiplicative linear functional space and maximal ideal space. The Gelfand Transform was used to prove the Wiener Theorem which states that if f is a non-zero function and has an absolutely convergent Fourier expansion then 1=f has such an expansion as well."

"Beberapa area dari pemecahan masalah matematika berhubungan dengan kemampuan visuospatial. Adanya konseptualisasi spasial yang baik merupakan asset untuk memahami konsep-konsep matematika. Pada kemampuan spasial diperlukan adanya pemahaman perspektif, bentuk-bentuk geometris, menghubungkan konsep visual. Faktorfaktor tersebut juga diperlukan dalam prestasi belajar matematika. Penelitian ini bertujuan menguji ada tidaknya hubungan antara kemampuan spasial dengan prestasi belajar matematika.Pengumpulan data dilakukan terhadap 220 anak usia sekolah, berusia 7-11 tahun dengan memberikan tes kemampuan spasial yang terdiri dari hubungan spasial topologi, proyektif, euclidis dan tes matematika. Hasil menunjukkan bahwa terdapat hubungan antara kemampuan spasial total, topologi dan euclidis dengan prestasi belajar matematika, tetapi tidak terdapat hubungan antara kemampuan spasial proyektif dengan prestasi belajar matematika.

---

A number of the mathematical problem solving are related with visuospatial ability. A good spatial conceptualization is an asset to understand the mathematical concept. Perspective understanding, geometrical shapes, and visual concept relation are crucial skills in spatial ability. These factors are also needed in mathematical performance. This research is intended to test the relationship between spatial abilities and mathematical performance. Data are collected from 220 children (7 to 11 years old) by giving them the spatial ability test which consists of spatial topology, projective, euclidis, and mathematical test. Result shows that there is a significant relationship between total spatial ability, topology, euclidis and mathematical performance. In the contrary, it shows that there is no relationship between projective spatial ability and mathematical performance."

"Misalkan G(p,q) adalah suatu graf dengan p simpul dan q busur dengan himpunan simpul V dan himpunan busur E. Suatu graf G(p,q) dikatakan harmonis ganjil jika terdapat fungsi injektif f: V(G) → {0,1,2,….,2q-1} sedemikian sehingga menginduksi pemetaan f*(uv) = f(u) + f(v) yang merupakan fungsi bijektif f*: E(G) → {1,3,5,….,2q-1}. Pelabelan harmonis ganjil untuk graf korona, (Cn⊚Kr Komplemen) dan graf gabungan korona isomorfis, m(Cn⊚Kr Komplemen) untuk n ≡ 0(mod 4) sudah diketahui. Pada skripsi ini akan diberikan konstruksi pelabelan harmonis ganjil pada graf korona (Cn⊚Kr Komplemen) dan graf gabungan korona isomorfis, m(Cn⊚Kr Komplemen) untuk n ≡ 2(mod 4) sebagai pelengkap dari hasil yang sudah ada.

---

Let G(p,q) be a graph with p vertices and q edges with set of vertices V and set of edges E. A graph G (p, q) is said to be odd harmonious if there exists an injection f: V(G) → {0,1,2,…,2q-1}, such that induced mapping f* (uv) = f(u) + f(v) is a bijection f*: E(G) → {1,3,5,…,2q-1}. Odd harmonious labeling for corona graph, (Cn⊚Kr Complement) and union of isomorphic corona graphs, m(Cn⊚Kr Complement) for n ≡ 0(mod 4) have been found. In this skripsi, it will be given a construction of an odd harmonious labeling on the corona graph, C_n⊚(K_r ) ̅ and union of isomorphic corona graph, m(Cn⊚Kr Complement) for n ≡ 2(mod 4) as a complement of the known result."