Click to open the HelpDesk interface
AECE - Front page banner



JCR Impact Factor: 1.102
JCR 5-Year IF: 0.734
Issues per year: 4
Current issue: May 2020
Next issue: Aug 2020
Avg review time: 74 days


Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


2,636,905 unique visits
Since November 1, 2009

Robots online now


SCImago Journal & Country Rank


Anycast DNS Hosting

 Volume 20 (2020)
     »   Issue 2 / 2020
     »   Issue 1 / 2020
 Volume 19 (2019)
     »   Issue 4 / 2019
     »   Issue 3 / 2019
     »   Issue 2 / 2019
     »   Issue 1 / 2019
 Volume 18 (2018)
     »   Issue 4 / 2018
     »   Issue 3 / 2018
     »   Issue 2 / 2018
     »   Issue 1 / 2018
 Volume 17 (2017)
     »   Issue 4 / 2017
     »   Issue 3 / 2017
     »   Issue 2 / 2017
     »   Issue 1 / 2017
 Volume 16 (2016)
     »   Issue 4 / 2016
     »   Issue 3 / 2016
     »   Issue 2 / 2016
     »   Issue 1 / 2016
  View all issues  


Clarivate Analytics published the InCites Journal Citations Report for 2019. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 1.102 (1.023 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.734.

Starting on the 15th of June 2020 we wiil introduce a new policy for reviewers. Reviewers who provide timely and substantial comments will receive a discount voucher entitling them to an APC reduction. Vouchers (worth of 25 EUR or 50 EUR, depending on the review quality) will be assigned to reviewers after the final decision of the reviewed paper is given. Vouchers issued to specific individuals are not transferable.

Starting on the 15th of December 2019 all paper authors are required to enter their SCOPUS IDs. You may use the free SCOPUS ID lookup form to find yours in case you don't remember it.

Clarivate Analytics published the InCites Journal Citations Report for 2018. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.650, and the JCR 5-Year Impact Factor is 0.639.

Starting today, the minimum number a pages for a paper is 8, so all submitted papers should have 8, 10 or 12 pages. No exceptions will be accepted.

Read More »


  3/2014 - 6

On the Optimality of Trust Network Analysis with Subjective Logic

PARK, Y. See more information about PARK, Y. on SCOPUS See more information about PARK, Y. on IEEExplore See more information about PARK, Y. on Web of Science
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (831 KB) | Citation | Downloads: 146 | Views: 2,430

Author keywords
trust, reputation, subjective logic, trust networks, identity management system

References keywords
trust(12), networks(6), josang(5), optimization(4), management(4), computing(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2014-08-31
Volume 14, Issue 3, Year 2014, On page(s): 49 - 54
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2014.03006
Web of Science Accession Number: 000340869800006
SCOPUS ID: 84907335535

Quick view
Full text preview
Building and measuring trust is one of crucial aspects in e-commerce, social networking and computer security. Trust networks are widely used to formalize trust relationships and to conduct formal reasoning of trust values. Diverse trust network analysis methods have been developed so far and one of the most widely used schemes is TNA-SL (Trust Network Analysis with Subjective Logic). Recent papers claimed that TNA-SL always finds the optimal solution by producing the least uncertainty. In this paper, we present some counter-examples, which imply that TNA-SL is not an optimal algorithm. Furthermore, we present a probabilistic algorithm in edge splitting to minimize uncertainty.

References | Cited By  «-- Click to see who has cited this paper

[1] A. Josang, T. Bhuiyan, "Optimal Trust Network Analysis with Subjective Logic," in Proc. of 2nd SECURWARE 2008, Aug. 2008, pp. 179-184.
[CrossRef] [SCOPUS Times Cited 69]

[2] S. Adali, R. Escriva, M. K. Goldberg, M. Hayvanovych, M. Magdon-Ismail, B. K. Szymanski, W. A. Wallace, G. Williams, "Measuring Behavioral Trust in Social Networks," in Proc. of IEEE ISI'2010, 2010, pp. 150-152.
[CrossRef] [SCOPUS Times Cited 123]

[3] A. Josang, R. Hayward, S. Pope, "Trust Network Analysis with Subjective Logic," in Proc. of 29th ACSC2006, Jan. 2006, pp. 85-94.

[4] L. Ding, P. Kolari, S. Ganjugunte, T. Finin, A. Joshi, "Modeling and Evaluating Trust Network Inference," In Proc. of 7th AAMASÂ’2004, July 2004, pp. 21-32.

[5] P. Massa, P. Avesani, "Controversial users demand local trust metrics: an experimental study on community," in Proc. of 20th national conference on Artificial intelligence -Vol.1, 2005, pp. 121-126.

[6] L. Page, S. Brin, R. Motwani, T. Winograd, "The PageRank Citation Ranking: Bringing Order to the Web," Stanford InfoLab Technical Report, SIDL-WP-1999-0120, 1999.

[7] S. D. Kamvar, M. T. Schlosser, H. Garcia-Molina, "The Eigentrust algorithm for reputation management in P2P networks," in Proc. of the 12th international conference on World Wide Web, 2003, pp. 640-651.
[CrossRef] [SCOPUS Times Cited 2487]

[8] O. Savas, G. Jin, J. Deng, "Trust management in cloud-integrated Wireless Sensor Networks," In. Proc. of CTS 2013, 2013, pp.334-341.
[CrossRef] [SCOPUS Times Cited 12]

[9] J. Lopez, R. Roman, I. Agudo, C. Fernandez-Gago, "Trust management systems for wireless sensor networks: Best practices," Computer Communications, Vol. 33, No. 9, pp. 1086-1093, 2010.
[CrossRef] [Web of Science Times Cited 119] [SCOPUS Times Cited 182]

[10] A. Josang, V. A. Bondi, "Legal Reasoning with Subjective Logic," Artificial Intelligence and Law, Vol. 8, No. 4, pp. 289-315, 2000.
[CrossRef] [SCOPUS Times Cited 23]

[11] A. Josang, D. McAnally, "Multiplication and Comultiplication of Beliefs," International Journal of Approximate Reasoning, Vol. 38, No. 1, pp. 19-51, 2004.
[CrossRef] [Web of Science Times Cited 31] [SCOPUS Times Cited 59]

[12] U. Maurer, "Modeling a Public-Key Infrastructure," in Proc. of ESORICS-LNCS Vol. 1136, 1996, pp. 325-350.

[13] A. Gutscher, "A Trust Model for an Open, Decentralized Reputation System," in Proc. IFIPTM, 2007, pp. 285-300.
[CrossRef] [SCOPUS Times Cited 23]

[14] T. Sun, M. K. Denko, "A Distributed Trust Management Scheme in the Pervasive Computing Environment," in Proc. of CCECE 2007., April 2007, pp. 1219-1222,
[CrossRef] [SCOPUS Times Cited 16]

[15] K. Sentz, S. Ferson, "Combination of Evidence in Dempster-Shafer Theory," SANDIA Tech. Report, SAND2002-0835, 2002.

[16] A. Gutscher, J. Heesen and O. Siemoneit, "Possibilities and Limitations of Modeling Trust and Reputation," in Proc. CEUR Workshop, 2008.

[17] K. Nordheimer, T. Schulze, D. Veit., "Trustworthiness in Networks: A Simulation Approach for Approx. Local Trust and Distrust Values," in Proc. of IFIP AICT, 2010, pp.157-171.
[CrossRef] [SCOPUS Times Cited 14]

[18] T. Bhuiyan, A. Josang, Y. Xu, "An analysis of trust transitivity taking base rate into account," in Proc. of Ubiquitous, Autonomic and Trusted Computing, 2009, pp. 34-39.

[19] P. Flocchini, F. L. Luccio, "Routing in Series Parallel Networks," Theory of Computing Systems, Vol. 36, pp. 137-157, 2003.
[CrossRef] [Web of Science Times Cited 6] [SCOPUS Times Cited 9]

[20] C. T. Kelly, "Iterative Methods for Optimization (Frontiers in Applied Mathematics)," pp. 135-136, Society for Industrial and Applied Mathematics, 1st edition, Jan. 1987.

[21] D. F. Shanno, "Conditioning of quasi-Newton methods for function minimization," Mathematics of Computation, vol. 24, no. 111, pp. 647-657, 1970.

[22] R. Fletcher, C. M. Reeves, "Function minimization by conjugate gradients," Computer Journal, vol. 7, no. 2, pp. 148-154, 1964.

[23] R. H. Byrd, P. Lu, J. Nocedal, C. Zhu, "A Limited Memory Algorithm for Bound Constrained Optimization," SIAM Journal on Scientific Computing, vol. 16, no. 5, pp. 1190-1208, 1995.
[CrossRef] [Web of Science Times Cited 2307]

[24] A. R. Conn, K. Scheinberg, L. N. Vicente, "Introduction to Derivative-Free Optimization (Mps-Siam Series on Optimization)," pp. 113-120, Society for Industrial and Applied Mathematics, 1st edition, Jan. 2009.

References Weight

Web of Science® Citations for all references: 2,463 TCR
SCOPUS® Citations for all references: 3,017 TCR

Web of Science® Average Citations per reference: 99 ACR
SCOPUS® Average Citations per reference: 121 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2020-08-05 01:12 in 85 seconds.

Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2020
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania

All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.

Website loading speed and performance optimization powered by: