Добірка наукової літератури з теми "Calcul de points de fuite"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Calcul de points de fuite".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Calcul de points de fuite"
François, Paul. "La restitution architecturale et hydraulique du rampant des Massues sur l’aqueduc de la Brévenne à Lyon et ses conséquences sur l’aval du parcours." Gallia 80, no. 1 (2023): 157–66. http://dx.doi.org/10.4000/11ud1.
Повний текст джерелаLoukarfi, Larbi, Jean-Louis Carreau, Francis Roger, Benaissa Elandaloussi, and Ahmed Bettahar. "Approche Méthodologique du Diagnostic d’une Fuite dans un Générateur de Vapeur Sodium - Eau: Résultats de Synthèse et Modèles." Journal of Renewable Energies 1, no. 2 (December 31, 1998): 89–97. http://dx.doi.org/10.54966/jreen.v1i2.948.
Повний текст джерелаTrépos, Jean-Yves. "Allégories, retrait et points de fuite." Le Portique, Cahiers du Portique n°16 (June 1, 2020): 91–112. http://dx.doi.org/10.4000/leportique.4109.
Повний текст джерелаPouteyo, Michael. "Errances et adolescences : points de fuite et points de repères." Le sociographe N° 53, no. 1 (2016): XV. http://dx.doi.org/10.3917/graph.053.0062.
Повний текст джерелаROY, STÉPHANE. "Form and referential citation in a work by Francis Dhomont." Organised Sound 1, no. 1 (April 1996): 29–41. http://dx.doi.org/10.1017/s1355771896000155.
Повний текст джерелаSahel,, M., and O. Ferrandon-Dusart. "Adsorption dynamique en phase liquide sur charbon actif : comparaison et simplification de différents modèles." Revue des sciences de l'eau 6, no. 1 (April 12, 2005): 63–80. http://dx.doi.org/10.7202/705166ar.
Повний текст джерелаTaieb Brahimi, Abdelhalim, Assia Oauli, and Yves Maréchal. "Inductance de fuite des têtes de bobines des machines asynchrones à cage Calcul par logiciels d'éléments finis 2D et 3D." Revue internationale de génie électrique 10, no. 2-3 (June 28, 2008): 335–71. http://dx.doi.org/10.3166/rige.11.355-371.
Повний текст джерелаGranger, Laurent, François Fleury, and Caroline Chalmel. "Calcul de l'évolution du débit de fuite par une fissure de la paroi interne d'une enceinte de confinement en situation accidentelle." Revue Française de Génie Civil 4, no. 7-8 (January 2000): 875–94. http://dx.doi.org/10.1080/12795119.2000.9692701.
Повний текст джерелаCRISTINI, P. "Calcul des zéros d'une fonction analytique avec points de branchements." Le Journal de Physique IV 04, no. C5 (May 1994): C5–869—C5–872. http://dx.doi.org/10.1051/jp4:19945189.
Повний текст джерелаArantes, Urias. "Le roi est mort!: Vive le roi?" Trans/Form/Ação 15 (December 1992): 113–22. http://dx.doi.org/10.1590/s0101-31731992000100006.
Повний текст джерелаДисертації з теми "Calcul de points de fuite"
Elassam, Abdelkarim. "Learning-based vanishing point detection and its application to large-baseline image registration." Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0084.
Повний текст джерелаThis thesis examines the detection of vanishing points and the horizon line and their application to visual localization tasks in urban environments. Visual localization is a fundamental problem in computer vision that aims to determine the position and orientation of a camera in an environment based solely on visual information. In urban and manufactured environments, vanishing points are important visual landmarks that provide crucial information about the scene's structure, making their detection important for reconstruction and localization tasks. The thesis proposes new deep learning methods to overcome the limitations of existing approaches to vanishing point detection. The first key contribution introduces a novel approach for HL and VP detection. Unlike most existing methods, this method directly infers both the HL and an unlimited number of horizontal VPs, even those extending beyond the image frame. The second key contribution of this thesis is a structure-enhanced VP detector. This method utilizes a multi-task learning framework to estimate multiple horizontal VPs from a single image. It goes beyond simple VP detection by generating masks that identify vertical planar structures corresponding to each VP, providing valuable scene layout information. Unlike existing methods, this approach leverages contextual information and scene structures for accurate estimation without relying on detected lines. Experimental results demonstrate that this method outperforms traditional line-based methods and modern deep learning-based methods. The thesis then explores the use of vanishing points for image matching and registration, particularly in cases where images are captured from vastly different viewpoints. Despite continuous progress in feature extractors and descriptors, these methods often fail in the presence of significant scale or viewpoint variations. The proposed methods address this challenge by incorporating vanishing points and scene structures. One major challenge in using vanishing points for registration is establishing reliable correspondences, especially in large-scale scenarios. This work addresses this challenge by proposing a vanishing point detection method aided by the detection of masks of vertical scene structures corresponding to these vanishing points. To our knowledge, this is the first implementation of a method for vanishing point matching that exploits image content rather than just detected segments. This vanishing point correspondence facilitates the estimation of the camera's relative rotation, particularly in large-scale scenarios. Additionally, incorporating information from scene structures enables more reliable keypoint correspondence within these structures. Consequently, the method facilitates the estimation of relative translation, which is itself constrained by the rotation derived from the vanishing points. The quality of rotation can sometimes be impacted by the imprecision of detected vanishing points. Therefore, we propose a vanishing point-guided image matching method that is much less sensitive to the accuracy of vanishing point detection
Riffaut, Antonin. "Calcul effectif de points spéciaux." Thesis, Bordeaux, 2018. http://www.theses.fr/2018BORD0100/document.
Повний текст джерелаStarting for André’s Theorem in 1998, which is the first non-trivial contribution to the celebrated André-Oort conjecture on the special subvarieties of Shimura varieties, the main purpose of this thesis is to study Diophantine properties of singular moduli, by characterizing CM-points (x; y) satisfying a given type of equation of the form F(x; y) = 0, for an irreducible polynomial F(X; Y ) with complex coefficients. More specifically, we treat two different equations involving powers of singular moduli. On the one hand, we show that two distinct singular moduli x; y such that the numbers 1, xm and yn are linearly dependent over Q, for some positive integers m; n, must be of degree at most 2. This partially generalizes a result of Allombert, Bilu and Pizarro-Madariaga, who studied CM-points belonging to straight lines in C2 defined over Q. On the other hand, we show that, with “obvious” exceptions, the product of any two powers of singular moduli cannot be a non-zero rational number. This generalizes a result of Bilu, Luca and Pizarro-Madariaga, who studied CM-points belonging to hyperbolas xy = A, where A 2 Qx. The methods we develop lie mainly on the properties of ring class fields generated by singular moduli, on estimations of the j-function and on estimations of linear forms in logarithms. We also determine fields generated by sums and products of two singular moduli x and y : we show that the field Q(x; y) is generated by the sum x + y, unless x and y are conjugate over Q, in which case x + y generate a subfield of degree at most 2 ; the same holds for the product xy. Our proofs are assisted by the PARI/GP package, which we use to proceed to verifications in particular explicit cases
Audebaud, Christian-Philippe. "Extension du calcul des constructions par points fixes." Bordeaux 1, 1992. http://www.theses.fr/1992BOR10506.
Повний текст джерелаLezama, José. "On grouping theory in dot patterns, with applications to perception theory and 3D inverse geometry." Thesis, Cachan, Ecole normale supérieure, 2015. http://www.theses.fr/2015DENS0009/document.
Повний текст джерелаThis thesis studies two mathematical models for an elementary visual task: theperceptual grouping of dot patterns. The first model handles the detection ofperceptually relevant arrangements of collinear dots. The second model extendsthis framework to the more general case of good continuation of dots. In bothcases, the proposed models are scale invariant and unsupervised. They aredesigned to be robust to noise, up to the point where the structures to detectbecome mathematically indistinguishable from noise. The experiments presentedshow a good match of our detection theory with the unmasking processes takingplace in human perception, supporting their perceptual plausibility.The proposed models are based on the a contrario framework, a formalization ofthe non-accidentalness principle in perception theory. This thesis makes twocontributions to the a contrario methodology. One is the introduction ofadaptive detection thresholds that are conditional to the structure's localsurroundings. The second is a new refined strategy for resolving the redundancyof multiple meaningful detections. Finally, the usefulness of the collinear point detector as a general patternanalysis tool is demonstrated by its application to a classic problem incomputer vision: the detection of vanishing points. The proposed dot alignmentdetector, used in conjunction with standard tools, produces improved resultsover the state-of-the-art methods in the literature.Aiming at reproducible research, all methods are submitted to the IPOL journal,including detailed descriptions of the algorithms, commented reference sourcecodes, and online demonstrations for each one
OKASSA, EUGENE. "Geometrie des points proches et applications." Toulouse 3, 1989. http://www.theses.fr/1989TOU30003.
Повний текст джерелаDewaghe, Laurent. "Calcul du nombre de points sur une courbe elliptique dans un corps fini." Lille 1, 1996. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/1996/50376-1996-354.pdf.
Повний текст джерелаLemarinier, Pierre. "Fiabilité et traitement de la volatilité dans les systèmes de calcul global." Paris 11, 2006. http://www.theses.fr/2006PA112258.
Повний текст джерелаThe distributed computing systems gather more and more processors and are thus subjected to higher failure frequencies. The message passing applications are now generally written using the MPI interface. Numbers of automatic and transparent fault tolerant protocols for message passing libraries have been proposed and implemented. All these protocols rely on checkpoint/restart mechanisms, coordinated or not. However, no comparison of these protocols have been presented yet, in term of cost on the initial performance of MPI applications. We expose in this paper the first comparison between the different kind of fault tolerant protocols. The first part describes in a common model five protocols: a distant pessimistic message logging protocol, a sender based pessimistic message logging protocol, a causal message logging protocol, a non blocking coordinated checkpoint protocol and finally a blocking coordinated checkpoint protocol. The second part of this thesis presents the implementation of the fourth first protocols in the MPICH library and the fifth protocol in the MPICH2 library. Then we sum up the experiment results we obtained for the pessimistic protocols implementation and detail the performance measurements of the causal implementation and the coordinated checkpoint implementations, using micro benchmarks and NAS applications on different computing systems
Bataille, Camille. "Topographie multi-échelle et fuite évolutive d'un contact coulissant : approche expérimentale et simulation." Thesis, Valenciennes, Université Polytechnique Hauts-de-France, 2020. http://www.theses.fr/2020UPHF0008.
Повний текст джерелаPumps allow the transfer of a product (glue, lubricant, petrol, etc.) to the pressurised spraying system. Being present in a multitude of industries, their reliability is of major importance for the protection of the environment and health. We study the impact of surface finish on the functionality (tightness, wear) of different systems, within pumps and spraying systems. A multi-scale characterization method is thus implemented in order to understand the impact of the surface finish of parts on the functionality of these systems. This method is applied on a first characterization study of the tightness of reversible nozzles. It is not always easy to interpret the impact of the morphology of a surface on its functionality using roughness parameters. A contact model and a contact distribution visualization tool are therefore developed. The contact interface is thus computed to better understand the contact distribution and leakage paths. The next part of the thesis aims to characterize the seal/wear torque of a hydraulic piston. A test bench is developed to characterize the wear, tightness and topography of the studied parts. Thus, the degradation of the surface state of a piston is analyzed as a function of its tightness. In order to apply the study of the seal/wear coupling to other similar contacts, a numerical model, capable of calculating the hydraulic conductance of a sliding contact between two rough surfaces, is being developed. Finally, coatings that could replace hard chromium are being tested for wear. The use of hard chromium plating is highly regulated and will be banned in the future. Thus, the comparative degradation of different coatings under the same wear conditions is being studied
Dormoy, Jérôme. "Un algorithme linéaire de calcul de points fixes dans les systèmes de transitions : parallélisation et études expérimentales." Bordeaux 1, 1997. http://www.theses.fr/1997BOR10628.
Повний текст джерелаWallet, Alexandre. "Le problème de décompositions de points dans les variétés Jacobiennes." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066438/document.
Повний текст джерелаThe discrete logarithm problem is a fundamental brick for several protocols for secured communications. Its instantiation over elliptic curves allows the deployment of efficient asymmetric primitives in embedded systems, because of the small size of the parameters considered. Nowadays, elliptic curves cryptosystems are already widely used: it is therefore crucial to precisely understand the hardness of such systems. Because of the existence of mathematical attacks enabling the transfer from an elliptic curve discrete logarithm problem to another algebraic curve, and the upcoming competitivity of genus 2 curves, it is mandatory to study the problem not only for elliptic curves, but for the other curves as well.In this way, this thesis focuses on the algebraic attacks over curves with genus greater than 1. The index calculus family of algorithms is in general preferred for this kind of attacks. Those algorithms run in two phases: the first, called harvesting phase, can be modelled by different algebraic approaches, depending in the targetted curve. The underlying problem amounts to knowing how to decompose efficiently points in the Jacobian variety of the curve into sums of other points.First, we propose a sieving approach to the harvesting, that can be adated to any type of curves with genus greater than 1, and which turns to be experimentally more efficient than state-of-the-art's methods. Moreover, our method allows a close-to-immediate implementation, and avoid complications coming from relations management.Our second focus is on a variant of index calculus called decomposition attack, targetting curves defined over field extensions. In this situation, harvesting is done by solving numerous multivariate polynomial systems. We propose a new approach to this modelling by generalizing the notion of elliptic summation polynomias to any type of algebraic curves. This uses elimination theory, and the computational aspect is handled by Gröbner bases methods.Third, we give algorithms to improve the solving process of the systems arising from a decomposition attacks when the characteristic of the base field is even. By mean of a general theoretical presentation, and using Gröbner bases methods, we give a sharp analysis of the impact of such improvement on the complexity of the resolution process. This sharp analysis together with a dedicated implementation allows us to attack a genus 2 curve satisfying realistic security parameters
Книги з теми "Calcul de points de fuite"
Dessiner, Des Outils Pour. Cahier de Croquis Grille de Perspective 2 Points de Fuite 120 Pages: Grille de Perspective 2 Points de Fuite Idéal Pour Dessin en Perspective et Architecture Taille 21. 59 Cm X 21. 59 Cm. Independently Published, 2021.
Знайти повний текст джерелаMon Cahier de Calcul: Jeux d'addition et de Soustraction,labyrinthes,relies les Points,colorier Avec Nombres, Pour les Enfants de 6 Ans. Independently Published, 2021.
Знайти повний текст джерелаEditions, Relative. Cahier d'activités Maternelle Grande Section et CP GS 5-6 Ans : 100 Activités et Jeux en Couleurs: Écriture Cursive, Calcul Additions Soustractions, Dessins, Points à Relier, Labyrinthes. Independently Published, 2021.
Знайти повний текст джерелаЧастини книг з теми "Calcul de points de fuite"
Le Dret, Hervé. "Calcul des variations et points critiques." In Mathématiques et Applications, 161–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36175-3_7.
Повний текст джерелаCramér, Harald. "Sur Quelques Points Du Calcul Des Probabilites." In Springer Collected Works in Mathematics, 465–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-40986-8_22.
Повний текст джерелаMartin-Löf, Anders. "Sur quelques points du calcul des probabilités." In Harald Cramér Collected Works, 465–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-61221-3_22.
Повний текст джерелаHahn, Hans. "Bemerkungen zu den Untersuchungen des Herrn M. Fréchet: Sur quelques points du calcul fonctionnel." In Hans Hahn Gesammelte Abhandlungen/Collected Works, 369–79. Vienna: Springer Vienna, 1996. http://dx.doi.org/10.1007/978-3-7091-6590-4_23.
Повний текст джерелаCoutant, C., E. Chéreau, C. Bezu, E. Darai, S. Uzan, and R. Rouzier. "Points communs et différences entre les divers nomogrammes validés pour le calcul du risque d’envahissement ganglionnaire." In Cancer du sein, 63–76. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0245-9_6.
Повний текст джерелаFELD-PAYET, Sylvia. "Transition endommagement-fissure." In Modélisation numérique en mécanique fortement non linéaire, 309–82. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9081.ch7.
Повний текст джерелаЗвіти організацій з теми "Calcul de points de fuite"
Dufour, Quentin, David Pontille, and Didier Torny. Contracter à l’heure de la publication en accès ouvert. Une analyse systématique des accords transformants. Ministère de l'enseignement supérieur et de la recherche, April 2021. http://dx.doi.org/10.52949/2.
Повний текст джерела