A new method for solving the tiling problem of surface reconstruction is proposed. The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman＇...A new method for solving the tiling problem of surface reconstruction is proposed. The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman＇ s code. Symbolic string matching technique is applied to establish a correspondence between the two consecutive contours. The surface is composed of the pieces reconstructed from the correspondence points. Experimental results show that the proposed method exhibits a good behavior for the quality of surface reconstruction and its time complexity is proportional to mn where m and n are the numbers of vertices of the two consecutive slices, respectively.展开更多
It is important to achieve continuous, stable and efficient pumping well operation in actual oilfield operation. Down-hole pumping well working conditions can be monitored in real-time and a reasonable production sche...It is important to achieve continuous, stable and efficient pumping well operation in actual oilfield operation. Down-hole pumping well working conditions can be monitored in real-time and a reasonable production scheme can be designed when computer diagnosis is used. However, it is difficult to make a comprehensive analysis to supply efficient technical guidance for operation of the pumping well with multiple faults of down-hole conditions, which cannot be effectively dealt with by the common methods. To solve this problem, a method based on designated component analysis （DCA） is used in this paper. Freeman chain code is used to represent the down-hole dynamometer card whose important characteristics are extracted to construct a designated mode set. A control chart is used as a basis for fault detection. The upper and lower control lines on the control chart are determined from standard samples in normal working conditions. In an incompletely orthogonal mode, the designated mode set could be divided into some subsets in which the modes are completely orthogonal. The observed data is projected into each designated mode to realize fault detection according to the upper and lower control lines. The examples show that the proposed method can effectively diagnose multiple faults of down-hole conditions.展开更多
Face recognition is an active area of biometrics. This study investigates the use of Chain Codes as features for recognition purpose. Firstly a segmentation method, based on skin color model was applied, followed by c...Face recognition is an active area of biometrics. This study investigates the use of Chain Codes as features for recognition purpose. Firstly a segmentation method, based on skin color model was applied, followed by contour detection, then the chain codes of the contours were determined. The first difference of chain codes were calculated since the latter is invariant to rotation. The features were calculated and stored in a matrix. Experiments were performed using the University of Essex Face database, and results show a recognition rate of 95% with this method, when compared with Principal Components Analysis (PCA) giving 87.5% recognition rate.展开更多
Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual perm...Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.展开更多
For at least the past five decades,structural synthesis has been used as a main means of finding better mechanisms with some predefined function.In structural synthesis,isomorphism identification is still a problem un...For at least the past five decades,structural synthesis has been used as a main means of finding better mechanisms with some predefined function.In structural synthesis,isomorphism identification is still a problem unsolved well,and to solve this problem is very significant to the design of new mechanisms.According to the given degree of freedom（DOF） and link connection property of planar closed chain mechanisms,vertex assortment is obtained.For solving the isomorphism problem,a method of the adding sub-chains is proposed with the detailed steps and algorithms in the synthesizing process.Employing this method,the identification code and formation code of every topological structure are achieved,therefore many isomorphic structures could be eliminated in time during structural synthesis by comparing those codes among different topological graphs,resulting in the improvement of synthesizing efficiency and accuracy,and the approach for eliminating rigid sub-chains in and after the synthesizing process is also presented.Some examples are given,including how to add sub-chains,how to detect simple rigid sub-chains and how to obtain identification codes and formulation codes et al.Using the adding sub-chain method,the relative information of some common topological graphs is given in the form of table.The comparison result is coincident with many literatures,so the correctness of the adding sub-chain method is convinced.This method will greatly improve the synthesizing efficiency and accuracy,and has a good potential for application.展开更多
In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes...In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.展开更多
In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese...In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.展开更多
Network Coding (NC) is confirmed to be power and bandwidth efficient technique, because of the less number of transmitted packets over the network. Wireless Sensor Network (WSN) is usually power limited network applic...Network Coding (NC) is confirmed to be power and bandwidth efficient technique, because of the less number of transmitted packets over the network. Wireless Sensor Network (WSN) is usually power limited network application, and in many scenarios it is power and bandwidth limited application. The proposed scenario in this paper applies the advantages of NC over WSN to obtain such power and bandwidth efficient WSN. To take the advantages of NC over the one of the most needed applications i.e., WSN, we come up to what this paper is discussing. We consider a WSN (or its cluster) that consists of M nodes that transmit equal-length information packets to a common destination node D over wireless Rayleigh block-fading channel where the instantaneous SNR is assumed to be constant over a single packet transmission period. Finite-State packet level Markov chain (FSMC) model is applied to give the channel more practical aspect. The simulation results showed that applying NC over the WSN cluster improved the channel bandwidth significantly by decreasing the number of the Automatic Repeat Request (ARQ), resulting in improving the power consumption significantly. The results are collected for different transmission distances to evaluate the behavior to the proposed scenario with regard to the bath losses effect.展开更多
In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
Let R be a finite chain ring with maximal ideal （7） and residue field F,and letγ be of nilpotency index t. To every code C of length n over R, a tower of codes C = （C ： γ0） C_ （C： 7） C ... C_ （C： γ2） C_ ...Let R be a finite chain ring with maximal ideal （7） and residue field F,and letγ be of nilpotency index t. To every code C of length n over R, a tower of codes C = （C ： γ0） C_ （C： 7） C ... C_ （C： γ2） C_ .-. C_ （C：γ^t-1） can be associated with C, where for any r C R, （C ： r） = {e C Rn I re E C}. Using generator elements of the projection of such a tower of codes to the residue field F, we characterize cyclic codes over R. This characterization turns the condition for codes over R to be cyclic into one for codes over the residue field F. Furthermore, we obtain a characterization of cyclic codes over the formal power series ring of a finite chain ring.展开更多
大语言模型因其出色的理解和生成能力被广泛应用于自动化智能助手的开发。然而,它们在处理复杂问题时,常因训练数据庞杂等局限性而难以调用正确的工具和生成准确的函数名称及参数。为了提高在对复杂问题进行任务规划时模型生成工具调用...大语言模型因其出色的理解和生成能力被广泛应用于自动化智能助手的开发。然而,它们在处理复杂问题时,常因训练数据庞杂等局限性而难以调用正确的工具和生成准确的函数名称及参数。为了提高在对复杂问题进行任务规划时模型生成工具调用的准确性,提出一种基于思维链的提示方法—思维代码(Reasoning to Annotation and Coding,ReACo),充分利用预训练的数据,通过代码和注释结合的任务规划提示方式增强语言模型对复杂任务的理解能力,并基于此提出一种新的大语言模型思维提示框架ReACoGPT。基于ReACoGPT提示的语言模型能够准确调用多个插件,依据事实提供富有逻辑的任务规划能力,从而在保持任务规划逻辑性的同时准确使用需求的真实数据。实验结果表明,相较于现有方法,ReACoGPT在RestBench数据集上的正确率、正确路径率及解决长度等多项指标得到提高,证实了ReACo提示方式能够增强大语言模型的规划和推理能力,有效利用大量训练数据对任务进行有效规划,促进了大语言模型在工具学习方面的进一步发展。展开更多
文摘A new method for solving the tiling problem of surface reconstruction is proposed. The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman＇ s code. Symbolic string matching technique is applied to establish a correspondence between the two consecutive contours. The surface is composed of the pieces reconstructed from the correspondence points. Experimental results show that the proposed method exhibits a good behavior for the quality of surface reconstruction and its time complexity is proportional to mn where m and n are the numbers of vertices of the two consecutive slices, respectively.
基金supported by the Key Program of National Natural Science Foundation of China (61034005)Postgraduate Scientific Research and Innovation Projects of Basic Scientific Research Operating Expensesof Ministry of Education (N100604001)Excellent Doctoral Dissertations Cultivation Project of Northeastern University
文摘It is important to achieve continuous, stable and efficient pumping well operation in actual oilfield operation. Down-hole pumping well working conditions can be monitored in real-time and a reasonable production scheme can be designed when computer diagnosis is used. However, it is difficult to make a comprehensive analysis to supply efficient technical guidance for operation of the pumping well with multiple faults of down-hole conditions, which cannot be effectively dealt with by the common methods. To solve this problem, a method based on designated component analysis （DCA） is used in this paper. Freeman chain code is used to represent the down-hole dynamometer card whose important characteristics are extracted to construct a designated mode set. A control chart is used as a basis for fault detection. The upper and lower control lines on the control chart are determined from standard samples in normal working conditions. In an incompletely orthogonal mode, the designated mode set could be divided into some subsets in which the modes are completely orthogonal. The observed data is projected into each designated mode to realize fault detection according to the upper and lower control lines. The examples show that the proposed method can effectively diagnose multiple faults of down-hole conditions.
文摘Face recognition is an active area of biometrics. This study investigates the use of Chain Codes as features for recognition purpose. Firstly a segmentation method, based on skin color model was applied, followed by contour detection, then the chain codes of the contours were determined. The first difference of chain codes were calculated since the latter is invariant to rotation. The features were calculated and stored in a matrix. Experiments were performed using the University of Essex Face database, and results show a recognition rate of 95% with this method, when compared with Principal Components Analysis (PCA) giving 87.5% recognition rate.
基金Supported by the National Natural Science Foundation of China (60373087, 60473023, 90104005, 60673071)
文摘Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.
基金supported by National Natural Science Foundation of China (Grant No. 51075079)National Hi-tech Research and Development Program of China(863 Program,Grant No. 2008AA04Z202)
文摘For at least the past five decades,structural synthesis has been used as a main means of finding better mechanisms with some predefined function.In structural synthesis,isomorphism identification is still a problem unsolved well,and to solve this problem is very significant to the design of new mechanisms.According to the given degree of freedom（DOF） and link connection property of planar closed chain mechanisms,vertex assortment is obtained.For solving the isomorphism problem,a method of the adding sub-chains is proposed with the detailed steps and algorithms in the synthesizing process.Employing this method,the identification code and formation code of every topological structure are achieved,therefore many isomorphic structures could be eliminated in time during structural synthesis by comparing those codes among different topological graphs,resulting in the improvement of synthesizing efficiency and accuracy,and the approach for eliminating rigid sub-chains in and after the synthesizing process is also presented.Some examples are given,including how to add sub-chains,how to detect simple rigid sub-chains and how to obtain identification codes and formulation codes et al.Using the adding sub-chain method,the relative information of some common topological graphs is given in the form of table.The comparison result is coincident with many literatures,so the correctness of the adding sub-chain method is convinced.This method will greatly improve the synthesizing efficiency and accuracy,and has a good potential for application.
基金supported by SRF for ROCS,SEM,the Key Project of Chinese Ministry of Education (108099)CCNU Project (CCNU09Y01003)
文摘In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.
基金supported by the Natural ScienceFoundation of Hubei Province(D2014401)the Natural Science Foundation of Hubei Polytechnic University(12xjz14A)
文摘In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.
文摘Network Coding (NC) is confirmed to be power and bandwidth efficient technique, because of the less number of transmitted packets over the network. Wireless Sensor Network (WSN) is usually power limited network application, and in many scenarios it is power and bandwidth limited application. The proposed scenario in this paper applies the advantages of NC over WSN to obtain such power and bandwidth efficient WSN. To take the advantages of NC over the one of the most needed applications i.e., WSN, we come up to what this paper is discussing. We consider a WSN (or its cluster) that consists of M nodes that transmit equal-length information packets to a common destination node D over wireless Rayleigh block-fading channel where the instantaneous SNR is assumed to be constant over a single packet transmission period. Finite-State packet level Markov chain (FSMC) model is applied to give the channel more practical aspect. The simulation results showed that applying NC over the WSN cluster improved the channel bandwidth significantly by decreasing the number of the Automatic Repeat Request (ARQ), resulting in improving the power consumption significantly. The results are collected for different transmission distances to evaluate the behavior to the proposed scenario with regard to the bath losses effect.
基金supported in part by the National Science Foundation of China under Grant 11571005in part by the Key Research Project of Higher Education of the Education Department of Henan Province under Grant 19A120010
文摘In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
基金supported by the Natural Science Foundation of Hubei Province (B20114410)the Natural Science Foundation of Hubei Polytechnic University (12xjz14A)
文摘Let R be a finite chain ring with maximal ideal （7） and residue field F,and letγ be of nilpotency index t. To every code C of length n over R, a tower of codes C = （C ： γ0） C_ （C： 7） C ... C_ （C： γ2） C_ .-. C_ （C：γ^t-1） can be associated with C, where for any r C R, （C ： r） = {e C Rn I re E C}. Using generator elements of the projection of such a tower of codes to the residue field F, we characterize cyclic codes over R. This characterization turns the condition for codes over R to be cyclic into one for codes over the residue field F. Furthermore, we obtain a characterization of cyclic codes over the formal power series ring of a finite chain ring.
文摘大语言模型因其出色的理解和生成能力被广泛应用于自动化智能助手的开发。然而,它们在处理复杂问题时,常因训练数据庞杂等局限性而难以调用正确的工具和生成准确的函数名称及参数。为了提高在对复杂问题进行任务规划时模型生成工具调用的准确性,提出一种基于思维链的提示方法—思维代码(Reasoning to Annotation and Coding,ReACo),充分利用预训练的数据,通过代码和注释结合的任务规划提示方式增强语言模型对复杂任务的理解能力,并基于此提出一种新的大语言模型思维提示框架ReACoGPT。基于ReACoGPT提示的语言模型能够准确调用多个插件,依据事实提供富有逻辑的任务规划能力,从而在保持任务规划逻辑性的同时准确使用需求的真实数据。实验结果表明,相较于现有方法,ReACoGPT在RestBench数据集上的正确率、正确路径率及解决长度等多项指标得到提高,证实了ReACo提示方式能够增强大语言模型的规划和推理能力,有效利用大量训练数据对任务进行有效规划,促进了大语言模型在工具学习方面的进一步发展。
