Hasil Pencarian  ::  Simpan CSV :: Kembali

"This article is a record of lectures on japanese prime ministers who appeared in the approximately 30 years of the heisei era. First, Akio Watanabe amongst other prime ministers, mainly discussed Kiichi Miyazawa,"

"Dalam tesis dibahas pencocokan hampiran untai (approximate string matching) dari dua untai berbeda. Dalam meninjau tingkat kedekatan hampiran dua untai atau tingkat kemiripan dua untai digunakan ukuran Jarak Levenshtein, Dalam penentuan jarak tersebut digunakan metode program dinamik. Diperoleh beberapa sifat-sifat yang berhubungan dengan susunan kedua untai yang dicocokkan. Pada akhir tesis diberikan juga program komputer sederhana dalam penentuan jarak Levenshtein.

---

In this thesis described approximate string matching problem between two different strings. To show the approximate level of both strings or the similarity level of both strings is used Levenshtein distance. To determine Levenshtein distance is used by dynamic programming method. Found Some characteristics that have relation with composition of both strings that are matched. At the end of the thesis, given the simple computer program to determine Levenshtein distance."

"Dibahas visualisasi kurva hampiran dengan menggunakan metode Hampiran B-Spline. Dalam hampiran ini diberikan sejumlah data koordinat, dengan menggunakan kombinasi linear dari sejumlah basis B-Spline akan diperoleh kurva hampiran yang dimaksud. Fungsi basis yang digunakan disini berderajat 1,2, dan 3. Kurva yang dihasilkan kemudian akan divisualisasikan pada jendela gratis. Jendela grafis dibuat pada aplikasi yang dijalankan dengan sistem Microsoft Windows 16 bit dan 32 bit. Platform yang dipakai untuk membuat aplikasi adalah Borland C++ ver. 4.5 for Windows, pembuatan kelas baru yang merupakan turunan dari objek-objek yang telah ada pada platform ini sangat menunjang pada aplikasi yang dibentuk. Dengan sub selang penggambaran h diberikan oleh pengguna, maka semakin kecil h kurva hampiran yang dibentuk akan semakin halus. Semakin tinggi derajat fungsi basis yang digunakan maka kurva yang dihasilkan akan semakin halus, akan tetapi jumlah operasi rekursif yang dilakukan semakin banyak."

"This research departs from the victory of President Joko Widodo's son and son-in-law in the 2020 Regional Head Election. Approximately 44% or 55 candidates of the 124 regional head candidates who have a kinship with the authorities are confirmed to win the 2020 simultaneous Regional Head Election and stroll as regional heads. For this reason, this study will explore the phenomenon of winning candidates exposed to kinship politics, especially with the president in the 2020 Regional Head Election. This research also analyzes some of the causes of nepotism in the democratic system that are still visible in the 2020 simultaneous Regional Head Election. To achieve this goal, the research uses descriptive research methods with a qualitative approach. The method was chosen because the 2020 simultaneous Regional Head Election were multidimensional. The results of the study found several factors that led to kinship politics still coloring the 2020 Regional Head Election, including the advancement of candidates who were exposed to kinship with the president. These factors, such as the popularity of family names, are deliberately carried out by politicians as a way of inheriting power and the weak democratization of political parties, such as recruiting candidates for the regional head. This also led to candidates exposed to kinship with the president in striding to win the Regional Head Election. This research concludes that kinship should be able to lead to moral behavior, not just a pursuit of power. Concerning kinship politics, it can be controlled through internal reforms of political parties as institutions that carry out the role of candidate recruitment."

"This paper proposes a novel approximation for a Spatial Time Division Multiple Access (STDMA) link-scheduling algorithm based on geometrical node exploitation to improve spatial reuse performance. The geometrical location of nodes was exploited in order to reduce computational complexity and to achieve higher accuracy in transmission to satisfy the Signal to Interference and Noise Ratio (SINR) requirement. The process of SINR global checking is a main constraint in the SINR based interference model but is reduced through geometrical partition and interference approximations based on geometrical node locations. Simulation results show that the proposed algorithm increases the spatial reuse performance in comparison to the greedy physical interference model in similar scenarios. The model utilizing geometrical partition exhibits lower complexity compared to the pure physical interference model that includes SINR global checking."

"Data approximation by low-complexity models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory including, system and control theory, signal processing, computer algebra for approximate factorization and common divisor computation, computer vision for image deblurring and segmentation, machine learning for information retrieval and clustering, bioinformatics for microarray data analysis, chemometrics for multivariate calibration, and psychometrics for factor analysis."

"Contains the proceedings that were prepared in connection with the international conference Approximation Theory XIII, which was held March 7-10, 2010 in San Antonio, Texas. This book includes many relevant topics in approximation theory, such as abstract approximation, approximation with constraints, and interpolation and smoothing."