The parallel 3D magnetotelluric forward modeling algorithm

The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the data in the frequency domain, which is very suitable for parallel computation. With the advantage of MPI and based on an analysis of the flow of the 3D magnetotelluric serial forward algorithm, we suggest the idea of parallel computation and apply it. Three theoretical models are tested and the execution efficiency is compared in different situations. The results indicate that the parallel 3D forward modeling computation is correct and the efficiency is greatly improved. This method is suitable for large size geophysical computations.

Forward and backward models for fault diagnosis based on parallel genetic algorithms

In this paper, a mathematical model consisting of forward and backward models is built on parallel genetic algorithms (PGAs) for fault diagnosis in a transmission power system. A new method to reduce the scale of fault sections is developed in the forward model and the message passing interface (MPI) approach is chosen to parallel the genetic algorithms by global sin-gle-population master-slave method (GPGAs). The proposed approach is applied to a sample system consisting of 28 sections, 84 protective relays and 40 circuit breakers. Simulation results show that the new model based on GPGAs can achieve very fast computation in online applications of large-scale power systems.

Experimental Investigation of a Fixed-geometry Two-dimensional Mixed-compression Supersonic Inlet with Sweep-forward High- light and Bleed Slot in an Inverted ＂X＂-type Layout

A fixed-geometry two-dimensional mixed-compression supersonic inlet with sweep-forward high-light and bleed slot in an inverted ＂X＂-form layout was tested in a wind tunnel. Results indicate： （1） with increases of the free stream Mach number, the total pressure recovery decreases, while the mass flow ratio increases to the maximum at the design point and then decreases; （2） when the angle of attack, a, is less than 6°, the total pressure recovery of both side inlets tends to decrease, but, on the lee side inlet, its values are higher than those on the windward side inlet, and the mass flow ratio on lee side inlet increases first and then falls, while on the windward side it keeps declining slowly with the sum of mass flow on both sides remaining almost constant; （3） with the attack angle, a, rising from 6° to 9°, both total pressure recovery and mass flow ratio on the lee side inlet fall quickly, but on the windward side inlet can be observed decreases in the total pressure recovery and increases in the mass flow ratio; （4） by comparing the velocity and back pressure characterristics of the inlet with a bleed slot to those of the inlet without, it stands to reason that the existence of a bleed slot has not only widened the steady working range of inlet, but also made an enormous improvement in its performance at high Mach numbers. Besides, this paper also presents an example to show how this type of inlet is designed.

A Kind of Second-Order Learning Algorithm Based on Generalized Cost Criteria in Multi-Layer Feed-Forward Neural Networks

A kind of second order algorithm--recursive approximate Newton algorithm was given by Karayiannis. The algorithm was simplified when it was formulated. Especially, the simplification to matrix Hessian was very reluctant, which led to the loss of valuable information and affected performance of the algorithm to certain extent. For multi layer feed forward neural networks, the second order back propagation recursive algorithm based generalized cost criteria was proposed. It is proved that it is equivalent to Newton recursive algorithm and has a second order convergent rate. The performance and application prospect are analyzed. Lots of simulation experiments indicate that the calculation of the new algorithm is almost equivalent to the recursive least square multiple algorithm. The algorithm and selection of networks parameters are significant and the performance is more excellent than BP algorithm and the second order learning algorithm that was given by Karayiannis.

A Modified Back/Forward Sweep Method Based on the Electricity Consumption Data

With the development of distribution automation system, the centralized meter reading system has been adopted more and more extensively, which provides real-time electricity consumption data of end-users, and consequently lays foundation for operating condition on-line analysis of distribution network. In this paper, a modified back/forward sweep method, which directly uses real-time electricity consumption data acquired from the centralized meter reading system, is proposedto realize voltage analysis based on 24-hour electricity consumption data of a typical transformer district. Furthermore, the calculated line losses are verified through data collected from the energy metering of the distribution transformer, illustrating that the proposed method can be applied in analyzing voltage level and discovering unknown energy losses, which will lay foundation for on-line analysis, calculation and monitoring of power distribution network.

A Study on Parallel Computation Based on 3D Forward Algorithm of Gravity

Interpretation of geophysical material is the prospecting method. Interpretation of Gravity-megnetic data is based on data processing and inversion. When the grid is divided into several million cells, the computing task is heavy and time-consuming. In order to increase efficiency of the 3D forward modeling, the paper will adopt MPI parallel algorithm and the several processes will deal with data in the method. Finally, we can gather the result. Through comparing the result of sequence algorithm with the result of MPI parallel algorithm, we can see the result is the same. When the number of processes is 2 to 8, the speed-up ratio is 1.97 to 5. The MPI parallel algorithm is very efficient.

Forward displacement analysis of a redundant parallel manipulator by approximation algorithms

