An improved arctangent algorithm based on phase-locked loop for heterodyne detection system

We present an ameliorated arctangent algorithm based on phase-locked loop for digital Doppler signal processing,utilized within the heterodyne detection system. We define the error gain factor given by the approximation of Taylor expansion by means of a comparison of the measured values and true values. Exact expressions are derived for the amplitude error of two in-phase & quadrature signals and the frequency error of the acousto-optic modulator. Numerical simulation results and experimental results make it clear that the dynamic instability of the intermediate frequency signals leads to cumulative errors, which will spiral upward. An improved arctangent algorithm for the heterodyne detection is proposed to eliminate the cumulative errors and harmonic components. Depending on the narrow-band filter, our experiments were performed to realize the detectable displacement of 20 nm at a detection distance of 20 m. The aim of this paper is the demonstration of the optimized arctangent algorithm as a powerful approach to the demodulation algorithm, which will advance the signal-to-noise ratio and measurement accuracy of the heterodyne detection system.

Development and Comparison of Hybrid Genetic Algorithms for Network Design Problem in Closed Loop Supply Chain

This paper presents four different hybrid genetic algorithms for network design problem in closed loop supply chain. They are compared using a complete factorial experiment with two factors, viz. problem size and algorithm. Based on the significance of the factor “algorithm”, the best algorithm is identified using Duncan’s multiple range test. Then it is compared with a mathematical model in terms of total cost. It is found that the best hybrid genetic algorithm identified gives results on par with the mathematical model in statistical terms. So, the best algorithm out of four algorithm proposed in this paper is proved to be superior to all other algorithms for all sizes of problems and its performance is equal to that of the mathematical model for small size and medium size problems.

A Routing Algorithm for Distributed Optimal Double Loop Computer Networks

A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links.

Scott-Hinsley回路法在公路隧道平导半横向式通风计算中的应用

将Scott-Hinsley回路法应用到平导半横向通风方式的解算中,以图论为基础,以风流运动的基本定律为依据,利用Gauss-Seidel迭代逐次求解回路修正风量,直到获得接近方程组真实解的渐进风量.针对公路隧道通风系统的特点在回路中考虑了交通风压的作用,并编制了相应的可视化解算程序.工程计算结果表明,Scott-Hinsley回路法能很好地解决平导半横向式通风计算问题,并可迅速、准确地实现横通道的风量和风阻的反复动态调节计算.

Loop细分曲面的优化拟合算法

提出一种用于构造给定三维模型的拟合Loop细分曲面的迭代优化算法,使得拟合曲面与原始模型之间的逼近误差最小·算法中的逼近误差定义为原始模型各面元到拟合曲面最小距离的积分·与Loop细分小波分解算法的比较表明,该算法以适度的运行时间代价得到了更优的结果·此外,该算法还可以加以推广,作为一类从输入模型生成其近似表示的优化算法的基础·

基于改进Loop细分的二维图像矢量化方法

现有的矢量化方法得到的矢量图缩放不方便,为此,用改进的Loop细分方法实现二维图像矢量化。首先用Douglas-Peucker算法提取图像边界,然后用Delaunay三角剖分算法得到三角网格,最后用改进的Loop细分算法细分三角网格得到矢量图。细分时,对三角网格顶点进行线性细分,对顶点的像素值进行Loop细分,同时,在原有Loop细分规则的基础上,修改网格边界上的三角形内部新点生成规则。实验结果表明:提出的矢量化方法得到的矢量图缩放较为方便。

基于LOOP细分曲面算法的三维裙装模型

以虚拟现实技术作为展示平台,结合程序设计语言VC++,根据服装与人体关系及织物物理性能得到特征点,建立了三维裙装的基础模型.通过LOOP算法经过三次曲面细分,获得了具有真实感的裙装模型.最后通过虚拟现实技术,实现了实时交互展示.

Loop细分模型的边界拼接算法

为解决细分曲面之间的光滑拼接问题,提出一种满足边界条件的Loop细分算法,利用此算法可以完成两个细分模型的拼接,使得两个细分模型在具有相同细分格式条件下的极限曲面可在拼接处达到C2连续,而在边界的奇异点处达到C1连续.

基于边光滑度的Loop自适应细分曲面算法

首先研究了传统的Loop细分曲面算法,通过分析发现随着细分次数的增多细分算法中三角形网格片数增长过快。针对这一问题提出一种自适应细分曲面算法。算法根据相邻两个三角形面上的法向量的夹角,判断细分网格中较为光滑和非光滑的区域。实验结果表明,算法提高了数据处理速度,并且模型简单易实现。

基于Loop细分的自适应细分曲面算法

首先研究了传统的Loop细分曲面算法,通过分析发现随着细分次数的增多细分算法中三角形网格片数增长过快。针对这一问题提出一种自适应细分曲面算法。算法根据相邻两个三角形面上的法向量的夹角,判断细分网格中较为光滑和非光滑的区域。实验结果表明,算法提高了数据处理速度,并且模型简单易实现。

OPTIMAL ALGORITHM FOR NO TOOl-RETRACTIONS CONTOUR-PARALLEL OFFSET TOOL-PATH LINKING

