Relevant bibliographies by topics / Matrice de Fisher

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Matrice de Fisher'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Matrice de Fisher.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Matrice de Fisher"

1

Sanon, Abdramane, Alain P. K. Gomgnimbou, Hamadé Sigue, Kalifa Coulibaly, Cheick A. Bambara, Willifried Sanou, Sékou Fofana, and Hassan B. Nacro. "Performances économiques et financières de la fertilisation en riziculture pluviale stricte dans la zone sud soudanienne du Burkina Faso." International Journal of Biological and Chemical Sciences 15, no. 4 (November 19, 2021): 1581–94. http://dx.doi.org/10.4314/ijbcs.v15i4.22.

Full text
Abstract:
La culture du riz joue un rôle décisif dans les moyens d'existence des producteurs. La production rizicole rencontre des difficultés liées aux coûts de fertilisation. L’étude avait pour objectif d’évaluer les performances économiques et financières des biodéchets et des fertilisants inorganiques en riziculture pluviale stricte. L’évaluation est faite suivante deux démarches : la première consiste à calculer et à comparer les indicateurs de performance, tandis que la deuxième repose sur une matrice de corrélation afin d’identifier les relations entre les indicateurs de performances économiques et financières et rendements de riz paddy. La performance agronomique des options de fertilisation a été évaluée par les rendements du riz paddy récolté dans un essai. A cet effet, un dispositif expérimental en Blocs de Fisher complètement randomisés avec quatre répétitions et dix traitements composites a été installé à la station de recherches de Farako-Ba au Burkina Faso, durant quatre campagnes agricoles de 2016 à 2019. Pour le calcul des indicateurs de performances économiques et financières, l’achat des engrais minéraux et des biodéchets, le coût de la main-d’œuvre pour collecter, transporter et incorporer les fertilisants, le prix moyen d’un kilogramme de riz paddy dans les différents marchés de la zone d’étude ont été prises en considération. Les résultats ont montré que les traitements Fumier de Poule+Urée, Fumier de Poule+Burkina Phosphate+Urée et Compost+Urée présentaient significativement les meilleures performances économiques du point de vue de la marge nette et de la productivité moyenne du travail. Les meilleurs taux de rentabilité interne et du ratio bénéfice sur coût sont enrégistrés par les traitements Fumier de Poule+Urée et Compost+Urée. Il ressort de l’analyse statistique des corrélations positives et significatives entre le rendement du riz paddy et les marges nettes d’une part et d’autre part entre le rendement du riz paddy et la productivité moyenne du travail. Dans un contexte de coûts élevés de la fertilisation, ces résultats révèlent l’intérêt de la combinaison de biodéchets (fumier de poule) avec les engrais minéraux en culture de riz pluvial strict pour une vulgarisation en milieu paysan.
APA, Harvard, Vancouver, ISO, and other styles
2

Heavens, A. F., M. Seikel, B. D. Nord, M. Aich, Y. Bouffanais, B. A. Bassett, and M. P. Hobson. "Generalized Fisher matrices." Monthly Notices of the Royal Astronomical Society 445, no. 2 (October 14, 2014): 1687–93. http://dx.doi.org/10.1093/mnras/stu1866.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Heavens, Alan. "Generalisations of Fisher Matrices." Entropy 18, no. 6 (June 22, 2016): 236. http://dx.doi.org/10.3390/e18060236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Almestady, Mohammed S., and Alun O. Morris. "Fischer Matrices for Projective Representations of Generalized Symmetric Groups." Algebra Colloquium 16, no. 03 (September 2009): 449–62. http://dx.doi.org/10.1142/s1005386709000431.

Full text
Abstract:
The aim of this work is to calculate the Fischer matrices for the covering groups of the Weyl group of type Bn and the generalized symmetric group. It is shown that the Fischer matrices are the same as those in the ordinary case for the classes of Sn which correspond to partitions with all parts odd. For the classes of Sn which correspond to partitions in which no part is repeated more than m times, the Fischer matrices are shown to be different from the ordinary case.
APA, Harvard, Vancouver, ISO, and other styles
5

Prins, Abraham Love. "On the Fischer matrices of a group of shape 21+2n + :G." Revista Colombiana de Matemáticas 56, no. 2 (April 17, 2023): 189–211. http://dx.doi.org/10.15446/recolma.v56n2.108379.

Full text
Abstract:
In this paper, the Fischer matrices of the maximal subgroup G = 21+8+ : (U4(2):2) of U6(2):2 will be derived from the Fischer matrices of the quotient group Q = G/Z(21+8+) = 28 : (U4(2):2), where Z(21+8+) denotes the center of the extra-special 2-group 21+8+. Using this approach, the Fischer matrices and associated ordinary character table of G are computed in an elegantly simple manner. This approach can be used to compute the ordinary character table of any split extension group of the form 21+2n+ :G, n ∈ N, provided the ordinary irreducible characters of 21+2n+ extend to ordinary irreducible characters of its inertia subgroups in 21+2n+:G and also that the Fischer matrices M(gi) of the quotient group 21+2n+ :G/Z(21+2n+) = 22n:G are known for each class representative gi in G.
APA, Harvard, Vancouver, ISO, and other styles
6

