Search

Mobile edge computing (MEC) paves the way to alleviate the burden of energy and computation of mobile users (MUs) by offloading tasks to the network edge. To enhance the MEC server utilization by optimizing its resource allocation, a well-designed pricing strategy is indispensable. In this paper, we consider the edge offloading scenario with energy harvesting devices, and propose a dynamic differential pricing system (DDPS), which determines the price per unit time according to the usage of computing resources to improve the edge server utilization. Firstly, we propose an offloading decision algorithm to decide whether to conduct the offloading operation and how much data to be offloaded if conducted, the algorithm determines offloading operation by balancing the energy harvested with the energy consumed. Secondly, for the offloading case, we formulate the game between the MUs and the server as a Stackelberg game, and propose a differential pricing algorithm to determine the optimal computing resources required by MUs. Furthermore, the proposed algorithm also reallocates computing resources for delay-sensitive devices while server resources are surplus after the initial allocation, aiming to make full use of the server computing resources. Extensive simulations are conducted to demonstrate the effectiveness of the proposed DDPS scheme.

Task offloading in Internet of Vehicles (IoV) involves numerous steps and optimization variables such as: where to offload tasks, how to allocate computation resources, how to adjust offloading ratio and transmit power for offloading, and such optimization variables and hybrid combination features are highly coupled with each other. Thus, this is a fully challenge issue to optimize these variables for task offloading to sustainably reduce energy consumption with load balancing while ensuring that a task is completed before its deadline. In this paper, we first provide a Mixed Integer Nonlinear Programming Problem (MINLP) formulation for such task offloading under energy and deadline constraints in IoV. Furthermore, in order to efficiently solve the formulated MINLP, we decompose it into two subproblems, and design a low-complexity Joint Optimization for Energy Consumption and Task Processing Delay (JOET) algorithm to optimize selection decisions, resource allocation, offloading ratio and transmit power adjustment. We carry out extensive simulation experiments to validate JOET. Simulation results demonstrate that JOET outperforms many representative existing approaches in quickly converge and effectively reduce energy consumption and delay. Specifically, average energy consumption and task processing delay have been reduced by 15.93% and 15.78%, respectively, and load balancing efficiency has increased by 10.20%.

With the increasing development of garment manufacturing industry, the method of combining neural network with industry to reduce product redundancy has been paid more and more attention.In order to reduce garment redundancy and achieve personalized customization, more researchers have appeared in the field of virtual trying on.They try to transfer the target clothing to the reference figure, and then stylize the clothes to meet user's requirements for fashion.But the biggest problem of virtual try on is that the shape and motion blocking distort the clothes, causing the patterns and texture on the clothes to be impossible to restore. This paper proposed a new stylized virtual try on network, which can not only retain the authenticity of clothing texture and pattern, but also obtain the undifferentiated stylized try on. The network is divided into three sub-networks, the first is the user image, the front of the target clothing image, the semantic segmentation image and the posture heat map to generate a more detailed human parsing map. Second, UV position map and dense correspondence are used to map patterns and textures to the deformed silhouettes in real time, so that they can be retained in real time, and the rationality of spatial structure can be guaranteed on the basis of improving the authenticity of images. Third,Stylize and adjust the generated virtual try on image. Through the most subtle changes, users can choose the texture, color and style of clothing to improve the user's experience., Comment: 10 pages,9 figures

At present, SOILD-STATE Fermentation (SSF) is mainly controlled by artificial experience, and the product quality and yield are not stable. Accurately predicting the quality and yield of SSF is of great significance for improving human food security and supply. In this paper, we propose an Intelligent Utility Prediction (IUP) scheme for SSF in 5G Industrial Internet of Things (IoT), including parameter collection and utility prediction of SSF process. This IUP scheme is based on the environmental perception and intelligent learning algorithms of the 5G Industrial IoT. We build a workflow model based on rewritable petri net to verify the correctness of the system model function and process. In addition, we design a utility prediction model for SSF based on the Generative Adversarial Networks (GAN) and Fully Connected Neural Network (FCNN). We design a GAN with constraint of mean square error (MSE-GAN) to solve the problem of few-shot learning of SSF, and then combine with the FCNN to realize the utility prediction (usually use the alcohol) of SSF. Based on the production of liquor in laboratory, the experiments show that the proposed method is more accurate than the other prediction methods in the utility prediction of SSF, and provide the basis for the numerical analysis of the proportion of preconfigured raw materials and the appropriate setting of cellar temperature.

