Scheduling optimization of task allocation in integrated manufacturing system based on task decomposition

How to deal with the collaboration between task decomposition and task scheduling is the key problem of the integrated manufacturing system for complex products. With the development of manufacturing technology, we can probe a new way to solve this problem. Firstly, a new method for task granularity quantitative analysis is put forward, which can precisely evaluate the task granularity of complex product cooperation workflow in the integrated manufacturing system, on the above basis; this method is used to guide the coarse-grained task decomposition and recombine the subtasks with low cohesion coefficient. Then, a multi-objective optimieation model and an algorithm are set up for the scheduling optimization of task scheduling. Finally, the application feasibility of the model and algorithm is ultimately validated through an application case study.

Trade-off Optimization for Scalable Video Coding Streaming in Relay-Based OFDMA Networks

To achieve an optimal trade-off between video quality and energy efficiency in the uplink streaming of multi-user Scalable Video Coding (SVC) videos in relay-based Orthogonal Frequency Division Multiple Access (OFDMA) cellular networks, a cross-layer design framework that jointly selects the Transmission Policy (TP) for SVC video frames, assigns OFDMA subcarriers, and allocates power for each subcarrier is proposed. We apply the dual decomposition method to the problem, and obtain a TP selection subproblem for each SVC video adaptation and a resource allocation subproblem of Joint Subcarrier, Relay and Power Allocation (JSRPA). A second level of dual decomposition is used to divide the JSRPA problem into independent subcarrier subproblems. The proposed Crosslayer Trade-off Optimization (CTO) algorithm is sub-distributed with significantly low complexity. A performance evaluation with typical SVC video traces demonstrates that the proposed algorithm is able to converge and efficiently achieve the optimal trade-off between the video quality and energy consumption at the MSs for uplink SVC streaming.

Argo floats revealing bimodality of large-scale mid-depth circulation in the North Atlantic

Analysis of Argo float trajectories at 1 000 m and temperature at 950 m in the North Atlantic between November 2003 and January 2005 demonstrates the existence of two different circulation modes with fast transition between them. Each mode has a pair of cyclonic - anticyclonic gyres. The difference is the location of the cyclonic gyre. The cyclonic gyre stretches from southeast to northwest in the first mode and from the southwest to the northeast in the second mode. The observed modes strongly affect the heat and salt transport in the North Atlantic. In particular, the second mode slows down the westward transport of the warm and saline water from the Mediterranean Sea.

Energy-Efficient Transceiver Design for Multi-Pair Two-Way Relay Systems

In this paper, we focus on energy-efficient transceiver and relay beamforming design for multi-pair two-way relay system. The multi-antenna users and the multi-antenna relay are considered in this work. Different from the existing works, the proposed algorithm is energy-efficient which is more applicable to the future green network. It considers both the sum-MSE problem and the power consumption problem for the users under the relay power constraint. Based on the optimal condition decomposition(OCD) method, the energy-efficient precoders at the users can be designed separately with limited information exchanged. The proposed relay beamforming algorithm is based on the alternative direction method of multipliers(ADMM) which has simpler iterative solution and enjoys good convergence. Simulation results demonstrate the performance of the proposed algorithms in terms of power consumption and MSE performance.

Three-Tangle for High-Rank Mixed States

A family of rank-n （n = 5, 6, 7, 8） three-qubit mixed states are constructed. The explicit expressions for the three-tangle and optimal decompositions for all these states are given. The CKW relations for these states are also discussed.

Signal pre-processing method and application design of edge nodes for distributed electromechanical system

A signal pre-processing method based on optimal variational mode decomposition(OVMD)is proposed to improve the efficiency and accuracy of local data filtering and analysis of edge nodes in distributed electromechanical systems.Firstly,the singular points of original signals are eliminated effectively by using the first-order difference method.Then the OVMD method is applied for signal modal decomposition.Furthermore,correlation analysis is conducted to determine the degree of correlation between each mode and the original signal,so as to accurately separate the real operating signal from noise signal.On the basis of theoretical analysis and simulation,an edge node pre-processing system for distributed electromechanical system is designed.Finally,by virtue of the signal-to-noise ratio(SNR)and root-mean-square error(RMSE)indicators,the signal pre-processing effect is evaluated.The experimental results show that the OVMD-based edge node pre-processing system can extract signals with different characteristics and improve the SNR of reconstructed signals.Due to its high fidelity and reliability,this system can also provide data quality assurance for subsequent system health monitoring and fault diagnosis.

THE OPTIMAL PRECONDITIONING IN THE DOMAIN DECOMPOSITION METHOD FOR WILSON ELEMENT

This paper discusses the optimal preconditioning in the domain decomposition method for Wilson element. The process of the preconditioning is composed of the resolution of a small scale global problem based on a coarser grid and a number of independent local subproblems, which can be chosen arbitrarily. The condition number of the preconditioned system is estimated by some characteristic numbers related to global and local subproblems. With a proper selection, the optimal preconditioner can be obtained, while the condition number is independent of the scale of the problem and the number of subproblems.

OPTIMAL COARSE GRID SIZE IN DOMAIN DECOMPOSITION

In most domain decomposition (DD) methods, a coarse grid solve is employed to provide the global coupling required to produce an optimal method. The total cost of a method can depend sensitively on the choice of the coaxse grid size H. In this paper, we give a simple analysis of this phenomenon for a model elliptic problem and a variant of Smith's vertex space domain decomposition method [11, 3]. We derive the optimal value Hopt which asymptotically minimises the total cost of method (number of floating point operations in the sequential case and execution time in the parallel case), for subdomain solvers with different complekities. Using the value of Hopt, we derive the overall complexity of the DD method, which can be significantly lower than that of the subdomain solver