A FEASIBLE DIRECTION ALGORITHM WITHOUT LINE SEARCH FOR SOLVING MAX-BISECTION PROBLEMS

This paper concerns the solution of the NP-hard max-bisection problems. NCP functions are employed to convert max-bisection problems into continuous nonlinear programming problems. Solving the resulting continuous nonlinear programming problem generates a solution that gives an upper bound on the optimal value of the max-bisection problem. From the solution, the greedy strategy is used to generate a satisfactory approximate solution of the max-bisection problem. A feasible direction method without line searches is proposed to solve the resulting continuous nonlinear programming, and the convergence of the algorithm to KKT point of the resulting problem is proved. Numerical experiments and comparisons on well-known test problems, and on randomly generated test problems show that the proposed method is robust, and very efficient.

Alternative Theorems and Sufficient Conditions of Global Convergence for a Class of Feasible Direction Algorithms

In this paper, two alternative theorems which differ from Theorem 10.2.6 in [1] and Theorem 1 in [3] are presented for a class of feasible direction algorithms. On the basis of alternative theorems, furthermore, two sufficient conditions of global convergence of this class of algorithms are obtained.

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.

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.

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.

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.

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.

Full-vectorial finite-difference beam propagation method based on the modified alternating direction implicit method

A modified alternating direction implicit algorithm is proposed to solve the full-vectorial finite-difference beam propagation method formulation based on H fields. The cross-coupling terms are neglected in the first sub-step, but evaluated and doubly used in the second sub-step. The order of two sub-steps is reversed for each transverse magnetic field component so that the cross-coupling terms are always expressed in implicit form, thus the calculation is very efficient and stable. Moreover, an improved six-point finite-difference scheme with high accuracy independent of specific structures of waveguide is also constructed to approximate the cross-coupling terms along the transverse directions. The imaginary-distance procedure is used to assess the validity and utility of the present method. The field patterns and the normalized propagation constants of the fundamental mode for a buried rectangular waveguide and a rib waveguide are presented. Solutions are in excellent agreement with the benchmark results from the modal transverse resonance method.

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.

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.

Distributed MPC for Reconfigurable Architecture Systems via Alternating Direction Method of Multipliers

This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merely modifying the couplings between different subsystems.To equip live systems with a quick response ability when modifying network topology,while keeping a satisfactory dynamic performance,a novel reconfiguration control scheme based on the alternating direction method of multipliers(ADMM)is presented.In this scheme,the local controllers directly influenced by the structure realignment are redesigned in the reconfiguration control.Meanwhile,by employing the powerful ADMM algorithm,the iterative formulas for solving the reconfigured optimization problem are obtained,which significantly accelerate the computation speed and ensure a timely output of the reconfigured optimal control response.Ultimately,the presented reconfiguration scheme is applied to the level control of a benchmark four-tank plant to illustrate its effectiveness and main characteristics.

基于改进JPS算法的无人车路径规划

为解决传统JPS(Jump Point Search)算法的拐点多和路径次优等问题,提出一种改进的跳点搜索算法。首先,根据地图可行率,对障碍物进行适应性膨胀,以保障安全距离;其次,结合方向性因素对启发函数进行调整,显著提高了路径搜索的目的性;最后,提出了一种能剔除冗余节点的关键点提取策略,优化了初始规划后的路径,在保证路径最短的同时,显著减少了拓展节点和拐角。实验结果表明,与传统的JPS算法相比,所提算法能缩短路径长度并减少拐角数量,同时拓展节点数量平均减少19%,搜索速度平均提升21.8%。

Research on Verification Method of Motor Startups in Nuclear Power Plants Based on Topology Recognition

