Gotowa bibliografia na temat „Multilinéaire”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Multilinéaire”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Multilinéaire"
Sergent, A., M. Pillet i D. Duret. "Application de la méthode de régression multilinéaire à la détermination statistique des tolérances". Journal de Physique IV (Proceedings) 12, nr 11 (grudzień 2002): 49–56. http://dx.doi.org/10.1051/jp4:20020474.
Pełny tekst źródłaDa Silva Pinto, P. S., R. P. Eustache, M. Audenaert i J. M. Bernassau. "Calculs empiriques de déplacements chimiques RMN 13C de polymères par régression multilinéaire et modélisation moléculaire". Revue de l'Institut Français du Pétrole 51, nr 1 (styczeń 1996): 125–29. http://dx.doi.org/10.2516/ogst:1996011.
Pełny tekst źródłaDurand, Jacques. "La phonologie multidimensionnelle moderne et la description du français". Journal of French Language Studies 3, nr 2 (wrzesień 1993): 197–229. http://dx.doi.org/10.1017/s0959269500001757.
Pełny tekst źródłaMOTTELET, S., A. FILALI, S. GUERIN-RECHDAOUI, V. ROCHER, S. AZIMI i A. PAUSS. "Mesure en ligne des concentrations d’ions nitrites et nitrates pour l’optimisation de la dénitrification et la réduction de la production de protoxyde d’azote". Techniques Sciences Méthodes, nr 6 (22.06.2020): 23–32. http://dx.doi.org/10.36904/tsm/202006023.
Pełny tekst źródłaNoui, Lemnouar, i Philippe Revoy. "Formes multilinéaires alternées". Annales mathématiques Blaise Pascal 1, nr 2 (1994): 43–69. http://dx.doi.org/10.5802/ambp.12.
Pełny tekst źródłaRialland, Annie. "Systèmes prosodiques africains : une source d'inspiration majeure pour les théories phonologiques multilinéaires". Faits de langues 6, nr 11 (1998): 407–28. http://dx.doi.org/10.3406/flang.1998.1224.
Pełny tekst źródłaBangoura, Momo. "Algèbres de Lie d'homotopie associées à une proto-bigèbre de Lie". Canadian Journal of Mathematics 59, nr 4 (1.08.2007): 696–711. http://dx.doi.org/10.4153/cjm-2007-030-5.
Pełny tekst źródłaVarro, Richard. "Identités Multilinéaires de Degré 4 pour les Algèbres de Bernstein et de Mutation Non Commutatives". Communications in Algebra 40, nr 7 (lipiec 2012): 2426–48. http://dx.doi.org/10.1080/00927872.2011.578605.
Pełny tekst źródłaHUSSON, A., Y. LE GAT, A. VACELET, A. E. STRICKER, E. BRÉJOUX i E. RENAUD. "Évaluation du patrimoine des réseaux d’eau potable français dans le but d’améliorer la conduite des politiques publiques de gestion patrimoniale". Techniques Sciences Méthodes, nr 5 (20.05.2020): 31–44. http://dx.doi.org/10.36904/tsm/202005031.
Pełny tekst źródłaLiu, Fu. "On bijections between monotone rooted trees and the comb basis". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings, 27th..., Proceedings (1.01.2015). http://dx.doi.org/10.46298/dmtcs.2480.
Pełny tekst źródłaRozprawy doktorskie na temat "Multilinéaire"
Pellet--Mary, Alice. "Réseaux idéaux et fonction multilinéaire GGH13". Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEN048/document.
Pełny tekst źródłaLattice-based cryptography is a promising area for constructing cryptographic primitives that are plausibly secure even in the presence of quantum computers. A fundamental problem related to lattices is the shortest vector problem (or SVP), which asks to find a shortest non-zero vector in a lattice. This problem is believed to be intractable, even quantumly. Structured lattices, for example ideal lattices or module lattices (the latter being a generalization of the former), are often used to improve the efficiency of lattice-based primitives. The security of most of the schemes based on structured lattices is related to SVP in module lattices, and a very small number of schemes can also be impacted by SVP in ideal lattices.In this thesis, we first focus on the problem of finding short vectors in ideal and module lattices.We propose an algorithm which, after some exponential pre-computation, performs better on ideal lattices than the best known algorithm for arbitrary lattices. We also present an algorithm to find short vectors in rank 2 modules, provided that we have access to some oracle solving the closest vector problem in a fixed lattice. The exponential pre-processing time and the oracle call make these two algorithms unusable in practice.The main scheme whose security might be impacted by SVP in ideal lattices is the GGH13multilinear map. This protocol is mainly used today to construct program obfuscators, which should render the code of a program unintelligible, while preserving its functionality. In a second part of this thesis, we focus on the GGH13 map and its application to obfuscation. We first study the impact of statistical attacks on the GGH13 map and on its variants. We then study the security of obfuscators based on the GGH13 map and propose a quantum attack against multiple such obfuscators. This quantum attack uses as a subroutine an algorithm to find a short vector in an ideal lattice related to a secret element of the GGH13 map
Rialland, Annie. "Systèmes prosodiques africains : ou fondements empiriques pour un modèle multilinéaire". Nice, 1988. http://www.theses.fr/1988NICE2019.
Pełny tekst źródłaCastaing, Joséphine. "Méthodes PARAFAC pour la séparation de signaux". Cergy-Pontoise, 2006. http://biblioweb.u-cergy.fr/theses/06CERG0324.pdf.
Pełny tekst źródłaIn different applications, the observed signals can be stacked in a third-order tensor that can be decomposed in a sum of rank-one tensors. Such a decomposition is called PARAFAC. Our work presents a new method to estimate the parameters of the decomposition based on a simultaneous diagonalization and yields a new bound on the number of these parameters. We apply this method to CDMA signals, which have the PARAFAC structure. Moreover, we propose to combine PARAFAC structure and constant modulus constraint on the sources. We also show that it is possible to exploit the algebraic structure of the data to perform Independent Component Analysis in the underdetermined case. Finally, we study the rank of a random tensor, called generic rank, and we propose a technique to compute this rank in some particular cases
González-Mazón, Pablo. "Méthodes effectives pour les transformations birationnelles multilinéaires et contributions à l'analyse polynomiale de données". Electronic Thesis or Diss., Université Côte d'Azur, 2023. http://www.theses.fr/2023COAZ4138.
Pełny tekst źródłaThis thesis explores two distinct subjects at the intersection of commutative algebra, algebraic geometry, multilinear algebra, and computer-aided geometric design:1. The study and effective construction of multilinear birational maps2. The extraction of information from measures and data using polynomialsThe primary and most extensive part of this work is devoted to multilinear birational maps.A multilinear birational map is a rational map phi: (mathbb{P}^1)^n dashrightarrow{} mathbb{P}^n, defined by multilinear polynomials, which admits an inverse rational map. Birational transformations between projective spaces have been a central theme in algebraic geometry, tracing back to the seminal works of Cremona, which has witnessed significant advancement in the last decades. Additionally, there has been a recent surge of interest in tensor-product birational maps, driven by the study of multiprojective spaces in commutative algebra and their practical application in computer-aided geometric design.In the first part, we address algebraic and geometric aspects of multilinear birational maps.We primarily focus on trilinear birational maps phi: (mathbb{P}^1)^3 dashrightarrow{} mathbb{P}^3, that we classify according to the algebraic structure of their space, base loci, and the minimal graded free resolutions of the ideal generated by the defining polynomials. Furthermore, we develop the first methods for constructing and manipulating nonlinear birational maps in 3D with sufficient flexibility for geometric modeling and design.Interestingly, we discover a characterization of birationality based on tensor rank, which yields effective constructions and opens the door to the application of tools from tensors to birationality. We also extend our results to multilinear birational maps in arbitrary dimension, in the case that there is a multilinear inverse.In the second part, our focus shifts to the application of polynomials in analyzing data and measures.We tackle two distinct problems. Firstly, we derive bounds for the size of (1-epsilon)-nets for superlevel sets of real polynomials. Our results allow us to extend the classical centerpoint theorem to polynomial inequalities of higher degree. Secondly, we address the classification of real cylinders through five-point configurations where four points are cocyclic, i.e. they lie on a circumference. This is an instance of the more general problems of real root classification of systems of real polynomials and the extraction of algebraic primitives from raw data
Miron, Sebastian. "Méthodes multilinéaires et hypercomplexes en traitement d'antenne multicomposante haute résolution". Phd thesis, Grenoble INPG, 2005. http://www.theses.fr/2005INPG0102.
Pełny tekst źródłaThis research is devoted 1,0 vector-sensor array processing methods. The signaIs recorded on a vector-sensor array allow the estimation of the direction of arrivaI and polarization for multiple waves impinging on the antenna. We show how the correct use of polarization information improves the performance of algorithms. The novelty of the presented work consists in the use of mathematical models well-adapted 1,0 the intrinsic nature of vectorial signaIs. The first approach is based on a multilinear model of polarization that preserves the intrinsic structure of multicomponent acquisition. Ln this case, the data covariance model is represented by a cross-spectral tensor. We propose two algorithms (Vector-MUSIC and Higher-Order MUSIC) based on orthogonal decompositions of the cross-spectral tensor. We show in simulations that the use of this model and of the multilinear orthogonal decompositions improve the performance of the proposed methods compared to classical techniques based on linear algebra. A second approach uses hypercomplex algebras. Quaternion and biquaternion vectors are used to model the polarized signaIs recorded on two, three or four component sensor arrays. Quaternion-MUSIC and Biquaternion-MUSIC algorithrns, based on the diagonalization of quaternion and biquaternion matrices are introduced. We show that the use of hypercornplex numbers reduces the computational burden and increases the solution power of the methods
Heraud, Nicolas. "Validation de données et observabilité des systèmes multilinéairesé". Vandoeuvre-les-Nancy, INPL, 1991. http://www.theses.fr/1991INPL082N.
Pełny tekst źródłaThe aim of this study is to investigate data validation and observability of miltilinear systems to diagnose instrumentation in a process. Data validation and observability in linear systems are first reviewed and these notions are extended to multilinear systems. Differents methods such as hierarchical computation, constraint linearization and penalization functions, are presented to estimate true values when some values are lacking. After comparing the different methods, a recurrent calculus of estimates using constraint linearization and penalization functions is developed. An observable system is required in order to perform data validation. Thus, we developed an original method, based on arborescent diagrams. The technique of data validation has been successfully applied to a complex uranium processing plant owned by the French company Total Compagnie Minière France. On this partially instrumented process, measurements for volumic flow, density and uranium in both solid and liquid phase are available. The analysis allows first to obtain coherent date. Furthemore, it can be used to detect sensors faults
Letexier, Damien. "Filtrages tensoriels adaptatifs pour la restauration d'images multidimensionnelles". Aix-Marseille 3, 2009. http://www.theses.fr/2009AIX30019.
Pełny tekst źródłaThis thesis is devoted to multidimensional signal processing. The main interest of the proposed methods relies on the tensor modeling of data sets. Therefore, the whole parameters are considered while processing tensors. Multilinear algebra tools are required to design the presented multidimensional filters : higher order singular value troncature, lower rank tensor approximation or multidimensional Wiener filtering. However, these filters use an orthogonal flattening step that may not be adapted to data. A new method is proposed to avoid this shortcoming. This is useful for image applications such as color or hyperspectral images. It is shown that the signal to noise ratio can be improved if flattening directions are chose properly. This manuscript also propose a new method including higher order statistics to remove Gaussian components from multidimensional data. Some examples are given for color and hyperspectral images
Karfoul, Ahmad. "Canonical decomposition of hermitian arrays : application to ICA and blind underdetermined mixture identification". Rennes 1, 2009. http://www.theses.fr/2009REN1S215.
Pełny tekst źródłaThe goal of this thesis is to propose new methods for CANonical Decomposition (CAND) of Higher Order (HO) Hermitian arrays. The main motivation is to solve the Independent Component Analysis (ICA) and the blind under-determined mixture identification problems. First, we propose a new family of methods to jointly decompose several HO Hermitian arrays. This family involves two different approaches; semi-algebraic and iterative. Regarding the iterative one we propose a new ALS (Alternate Least Square)-like method that contrary to the classical ALS one fully exploits the symmetry in the HO array it processes. Second, we evaluate the impact of exploiting the symmetry that resides in the HO array we process. That is in terms of convergence speed and numerical complexity giving rise to a new iterative algorithm. Third, we propose an efficient way to rely iterative approaches to semi-algebraic ones in such a way a better solution is guaranteed. Finally the numerical complexity of different ICA methods is studied
Renard, Nadine. "Traitement du signal tensoriel. Application à l'imagerie hyperspectrale". Aix-Marseille 3, 2008. http://www.theses.fr/2008AIX30062.
Pełny tekst źródłaThis thesis focus on developing new algebraic methods for hyperspectral applications. The proposed method are original because based on new data representation using third-order tensor. This data representation involves the use of multilinear algebra tools. The proposed methods are referred to as multiway or multimodal methods. TUCKER tensor decompositionbased methods jointly analyze the spatial and spectral modes using an alternating least squares algorithm. This thesis focus on two problematics specific to hyperspectral images. The first one concerns noise reduction. The considered additive noise is due to the acquisition system and degrades the target detection efficiency. A robust to noise detection technique is proposed by incorporating a multimodal Wiener filter. The spatial and spectral n-mode filters are estimated by minimizing the mean squared error between the desired and estimated tensors. The second problematic is the spectral dimension reduction. The curse of the dimensionality degrades the statistical estimation for the classification process. For this issue, the proposed multimodal reduction method reduces the spectral mode by linear transformation jointly to the lower spatial ranks approximation. This method extends the traditional dimension reduction methods. These two multimodal methods are respectively assessed in respect to their impact on detection and classification efficiency. These results highlight the interest of the spatial/spectral analysis in comparison to the traditional spectral analysis only and the hybrid ones which process sequentially the spectral and the spatial mode
Boizard, Mélanie. "Développement et études de performances de nouveaux détecteurs/filtres rang faible dans des configurations RADAR multidimensionnelles". Electronic Thesis or Diss., Cachan, Ecole normale supérieure, 2013. http://www.theses.fr/2013DENS0063.
Pełny tekst źródłaMost of statistical signal processing algorithms, are based on the use of signal covariance matrix. In practical cases this matrix is unknown and is estimated from samples. The adaptive versions of the algorithms can then be applied, replacing the actual covariance matrix by its estimate. These algorithms present a major drawback: they require a large number of samples in order to obtain good results. If the covariance matrix is low-rank structured, its eigenbasis may be separated in two orthogonal subspaces. Thanks to the LR approximation, orthogonal projectors onto theses subspaces may be used instead of the noise CM in processes, leading to low-rank algorithms. The adaptive versions of these algorithms achieve similar performance to classic classic ones with less samples. Furthermore, the current increase in the size of the data strengthens the relevance of this type of method. However, this increase may often be associated with an increase of the dimension of the system, leading to multidimensional samples. Such multidimensional data may be processed by two approaches: the vectorial one and the tensorial one. The vectorial approach consists in unfolding the data into vectors and applying the traditional algorithms. These operations are not lossless since they involve a loss of structure. Several issues may arise from this loss: decrease of performance and/or lack of robustness. The tensorial approach relies on multilinear algebra, which provides a good framework to exploit these data and preserve their structure information. In this context, data are represented as multidimensional arrays called tensor. Nevertheless, generalizing vectorial-based algorithms to the multilinear algebra framework is not a trivial task. In particular, the extension of low-rank algorithm to tensor context implies to choose a tensor decomposition in order to estimate the signal and noise subspaces. The purpose of this thesis is to derive and study tensor low-rank algorithms. This work is divided into three parts. The first part deals with the derivation of theoretical performance of a tensor MUSIC algorithm based on Higher Order Singular Value Decomposition (HOSVD) and its application to a polarized source model. The second part concerns the derivation of tensor low-rank filters and detectors in a general low-rank tensor context. This work is based on a new definition of tensor rank and a new orthogonal tensor decomposition : the Alternative Unfolding HOSVD (AU-HOSVD). In the last part, these algorithms are applied to a particular radar configuration : the Space-Time Adaptive Process (STAP). This application illustrates the interest of tensor approach and algorithms based on AU-HOSVD
Książki na temat "Multilinéaire"
Yokonuma, Takeo. Tensor spaces and exterior algebra. Providence, R.I: American Mathematical Society, 1992.
Znajdź pełny tekst źródłaGuin, Daniel. Algèbre T2: Anneaux, Modules, et Algèbre Multilinéaire. EDP Sciences, 2021.
Znajdź pełny tekst źródłaNorthcott, D. G. Multilinear Algebra. Cambridge University Press, 2010.
Znajdź pełny tekst źródłaNorthcott, D. G. Multilinear Algebra. Cambridge University Press, 2011.
Znajdź pełny tekst źródłaNorthcott, D. G. Multilinear Algebra. Cambridge University Press, 2009.
Znajdź pełny tekst źródłaCoifman, R. R., i Yves Meyer. Ondelettes et opérateurs, tome 3 : Opérateurs multilinéaires. Hermann, 1991.
Znajdź pełny tekst źródła