Random Structures & Algorithms最新文献_第7页

Perancangan Aplikasi Web Dengan Menggunakan Algoritma Apriori Pada Data Mining Untuk Mengetahui Pola Pembelian Konsumen PT Cipta Tunggal Elektronik

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-09-27 DOI: 10.31253/algor.v3i1.640

Freddie Freddie, Yusuf Kurnia, Rudy Arijanto, Yakub Yakub

引用次数: 0

PENERAPAN DASHBOARD BUSINESS INTELLIGENCE UNTUK MENAMPILKAN FUNDAMENTAL SAHAM LQ45

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-09-27 DOI: 10.31253/algor.v3i1.768

Khanti Kusuma Dewi, Aditiya Hermawan, L. Kusuma

{"title":"PENERAPAN DASHBOARD BUSINESS INTELLIGENCE UNTUK MENAMPILKAN FUNDAMENTAL SAHAM LQ45","authors":"Khanti Kusuma Dewi, Aditiya Hermawan, L. Kusuma","doi":"10.31253/algor.v3i1.768","DOIUrl":"https://doi.org/10.31253/algor.v3i1.768","url":null,"abstract":"Pada saat ini investai berkembang dengan pesat di khalayak orang banyak. Melalui investasi seseorang akan mendapatkan passive income, ada berbagai macam investasi yang ada di Indonesia, salah satunya adalah investasi saham. Dalam berinvestasi tidak bisa saham seseorang untuk berinvestasi dan menentukan mana yang akan dibeli oleh kita, orang yang akan berinvestasi atau bisa dibilang seorang investor. Dalam berinvestasi ada beberapa hal yang perlu diperhatikan dalam menentukan saham yang akan dibeli. Hal yang perlu diperhatikan dalam memilih saham perusahaan adalah dengan melakukan analisis fundamental saham pada perusahaan tertentu. Namun dalam menganalisis fundamental saham yang cukup memerlukan waktu yang lebih panjang. Untuk memudahkan investor membaca fundamental saham perusahaan tertentu yang akan diinvestasikan, maka dibuatlah Dashboard dengan menerapkan Business Intelligence menggunakan Single Page Application agar seorang investor mudah, cepat dan tepat mengambil keputusan dalam berinvestasi di pasar saham. Hasil yang diharapkan dari penelitian ini yaitu agar memudahkan seorang investor dalam menganalisis Kembali saham yang akan dibeli.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"25 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84210473","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}

引用次数: 0

Approximately counting independent sets in bipartite graphs via graph containers 利用图容器对二部图中的独立集进行近似计数

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-09-08 DOI: 10.1002/rsa.21145

Matthew Jenssen, Will Perkins, Aditya Potukuchi