A contour-parallel offset （CPO） tool-path linking algorithm is derived without toolretractions and with the largest practicability. The concept of ＂tool-path loop tree＂ （TPL-tree） providing the information on the parent/child relationships among the tool-path loops （TPLs） is presented. The direction, tool-path loop, leaf/branch, layer number, and the corresponding points of the TPL-tree are introduced. By defining TPL as a vector, and by traveling throughout the tree, a CPO tool-path without tool-retractions can be derived.

Multi-objective optimization of operation loop recommendation for kill web

In order to improve our military ’s level of intelligent accusation decision-making in future intelligent joint warfare, this paper studies operation loop recommendation methods for kill web based on the fundamental combat form of the future, i.e.,“web-based kill,” and the operation loop theory. Firstly, we pioneer the operation loop recommendation problem with operation ring quality as the objective and closed-loop time as the constraint, and construct the corresponding planning model.Secondly, considering the case where there are multiple decision objectives for the combat ring recommendation problem,we propose for the first time a multi-objective optimization algorithm, the multi-objective ant colony evolutionary algorithm based on decomposition(MOACEA/D), which integrates the multi-objective evolutionary algorithm based on decomposition(MOEA/D) with the ant colony algorithm. The MOACEA/D can converge the optimal solutions of multiple single objectives nondominated solution set for the multi-objective problem. Finally,compared with other classical multi-objective optimization algorithms, the MOACEA/D is superior to other algorithms superior in terms of the hyper volume(HV), which verifies the effectiveness of the method and greatly improves the quality and efficiency of commanders’ decision-making.

Monte Carlo study of the universal area distribution of clusters in the honeycomb O(n) loop model

We investigate the area distribution of clusters （loops） in the honeycomb O（n） loop model by means of the worm algorithm with n = 0.5, 1, 1.5, and 2. At the critical point, the number of clusters, whose enclosed area is greater than A, is proportional to A-1 with a proportionality constant C. We confirm numerically that C is universal, and its value agrees well with the predictions based on the Coulomb gas method.

基于Loop细分算法的曲面边界控制及曲面拼接

文章提出了3种算法实现边界点不全在边界条件多边形上的满足边界条件的Loop细分,利用这些算法,能控制曲面的边界曲线的形状;在此基础上,提出了基于Loop细分的2个曲面的拼接算法,拼接后的曲面能在非特殊点处达到C2连续,在特殊点处C1连续;应用所提出的算法不仅可以对细分曲面进行拼接,还能对残缺的曲面进行修补,使之能够产生光滑的曲面。

A review of closed-loop reservoir management

The closed-loop reservoir management technique enables a dynamic and real-time optimal production schedule under the existing reservoir conditions to be achieved by adjusting the injection and production strategies. This is one of the most effective ways to exploit limited oil reserves more economically and efficiently. There are two steps in closed-loop reservoir management： automatic history matching and reservoir production opti- mization. Both of the steps are large-scale complicated optimization problems. This paper gives a general review of the two basic techniques in closed-loop reservoir man- agement; summarizes the applications of gradient-based algorithms, gradient-free algorithms, and artificial intelligence algorithms; analyzes the characteristics and application conditions of these optimization methods; and finally discusses the emphases and directions of future research on both automatic history matching and reservoir production optimization.

Formal Calculation and Invariant-Based Validation Establish Dependable Algorithmic Programs

The paper presents a formal and practical approach to dependable algorithm development.First,starting from a formal specification based on the Eindhoven quantifier notation,a problem is regularly reduced to subproblems with less complexity by using a concise set of calculation rules,the result of which establishes a recurrence-based algorithm.Second,a loop invariant is derived from the problem specification and recurrence,which certifies the transformation from the recurrence-based algorithm to one or more iterative programs.We demonstrate that our approach covers a number of classical algorithm design tactics,develops algorithmic programs together with their proof of correctness,and thus contributes fundamentally to the dependability of computer software.

ON THE FAULT-TOLERANT ROUTING IN DISTRIBUTED LOOP NETWORKS

Based on their "Theorem 2", an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, it will be proved that both "Theorem 2" and its proof are in error. A new and more faster O(△)-time, △≤δ, algorithm will be presented in this paper.

Study on Optimal Topology for Computer Local Double Loop Networks

A dist ributed optimal local double loop (DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter d and average hop distance a for this class of networks are [3N- 2]≤d≤[3N ] and (5N/9 (N-1))-(3N -1.8)<a<(5N/9(N-1)) (3N -0.9),respectively (N is the number of nodes in the network ). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed and analyzed. The correctness of the algorithm has also been verified by simulating.

Stability and Robustness Analysis of an Adaptive Algorithm for Quasi-periodic Disturbances Rejection

Winding and web transport systems are subjected to quasi-periodic disturbances of the web tension due to the eccentricity and the non-circularity of the reel and rolls. The disturbances induced by the non-circularity and eccentricity of the rolls are quasi-periodic with a frequency that varies with their rotation speed. An adaptive method of rejection of these disturbances is proposed in this paper. It is based on a phase-locked loop structure that estimates simutaneously the phase and magnitude of the perturbation and then cancels it. This algorithm can be plugged in an existing industrial controller. The stability and robustness of the algorithm are also discussed. The ability of the algorithm to reject quasi-periodic disturbances with slowly varying frequencies is shown through simulation results.