Search

Summary: Multi‐user multiple‐input multiple‐output (MU‐MIMO) system has the capability of delivering optimal system capacity that provides the simultaneous service to a large number of users using dirty paper coding (DPC) scheme. However, the DPC scheme is quite difficult to be implemented in the real‐time scenario as the computational complexity is very high and the process cannot be accomplished within the duration of few coherence periods. In this paper, we have adopted a newly developed binary spider monkey optimization (binary SMO) algorithm for the joint user and antenna scheduling (JUAS) problem to maximize the achievable system sum‐rate performance. It has been shown that JUAS with binary SMO achieves nearly 99% of system throughput achieved by the extensive search algorithm (ESA) using DPC. Also it is compared with binary flower pollination algorithm (binary FPA) to check which of the two gives better result. It is observed that the binary SMO in JUAS achieves a globally optimal solution quite rapidly, to remain well within the modern‐day packet data communication interval. The proposed binary SMO shows low computational complexity and computation time as compared to ESA (i.e., DPC). Also when it is compared with binary FPA, it shows quite a significant improvement in system throughput. Moreover, the effectiveness of binary SMO in the MU‐MIMO broadcasting scenario is verified through extensive simulation results. [ABSTRACT FROM AUTHOR]

One of the useful knowledge representation tools, which can describe the joint probability distribution between some random variables with a graphical model and can be trained by a dataset, is the Bayesian network (BN). A BN is composed of a network structure and a conditional probability distribution table for each node. Discovering an optimal BN structure is an NP‐hard optimization problem that various meta‐heuristic algorithms are applied to solve this problem by researchers. The genetic algorithms, ant colony optimization, evolutionary programming, artificial bee colony, and bacterial foraging optimization are some of the meta‐heuristic methods to solve this problem using a dataset. Most of these methods are applying a scoring metric to generate the best network structure from a set of candidates. A Fixed Structure Learning Automata‐Based (FSLA‐B) algorithm is presented in this paper to solve the structure learning problem of BNs. There is a fixed structure learning automaton for each pair of vertices in the BN's graph structure in the proposed algorithm. The action of this automaton determines the presence and direction of an edge between the vertices. The proposed algorithm performs a guided search procedure using the FSLA and escapes from local optimums. Several datasets are utilised in this paper to evaluate the performance of the proposed algorithm. By performing various experiments, multiple meta‐heuristic algorithms are compared with the introduced new one. The obtained results represented that the proposed algorithm could produce competitive results and find the near‐optimal solution for the BN structure learning problem. [ABSTRACT FROM AUTHOR]

In zone‐based evacuation planning, the region to evacuate is divided into zones, and each zone must be assigned a path to safety and departure times along the path. Zone‐based evacuations are highly desirable in practice because they allow emergency services to communicate evacuation orders and to control the evacuation more precisely. Zone‐based evacuations may also be combined with contraflows (to maximize the network capacities) and may impose additional constraints on the evacuation path (e.g., path convergence) and the departure times (e.g., non‐preemption). This paper synthesizes existing models and algorithms for large‐scale zone‐based evacuation planning and complements them with some new ones to fill some of the gaps in the design space. Each model and algorithm is also extended to accommodate contraflows. A companion paper evaluates them on a real, large‐scale case study, both from a macroscopic standpoint and through microscopic simulations under a variety of assumptions. [ABSTRACT FROM AUTHOR]

This paper considers the queue-aware optimal energy minimisation sparse beamforming design (QESB) in a downlink cloud radio access network (C-RAN) system where multi-RRH communicates with multi-user through a central computing cloud via digital front-haul links. The problem is formulated as the joint optimisation problem of the transmission energy consumption, system queue length and front-haul cost with sparse beamforming design. As we know, the beamforming design adaptive to both QSI and CSI is challenging because of the high complexity. Apart from previous works that take queue length as constraints, in this paper we directly minimise the queue length state involved joint optimisation problem with SINR constraints. A smooth function is proposed to approximate the l0-norm function which is discrete and non-convex. To overcome the challenge due to the non-convexity of the optimisation problem, the semidefinite relaxation (SDR) technology is utilised to convert the primitive problem into the difference of convex (DC) programming problem, and convex and concave procedure (CCP) algorithm is used to induce the sparsity of the beamforming control. The simulation results show that the scheme proposed by this paper can obtain a good tradeoff between system energy consumption, queue length and front-haul cost with SINR constraints in C-RAN system. [ABSTRACT FROM AUTHOR]

To improve the state‐of‐the‐art works in breast cancer diagnosis, this paper proposes ensemble‐based deep‐transfer learning with classifiers namely optimizable K‐nearest neighbors, optimizable naïve Bayes, optimizable ensemble, and optimizable support vector machine algorithms for the auto‐feature extraction, detection, and severity classification of input mammograms. The hyperparameters of these classification algorithms are optimized by using the Bayesian optimization technique. The extracted robust features are normalized and then classified using the Bayesian optimized classifiers. Thus, the work throws a light of research on detecting whether the input mammogram is normal or abnormal. Afterward, it further focuses on the severity classification of abnormalities that is, benign or malignant. The aforesaid algorithms are trained and tested for the three‐class classification problem, thus achieving a maximum performance using the Bayesian optimized SVM algorithm applied with ResNet18 deep features providing classification accuracy of 99.689% for MIAS and 98.883% for INbreast dataset. [ABSTRACT FROM AUTHOR]

Summary: Distributed optimization algorithms have various advantages and wide applications, while the distributed nature also makes them flimsy in the face of external attacks. In this paper two Byzantine attack models are designed, in which the edge attack model is seldom considered before. A resilient distributed consensus algorithm based on the trusted nodes and edges is proposed to defend against the two attack models. The agreement and optimality of the proposed consensus algorithm are guaranteed with theoretical analysis. The simulation results and comparison experiments verify the proposed algorithm to be more effective than the compared one. In the perspective of attackers, which attack model is more recommended is also analysed based on the experiments. [ABSTRACT FROM AUTHOR]