The popularity of cyber-physical systems is fueling the rapid growth of location-based services. This poses the risk of location privacy disclosure. Effective privacy preservation is foremost for various mobile applications. Recently, geo-indistinguishability and expected inference error are proposed for limiting location leakages. In this paper, we argue that personalization means regionalization for geo-indistinguishability, and we propose a regionalized location obfuscation mechanism called DPIVE with personalized utility sensitivities. This substantially corrects the differential and distortion privacy problem of PIVE framework proposed by Yu et al. on NDSS 2017. We develop DPIVE with two phases. In Phase I, we determine disjoint sets by partitioning all possible positions such that different locations in the same set share the Protection Location Set (PLS). In Phase II, we construct a probability distribution matrix in which the rows corresponding to the same PLS have their own sensitivity of utility (PLS diameter). Moreover, by designing QK-means algorithm for more search space in 2-D space, we improve DPIVE with refined location partition and present fine-grained personalization, enabling each location to have its own privacy level endowed with a customized privacy budget. Experiments with two public datasets demonstrate that our mechanisms have the superior performance, typically on skewed locations., Comment: 26 pages, 15 figures

Linear Regression (LR) is a classical machine learning algorithm which has many applications in the cyber physical social systems (CPSS) to shape and simplify the way we live, work and communicate. This paper focuses on the data analysis for CPSS when the Linear Regression is applied. The training process of LR is time-consuming since it involves complex matrix operations, especially when it gets a large scale training dataset In the CPSS. Thus, how to enable devices to efficiently perform the training process of the Linear Regression is of significant importance. To address this issue, in this paper, we present a secure, verifiable and fair approach to outsource LR to an untrustworthy cloud-server. In the proposed scheme, computation inputs/outputs are obscured so that the privacy of sensitive information is protected against cloud-server. Meanwhile, computation result from cloud-server is verifiable. Also, fairness is guaranteed by the blockchain, which ensures that the cloud gets paid only if he correctly performed the outsourced workload. Based on the presented approach, we exploited the fair, secure outsourcing system on the Ethereum blockchain. We analysed our presented scheme on theoretical and experimental, all of which indicate that the presented scheme is valid, secure and efficient.

Negation operation is important in intelligent information processing. Different with existing arithmetic negation, an exponential negation is presented in this paper. The new negation can be seen as a kind of geometry negation. Some basic properties of the proposed negation is investigated, we find that the fix point is the uniform probability distribution. The negation is an entropy increase operation and all the probability distributions will converge to the uniform distribution after multiple negation iterations. The number of iterations of convergence is inversely proportional to the number of elements in the distribution. Some numerical examples are used to illustrate the efficiency of the proposed negation., Comment: 17 pages, 6 figures

This work studied embedding positions of digital audio watermarking in wavelet domain, to make beginners understand the nature of watermarking in a short time. Based on the theory of wavelet transform, this paper analyzed statistical distributions of each level after transformation and the features of watermark embedded in different transform levels. Through comparison and analysis, we found that watermark was suitable for embedding into the coefficients of the first four levels of wavelet transform. In current state-of-art approaches, the embedding algorithms were always to replace the coefficient values of the embedded positions. In contrast this paper proposed an embedding algorithm of selfadaptive interpolation to achieve a better imperceptibility. In order to reduce the computational complexity, we took a pseudo random sequence with a length of 31 bits as the watermark. In the experiments, watermark was embedded in different locations, including different transform levels, high-frequency coefficients and low-frequency coefficients, high-energy regions and low-frequency regions. Results showed that the imperceptibility was better than traditional embedding algorithms. The bit error rates of the extracted watermark were calculated and we analyzed the robustness and fragility of each embedded signal. At last we concluded the best embedding positions of watermark for different applications and our future work.