This paper presents the forward displacement analysis of an 8-PSS(prismatic-spherical-spherical)redundant parallel manipulator whose moving platform is linked to the base platform by eight kinemtic chains consisting of a PSS joint and a strut with fixed length.A general approximation algorithm is used to solve the problem.To avoid the extraction of root in the approximation process,the forward displacement analysis of the 8-PSS redundant parallel manipulator is transformed into another equivalent problem on the assumption that the strut is extensible while the slider is fixed.The problem is solved by a modified approximation algorithm which predicates that the manipulator will move along a pose vector to reduce the difference between the desired configuration and an instantaneous one,and the best movement should be with minimum norm and least quadratic sum.The characteristic of this modified algorithm is that its convergence domain is larger than that of the general approximation algorithm.Simulation results show that the modelified algorithm is general and can be used for the forward displacement analysis of the redundant parallel manipulator actuated by a revolute joint.

A Mixed Real-time Algorithm for the Forward Kinematics of Stewart Parallel Manipulator

Aimed at the real-time forward kinematics solving problem of Stewart parallel manipulator in the control course, a mixed algorithm combining immune evolutionary algorithm and numerical iterative scheme is proposed. Firstly taking advantage of simpleness of inverse kinematics, the forward kinematics is transformed to an optimal problem. Immune evolutionary algorithm is employed to find approximate solution of this optimal problem in manipulator＇s workspace. Then using above solution as iterative initialization, a speedy numerical iterative scheme is proposed to get more precise solution. In the manipulator running course, the iteration initialization can be selected as the last period position and orientation. Because the initialization is closed to correct solution, solving precision is high and speed is rapid enough to satisfy real-time requirement. This mixed forward kinematics algorithm is applied to real Stewart parallel manipulator in the real-time control course. The examination result shows that the algorithm is very efficient and practical.

Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.

Forward modeling of marine DC resistivity method for a layered anisotropic earth

Since the ocean bottom is a sedimentary environment wherein stratification is well developed, the use of an anisotropic model is best for studying its geology. Beginning with Maxwell＇s equations for an anisotropic model, we introduce scalar potentials based on the divergence-free characteristic of the electric and magnetic （EM） fields. We then continue the EM fields down into the deep earth and upward into the seawater and couple them at the ocean bottom to the transmitting source. By studying both the DC apparent resistivity curves and their polar plots, we can resolve the anisotropy of the ocean bottom. Forward modeling of a high-resistivity thin layer in an anisotropic half-space demonstrates that the marine DC resistivity method in shallow water is very sensitive to the resistive reservoir but is not influenced by airwaves. As such, it is very suitable for oil and gas exploration in shallowwater areas but, to date, most modeling algorithms for studying marine DC resistivity are based on isotropic models. In this paper, we investigate one-dimensional anisotropic forward modeling for marine DC resistivity method, prove the algorithm to have high accuracy, and thus provide a theoretical basis for 2D and 3D forward modeling.

带驻留时间HMM2的Forward-Backward算法

讨论了用状态驻留时间来模型化传统HMM2模型,对传统HMM2的状态转移和输出观测值的Markov假设条件作了改进,在新模型的转移概率和输出观测值的概率中加入驻留时间,并在传统HMM2的基础上定义了新模型的前向-后向变量算法,导出了新模型的前向-后向算法的迭代公式,以及在给定模型λ的条件下,产生观测序列O的概率计算公式.

Fast 3D forward modeling of the magnetic field and gradient tensor on an undulated surface

Magnetic field gradient tensor technique provides abundant data for delicate inversion of subsurface magnetic susceptibility distribution. Large scale magnetic data inversion imaging requires high speed and accuracy for forward modeling. For arbitrarily distributed susceptibility data on an undulated surface, we propose a fast 3D forward modeling method in the wavenumber domain based on(1) the wavenumber-domain expression of the prism combination model and the Gauss–FFT algorithm and(2) cubic spline interpolation. We apply the proposed 3D forward modeling method to synthetic data and use weighting coefficients in the wavenumber domain to improve the modeling for multiple observation surfaces, and also demonstrate the accuracy and efficiency of the proposed method.

Near-infrared Spectral Detection of the Content of Soybean Fat Acids Based on Genetic Multilayer Feed forward Neural Network

In the paper, a method of building mathematic model employing genetic multilayer feed forward neural network is presented, and the quantitative relationship of chemical measured values and near-infrared spectral data is established. In the paper, quantitative mathematic model related chemical assayed values and near-infrared spectral data is established by means of genetic multilayer feed forward neural network, acquired near-infrared spectral data are taken as input of network with the content of five kinds of fat acids tested from chemical method as output, weight values of multilayer feed forward neural network are trained by genetic algorithms and detection model of neural network of soybean is built. A kind of multilayer feed forward neural network trained by genetic algorithms is designed in the paper. Through experiments, all the related coefficients of five fat acids can approach 0.9 which satisfies the preliminary test of soybean breeding.

Werner-Type Matrix Valued Rational Interpolation and Its Recurrence Algorithms