Summary: The novel and optimal phasor measurement unit (PMU) observability has been attained based on the flower pollination algorithm (FPA). The prime objective is to select the optimal bus for placing the PMU to maximize the number of bus observance in the system. Many optimization techniques have been developed with an aim to optimize the PMU's required quantity with attaining full observability of the network. This paper proposes a new technique of modified FPA, which reduces the computation time and achieves greater accuracy. This approach also helps in achieving the maximum observability of power system based on choosing the optimum buses to place the PMUs. The proposed algorithm would be best suited and offers highly accurate results when analyzing the system for maximum observability with the minimum number of allotted PMUs. The FPA algorithm is implemented on standard IEEE 14 bus, IEEE 30 bus, and IEEE 118 bus systems. The proposed FPA algorithm outperforms other evolutionary algorithms. It yields better overall performance than other algorithm methods, in terms of the minimum number of PMUs with maximum observability, including contingency analysis. [ABSTRACT FROM AUTHOR]

In this paper, an optimal collision‐free trajectory is developed based on the hybrid optimization algorithms for industrial robotic manipulators (IRMs). Three IRMs such as PUMA 560 (six degrees of freedom—6DOF), KUKA LBR iiwa 14 R820 (7DOF), and ABB IRB 140 (6DOF) are considered. The key objective is to enhance the smoothness and efficiency of manufacturing robots by optimum joint trajectory design using the seventh‐order polynomial function. The proposed approach is to solve both kinematics and trajectory planning problems by using the different combinations of the hybrid meta‐heuristic algorithms. The kinematic parameters including jerk, acceleration, and velocity mostly impact the travel smoothness of the robot end‐effector on the trajectory path. Therefore, these parameters are to be constrained for generating the collision‐free path. The endurance of velocity and acceleration can be obtained by reducing the jerk which leads to smooth robotic motion. The proposed work is executed using a robotic toolbox in MATLAB with a graphical user interface. The values of acceleration, velocity, and jerk are computed for the robot joints. Each robot obtained the minimum traveling time for without and with an obstacle which is 0.0118 and 0.0313 s for PUMA and 0.0117 and 0.0310 s for KUKA, and 0.0114 and 0.0120 s for ABB IRB 140 robot. From the experimental outcomes, the proposed scheme of the hybrid optimization algorithms is more effective for the trajectory planning of IRMs than that of other works. [ABSTRACT FROM AUTHOR]

Parameter extraction of photovoltaic (PV) models based on measured current–voltage data plays an important role in the control, simulation, and optimization of PV systems. Despite the fact that various parameter extraction strategies have been dedicated to solving this problem, they may have certain drawbacks. In this paper, an effective hybrid optimization method based on adaptive rat swarm optimization (ARSO) and pattern search (PS) is presented for effectively and consistently extracting PV parameters. The proposed method employs the global search ability of ARSO and the local search ability of PS. The performance of the new algorithm is investigated using a set of benchmark test functions, and the results are compared with those of the standard RSO and some other methods from the literature. The extraction of parameters from several PV models, such as single‐diode, double‐diode, and PV modules, confirms the performance of the suggested method. Simulation results show that the proposed method surpasses other state‐of‐the‐art procedures in terms of accuracy, reliability, and convergence speed. [ABSTRACT FROM AUTHOR]

Variational quantum algorithms (VQAs) have been successfully applied to quantum approximate optimization algorithms, variational quantum compiling and quantum machine learning models. The performances of VQAs largely depend on the architecture of parameterized quantum circuits (PQCs). Quantum architecture search (QAS) aims to automate the design of PQCs in different VQAs with classical optimization algorithms. However, current QAS algorithms do not use prior experiences and search the quantum architecture from scratch for each new task, which is inefficient and time consuming. In this paper, a meta quantum architecture search (MetaQAS) algorithm is proposed, which learns good initialization heuristics of the architecture (i.e., meta‐architecture), along with the meta‐parameters of quantum gates from a number of training tasks such that they can adapt to new tasks with fewer gradient updates, which leads to fast learning on new tasks. The proposed MetaQAS can be used with arbitrary gradient‐based QAS algorithms. Simulation results on variational quantum compiling (VQC) and quantum approximate optimization algorithm (QAOA) show that the architectures optimized by MetaQAS converge faster than a state‐of‐the‐art gradient‐based QAS algorithm, namely DQAS. MetaQAS also achieves a better solution than DQAS after fine‐tuning of gate parameters. [ABSTRACT FROM AUTHOR]

In this paper, we demonstrate that, through policy interventions, in the form of subsidies, a system‐optimum for a multiclass human migration network can be achieved, despite the migrants, who can be refugees, behaving in a user‐optimized manner. The formulation and analysis are conducted using variational inequality theory. The policy intervention allows governmental decision‐makers to moderate the flow of migrants while enhancing societal welfare. An algorithm is proposed and applied to compute the solutions to a series of numerical examples, with changes in initial populations and utility functions, inspired by a pandemic, followed by a natural disaster. [ABSTRACT FROM AUTHOR]

Summary: This paper presents a new optimization approach for designing minimum‐cost fail‐safe distributions of fluid viscous dampers for seismic retrofitting. Failure is modeled as either complete damage of the dampers or partial degradation of the dampers' properties. In general, this leads to optimization problems with large number of constraints. This may result in high computational costs if all the constraints are simultaneously considered during the optimization analysis. Thus, to reduce the computational effort, the use of a working‐set optimization algorithm is proposed in this paper. The main idea is to solve a sequence of relaxed optimization subproblems with a small subset of all constraints. The algorithm terminates once a solution of a subproblem is found that satisfies all the constraints of the problem. The retrofitting cost is minimized with constraints on the interstory drifts at the peripheries of frame structures. The structures considered are subjected to a realistic ensemble of ground motions, and their response is evaluated with time‐history analyses. The transient optimization problem is efficiently solved with a gradient‐based sequential linear programming algorithm. The gradients of the response functions are calculated with a consistent adjoint sensitivity analysis procedure. Promising results attained for 3‐D irregular frames are presented and discussed. The numerical results highlight the fact that the optimized layout and size of the dampers can change significantly even for moderate levels of damage. [ABSTRACT FROM AUTHOR]

Summary: The optimization of indoor femtocell base stations (FBS) placement is a highly complex problem in which multiple performance figures can be considered. In this paper, we propose a biobjective optimization approach based on non‐dominated sorting genetic algorithm II (NSGA‐II) to solve the indoor FBS deployment problem in residential scenarios where a single cell is deployed within the coverage of a single dominant interfering external macro base station (MBS). The optimization problem is formulated with the objective of jointly minimizing outage probability and maximizing normalized downlink average throughput. Several conditions are simultaneously considered under the framework of Monte Carlo simulations, such as the effect of co‐channel interference in uplink and downlink, buildings with arbitrary layouts, realistic transmission schemes and antenna radiation patterns, random user distributions, and a well‐established empirical path loss model. The proposed algorithm, which determines the location and orientation of the FBS's antenna that provides a suitable compromise between the two objective functions, is evaluated in this paper. First, two different experiments are proposed to investigate the algorithm convergence; then, statistical analyses are formulated to characterize the relation between the values achieved for both objective functions; finally, the computational load is evaluated. Results indicate the convergence of the proposed method towards the real Pareto front and a significant reduction of the computational time with respect to a reference method based on exhaustive search, while pointing at new criteria for the selection of the objective functions. [ABSTRACT FROM AUTHOR]

