RESEARCH OF PROBLEMS ON REALIZING DIRECT ALGORITHM OF WAVELET TRANSFORM

Direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the direct algorithm of discrete wavelet transform (DWT),such as discrete convolution operation formula of wavelet coefficients and wavelet components,sampling principle and technology to wavelets, deciding method for scale range of wavelets, measuresto solve edge effect problem, etc, are obtained. The realization of direct algorithm of continuouswavelet transform (CWT) is also studied. The computing cost of direct algorithm and Mallat algorithmof DWT are still studied, and the computing formulae are obtained. These works are beneficial todeeply understand WT and Mallat algorithm. Examples in the end show that direct algorithm can alsobe applied widely.

Downhole Microseismic Source Location Based on a Multi-Dimensional DIRECT Algorithm for Unconventional Oil and Gas Reservoir Exploration

Downhole microseismic data has the significant advantages of high signal-to-noise ratio and well-developed P and S waves and the core component of microseismic monitoring is microseismic event location associated with hydraulic fracturing in a relatively high confidence level and accuracy.In this study,we present a multidimensional DIRECT inversion method for microseismic locations and applicability tests over modeling data based on a downhole microseismic monitoring system.Synthetic tests inidcate that the objective function of locations can be defined as a multi-dimensional matrix space by employing the global optimization DIRECT algorithm,because it can be run without the initial value and objective function derivation,and the discretely scattered objective points lead to an expeditious contraction of objective functions in each dimension.This study shows that the DIRECT algorithm can be extensively applied in real downhole microseismic monitoring data from hydraulic fracturing completions.Therefore,the methodology,based on a multidimensional DIRECT algorithm,can provide significant high accuracy and convergent efficiency as well as robust computation for interpretable spatiotemporal microseismic evolution,which is more suitable for real-time processing of a large amount of downhole microseismic monitoring data.

A DIRECT ALGORITHM FOR DISTINGUISHING NONSINGULAR M-MATRIX AND H-MATRIX

A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-matrix (or H-matrix) by using the algorithm.

A Direct Algorithm for the Vertical Generalized Complementarity Problem Associated with <i>P</i>-Matrices

We present a direct algorithm for solving the vertical generalized linear complementarity problem, first considered by Cottle and Dantzig, when the associated matrix is a vertical block P-matrix. The algorithm converges to a unique solution in a finite number of steps, without an assumption of nondegeneracy on the given problem. The algorithm is simple, efficient, and easy to implement.

A Direct Algorithm Maple Package of One-Dimensional Optimal System for Group Invariant Solutions

To construct the one-dimensional optimal system of finite dimensional Lie algebra automatically,we develop a new Maple package One Optimal System.Meanwhile,we propose a new method to calculate the adjoint transformation matrix and find all the invariants of Lie algebra in spite of Killing form checking possible constraints of each classification.Besides,a new conception called invariance set is raised.Moreover,this Maple package is proved to be more efficiency and precise than before by applying it to some classic examples.

Well production optimization using streamline features-based objective function and Bayesian adaptive direct search algorithm

Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.This method spends most of computing time in objective function evaluation by reservoir numerical simulator which limits its optimization efficiency.To improve optimization efficiency,a well production optimization method using streamline features-based objective function and Bayesian adaptive direct search optimization(BADS)algorithm is established.This new objective function,which represents the water flooding potential,is extracted from streamline features.It only needs to call the streamline simulator to run one time step,instead of calling the simulator to calculate the target value at the end of development,which greatly reduces the running time of the simulator.Then the well production optimization model is established and solved by the BADS algorithm.The feasibility of the new objective function and the efficiency of this optimization method are verified by three examples.Results demonstrate that the new objective function is positively correlated with the cumulative oil production.And the BADS algorithm is superior to other common algorithms in convergence speed,solution stability and optimization accuracy.Besides,this method can significantly accelerate the speed of well production optimization process compared with the objective function calculated by other conventional methods.It can provide a more effective basis for determining the optimal well production for actual oilfield development.

Direct P-code acquisition algorithm based on bidirectional overlap technique

