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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

: The frame of a cone C is a minimal set of generators, and the lineality space L of C is the greatest linear subspace contained in C. Algorithms are described for determining the frame and the lineality space of a cone C(S) spanned by a finite set S. These algorithms can be used for determining the vertices, edges, and other faces of low dimension of the convex hull of a finite set H(S). All algorithms are based on the simplex method of linear programming. The problem of finding the lineality space can be successively reduced to problems in spaces of lower dimensions. (Author)

Algorithms for frames and lineality spaces of cones