Edge-cloud collaboration fully utilizes the advantages of sufficient computing resources in cloud computing and the low latency of edge computing and better meets the needs of various Internet of Things (IoT) application scenarios. An important research challenge for edge-cloud collaboration is how to offload tasks to edge and cloud quickly and efficiently, taking into account different task characteristics, resource capabilities, and optimization objectives. To address the above challenge, we propose a fast and efficient task offloading approach in edge-cloud collaboration systems that can achieve a near-optimal solution with a low time overhead. First, it proposes an edge-cloud collaborative task offloading model that aims to minimize time delay and resource cost while ensuring the reliability requirements of the tasks. Then, it designs a novel Preprocessing-Based Task Offloading (PBTO) algorithm to quickly obtain a near-optimal solution to the Task Offloading problem in Edge-cloud Collaboration (TOEC) systems. Finally, we conducted extended simulation experiments to compare the proposed PBTO algorithm with the optimal method and two heuristic methods. The experimental results show that the total execution time of the proposed PBTO algorithm is reduced by 87.23%, while the total cost is increased by only 0.0004% compared to the optimal method. The two heuristics, although better than PBTO in terms of execution time, have much lower solution quality, e.g., their total costs are increased by 69.27% and 85.54%, respectively, compared to the optimal method.
As an important improvement to naive Bayes, Tree-Augmented Naive Bayes (TAN) exhibits excellent classification performance and efficiency since it allows that every attribute depends on at most one other attribute in addition to the class variable. However, its performance might be lowered as some attributes might be redundant. In this paper, we propose an attribute Selective Tree-Augmented Naive Bayes (STAN) algorithm which builds a sequence of approximate models each involving only the top certain attributes and searches the model to minimize the cross validation risk. Five different approaches to ranking the attributes have been explored. As the models can be evaluated simultaneously in one pass learning through the data, it is efficient and can avoid local optima in the model space. The extensive experiments on 70 UCI data sets demonstrated that STAN achieves superior performance while maintaining the efficiency and simplicity.
1 August 2021 in Journal of Combinatorial Theory, Series A
To meet the rapidly increasing demand for Internet of Things (IoT) applications, edge computing, as a novel computing paradigm, can combine devices at the edge of the network to collaboratively provide computing resources for IoT applications. However, the dynamic, heterogeneous, distributed, and resource-constrained nature of the edge computing paradigm also brings some problems, such as more serious privacy leakages and performance bottlenecks. Therefore, how to ensure that the resource requirements of the application are satisfied, while enhancing the protection of user privacy as much as possible, is a challenge for the task assignment of IoT applications. Aiming to address this challenge, we propose a privacy-aware IoT task assignment approach at the edge of the network. Firstly, we model the resource and privacy requirements for IoT applications and evaluate the resource satisfaction and privacy compatibility between edge devices and tasks. Secondly, we formulate the problem of privacy-aware IoT task assignment on edge devices (PITAE) and develop two solutions to the PITAE problem based on the greedy search algorithm and the Kuhn–Munkres (KM) algorithm. Finally, we conduct a series of simulation experiments to evaluate the proposed approach. The experimental results show that the PITAE problem can be solved effectively and efficiently.
In recent years, residents in various regions transfer their jobs increasingly frequently, job transfer involving migrating between cities is no longer novelty. Job transfer involving migrating between cities might bring economic problems, especially when those who have estate implement job transfer. How to relieve negative impact with which job transfer involving migrating between cities brings economic is non-ignorable problem. This paper points out that this problem is mainly inflation and proposes a solution containing seeking for the shortest path. The essence of the shortest path is that inflation caused by job transfer involving migrating between cities is overcome with the biggest reliability.
The popularity of cloud computing has fueled the growth in multiprovision cloud service composition (MPCSC), where each cloud service provider (CSP) can fulfill multiple tasks, i.e., offer multiple services, simultaneously. In the MPCSC, users would rather disclose some private data for more benefits (e.g., personalized services). However, the more private data is released, the more serious the privacy risk faced by users. In particular, the multiservice provision characteristic of MPCSC further exacerbates the privacy risk. Therefore, how to balance the privacy risk and benefit in service selection for MPCSC is a challenging research problem. In this paper, firstly we explore the service selection problem of balancing privacy risk and benefit in MPCSC (SSBM), then we propose an improved Kuhn–Munkres (KM) algorithm solution to the SSBM problem. Furthermore, we conduct a series of simulation experiments to evaluate the proposed approach. The experimental results show that the proposed approach is both efficient and effective for solving the SSBM problem.