Kagan, Abram, and Zinoviy Landsman. "Relation between the covariance and Fisher information matrices." Statistics & Probability Letters 42, no. 1 (March 1999): 7–13. http://dx.doi.org/10.1016/s0167-7152(98)00178-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Böttcher, Albrecht, and Bernd Silbermann. "Toeplitz matrices and determinants with Fisher-Hartwig symbols." Journal of Functional Analysis 63, no. 2 (September 1985): 178–214. http://dx.doi.org/10.1016/0022-1236(85)90085-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bin, Meng. "Operator-valued free Fisher information of random matrices." Acta Mathematica Scientia 30, no. 4 (July 2010): 1327–37. http://dx.doi.org/10.1016/s0252-9602(10)60128-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Böttcher, Albrecht, and Jani Virtanen. "Norms of Toeplitz Matrices with Fisher–Hartwig Symbols." SIAM Journal on Matrix Analysis and Applications 29, no. 2 (January 2007): 660–71. http://dx.doi.org/10.1137/06066165x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lv, Songjun. "General Fisher information matrices of a random vector." Advances in Applied Mathematics 89 (August 2017): 18–40. http://dx.doi.org/10.1016/j.aam.2017.03.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Matrice de Fisher"

1

Nguyen, Thu Thuy. "Developpement de la matrice d'information de Fisher pour des modèles non linéaires à effets mixtes : application à la pharmacocinétique des antibiotiques et l'impact sur l'émergence de la résistance." Paris 7, 2013. http://www.theses.fr/2013PA077029.

Full text
Abstract:
Les modèles non linéaires à effets mixtes (MNLEM) permettent d'analyser les données longitudinales, par exemple dans les études pharmacocinétique/pharmacodynamique, avec peu de prélèvements par patient. Une méthode pour planifier ces études est d'utiliser la matrice d'information de Fisher (MF) attendue, approximée par linéarisation. Nous avons étendu MF pour prendre en compte la variabilité intra-sujet et les covariables discrètes dans les essais en crossover. Ces développements ont été évalués par simulation, implémentés dans le logiciel PFIM, dédiée à l'évaluation et l'optimisation des protocoles. Nous avons utilisé PFIM pour planifier une étude en crossover, montrant l'absence d'interaction d'un composant sur la pharmacocinétique de l'amoxicilline. Nous avons ensuite proposé et évalué par simulations une alternative pour évaluer la MF, basée sur la quadrature de Gauss et l'intégration stochastique. Cette approche donne des prédictions plus correctes que la linéarisation mais elle est coûteuse en temps de calcul ; son utilisation n'est alors adaptée que pour des MNLEM avec peu d'effets aléatoires. Nous avons aussi étudié l'émergence de la résistance des entérobactéries aux fluoroquinolones dans la flore intestinale. Dans un essai chez le porc, nous avons montré, d'abord par l'approche non-compartimentale, une corrélation entre les concentrations fécales de la ciprofloxacine et les comptes de bactéries résistantes. Nous avons également développé un modèle mécanistique pour mieux caractériser la cinétique des entérobactéries. A notre connaissance, c'est la première modélisation in vivo pour étudier la résistance bactérienne aux fluoroquinolones dans la flore intestinale
Nonlinear mixed effect models (NLMEM) can be used to analyse longitudinal data in patients, for example in pharmacokinetic/pharmacodynamic studies, with fewer samples than the classical non-compartmental approach. A method for designing these studies is to use the Fisher information matrix (MF), approximated by first order linearization of the model. We extended this expression of MF to take into account the within subject variability and the discrete covariates. These developments were evaluated by simulations, implemented in PFIM 3. 2 dedicated to design evaluation and optimisation. We also applied PFIM to design a crossover study, showing absence of interaction of a compound on the pharmacokinetic of amoxicillin. We also proposed and evaluated by simulations an alternative approach to compute MF without linearization, based on Gaussian quadrature and stochastic integration. This approach gave more correct predictions than linearization when the model becomes very nonlinear but it is very time consuming; consequently its use is limited to NLMEM with only few random effects. Next, we studied the expansion of résistance to fluoroquinolones in intestinal flora. In a trial in piglets, we found, by non-compartmental approach, a significant correlation between fecal concentrations of ciprofloxacin and counts of resistant enterobacteria. Then we developed a mechanistic model to more precisely characterize the pharmacokinetic of fecal ciprofloxacin as well as the kinetics of susceptible and resistant enterobacteria. To our knowledge, this is the first in vivo modelling to study the bacterial résistance to fluoroquinolones in intestinal flora
APA, Harvard, Vancouver, ISO, and other styles
2

Koroko, Abdoulaye. "Natural gradient-based optimization methods for deep neural networks." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG068.

