نتایج جستجو برای: grobner escalier
تعداد نتایج: 112 فیلتر نتایج به سال:
Introduction La présence de grandes inégalités revenu et l’augmentation des méfaits liés aux opioïdes dans l’ensemble du Canada invitent à se poser la question rôle statut socioéconomique (SSE) crise opioïdes. Seules quelques études ont analysé cette association, plupart d’entre elles s’y sont intéressées l’échelle provinciale. Cette étude porte sur le lien entre les résult...
Correspondence to: Dr Kei Pin Lin Tel: (65) 6222 3322 Fax: (65) 6326 5242 Email: binglin8@ yahoo.com.sg Nephrogenic systemic fibrosis (NSF) is a rare multisystem disease characterised by widespread tissue fibrosis. It is recognised for its epidemiological association in patients with chronic renal failure, after administration of gadolinium-chelate magnetic resonance (MR) contrast agent, partic...
In this paper, it is proved that any algehraicgeometr ic code can be expressed as a cross section of an extended multidimensional cyclic code. Both algebraic-geometric codes and multidimensional cyclic codes are descr ibed by a unified theory of l inear block codes def ined over point sets: algebraic-geometric codes are def ined over the points of an algebraic curve, and an m-dimensional cyclic...
« Dar Echaraa », ou l’ancien tribunal religieux de la médina Sousse (Tunisie) est un monument historique du xviie siècle, symbolique et emblématique avec sa valeur patrimoniale ses qualités architecturales originelles, préservées jusqu’à nos jours grâce aux initiatives communauté locale, des institutions nationales internationales. Le bâtiment façades sobres une porte d’entrée richement décorée...
This paper presents an explicit bound on the number of primitive elements that are linear combinations of generators for field extensions. It is well known that every finite separable extension of an arbitrary field has a primitive element; that is, there exists a single element in the extension field which generates that field over the ground field. This is a fundamental theorem in algebra whi...
We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufticient statistic. Examples include contingency tables, logistic regression, and spectral analysis of permutation data. The algorithms involve computations in polynomial rings using Grobner bases. 1. Introduction. This paper describes new algorithms for sampling from the conditional distribu...
It is well known that the standard bracketings of Lyndon words in an alphabet A form a basis for the free Lie algebra Lie(A) generated by A . Suppose that g 2 Lie(A)/J is a Lie algebra given by a generating set A and a Lie ideal J of relations. Using a Grobner basis type approach we define a set of "standard" Lyndon words, a subset of the set Lyndon words, such that the standard bracketings of ...
We present space and time efficient algorithms for univariate polynomial arithmetic operations over Z mod n where the modulus n does not necessarily fit into is not a machine word. These algorithms provide the key tools for the efficient implementation of polynomial resultant gcd and factorization computation over Z, without having to write large amounts of code in a systems implementation lang...
Computation of partial automata through span composition p. 15 Degenerate arrays : a framework for uncertain data tables p. 21 Neural network sensitivity analysis applied for the reduction of the sensor matrix p. 27 Fuzzy modeling for coal seams a case study for a hard-coal mine p. 33 Optimization of a class of uncertain systems based on uncertain variables p. 38 Computational simulation of cat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید
