In contrast to traditional mechanism design, the posted pricing mechanism can quickly determine the winning user and ensure the revenue of the seller through a predetermined price. Additionally, the posted pricing mechanism inherently possesses economic properties such as truthfulness and individual rationality. These properties make it an ideal method for solving online task allocation problems for mobile crowdsensing services (MCSs). The challenge in posted pricing mechanism design is being able to find reasonable posted prices under complex MCS task constraints. This paper presents an innovative posted pricing mechanism to solve a general point of interest (POI)-based online MCS task allocation problem. We transform the problem into an integer programming model with the goal of maximizing the total utility of the system while satisfying various constraints. We prove that under any user arrival order, there must exist a posted price structure that can ensure that the total utility of the system is approximately optimal, with an approximation ratio of$1/(d+1)$in the worst case. With the support of theoretical analysis, the posted price calculation can be completed using only a simple gradient descent algorithm. Compared with existing methods, our solution achieves very good results in terms of total utility and the task completion ratio, indicating that it can effectively improve the efficiency and service quality of MCSs.

Aspect-Oriented Programming (AOP) is a programming paradigm that implements crosscutting concerns in a modular way. People have witnessed the prosperity of AOP languages for Java and C++, such as AspectJ and AspectC++, which has propelled AOP to become an important programming paradigm with many interesting application scenarios, e.g., runtime verification. In contrast, the AOP languages for C are still poor and lack compiler support. In this paper, we design a new general-purpose and expressive aspect-oriented C programming language, namely Aclang, and implement a compiler for it, which brings fully-fledged AOP support into the C domain. We have evaluated the effectiveness and performance of our compiler against two state-of-the-art tools, ACC and AspectC++. In terms of effectiveness, Aclang outperforms ACC and AspectC++. In terms of performance, Aclang outperforms ACC in execution time and outperforms AspectC++ in both execution time and memory consumption.

Many runtime verification tools are built based on Aspect-Oriented Programming (AOP) tools, most often AspectJ, a mature implementation of AOP for Java. Although already popular in the Java domain, there is few work on runtime verification of C programs via AOP, due to the lack of a solid language and tool support. In this paper, we propose a new general purpose and expressive language for defining monitors as an extension to the C language, and present our tool implementation of the weaver, the Movec compiler, which brings fully-fledged parametric runtime verification support into the C domain. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.