Full text
Abstract:
La méthode du gradient stochastique est la technologie actuellement prédominante pour effectuer la phase d'entraînement des réseaux de neurones. Par rapport à une descente classique, le calcul du vrai gradient comme une moyenne sur les données est remplacé par un élément aléatoire de la somme. En présence de données massives, cette approximation audacieuse permet de diminuer le nombre d'évaluations de gradients élémentaires et d'alléger le coût de chaque itération. Le prix à payer est l'apparition d'oscillations et la lenteur de convergence souvent excessive en nombre d'itérations. L'objectif de cette thèse est de concevoir une approche à la fois : (i) plus robuste, en faisant appel aux méthodes fondamentales qui ont fait leur preuve en optimisation classique, i.e., en dehors du cadre de l'apprentissage ; et (ii) plus rapide, en termes de vitesse convergence. Nous nous intéressons en particulier aux méthodes de second ordre, connues pour leur stabilité et leur rapidité de convergence. Pour éviter le goulot d'étranglement de ces méthodes, qui est le coût exorbitant d'une itération où intervient un système linéaire à matrice pleine, nous tentons d'améliorer une approximation récemment introduite sous le nom de Kronecker-Factorized Approximation of Curvature (KFAC) pour la matrice de Fisher, laquelle remplace la matrice hessienne dans ce contexte. Plus précisément, nos axes de travail sont : (i) construire de nouvelles factorisations de Kronecker fondées sur une justification mathématique plus rigoureuse que KFAC ; (ii) prendre en compte l'information issue des blocs hors diagonaux de la matrice de Fisher, qui représentent l'interaction entre les différentes couches ; (iii) généraliser KFAC à une architecture de réseau autre que celles pour lesquelles elle a été initialement développée
The stochastic gradient method is currently the prevailing technology for training neural networks. Compared to a classical descent, the calculation of the true gradient as an average over the data is replaced by a random element of the sum. When dealing with massive data, this bold approximation enables one to decrease the number of elementary gradient evaluations and to alleviate the cost of each iteration. The price to be paid is the appearance of oscillations and the slowness of convergence, which is often excessive in terms of number of iterations. The aim of this thesis is to design an approach that is both: (i) more robust, using the fundamental methods that have been successfully proven in classical optimization, i.e., outside the learning framework; and (ii) faster in terms of convergence speed. We are especially interested in second-order methods, known for their stability and speed of convergence. To circumvent the bottleneck of these methods, which lies in the prohibitive cost of an iteration involving a linear system with a full matrix, we attempt to improve an approximation recently introduced as Kronecker-Factorized Approximation of Curvature (KFAC) for the Fisher matrix, which replaces the Hessian matrix in this context. More specifically, our work focuses on: (i) building new Kronecker factorizations based on a more rigorous mathematical justification than in KFAC; (ii) taking into account the information from the off-diagonal blocks of the Fisher matrix, which represent the interaction between the different layers; (iii) generalizing KFAC to a network architecture other than those for which it had been initially developed
APA, Harvard, Vancouver, ISO, and other styles
3

Roy, Prateep Kumar. "Analysis & design of control for distributed embedded systems under communication constraints." Phd thesis, Université Paris-Est, 2009. http://tel.archives-ouvertes.fr/tel-00534012.

Full text
Abstract:
Les Systèmes de Contrôle Embarqués Distribués (SCED) utilisent les réseaux de communication dans les boucles de rétroaction. Étant donné que les systèmes SCED ont une puissance de batterie, une bande passante de communication et une puissance de calcul limitée, les débits des données ou des informations transmises sont bornées et ils peuvent affecter leur stabilité. Ceci nous amène à élargir le spectre de notre étude et y intégrer une étude sur la relation entre la théorie du contrôle d'un coté et celle de l'information de l'autre. La contrainte de débit de données induit la quantification des signaux tandis que les aspects de calcul temps réel et de communication induit des événements asynchrones qui ne sont plus réguliers ou périodiques. Ces deux phénomènes donnent au SCED une double nature, continue et discrète, et en font des cas d'étude spécifiques. Dans cette thèse, nous analysons la stabilité et la performance de SCED du point de vue de la théorie de l'information et du contrôle. Pour les systèmes linéaires, nous montrons l'importance du compromis entre la quantité d'information communiquée et les objectifs de contrôle, telles que la stabilité, la contrôlabilité/observabilité et les performances. Une approche de conception conjointe de contrôle et de communication (en termes de débit d'information au sens de Shannon) des SCED est étudiée. Les principaux résultats de ces travaux sont les suivants : nous avons prouvé que la réduction d'entropie (ce qui correspond à la réduction d'incertitude) dépend du Grammien de contrôlabilité. Cette réduction est également liée à l'information mutuelle de Shannon. Nous avons démontré que le Grammien de contrôlabilité constitue une métrique de l'entropie théorique de l'information en ce qui concerne les bruits induits par la quantification. La réduction de l'influence de ces bruits est équivalente à la réduction de la norme du Grammien de contrôlabilité. Nous avons établi une nouvelle relation entre la matrice d'information de Fisher (FIM) et le Grammien de Contrôlabilité (CG) basé sur la théorie de l'estimation et la théorie de l'information. Nous proposons un algorithme qui distribue de manière optimale les capacités de communication du réseau entre un nombre "n" d'actionneurs et/ou systèmes concurrents se basant sur la réduction de la norme du Grammien de Contrôlabilité
APA, Harvard, Vancouver, ISO, and other styles
4

Roy, Prateep Kumar. "Analyse et conception de la commande des systèmes embarqués distribués sous des contraintes de communication." Phd thesis, Université Paris-Est, 2009. http://tel.archives-ouvertes.fr/tel-00532883.

