Hasil Pencarian  ::  Simpan CSV :: Kembali

"Tugas akhir ini membahas tentang teori antrian dan penerapannya pada Terminal Bis Antar Kota Cililitan dengan menggunakan analisa teori antrian model Saluran Tunggal dan Ganda. Dengan analisa teori antrian model Saluran Tunggal dan Ganda, dapat diketahui apakah sistim pelayanan yang ada di Terminal Bis Antar Kota Cililitan apakah sudah melebihi kapasitasnya ( mencapal keadaan yang optimal).

---

This final project discusses the queuing theory and its application at the Cililitan Intercity Bus Terminal using the Single and Dual Channel queuing theory analysis. With the Single and Dual Channel queuing theory analysis, it can be seen whether the service system at the Cililitan Intercity Bus Terminal has exceeded its capacity (reached an optimal state)."

"Penelitian ini memberikan bukti perhitungan mengenai analisis efektifitas pelayanan antrian pada gardu tol otomatis dan gardu tol reguler. Hasil perhitungan atas gardu tol otomatis dan gardu tol reguler pada gerbang tol Cililitan 1 menunjukkan bahwa waktu pelayanan gardu tol reguler lebih efektif dibanding waktu pelayanan gardu tol otomatis. Selain itu, dilakukan juga peramalan estimasi sistem antrian gardu tol yang efektif di masa depan sebagai bahan pertimbangan untuk melakukan pengembangan sistem antrian gardu tol di masa depan. Hasil peramalan menunjukkan bahwa sistem antrian gardu tol otomatis akan lebih efektif di masa depan dan butuh dilakukan pengembangan.

---

This study provides evidence about calculation of analysis for effectiveness of the queue of automatic toll gates and regular toll gates. Calculation results of automatic toll gates and regular toll gate show that service time of regular toll gate is more effective comparing with service time of automatic toll gate. In addition, this study also provides forecasting results to estimate effectivity toll gate queue system in future as consideration to develop toll gate queue system in future. Forecasting results show that automatic toll gate queue system will be more effective in future and needs development to be done."

"Fundamentals of group theory provides a comprehensive account of the basic theory of groups. Both classic and unique topics in the field are covered, such as an historical look at how Galois viewed groups, a discussion of commutator and Sylow subgroups, and a presentation of Birkhoff’s theorem. "

"[This book covers the connection between algebraic K-theory and Bökstedt, Hsiang and Madsen's topological cyclic homology and proves that the difference between the theories are ‘locally constant’. The usefulness of this theorem stems from being more accessible for calculations than K-theory, and hence a single calculation of K-theory can be used with homological calculations to obtain a host of ‘nearby’ calculations in K-theory. For instance, Quillen's calculation of the K-theory of finite fields gives rise to Hesselholt and Madsen's calculations for local fields, and Voevodsky's calculations for the integers give insight into the diffeomorphisms of manifolds. In addition to the proof of the full integral version of the local correspondence between K-theory and topological cyclic homology, the book provides an introduction to the necessary background in algebraic K-theory and highly structured homotopy theory; collecting all necessary tools into one common framework. It relies on simplicial techniques, and contains an appendix summarizing the methods widely used in the field. , This book covers the connection between algebraic K-theory and Bökstedt, Hsiang and Madsen's topological cyclic homology and proves that the difference between the theories are ‘locally constant’. The usefulness of this theorem stems from being more accessible for calculations than K-theory, and hence a single calculation of K-theory can be used with homological calculations to obtain a host of ‘nearby’ calculations in K-theory. For instance, Quillen's calculation of the K-theory of finite fields gives rise to Hesselholt and Madsen's calculations for local fields, and Voevodsky's calculations for the integers give insight into the diffeomorphisms of manifolds. In addition to the proof of the full integral version of the local correspondence between K-theory and topological cyclic homology, the book provides an introduction to the necessary background in algebraic K-theory and highly structured homotopy theory; collecting all necessary tools into one common framework. It relies on simplicial techniques, and contains an appendix summarizing the methods widely used in the field. ]"