The rapid development of cloud computing has probably benefited each of us. However, the privacy risks brought by untrustworthy cloud servers arise the attention of more and more people and legislatures. In the last two decades, plenty of works seek to outsource various specific tasks while ensuring the security of private data. The tasks to be outsourced are countless; however, the computations involved are similar. In this paper, we construct a series of novel protocols that support the secure computation of various functions on numbers (e.g., the basic elementary functions) and matrices (e.g., the calculation of eigenvectors and eigenvalues) in arbitrary $n\geq 2$ servers. All protocols only require constant rounds of interactions and achieve the low computation complexity. Moreover, the proposed $n$-party protocols ensure the security of private data even though $n-1$ servers collude. The convolutional neural network models are utilized as the case studies to verify the protocols. The theoretical analysis and experimental results demonstrate the correctness, efficiency, and security of the proposed protocols., Comment: This paper has been accepted by IEEE Transactions on computers

As one of the important applications of Smart grid, charging between electric vehicles has attracted much attention. However, authentication between vehicle users and an aggregator may be vulnerable to various attacks due to the usage of wireless communications. In order to reduce the computational costs yet preserve required security, the Chebyshev chaotic map based authentication schemes are proposed. However, the security requirements of Chebyshev polynomials bring a new challenge to the design of authentication schemes based on Chebyshev chaotic maps. To solve this issue, we propose a practical Chebyshev polynomial algorithm by using a binary exponentiation algorithm based on square matrix to achieve secure and efficient Chebyshev polynomial computation. We further apply the proposed algorithm to construct an energy-efficient authentication and key agreement scheme for smart grid environments. Compared with state-of-the-art schemes, the proposed authentication scheme effectively reduces the computational costs and communication costs by adopting the proposed Chebyshev polynomial algorithm. Furthermore, the ProVerif tool is employed to analyze the security of the proposed authentication scheme. Our experimental results justified that our proposed authentication scheme can outperform state-of-the-art schemes in terms of the computational overhead while achieving privacy protection., Comment: 10 pages, 7 figures

Inverse Distance Weighted models (IDW) have been widely used for predicting and modeling multidimensional space in multimodal industrial processes. However, the more complex the structure of multidimensional space, the lower the performance of IDW models, and real industrial datasets tend to have more complex spatial structure. To solve this problem, a new framework for spatial prediction and modeling based on deep reinforcement learning network is proposed. In the proposed framework, the internal relationship between state and action is enhanced by reusing the state values in the Q network, and the convergence rate and stability of the deep reinforcement learning network are improved. The improved deep reinforcement learning network is then used to search for and learn the hyperparameters of each sample point in the inverse distance weighted model. These hyperparameters can reflect the spatial structure of the current industrial dataset to some extent. Then a spatial distribution of hyperparameters is constructed based on the learned hyperparameters. Each interpolation point obtains corresponding hyperparameters from the hyperparametric spatial distribution and brings them into the classical IDW models for prediction, thus achieving differential spatial prediction and modeling. The simulation results show that the proposed framework is suitable for real industrial datasets with complex spatial structure characteristics and is more accurate than current IDW models in spatial prediction.

With the expansion of the software scale and complexity of smart grid systems, the detection of smart grid software defects has become a research hotspot. Because of the large scale of the existing smart grid software code, the efficiency and accuracy of the existing smart grid defect detection algorithms are not high. We propose an intelligent memory leak detection scheme based on defect modes MLD in smart grid. Based on the analysis of existing memory leak defect modes, we summarize memory operation behaviors (allocation, release and transfer) and present a state machine model. We employ a fuzzy matching algorithm based on regular expression to determine the memory operation behaviors and then analyze the change in the state machine to assess the vulnerability in the source code. To improve the efficiency of detection and solve the problem of repeated detection at the function call point, we propose a function summary method for memory operation behaviors. The experimental results demonstrate that the method we proposed has high detection speed and accuracy. The algorithm we proposed can identify the defects of the smart grid operation software and ensure the safe operation of the grid., Comment: 12 pages, 16 figures