Full text
Abstract:
Les Systèmes de Contrôle Embarqués Distribués (SCED) utilisent les réseaux de communication dans les boucles de rétroaction. Étant donné que les systèmes SCED ont une puissance de batterie, une bande passante de communication et une puissance de calcul limitée, les débits des données ou des informations transmises sont bornées et ils peuvent affecter leur stabilité. Ceci nous amène à élargir le spectre de notre étude et y intégrer une étude sur la relation entre la théorie du contrôle d'un coté et celle de l'information de l'autre. La contrainte de débit de données induit la quantification des signaux tandis que les aspects de calcul temps réel et de communication induit des événements asynchrones qui ne sont plus réguliers ou périodiques. Ces deux phénomènes donnent au SCED une double nature, continue et discrète, et en font des cas d'étude spécifiques. Dans cette thèse, nous analysons la stabilité et la performance de SCED du point de vue de la théorie de l'information et du contrôle. Pour les systèmes linéaires, nous montrons l'importance du compromis entre la quantité d'information communiquée et les objectifs de contrôle, telles que la stabilité, la contrôlabilité/observabilité et les performances. Une approche de conception conjointe de contrôle et de communication (en termes de débit d'information au sens de Shannon) des SCED est étudiée. Les principaux résultats de ces travaux sont les suivants : nous avons prouvé que la réduction d'entropie (ce qui correspond à la réduction d'incertitude) dépend du Grammien de contrôlabilité. Cette réduction est également liée à l'information mutuelle de Shannon. Nous avons démontré que le Grammien de contrôlabilité constitue une métrique de l'entropie théorique de l'information en ce qui concerne les bruits induits par la quantification. La réduction de l'influence de ces bruits est équivalente à la réduction de la norme du Grammien de contrôlabilité. Nous avons établi une nouvelle relation entre la matrice d'information de Fisher (FIM) et le Grammien de Contrôlabilité (CG) basé sur la théorie de l'estimation et la théorie de l'information. Nous proposons un algorithme qui distribue de manière optimale les capacités de communication du réseau entre un nombre "n" d'actionneurs et/ou systèmes concurrents se basant sur la réduction de la norme du Grammien de Contrôlabilité
APA, Harvard, Vancouver, ISO, and other styles
5

Ley, Christophe. "Univariate and multivariate symmetry: statistical inference and distributional aspects." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210029.

Full text
Abstract:
This thesis deals with several statistical and probabilistic aspects of symmetry and asymmetry, both in a univariate and multivariate context, and is divided into three distinct parts.

The first part, composed of Chapters 1, 2 and 3 of the thesis, solves two conjectures associated with multivariate skew-symmetric distributions. Since the introduction in 1985 by Adelchi Azzalini of the most famous representative of that class of distributions, namely the skew-normal distribution, it is well-known that, in the vicinity of symmetry, the Fisher information matrix is singular and the profile log-likelihood function for skewness admits a stationary point whatever the sample under consideration. Since that moment, researchers have tried to determine the subclasses of skew-symmetric distributions who suffer from each of those problems, which has led to the aforementioned two conjectures. This thesis completely solves these two problems.

The second part of the thesis, namely Chapters 4 and 5, aims at applying and constructing extremely general skewing mechanisms. As such, in Chapter 4, we make use of the univariate mechanism of Ferreira and Steel (2006) to build optimal (in the Le Cam sense) tests for univariate symmetry which are very flexible. Actually, their mechanism allowing to turn a given symmetric distribution into any asymmetric distribution, the alternatives to the null hypothesis of symmetry can take any possible shape. These univariate mechanisms, besides that surjectivity property, enjoy numerous good properties, but cannot be extended to higher dimensions in a satisfactory way. For this reason, we propose in Chapter 5 different general mechanisms, sharing all the nice properties of their competitors in Ferreira and Steel (2006), but which moreover can be extended to any dimension. We formally prove that the surjectivity property holds in dimensions k>1 and we study the principal characteristics of these new multivariate mechanisms.

Finally, the third part of this thesis, composed of Chapter 6, proposes a test for multivariate central symmetry by having recourse to the concepts of statistical depth and runs. This test extends the celebrated univariate runs test of McWilliams (1990) to higher dimensions. We analyze its asymptotic behavior (especially in dimension k=2) under the null hypothesis and its invariance and robustness properties. We conclude by an overview of possible modifications of these new tests./

Cette thèse traite de différents aspects statistiques et probabilistes de symétrie et asymétrie univariées et multivariées, et est subdivisée en trois parties distinctes.

La première partie, qui comprend les chapitres 1, 2 et 3 de la thèse, est destinée à la résolution de deux conjectures associées aux lois skew-symétriques multivariées. Depuis l'introduction en 1985 par Adelchi Azzalini du plus célèbre représentant de cette classe de lois, à savoir la loi skew-normale, il est bien connu qu'en un voisinage de la situation symétrique la matrice d'information de Fisher est singulière et la fonction de vraisemblance profile pour le paramètre d'asymétrie admet un point stationnaire quel que soit l'échantillon considéré. Dès lors, des chercheurs ont essayé de déterminer les sous-classes de lois skew-symétriques qui souffrent de chacune de ces problématiques, ce qui a mené aux deux conjectures précitées. Cette thèse résoud complètement ces deux problèmes.

