Auswahl der wissenschaftlichen Literatur zum Thema „Application de base de Gröbner“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Application de base de Gröbner" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Application de base de Gröbner"
Bokut, L. A., Yuqun Chen und Zerui Zhang. „Gröbner–Shirshov bases method for Gelfand–Dorfman–Novikov algebras“. Journal of Algebra and Its Applications 16, Nr. 01 (Januar 2017): 1750001. http://dx.doi.org/10.1142/s0219498817500013.
Der volle Inhalt der QuelleSteiner, Matthias Johann. „Solving Degree Bounds for Iterated Polynomial Systems“. IACR Transactions on Symmetric Cryptology 2024, Nr. 1 (01.03.2024): 357–411. http://dx.doi.org/10.46586/tosc.v2024.i1.357-411.
Der volle Inhalt der QuelleXia, Shengxiang, und Gaoxiang Xia. „AN APPLICATION OF GRÖBNER BASES“. Mathematics Enthusiast 6, Nr. 3 (01.07.2009): 381–94. http://dx.doi.org/10.54870/1551-3440.1159.
Der volle Inhalt der QuelleBORISOV, A. V., A. V. BOSOV und A. V. IVANOV. „APPLICATION OF COMPUTER SIMULATION TO THE ANONYMIZATION OF PERSONAL DATA: STATE-OF-THE-ART AND KEY POINTS“. Программирование, Nr. 4 (01.07.2023): 58–74. http://dx.doi.org/10.31857/s0132347423040040.
Der volle Inhalt der QuelleÇelik, Ercan, und Mustafa Bayram. „Application of Gröbner basis techniques to enzyme kinetics“. Applied Mathematics and Computation 153, Nr. 1 (Mai 2004): 97–109. http://dx.doi.org/10.1016/s0096-3003(03)00612-x.
Der volle Inhalt der QuelleHASHEMI, AMIR, und PARISA ALVANDI. „APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS“. Journal of Algebra and Its Applications 12, Nr. 07 (16.05.2013): 1350034. http://dx.doi.org/10.1142/s0219498813500345.
Der volle Inhalt der QuelleYunus, Gulshadam, Zhenzhen Gao und Abdukadir Obul. „Gröbner-Shirshov Basis of Quantum Groups“. Algebra Colloquium 22, Nr. 03 (14.07.2015): 495–516. http://dx.doi.org/10.1142/s1005386715000449.
Der volle Inhalt der QuelleKolesnikov, P. S. „Gröbner–Shirshov Bases for Replicated Algebras“. Algebra Colloquium 24, Nr. 04 (15.11.2017): 563–76. http://dx.doi.org/10.1142/s1005386717000372.
Der volle Inhalt der QuelleLi, Huishi. „The General PBW Property“. Algebra Colloquium 14, Nr. 04 (Dezember 2007): 541–54. http://dx.doi.org/10.1142/s1005386707000508.
Der volle Inhalt der QuelleChaharbashloo, Mohammad Saleh, Abdolali Basiri, Sajjad Rahmany und Saber Zarrinkamar. „An Application of Gröbner Basis in Differential Equations of Physics“. Zeitschrift für Naturforschung A 68, Nr. 10-11 (01.11.2013): 646–50. http://dx.doi.org/10.5560/zna.2013-0044.
Der volle Inhalt der QuelleDissertationen zum Thema "Application de base de Gröbner"
Sénéchaud, Pascale. „Calcul formel et parallélisme : bases de Gröbner booléennes, méthodes de calcul : applications, parallélisation“. Grenoble INPG, 1990. http://tel.archives-ouvertes.fr/tel-00337227.
Der volle Inhalt der QuelleGarcía, Fontán Jorge. „Singularity and Stability Analysis of vision-based controllers“. Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS015.
Der volle Inhalt der QuelleThe objective of this PhD thesis is to explore the failure cases of Image-Based Visual Servoing (IBVS), a class of Robotics controllers based on computer vision data. The failure cases arise from two sources: the singularities of the governing kinematic equations, and the existance of multiple stable points of equilibrium, which impacts the global asymptotic stability of the control laws. In this thesis, we study these two problems from a rigurous mathematical perspective and with the help of exact computational tools from algebraic geometry and computer algebra. Two main objectives were achieved. The first is to determine the conditions for singularity for the interaction model related to the observation of more than three straight lines in space, which extends the previous existing results for three lines. The second is the computation of the critical points (the equilibrium points) of IBVS in the observation of four reference points, as a first step towards an analysis of the global stability behaviour of visual servoing
Verron, Thibaut. „Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale“. Electronic Thesis or Diss., Paris 6, 2016. http://www.theses.fr/2016PA066355.
Der volle Inhalt der QuellePolynomial system solving is a problem with numerous applications, and Gröbner bases are an important tool in this context. Previous studies have shown that systèmes arising in applications usually exhibit more structure than arbitrary systems, and that these structures can be used to make computing Gröbner bases easier.In this thesis, we consider two examples of such structures. First, we study weighted homogeneous systems, which are homogeneous if we give to each variable an arbitrary degree. This structure appears naturally in many applications, including a cryptographical problem (discrete logarithm). We show how existing algorithms, which are efficient for homogeneous systems, can be adapted to a weighted setting, and generically, we show that their complexity bounds can be divided by a factor polynomial in the product of the weights.Then we consider a real roots classification problem for varieties defined by determinants. This problem has a direct application in control theory, for contrast optimization in magnetic resonance imagery. This specific system appears to be out of reach of existing algorithms. We show how these algorithms can benefit from the determinantal structure of the system, and as an illustration, we answer the questions from the application to contrast optimization
Verron, Thibaut. „Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale“. Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066355/document.
Der volle Inhalt der QuellePolynomial system solving is a problem with numerous applications, and Gröbner bases are an important tool in this context. Previous studies have shown that systèmes arising in applications usually exhibit more structure than arbitrary systems, and that these structures can be used to make computing Gröbner bases easier.In this thesis, we consider two examples of such structures. First, we study weighted homogeneous systems, which are homogeneous if we give to each variable an arbitrary degree. This structure appears naturally in many applications, including a cryptographical problem (discrete logarithm). We show how existing algorithms, which are efficient for homogeneous systems, can be adapted to a weighted setting, and generically, we show that their complexity bounds can be divided by a factor polynomial in the product of the weights.Then we consider a real roots classification problem for varieties defined by determinants. This problem has a direct application in control theory, for contrast optimization in magnetic resonance imagery. This specific system appears to be out of reach of existing algorithms. We show how these algorithms can benefit from the determinantal structure of the system, and as an illustration, we answer the questions from the application to contrast optimization
Ars, Gwénolé. „Applications des bases de Gröbner à la cryptograhie“. Rennes 1, 2005. http://www.theses.fr/2005REN1S039.
Der volle Inhalt der QuelleVilanova, Fábio Fontes. „Sistemas de equações polinomiais e base de Gröbner“. Universidade Federal de Sergipe, 2015. https://ri.ufs.br/handle/riufs/6524.
Der volle Inhalt der QuelleO objetivo principal desse trabalho é, usando bases de Gröbner, apresentar um método algébrico capaz de determinar a solução, quando existir, de sistemas de equações polinomiais não necessariamente lineares. Para tanto, necessitamos inicialmente apresentar alguns conceitos e teoremas ligados a anéis de polinômios com várias indeterminadas e de ideais monomiais, dentre os quais destacamos o algoritmo extendido da divisão, o teorema da Base de Hilbert e o algoritmo de Buchberger. Além disso, usando noções básicas da Teoria de eliminação e extensão, apresentamos uma solução algébrica para o problema da coloração de mapas usando três cores, bem como um solução geral para o puzzle Sudoku.
Xiu, Xingqiang [Verfasser], und Martin [Akademischer Betreuer] Kreuzer. „Non-commutative Gröbner Bases and Applications / Xingqiang Xiu. Betreuer: Martin Kreuzer“. Passau : Universitätsbibliothek der Universität Passau, 2012. http://d-nb.info/1024803708/34.
Der volle Inhalt der QuelleSpaenlehauer, Pierre-Jean. „Résolution de systèmes multi-homogènes et déterminantiels algorithmes - complexité - applications“. Paris 6, 2012. http://www.theses.fr/2012PA066467.
Der volle Inhalt der QuelleMultivariate polynomial systems arising in Engineering Science often carryalgebraic structures related to the problems they stem from. Inparticular, multi-homogeneous, determinantal structures and booleansystems can be met in a wide range of applications. A classical method to solve polynomial systems is to compute a Gröbner basis ofthe ideal associated to the system. This thesis provides new tools forsolving such structured systems in the context of Gröbner basis algorithms. On the one hand, these tools bring forth new bounds on the complexity of thecomputation of Gröbner bases of several families of structured systems(bilinear systems, determinantal systems, critical point systems,boolean systems). In particular, it allows the identification of families ofsystems for which the complexity of the computation is polynomial inthe number of solutions. On the other hand, this thesis provides new algorithms which takeprofit of these algebraic structures for improving the efficiency ofthe Gröbner basis computation and of the whole solving process(multi-homogeneous systems, boolean systems). These results areillustrated by applications in cryptology (cryptanalysis of MinRank),in optimization and in effective real geometry (critical pointsystems)
Chenavier, Cyrille. „Le treillis des opérateurs de réduction : applications aux bases de Gröbner non commutatives et en algèbre homologique“. Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC334.
Der volle Inhalt der QuelleIn this thesis, we study associative unitary algebras with rewriting methods. \G\ bases theory enables us to solve decision problems and to compute homological invariants with such methods. In order to study homological problems, Berger characterises quadratic \G\ bases in a lattice way. This characterisationis obtained using reduction operators. The latter ones are specific projectors of a vector space equipped with a wellfounded basis. When this vector space is finite-dimensional, Berger proves that the associated set of reduction operators admits a lattice structure. Using it, he deduces the lattice characterisation of quadratic \G\ bases. In this thesis, we extend the approach in terms of reduction operators applying it to not necessarily quadratic algebras.For that, we show that the set of reduction operators relative to a not necessarily finite-dimensional vector space admitsa lattice structure. In the finite-dimensional case, we obtain the same lattice structure than Berger's one. We provide a lattice formulation of confluence generalizing Berger's one. Moreover, we provide a lattice characterisation of completion.We use the lattice formulation of confluence to characterise non commutative \G\ bases. Moreover, we deduce from the lattice formulation of confluence a procedure to construct non commutative \G\ bases.We also construct a contracting homotopt for the Koszul complex using reduction operators. The lattice formulation of confluence enables us to characterise it with algebraic equations. These equations induce representations of a family of algebras called confluence algebras. Our contracting homotopy is built using these representations
Amendola, Teresa. „Basi di Gröbner e anelli polinomiali“. Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19458/.
Der volle Inhalt der QuelleBücher zum Thema "Application de base de Gröbner"
Bruno, Buchberger, und Winkler Franz 1955-, Hrsg. Gröbner bases and applications. Cambridge, U.K: Cambridge University Press, 1998.
Den vollen Inhalt der Quelle finden1947-, Herzog Jürgen, Hrsg. Gröbner bases in commutative algebra. Providence, R.I: American Mathematical Society, 2012.
Den vollen Inhalt der Quelle findenBasilio, C. I. Application of the acid-base theory to flotation systems. S.l: s.n, 1991.
Den vollen Inhalt der Quelle findenMichel, Izygon, und United States. National Aeronautics and Space Administration., Hrsg. Advanced software development workstation: Knowledge base design : design of knowledge base for flight planning application. [Houston, Tex.]: Research Institute for Computing and Information Systems, University of Houston-Clear Lake, 1992.
Den vollen Inhalt der Quelle findenUnited States. National Aeronautics and Space Administration., Hrsg. Partial gravity habitat study with application to lunar base design. [Houston, Tex.]: Sasakawa International Center for Space Architecture, University of Houston, College of Architecture, 1989.
Den vollen Inhalt der Quelle findenBullock, Keith. An Application of high angle conveying in base metal mines. Sudbury, Ont: Laurentian University, School of Engineering, 1986.
Den vollen Inhalt der Quelle finden1964-, Kraft George, Hrsg. Building applications with the Linux standard base. Upper Saddle River, NJ: IBM Press, 2005.
Den vollen Inhalt der Quelle findenDonnelly, Dennis M. Selecting stands for the forest planning data base: Sampling background and application. Fort Collins, Colo: U.S. Dept. of Agriculture, Forest Service, Rocky Mountain Forest and Range Experiment Station, 1995.
Den vollen Inhalt der Quelle findenFuruorasu kemisutorī no kiso to ōyō: Base and application of fluorous chemistry. Tōkyō: Shīemshī Shuppan, 2010.
Den vollen Inhalt der Quelle findenPurasuchikku saishigenka no kiso to ōyō: Base and application of plastic recycling. Tōkyō: Shīemushī Shuppan, 2012.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Application de base de Gröbner"
Borges-Quintana, M., M. A. Borges-Trenard und E. Martínez-Moro. „An Application of Möller’s Algorithm to Coding Theory“. In Gröbner Bases, Coding, and Cryptography, 379–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93806-4_24.
Der volle Inhalt der QuelleBahloul, Rouchdi. „Gröbner Bases in D-Modules: Application to Bernstein-Sato Polynomials“. In Two Algebraic Byways from Differential Equations: Gröbner Bases and Quivers, 75–93. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-26454-3_2.
Der volle Inhalt der QuelleBecker, Thomas, und Volker Weispfenning. „First Applications of Gröbner Bases“. In Gröbner Bases, 243–92. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4612-0913-3_7.
Der volle Inhalt der QuelleTakayama, Nobuki. „Gröbner Basis for Rings of Differential Operators and Applications“. In Gröbner Bases, 279–344. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_6.
Der volle Inhalt der QuelleAdams, William, und Philippe Loustaunau. „Applications of Gröbner bases“. In An Introduction to Gröbner Bases, 53–112. Providence, Rhode Island: American Mathematical Society, 1994. http://dx.doi.org/10.1090/gsm/003/02.
Der volle Inhalt der QuelleGöbel, Manfred. „Symideal Gröbner bases“. In Rewriting Techniques and Applications, 48–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61464-8_42.
Der volle Inhalt der QuelleRobertz, Daniel. „Janet Bases and Applications“. In Gröbner Bases in Symbolic Analysis, herausgegeben von Markus Rosenkranz und Dongming Wang, 139–68. Berlin, Boston: DE GRUYTER, 2007. http://dx.doi.org/10.1515/9783110922752.139.
Der volle Inhalt der QuelleFajardo, William, Claudia Gallego, Oswaldo Lezama, Armando Reyes, Héctor Suárez und Helbert Venegas. „Gröbner Bases of Modules“. In Algebra and Applications, 261–86. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-53378-6_14.
Der volle Inhalt der QuelleMonfroy, Eric. „Gröbner bases: Strategies and applications“. In Artificial Intelligence and Symbolic Mathematical Computing, 133–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57322-4_9.
Der volle Inhalt der QuelleFajardo, William, Claudia Gallego, Oswaldo Lezama, Armando Reyes, Héctor Suárez und Helbert Venegas. „Matrix Computations Using Gröbner Bases“. In Algebra and Applications, 335–53. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-53378-6_17.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Application de base de Gröbner"
Ohsugi, Hidefumi. „Gröbner bases of toric ideals and their application“. In the 39th International Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2608628.2627495.
Der volle Inhalt der QuelleArikawa, Keisuke. „Kinematic Analysis of Mechanisms Based on Parametric Polynomial System“. In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85347.
Der volle Inhalt der QuelleArikawa, Keisuke. „Improving the Method for Kinematic Analysis of Mechanisms That Was Based on Parametric Polynomial System With Gröbner Cover“. In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-97679.
Der volle Inhalt der QuelleWang, Hai, Lei Zhang, Qiong Wang und Shi Yan. „The Gröbner Bases Algorithm and its Application in Polynomial Ideal Theory“. In 2019 Chinese Control And Decision Conference (CCDC). IEEE, 2019. http://dx.doi.org/10.1109/ccdc.2019.8833013.
Der volle Inhalt der QuellePethö, Attila. „Application of Gröbner bases to the resolution of systems of norm equations“. In the 1991 international symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/120694.120713.
Der volle Inhalt der Quellezhao, zhiqin, und xuewei xiong. „Gröbner bases method for solving N-path in finite graph and its application“. In International Conference on Pure, Applied, and Computational Mathematics (PACM 2023), herausgegeben von Zhen Wang und Dunhui Xiao. SPIE, 2023. http://dx.doi.org/10.1117/12.2679167.
Der volle Inhalt der QuelleLevandovskyy, Viktor, Grischa Studzinski und Benjamin Schnitzler. „Enhanced computations of gröbner bases in free algebras as a new application of the letterplace paradigm“. In the 38th international symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2465506.2465948.
Der volle Inhalt der QuelleHu, Jing, Yuheng Lin und Xiwei Zhang. „Reversible Logic Synthesis Using Gröbner Base“. In 2019 IEEE 2nd International Conference on Electronics Technology (ICET). IEEE, 2019. http://dx.doi.org/10.1109/eltech.2019.8839444.
Der volle Inhalt der QuelleSartayev, Bauyrzhan, und Abdibek Ydyrys. „Free products of operads and Gröbner base of some operads“. In 2023 17th International Conference on Electronics Computer and Computation (ICECCO). IEEE, 2023. http://dx.doi.org/10.1109/icecco58239.2023.10147149.
Der volle Inhalt der QuelleKURIKI, Satoshi, Tetsuhisa MIWA und Anthony J. HAYTER. „Abstract Tubes Associated with Perturbed Polyhedra with Applications to Multidimensional Normal Probability Computations“. In Harmony of Gröbner Bases and the Modern Industrial Society - The Second CREST-CSBM International Conference. Singapore: World Scientific Publishing Co. Pte. Ltd., 2012. http://dx.doi.org/10.1142/9789814383462_0010.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Application de base de Gröbner"
R.J. Garrett. Nuclear Safety Design Base for License Application. Office of Scientific and Technical Information (OSTI), September 2005. http://dx.doi.org/10.2172/895368.
Der volle Inhalt der QuelleAdve, R., P. Antonik, W. Baldygo, C. Capraro und G. Capraro. Knowledge-Base Application to Ground Moving Target Detection. Fort Belvoir, VA: Defense Technical Information Center, September 2001. http://dx.doi.org/10.21236/ada388934.
Der volle Inhalt der QuelleYazawa, Keisuke. AlN Base Material Development for High Temperature Application. Office of Scientific and Technical Information (OSTI), August 2023. http://dx.doi.org/10.2172/1994804.
Der volle Inhalt der QuelleLubell, Joshua. The application protocol information base world wide web gateway. Gaithersburg, MD: National Institute of Standards and Technology, 1996. http://dx.doi.org/10.6028/nist.ir.5868.
Der volle Inhalt der QuelleDecker, Robert K. Viscous Drag Measurement and Its Application to Base Drag Reduction. Fort Belvoir, VA: Defense Technical Information Center, Mai 2002. http://dx.doi.org/10.21236/ada403228.
Der volle Inhalt der QuelleJ.H. Zhu, M.P. Brady und H.U. Anderson. Tailoring Fe-Base Alloys for Intermediate Temperature SOFC Interconnect Application. Office of Scientific and Technical Information (OSTI), Dezember 2007. http://dx.doi.org/10.2172/932217.
Der volle Inhalt der QuelleBinder, Michael J., Franklin H. Holcomb und William R. Taylor. Site Evaluation for Application of Fuel Cell Technology, Barksdale Air Force Base, LA. Fort Belvoir, VA: Defense Technical Information Center, März 2001. http://dx.doi.org/10.21236/ada387497.
Der volle Inhalt der QuelleBinder, Michael J., Franklin H. Holcomb und William R. Taylor. Site Evaluation for Application of Fuel Cell Technology, Westover Air Reserve Base, MA. Fort Belvoir, VA: Defense Technical Information Center, Februar 2001. http://dx.doi.org/10.21236/ada387572.
Der volle Inhalt der QuelleBinder, Michael J., Franklin H. Holcomb und William R. Taylor. Site Evaluation for Application of Fuel Cell Technology, Laughlin Air Force Base, TX. Fort Belvoir, VA: Defense Technical Information Center, April 2001. http://dx.doi.org/10.21236/ada387648.
Der volle Inhalt der QuelleBinder, Michael J., Franklin H. Holcomb und William R. Taylor. Site Evaluation for Application of Fuel Cell Technology, Nellis Air Force Base, NV. Fort Belvoir, VA: Defense Technical Information Center, März 2001. http://dx.doi.org/10.21236/ada385549.
Der volle Inhalt der Quelle