{"title":"Limit theorems for patterns in ranked tree‐child networks","authors":"Michael Fuchs, Hexuan Liu, Tsan-Cheng Yu","doi":"10.1002/rsa.21177","DOIUrl":"https://doi.org/10.1002/rsa.21177","url":null,"abstract":"We prove limit laws for the number of occurrences of a pattern on the fringe of a ranked tree-child network which is picked uniformly at random. Our results extend the limit law for cherries proved by Bienvenu et al. (2022). For patterns of height $1$ and $2$, we show that they either occur frequently (mean is asymptotically linear and limit law is normal) or sporadically (mean is asymptotically constant and limit law is Poisson) or not all (mean tends to $0$ and limit law is degenerate). We expect that these are the only possible limit laws for any fringe pattern.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83529908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Aplikasi Data Mining Berbasis Web Menggunakan Algoritma Apriori Untuk Analisa Pola Pembelian Barang Pada PT Menara Bahagia Bersama","authors":"Gaerry Setiawan, Dicky Septa Surya Putra, Hartana Wijaya","doi":"10.31253/algor.v3i2.1020","DOIUrl":"https://doi.org/10.31253/algor.v3i2.1020","url":null,"abstract":"abstract","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78361704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SISTEM PENDUKUNG KEPUTUSAN DALAM PENENTUAN GURU BERPRESTASI PADA SMKN 1 PUGUNG, TANGGAMUS","authors":"","doi":"10.31253/algor.v3i2.1490","DOIUrl":"https://doi.org/10.31253/algor.v3i2.1490","url":null,"abstract":"Sekolah Menengah Kejuruan Negri 1 Pugung merupakan sekolah yang memiliki kualifikasi tersendiri dalam memilih tenaga pengajar untuk menjadi guru di sekolah tersebut, dan juga untuk menentukan guru yang berprestasi. Pemilihan guru berprestasi merupakan metode yang digunakan sebagai bentuk penghargaan kepada pekerjaannya dengan kinerja belajar mengajar selama menjadi tenaga pengajar. Adapun permasalahan dari pemilihan guru berprestasi yaitu adanya kendala dalam menentuka kriteria dan tidak tepat. Untuk itu dibutuhkan sistem pendukung keputusan (SPK) atau Decision support system yang dapat memperhitungkan kriteria yang sudah di tentukan untuk mempermudah dalam pengambilan keputusan, adapun kriteria yang di tentukan yaitu ; Nilai kehadiran, nilai disiplin, nilai kerjasama dan nilai prestasi. Sistem pendukung keputusan ini menggunakan metode simple additive weighting (SAW). Adapun tujuan dari sistem pendukung keputusan pemilihan guru berprestasi yaitu untuk mengapresiasi prestasi kerja yang telat dilakukan selama manjadi tenaga pengajar dan diharapkan dapat menambah motivasi guru dan peserta didik lainya agar lebih meningkatkan kinerja dalam belajar mengajar. Dari hasil penelitian ini dengan kesimpulan diharapkan dapat mempermudah kepala sekolah dan pengawas sekolah dalam menilai guru berprestasi berdasarkan kriteria yang telah ditentukan, serta disarankan bahwa sistem pendukung keputusan ini dapat dikembangkan dengan metode yang berbeda atau mengkombinasikan metode SAW dengan metode lain.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79816560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Online Crowdfunding Platform Information System","authors":"Amesanggeng Pataropura","doi":"10.31253/algor.v3i2.1035","DOIUrl":"https://doi.org/10.31253/algor.v3i2.1035","url":null,"abstract":"\u0000 \u0000 \u0000 \u0000In the modern world, especially in the field of crowd funding, technology is getting more advanced to facilitate fundraising activities. By utilizing computer technology in the field of crowd funding, it will facilitate fundraising activities carried out by creators and providing funds by donor. Such as can be done online fundraising. Currently there are still many people who carry out manual fundraising activities which require a lot of time because they have to make documents to support fundraising and they have to approach potential donor. The possibility of losing data on donors who have provided funds is very likely because funder data is only written in a book which causes the data to become irregular. To solve the existing problem is to create a system that can store data on fundraisers and donors electronically. Computerized systems can help fundraisers (creators) and donors. This system is made with the waterfall method and uses a web base where users need an internet connection to access this system. \u0000 \u0000 \u0000 \u0000","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78045411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementasi Web Service pada Aplikasi Pemesanan Makanan Berbasis Android","authors":"Edy Edy, Daniel Adhinugraha, Likodemus Priko","doi":"10.31253/algor.v3i2.1449","DOIUrl":"https://doi.org/10.31253/algor.v3i2.1449","url":null,"abstract":"Teknologi informasi sudah menyebar bukan hanya sebatas pada teknologi komputer, tetapi juga untuk tenologi komunikasi seperti telepon genggam yang saat ini sudah mampu mengelola berbagai data layaknya komputer. Telepon genggam yang mempunyai kemampuan tersebut atau disebut smartphone sudah menjadi kebutuhan sehari-hari yang dapat membantu berbagai macam kebutuhan pengelolaan informasi karena disematkan sistem operasi dan aplikasi lainnya untuk berbagai keperluan. Contohnya adalah keperluan untuk pendataan menu makanan pada suatu perusahaan yang menyedikan konsumsi untuk karyawannya. Dengan bantuan aplikasi smartphone data dan informasi tentang menu makanan dan pilihan menu dari karyawan dapat dikumpulkan dengan lebih mudah menggunakan Web Service yang kemudian dilakukan pengeloaan pada sistem informasi pengelolaah menu tersebut. Berdasarkan hasil kuisioner, Aplikasi ini sangat membantu para karyawan dalam melakukan proses pemesanan dengan 85.2% menyatakan setuju dengan pengunaan tersebut","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86543700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Web-Based Public Complaint Information System Design Using the Laravel Framework","authors":"Avandy Wijaya, Indah Fenriana, Lianny Wydiastuty Kusuma, Ellysha Kusuma","doi":"10.31253/algor.v3i2.1036","DOIUrl":"https://doi.org/10.31253/algor.v3i2.1036","url":null,"abstract":"In this day and age technology is growing rapidly and technology has an important role in all aspects of human life, especially websites which are currently becoming media information that is very easy to achieve using only the internet. Website is a web page that can be accessed by the public using the internet, and the website also has a domain name that is owned by each website. In addition, the website can also be opened via computers, laptops, smartphones, tablets, and so on. The purpose of this research is to design a system that has the Create and Read feature which will later be used by the public in reporting, to design a website public complaint system so that information sent by the public to the government is fast and accurate, based on a website-based public complaint system located on the website. In it there is a feature that can send an email to notify that the information provided by the public has been received, or it is resolved with the SMTP feature which later on the public can find out the complaint process. The system made is web-based using the Laravel framework, the system is made based on the public complaint system, consisting of people who can upload and send complaints to the government as well as people who see the status of their complaints, besides that there are admins who can view and process complaints, can add officers, and can print report data in the form of pdf. Officers can only view and process complaints and can print report data in the form of pdf, where users of this system are admins and officers from government and the community are users.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90559101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model Prediksi Untuk Menentukan Predikat Kelulusan Siswa Menggunakan Algoritma Naïve Bayes Dan Mlp: Studi Kasus Smk Buddhi Tangerang","authors":"Santa Margita","doi":"10.31253/algor.v3i2.1429","DOIUrl":"https://doi.org/10.31253/algor.v3i2.1429","url":null,"abstract":"Students of Vocational High School received the title of graduation after finished their studies. Whether graduating students capable or not to get high predicate was influenced by several factors. The factors that could affect the values are the averages of report, National Examination (UN), skill, Vocational Competency Exam (UKK), and attitude in knowing the pattern of these variables. The previous research showed that Naïve Bayes algorithm has high accuracy value. Accuracy value obtained prove that the Naïve Bayes has good accuracy percentage. Thus this algorithm can predict graduating students of SMK Buddhi Tangerang in terms of determining the predicate obtained. This research used the Naïve Bayes algorithm and MLP in knowing the pattern of these variables. Testing was done by Confusion Matrix. The percentage results of accuracy proved that the Naïve Bayes was 92%, while MLP 90%. Thus Naïve Bayes algorithm has higher accuracy value than MLP. Naïve Bayes algorithm could predict the predicate which was obtained by graduating students of Buddhi Dharma Vocational High School Tangerang.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89796302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Eko Budiarto, R. Rino, S. Hariyanto, Dera Susilawati
{"title":"Penerapan Data Mining Untuk Rekomendasi Beasiswa Pada SD Maria Mediatrix Menggunakan Algoritma C4.5","authors":"Eko Budiarto, R. Rino, S. Hariyanto, Dera Susilawati","doi":"10.31253/algor.v3i2.1019","DOIUrl":"https://doi.org/10.31253/algor.v3i2.1019","url":null,"abstract":"SD Maria Mediatrix merupakan instansi yang bergerak dalam bidang pendidikan yang mengikuti berbagai program pemerintah dalam menunjang kelancaran belajar, seperti beasiswa Program Indonesia Pintar (PIP). Proses seleksi penerimaan beasiswa pada SD Maria Mediatrix sejauh ini masih dilakukan secara konvensional yang sering kali menimbulkan beberapa permasalahan, antara lain membutuhkan waktu yang lama dan hasilnya kurang tepat sasaran. Oleh karena itu, dilakukan penelitian serta perancangan sebuah aplikasi yang dapat mengklasifikasi penerima beasiswa dengan metode klasifikasi, serta menggunakan C4.5 sebagai algoritmanya. Tujuan dari penelitian ini adalah melakukan implementasi klasifikasi dengan algoritma C4.5 ke dalam sebuah aplikasi berbasis web yang diharapkan dapat membantu SD Maria Mediatrix dalam menentukan penerima beasiswa, yaitu dengan mengumpulkan data siswa yang akan digunakan sebagai dataset. Dataset tersebut kemudian dilakukan pengambilan sampel data untuk keperluan perhitungan manual. Proses perhitungan secara manual berfungsi untuk mengetahui alur dari perhitungan agar dapat diimplementasikan dengan baik pada aplikasi yang akan dibuat. Aplikasi berbasis web yang dihasilkan melakukan proses perhitungan C4.5 dan pembentukan aturan klasifikasi secara otomatis dari data siswa yang dimasukkan, pengguna aplikasi cukup menginput nama siswa, penghasilan ayah, penghasilan ibu, pemegang KIP, jumlah saudara, dan jarak rumah hasilnya akan mengetahui siswa tersebut layak mendapat beasiswa atau tidak.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89613712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jane Breen, Nolan Faught, C. Glover, Mark Kempton, Adam Knudson, A. Oveson
{"title":"Kemeny's constant for nonbacktracking random walks","authors":"Jane Breen, Nolan Faught, C. Glover, Mark Kempton, Adam Knudson, A. Oveson","doi":"10.1002/rsa.21144","DOIUrl":"https://doi.org/10.1002/rsa.21144","url":null,"abstract":"Kemeny's constant for a connected graph G$$ G $$ is the expected time for a random walk to reach a randomly chosen vertex u$$ u $$ , regardless of the choice of the initial vertex. We extend the definition of Kemeny's constant to nonbacktracking random walks and compare it to Kemeny's constant for simple random walks. We explore the relationship between these two parameters for several families of graphs and provide closed‐form expressions for regular and biregular graphs. In nearly all cases, the nonbacktracking variant yields the smaller Kemeny's constant.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80072034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}