La deuxième partie, constituée des chapitres 4 et 5, poursuit le but d'appliquer et de proposer des méchanismes d'asymétrisation très généraux. Ainsi, au chapitre 4, nous utilisons le méchanisme univarié de Ferreira and Steel (2006) pour construire des tests de symétrie univariée optimaux (au sens de Le Cam) qui sont très flexibles. En effet, leur méchanisme permettant de transformer une loi symétrique donnée en n'importe quelle loi asymétrique, les contre-hypothèses à la symétrie peuvent prendre toute forme imaginable. Ces méchanismes univariés, outre cette propriété de surjectivité, possèdent de nombreux autres attraits, mais ne permettent pas une extension satisfaisante aux dimensions supérieures. Pour cette raison, nous proposons au chapitre 5 des méchanismes généraux alternatifs, qui partagent toutes les propriétés de leurs compétiteurs de Ferreira and Steel (2006), mais qui en plus sont généralisables à n'importe quelle dimension. Nous démontrons formellement que la surjectivité tient en dimension k > 1 et étudions les caractéristiques principales de ces nouveaux méchanismes multivariés.

Finalement, la troisième partie de cette thèse, composée du chapitre 6, propose un test de symétrie centrale multivariée en ayant recours aux concepts de profondeur statistique et de runs. Ce test étend le célèbre test de runs univarié de McWilliams (1990) aux dimensions supérieures. Nous en analysons le comportement asymptotique (surtout en dimension k = 2) sous l'hypothèse nulle et les propriétés d'invariance et de robustesse. Nous concluons par un aperçu sur des modifications possibles de ces nouveaux tests.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished

APA, Harvard, Vancouver, ISO, and other styles
6

Zaïdi, Abdelhamid. "Séparation aveugle d'un mélange instantané de sources autorégressives gaussiennes par la méthode du maximum de vraissemblance exact." Université Joseph Fourier (Grenoble), 2000. http://www.theses.fr/2000GRE10233.

Full text
Abstract:
Cette these est consacree a l'etude du probleme de la separation aveugle d'un melange instantane de sources gaussiennes autoregressives, sans bruit additif, par la methode du maximum de vraisemblance exact. La maximisation de la vraisemblance est decomposee, par relaxation, en deux sous-problemes d'optimisation, egalement traites par des techniques de relaxation. Le premier consiste en l'estimation de la matrice de separation a structure autoregressive des sources fixee. Le second est d'estimer cette structure lorsque la matrice de separation est fixee. Le premier probleme est equivalent a la maximisation du determinant de la matrice de separation sous contraintes non lineaires. Nous donnons un algorithme de calcul de la solution de ce probleme pour lequel nous precisons les conditions de convergence. Nous montrons l'existence de l'estimateur du maximum de vraisemblance dont nous prouvons la consistance. Nous determinons egalement la matrice d'information de fisher relative au parametre global et nous proposons un indice pour mesurer les performances des methodes de separation. Puis nous analysons, par simulation, les performances de l'estimateur ainsi defini et nous montrons l'amelioration qu'il apporte a la procedure de quasi-maximum de vraisemblance ainsi qu'aux autres methodes du second ordre.
APA, Harvard, Vancouver, ISO, and other styles
7

Achanta, Hema Kumari. "Optimal sensing matrices." Diss., University of Iowa, 2014. https://ir.uiowa.edu/etd/1421.

Full text
Abstract:
Location information is of extreme importance in every walk of life ranging from commercial applications such as location based advertising and location aware next generation communication networks such as the 5G networks to security based applications like threat localization and E-911 calling. In indoor and dense urban environments plagued by multipath effects there is usually a Non Line of Sight (NLOS) scenario preventing GPS based localization. Wireless localization using sensor networks provides a cost effective and accurate solution to the wireless source localization problem. Certain sensor geometries show significantly poor performance even in low noise scenarios when triangulation based localization methods are used. This brings the need for the design of an optimum sensor placement scheme for better performance in the source localization process. The optimum sensor placement is the one that optimizes the underlying Fisher Information Matrix(FIM) . This thesis will present a class of canonical optimum sensor placements that produce the optimum FIM for N-dimensional source localization N greater than or equal to 2 for a case where the source location has a radially symmetric probability density function within a N-dimensional sphere and the sensors are all on or outside the surface of a concentric outer N-dimensional sphere. While the canonical solution that we designed for the 2D problem represents optimum spherical codes, the study of 3 or higher dimensional design provides great insights into the design of measurement matrices with equal norm columns that have the smallest possible condition number. Such matrices are of importance in compressed sensing based applications. This thesis also presents an optimum sensing matrix design for energy efficient source localization in 2D. Specifically, the results relate to the worst case scenario when the minimum number of sensors are active in the sensor network. We also propose a distributed control law that guides the motion of the sensors on the circumference of the outer circle so that achieve the optimum sensor placement with minimum communication overhead. The design of equal norm column sensing matrices has a variety of other applications apart from the optimum sensor placement for N-dimensional source localization. One such application is fourier analysis in Magnetic Resonance Imaging (MRI). Depending on the method used to acquire the MR image, one can choose an appropriate transform domain that transforms the MR image into a sparse image that is compressible. Some such transform domains include Wavelet Transform and Fourier Transform. The inherent sparsity of the MR images in an appropriately chosen transform domain, motivates one of the objectives of this thesis which is to provide a method for designing a compressive sensing measurement matrix by choosing a subset of rows from the Discrete Fourier Transform (DFT) matrix. This thesis uses the spark of the matrix as the design criterion. The spark of a matrix is defined as the smallest number of linearly dependent columns of the matrix. The objective is to select a subset of rows from the DFT matrix in order to achieve maximum spark. The design procedure leads us to an interest study of coprime conditions on the row indices chosen with the size of the DFT matrix.
APA, Harvard, Vancouver, ISO, and other styles
8