Many real problems have been solved by support vector regression, especially v‐support vector regression (v‐SVR), but there are hyperparameters that usually needed to tune. In addition, v‐SVR cannot perform feature selection. Nature‐inspired algorithms have been used as a feature selection and as hyperparameters estimation procedure. In this paper, the opposition‐based learning Harris hawks optimization algorithm (HHOA‐OBL) is proposed to optimize the hyperparameters of the v‐SVR with embedding the feature selection simultaneously. The experimental results over four datasets show that the HHOA‐OBL outperforms the standard Harris hawks optimization algorithm, grid search, and cross‐validation methods, in terms of prediction, number of selected features, and running time. Besides, the experimental results of the HHOA‐OBL confirm the efficiency of the proposed algorithm in improving the prediction performance and computational time compared with other nature‐inspired algorithms, which proves the ability of HHOA‐OBL in searching for the best hyperparameters values and selecting the most informative features for prediction tasks. Thus, the experiments and comparisons support the performance of the proposed approach in making predictions in other real applications. v‐Support vector regression (v‐SVR) can solve many real problems. In v‐SVR, there are hyperparameters that usually needed to tune. In addition, v‐SVR cannot perform feature selection. In this paper, the opposition‐based learning Harris hawks optimization algorithm is proposed to optimize the hyperparameters of the v‐SVR with embedding the feature selection simultaneously. The experimental results show that the proposed algorithm outperforms the standard Harris hawks optimization algorithm, and other state‐of‐the‐art methods, in terms of prediction and running time. [ABSTRACT FROM AUTHOR]

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Since 1989, numerous papers on the basic aspects of GRASP, as well as enhancements to the basic metaheuristic have appeared in the literature. GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing. This is the first of two papers with an annotated bibliography of the GRASP literature from 1989 to 2008. This paper covers algorithmic aspects of GRASP. [ABSTRACT FROM AUTHOR]

The objective of this research paper is to categorize the magnetic resonance imaging (MRI) images as demented (DEM) or nondemented (ND) using improved chicken swarm optimization technique (ICSO). In literature, CSO technique is widely used to solve numerical optimization and feature selection problem. Using this optimization technique for medical image classification problem will be a pioneering idea. If this technique is directly used to classify the medical images, it provides poor results. Hence, appropriate enhancements are made on the original algorithm using a novel controlled randomness optimization algorithm and control parameter tuning. Cross‐over and Rooster selection methods are also implemented in cascaded manner for further performance improvization. All the experiments are made for two cases: with and without statistical features. The brain MRI images of 65 ND and 52 DEM subjects obtained from the Open Access Series of Imaging Studies website are used in this analysis. The ICSO without statistical features provides the highest accuracy of 86.32%, whereas the original chicken swarm optimization technique provides the accuracy of 52.13% and 52.99% with and without statistical features, respectively. [ABSTRACT FROM AUTHOR]

This paper focuses on the design and simplification computation of the optimal filter based on the HVS model for PenTile RGB. After simplifying, the proposed method is also easy to implement in hardware. Simulation results show that the optimal filter obtained by mathematical optimization can suppress the color fringing artifacts and improve apparent resolution. [ABSTRACT FROM AUTHOR]

High penetration of Renewable Energy Sources into unbalanced distribution systems faces many challenges due to the uncertainty nature of both Renewable Energy Sources and loads as well as the unbalance degree of the distribution systems. This paper proposes the planning of Renewable Energy Sources in unbalanced distribution systems. Different types of Renewable Energy Sources, photo‐voltaic and Wind are considered. A multi‐objective optimisation problem is formulated using non‐dominated sort and crowing distance for multi objective hybrid algorithm that combines the merits of Particle Swarm Optimisation and Sine Cosine Optimisation algorithms. Three objectives, improving voltage profile, power losses minimisation, and minimisation of voltage unbalance, are considered. The proposed method determines the optimal Renewable Energy Sources' specifications such as site/size/type of distributed generators, number of photo‐voltaic modules or wind turbines in each distributed generator and their power factor and connection phases. Also, it determines the optimal setting of substation tap changer and system voltage regulators. Moreover, both Renewable Energy Sources and loads uncertainty are considered and modelled using Monte Carlo simulations. An improved matrix‐based backward–forward load flow method is developed by using coefficient matrices. The proposed procedure is conducted on IEEE 13‐node, 37‐node, and 123‐node unbalanced distribution systems. The proposed algorithm results compared with individual optimisers show significant performance improvements. The optimal plans resulted by using the proposed hybrid algorithm achieve a reduction in power losses that reached 89% in some cases. Also, the system unbalance index is reduced with a ratio reached 34%. Large improvement in the system voltages profile all over the year is achieved as the system voltage profile index is reduced by a ratio reached 70%. [ABSTRACT FROM AUTHOR]

Summary: The accuracy of the finite element model is essential for fatigue analysis and vibration of a flexible body. This paper presents a finite element model updating (FEMU) algorithm based on crows search algorithm incorporated with Levy flight (LFCSA). The proposed algorithm is tested on the updating of two different cases: a simple structure (beam) and a complex structure (gearbox housing). To verify the performance of LFCSA, two optimization algorithm, which is the standard CSA and the particle swarm optimization algorithm with Levy flight (LFPSO), are applied to FEMU of the simple beam. The result of the comparison shows that the LFCSA has sufficient convergence speed and global search ability in the implementation of FEMU. In the case of gearbox housing, the error of frequencies and mode shapes are analyzed to indicate that the LFCSA gives a satisfactory result in a complex structure. [ABSTRACT FROM AUTHOR]

