Добірка наукової літератури з теми "Paramétrée"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Paramétrée".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Paramétrée":
Couvreur, J. M., S. Haddad, and J. F. Peyre. "Résolution paramétrée de familles de systèmes linéaires." RAIRO - Operations Research 26, no. 2 (1992): 183–206. http://dx.doi.org/10.1051/ro/1992260201831.
Saint-Pierre, Jean, and Saïd Sajid. "Intégration de multifonctions par rapport à une mesure paramétrée." Comptes Rendus de l'Académie des Sciences - Series I - Mathematics 324, no. 1 (January 1997): 55–60. http://dx.doi.org/10.1016/s0764-4442(97)80103-6.
Sambou, S. "Comparaison par simulation de Monte-Carlo des propriétés de deux estimateurs du paramètre d'échelle de la loi exponentielle : méthode du maximum de vraisemblance (MV) et méthode des moindres carrés (MC)." Revue des sciences de l'eau 17, no. 1 (April 12, 2005): 23–47. http://dx.doi.org/10.7202/705521ar.
Chambon, O., P. Cialdella, M. Marie-Cardine, and J. L. Terra. "Une voie de recherche en psychopathologie quantitative: présentation des travaux de P. Bech." Psychiatry and Psychobiology 4, no. 3 (1989): 133–38. http://dx.doi.org/10.1017/s0767399x00001553.
Rowe, Timothy. "Paramétrage «scientifique»." Journal of Obstetrics and Gynaecology Canada 33, no. 6 (June 2011): 577–78. http://dx.doi.org/10.1016/s1701-2163(16)34902-7.
Laug, Patrick, Houman Borouchaki, and Erwan Renaut. "Linéarisation et maillage des surfaces paramétrées." Comptes Rendus Mathematique 349, no. 9-10 (May 2011): 591–95. http://dx.doi.org/10.1016/j.crma.2011.03.020.
Akrout, H. "Théorème de Voronoï dans les espaces symétriques." Canadian Journal of Mathematics 54, no. 3 (June 1, 2002): 449–67. http://dx.doi.org/10.4153/cjm-2002-015-1.
Ladányi, Zsuzsanna, Alexandra Fábián, Adrienn Ujvári, Márton Tokodi, Tímea Turschl, Tímea Bálint, Dávid Nagy, et al. "A bal kamrai kontraktilitás korszerű echokardiográfiás vizsgálata: a miokardiális munka." Cardiologia Hungarica 53, no. 6 (2023): 577–84. http://dx.doi.org/10.26430/chungarica.2023.53.6.577.
Groz, Roland, Muzammil Shahbaz, and Kegin Li. "Extraction de modèles paramétrés au cours du test de composants logiciels." Techniques et sciences informatiques 27, no. 8 (October 30, 2008): 977–1006. http://dx.doi.org/10.3166/tsi.27.977-1006.
Bourgeois-République, C., and P. Collet. "Aide au paramétrage d'implant cochléaire par algorithme évolutionnaire." J3eA 3 (2004): 019. http://dx.doi.org/10.1051/bib-j3ea:2004619.
Дисертації з теми "Paramétrée":
Chamseddine, Najla. "Analyse quantitative paramétrée d'automates temporisés probabilistes." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2009. http://tel.archives-ouvertes.fr/tel-00626062.
Fradin, Julien. "Graphes complexes en biologie : problèmes, algorithmes et évaluations." Thesis, Nantes, 2018. http://www.theses.fr/2018NANT4093/document.
Ln order to better understand how a biological system works, it is necessary to study the interactions between the different entities that compose it. To this aim, these biological interactions can be modelled in the form of graphs. ln some of these graphs, the vertices are colored in order to provide additional information on the entity which is associated with them. ln this context, a common subproblem consists in searching for a subgraph of interest, called a motif, in these graphs. ln the first part of this manuscript, we present a state of the art from an algorithmical point of view of the GRAPH MOTIF problem, which consists in searching for so-called functional motifs in vertex-colored graphs. The modeling of biological systems in graphs form can also be applied in mass spectrometry. Thus, we introduce the MAXIMUM COLORFUL ARBORESCENCE problem (MCA) in order to de novo determine the molecular formula of unknown metabolites. ln the second part of this manuscript, we carry out an algorithmic study of the MCA problem. While MCA is algorithmically difficult to solve even in very constrained graph classes, our modeling allows us to obtain new approximation algorithms in these same classes, as well as to determine a new graph class in which MCA is solved in polynomial time. Parameterized complexity results for this problem are also shown, which are then compared to those in the literature on instances from biological data
Dailler, Sylvain. "Extension paramétrée de compilateur certifié pour la programmation parallèle." Thesis, Orléans, 2015. http://www.theses.fr/2015ORLE2071/document.
Nowadays, we are using an increasing number of computer applications. Errors in critical applications (medicine, transport, . . .) may carry serious health or financial issues. Avoiding errors in programs is a challenge and may be achieved by deductive verification. Deductive verification applies to program written in a high-level languages, which are transformed into machine language by compilers. These compilers must be correct to ensure the nonpropagation of errors to machine code. Since 2005, multicore processors have spread in all electronic devices. So, these architectures need adapted compilers and proofs of correctness. Our work is the modular extension of a verified compiler for parallel languages targeting multicore architectures. Specifications of these languages (and their operational semantics) needed at all levels of the compiler and proofs of correctness of this compiler are parameterized by modules specifying elements of parallelism such as a relaxed memory model and notions of synchronization and scheduling between threads. This work is the first step in the conception of a certified compiler for high-level parallel languages such as algorithmic skeletons
Bonnet, Edouard. "Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée." Thesis, Paris 9, 2014. http://www.theses.fr/2014PA090040/document.
Several real-Life problems are NP-Hard and cannot be solved in polynomial time.The two main options to overcome this issue are: approximation and parameterized complexity. In this thesis, we present a new technique called greediness-For-Parameterization and we use it to improve the parameterized complexity of many problems. We also use this notion to obtain parameterized algorithms for some problems in bipartite graphs. Aiming at establishing negative results on the approximability in subexponential time and in parameterized time, we introduce new methods of sparsification that preserves approximation. We combine those "sparsifiers" with known or new reductions to achieve our goal. Finally, we present some hardness results of games such as Bridge and Havannah
Chopin, Morgan. "Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation." Phd thesis, Université Paris Dauphine - Paris IX, 2013. http://tel.archives-ouvertes.fr/tel-00933769.
Rinaudo, Philippe. "Algorithmique de l'alignement structure-séquence d'ARN : une approche générale et paramétrée." Phd thesis, Université Paris Sud - Paris XI, 2012. http://tel.archives-ouvertes.fr/tel-00847745.
Morançay, Lionel. "Représentation paramétrée et modélisation des systèmes physiques pour la conception optimale." Compiègne, 1993. http://www.theses.fr/1993COMP582S.
Duvillié, Guillerme. "Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT321/document.
In this thesis, we focused in the Wafer-to-Wafer integration problems. These problems come from IC manufacturing. During the production of three-dimensional processors, dies have to be superimposed. Until recent, the dies were engraved on a silicon disk called wafer, then were cut, tested and sorted to suppress faulty dies and lastly superimposed one to each other.However superimposing wafers instead of dies presents several technical and financial advantages. Since faulty dies can only be dismissed when cutting the wafer, superimpose two wafers can lead to superimpose a faulty die with a viable one. In this case, the resulting stack of dies is considered as faulty. It follows that a bad assignment between the wafers can lead to a disastrous yield.In order to minimize the number of faulty dies stacks, a "failure map" of each wafer is generated during a test phase. This map gives location of the faulty dies on the wafers. The objective is then to take advantage of this map to define an assignment of the wafers to each other in order to match as many failures as possible.This problem can be modelized with Multidimensional Assignment problems. Each wafer can be seen as a vector with as many dimensions as the number of dies engraved on it. A coordinate set to zero marks a faulty die while a coordinate set to one indicates a viable one. Each seat of wafers is represented by a set of vector. Formally, an instance of a Wafer-to-Wafer integration problem is represented by m sets of n p-dimensional vectors. The objective is then to partition the vectors into n disjoint m-tuples, each tuple containing exactly one vector per set. An m-tuple represents a stack of wafers. Every m-tuple can be represented by a p-dimensional vector. Each coordinate is computed by performing the bitwise AND between the corresponding coordinates of the vectors that compose the m-tuple. In other words, a coordinate of the representative vector is equal to one if and only if this coordinate is equal to one in every vector composing the tuple. It follows that a dies stack is viable if and only if all the dies composing the stack are viable. The objective is then to maximize the overall number of ones of to minimize the overall number of zeros.The first part of the thesis is a theoretical one. We study the complexity of the considered versions of the problem with regards to natural parameters such as m, n, p or the number of zeros per vector. We show that these problems can encode more classical problems such as Maximum Clique, Minimum Vertex Cover or k-Dimensional Matching. This leads to several negative results from computational complexity, approximability or even parameterized complexity point of view. We also provide several positive results for some specific cases of the problem.In a second part, we focus on the practical solving of the problem. We provide and compare several Integer Linear Programming formulations. We also focus on performances of some approximation algorithms that we detailed in the theoretical part
Efremov, Semen. "Croissance paramétrée et bruit procédural pour la conception de métamatériaux mécaniques." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0046.
With constant development of technologies, computational and manufacturing capabilities increase, production methods evolve, and new techniques appear. As a result, the need for new materials with tailored, optimized properties for different applications arises. Periodic composites with tailored microstructure topology, called cellular metamaterials are extensively studied in this context. These structures are known for their remarkable mechanical properties, including high strength, lower weight, and increased energy absorption. The use of these materials allows to achieve improved physical properties or specific functional features and provides economical gain and ecological benefit.This thesis is dedicated to the development and analysis of methods for computer-aided design of materials with tailored mechanical properties. The mechanical metamaterials were studied through two different approaches: modelling periodic structures through a parameterized growth model and procedural noise functions. To tackle the challenge of obtaining near-regular microstructures with progressively varying properties, I proposed and studied a cellular material spawned by a growth process. The growth is parameterized by a 3D star-shaped set at each lattice point, defining the geometry that will appear around it. Individual tiles may be computed and used in a periodic lattice, or a global structure may be produced under spatial gradations, changing the parametric star-shaped set at each lattice location. Beyond free spatial gradation, an important advantage of this approach is that elastic symmetries can be intrinsically enforced. It is shown in this work how shared symmetries between the lattice and the star-shaped set directly translate into symmetries of the periodic structures' elastic response. Thus, the approach enables restricting the symmetry of the elastic responses -- monoclinic, orthorhombic, trigonal, and so on -- while freely exploring a wide space of possible geometries and topologies. I provide a comprehensive study of the space of symmetries and broad combinations of growth process parameters. Furthermore, I demonstrate through numerical and experimental results the expected responses triggered by the obtained structures.The second contribution of this thesis is a novel procedural pattern synthesis technique. This approach exhibits desirable properties for modeling highly contrasted patterns, that are well suited to produce surface and microstructure details. This approach defines a stochastic smooth phase field –- a phasor noise –- that is then fed into a periodic function (e.g. a sine wave), producing an oscillating field with prescribed main frequencies and preserved contrast oscillations. I present in this thesis a mathematical model, that builds upon a reformulation of Gabor noise in terms of a phasor field that affords for a clear separation between local intensity and phase. In particular, I study the behavior of phasor noise in terms of its power spectrum. Hence, a comparative theoretical study of phasor noise was performed in order to gain understanding of links between its properties and parameters
Andami, Ovono Armel. "Equations de diffusion paramétrée par la portée des interactions à longue distance." Phd thesis, Université de Poitiers, 2009. http://tel.archives-ouvertes.fr/tel-00365445.
Книги з теми "Paramétrée":
Duflos, Emmanuel. Estimation prédiction: Éléments de cours et exercices résolus. Paris: Éditions Technip, 2000.
KFITA, Abdelaziz EL, and et al. Mise en Place de la GMAO: Cas d'Etude d'Analyse et Paramétrage Pour l'instauration de la Gestion de la Maintenance Assistée Par Ordinateur. Independently Published, 2020.
Частини книг з теми "Paramétrée":
Raby, Gilles. "Paramétrix, cohomologie et formes méromorphes." In Séminaire d’Analyse P. Lelong — P. Dolbeault — H. Skoda, 167–225. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/bfb0081983.
Angoujard, Jean-Pierre. "Accentuation et Syncope dans le Parler du Caire: Quels Paramétrés?" In Publications in African Languages and Linguistics, edited by David Odden, 13–20. Berlin, Boston: De Gruyter, 1987. http://dx.doi.org/10.1515/9783110882681-003.
"Fractions continues paramétrées et critère de Rabinowitsch." In Number Theory in Progress, 111–20. De Gruyter, 1999. http://dx.doi.org/10.1515/9783110285581.111.
"Chapitre XI. Equations différentielles dépendant d'un paramétre." In Analyse numérique et équations différentielles, 323–42. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2004-7-012.
"Chapitre XI. Equations différentielles dépendant d'un paramétre." In Analyse numérique et équations différentielles, 323–42. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2004-7.c012.
VIGNON-CLEMENTEL, Irène E., and Sanjay PANT. "Simulations hémodynamiques : paramétrage, données cliniques, planification d’interventions." In Écoulements biologiques dans les grands vaisseaux, 139–61. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9065.ch5.
Pellerin, Clément. "Outil 6. Créer et paramétrer son entreprise Business Manager Facebook." In La méga boîte à outils des réseaux sociaux, 26–29. Dunod, 2022. http://dx.doi.org/10.3917/dunod.pelle.2022.02.0026.
Тези доповідей конференцій з теми "Paramétrée":
SANCHEZ, Martin. "Vers une description paramétrée du taux de dépôt effectif des sédiments cohésifs." In Journées Nationales Génie Côtier - Génie Civil. Editions Paralia, 2012. http://dx.doi.org/10.5150/jngcgc.2012.044-s.
Plaisantin, Alecu, B., and J. Renahy. "Les langues contrôlées paramétrées au service de la qualité." In Congrès Lambda Mu 19 de Maîtrise des Risques et Sûreté de Fonctionnement, Dijon, 21-23 Octobre 2014. IMdR, 2015. http://dx.doi.org/10.4267/2042/56075.
Filipot, Jean-François, Fabrice Ardhuin, Alexander Babanin, and Rudy Magne. "Paramétrage du déferlement des vagues dans les modèles spectraux : approches semi-empirique et physique." In Journées Nationales Génie Côtier - Génie Civil. Editions Paralia, 2008. http://dx.doi.org/10.5150/jngcgc.2008.032-f.
de Castro, L. M., L. F. Costa, J. M. D. Guedes, P. B. Cabral, and H. A. Simões. "Endometriose com Acometimento Concomitante de Raízes Sacrais, Paramétrio, Reto, Mesorreto e Parede Vaginal. Abordagem e Tática Operatória por Videolaparoscopia." In 69a Congresso Brasileiro 27° Congresso Latinoamericano de Coloproctologia 2021. Thieme Revinter Publicações Ltda., 2021. http://dx.doi.org/10.1055/s-0041-1741836.
Bastos, Alberto Freaza Lobão, Paula de de Holanda, José Augusto Machado, Nereu Guerra Neto, Amanda Mendes Soares, and Yara Lúcia Mendes Furtado de Melo. "O uso da imuno-histoquímica no diagnóstico diferencial do adenocarcinoma endometrial: relato de caso." In 44° Congresso da SGORJ - XXIII Trocando Ideias. Zeppelini Editorial e Comunicação, 2020. http://dx.doi.org/10.5327/jbg-0368-1416-2020130202.