Littérature scientifique sur le sujet « Distance de barrière minimale »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Distance de barrière minimale ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Distance de barrière minimale"
Dedecker, Jérôme, et Clémentine Prieur. « Couplage pour la distance minimale ». Comptes Rendus Mathematique 338, no 10 (mai 2004) : 805–8. http://dx.doi.org/10.1016/j.crma.2004.03.015.
Texte intégralCanillos, Thibaud. « Les bâtiments de stockage de denrées agricoles tardo-antiques de la Barrière 2 à Servian (Hérault) ». Revue archéologique de Narbonnaise 53, no 1 (2020) : 345–62. http://dx.doi.org/10.3406/ran.2020.2017.
Texte intégralAubry, Christophe. « Estimateur de la distance minimale en moyenne pour un modèle régulier ». Comptes Rendus de l'Académie des Sciences - Series I - Mathematics 325, no 8 (octobre 1997) : 899–902. http://dx.doi.org/10.1016/s0764-4442(97)80134-6.
Texte intégralHénaff, Sylvain. « Asymptotique de l'estimateur de distance minimale du paramètre du processus d'Ornstein-Uhlenbeck ». Comptes Rendus de l'Académie des Sciences - Series I - Mathematics 325, no 8 (octobre 1997) : 911–14. http://dx.doi.org/10.1016/s0764-4442(97)80137-1.
Texte intégralGauthier, M., J. Lebon, A. B. Tanguay et F. Bégin. « MP007 : Constats de décès à distance et disponibilité des services préhospitalier d’urgence ». CJEM 18, S1 (mai 2016) : S68. http://dx.doi.org/10.1017/cem.2016.148.
Texte intégralKleißen, Jasmin, Niko Balkenhol et Heike Pröhl. « Landscape Genetics of the Yellow-Bellied Toad (Bombina variegata) in the Northern Weser Hills of Germany ». Diversity 13, no 12 (27 novembre 2021) : 623. http://dx.doi.org/10.3390/d13120623.
Texte intégralRodier, François. « Estimation asymptotique de la distance minimale du dual des codes BCH et polynômes de Dickson ». Discrete Mathematics 149, no 1-3 (février 1996) : 205–21. http://dx.doi.org/10.1016/0012-365x(94)00320-i.
Texte intégralNugraha, Priyambada Cahya, I. Dewa Gede Hari Wisana, Dyah Titisari et Farid Amrinsani. « Optimal Long Distance ECG Signal Data Delivery Using LoRa Technology ». Journal of Biomimetics, Biomaterials and Biomedical Engineering 55 (28 mars 2022) : 239–49. http://dx.doi.org/10.4028/p-6z381m.
Texte intégralBoureille, Patrick. « Les relations navales franco-roumaines (1919-1928) : les illusions perdues ». Revue Historique des Armées 244, no 3 (1 août 2006) : 50–59. http://dx.doi.org/10.3917/rha.244.0050.
Texte intégralHjalmarsson, Clara, Maria Ohlson et Börje Haraldsson. « Puromycin aminonucleoside damages the glomerular size barrier with minimal effects on charge density ». American Journal of Physiology-Renal Physiology 281, no 3 (1 septembre 2001) : F503—F512. http://dx.doi.org/10.1152/ajprenal.2001.281.3.f503.
Texte intégralThèses sur le sujet "Distance de barrière minimale"
On, Vu Ngoc Minh. « A new minimum barrier distance for multivariate images with applications to salient object detection, shortest path finding, and segmentation ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS454.
Texte intégralHierarchical image representations are widely used in image processing to model the content of an image in the multi-scale structure. A well-known hierarchical representation is the tree of shapes (ToS) which encodes the inclusion relationship between connected components from different thresholded levels. This kind of tree is self-dual, contrast-change invariant and popular in computer vision community. Typically, in our work, we use this representation to compute the new distance which belongs to the mathematical morphology domain. Distance transforms and the saliency maps they induce are generally used in image processing, computer vision, and pattern recognition. One of the most commonly used distance transforms is the geodesic one. Unfortunately, this distance does not always achieve satisfying results on noisy or blurred images. Recently, a new pseudo-distance, called the minimum barrier distance (MBD), more robust to pixel fluctuation, has been introduced. Some years after, Géraud et al. have proposed a good and fast-to-compute approximation of this distance: the Dahu pseudodistance. Since this distance was initially developed for grayscale images, we propose here an extension of this transform to multivariate images; we call it vectorial Dahu pseudo-distance. This new distance is easily and efficiently computed thanks to the multivariate tree of shapes (MToS). We propose an efficient way to compute this distance and its deduced saliency map in this thesis. We also investigate the properties of this distance in dealing with noise and blur in the image. This distance has been proved to be robust for pixel invariant. To validate this new distance, we provide benchmarks demonstrating how the vectorial Dahu pseudo-distance is more robust and competitive compared to other MB-based distances. This distance is promising for salient object detection, shortest path finding, and object segmentation. Moreover, we apply this distance to detect the document in videos. Our method is a region-based approach which relies on visual saliency deduced from the Dahu pseudo-distance. We show that the performance of our method is competitive with state-of-the-art methods on the ICDAR Smartdoc 2015 Competition dataset
Ngo, Quoc-Tuong. « Généralisation des précodeurs MIMO basés sur la distance euclidienne minimale ». Phd thesis, Université Rennes 1, 2012. http://tel.archives-ouvertes.fr/tel-00839594.
Texte intégralCollin, Ludovic. « Optimisation de systèmes multi-antennes basée sur la distance minimale ». Brest, 2002. http://www.theses.fr/2002BRES2041.
Texte intégralMulti-Input Multi-Output (MIMO) digital transmission systems currently retain more and more attention due to the very high spectral efficiencies they can achieve over rich scattering transmission channels, such as wireless local area networks (WLAN) or urban mobile wireless communications. In this thesis, in order to evaluate the Bit Error Rate (BER) of MIMO communications, we propose to use the second-order Unscented Transformation method. Next, we propose a fast Maximum Likelihood Based (MLB) decoder for a MIMO Rician fading channel. Lastly, we propose two new non-diagonal precoders, based on the optimization of the minimum euclidean distance. Comparisons to other known precoders, such as Water-Filling (WF), Minimum Mean Square Error (MMSE) and maximization of the minimum singular value of the global channel matrix, are performed to illustrate the significant BER improvement of the proposed precoders
Cadic, Emmanuel. « Construction de Turbo Codes courts possédant de bonnes propriétés de distance minimale ». Limoges, 2003. http://aurore.unilim.fr/theses/nxfile/default/2c131fa5-a15a-4726-8d49-663621bd2daf/blobholder:0/2003LIMO0018.pdf.
Texte intégralThis thesis is aimed at building turbo codes with good minimum distances and delaying the``error-floor'' which corespond to a threshold of 10-6 for the binary error rate. Under this threshold, the slope of the curve decreases significantly. This problem is alleviated by the use of duo-binary turbo codes [11] which guarantee better minimum distances. In order to obtain good minimum distances with short turbo codes (length inferior to 512), the first construction used and studied is the one proposed by Carlach and Vervoux [26]. It allows to obtain very good minimum distances but its decoding is unfortunately very difficult because of its structure. After identifying the reasons for this problem, we have modified these codes by using some graphicals structures which are the gathering of low complexity components codes. The idea is to realize this change without loosing the minimum distances properties, and consequently we had to understand why minimum distances are good for this familly of codes and define a new criteria to choose ``good'' components codes. This criteria is independent from the minimum distance of the component codes because it is derived from the Input-Output Weight Enumerator (IOWE) of the components codes. It allows us to choose components codes with very low complexity which are combined in order to provide 4-state tail-biting trellises. These trellises are then used to build multiple parallel concatenated and serial turbo codes with good minimum distances. Some extremal self-dual codes have been built in that way
Ngo, Quoc-Tuong. « Généralisation des précodeurs basés sur la distance minimale pour les systèmes MIMO à multiplexage spatial ». Rennes 1, 2012. http://www.theses.fr/2012REN1E001.
Texte intégralIn this thesis, we studied the efficient non-diagonal precoder based on the maximization of the minimum Euclidean distance (max-dmin) between two received data vectors. Because the complexity of the optimized solutions depends on the number of antennas and the modulation order, the max-dmin precoder was only available in closed-form for two independent data-streams with low-order modulations. Therefore, we firstly extended this solution for two 16-QAM symbols and then generalized the concept to any rectangular QAM modulation. By using trigonometric functions, a new virtual MIMO channel representation thanks to two channel angles, allows the parameterization of the max-dmin precoder and the optimization of the distance for three parallel data streams. Thanks to this scheme, an extension for an odd number of data-streams using QAM modulations is obtained. Not only the minimum Euclidean distance but also the number of neighbors providing it has an important role in reducing the error probability when an ML detection is considered at the receiver. Aiming at reducing this number of neighbors, a new precoder in which the rotation parameter has no influence is proposed, leading to less complex processing and a smaller space of solutions. Finally, an approximation of the minimum distance was derived by maximizing the minimum diagonal element of the SNR-like matrix. The major advantage of this design is that the solution can be available for all rectangular QAM-modulation and any number of datastreams
Vrigneau, Baptiste. « Systèmes MIMO précodés optimisant la distance minimale : étude des performances et extension du nombre de voies ». Phd thesis, Université de Bretagne occidentale - Brest, 2006. http://tel.archives-ouvertes.fr/tel-00481141.
Texte intégralVrigneau, Baptiste. « Système MIMO précodés optimisant la distance minimale : Etude des performances et extension du nombre de voies ». Brest, 2006. http://www.theses.fr/2006BRES2033.
Texte intégralIn wireless communications, the Multiple-Input Multiple-Ouput (MIMO) systems constitute an efficient way to significantly enhance data transmission according to two main, though antagonistic, parameters: the spectral efficiency and reliability assessed from the average binary error probability (BEP). With such systems the knowledge of the channel state information (CSI) at the transmitter side is paramount to lower reduce the BEP through différent stratégies of power allocation. Indeed, once the CSI has been fully (or perfectly) known, a linear precoder at the transmit side and a linear decoder at the receive side can be designed for subséquent association by optimizing one among the following criteria: minimum mean square error (MMSE) or the capacity. Their respective optimisations have led to a family of diagonal precoders: the MIMO system is équivalent to indépendant SISO subchannels. Recently, a new no-diagonal precoder designed within our laboratory optimizes the minimal Euclidean distance between receive symbols. This thesis work was aimed at estimating the BEP of this precoder for comparison with other methods (Alamouti's code and diagonal precoders). We demonstrated the maximal diversity order of the max¬dmin, and then gave a tight BEP approximation. Moreover, the spatial dimensions and the final cost of a MIMO device were reduced by associating of the precoder max-dmin with polarity diversity. Despite the corrélation induced by this system, the max-dmin performances are still worth being considered. We also proposed an extension of the max-dmin to more than two sub-channels in order to exploit larger MIMO systems
Aubry, Christophe. « Estimation parametrique par la methode de la distance minimale pour les processus de poisson et de diffusion ». Le Mans, 1997. http://www.theses.fr/1997LEMA1005.
Texte intégralGaland, Fabien. « Construction de codes Z indice p à la puissance k linéaires de bonne distance minimale et schémas de dissimulation fondés sur les codes de recouvrement ». Caen, 2004. http://www.theses.fr/2004CAEN2047.
Texte intégralCrozet, Sébastien. « Efficient contact determination between solids with boundary representations (B-Rep) ». Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM089/document.
Texte intégralWith the development of advanced robotic systems and complex teleoperation tasks, the need to perform simulations before operating on physical systems becomes of increasing interest for feasibility tests, training of the human operators, motion planning, etc. Such simulations usually need to be performed with great accuracy of physical phenomena if, e.g., the operator is expected to face the same ones in the real world and in the virtual scene. Collision detection, i.e., the computation of contact points and contact normals between interacting rigid bodies, occupies a time-consuming part of such a physical simulation. The accuracy and smoothness of such contact information is of primary importance to produce a realistic behavior of the simulated objects. However, the quality of the computed contact information strongly depends on the geometric representation of the parts of the virtual scene directly involved in the mechanical simulation. On the one hand, discrete volumes-based and tessellation-based geometric representations allow very fast contacts generation at the cost of the potential introduction of numerical artifacts due to the approximation of the interacting geometrical shapes. On the other hand, the use of boundary representations (issued by CAD modelers) composed of smooth curve and surfaces removes this approximation problem but is currently considered being too slow in practice for real-time applications.This Ph.D focuses on developing a first complete collision detection framework on solids with smooth boundary representations that achieves real-time performances. Our goal is to allow the real-time simulation of industrial scenarios that require a high level of accuracy. Typical applications are insertion tasks with small mechanical clearances. The proposed approach is based on a bounding-volume hierarchy and takes advantage of key features of industrial mechanical components which are often modeled with surfaces describing functional contacts with canonical surfaces (cylinder, sphere, cone, plane, torus) while contacts over free-form surfaces like B-Splines are mostly accidental and encountered during operations of maintenance and manufacturing. We augment this hierarchy with the identification of supermaximal features in order to avoid redundant exact localization of contact points on canonical surfaces that may be represented as distinct features of the CAD model. In addition, we define polyhedral normal cones that offer tighter bounds of normals than existing normal cones of revolution. Moreover, we extend our method to handle configurations that involve beams modeled as deformable dilated Bézier curves. Finally, parallelization of the full approach allows industrial scenarios to be executed in real-time
Chapitres de livres sur le sujet "Distance de barrière minimale"
Marzano, Gilberto. « Social Telerehabilitation ». Dans Advanced Methodologies and Technologies in Medicine and Healthcare, 452–65. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7489-7.ch036.
Texte intégralMarzano, Gilberto. « Social Telerehabilitation ». Dans Encyclopedia of Information Science and Technology, Fourth Edition, 5930–40. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2255-3.ch516.
Texte intégralActes de conférences sur le sujet "Distance de barrière minimale"
Kostecki, Jodi, Matthew Edel et John Montoya. « Importance of Connections in High-Pressure Barricade Design ». Dans ASME 2018 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/pvp2018-84765.
Texte intégralMiers, Kevin T., Daniel L. Prillaman et Nausheen M. Al-Shehab. « Optimized Impact Mitigation Barriers for Insensitive Munitions Compliance of a 120mm Warhead ». Dans 2019 15th Hypervelocity Impact Symposium. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/hvis2019-105.
Texte intégralKhan, Mohammed Yunus, Mohammed Taha Al-Murayri, Satish Kumar Eadulapally, Haya Ebrahim Al-Mayyan, Deema Alrukaibi et Anfal Al-Kharji. « Strategies to Design Fit for Purpose EOR Pilots by Integrating Dynamic and Static Data in a Highly Heterogeneous Oolitic Carbonate Reservoir ». Dans International Petroleum Technology Conference. IPTC, 2024. http://dx.doi.org/10.2523/iptc-23708-ms.
Texte intégralSachakamol, Punnamee, et Liming Dai. « Noise Prediction Model Development for the Traffic Noise on Asphalt Rubber Roads ». Dans ASME 2006 International Mechanical Engineering Congress and Exposition. ASMEDC, 2006. http://dx.doi.org/10.1115/imece2006-13327.
Texte intégralLiu, Y., L. Deng, A. Augustine, H. Thar, A. Al Ali, A. K. Anurag, A. Alkatheeri, A. Soliman, E. Elabsy et M. Atia. « Maximize Sweep Efficiency Using Proactive Tar Boundary Detection to Effectively Place a Water Injector Well Using Multiple Workflows of Distance-To-Boundary Inversion Techniques ». Dans ADIPEC. SPE, 2023. http://dx.doi.org/10.2118/216017-ms.
Texte intégralSun, Bo, Huafeng Ni, Zhongyuan Shi, Kecai Guo, Mingyu Lu, Yongdi Zhang, Haikun Ding et John Zhou. « Defining Geologic Structure Encountered in Horizontal Well and Its Impact on Petrophysical Evaluation ». Dans 2022 SPWLA 63rd Annual Symposium. Society of Petrophysicists and Well Log Analysts, 2022. http://dx.doi.org/10.30632/spwla-2022-0076.
Texte intégralBoucher, Andrew, Josef Shaoul, Inna Tkachuk, Mohammed Rashdi, Khalfan Bahri et Cornelis Veeken. « Improving Proppant Placement Success in Horizontal Wells in Layered Reservoirs in the Sultanate of Oman ». Dans SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/205919-ms.
Texte intégralLewis, Donald W. « U.S. Commercial Spent Fuel Storage Facilities : Public Health and Environmental Considerations ». Dans ASME 2003 9th International Conference on Radioactive Waste Management and Environmental Remediation. ASMEDC, 2003. http://dx.doi.org/10.1115/icem2003-5004.
Texte intégralRapports d'organisations sur le sujet "Distance de barrière minimale"
Hummels, David. Toward a Geography of Trade Costs. GTAP Working Paper, janvier 2003. http://dx.doi.org/10.21642/gtap.wp17.
Texte intégralPetrie, John, Yan Qi, Mark Cornwell, Md Al Adib Sarker, Pranesh Biswas, Sen Du et Xianming Shi. Design of Living Barriers to Reduce the Impacts of Snowdrifts on Illinois Freeways. Illinois Center for Transportation, novembre 2020. http://dx.doi.org/10.36501/0197-9191/20-019.
Texte intégral