Salp swarm algorithm (SSA) is one of the efficient recent meta‐heuristic optimization algorithms, where it has been successfully utilized in a wide range of optimization problems in different fields. In the research process, it is found that it is very difficult to maintain the balance between the exploration and exploitation capabilities of a certain algorithm. Therefore, one of the main purposes of this article is to provide an algorithm that can intelligently balance between exploration and exploitation, so that it can balance exploration and exploitation capabilities. Later, in the research process, it was found that the sine and cosine function and the salp foraging trajectory have a high mathematical similarity, which greatly improves the optimization ability of the algorithm. In addition, the variable neighbourhood strategy can appropriately expand the optimization range of the algorithm. So in this paper, a novel golden sine cosine salp swarm algorithm with variable neighbourhood search scheme (GSCSSA‐VNS) is proposed, the another objective of proposing this algorithm is as a new optimization method for shape matching. As a relatively new branch, atomic potential matching (APM) model is inspired by potential field attractions. Compared to the conventional edge potential function (EPF) model, APM has been verified to be less sensitive to intricate backgrounds in the test image and far more cost effective in the computation process. Experimental results of four realistic examples show that GSCSSA‐VNS is able to provide very competitive results and outperforms the other algorithms. [ABSTRACT FROM AUTHOR]

Rationale: Ion mobility spectrometry (IMS) is a powerful analytical tool extensively applied in numerous domains. However, there still exists the phenomenon of peaks overlapping in the analysis of isomers with similar structures due to the limited resolution of IMS. In this paper, a dynamic inertia weight particle swarm optimization (DIWPSO) algorithm combined with second-order differentiation is proposed to separate the IMS overlapping peaks efficiently and precisely. Methods: It can identify the component number of overlapping peaks and limit those parameters (ion mobility, intensity, and full-width at half maximum of each single peak) of the peak model in a small range using second-order differentiation. Based on this, DIWPSO that has been set the best operating parameters is capable of accurately separating IMS overlapping peaks to identify the compound within a short time. Results: A comparison between the performance of DIWPSO and the improved particle swarm optimization (IPSO) found that DIWPSO with separation errors less than 2.34% overall outperforms IPSO whose maximum error is up to 5.58%. Moreover, the running time of DIWPSO is 30-80 times less than that of IPSO, and DIWPSO exhibits stronger robustness. Conclusions: This method can automatically identify the component number of IMS overlapping peaks and resolve them with muticomponents and different overlapped degrees rapidly and accurately, which further improves the structural resolution of IMS. [ABSTRACT FROM AUTHOR]

Summary: The increased usage of Internet of Things (IoT) applications in several areas, like healthcare, agriculture, and business, has aggravated mobile traffic issues to a large extent. The deployment of 5G technology has resulted in increased traffic globally. These coherent devices, on the other hand, use the internet to fine‐tune the quality of service in order to provide scalability, anonymity, and accessibility. Despite its numerous virtues, it is bound to encounter issues with interference management, fairness, throughput, and computational complexities. In this paper, a novel Multi‐Objective Gradient‐based African Buffalo Optimization (MOGABO) algorithm is developed to handle proportional fairness scheduling, improve interference management, increase throughput, and reduce computational complexities in cellular communication systems, particularly device‐to‐device (D2D) communication. The simulation analysis is done against other approaches such as the Hungarian technique, DDDPG technique, heuristic technique, and SC‐FDMA technique demonstrates that this method has improved system fairness over the existing approaches. Our method maximizes throughput, and for 500 UE, the throughput is 10.4 Mbps, with an average queuing delay of 24 ms. As a result, when compared to the existing method, MOGABO method offers a 1.2% increase in throughput. Thus, our method offers better coverage and throughput for D2D cellular communication with the reduction of computational complexities. [ABSTRACT FROM AUTHOR]

Summary: Crowdsourcing is now one of the most important and transformative paradigms, with great success in a variety of application tasks. Crowdsourcing obtains knowledge and information to solve cognitive or intelligence‐intensive tasks from an evolving group of participants via the Internet. Unfortunately, providing a hard privacy guarantee and query optimization is incompatible when a higher task acceptance rate needs to be accomplished and this case is common in most existing crowdsourcing solutions. The state of art systems suffered from different complexities such as lack of crowdsourcing optimization techniques, increased cost, latency, security, and scalability issues. In this paper, we have proposed a crowdsourcing model to optimize the cost and latency, issues that occur while query optimization using the Moth Flame and Tunicate Swarm Algorithm (MF‐TSA). The TSA algorithm is added to the MF algorithm to enhance its exploitation capability and yield fast convergence. The data privacy concerns of the worker and the requestor are addressed using homomorphic encryption that simultaneously enhances the efficiency of the crowdsourcing framework. The main aim of this work is to optimize the cost and latency for query plan selection along with security. Initially, the homomorphic encryption model is used to encrypt the data. In query design, two kinds of crowd‐controlled administrators, that is, Crowd Powered Selection (CSelect) and Crowd Powered Join (CJoin) are connected for assessing query. The proposed framework utilizes MF‐TSA to optimize the selection and join queries with low cost and latency. Finally, the experimental results demonstrate better query optimization performance than other existing algorithms such as sequential, parallel, and CrowdOp. [ABSTRACT FROM AUTHOR]

Abstract: This paper deals with power flow optimization with security constraints, focusing on the problem of short‐term hydroelectric scheduling, called predispatch. Since the energy demand varies throughout the day, the generation must satisfy daily targets, established by long‐term scheduling models. This study considers that the hydroelectric plants and transmission systems must provide an optimal flow of energy under security constraints that allow meeting energy demands for normal operating conditions and when disturbances happen. Algebraic techniques are used to exploit the sparse structure of the problem, targeting the design of an interior point algorithm, efficient in terms of robustness and computational time. Case studies compare the proposed approach with a general purpose optimization solver for quadratic problems and an algorithm for the predispatch problem that does not consider security constraints. The results show the benefits of using the method proposed in the paper, obtaining optimal power flow that is suitable to consider contingencies, with numerical stability and appropriate computational time. [ABSTRACT FROM AUTHOR]

This paper focuses on the Sort & Search method to solve a particular class of single criterion optimization problems called multiple constraints problems. This general method enables to derive exponential‐time algorithms for NP‐hard optimization problems. In this paper, this method is further extended to the class of multicriteria multiple constraints problems for which the set of Pareto optima is enumerated. Then, the application of this new method on some multicriteria scheduling problems is proposed, leading to new exponential‐time algorithms for those problems. [ABSTRACT FROM AUTHOR]