Monaledi, R. L. "Character tables of some selected groups of extension type using Fischer-Clifford matrices." Thesis, University of the Western Cape, 2015. http://hdl.handle.net/11394/5026.

Full text
Abstract:
>Magister Scientiae - MSc
The aim of this dissertation is to calculate character tables of group extensions. There are several well developed methods for calculating the character tables of some selected group extensions. The method we study in this dissertation, is a standard application of Clifford theory, made efficient by the use of Fischer-Clifford matrices, as introduced by Fischer. We consider only extensions Ḡ of the normal subgroup N by the subgroup G with the property that every irreducible character of N can be extended to an irreducible character of its inertia group in Ḡ , if N is abelian. This is indeed the case if Ḡ is a split extension, by a well known theorem of Mackey. A brief outline of the classical theory of characters pertinent to this study, is followed by a discussion on the calculation of the conjugacy classes of extension groups by the method of coset analysis. The Clifford theory which provide the basis for the theory of Fischer-Clifford matrices is discussed in detail. Some of the properties of these Fischer-Clifford matrices which make their calculation much easier, are also given. We restrict ourselves to split extension groups Ḡ = N:G in which N is always an elementary abelian 2-group. In this thesis we are concerned with the construction of the character tables (by means of the technique of Fischer-Clifford matrices) of certain extension groups which are associated with the orthogonal group O+10(2), the automorphism groups U₆(2):2, U₆(2):3 of the unitary group U₆(2) and the smallest Fischer sporadic simple group Fi₂₂. These groups are of the type type 2⁸:(U₄(2):2), (2⁹ : L₃(4)):2, (2⁹:L₃(4)):3 and 2⁶:(2⁵:S₆).
APA, Harvard, Vancouver, ISO, and other styles
9

Benaych-Georges, Florent. "Matrices aléatoires et probabilités libres." Paris 6, 2005. http://www.theses.fr/2005PA066566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Porto, Julianna Pinele Santos 1990. "Geometria da informação : métrica de Fisher." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307256.