According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the relationship of SNR loss with overlap shift value and initial average phase difference in the overlap average algorithm. On this basis, the bidirectional overlap average algorithm based on optimal correlation SNR is proposed. The algorithm maintains SNR consistent in the entire initial average phase difference space, and has a better SNR performance than the overlap average algorithm. The effectiveness of the algorithm is verified by both theoretical analysis and simulation results. The SNR performance of the bidirectional overlap average algorithm is 5 dB better than that of the direct average algorithm, and 2 dB better than that of the overlap average algorithm, which provides the support for direct P-code acquisition in low SNR.

Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system

Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.

Direction of Arrivals Estimation for Correlated Broadband Radio Signals by MVDR Algorithm Using Wavelet

A theoretical relationship between the wavelet transform and the fast fourier transformation(FFT) methods in broadband wireless signal is proposed for solving the direction of arrivals(DOAs) estimation problem. This leads naturally to the derivation of minimum variance distortionless response(MVDR) algorithm, which combines the benefits of subspace methods with those of wavelet, and spatially smoothed versions are utilized which exhibits good performance against correlated signals. We test the method's performance by simulating and comparing the performance of proposed algorithm, FFT MVDR and MVDR with correlated signals, and an improved performance is obtained.

Study of Direction Probability and Algorithm of Improved Marriage in Honey Bees Optimization for Weapon Network System

To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.

Directional Routing Algorithm for Deep Space Optical Network

With the development of science, economy and society, the needs for research and exploration of deep space have entered a rapid and stable development stage. Deep Space Optical Network(DSON) is expected to become an important foundation and inevitable development trend of future deepspace communication. In this paper, we design a deep space node model which is capable of combining the space division multiplexing with frequency division multiplexing. Furthermore, we propose the directional flooding routing algorithm(DFRA) for DSON based on our node model. This scheme selectively forwards the data packets in the routing, so that the energy consumption can be reduced effectively because only a portion of nodes will participate the flooding routing. Simulation results show that, compared with traditional flooding routing algorithm(TFRA), the DFRA can avoid the non-directional and blind transmission. Therefore, the energy consumption in message routing will be reduced and the lifespan of DSON can also be prolonged effectively. Although the complexity of routing implementation is slightly increased compared with TFRA, the energy of nodes can be saved and the transmission rate is obviously improved in DFRA. Thus the overall performance of DSON can be significantly improved.

CONVERGENCE ANALYSIS AND MRALLEL IMPLEMENTION FOR THE DIRECTEDGRAPH -ALGORITHM

In this paper we discuss the convergence of the directed graph-algorithm for solving a kind of optimization problems where the objective and subjective functions are all separable, and the parallel implementation process for the directed graph -algorithm is introduced.

A Reweighted Total Variation Algorithm with the Alternating Direction Method for Computed Tomography

A variety of alternating direction methods have been proposed for solving a class of optimization problems. The applications in computed tomography (CT) perform well in image reconstruction. The reweighted schemes were applied in l1-norm and total variation minimization for signal and image recovery to improve the convergence of algorithms. In this paper, we present a reweighted total variation algorithm using the alternating direction method (ADM) for image reconstruction in CT. The numerical experiments for ADM demonstrate that adding reweighted strategy reduces the computation time effectively and improves the quality of reconstructed images as well.

Application of Wavelength Selection Combined with DS Algorithm for Model Transfer between NIR Instruments

This study aims to realize the sharing of near-infrared analysis models of lignin and holocellulose content in pulp wood on two different batches of spectrometers and proposes a combined algorithm of SPA-DS,MCUVE-DS and SiPLS-DS.The Successive Projection Algorithm(SPA),the Monte-Carlo of Uninformative Variable Elimination(MCUVE)and the Synergy Interval Partial Least Squares(SiPLS)algorithms are respectively used to reduce the adverse effects of redundant information in the transmission process of the full spectrum DS algorithm model.These three algorithms can improve model transfer accuracy and efficiency and reduce the manpower and material consumption required for modeling.These results show that the modeling effects of the characteristic wavelengths screened by the SPA,MCUVE and SiPLS algorithms are all greatly improved compared with the full-spectrum modeling,in which the SPA-PLS result in the best prediction with RPDs above 6.5 for both components.The three wavelength selection methods combined with the DS algorithm are used to transfer the models of the two instruments.Among them,the MCUVE combined with the DS algorithm has the best transfer effect.After the model transfer,the RMSEP of lignin is 0.701,and the RMSEP of holocellulose is 0.839,which was improved significantly than the full-spectrum model transfer of 0.759 and 0.918.