Abstract: The main goal of this paper is to introduce a novel dynamic multi‐objective optimization algorithm. First, after detecting the environmental changes, Borda count ranking method is applied to population in order to assign the Borda score to each individual, and then the lowest score individuals are removed from population and replaced with new created solutions. Furthermore, fuzzy adaptive multi‐objective cat swarm optimization algorithm is used to estimate the Pareto‐optimal front in which its parameters are tuned to new environment by Mamdani fuzzy rules when a change occurs. Performance of the proposed algorithm is tested on dynamic multi‐objective benchmarks and is compared with recent achievements. The simulations show the quite satisfactory results and higher performance of the proposed method in comparison with traditional approaches. [ABSTRACT FROM AUTHOR]

Fourier ptychography is a new type of computational imaging technology, which uses a stack of low‐resolution images obtained from overlapped apertures (or equivalent) to reconstruct super‐resolved image. However, the accuracy of the aperture position will directly affect the quality and resolution of the reconstructed image. This paper proposes a new perspective for FP positional deviations correction using the neural network. We construct a trainable neural network to perform positional deviations correction along with object reconstruction. The real part and imaginary part of the object as well as the different and irregular positional deviations of each aperture are set as the weights of convolutional layer. The gradients over these weights are computed automatically, and gradient‐based optimization algorithm is employed to recover the object and find the correct aperture position. Simulation and experiment are performed to verify our algorithm. The results show that the proposed algorithm can accurately find the aperture position and improve the reconstruction quality. [ABSTRACT FROM AUTHOR]

Different nature‐inspired meta‐heuristic algorithms have been proposed to solve optimization problems. One of these algorithms is called social spider optimization (SSO) algorithm. Spiders' natural behaviors have inspired them to find the bait position by detecting vibrations in their web. Although the SSO algorithm has good accuracy in achieving optimal solutions, it suffers from a low convergence rate. In this paper, we attempted to improve SSO by changing its motion and mating parameters. To provide a practical example of using the new proposed algorithm, we based it on multi‐objective opposition‐based SSO, named MOPSSO. We used this algorithm in a feature selection process for analyzing text psychology, which is a multi‐objective problem. Textual psychology analysis is used in various fields, including collecting and analyzing people's views on various products, topics, social and political events. After selecting features, in order to classify the text, we used a new hybrid method that hybrids fuzzy C‐MEANS data clustering technique, a decision tree (DT), and Naïve Bayes (NB). Experimental results show that the improved SSO algorithm performs better than SSO, social spider algorithm, and CMA‐ES algorithms. Additionally, the performance of the proposed hybrid classification method is better than those of NB and DT. [ABSTRACT FROM AUTHOR]

Summary: Cloud computing is the current computing standard, which provides information technology (IT) services over the Internet on demand. In the cloud environment, a task is mapped with an available resource to attain a good result. Task scheduling is the technique that is used to allocate tasks on virtual machines (VMs) of a server based on its capacity of workload. Tasks are scheduled to the server in such a way to minimize traffic and time delay. Particle swarm optimization (PSO) is the best existing algorithm used to schedule a task to an existing resource on the environment of the cloud. By PSO, the task is scheduled for an existing resource to reduce computational cost. In this paper, a hybrid swarm optimization (HSO) algorithm, which is the combination of PSO and salp swarm optimization (SSO), is proposed to resolve task scheduling issues in the cloud environment. The main goal of HSO is to schedule the task to the available resource in such a way to reduce the execution time and computation cost. Multilayer logistic regression (MLR) is an approach used to detect the overloaded VMs, so that a task can be scheduled to a VM according to its capacity of workload. The proposed HSO algorithm with MLR is simulated on the cloudsim toolkit, and the results reveal the efficiency of the proposed algorithm in terms of cost, execution time, and makespan. Compared to the existing algorithms such as the genetic algorithms (GAs), the improved efficiency evolution (IDEA), and the PSO, the proposed algorithm reveals superiority in terms of efficiency, resource utilization, and speed. [ABSTRACT FROM AUTHOR]

Summary: Vehicular Ad hoc NETwork (VANET) facilitates ubiquitous connectivity for establishing Vehicle‐to‐Vehicle (V2V) communication and supporting Intelligent Transportation Systems (ITSs). This vehicle communication requires complete coverage within the target range for ensuring reliable message dissemination. High density of vehicles in the intersections introduces challenges due to obstacles such as buildings, foliage, and other moving vehicles, preventing exchange of information about location and message update between vehicles. Non‐Line‐of‐Sight (NLOS) nodes also introduce broadcasting storm problem leading to congestion that prevents emergency messages from reaching the target vehicular nodes. Integration of meta‐heuristic Crow Search Algorithm (CSA) and Gray Wolf Optimization Algorithm (GWOA) minimizes the objective function of NLOS localization problem without the solution being trapped into local optima. In this paper, a Hybrid Crow Search and GWOA‐based NLOS Positioning Scheme (HCSGWOA‐NLOS‐PS) is proposed to handle the issue of broadcast storm and facilitate reliability in emergency message delivery. The proposed HCSGWOA‐NLOS‐PS utilizes the benefits of Time of Arrival (ToA) and geographical information‐based cooperative localization agent for attaining efficient NLOS node positioning in the network. It uses the benefits of CSA and GWOA for positioning the NLOS nodes based on the intelligence derived from the crows' conduit and the social attacking behavior of gray wolves that are ideal for balancing the tradeoff between exploration and exploitation. The simulation results of the proposed HCSGWOA‐NLOS‐PS confirm a mean emergency message delivery of 11.82%, neighborhood awareness of 12.38% with reduced localization error rate of 2.36% and minimized delay of 8.64% when compared to the baseline approaches. [ABSTRACT FROM AUTHOR]

This paper develops and examines an optimization algorithm for simulation-based tuning of controller parameters. The proposed algorithm globalizes the Guin augmented variant of Nelder-Mead's nonlinear downhill simplex by deterministic restarts, linearly growing memory vector, and moving initial simplex. First, the effectiveness of the algorithm is tested using 10 complex and multimodal optimization benchmarks. The algorithm achieves global minima of all benchmarks and compares favorably against the evolutionary, swarm, and other globalized local-search multimodal optimization algorithms in probability of finding global minimum and numerical cost. Next, the proposed algorithm is applied for tuning sliding mode controller parameters for a servo pneumatic position control application. The experimental results reveal that the system with sliding mode controller parameters tuned using the proposed algorithm targeting smooth position control with maximum possible accuracy, performs as desired and eliminates the need of manual online tuning for desired performance. The results are also compared with the performance of the same servo pneumatic system with parameters tuned using manual online tuning in an earlier published work. The system with controller parameters tuned using the proposed algorithm shows improvement in accuracy by 28.9% in sinusoidal and 42.2% in multiple step polynomials tracking. [ABSTRACT FROM AUTHOR]

