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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In complex online social networks, it is crucial for a service consumer toextract the trustworthiest way to a target service provider from numeroussocial trust paths between them. The extraction of the trustworthiest way(namely, optimal social trust path (OSTP)) with multiple end-to-end quality oftrust (QoT) constraints has been proved to be NP-Complete. Heuristic algorithmswith polynomial and pseudo-polynomial-time complexities are often used to dealwith this challenging problem. However, existing solutions cannot guarantee theefficiency of searching, that is, they can hardly avoid obtaining partialoptimal solutions during searching process. Quantum annealing usesdelocalization and tunneling to avoid falling into local minima withoutsacrifying execution time. It has been proved to be a promising way to manyoptimization problems in recently published literatures. In this paper, for thefirst time, QA based OSTP algorithms (QA_OSTP) is applied to the extraction ofthe trustworthiest way. The experiment results show that QA based algorithmshave better performance than its heuristic opponents.

Extracting the trustworthiest way to service provider in complex online social networks