Chun-Ming Yuan
Chinese Academy of Sciences
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Chun-Ming Yuan.
Journal of Systems Science & Complexity | 2008
Fengjuan Chai; Xiao-Shan Gao; Chun-Ming Yuan
This paper presents a characteristic set method for solving Boolean equations, which is more efficient and has better properties than the general characteristic set method. In particular, the authors give a disjoint and monic zero decomposition algorithm for the zero set of a Boolean equation system and an explicit formula for the number of solutions of a Boolean equation system. The authors also prove that a characteristic set can be computed with a polynomial number of multiplications of Boolean polynomials in terms of the number of variables. As experiments, the proposed method is used to solve equations from cryptanalysis of a class of stream ciphers based on nonlinear filter generators. Extensive experiments show that the method is quite effective.
international symposium on symbolic and algebraic computation | 2009
Miroslav Halás; Ülle Kotta; Ziming Li; Huaifu Wang; Chun-Ming Yuan
The paper describes an algebraic construction of the inversive difference field associated with a discrete-time rational nonlinear control system under the assumption that the system is submersive. We prove that a system is submersive iff its associated difference ideal is proper, prime and reflexive. Next, we show that Kähler differentials of the above inversive field define a module over the corresponding ring of Ore operators, and relate its torsion submodule to the vector space of autonomous one-forms, introduced elsewhere. The above results allow us to check accessibility property and simplify transfer functions with computer algebra techniques.
Science in China Series F: Information Sciences | 2011
Mei Zhang; Wei Yan; Chun-Ming Yuan; Dingkang Wang; Xiao-Shan Gao
In this paper, curve fitting of 3-D points generated by G01 codes and interpolation based on quadratic B-splines are studied. Feature points of G01 codes are selected using an adaptive method. Next, quadratic B-splines are obtained as the fitting curve by interpolating these feature points. Computations required in implementing the velocity planning algorithm mentioned by Timer et al. are very complicated because of the appearance of high-order curves. An improved time-optimal method for the quadratic B-spline curves is presented to circumvent this issue. The algorithms are verified with simulations as well as on real CNC machines.
Transactions of the American Mathematical Society | 2013
Xiao-Shan Gao; Wei Li; Chun-Ming Yuan
In this paper, an intersection theory for generic differential polynomials is presented. The intersection of an irreducible differential variety of dimension
Journal of Systems Science & Complexity | 2013
Chun-Ming Yuan; Ke Zhang; Wei Fan
d
Journal of Symbolic Computation | 2009
Xiao-Shan Gao; Yong Luo; Chun-Ming Yuan
and order
Journal of Symbolic Computation | 2009
Xiao-Shan Gao; J. Van der Hoeven; Chun-Ming Yuan; Gui-Lin Zhang
h
Computer-aided Design | 2015
Zhengyuan Yang; Li-Yong Shen; Chun-Ming Yuan; Xiao-Shan Gao
with a generic differential hypersurface of order
international symposium on symbolic and algebraic computation | 2011
Wei Li; Xiao-Shan Gao; Chun-Ming Yuan
s
Computer Aided Geometric Design | 2012
Li-Yong Shen; Chun-Ming Yuan; Xiao-Shan Gao
is shown to be an irreducible variety of dimension