Cloud workloads are highly dynamic and complex, making task scheduling in cloud computing a challenging problem. While several algorithms have been proposed recent years, they mainly designed to handle batch tasks not well-suited for real-time workloads. To address this issue, researchers started exploring the use of Deep Reinforcement Learning (DRL). However, existing models limited handling independent cannot process workflows, which prevalent consist related subtasks. In paper, we propose...

With some specific characteristics such as elastics and scalability, cloud computing has become the most promising technology for online business nowadays. However, how to efficiently perform real-time job scheduling in still poses significant challenges. The reason is that those jobs are highly dynamic complex, it always hard allocate them resources an optimal way, meet requirements from both service providers users. In recent years, various works demonstrate deep reinforcement learning...

Code clone detection is to find out code fragments with similar functionalities, which has been more and important in software engineering. Many approaches have proposed detect clones, token-based methods are the most scalable but cannot handle semantic clones because of lack consideration program semantics. To address issue, researchers conduct analysis distill semantics into a graph representation by matching graphs. However, such suffer from low scalability since typically time-consuming.

Wolf Pack Algorithm (WPA) is a swarm intelligence algorithm that simulates the food searching process of wolves. It widely used in various engineering optimization problems due to its global convergence and computational robustness. However, has some weaknesses such as low speed easily falling into local optimum. To tackle problems, we introduce an improved approach called OGL-WPA this work, based on employments Opposition-based learning Genetic with Levy's flight. Specifically, OGL-WPA,...

To address the defects of salp swarm algorithm (SSA) such as slow convergence speed and ease falling into a local minimum, new combining chaotic mapping decay factor is proposed combined with back propagation (BP) neural network to achieve an effective prediction tool wear. Firstly, used enhance formation population, which facilitates iterative search reduces trapping in optimum; secondly, introduced improve update followers so that can be updated adaptively iterations, theoretical analysis...

Due to their important applications in theory and practice, linear complementary dual (LCD) codes self-orthogonal have received much attention the last decade. The objective of this paper is extend a recent construction binary LCD general $ p $-ary case, where an odd prime. Based on extended construction, several classes are obtained. characterizations these be or derived. duals also studied. It turns out that proposed optimal many cases sense parameters meet certain bounds codes. weight...

How to construct asymptotically good codes is one of the hottest topic in modern coding theory. In this paper, we concatenated an extended primitive BCH outer code with a class binary inner constructed by interleaved get codes. It shown that Weldon [1] its special case.

Cyclic codes are a subclass of linear and have applications in consumer electronics, data storage systems, communication systems as they efficient encoding decoding algorithms. In this letter, class four-weight binary cyclic presented. Their weight distributions these also settled.

We study stochastic convex optimization subjected to linear equality constraints. Traditional Stochastic Alternating Direction Method of Multipliers and its Nesterov's acceleration scheme can only achieve ergodic O(1/\sqrt{K}) convergence rates, where K is the number iteration. By introducing Variance Reduction (VR) techniques, rates improve O(1/K). In this paper, we propose a new ADMM which elaborately integrates extrapolation VR techniques. prove that our algorithm non-ergodic O(1/K) rate...

Cyclic codes are a subclass of linear and have applications in consumer electronics, data storage systems, communication systems as they efficient encoding decoding algorithms compared with the block codes. The objective this letter is to present family p-ary cyclic length $\frac{p^m-1}{p-1}$ dimension $\frac{p^m-1}{p-1}-2m$, where p an arbitrary odd prime m positive integer gcd(p-1,m)=1. minimal distance d proposed shown be 4≤d≤5 which at least almost optimal respect some upper bounds on code.

Studying about the method of mixed urban road network design problems is considerable practical importance for engineering practice transportation planning. The problem deals with both how to add new links and increase capacity some existing using a quantitative analysis method. objective make an optimal investment decision in order minimize total travel cost network, while accounting route choice behaviors users. In this paper, bi-level programming model presented. And algorithm has been...

Constant composition codes (CCCs) are a special class of constant-weight codes. They include permutation as subclass. The study and constructions CCCs with parameters meeting certain bounds have been an interesting research subject in coding theory. A bridge from zero difference balanced (ZDB) functions to the Luo-Fu-Vinck-Chen bound has established by Ding (IEEE Trans. Information Theory 54(12) (2008) 5766-5770). This provides new approach for obtaining optimal CCCs. objective this letter...

In this paper, the subsurface flow wetland sewage treatment mathematical model is studied. analytical solution obtained by using Laplace transform technique for non-steady and diffusion characteristics some parameters used in are analyzed. Then which added source on two boundary conditions adomian decomposition method. The examples given compare approximate exact solutions.

A numeric method of solving nonlinear equation group is proposed. The problem equivalently changed to the function optimization, and then a solution obtained by adaptive genetic algorithm, considering it as initial Levenberg-Marquardt more accurate can be obtained, result, time efficiency improved.

Local codes are a special kind of error-correcting codes. Locally correctable (LCCs) one type local LCCs can efficiently recover any coordinate its corrupted encoding by probing only few but not all fraction the word. A q-ary LCC which encodes length k messages to N codewords with relative distance Δ has three parameters: r, δ and ε. r is called query complexity recording number queries. tolerance measuring between be locally decoded. ε error probability showing fail recovered at most One...

This study presents an enhanced version of the mayfly method in order to address its deficiencies, such as insufficient population variety and slow convergence time. First, initialization phase, tent mapping is introduced increase diversity so that initial evenly distributed search space. Second, reverse learning mechanism update population, algorithm based on mapping. Diversity facilitates subsequent iterative optimization algorithm. Then, attenuation factor position individual individual's...