Full text
Abstract:
Orientador: João Eloir Strapasson
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica
Made available in DSpace on 2018-08-23T13:44:50Z (GMT). No. of bitstreams: 1 Porto_JuliannaPineleSantos_M.pdf: 2346170 bytes, checksum: 9f8b7284329ef1eb2f319c2e377b7a3c (MD5) Previous issue date: 2013
Resumo: A Geometria da Informação é uma área da matemática que utiliza ferramentas geométricas no estudo de modelos estatísticos. Em 1945, Rao introduziu uma métrica Riemanniana no espaço das distribuições de probabilidade usando a matriz de informação, dada por Ronald Fisher em 1921. Com a métrica associada a essa matriz, define-se uma distância entre duas distribuições de probabilidade (distância de Rao), geodésicas, curvaturas e outras propriedades do espaço. Desde então muitos autores veem estudando esse assunto, que está naturalmente ligado a diversas aplicações como, por exemplo, inferência estatística, processos estocásticos, teoria da informação e distorção de imagens. Neste trabalho damos uma breve introdução à geometria diferencial e Riemanniana e fazemos uma coletânea de alguns resultados obtidos na área de Geometria da Informação. Mostramos a distância de Rao entre algumas distribuições de probabilidade e damos uma atenção especial ao estudo da distância no espaço formado por distribuições Normais Multivariadas. Neste espaço, como ainda não é conhecida uma fórmula fechada para a distância e nem para a curva geodésica, damos ênfase ao cálculo de limitantes para a distância de Rao. Conseguimos melhorar, em alguns casos, o limitante superior dado por Calvo e Oller em 1990
Abstract: Information Geometry is an area of mathematics that uses geometric tools in the study of statistical models. In 1945, Rao introduced a Riemannian metric on the space of the probability distributions using the information matrix provided by Ronald Fisher in 1921. With the metric associated with this matrix, we define a distance between two probability distributions (Rao's distance), geodesics, curvatures and other properties. Since then, many authors have been studying this subject, which is associated with various applications, such as: statistical inference, stochastic processes, information theory, and image distortion. In this work we provide a brief introduction to Differential and Riemannian Geometry and a survey of some results obtained in Information Geometry. We show Rao's distance between some probability distributions, with special atention to the study of such distance in the space of multivariate normal distributions. In this space, since closed forms for the distance and for the geodesic curve are not known yet, we focus on the calculus of bounds for Rao's distance. In some cases, we improve the upper bound provided by Calvo and Oller in 1990
Mestrado
Matematica Aplicada
Mestra em Matemática Aplicada
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Matrice de Fisher"

1

Abujabal, Hamza Ali Sanousi. On the Fischer Matrices for some extensions of 2-groups. Birmingham: University of Birmingham, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cheng, Russell. The Skew Normal Distribution. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198505044.003.0012.

Full text
Abstract:
This chapter considers the univariate skew-normal distribution, a generalization of the normal that includes the normal as a special case. The most natural parametrization is non-standard. This is because the Fisher information matrix is then singular at the true parameter value when the true model is the normal special case. The log-likelihood is then particularly flat in a certain coordinate direction. Standard theory cannot then be used to calculate the asymptotic distribution of all the parameter estimates. This problem can be handled using an alternative parametrization. There is another special case: the half/folded normal distribution. This occurs in the usual parametrization when the shape parameter is infinite. This is not a problem computationally and is easily handled. There are many generalizations to skew-t distributions and to tractable multivariate forms and regression versions. A very brief review is included of these.
APA, Harvard, Vancouver, ISO, and other styles
3

Alden, Maureen. The Oresteia Story in the Odyssey. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199291069.003.0003.

Full text
Abstract:
Telemachus is encouraged to follow the example of Orestes’ return from abroad to take revenge on his mother’s suitors. (Orestes’ matricide is downplayed, so that he offers a pattern which does not compromise Telemachus’ moral standing.) Agamemnon is trapped in an ambush and murdered at a feast by a trick of his wife’s to achieve a cross-over parallel with the suitors, who are tricked (by Penelope), ambushed, and murdered at a feast. The fish-and-net simile used of the suitors’ bodies lying in the hall parodies Agamemnon’s traditional murder in the bath tangled up in a cloth. Penelope’s instructions for the care of her guest, the disguised Odysseus, parody the bath, textiles, and bed/bier which later appear in Aeschylus’ Oresteia.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Matrice de Fisher"

1

Mingo, James A., and Roland Speicher. "Free Entropy χ ∗: The Non-microstates Approach via Free Fisher Information." In Free Probability and Random Matrices, 195–223. New York, NY: Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4939-6942-5_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nel, D. G., and P. C. N. Groenewald. "On a Fisher—Cornish Type Expansion of Wishart Matrices." In Innovations in Multivariate Statistical Analysis, 223–32. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4603-0_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Desai, Tejas. "On Testing Equality of Covariance Matrices." In A Multiple-Testing Approach to the Multivariate Behrens-Fisher Problem, 17–29. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6443-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Heavens, A. "Fisher Matrices and All That: Experimental Design and Data Compression." In Data Analysis in Cosmology, 51–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-44767-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gepperth, Alexander, and Florian Wiech. "Simplified Computation and Interpretation of Fisher Matrices in Incremental Learning with Deep Neural Networks." In Lecture Notes in Computer Science, 481–94. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30484-3_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zinn-Justin, Jean. "Critical phenomena: The field theory approach." In From Random Walks to Random Matrices, 81–100. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198787754.003.0006.

Full text
Abstract:
Chapter 6 describes how the perturbative renormalization group (RG) of quantum field theory has made it possible to derive universal properties of continuous macroscopic phase transitions. The RG initially emerged as a consequence of the necessity to cancel infinities that appear in the perturbative expansion (the renormalization procedure) and the possibility of defining the parameters of the renormalized theory at different momentum scales. Although the field theory RG is now understood to be an asymptotic form, it has made it possible to confirm the Wilson–Fisher fixed point and led to an understanding of universality for a large class of critical phenomena. In the framework of dimensional continuation, zeros of RG beta functions, which correspond to Wilson–Fisher’s fixed points, have made it possible to recover Wilson–Fisher’s epsilon expansion, proving scaling relations and calculating critical exponents. Series summation methods have then been used to generate precise values of exponents.
APA, Harvard, Vancouver, ISO, and other styles
7

"ON THE CORNISH-FISHER EXPANSION IN FINITE POPULATION." In Multivariate Statistics and Matrices in Statistics, 35–42. De Gruyter, 1995. http://dx.doi.org/10.1515/9783112314210-004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Basor, Estelle L. "Toeplitz determinants, Fisher-Hartwig symbols, and random matrices." In Recent Perspectives in Random Matrix Theory and Number Theory, 309–36. Cambridge University Press, 2005. http://dx.doi.org/10.1017/cbo9780511550492.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, David, Xiao-Yuan Jing, and Jian Yang. "2D Image Matrix-Based Discriminator." In Computational Intelligence and its Applications, 258–86. IGI Global, 2006. http://dx.doi.org/10.4018/978-1-59140-830-7.ch011.

Full text
Abstract:
This chapter presents two straightforward image projection techniques — two-dimensional (2D) image matrix-based principal component analysis (IMPCA, 2DPCA) and 2D image matrix-based Fisher linear discriminant analysis (IMLDA, 2DLDA). After a brief introduction, we first introduce IMPCA. Then IMLDA technology is given. As a result, we summarize some useful conclusions.
APA, Harvard, Vancouver, ISO, and other styles
10

Selli, Serkan, Onur Sevindik, Gamze Guclu, and Jing Zhao. "Flavour of Fish and Fish Proteins." In Flavour and Consumer Perception of Food Proteins, 119–49. Royal Society of Chemistry, 2023. http://dx.doi.org/10.1039/9781839165047-00119.

Full text
Abstract:
Fish or fishery products are appreciated worldwide for their unique flavour and nutritional benefits. Fresh fish is a composite matrix that has a balance of lipids and lipid-derived compounds, amino acids, proteins, nucleotides, carbohydrates, and other minor compounds that are responsible for the distinct and delicate flavour of seafood. Complex lipolytic and proteolytic reactions affect the generation and the perception of seafood flavour. The realization of these complicated interactions, including specific reactions of thermal degradation, Maillard pathway, enzyme activity and oxidation, is summarized, and the constitutive compounds produced from the reactions are explained in detail. This chapter predominantly focuses on the generation of fish flavour and the effects of diverse external and internal processes on its formation. Additionally, an overview of the valorization of seafood wastes and by-products into protein hydrolysates is provided.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Matrice de Fisher"

1

Peeters, Ralf L. M., and Bernard Hanzon. "Symbolic computation of fisher information matrices." In 1997 European Control Conference (ECC). IEEE, 1997. http://dx.doi.org/10.23919/ecc.1997.7082483.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Costa, S. I. R., S. A. Santos, and J. E. Strapasson. "Fisher information matrix and hyperbolic geometry." In IEEE Information Theory Workshop, 2005. IEEE, 2005. http://dx.doi.org/10.1109/itw.2005.1531851.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

ALLAHDADIAN, SAEID, MICHAEL DÖHLER, CARLOS VENTURA, and LAURENT MEVEL. "Hierarchical Fisher-information-matrix-based Clustering." In Structural Health Monitoring 2019. Lancaster, PA: DEStech Publications, Inc., 2019. http://dx.doi.org/10.12783/shm2019/32478.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zheng, Zhonglong, Mudan Yu, Jiong Jia, Huawen Liu, Haixin Zhang, Fangmei Fu, and Xiaoqiao Huang. "Fisher Discrimination Based Low Rank Matrix Recovery." In 2013 2nd IAPR Asian Conference on Pattern Recognition (ACPR). IEEE, 2013. http://dx.doi.org/10.1109/acpr.2013.48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Agarwal, A. "Large N Matrix Models and Noncommutative Fisher Information." In THEORETICAL PHYSICS: MRST 2002: A Tribute to George Leibbrandt. AIP, 2002. http://dx.doi.org/10.1063/1.1524569.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Zhan, and Gamini Dissanayake. "Observability analysis of SLAM using fisher information matrix." In 2008 10th International Conference on Control, Automation, Robotics and Vision (ICARCV). IEEE, 2008. http://dx.doi.org/10.1109/icarcv.2008.4795699.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Yong, and Jianhu Guo. "Weighted Fisher Non-negative Matrix Factorization for Face Recognition." In 2009 Second International Symposium on Knowledge Acquisition and Modeling. IEEE, 2009. http://dx.doi.org/10.1109/kam.2009.320.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ali, Muhammad, Michael Antolovich, and Boyue Wang. "Density estimation on Stiefel manifolds using matrix-Fisher model." In 2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI). IEEE, 2016. http://dx.doi.org/10.1109/cisp-bmei.2016.7852683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lei, Ming, Christophe Baehr, and Pierre Del Moral. "Fisher information matrix-based nonlinear system conversion for state estimation." In 2010 8th IEEE International Conference on Control and Automation (ICCA). IEEE, 2010. http://dx.doi.org/10.1109/icca.2010.5524066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gao, Ruizhou, Yunhong Ma, Yimin Zhang, and Xinyi Li. "Target Combat Intention Recognition Based on Improved Fisher Information Matrix." In 2023 International Conference on Cyber-Physical Social Intelligence (ICCSI). IEEE, 2023. http://dx.doi.org/10.1109/iccsi58851.2023.10303971.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Matrice de Fisher"

1

Ortiz, M. Analytical Methods of Approximating the Fisher Information Matrix for the Lognormal Distribution. Office of Scientific and Technical Information (OSTI), August 2018. http://dx.doi.org/10.2172/1557955.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wadman, Heidi, and Jesse McNinch. Spatial distribution and thickness of fine-grained sediment along the United States portion of the upper Niagara River, New York. Engineer Research and Development Center (U.S.), August 2021. http://dx.doi.org/10.21079/11681/41666.

Full text
Abstract:
Over 220 linear miles of geophysical data, including sidescan sonar and chirp sub-bottom profiles, were collected in 2016 and 2017 by the US Army Corps of Engineers and the US Fish and Wildlife Service in the upper Niagara River. In addition, 36 sediment grab samples were collected to groundtruth the geophysical data. These data were used to map the spatial distribution of fine-grained sediment, including volume data in certain locations, along the shallow shorelines of the upper Niagara River. Overall, the most extensive deposits were spatially associated with either small tributaries or with man-made structures that modified the natural flow of the system. Extensive beds of submerged aquatic vegetation (SAV) were also mapped. Although always associated with a fine-grained matrix, the SAV beds were patchy in distribution, which might reflect subtle differences in the grain size of the sediment matrix or could simply be a function of variations in species or growth. The maps generated from this effort can be used to guide sampling plans for future studies of contamination in fine-grained sediment regions.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Matrice de Fisher' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography