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

In recent years, fractal is widely used everywhere and escape time algorithm (ETA) became the most useful fractal creating method. However, ETA performs not so well because it needs huge computations. So, in this paper, we first present an improved fractal creating algorithm by symmetrical radius of k - M set. Meanwhile, we use distributed cooperative method to improve classic ETA into parallel system, which is called distributed cooperative ETA (DCETA). Secondly, we present the proof of fractal property in k - M set f c z = z k + c with exponent k    ( k < 0 ) , which concludes its threshold and symmetrical property. Finally, computational result shows correctness of the novel DCETA, which shows better computational effectiveness and lower waste.

Distributed Cooperative Algorithm for k-M Set with Negative Integer k by Fractal Symmetrical Property