Benny Lienata, Indah Fenriana, Andre Andre, R. Safitri
Pada era saat ini kebutuhan masyarakat terhadap pakaian semakin meningkat dalam kasus ini yang dibutuhkan masyarakat adalah pakaian yang nyaman, dan mampu melindungi kulit dan tubuh manusia. Banyaknya persaingan dalam dunia bisnis khususnya dalam industri penjualan pakaian, menuntut para pengembang untuk menemukan suatu strategi yang dapat meningkatkan penjualan dan pemasaran produk yang dijual, salah satunya adalah dengan pemanfaatan data penjualan produk pakaian dengan salah satu teknik data mining, yaitu asosiasi. PT. Vidiaelok Lestari Garmindo adalah salah satu perusahaan yang rutin melakukan pencatatan data transaksi penjualan. Data tersebut dapat digunakan untuk menganalisa produk mana yang paling laku terjual yang dapat digunakan untuk kebutuhan strategi pemasaran atau promosi. Proses menganalisa produk mana yang paling laku terjual yang dilakukan secara manual tentu akan membutuhkan waktu dan tenaga yang lebih besar. Oleh karena itu, maka dilakukan penelitian serta perancangan sebuah aplikasi yang dapat mengetahui produk mana yang paling laku terjual dengan menggunakan metode asosiasi, serta menggunakan apriori sebagai algoritmanya. Tujuan dari penelitian ini adalah melakukan implementasi aturan asosiasi dengan algoritma apriori ke dalam sebuah aplikasi berbasis web yang diharapkan dapat membantu PT. Vidiaelok Lestari Garmindo dalam mengetahui produk mana yang paling laku terjual. Aplikasi berbasis web yang dihasilkan melakukan analisa produk yang paling banyak terjual dari data transaksi yang dimasukkan, selain itu pengguna dapat menentukan rentang tanggal pada data yang ingin dianalisa, serta minimum support dan minimum confidence yang diinginkan guna menentukkan strategi pemasaran agar produk yang lain dapat bersaing dengan kompetitor lainnya.
{"title":"Penerapan Data Mining Pada Penjualan Pakaian Brand Expand Dengan Algoritma Apriori Menggunakan Metode Association Rules PT. Vidiaelok Lestari Garmindo","authors":"Benny Lienata, Indah Fenriana, Andre Andre, R. Safitri","doi":"10.31253/algor.v3i1.647","DOIUrl":"https://doi.org/10.31253/algor.v3i1.647","url":null,"abstract":"Pada era saat ini kebutuhan masyarakat terhadap pakaian semakin meningkat dalam kasus ini yang dibutuhkan masyarakat adalah pakaian yang nyaman, dan mampu melindungi kulit dan tubuh manusia. Banyaknya persaingan dalam dunia bisnis khususnya dalam industri penjualan pakaian, menuntut para pengembang untuk menemukan suatu strategi yang dapat meningkatkan penjualan dan pemasaran produk yang dijual, salah satunya adalah dengan pemanfaatan data penjualan produk pakaian dengan salah satu teknik data mining, yaitu asosiasi. PT. Vidiaelok Lestari Garmindo adalah salah satu perusahaan yang rutin melakukan pencatatan data transaksi penjualan. Data tersebut dapat digunakan untuk menganalisa produk mana yang paling laku terjual yang dapat digunakan untuk kebutuhan strategi pemasaran atau promosi. Proses menganalisa produk mana yang paling laku terjual yang dilakukan secara manual tentu akan membutuhkan waktu dan tenaga yang lebih besar. Oleh karena itu, maka dilakukan penelitian serta perancangan sebuah aplikasi yang dapat mengetahui produk mana yang paling laku terjual dengan menggunakan metode asosiasi, serta menggunakan apriori sebagai algoritmanya. Tujuan dari penelitian ini adalah melakukan implementasi aturan asosiasi dengan algoritma apriori ke dalam sebuah aplikasi berbasis web yang diharapkan dapat membantu PT. Vidiaelok Lestari Garmindo dalam mengetahui produk mana yang paling laku terjual. Aplikasi berbasis web yang dihasilkan melakukan analisa produk yang paling banyak terjual dari data transaksi yang dimasukkan, selain itu pengguna dapat menentukan rentang tanggal pada data yang ingin dianalisa, serta minimum support dan minimum confidence yang diinginkan guna menentukkan strategi pemasaran agar produk yang lain dapat bersaing dengan kompetitor lainnya.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"53 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88087344","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}
William kohin Cikutra, S. Hariyanto, E. Kusuma, Raditya Rimbawan Oprasto
{"title":"IDENTIFIKASI PENYALAHGUNAAN JALUR SMS MARKETING DENGAN KONTEN SMS PREMIUM PADA PT DIAN PRIMA JAYARAYA DENGAN ALGORITMA NAIVE BAYES","authors":"William kohin Cikutra, S. Hariyanto, E. Kusuma, Raditya Rimbawan Oprasto","doi":"10.31253/algor.v3i1.658","DOIUrl":"https://doi.org/10.31253/algor.v3i1.658","url":null,"abstract":"","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"44 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82688376","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}
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.
{"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}
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.
{"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}
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.
给定一个r $$ r $$‐边‐彩色完全图Kn $$ {K}_n $$，需要多少个单色连通分量才能覆盖它的顶点集?这个自然问题是一个众所周知的经典赖泽猜想的基本等价公式，尽管在过去的50年里受到了很多关注，但仍然是开放的。最近的一些论文考虑了这个问题的稀疏随机模拟，要求覆盖r $$ r $$‐边‐彩色随机图𝒢(n,p)的顶点集所需的最小单色分量数。最近，buciki, Korándi和Sudakov建立了这个问题与30年前Erdős, Hajnal和Tuza提出的某个Helly‐型超图局部到全局问题之间的联系。我们提出了超图问题的一个改进版本，它更精确地控制了覆盖带有单色分量的随机图问题的答案。为了展示我们的方法的强大功能，我们通过展示(logn/n)1/4 $$ {left(log n/nright)}^{1/4} $$是一个阈值来解决3色情况，在这个阈值处，需要三个单色分量来覆盖3边彩色随机图的所有顶点，回答了Kohayakawa, mendon a, Mota和sch lke提出的问题。我们的方法还允许我们在问题的一般r $$ r $$‐边有色实例中确定答案，直到低阶项，围绕它第一次成为有界的点，回答buciki, Korándi和Sudakov的问题。
{"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}
In “Online purchasing under uncertainty” we proved theorems concerning the cost of purchasing var-ious combinatorial structures (paths, cycles, etc.) in graphs with randomly weighted edges, which are examined and either purchased or discarded one-at-a-time by the purchaser. We discussed three models (POM, ROM, AOM) according to whether the edges were presented in a purchaser-selected order, a random order, or an (adaptive) adversarially selected order. The statements of Theorems 1.6–1.11 claim O(1) upper bounds in all three models but the proofs presented apply only to the ROM and POM models; as such we withdraw the claims of the AOM upper bounds from these results.
{"title":"Corrigendum to “Online purchasing under uncertainty”","authors":"A. Frieze","doi":"10.1002/rsa.21012","DOIUrl":"https://doi.org/10.1002/rsa.21012","url":null,"abstract":"In “Online purchasing under uncertainty” we proved theorems concerning the cost of purchasing var-ious combinatorial structures (paths, cycles, etc.) in graphs with randomly weighted edges, which are examined and either purchased or discarded one-at-a-time by the purchaser. We discussed three models (POM, ROM, AOM) according to whether the edges were presented in a purchaser-selected order, a random order, or an (adaptive) adversarially selected order. The statements of Theorems 1.6–1.11 claim O(1) upper bounds in all three models but the proofs presented apply only to the ROM and POM models; as such we withdraw the claims of the AOM upper bounds from these results.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"33 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87968921","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}
We study the number cn(N)$$ {c}_n^{(N)} $$ of n$$ n $$ ‐step self‐avoiding walks on the N$$ N $$ ‐dimensional hypercube, and identify an N$$ N $$ ‐dependent connective constant μN$$ {mu}_N $$ and amplitude AN$$ {A}_N $$ such that cn(N)$$ {c}_n^{(N)} $$ is O(μNn)$$ Oleft({mu}_N^nright) $$ for all n$$ n $$ and N$$ N $$ , and is asymptotically ANμNn$$ {A}_N{mu}_N^n $$ as long as n≤2pN$$ nle {2}^{pN} $$ for any fixed p<12$$ p
我们研究了N $$ n $$步距自避免行走在N $$ N $$维超cube上的cn(N) $$ {c}_n^{(N)} $$，并确定了一个N $$ N $$依赖的连接常数μN $$ {mu}_N $$和振幅an $$ {A}_N $$，使得cn(N) $$ {c}_n^{(N)} $$对于所有N $$ n $$和N $$ N $$都是O(μNn) $$ Oleft({mu}_N^nright) $$，并且对于任何固定的p<12 $$ p
{"title":"Self‐avoiding walk on the hypercube","authors":"G. Slade","doi":"10.1002/rsa.21117","DOIUrl":"https://doi.org/10.1002/rsa.21117","url":null,"abstract":"We study the number cn(N)$$ {c}_n^{(N)} $$ of n$$ n $$ ‐step self‐avoiding walks on the N$$ N $$ ‐dimensional hypercube, and identify an N$$ N $$ ‐dependent connective constant μN$$ {mu}_N $$ and amplitude AN$$ {A}_N $$ such that cn(N)$$ {c}_n^{(N)} $$ is O(μNn)$$ Oleft({mu}_N^nright) $$ for all n$$ n $$ and N$$ N $$ , and is asymptotically ANμNn$$ {A}_N{mu}_N^n $$ as long as n≤2pN$$ nle {2}^{pN} $$ for any fixed p<12$$ p<frac{1}{2} $$ . We refer to the regime n≪2N/2$$ nll {2}^{N/2} $$ as the dilute phase. We discuss conjectures concerning different behaviors of cn(N)$$ {c}_n^{(N)} $$ when n$$ n $$ reaches and exceeds 2N/2$$ {2}^{N/2} $$ , corresponding to a critical window and a dense phase. In addition, we prove that the connective constant has an asymptotic expansion to all orders in N−1$$ {N}^{-1} $$ , with integer coefficients, and we compute the first five coefficients μN=N−1−N−1−4N−2−26N−3+O(N−4)$$ {mu}_N=N-1-{N}^{-1}-4{N}^{-2}-26{N}^{-3}+Oleft({N}^{-4}right) $$ . The proofs are based on generating function and Tauberian methods implemented via the lace expansion, for which an introductory account is provided.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"1067 1","pages":"689 - 736"},"PeriodicalIF":1.0,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77273697","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}
We consider vertex percolation on pseudo‐random d$$ d $$ ‐regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in nd$$ frac{n}{d} $$ ) sized component, at p=1d$$ p=frac{1}{d} $$ . In the supercritical regime, our main result recovers the sharp asymptotic of the size of the largest component, and shows that all other components are typically much smaller. Furthermore, we consider other typical properties of the largest component such as the number of edges, existence of a long cycle and expansion. In the subcritical regime, we strengthen the upper bound on the likely component size.
我们考虑伪随机d $$ d $$正则图上的顶点渗透。第二作者先前的研究证实了在p=1d $$ p=frac{1}{d} $$处存在从小组分到线性(在nd $$ frac{n}{d} $$)尺寸组分的相变。在超临界状态下，我们的主要结果恢复了最大分量大小的尖锐渐近，并表明所有其他分量通常都要小得多。此外，我们还考虑了最大分量的其他典型性质，如边数、长循环的存在性和可扩展性。在亚临界状态下，我们加强了可能分量大小的上界。
{"title":"Site percolation on pseudo‐random graphs","authors":"Sahar Diskin, M. Krivelevich","doi":"10.1002/rsa.21141","DOIUrl":"https://doi.org/10.1002/rsa.21141","url":null,"abstract":"We consider vertex percolation on pseudo‐random d$$ d $$ ‐regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in nd$$ frac{n}{d} $$ ) sized component, at p=1d$$ p=frac{1}{d} $$ . In the supercritical regime, our main result recovers the sharp asymptotic of the size of the largest component, and shows that all other components are typically much smaller. Furthermore, we consider other typical properties of the largest component such as the number of edges, existence of a long cycle and expansion. In the subcritical regime, we strengthen the upper bound on the likely component size.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"30 1","pages":"406 - 441"},"PeriodicalIF":1.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78711878","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}
Chrisantus Robert William Resi, Yusuf Kurnia, Hartana Wijaya, Dera Susilawati
As social beings, humans have a desire to socialize, to build deeper relationships with individuals they like, and also to get a spouse according to the criteria they like. However, there are often obstacles in finding a spouse, one of which is due to being too busy and an increasing workload. Luckily we live in an era of technology that makes it easier for us to interact with other people. The spouse selection application itself is quite common for several circles in Indonesia, but some of these applications are considered not fully providing services to recommend a spouse based on the criteria. Therefore, it is necessary to design an application that helps users find a spouse according to the criteria they like. In this application, the Simple Additive Weighting (SAW) method will be used to process data. The SAW method itself has the ability to find optimal alternatives from a number of alternatives with certain criteria.
{"title":"PENERAPAN METODE SIMPLE ADDITIVE WEIGHTING (SAW) DALAM PERANCANGAN APLIKASI PEMILIHAN PASANGAN BERBASIS WEB","authors":"Chrisantus Robert William Resi, Yusuf Kurnia, Hartana Wijaya, Dera Susilawati","doi":"10.31253/algor.v2i2.545","DOIUrl":"https://doi.org/10.31253/algor.v2i2.545","url":null,"abstract":"As social beings, humans have a desire to socialize, to build deeper relationships with individuals they like, and also to get a spouse according to the criteria they like. However, there are often obstacles in finding a spouse, one of which is due to being too busy and an increasing workload. Luckily we live in an era of technology that makes it easier for us to interact with other people. The spouse selection application itself is quite common for several circles in Indonesia, but some of these applications are considered not fully providing services to recommend a spouse based on the criteria. Therefore, it is necessary to design an application that helps users find a spouse according to the criteria they like. In this application, the Simple Additive Weighting (SAW) method will be used to process data. The SAW method itself has the ability to find optimal alternatives from a number of alternatives with certain criteria.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"54 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2021-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82236126","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}
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%.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：