One of the main challenge in designing wireless networks is to ensure optimal coverage and connectivity, which can be achieved by optimally repositioning nodes in backbone network such that the total energy requirement is minimized. Therefore, an efficient optimization algorithm that converges at faster rate while minimizing the cost function (total power) is required. In this paper, we propose the use of Levenberg-Marquardt optimization algorithm to achieve assured coverage and connectivity control in backbone-based wireless networks. The Levenberg-Marquardt method combines the advantages of Cauchy steepest descent method and Newton-Raphson method and is expected to achieve faster convergence rate irrespective of initial conditions, which is the main motivation of this study. It relies on that when current solution is far from the optimal solution, then steepest descent method will be used, and as current solution approaches to optimal solution, then gradually switched to Newton-Raphson method to find the optimal solution. Extensive simulations using M A T L A B R2020 a has been performed to demonstrate the effectiveness of proposed method by measuring its performance in the number of iterations, elapsed time, and power requirement to maintain proper coverage and connectivity. The performance is compared with Cauchy steepest descent method as well as Newton-Raphson method. [ABSTRACT FROM AUTHOR]

This paper extends the method of using linear composites of forecasts for testing the efficiency of one forecast compared to a finite collection of other forecasts. It also gives necessary and sufficient conditions for forecast optimality in the mean square error sense. Information sets are found to be unnecessary for forecast optimality. Finally, the paper shows that a consistent test of forecast optimality cannot in general be obtained using linear composites. A similar conclusion applies to tests of specification optimality based on linear composites. [ABSTRACT FROM AUTHOR]

Vector quantization is known widely as a highly efficient coding for image and speech signals. The algorithm proposed by Linde, Buzo, and Gray (the LBG algorithm) is the most fundamental design procedure for this kind of quantizer. However, the LBG algorithm usually gives only the local minimum of the distortion measure based on the quantization error. With such a background, this paper introduces the simulated annealing procedure into the design of the vector quantizer based on the LBG algorithm, which is known as the effective method for the NP-complete probabilistic combinational optimization problem. The widely employed mean-square error is adopted as the distortion measure. Various approaches are considered to derive the global minimum of the measure. In other words, this paper is based on the LBG algorithm and presents a design procedure for the vector quantizer (more generally, the vector quantizer considering the channel error) by introducing simulated annealing. By this approach, a vector quantizer with a better performance than the traditional design as well as a more ideal highly efficient coding is realized. A simulated experiment is executed for the standard image data (SIDBA), and it is demonstrated that the simulated annealing is useful in the design of the vector quantizer. [ABSTRACT FROM AUTHOR]

SUMMARY Based on recent papers that have demonstrated that robust iterative learning control can be based on parameter optimization using either the inverse plant or gradient concepts, this paper presents a unification of these ideas for discrete-time systems that not only retains the convergence properties and the robustness properties derived in previous papers but also permits the inclusion of filters in the input update formula and a detailed analysis of the effect of non-minimum-phase dynamics on algorithm performance in terms of a 'plateauing' or 'flat-lining' effect in the error norm evolution. Although the analysis is in the time domain, the robustness conditions are expressed as frequency domain inequalities. The special case of a version of the inverse algorithm that can be used to construct a robust stable anti-causal inverse non-minimum-phase plant is presented and analysed in detail. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Summary: Vehicular Ad hoc NETwork (VANET) is considered as the appropriate candidate for provisioning risk‐free environment that confirms secure cooperation and very minimal congestion among the vehicular nodes in the network. The establishment and maintenance of connectivity between vehicular nodes are determined to be influenced by the existence of Non‐Line‐of‐Sight (NLOS) nodes that introduce channel congestion and broadcasting storm into the network during emergency message delivery. Thus, NLOS nodes need to be localized with optimality for enhancing the emergency data delivery rate with minimized latency degree and energy consumption in the network. In this paper, Harris Hawk Optimization Algorithm (HHOA)‐based NLOS nodes Localization Scheme (NLOS‐LS) (HHOA‐NLOS‐LS) is proposed for facilitating reliable data dissemination among vehicular nodes under emergency situations. HHOA utilizes chasing styles and cooperative behavior of Harris hawks termed as surprise pounce for efficient localization based on reference nodes. In particular, the intelligent strategy of Harris hawks' behavior in attacking the prey in all directions is included for localizing the NLOS nodes from the reference nodes positioned in all directions of the network. It is capable of localizing the NLOS nodes based on adaptive localizing (chasing) styles attained through reference nodes dependingon the dynamic nature of NLOS nodes. The simulation results prove that the mean localization rate is improved by 23.21%, mean neighborhood awareness rate by 19.82%, mean emergency message delivery rate by 18.32% and mean channel utilization by 17.28% when compared to the baseline Weighted Inertia‐based Dynamic Virtual Bat Algorithm (WIDVBA)‐based NLOS‐LS (WIDVBA‐NLOS‐LS), Cooperative Volunteer Vehicular Nodes (CVVN)‐based NLOS‐LS (CVVN‐NLOS‐LS), Vote Selection Mechanisms and Probabilistic Data Association (VSMPDA)‐based NLOS‐LS (VSMPDA‐NLOS‐LS), and Weighted Distance Hyperbolic Prediction (WDHP)‐based NLOS‐LS (WDHP‐NLOS‐LS) for a varying number of vehicular nodes in the network. [ABSTRACT FROM AUTHOR]

This study, describes the design problem of a thinned multiple concentric elliptical arrays of uniformly excited isotropic antennas using meta‐heuristic optimization algorithms; Teaching Learning Based Optimization (TLBO), Crow Search Algorithm (CSA) and Moth Flame Optimization (MFO) algorithm. Two simulations are performed here. In simulation 1, the synthesis of the thinned array structure is presented in the vertical plane at a scanning angle 30° and in simulation 2, the synthesis is performed in the horizontal plane. In both cases, our objective is to minimize side lobe level (SLL) to the extent possible and at the same time maximize the peak directivity to a level higher than the desired value. Here, all the optimization algorithms are applied to obtain the optimum number of switched on and off elements in every concentric ellipse that will meet the above objective. A comparative analysis of all three algorithms is performed using peak directivity, SLL and first null beam width (FNBW) as well as statistical parameters such as mean, SD, best cost function value and run time. To assess the enhanced outcome of the proposed optimization design comparison is also made with the results of a fully populated concentric elliptical array antenna (CEAA) for both the cases separately. This paper shows a measure of effectiveness and potential of all the algorithms mentioned above, for designing a thinned concentric elliptical array. [ABSTRACT FROM AUTHOR]