A ROBUST PHASE-ONLY DIRECT DATA DOMAIN ALGORITHM BASED ON GENERALIZED RAYLEIGH QUOTIENT OPTIMIZATION USING HYBRID GENETIC ALGORITHM

A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA com- posed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables. Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is sim- pler than conventional algorithms when it comes to hardware implementation. Moreover, it proc- esses only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA.

改进流向算法的无线传感器网络覆盖优化

针对标准流向算法易陷入局部最优和收敛精度低等问题,提出一种融合莱维(Levy)飞行和入侵杂草策略的改进流向算法.首先,该算法在选择水流流向时引入Levy飞行机制,使水流沿最优水流位置方向做Levy飞行运动,避免陷入局部最优;其次,利用入侵杂草策略,对每一代水流进行繁殖、空间扩散和竞争操作,增加水流的多样性,扩大搜索范围,提高全局寻优能力.最后,将改进流向算法应用于无线传感器网络覆盖优化中,并与标准流向算法及其他改进算法进行实验对比.仿真结果表明,相比标准流向算法及其他改进算法,所提改进流向算法的覆盖性能有大幅提升,覆盖率可达98.52%,可实现更均匀的节点分布和更低的部署成本.

Genetic algorithm-based wide-band deterministic maximum likelihood direction finding algorithm

The wide-band direction finding is one of hit and difficult task in array signal processing. This paper generalizes narrow-band deterministic maximum likelihood direction finding algorithm to the wideband case, and so constructions an object function, then utilizes genetic algorithm for nonlinear global optimization. Direction of arrival is estimated without preprocessing of array data and so the algorithm eliminates the effect of pre-estimate on the final estimation. The algorithm is applied on uniform linear array and extensive simulation results prove the efficacy of the algorithm. In the process of simulation, we obtain the relation between estimation error and parameters of genetic algorithm.

Fingerprint Directional Image Partitioning Based on Genetic Algorithm

In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to guide the partitioning procedure. Finding best fitted mask application is converted to an functional optimizing problem, and we give out a GA solution to the problem. At last, we discuss the application of the proposed method in Fingerprint Classification.

增强多层网络心理地图保持效果的力引导布局算法

为了增强多层网络可视化中网络布局的心理地图保持效果,减轻读者在跨层分析任务中的认知负担,提出一种应用于切片式多层网络可视化的力引导布局算法.首先计算节点副本间的单向吸引系数;然后根据单向吸引系数和各节点副本的当前位置计算各节点副本的理想位置及距离差;最后结合距离差损失项、KK算法能量函数和节点副本间距损失项构建损失函数并优化得到布局方案.通过在10个公开数据集,包括7个社交网络数据集、3个遗传网络数据集上,与同类型算法对比在心理地图保持指标,即节点移动总距离上的表现的结果表明,所提算法能够显著增强多层网络布局的心理地图保持效果.

A New 3D Wireless Directional Sensing Model and Coverage Enhancement Algorithm

Coverage control for each sensor is based on a 2D directional sensing model in directional sensor networks conventionally. But the 2D model cannot accurately characterize the real environment. In order to solve this problem,a new 3D directional sensor model and coverage enhancement algorithm is proposed. We can adjust the pitch angle and deviation angle to enhance the coverage rate. And the coverage enhancement algorithm is based on an improved gravitational search algorithm. In this paper the two improved strategies of GSA are directional mutation strategy and individual evolution strategy. A set of simulations show that our coverage enhancement algorithm has a good performance to improve the coverage rate of the wireless directional sensor network on different number of nodes,different virtual angles and different sensing radius.