Results 51 to 60 of about 4,550,410 (148)
On border basis and Gröbner basis schemes
Collectanea mathematica, 2009 Some typos fixed, some small corrections done. The final version of the paper will be published on "Collectanea Mathematica"
openaire +4 more sources
IET Renewable Power Generation, Volume 18, Issue 6, Page 990-1006, 27 April 2024.The optimal placement of measurement units is solved by a binary particle swarm optimization method considering uncertainties of load demands and renewable generations and measurement unit errors. The correlation between uncertain variables is considered.
Babak Asadzadeh +3 more
wiley +1 more source
Cryptanalysis of novel extended multivariate public key cryptosystem
Tongxin xuebao, 2015 The novel extended multivariate public key cryptosystem is a new security enhancement method on multivariate public key cryptosystems,which is proposed by Qiao,et al.A nonlinear invertible transformation was used,named“tame transformation”,on the ...
Xu-yun NIE, Bo LIU, Gang LU, Ting ZHONG
doaj +2 more sources
, 2014 U ovom radu dokazali smo algoritam za dijeljenje polinoma u više varijabli s obzirom na fiksni monomijalni uređaj. Algoritam smo dobili proširenjem algoritma dijeljenja polinoma u jednoj varijabli.
Zlodi, Ivana
core +2 more sources
Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms
Ingeniería y Ciencia, 2006 La habilidad del Razonamiento Geométrico es central a muchas aplicaciones de CAD/CAM/CAPP (Computer Aided Design, Manufacturing and Process Planning).
Oscar E. Ruiz
doaj
Groebner Basis Procedures for Testing Petri Nets
, 2000 This paper contains introductory material on Petri nets and Groebner basis theory and makes some observations on the relation between the two areas. The aim of the paper is to show how Groebner basis procedures can be applied to the problem of reachability in Petri nets, and to give details of an application to testing models of navigational systems.
Chandler, Angie, Heyworth, Anne
openaire +2 more sources
The Groebner basis of a polynomial system
, 2014 From the Magister Thesis of Marco ...
Valqui, Christian, Solorzano, Marco
openaire +2 more sources
Quantum computation of Groebner basis through F4 and F5 algorithms
, 2022 Our main concern in this article is how to apply quantum algorithms to compute Groebner basis through Faugere's F4 and F5 algorithms, which are regarded as the most effective algorithms for this purpose. We give examples and pseudo-codes for these algorithms and investigate where we can apply quantum algorithms. As a result, we have the designs (or the
Ichio Kikuchi, Akihito Kikuchi
openaire +2 more sources
Simple signature-based Groebner basis algorithm
, 2012 This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its correctness proof achieved without loss of the efficiency.
openaire +2 more sources
GB-hash : Hash Functions Using Groebner Basis
, 2010 In this paper we present an improved version of HF-hash, viz., GB-hash : Hash Functions Using Groebner Basis. In case of HF-hash, the compression function consists of 32 polynomials with 64 variables which were taken from the first 32 polynomials of hidden field equations challenge-1 by forcing last 16 variables as 0.
Dey, Dhananjoy +2 more
openaire +2 more sources