The loss function of the deep neural network is high dimensional, nonconvex and complex. So far, the geometric properties of the loss surface of the neural network have not been well understood. Different from most theoretical studies on the loss surface, this article makes the experimental exploration on the loss surface of the deep neural network, including trajectories of various adaptive optimization algorithms, the Hessian matrix of the loss function of the deep neural network, the curvature of the loss surface along the trajectories of the various adaptive optimization algorithms. It is found that the gradient direction of the adaptive optimization algorithms is almost perpendicular to the direction of the maximum curvature of the loss surface, while the gradient directions of the stochastic gradient descent (SGD) algorithm do not have such a rule. The Hessian matrix of the loss surface along the trajectory of the optimization algorithm is degraded, which is inconsistent with the hypothetical that nonsingular of the Hessian matrix in many theoretical studies of deep learning. Besides, this article proposes a new ensemble learning method of the neural network based on the scaling invariance of the ReLu neural network and mode connectivity. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) have an important role in establishing the communication between the Internet of things (IoT) devices. Routing is an important research field in the WSN as it helps in finding the suitable paths for the communication. This paper proposes a multipath routing algorithm based on the optimization approach. The proposed routing algorithm has two important phases, namely, Cluster head selection and multipath routing. Initially, the cluster head selection is carried out by the kernel based Fuzzy C Means (kernel FCM) algorithm. Then, the multipath routing is established by the newly developed Rider Salp Swarm Optimization algorithm (RSSA), which is the integration of the Rider Optimization Algorithm (ROA) and Salp Swarm Algorithm (SSA). The fitness function of the proposed RSSA is designed by considering the several factors, such as energy, QoS and trust. The simulation of the proposed work is carried out using different WSN setups, and the results are compared with several comparative techniques. From the results, it can be summarized that the proposed RSSA based multipath routing has better performance with values of 0.2526, 0.0764, 0.5, and 26 for delay, energy, throughput and number of alive nodes, respectively. [ABSTRACT FROM AUTHOR]

Summary: The reliability of data dissemination in vehicular ad hoc network (VANET) necessitates maximized cooperation between the vehicular nodes and the least degree of congestion. However, non‐line of sight (NLOS) nodes prevent the establishment and sustenance of connectivity between the vehicular nodes. In this paper, a hybrid seagull and thermal exchange optimization (TEO) algorithm‐based NLOS node detection technique is proposed for enhancing cooperative data dissemination in VANETs. It inherits three different versions of the proposed hybridized algorithm; three different approaches for localization of NLOS nodes depending upon its distance from the reference nodes are incorporated. It is considered as a reliable attempt in effective NLOS node localization as it is predominant in maintaining the balancing the degree of exploration and exploitation in the search process. In the first variant, the method of the roulette wheel is utilized for selecting one among the two optimization algorithm. In the second adoption, this hybridization algorithm combines TEO algorithm only after the iteration of SEOA algorithm. In the final adoption, the predominance of the seagull attack mode is enhanced by including the heat exchange formula of TEO algorithms for improving exploitation capability. The simulation experiments of the proposed HS‐TEO‐NLOS‐ND scheme conducted using EstiNet 8.1 exhibited its reliability in improving the emergency message delivery rate by 14.86%, a neighborhood awareness rate by 13%, and the channel utilization rate by 11.24%, compared to the benchmarked techniques under the evaluation done with different number of vehicular nodes and NLOS nodes in the network. [ABSTRACT FROM AUTHOR]

Summary: Task scheduling in the cloud is the multiobjective optimization problem, and most of the task scheduling problems fail to offer an effective trade‐off between the load, resource utilization, makespan, and Quality of Service (QoS). To bring a balance in the trade‐off, this paper proposes a method, termed as crow–penguin optimizer for multiobjective task scheduling strategy in cloud computing (CPO‐MTS). The proposed algorithm decides the optimal execution of the available tasks in the available cloud resources in minimal time. The proposed algorithm is the fusion of the Crow Search optimization Algorithm (CSA) and the Penguin Search Optimization Algorithm (PeSOA), and the optimal allocation of the tasks depends on the newly designed optimization algorithm. The proposed algorithm exhibits a better convergence rate and converges to the global optimal solution rather than the local optima. The formulation of the multiobjectives aims at a maximum value through attaining the maximum QoS and resource utilization and minimum load and makespan, respectively. The experimentation is performed using three setups, and the analysis proves that the method attained a better QoS, makespan, Resource Utilization Cost (RUC), and load at a rate of 0.4729, 0.0432, 0.0394, and 0.0298, respectively. [ABSTRACT FROM AUTHOR]

Summary: Service‐oriented architecture (SOA) has a crucial role in backing productive cloud services. Also, the vast spread of the theoretical notion of diverse businesses (like e‐commerce) into the actual use has been recently applied by cloud computing. The service functionality could be affected by overfilling of the network traffic because of the broadly dispersed nature of e‐commerce in clouds—a key challenge for immediate jobs. Throughout the last decade, a vast range of applications or large‐scale operators has increasingly attracted to migrate the services in clouds. An effective method for accessing the applications throughout standard business hours is continually moving virtual machine containers from one data center to another. Now, with the commonness of cloud computing, many applications have been moved to the cloud fully/partly. It can be handled through the migration of cloud services to diverse platforms in a way that minimizes the communication cost of e‐commerce. As this issue has an NP‐hard nature, in the present article, we present an automatic smart service migration outline through the ant colony optimization (ACO) algorithm on cloud‐oriented e‐commerce. In the presented model, we use the ACO algorithm to take the finest (near‐optimal) service migration decisions. Based on the obtained results, the proposed technique has the optimal number of migrations compared to the existing models. [ABSTRACT FROM AUTHOR]

