期刊文献+
共找到1,000篇文章
< 1 2 50 >
每页显示 20 50 100
An improved arctangent algorithm based on phase-locked loop for heterodyne detection system 被引量:1
1
作者 Chun-Hui Yan Ting-Feng Wang +2 位作者 Yuan-Yang Li Tao Lv Shi-Song Wu 《Chinese Physics B》 SCIE EI CAS CSCD 2019年第3期141-148,共8页
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 approximati... 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. 展开更多
关键词 HETERODYNE detection LASER applications arctangent algorithm phase-locked loop
下载PDF
A Routing Algorithm for Distributed Optimal Double Loop Computer Networks
2
作者 Li Layuan(Department of Electrical Engineering and Computer Science.Wuhan University of Water Transportation, Wuhan 430063, P. R. China) 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 1994年第1期37-43,共7页
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 pr... 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. 展开更多
关键词 Computer networks Double loop Routing algorithm
下载PDF
Development and Comparison of Hybrid Genetic Algorithms for Network Design Problem in Closed Loop Supply Chain 被引量:1
3
作者 Muthusamy Aravendan Ramasamy Panneerselvam 《Intelligent Information Management》 2015年第6期313-338,共26页
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 algo... 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. 展开更多
关键词 CLOSED loop Supply CHAIN GENETIC algorithms HGA META-HEURISTICS MINLP Model Network Design Optimization
下载PDF
Loop细分曲面的优化拟合算法 被引量:2
4
作者 李登高 秦开怀 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2006年第6期755-759,共5页
提出一种用于构造给定三维模型的拟合Loop细分曲面的迭代优化算法,使得拟合曲面与原始模型之间的逼近误差最小·算法中的逼近误差定义为原始模型各面元到拟合曲面最小距离的积分·与Loop细分小波分解算法的比较表明,该算法以适... 提出一种用于构造给定三维模型的拟合Loop细分曲面的迭代优化算法,使得拟合曲面与原始模型之间的逼近误差最小·算法中的逼近误差定义为原始模型各面元到拟合曲面最小距离的积分·与Loop细分小波分解算法的比较表明,该算法以适度的运行时间代价得到了更优的结果·此外,该算法还可以加以推广,作为一类从输入模型生成其近似表示的优化算法的基础· 展开更多
关键词 loop细分曲面 曲面拟合 优化算法
下载PDF
基于LOOP细分曲面算法的三维裙装模型
5
作者 王湛 赵玉玲 《北京服装学院学报(自然科学版)》 CAS 北大核心 2009年第1期28-33,共6页
以虚拟现实技术作为展示平台,结合程序设计语言VC++,根据服装与人体关系及织物物理性能得到特征点,建立了三维裙装的基础模型.通过LOOP算法经过三次曲面细分,获得了具有真实感的裙装模型.最后通过虚拟现实技术,实现了实时交互展示.
关键词 服装CAD loop算法 细分曲面 三维裙装模型
下载PDF
Loop细分模型的边界拼接算法 被引量:4
6
作者 韩越兴 刘秀平 施锡泉 《大连理工大学学报》 EI CAS CSCD 北大核心 2004年第1期12-16,共5页
为解决细分曲面之间的光滑拼接问题,提出一种满足边界条件的Loop细分算法,利用此算法可以完成两个细分模型的拼接,使得两个细分模型在具有相同细分格式条件下的极限曲面可在拼接处达到C2连续,而在边界的奇异点处达到C1连续.
关键词 loop细分模型 边界拼接算法 细分曲面 边界条件 计算机图形学 光滑拼接
下载PDF
基于改进Loop细分的二维图像矢量化方法 被引量:2
7
作者 邓重阳 熊玉丹 +2 位作者 郑乐豪 曹晨妤 朱明超 《杭州电子科技大学学报(自然科学版)》 2020年第2期52-55,共4页
现有的矢量化方法得到的矢量图缩放不方便,为此,用改进的Loop细分方法实现二维图像矢量化。首先用Douglas-Peucker算法提取图像边界,然后用Delaunay三角剖分算法得到三角网格,最后用改进的Loop细分算法细分三角网格得到矢量图。细分时,... 现有的矢量化方法得到的矢量图缩放不方便,为此,用改进的Loop细分方法实现二维图像矢量化。首先用Douglas-Peucker算法提取图像边界,然后用Delaunay三角剖分算法得到三角网格,最后用改进的Loop细分算法细分三角网格得到矢量图。细分时,对三角网格顶点进行线性细分,对顶点的像素值进行Loop细分,同时,在原有Loop细分规则的基础上,修改网格边界上的三角形内部新点生成规则。实验结果表明:提出的矢量化方法得到的矢量图缩放较为方便。 展开更多
关键词 图像矢量化 DOUGLAS-PEUCKER算法 DELAUNAY三角剖分 线性细分 loop细分
下载PDF
基于边光滑度的Loop自适应细分曲面算法
8
作者 吴元翠 《电脑知识与技术》 2013年第5期3142-3145,共4页
首先研究了传统的Loop细分曲面算法,通过分析发现随着细分次数的增多细分算法中三角形网格片数增长过快。针对这一问题提出一种自适应细分曲面算法。算法根据相邻两个三角形面上的法向量的夹角,判断细分网格中较为光滑和非光滑的区域。... 首先研究了传统的Loop细分曲面算法,通过分析发现随着细分次数的增多细分算法中三角形网格片数增长过快。针对这一问题提出一种自适应细分曲面算法。算法根据相邻两个三角形面上的法向量的夹角,判断细分网格中较为光滑和非光滑的区域。实验结果表明,算法提高了数据处理速度,并且模型简单易实现。 展开更多
关键词 细分曲面 loop细分 自适应细分
下载PDF
Open-closed Loop ILC Corrected with Angle Relationship of Output Vectors for Tracking Control of Manipulator 被引量:8
9
作者 WANG Hong-Bin WANG Yan 《自动化学报》 EI CSCD 北大核心 2010年第12期1758-1765,共8页
关键词 ILC 自动化 跟踪控制 仿真
下载PDF
OPTIMAL ALGORITHM FOR NO TOOl-RETRACTIONS CONTOUR-PARALLEL OFFSET TOOL-PATH LINKING 被引量:8
10
作者 HAO Yongtao JIANG Lili 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2007年第2期21-25,共5页
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 th... 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. 展开更多
关键词 Contour-parallel offset machining Tool-path loops Tool-path loop tree Optimal algorithm
下载PDF
基于Loop细分的自适应细分曲面算法
11
作者 吴元翠 《井冈山大学学报(自然科学版)》 2013年第5期41-44,共4页
首先研究了传统的Loop细分曲面算法,通过分析发现随着细分次数的增多细分算法中三角形网格片数增长过快。针对这一问题提出一种自适应细分曲面算法。算法根据相邻两个三角形面上的法向量的夹角,判断细分网格中较为光滑和非光滑的区域。... 首先研究了传统的Loop细分曲面算法,通过分析发现随着细分次数的增多细分算法中三角形网格片数增长过快。针对这一问题提出一种自适应细分曲面算法。算法根据相邻两个三角形面上的法向量的夹角,判断细分网格中较为光滑和非光滑的区域。实验结果表明,算法提高了数据处理速度,并且模型简单易实现。 展开更多
关键词 细分曲面 loop细分 自适应细分
下载PDF
基于Loop细分算法的曲面边界控制及曲面拼接
12
作者 韩越兴 刘秀平 《合肥工业大学学报(自然科学版)》 CAS CSCD 北大核心 2012年第12期1719-1724,共6页
文章提出了3种算法实现边界点不全在边界条件多边形上的满足边界条件的Loop细分,利用这些算法,能控制曲面的边界曲线的形状;在此基础上,提出了基于Loop细分的2个曲面的拼接算法,拼接后的曲面能在非特殊点处达到C2连续,在特殊点处C1连续... 文章提出了3种算法实现边界点不全在边界条件多边形上的满足边界条件的Loop细分,利用这些算法,能控制曲面的边界曲线的形状;在此基础上,提出了基于Loop细分的2个曲面的拼接算法,拼接后的曲面能在非特殊点处达到C2连续,在特殊点处C1连续;应用所提出的算法不仅可以对细分曲面进行拼接,还能对残缺的曲面进行修补,使之能够产生光滑的曲面。 展开更多
关键词 细分曲面 边界条件 loop细分 拼接算法 曲面造型
下载PDF
Monte Carlo study of the universal area distribution of clusters in the honeycomb O(n) loop model 被引量:1
13
作者 许亚东 刘清泉 邓友金 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第7期80-84,共5页
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 a... 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. 展开更多
关键词 worm algorithm O(n) loop model UNIVERSALITY Coulomb gas method
下载PDF
Literature Review on Network Design Problems in Closed Loop and Reverse Supply Chains 被引量:1
14
作者 Muthusamy Aravendan Ramasamy Panneerselvam 《Intelligent Information Management》 2014年第3期104-117,共14页
The productivity of an organization is very much affected by non-value adding activity like logistics, which moves the resources from suppliers to factory, raw materials/semi-finished items within the factory and fini... The productivity of an organization is very much affected by non-value adding activity like logistics, which moves the resources from suppliers to factory, raw materials/semi-finished items within the factory and finished goods from factory to customers via a designated distribution channel called as forward logistics. In some cases, parts of the products such as automobiles, computers, cameras, mobile phones, washing machines, refrigerators, garments, footwear and empty glass bottles of beverages, etc. will be brought back to the factories as a product recovery strategy through reverse logistics network which is integrated in a sustainable closed loop supply chain network. So, it is highly essential to optimize the movement of the items in the reverse logistics network. This paper gives a comprehensive review of literature of the design of networks for the reverse logistics as well as for the reverse logistics coupled with forward logistics. The contributions of the researchers are classified into nine categories based on the methods used to design the logistics network. 展开更多
关键词 Supply CHAIN Network Design CLOSED-loop REVERSE LOGISTICS Models HEURISTICS algorithms
下载PDF
Formal Calculation and Invariant-Based Validation Establish Dependable Algorithmic Programs
15
作者 郑宇军 石海鹤 +1 位作者 薛锦云 陈胜勇 《China Communications》 SCIE CSCD 2011年第4期58-64,共7页
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 subproblem... 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. 展开更多
关键词 FORMAL methods algorithm CALCULATION loop INVARIANTS program VALIDATION
下载PDF
ON THE FAULT-TOLERANT ROUTING IN DISTRIBUTED LOOP NETWORKS
16
作者 Liu Huanping Yang Yixian (Po Box 126, Dept. of Inform. Eng., Beijing Univ. of Posts and Telecomm., Beijing 100876) 《Journal of Electronics(China)》 2000年第1期84-89,共6页
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, ... 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. 展开更多
关键词 DOUBLE loop NETWORKS Shortest PATH ROUTING algorithm
下载PDF
基于非线性修饰和零阶保持器的船舶航向保持控制 被引量:1
17
作者 张显库 洪皓辰 《中国舰船研究》 CSCD 北大核心 2024年第1期84-89,共6页
[目的]为了解决船舶在海上航行时控制器舵角输出大、打舵频率高、控制速度较慢以及控制精度较低的问题,利用三阶闭环增益成形算法设计鲁棒控制器。[方法]首先,利用三阶闭环增益成形算法设计出线性鲁棒控制器,然后,在控制策略中加入双曲... [目的]为了解决船舶在海上航行时控制器舵角输出大、打舵频率高、控制速度较慢以及控制精度较低的问题,利用三阶闭环增益成形算法设计鲁棒控制器。[方法]首先,利用三阶闭环增益成形算法设计出线性鲁棒控制器,然后,在控制策略中加入双曲正切非线性修饰以及零阶保持器,在不同海况下对该控制器的性能进行仿真实验。[结果]仿真结果表明,相比于基于非线性修饰的传统PID控制器,在一般海况下,所提控制器在延迟时间、控制精度以及能量输出上分别改进了36%,14%和32%;在恶劣海况下,分别改进了27%,7%和16%。此外,不同海况下该控制器的仿真结果都具有稳定的舵角输出,并可以较快地稳定在临界值附近,证明了其具有较好的鲁棒性。[结论]改进的控制器符合工程实践,对于智能船舶的控制具有较好的应用参考价值。 展开更多
关键词 闭环增益成形算法 零阶保持器 非线性修饰 航向保持控制 航海
下载PDF
Study on Optimal Topology for Computer Local Double Loop Networks
18
作者 Li LayuanWuhan University of Water Transportation Engineering, Wuhan 430063, P.R.China 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 1992年第4期37-52,共16页
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 definition... 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. 展开更多
关键词 Local networks loop networks Optimal topology Distributed routing algorithm.
下载PDF
Noise Reduction for Digital Communications—The Masterpiece, a Modified Costas Loop
19
作者 János Ladvánszky 《Circuits and Systems》 2020年第6期57-64,共8页
An efficient way of noise reduction has been presented: A modified Costas loop called as Masterpiece. The basic version of the Costas loop has been developed for SSB SC demodulation, but the same circuit can be applie... An efficient way of noise reduction has been presented: A modified Costas loop called as Masterpiece. The basic version of the Costas loop has been developed for SSB SC demodulation, but the same circuit can be applied for QAM (quadrature amplitude modulation) demodulation as well. Noise sensitivity of the basic version has been decreased. One trick is the transformation of the real channel input into complex signal, the other one is the application of our folding algorithm. The result is that the Masterpiece provides a 4QAM symbol error rate (SER) of 6 × 10<sup><span style="white-space:nowrap;">&#8722;</span>4</sup> for input signal to noise ratio (SNR) of <span style="white-space:nowrap;">&#8722;</span>1 dB. In this paper, an improved version of the original Masterpiece is introduced. The complex channel input signal is normalized, and rotational average is applied. The 4QAM result is SER of 3 × 10<sup><span style="white-space:nowrap;">&#8722;</span>4</sup> for SNR of <span style="white-space:nowrap;">&#8722;</span>1 dB. At SNR of 0 dB, the improved version produces 100 times better SER than that the original Costas loop does. In our times, this topic has a special importance because by application of our Masterpiece, all dangerous field strengths from 5G and WiFi, could be decreased by orders of magnitude. The Masterpiece can break the Shannon formula. 展开更多
关键词 Noise Symbol Error Rate QAM Costas loop Hilbert Filter Folding algorithm
下载PDF
Stability and Robustness Analysis of an Adaptive Algorithm for Quasi-periodic Disturbances Rejection
20
作者 徐昱琳 张五一 杨向萍 《Journal of Donghua University(English Edition)》 EI CAS 2004年第6期49-53,共5页
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 ... 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. 展开更多
关键词 QUASI-PERIODIC DISTURBANCE rejection web WINDING systems adaptive algorithm phase-locked loop STABILITY and robustness analysis
下载PDF
上一页 1 2 50 下一页 到第
使用帮助 返回顶部