{"title":"Approximately counting independent sets in bipartite graphs via graph containers","authors":"Matthew Jenssen, Will Perkins, Aditya Potukuchi","doi":"10.1002/rsa.21145","DOIUrl":"https://doi.org/10.1002/rsa.21145","url":null,"abstract":"By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to d$$ d $$ ‐regular, bipartite graphs satisfying a weak expansion condition: when d$$ d $$ is constant, and the graph is a bipartite Ω(log2d/d)$$ Omega left({log}^2d/dright) $$ ‐expander, we obtain an FPTAS for the number of independent sets. Previously such a result for d>5$$ d>5 $$ was known only for graphs satisfying the much stronger expansion conditions of random bipartite graphs. The algorithm also applies to weighted independent sets: for a d$$ d $$ ‐regular, bipartite α$$ alpha $$ ‐expander, with α>0$$ alpha >0 $$ fixed, we give an FPTAS for the hard‐core model partition function at fugacity λ=Ω(logd/d1/4)$$ lambda =Omega left(log d/{d}^{1/4}right) $$ . Finally we present an algorithm that applies to all d$$ d $$ ‐regular, bipartite graphs, runs in time expOn·log3dd$$ exp left(Oleft(ncdotp frac{log^3d}{d}right)right) $$ , and outputs a (1+o(1))$$ left(1+o(1)right) $$ ‐approximation to the number of independent sets.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"35 1","pages":"215 - 241"},"PeriodicalIF":1.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76321074","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}

引用次数: 10

Covering random graphs with monochromatic trees 用单色树覆盖随机图

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-09-06 DOI: 10.1002/rsa.21120

Domagoj Bradac, M. Buci'c

{"title":"Covering random graphs with monochromatic trees","authors":"Domagoj Bradac, M. Buci'c","doi":"10.1002/rsa.21120","DOIUrl":"https://doi.org/10.1002/rsa.21120","url":null,"abstract":"Given an r$$ r $$ ‐edge‐colored complete graph Kn$$ {K}_n $$ , how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well‐known essentially equivalent formulation of the classical Ryser's conjecture which, despite a lot of attention over the last 50 years, still remains open. A number of recent papers consider a sparse random analogue of this question, asking for the minimum number of monochromatic components needed to cover the vertex set of an r$$ r $$ ‐edge‐colored random graph 𝒢(n,p) . Recently, Bucić, Korándi, and Sudakov established a connection between this problem and a certain Helly‐type local to global question for hypergraphs raised about 30 years ago by Erdős, Hajnal, and Tuza. We identify a modified version of the hypergraph problem which controls the answer to the problem of covering random graphs with monochromatic components more precisely. To showcase the power of our approach, we essentially resolve the 3‐color case by showing that (logn/n)1/4$$ {left(log n/nright)}^{1/4} $$ is a threshold at which point three monochromatic components are needed to cover all vertices of a 3‐edge‐colored random graph, answering a question posed by Kohayakawa, Mendonça, Mota, and Schülke. Our approach also allows us to determine the answer in the general r$$ r $$ ‐edge colored instance of the problem, up to lower order terms, around the point when it first becomes bounded, answering a question of Bucić, Korándi, and Sudakov.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"12 1","pages":"545 - 563"},"PeriodicalIF":1.0,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73781965","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}

引用次数: 1

Self‐avoiding walk on the hypercube 在超立方体上自我避免行走

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-08-08 DOI: 10.1002/rsa.21117

G. Slade

引用次数: 3

PENERAPAN METODE SIMPLE ADDITIVE WEIGHTING (SAW) DALAM PERANCANGAN APLIKASI PEMILIHAN PASANGAN BERBASIS WEB

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-07-15 DOI: 10.31253/algor.v2i2.545

Chrisantus Robert William Resi, Yusuf Kurnia, Hartana Wijaya, Dera Susilawati

引用次数: 0

Analisis dan Perancangan Sistem Informasi Pendaftaran Online Seminar & Workshop Berbasis Website 在线注册信息系统分析与设计研讨会及研讨会

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-07-15 DOI: 10.31253/algor.v2i2.546

Kevin Natanael, Tugiman Tugiman, Amat Basri

{"title":"Analisis dan Perancangan Sistem Informasi Pendaftaran Online Seminar & Workshop Berbasis Website","authors":"Kevin Natanael, Tugiman Tugiman, Amat Basri","doi":"10.31253/algor.v2i2.546","DOIUrl":"https://doi.org/10.31253/algor.v2i2.546","url":null,"abstract":"Kemajuan teknologi informasi saat ini juga di terapkan pada sistem pendaftaran seminar dan workshop secara online. Penerapan sistim pendaftaran online berbasis web diharapkan dapat mempermudah proses pendaftaran seminar, menghindari kesalahan dalam penginputan nama, dan mudah dalam memberikan informasi jadwal yang berupa notif, serta memudahkan panitia dalam mengumpulkan data pendaftar. Selain itu juga memudahkan penyimpanan data dalam database, yang memerlukan tinggal diberikan hak akses, dan pencetakan e-sertifikat. RAD (Rapid Application Development) bersifat incremental terutama untuk waktu pengerjaan yang relatif pendek. Dalam penerapannya menekankan pada proses perencanaan singkat dengan menitikberatkan pada proses pengembangan perangkat lunak yang terdiri dari pengembangan, pengujian dan umpan balik. UAT (User Acceptance Test) merupakan salah satu komponen penting dalam suatu pengujian sistim, hal ini untuk mengetahui penerimaan oleh pengguna awam. Pengujian menggunakan metode pengujian UAT, diperoleh hasil bahwa program ini diterima oleh pengguna dengan persentase rata-rata dari keseluruhan adalah 86,6%.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"24 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2021-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88644353","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}

引用次数: 0

On subgraphs with degrees of prescribed residues in the random graph 在随机图中具有规定残数度的子图上

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-07-14 DOI: 10.1002/rsa.21137

Asaf Ferber, Liam Hardiman, M. Krivelevich

引用次数: 4

Erasures versus errors in local decoding and property testing 擦除与本地解码和属性测试中的错误

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-07-07 DOI: 10.1002/rsa.21031

Sofya Raskhodnikova, Noga Ron-Zewi, Nithin M. Varma

引用次数: 6

A Ramsey–Turán theory for tilings in graphs 图中平铺的Ramsey-Turán理论

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2021-06-17 DOI: 10.1002/rsa.21182

Jie Han, Patrick Morris, Guanghui Wang, Donglei Yang

{"title":"A Ramsey–Turán theory for tilings in graphs","authors":"Jie Han, Patrick Morris, Guanghui Wang, Donglei Yang","doi":"10.1002/rsa.21182","DOIUrl":"https://doi.org/10.1002/rsa.21182","url":null,"abstract":"For a $k$-vertex graph $F$ and an $n$-vertex graph $G$, an $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$. For $rin mathbb{N}$, the $r$-independence number of $G$, denoted $alpha_r(G)$ is the largest size of a $K_r$-free set of vertices in $G$. In this paper, we discuss Ramsey--Tur'an-type theorems for tilings where one is interested in minimum degree and independence number conditions (and the interaction between the two) that guarantee the existence of optimal $F$-tilings. For cliques, we show that for any $kgeq 3$ and $eta>0$, any graph $G$ on $n$ vertices with $delta(G)geq eta n$ and $alpha_k(G)=o(n)$ has a $K_k$-tiling covering all but $lfloortfrac{1}{eta}rfloor(k-1)$ vertices. All conditions in this result are tight; the number of vertices left uncovered can not be improved and for $eta<tfrac{1}{k}$, a condition of $alpha_{k-1}(G)=o(n)$ would not suffice. When $eta>tfrac{1}{k}$, we then show that $alpha_{k-1}(G)=o(n)$ does suffice, but not $alpha_{k-2}(G)=o(n)$. These results unify and generalise previous results of Balogh-Molla-Sharifzadeh, Nenadov-Pehova and Balogh-McDowell-Molla-Mycroft on the subject. We further explore the picture when $F$ is a tree or a cycle and discuss the effect of replacing the independence number condition with $alpha^*(G)=o(n)$ (meaning that any pair of disjoint linear sized sets induce an edge between them) where one can force perfect $F$-tilings covering all the vertices. Finally we discuss the consequences of these results in the randomly perturbed setting.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"28 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76885665","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}

引用次数: 6