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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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;">−</span>4</sup> for input signal to noise ratio (SNR) of <span style="white-space:nowrap;">−</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;">−</span>4</sup> for SNR of <span style="white-space:nowrap;">−</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.展开更多
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.展开更多
基金supported by Key Research Program of Frontier Science,Chinese Academy of Sciences(Grant No.QYZDB-SSW-SLH014)the Yong Scientists Fund of the National Natural Science Foundation of China(Grant No.61205143)
文摘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.
文摘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.
文摘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 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.
基金Project supported by the National Natural Science Foundation of China (Grant No. 10975127)the Specialized Research Fund for the Doctoral Program of Higher Education, China (Grant No. 20113402110040)
文摘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.
文摘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.
基金National Natural Science Foundation of China under Grant No. 60773054,60870002 and 61020106009Zhejiang Provincial Natural Science Foundation of China under Grant No. R1110679
文摘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.
基金Supported by the National Natural Science Foundation of China(No.69772035)
文摘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.
文摘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.
文摘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;">−</span>4</sup> for input signal to noise ratio (SNR) of <span style="white-space:nowrap;">−</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;">−</span>4</sup> for SNR of <span style="white-space:nowrap;">−</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.
文摘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.