To integer programming, a ideals have been problems, which Hiroki Nakayama The University of Tokyo (Received October 27, 2003) Hiroshi Imai jases and standard pairs via toric ilgebraic approaches using Grobner k studied in recent years. In this paper, we consider a unimodular case, e.g., network flow enables us to analyze primal and dual problems in an equal setting. By combining existing resul...

Les tableaux de permutation sont des objets récents introduits par L. Williams (Harvard) [22]. Ils sont une sous-classe des Γ -diagrammes introduits A. Postnikov (MIT) [19] pour l’énumération des cellules totalement positives ou nulles de la Grasmannienne. Voulant généraliser des travaux de E. Duchi (LIAFA, Paris 7) et G. Schaeffer (LIX) [11], R. Brak et al. [1] ont travaillé sur les aspects co...

In this paper, we present a comparative study of single sensor-based maximum power point tracking (MPPT) techniques for solar photovoltaic (PV) water pumping systems. A conventional hill climbing algorithm is employed to find and track the MPP, using the information obtained from either a voltage sensor or a tachometer or a manometer. The results of experiment are included and explained to vali...

Many problems in kinematic synthesis of mechanisms and robots lead naturally to systems of bilinear equations in design parameters. Such systems are typically solved using well-known methods for solutions of systems of polynomial equations, e.g., Dialytic Elimination, Grobner bases, and Polynomial Continuation. This paper presents a new nullspace analysis method for solving a system of bilinear...

In this paper, we first present a new class of code based public key cryptosystem(PKC) based on ReedSolomon code over extension field of less than m=9, referred to as K(XVI)SE(1)PKC. We then present a new class of quadratic multivariate PKC, K(XVI)SE(2)PKC, based on binary cyclic code. We show that both K(XVI)SE(1)PKC and K(XVI)SE(2)PKC can be secure against the various linear transformation at...

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

In this paper, we develop the Gr6bner-Shirshov basis theory for the representations of associative algebras by introducing the notion of Gr6bner-Shirshov pairs. Our result can be applied to solve the reduction problem in representation theory and to construct monomial bases of representations of associative algebras. As an illustration, we give an explicit construction of Gr6bner-Shirshov pairs...