"This book will expose the reader to some of the fundamental methodology in non-cooperative game theory, and highlight some numerical methods, along with some relevant applications. Since the early development days, differential game theory has had a significant impact in such diverse disciplines as applied mathematics, economics, systems theory, engineering, operations, research, biology, ecology, environmental sciences, among others. Modern game theory now relies on wide ranging mathematical and computational methods, and relevant applications that are rich and challenging. Game theory has been widely recognized as an important tool in many fields. Importance of game theory to economics is illustrated by the fact that numerous game theorists, such as John Forbes Nash, Jr., Robert J. Aumann and Thomas C. Schelling, have won the Nobel Memorial Prize in Economics Sciences. Simply put, game-theory has the potential to reshape the analysis of human interaction."

"Groups are a means of classification, via the group action on a set, but also the object of a classification. How many groups of a given type are there, and how can they be described? Hölder’s program for attacking this problem in the case of finite groups is a sort of leitmotiv throughout the text. Infinite groups are also considered, with particular attention to logical and decision problems. Abelian, nilpotent and solvable groups are studied both in the finite and infinite case. Permutation groups and are treated in detail; their relationship with Galois theory is often taken into account. The last two chapters deal with the representation theory of finite group and the cohomology theory of groups, the latter with special emphasis on the extension problem. The sections are followed by exercises; hints to the solution are given, and for most of them a complete solution is provided."

"The text that comprises this volume is a collection of surveys and original works from experts in the fields of algebraic number theory, analytic number theory, harmonic analysis, and hyperbolic geometry. A portion of the collected contributions have been developed from lectures given at the "International Conference on the Occasion of the 60th Birthday of S. J. Patterson", held at the University Göttingen, July 27-29 2009. Many of the included chapters have been contributed by invited participants."

"Misalkan G adalah graf dengan himpunan simpul V = V(G) dan himpunan busur E = E(G), dimana |V(G)| dan |E(G)| menyatakan banyaknya simpul dan busur pada G. Suatu pemetaan dari V E ke himpunan bilangan bulat 1, 2, ..., |V|+|E| disebut pelabelan total simpul ajaib pada G jika merupakan pemetaan bijektif dengan sifat bahwa untuk setiap simpul v V, (v) + u N(v) (uv) = k dimana N(v) adalah himpunan semua simpul yang bertetangga dengan v. Nilai k disebut konstanta ajaib dari . Algoritma pelabelan sembarang graf secara umum bersifat NP-complete. Baker dan Sawada telah memberikan algoritma pelabelan total simpul ajaib pada graf lingkaran C n dan graf roda W n . Pada skripsi ini, algoritma lingkaran tersebut akan dibahas. Selain itu, akan dibangun algoritma pelabelan dan graf kecebong T m,n . total simpul ajaib pada graf matahari C n ⊙ Menggunakan algoritma-algoritma tersebut dapat dihasilkan semua pelabelan total simpul ajaib pada graf yang terkait. Algoritma-algoritma ini akan diimplementasikan menggunakan program. Sebagai hasil implementasi dilakukan simulasi yang memberikan banyaknya pelabelan total simpul ajaib yang berbeda dari graf lingkaran C n dengan 3 ≤ n ≤ 10, graf matahari C n ⊙ dengan 3 ≤ n ≤ 7, dan graf kecebong T m,n dengan 3 ≤ m ≤ 7, 1 ≤ n ≤ 5 untuk setiap nilai k yang mungkin.

---

Let graph G has vertex set V = V(G) and edge set E = E(G), and let |V(G)| and |E(G)| is the number of vertices and edges on G. A one-to-one map from V E onto {1, 2, ..., |V|+|E|} is a vertex magic total labeling if there is a constant k so that for every vertex v V, (v) + u N(v) (uv) = k where N(v) denoted the set of vertices adjacent to v. The constant k is called the magic constant of . In general, the labeling algorithms on any graphs is NP-complete. In their paper, Baker and Sawada give the vertex magic total labeling algorithms on cycle graph C n and wheel graph W n . This skripsi explains the vertex magic total labeling algorithm on cycle from Baker and Sawada and vertex magic total labeling algorithms on sun graph C n ⊙ and tadpole graph T m,n . Using these algorithms, all non-isomorphic vertex magic total labelings on those classes of graphs can obtained. These algorithms are implemented as computer programs. From simulations, we get the number of non-isomorphic vertex magic total labelings on cycles C n (3 ≤ n ≤ 10), suns C n ⊙ (3 ≤ n ≤ 7), and tadpoles T m,n (3 ≤ m ≤ 7, 1 ≤ n ≤ 5) for every possible value of k."