The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Study on Secure Dynamic Covering Algorithm for E-Logistics Information in a Cloud Computing Platform
Abstract
For traditional coverage method, local adaptive weighted search is adopted for subspace reconstruction of e-logistics information, which requires significant iterative computations and leads to large coverage errors and unsatisfactory results. This paper proposes a secure dynamic covering algorithm for e-logistics information based on the basis of directional clustering for the envelope of optimization solution vectors. A data network distribution model of e-logistics information on a cloud computing platform is constructed to extract features of e-logistics information and to construct time series of information flows. The directional clustering algorithm for the envelope of optimization solution vectors is introduced to schedule features of e-logistics information. The experimental results show that the proposed algorithm has higher coverage rate, smaller error, and increases performance of e-logistics information transmission and higher application value on a cloud computing platform.
Related Content
|
Sushruta Mishra, Sunil Kumar Mohapatra, Brojo Kishore Mishra, Soumya Sahoo.
© 2021.
24 pages.
|
|
Carlos Santos, Helena Inácio, Rui Pedro Marques.
© 2021.
16 pages.
|
|
Akash Chowdhury, Swastik Mukherjee, Sourav Banerjee.
© 2021.
26 pages.
|
|
Stojan Kitanov, Toni Janevski.
© 2021.
28 pages.
|
|
Ramesh C. Poonia, Linesh Raja.
© 2021.
27 pages.
|
|
Jens Kohler, Thomas Specht.
© 2021.
27 pages.
|
|
Jagdish Chandra Patni.
© 2021.
15 pages.
|
|
|