In this paper, a practical Werner-type continued fraction method for solving matrix valued rational interpolation problem is provided by using a generalized inverse of matrices. In order to reduce the continued fraction form to rational function form of the interpolants, an efficient forward recurrence algorithm is obtained.

Real-time Feed-forward Force Compensation for Active Magnetic Bearings System Based on H∞ Controller

There are two kinds of unbalance vibrations—force vibration and displacement vibration due to the existence of unbalance excitation in active magnetic bearings（AMB） system. And two unbalance compensation methods—closed-loop feedback and open loop feed-forward are presented to reduce the force vibration. The transfer function order of the control system directly influencing the system stability will be increased when the closed-loop method is adopted, which makes the real-time compensation not easily achieved. While the open loop method would not increase the primary transfer function order, it provides conditions for real-time compensation. But the real-time compensation signals are not easy to be obtained in the open loop method. To implement real-time force compensation, a new method is proposed to reduce the force vibration caused by the rotor unbalance on the basis of AMB active control. The method realizes real-time and on-line force auto-compensation based on H∞ controller and one novel feed-forward compensation controller, which makes the rotor rotate around its inertia axis. The time-variable feed-forward compensatory signal is provided by a modified adaptive variable step-size least mean square（VSLMS） algorithm. And the relevant least mean square（LMS） algorithm parameters are used to solve the H∞ controller weighting functions. The simulation of the new method to compensate some frequency-variable and sinusoidal signals is completed by MATLAB programming, and real-time compensation is implemented in the actual AMB experimental system. The simulation and experiment results show that the compensation scheme can improve the robust stability and the anti-interference ability of the whole AMB system by using H∞ controller to achieve close-loop control, and then real-time force unbalance compensation is implemented. The proposed research provides a new control strategy containing real-time algorithm and H∞ controller for the force compensation of AMB system. And the stability of the control system is finally improved.

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.

ADAPTIVE FEED-FORWARD COMPENSATOR FOR HARMONIC CANCELLATION IN ELECTRO-HYDRAULIC SERVO SYSTEM

Since the dead zone phenomenon occurs in electro-hydraulic servo system, the output of the system corresponding to a sinusoidal input contains higher harmonic besides the fundamental input, which causes harmonic distortion of the output signal. The method for harmonic cancellation based on adaptive filter is proposed. The task is accomplished by generating reference signals with frequency that should be eliminated from the output. The reference inputs are weighted by the adaptive filter in such a way that it closely matches the harmonic. The output of the adaptive filter is a harmonic replica and is injected to the fundamental signal such that the output harmonic is cancelled leaving the desired signal alone, and the total harmonic distortion （THD） is greatly reduced. The weights of filter are adjusted on-line according to the control error by using least-mean-square （LMS） algorithm. Simulation results performed with a hydraulic system demonstrate the efficiency and validity of the proposed adaptive feed-forward compensator （AFC） control scheme

Accelerating an adiabatic process by nonlinear sweeping

We investigate the acceleration of an adiabatic process with the same survival probability of the ground state by sweeping a parameter nonlinearly, fast in the wide gap region and slowly in the narrow gap region, in contrast to the usual linear sweeping. We find the expected acceleration both in the Landau-Zener tunneling model and in the adiabatic quantum computing model for factorizing the number N - 21.

High Precision Time Domain Forward Modeling for Crosshole Electromagnetic Tomography

To improve the resolution of crosshole electromagnetic tomography, high precision of forward modeling is necessary. A pseudo-spectral time domain （PSTD） forward modeling was used to simulate electromagnetic wave propagation between two boreholes. The PSTD algorithm is based on the finite difference time domain （FDTD） method and uses the fast Fourier transform （FFT） algorithm for spatial derivatives in Maxwell＇s equations. Besides having the strongpoint of the FDTD method, the calculation precision of the PSTD algorithm is higher than that of the FDTD method under the same calculation condition. The forward modeling using the PSTD method will play an important role in enhancing the resolution of crosshole electromagnetic tomography.

A study on Parallel Computation Based on Finite Element Forward Modeling of 2D Magnetotelluric

Magnetotelluric sounding method based on the difference of the rock’s resistivity is an exploration method about doing research in earth’s resistivity and phase using the native electromagnetic field. The paper adopts 2D finite element method as the magnetotelluric forward method and calculates the total field by primary field (also named background field) plus secondary field. We can?get more accurate forward result through the finite element method and we can get the result effected by the dense degree of grid slightly by the total field. But the method is not effective?enough when the model is divided into relative big grid. When the frequency changes, program solves relevant equation separately. According to the feature of the algorithm, we apply MPI parallel method in the algorithm. Every process solves relevant equation. The account of frequency?that a process needs to solve in parallel computation is less than the account that the process?needs to solve in serial algorithm. We can see that the forward result is the same with the serial algorithm and proves the correctness of algorithm. We do statistics about the efficiency of the parallel algorithm. When the account of processes is from 2 to 8, the speedup is from 1.63 to 2.64. It proves the effectiveness of the parallel algorithm.