There are many motors in operation or on standby in nuclear power plants,and the startup of group motors will have a great impact on the voltage of the emergency bus.At present,there is no special or inexpensive software to solve this problem,and the experience of engineers is not accurate enough.Therefore,this paper developed a method and system for the startup calculation of group motors in nuclear power plants and proposed an automatic generation method of circuit topology in nuclear power plants.Each component in the topology was given its unique number,and the component class could be constructed according to its type and upper and lower connections.The subordination and topology relationship of switches,buses,and motors could be quickly generated by the program according to the component class,and the simplified direct power flow algorithm was used to calculate the power flow for the startup of group motors according to the above relationship.Then,whether the bus voltage is in the safe range and whether the voltage exceeds the limit during the startup of the group motor could be judged.The practical example was used to verify the effectiveness of the method.Compared with other professional software,the method has high efficiency and low cost.

基于Tamura纹理特征的织物组织识别算法

针对目前织物组织的识别主要依赖人工而导致效率低下的问题,研究并设计了一种基于Tamura方向度纹理特征的织物组织识别算法。该算法通过将Tamura纹理特征中的方向度、形态学运算以及高斯模糊有机结合,成功生成经纬组织点分布图以实现织物组织识别。通过计算织物组织图的Tamura方向度特征值提取了纹理信息,利用纹理信息结合数字图像处理技术获得组织点分布。实验证明,针对具有较强纹理信息的织物组织,特别是经纬纱线颜色相近的织物,该算法能够很好地实现识别效果。

道路选择问题的一种优化算法

市内交通的拥挤是广大市民深感头疼的大问题。为了缓解交通的拥挤状况,我们对其原因进行了调查、分析和研究,建立了城市交通路线选择问题的优化模型,并且给出了相应的算法.

基于四叉树复小波的自适应图像去噪

小波变换应用于图像去噪处理方面得到广泛的应用,但其自身也存在着一些缺点和不易控制因素,大大地限制了其图像去噪能力和应用的范围。而四叉树复小波变换很好地改善了这一缺点,具有较好的方向选择性和平移不变性,并且容易实现完全重构。本文通过对常见的图像去噪方法,对其原理进行解析,再讲解基于四叉树复小波的自适应图像去噪的优点和发展趋势,让大家对现代复小波自适应图像去噪有一个清晰的认识。

Bionic Mosaic Method of Panoramic Image Based on Compound Eye of Fly

To satisfy the requirements of real-time and high quality mosaics, a bionic compound eye visual system was designed by simulating the visual mechanism of a fly compound eye. Several CCD cameras were used in this system to imitate the small eyes of a compound eye. Based on the optical analysis of this system, a direct panoramic image mosaic algorithm was proposed. Several sub-images were collected by the bionic compound eye visual system, and then the system obtained the overlapping proportions of these sub-images and cut the overlap sections of the neighboring images. Thus, a panoramic image with a large field of view was directly mosaicked, which expanded the field and guaranteed the high resolution. The experimental results show that the time consumed by the direct mosaic algorithm is only 2.2% of that by the traditional image mosaic algorithm while guaranteeing mosaic quality. Furthermore, the proposed method effectively solved the problem of misalignment of the mosaic image and eliminated mosaic cracks as a result of the illumination factor and other factors. This method has better real-time properties compared to other methods.

Improved direct P code acquisition technique

P code direct acquisition is an important technology in satellite navigation system. As the P code has a long period, it is hard to directly acquire. The traditional average method can process multiple code phases in a time to shorten the acquisition time. But with the increase of average phase error of the input signal and the local code, the correlation signal-to-noise ratio （SNR） loss increases. To reduce the SNR loss, an improved average method is introduced. A new sequence is generated with a summation of phase shifting sequences to decrease correlation peak loss. Simulation results show that compared with direct average method, the improved average method effectively increases correlation SNR.

A Strong Subfeasible Directions Algorithm with Superlinear Convergence

This paper presents a strong subfeasible directions algorithm possessing superlinear convergence for inequality constrained optimization. The starting point of this algorithm may be arbitary and its feasibility is monotonically increasing. The search directions only depend on solving one quadratic proraming and its simple correction, its line search is simple straight search and does not depend on any penalty function. Under suit assumptions, the algorithm is proved to possess global and superlinear convergence.