This paper introduces a method of parameter estimation working on errors-in-variables polynomial non-linear models in which all measurements are corrupted by noise. The first step is to develop the linear regression models which are equivalent to polynomial non-linear systems. A main idea is to extend the parameter vector by even-order components of noise and to augment the regression vector by...

Abstract We use derivatives to prove the equivalences between MacWilliams identity and its four equivalent forms, and present new interpretations for the four equivalent forms. Our results explicitly give out the relationships between MacWilliams identity and its four equivalent forms.

Recently, single linear induction motor(SLIM), which comes from rotary induction motor(RIM), has been widely applied in transportation systems, especially in intermediate speed arrange, because of its merits, such as ability to exert thrust on the secondary without mechanical contacts, high acceleration or deceleration, less wear of the wheels, smaller turn circle radius and more flexible road ...

The notion of linear finite transducer (LFT) plays a crucial role in a family of cryptosystems introduced in the 80’s and 90’s. However, as far as we know, no study was ever conducted to count and enumerate these transducers, which is essential to verify if the size of the key space, of the aforementioned systems, is large enough to prevent a exhaustive search attack. In this paper, we determin...

The notion of linear finite transducer (LFT) plays a crucial role in a family of cryptosystems introduced in the 80’s and 90’s. However, as far as we know, no study was ever conducted to count and enumerate these transducers, which is essential to verify if the size of the key space, of the aforementioned systems, is large enough to prevent an exhaustive search attack. In this paper, we determi...

It is shown that the minimal coupling method is equivalent to the Huttner-Barnet and phenomenological approaches up to a canonical transformation.

The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pevzner in 1995 [5]. The algorithm was improved several times, and nowadays the most efficient algorithm has a subquadratic running time [9, 8]. Simple permutations played an important role in the development of these al...

It is not known if planar integer linear programming is P-complete or if it is in NC, and the same can be said about the computation of the remainder sequence of the Euclidean algorithm applied to two integers. However, both computations are NC equivalent. The latter computational problem was reduced in NC to the former one by Deng [Mathematical Programming: Complexity and Application, Ph.D. di...

recently, gasimov and yenilmez proposed an approach for solving two kinds of fuzzy linear programming (flp) problems. through the approach, each flp problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. then, the crisp problem is solved by the use of the modified subgradient method. in this paper we will have another look at the earlier defuzzifi...

Control systems can be subject to outside inputs, environmental effects, disturbances, and sensor/actuator inaccuracy. To model such systems, linear differential equations with constrained inputs are often used, ẋ(t) = Ax(t) + Bu(t), where the input vector u(t) stays in some bound. Simulating these models is an important tool for detecting design issues. However, since there may be many possibl...