Evaluating Remote Task Assignment of an Online Engineering Module through Data Mining in a Virtual Communication Platform Environment

E-learning has traditionally emphasised educational resources, web access, student participation, and social interaction. Novel virtual spaces, e-lectures, and digital laboratories have been developed with synchronous or asynchronous practices throughout the migration from face-to-face teaching modes to remote teaching during the pandemic restrictions. This research paper presents a case study concerning the evaluation of the online task assignment of students, using MS Teams as an electronic platform. MS Teams was evaluated to determine whether this communication platform for online lecture delivery and tasks’ assessments could be used to avoid potential problems caused during the teaching process. Students’ data were collected, and after filtering out significant information from the online questionnaires, a statistical analysis, containing a correlation and a reliability analysis, was conducted. The substantial impact of 37 variables was revealed. Cronbach’s alpha coefficient calculation revealed that 89% of the survey questions represented internally consistent and reliable variables, and for the sampling adequacy measure, Bartlett’s test was calculated at 0.816. On the basis of students’ diligence, interaction abilities, and knowledge embedding, two groups of learners were differentiated. The findings of this study shed light on the special features of fully online teaching specifically in terms of improving assessment through digital tools and merit further investigation in virtual and blended teaching spaces, with the goal of extracting outputs that will benefit the educational community.

Task Assignment and Personality

An open call format of crowdsourcing software development (CSD) is harnessing potential, diverse, and unlimited people. But, several thousand solutions are being submitted at platform against each call. To select and match the submitted task with the appropriate worker and vice versa is still a complicated problem. Focusing the issue, this study proposes a task assignment algorithm (TAA) that will behave as an intermediate facilitator (at platform) between task (from requester) and solution (from worker). The algorithm will divide the tasks' list based on the developer's personality. In this way, we can save the time of both developers and platform by reducing the searching time.

A Privacy-Preserving Incentive Mechanism for Data Offloading in Satellite-Terrestrial Crowdsensing

Data offloading algorithm is the foundation of urban Internet of Things, which has gained attention for its large size of user engagement, low cost, and wide range of data sources, replacing traditional crowdsensing in areas such as intelligent vehicles, spectrum sensing, and environmental surveillance. In data offloading tasks, users’ location information is usually required for optimal task assignment, while some users in remote areas are unable to access base station signals, making them incapable of performing sensing tasks, and at the same time, there are serious concerns about users’ privacy leakage about their locations. Until today, location protection for task assignment in data offloading has not been well explored. In addition, existing privacy protection algorithms and data offloading task assignment mechanisms cannot provide personalized protection for different users’ privacy protection needs. To this end, we propose an algorithm known as differential private long-term privacy-preserving auction with Lyapunov stochastic theory (DP-LAL) for data offloading based on satellite-terrestrial architecture that minimizes the total payment. This not only gives an approximate optimal total payment in polynomial time but also improves the issue of poor signal in remote areas. Meanwhile, satellite-terrestrial data offloading architecture integrates wireless sensor networks and cloud computing to provide real-time data processing. What is more, we have considered long-term privacy protection goals. We employ reverse combinatorial auction and Lyapunov optimization theorem to jointly optimize queue stability and total payment. More importantly, we use Lyapunov optimization theorem to jointly optimize queue stability and total payment. We prove that our algorithm is of high efficiency in computing and has good performance in various economic attributes. For example, our algorithms are personally rational, budget-balanced, and true to the buyer and seller. We use large-scale simulations to evaluate the proposed algorithm, and compare our algorithm with existing algorithms, our algorithm shows higher efficiency and better economic properties.

Research on collaborative task assignment method of assembly line

Purpose The purpose of this paper is to construct a task assignment model for U-shaped production lines with collaborative task, which is optimized by minimizing the number of workers and balancing the workload of the operators. The ultimate goal is to increase productivity by increasing the U-line balance and balancing the load on the operators. Design/methodology/approach First, task selection and update mechanism are analyzed and the task selection mechanism suitable for collaborative task is proposed. Second, M-COMOSAL is obtained by improving the original COMOSAL. Finally, The M-COMOSAL algorithm and the COMAOSAL algorithm are used to perform job assignment on the double-acting clutch U-shaped assembly line. Findings According to the allocation scheme obtained by M-COMSOAL, the beat can be adjusted according to the change of order demand. The final allocation scheme is superior to the COMSOAL algorithm in terms of number of workers, working time, production tempo and balance rate. In particular, compared with the old scheme, the new scheme showed a decrease of 16.7% in the number of employees and a 18.8% increase in the production line balance rate. Thus, the method is helpful to reduce the number of operators and balance the workload. Originality/value The new algorithm proposed in this paper for the assignment of collaborative task can minimize the number of workers and balance the load of operators, which is of great significance for improving the balance rate of U-shaped production lines and the utilization of personnel or equipment.