Incremental learning is a form of online learning. Incremental learning can modify the parameters and structure of the deep learning model so that the model does not forget the old knowledge while learning new knowledge. Preventing catastrophic forgetting is the most important task of incremental learning. However, the current incremental learning is often only for one type of input. For example, if the input images are of the same type, the current incremental model can learn new knowledge while not forgetting old knowledge. However, if several categories are added to the input graphics, the current model will not be able to deal with it correctly, and the accuracy will drop significantly. Therefore, this paper proposes a kind of incremental method, which adjusts the parameters of the model by identifying the prototype vector and increasing the distance of the vector, so that the model can learn new knowledge without catastrophic forgetting. Experiments show the effectiveness of our proposed method., Comment: There are inaccuracies in the statement of the article, and we need to withdraw and correct the inaccurate statement

Federate learning can conduct machine learning as well as protect the privacy of self-owned training data on corresponding ends, instead of having to upload to a central trusted data aggregation server. In mobile scenarios, a centralized trusted server may not be existing, and even though it exists, the delay will not be manageable, e.g., smart driving cars. Thus, mobile federate learning at the edge with privacy-awareness is attracted more and more attentions. It then imposes a problem - after data are trained on a mobile terminal to obtain a learned model, how to share the model parameters among others to create more accurate and robust accumulative final model. This kind of model sharing confronts several challenges, e.g., the sharing must be conducted without a third trusted party (autonomously), and the sharing must be fair as model training (by training data)is valuable. To tackle the above challenges, we propose a smart contract and IPFS (Inter-Planetary File System) based model sharing protocol and algorithms to address the challenges. The proposed protocol does not rely on a trusted third party, where individual-learned models are shared/stored in corresponding ends. Conducted through extensive experiments, three main steps of the proposed protocol are evaluated. The average executive time of the three steps are 0.059s, 0.060s and 0.032s, demonstrating its efficiency., Comment: We found that there are some algorithm errors in our scheme, which need to be modified. We need to revise our paper and resubmit it in the future

The importance of contexts has been widely recognized in recommender systems for individuals. However, most existing group recommendation models in Event-Based Social Networks (EBSNs) focus on how to aggregate group members' preferences to form group preferences. In these models, the influence of contexts on groups is considered but simply defined in a manual way, which cannot model the complex and deep interactions between contexts and groups. In this paper, we propose an Attention-based Context-aware Group Event Recommendation model (ACGER) in EBSNs. ACGER models the deep, non-linear influence of contexts on users, groups, and events through multi-layer neural networks. Especially, a novel attention mechanism is designed to enable the influence weights of contexts on users/groups change dynamically with the events concerned. Considering that groups may have completely different behavior patterns from group members, we propose that the preference of a group need to be obtained from indirect and direct perspectives (called indirect preference and direct preference respectively). In order to obtain the indirect preference, we propose a method of aggregating preferences based on attention mechanism. Compared with existing predefined strategies, this method can flexibly adapt the strategy according to the events concerned by the group. In order to obtain the direct preference, we employ neural networks to directly learn it from group-event interactions. Furthermore, to make full use of rich user-event interactions in EBSNs, we integrate the context-aware individual recommendation task into ACGER, which enhances the accuracy of learning of user embeddings and event embeddings. Extensive experiments on two real datasets from Meetup show that our model ACGER significantly outperforms the state-of-the-art models.

As a novel method eliminating chromatic aberration on objects, computational color constancy has becoming a fundamental prerequisite for many computer vision applications. Among algorithms performing this task, the learning-based ones have achieved great success in recent years. However, they fail to fully consider the spatial information of images, leaving plenty of room for improvement of the accuracy of illuminant estimation. In this paper, by exploiting the spatial information of images, we propose a color constancy algorithm called Attention Dense Color Constancy (ADCC) using convolutional neural network (CNN). Specifically, based on the 2D log-chrominance histograms of the input images as well as their specially augmented ones, ADCC estimates the illuminant with a self-attention DenseNet. The augmented images help to tell apart the edge gradients, edge pixels and non-edge ones in log-histogram, which contribute significantly to the feature extraction and color-ambiguity elimination, thereby advancing the accuracy of illuminant estimation. Simulations and experiments on benchmark datasets demonstrate that the proposed algorithm is effective for illuminant estimation compared to the state-of-the-art methods. Thus, ADCC offers great potential in promoting applications of smart cities, such as smart camera, where color is an important factor for distinguishing objects., Comment: 8 figures and 2 tables