Evolutionary algorithm (EA) is a generic term for optimization algorithms inspired by biological optimization processes in the natural world. Although EAs are widely applied to complex real‐world problems because they do not require mathematical expression of target problems, theoretical design methods of EAs have not been established. To solve this issue, this paper proposes an approach of designing EAs within an algorithm framework in which mathematical characteristics are derived, and it also presents a concrete framework for that purpose. The presented framework, Regulated Evolution Strategies (RES) provides a stability analysis result that contributes to designing algorithms with expected behavior. The RES framework has a high degree of freedom in designing algorithms, so that it is possible to incorporate various contrivances such as local improvement of samples and reduction of constraint violations in RES‐based algorithms while maintaining the stability analysis result. Numerical experiments prove that the RES framework has a capability for designing high‐performance EAs. © 2020 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Summary: New optimization algorithms have been increasingly developed in the course of the recent years. The accuracy of identified results in optimization‐based damage detection methods depends on the objective function and optimization algorithm. This paper employs multiverse Optimizer (MVO) to solve the optimization‐based damage identification problem. Statistical results obtained by MVO are compared with those of sine cosine algorithm (SCA) and Harris hawks optimization (HHO) in order to perform a comparative study. Two objective functions are used in this optimization problem. The first one is based on the modal assurance criterion (MAC) and the second one on modified total modal assurance criterion (MTMAC). Numerical and experimental examples indicate that the combination of objective function based on MTMAC and MVO algorithm can provide accurate and reliable results in structural damage detection process. MAC is also rejected in competition with MTMAC. While using SCA‐MTMAC, the accuracy of the results is acceptable in some cases. However, HHO‐MTMAC gives weak results in most cases. MVO and SSA are the lowest, and HHO spends significantly more time in terms of computational cost. [ABSTRACT FROM AUTHOR]

Summary: Nowadays, the Orthogonal Multiple Access (OMA) principle has utilized for allocating proper radio resources in wireless networks. However, as the count of users rises, OMA‐based approaches may not satisfy the stringent emerging requirements including very low latency, very high spectral efficiency, and massive device connectivity. Moreover, there are significant challenges in cellular‐enabled Machine‐to‐Machine (M2M) communications due to the unique features of M2M‐based applications. In order to overwhelm these challenges, non‐orthogonal multiple access (NOMA) principles emerge as a solution to enhance the spectral efficiency while allowing some degree of multiple access interference at receivers. Hence, this paper intends to develop an optimal resource allocation mechanism for M2M communication. Here, the nonlinear energy harvesting performed with the aid of an accessing technology termed as NOMA. The key objective of the proposed resource allocation model is the minimization of the total energy consumption of the network. For attaining the minimized power consumption, the time allocation, and transmission power of NOMA is optimally tuned by a hybrid optimization algorithm. The proposed hybrid algorithm merges the beneficial concepts of Rider Optimization Algorithm (ROA) and FireFly (FF) algorithm and implements a new algorithm termed as FireFly Modified Bypass‐based Rider Optimization Algorithm (FMB‐ROA). Finally, the analysis of total energy concerning various constraints validates the performance of the proposed model over conventional models. [ABSTRACT FROM AUTHOR]

Summary: Computational intelligence techniques have widespread applications in the field of engineering process optimization, which typically comprises of multiple conflicting objectives. An efficient hybrid algorithm for solving multi‐objective optimization, based on particle swarm optimization (PSO) and artificial bee colony optimization (ABCO) has been proposed in this paper. The novelty of this algorithm lies in allocating random initial solutions to the scout bees in the ABCO phase which are subsequently optimized in the PSO phase with respect to the velocity vector. The last phase involves loyalty decision‐making for the uncommitted bees based on the waggle dance phase of ABCO. This procedure continues for multiple generations yielding optimum results. The algorithm is applied to a real life problem of intercity route optimization comprising of conflicting objectives like minimization of travel cost, maximization of the number of tourist spots visited and minimization of the deviation from desired tour duration. Solutions have been obtained using both pareto optimality and the classical weighted sum technique. The proposed algorithm, when compared analytically and graphically with the existing ABCO algorithm, has displayed consistently better performance for fitness values as well as for standard benchmark functions and performance metrics for convergence and coverage. [ABSTRACT FROM AUTHOR]

Multi-criteria decision analysis presumes trade-off between different criteria. As a result, the optimal solution is not unique and can be represented by the Pareto frontier in the objective space. Each Pareto solution is a compromise between different objectives. Despite a limited number of Pareto optimal solutions, the decision-maker eventually has to choose only one option. Such a choice has to be made with the use of additional preferences not included in the original formulation of the optimization problem. The paper represents a new approach to an automatic ranking that can help the decision-maker. In contrast to the other methodologies, the proposed method is based on the minimization of trade-off between different Pareto solutions. To be realized, the approach presumes the existence of a well-distributed Pareto set representing the entire Pareto frontier. In the paper, such a set is generated with the use of the directed search domain algorithm. The method is applied to a number of test cases and compared against two existing alternative approaches. [ABSTRACT FROM AUTHOR]

In the existing mobile edge computing (MEC) environment, edge servers have limited computing power and cannot process data in real time. To solve this problem, this paper proposes a task segmentation and computing offloading algorithm for mobile edge computing (MEC). Firstly, the computing tasks of mobile terminals are segmented under the network framework of cloud‐side‐device collaboration, and a task offloading optimization model is designed to minimize the total delay of mobile devices. Secondly, the computing resource allocation parameters and action space parameters are discretized, and a computing offloading algorithm based on Deep Q Network (DQN) is proposed. The algorithm extracts feature from high‐dimensional data and uses deep neural network to estimate Q‐value of actions to maximize the summation of system delays. Finally, simulation experiments show that when the cloud computing capacity is 7 × 1011 central processing unit (CPU) cycle/s, the total delay of proposed algorithm is only 1.116 s, while the total delays of comparison algorithms are 1.251 s and 1.193 s, respectively. Therefore, compared with the comparison algorithm, the proposed algorithm can better reduce the total system delay. [ABSTRACT FROM AUTHOR]

ABSTRACT Creating an attractive mesh animation is a laborious and time-consuming task. In this paper, we propose a practical deformation transfer algorithm to make it easier. To achieve a robust numerical solver, we perform the transfer process in the dual domain; that is, the deformations are transferred between the dual meshes of the source and target meshes. Firstly, the source animation is analyzed and visualized to help the user specify markers in the large deformation regions. Then, through respecting the coherence information, a fast and deformation-aware surface correspondence approach is presented to determine how the source animation is transferred. Finally, the transferred result can be reconstructed via dual Laplacian optimization. Various experimental results demonstrate the effectiveness and applicability of this paper. Moreover, a user study is carefully designed to perceptually validate our motivation and advantages. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]