{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T17:11:35Z","timestamp":1791997895788,"version":"4.4.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2005,7]]},"abstract":"<jats:p>The acceptance\/rejection approach is widely used in universal nonuniform random number generators. Its key part is an accurate approximation of a given probability density from above by a hat function. This article uses a piecewise constant hat function, whose values are overestimates of the density on the elements of the partition of the domain. It uses a sawtooth overestimate of Lipschitz continuous densities, and then examines all local maximizers of such an overestimate. The method is applicable to multivariate multimodal distributions. It exhibits relatively short preprocessing time and fast generation of random variates from a very large class of distributions.<\/jats:p>","DOI":"10.1145\/1103323.1103325","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:07:09Z","timestamp":1139238429000},"page":"205-232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Universal nonuniform random vector generator based on acceptance-rejection"],"prefix":"10.1145","volume":"15","author":[{"given":"Gleb","family":"Beliakov","sequence":"first","affiliation":[{"name":"Deakin University, Burwood, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116880"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020256900863"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331930310001611556"},{"key":"e_1_2_1_4_1","volume-title":"Optimization in Industry","author":"Beliakov G."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Bern M. and Eppstein D. 1992. Mesh generation and optimal triangulation. In Computing in Euclidean Geometry D.-Z. Du and F. Hwang Eds. World Scientific Singapore 23--90.]]  Bern M. and Eppstein D. 1992. Mesh generation and optimal triangulation. In Computing in Euclidean Geometry D.-Z. Du and F. Hwang Eds. World Scientific Singapore 23--90.]]","DOI":"10.1142\/9789814355858_0002"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009366"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"B\u00fceler B. Enge A. and Fukuda K. 2000. Exact volume computation for convex polytopes: A practical study. In Polytopes---Combinatorics and Computation G. Kalai and G. M. Ziegler Eds. Birkh\u00e4user Basel 131--154.]]  B\u00fceler B. Enge A. and Fukuda K. 2000. Exact volume computation for convex polytopes: A practical study. In Polytopes---Combinatorics and Computation G. Kalai and G. M. Ziegler Eds. Birkh\u00e4user Basel 131--154.]]","DOI":"10.1007\/978-3-0348-8438-9_6"},{"key":"e_1_2_1_8_1","unstructured":"Dagpunar J. 1988. Principles of Random Variate Generation. Clarendon Press Oxford.]]  Dagpunar J. 1988. Principles of Random Variate Generation. Clarendon Press Oxford.]]"},{"key":"e_1_2_1_9_1","unstructured":"Demyanov V. and Rubinov A. 1995. Constructive Nonsmooth Analysis. Peter Lang Frankfurt am Main.]]  Demyanov V. and Rubinov A. 1995. Constructive Nonsmooth Analysis. Peter Lang Frankfurt am Main.]]"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Devroye L. 1986. Nonuniform Random Variate Generation. Springer Verlag New York.]]  Devroye L. 1986. Nonuniform Random Variate Generation. Springer Verlag New York.]]","DOI":"10.1007\/978-1-4613-8643-8"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.1998.10474792"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Hansen P. and Jaumard B. 1995. Lipschitz optimization. In Handbook of Global Optimization R. Horst and P. Pardalos Eds. Kluwer Dordrecht 407--493.]]  Hansen P. and Jaumard B. 1995. Lipschitz optimization. In Handbook of Global Optimization R. Horst and P. Pardalos Eds. Kluwer Dordrecht 407--493.]]","DOI":"10.1007\/978-1-4615-2025-2_9"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/203082.203089"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"H\u00f6rmann W. Leydold J. and Derflinger G. 2004. Automatic Nonuniform Random Variate Generation. Springer Berlin.]]  H\u00f6rmann W. Leydold J. and Derflinger G. 2004. Automatic Nonuniform Random Variate Generation. Springer Berlin.]]","DOI":"10.1007\/978-3-662-05946-3"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Horst R. Pardalos P. and Thoai N. 2000. Introduction to Global Optimization 2nd ed. Kluwer Academic Publishers Dordrecht.]]   Horst R. Pardalos P. and Thoai N. 2000. Introduction to Global Optimization 2nd ed. Kluwer Academic Publishers Dordrecht.]]","DOI":"10.1007\/978-1-4615-0015-5"},{"key":"e_1_2_1_16_1","unstructured":"Lay S. 1972. Convex Sets and their Applications. Wiley New York.]]  Lay S. 1972. Convex Sets and their Applications. Wiley New York.]]"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-01004-7"},{"key":"e_1_2_1_18_1","unstructured":"Leydold J. and H\u00f6rmann W. 2001. Universal algorithms as an alternative for generating nonuniform continuous random variates. In Monte Carlo Simulation G. Schu\u00ebler and P. Spanos Eds. A. A. Balkema Rotterdam 177--183.]]  Leydold J. and H\u00f6rmann W. 2001. Universal algorithms as an alternative for generating nonuniform continuous random variates. In Monte Carlo Simulation G. Schu\u00ebler and P. Spanos Eds. A. A. Balkema Rotterdam 177--183.]]"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(94)90232-1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580583"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470317013"},{"key":"e_1_2_1_22_1","unstructured":"Rockafellar R. 1970. Convex Analysis. Princeton University Press Princeton.]]  Rockafellar R. 1970. Convex Analysis. Princeton University Press Princeton.]]"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Rubinov A. 2000. Abstract Convexity and Global Optimization. Kluwer Academic Publishers Dordrecht; Boston.]]  Rubinov A. 2000. Abstract Convexity and Global Optimization. Kluwer Academic Publishers Dordrecht; Boston.]]","DOI":"10.1007\/978-1-4757-3200-9"},{"key":"e_1_2_1_24_1","unstructured":"Sergeyev Y. D. 2004. Finding the minimal root of an equation: applications and algorithms based on Lipschitz condition. In Global Optimization---Selected Case Studies J. Pint\u00e9r Ed. Kluwer Academic Publishers in press.]]  Sergeyev Y. D. 2004. Finding the minimal root of an equation: applications and algorithms based on Lipschitz condition. In Global Optimization---Selected Case Studies J. Pint\u00e9r Ed. Kluwer Academic Publishers in press.]]"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009667824060"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1200319"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:19740097"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580381"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00229304"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103323.1103325","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1103323.1103325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:25Z","timestamp":1750286605000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103323.1103325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["10.1145\/1103323.1103325"],"URL":"https:\/\/doi.org\/10.1145\/1103323.1103325","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]},"assertion":[{"value":"2005-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}