English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The weighted star discrepancy of point sets appears in the weightedKoksma-Hlawka inequality and thus is a measure for the quality of point setswith respect to their performance in quasi-Monte Carlo algorithms. A specialchoice of point sets are lattice point sets whose generating vector can beobtained one component at a time such that the resulting lattice point set hasa small weighted star discrepancy.  In this paper we consider a reduced fast component-by-component algorithmwhich significantly reduces the construction cost for such generating vectorsprovided that the weights decrease fast enough.

A reduced fast component-by-component construction of lattice point sets with small weighted star discrepancy