Littérature scientifique sur le sujet « MESH POINTS »
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 « MESH POINTS ».
À 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 "MESH POINTS"
Gao, Ying, Rui Zhao Wang et Jue Yuan. « Interest Points Guided Mesh Simplification ». Applied Mechanics and Materials 263-266 (décembre 2012) : 2320–23. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.2320.
Texte intégralJIAO, Xue, Huixin ZHANG et Tieru WU. « Mesh segmentation guided by seed points ». Journal of Advanced Mechanical Design, Systems, and Manufacturing 9, no 4 (2015) : JAMDSM0051. http://dx.doi.org/10.1299/jamdsm.2015jamdsm0051.
Texte intégralSun, Yan, Xuelin Deng, Liangli He et Haiyan Yao. « Regularization Method for Discrete Mesh Points ». Journal of Computer-Aided Design & ; Computer Graphics 34, no 05 (1 mai 2022) : 804–10. http://dx.doi.org/10.3724/sp.j.1089.2022.19003.
Texte intégralMedimegh, Nassima, Samir Belaid, Mohamed Atri et Naoufel Werghi. « 3D mesh watermarking using salient points ». Multimedia Tools and Applications 77, no 24 (18 juin 2018) : 32287–309. http://dx.doi.org/10.1007/s11042-018-6252-6.
Texte intégralLei, Humin, Tao Liu, Deng Li, Jikun Ye et Lei Shao. « Adaptive Mesh Iteration Method for Trajectory Optimization Based on Hermite-Pseudospectral Direct Transcription ». Mathematical Problems in Engineering 2017 (2017) : 1–7. http://dx.doi.org/10.1155/2017/2184658.
Texte intégralLiu, Yong-Jin, et Matthew Ming-Fai Yuen. « Optimized triangle mesh reconstruction from unstructured points ». Visual Computer 19, no 1 (1 mars 2003) : 23–37. http://dx.doi.org/10.1007/s00371-002-0162-2.
Texte intégralEjlali, Nastaran, et Seyed Mohammad Hosseini. « Adaptive control parameterization method by density functions for optimal control problems ». IMA Journal of Mathematical Control and Information 37, no 2 (1 avril 2019) : 497–512. http://dx.doi.org/10.1093/imamci/dnz010.
Texte intégralOh, Sahuck. « A New Mesh Moving Technique for a Fluid–Structure Interaction Problem Using Mesh Deformation Energy Minimization ». International Journal of Computational Methods 18, no 01 (19 juillet 2019) : 1950039. http://dx.doi.org/10.1142/s0219876219500397.
Texte intégralEZAWA, Yoshitaka. « Automatic mesh generation by automatic generating internal points ». Proceedings of The Computational Mechanics Conference 2003.16 (2003) : 755–56. http://dx.doi.org/10.1299/jsmecmd.2003.16.755.
Texte intégralRemski, Joan. « Mesh Spacing Estimates and Efficiency Considerations for Moving Mesh Systems ». Numerical Mathematics : Theory, Methods and Applications 9, no 3 (20 juillet 2016) : 432–50. http://dx.doi.org/10.4208/nmtma.2016.m1508.
Texte intégralThèses sur le sujet "MESH POINTS"
Itier, Vincent. « Nouvelles méthodes de synchronisation de nuages de points 3D pour l'insertion de données cachées ». Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS017/document.
Texte intégralThis thesis addresses issues relating to the protection of 3D object meshes. For instance, these objects can be created using CAD tool developed by the company STRATEGIES. In an industrial context, 3D meshes creators need to have tools in order to verify meshes integrity, or check permission for 3D printing for example.In this context we study data hiding on 3D meshes. This approach allows us to insert information in a secure and imperceptible way in a mesh. This may be an identifier, a meta-information or a third-party content, for instance, in order to transmit secretly a texture. Data hiding can address these problems by adjusting the trade-off between capacity, imperceptibility and robustness. Generally, data hiding methods consist of two stages, the synchronization and the embedding. The synchronization stage consists of finding and ordering available components for insertion. One of the main challenges is to propose an effective synchronization method that defines an order on mesh components. In our work, we propose to use mesh vertices, specifically their geometric representation in space, as basic components for synchronization and embedding. We present three new synchronisation methods based on the construction of a Hamiltonian path in a vertex cloud. Two of these methods jointly perform the synchronization stage and the embedding stage. This is possible thanks to two new high-capacity embedding methods (from 3 to 24 bits per vertex) that rely on coordinates quantization. In this work we also highlight the constraints of this kind of synchronization. We analyze the different approaches proposed with several experimental studies. Our work is assessed on various criteria including the capacity and imperceptibility of the embedding method. We also pay attention to security aspects of the proposed methods
Parisot, Pascaline. « Suivi d’objets dans des séquences d’images de scènes déformables : de l’importance des points d’intérêt et du maillage 2D ». Thesis, Toulouse, INPT, 2009. http://www.theses.fr/2009INPT012H/document.
Texte intégralWe deal with object tracking in videos of non-rigid scenes with two main purposes. We aim at determining the transformations of an object, from one frame to the next, when it may be distorted or moved and when the camera focus may change (movement, zoom...). To do this, we were inspired by the Jurie and Dhome algorithm, which enables the tracking of plane rigid objects. On the one hand, we improve its performance. On the other hand, we generalize it to non-rigid objects. The first goal consists in improving the performance of the Jurie and Dhome algorithm, in terms of accuracy and robustness. The tracking is based on a set of interest points, which has a great effect on the algorithm’s performance. These interest points come from a selection among the points extracted with some common detectors: SIFT, KLT, SUSAN, HARRIS, and MORAVEC.With various pictures classes, we have studied and implemented some selection heuristics based on statistical or algebraic approaches. We show that : • there is no universal detector, • the statistical approach is the best in all cases. The second goal is a proposal of a new tracking algorithm based on a 2D mesh of the video frames. This algorithm generalizes the Jurie and Dhome one for non-rigid scenes. It is based on : • elementary (nodal), direct or inverse, mesh transformations that we geometrically and analytically characterize, • generalized barycentric coordinates to approximate the composition of two mesh transformations. This algorithm gives similar results to the hexagonal matching algorithm of Nakaya and Harashima while being faster
Loménie, Nicolas. « Interprétation de nuages de points : application à la modélisaion d'environnements 3D en robotique mobile ». Phd thesis, Université René Descartes - Paris V, 2001. http://tel.archives-ouvertes.fr/tel-00136113.
Texte intégralAkdag, Osman. « Incompressible Flow Simulations Using Least Squares Spectral Element Method On Adaptively Refined Triangular Grids ». Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614944/index.pdf.
Texte intégralBen, salah Imeen. « Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis ». Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR070/document.
Texte intégralCameras have become increasingly common in vehicles, smart phones, and advanced driver assistance systems. The areas of application of these cameras in the world of intelligent transportation systems are becoming more and more varied : pedestrian detection, line crossing detection, navigation ... Vision-based navigation has reached a certain maturity in recent years through the use of advanced technologies. Vision-based navigation systems have the considerable advantage of being able to directly use the visual information already existing in the environment without having to adapt any element of the infrastructure. In addition, unlike systems using GPS, they can be used outdoors and indoors without any loss of precision. This guarantees the superiority of these systems based on computer vision. A major area of {research currently focuses on mapping, which represents an essential step for navigation. This step generates a problem of memory management quite substantial required by these systems because of the huge amount of information collected by each sensor. Indeed, the memory space required to accommodate the map of a small city is measured in tens of GB or even thousands when one wants to cover large spaces. This makes impossible to integrate this map into a mobile system such as smartphones , cameras embedded in vehicles or robots. The challenge would be to develop new algorithms to minimize the size of the memory needed to operate this navigation system using only computer vision. It's in this context that our project consists in developing a new system able to summarize a3D map resulting from the visual information collected by several sensors. The summary will be a set of spherical views allow to keep the same level of visibility in all directions. It would also guarantee, at a lower cost, a good level of precision and speed during navigation. The summary map of the environment will contain geometric, photometric and semantic information
Vasiliauskienė, Lina. « Prisitaikančiosios baigtinių elementų strategijos plokštuminiams tamprumo teorijos uždaviniams ». Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060622_134743-74080.
Texte intégralSantoso, Mas Simon. « Simulation d'écoulements fluides à partir de données réelles ». Thesis, Ecole centrale de Nantes, 2018. http://www.theses.fr/2018ECDN0011.
Texte intégralPoints clouds are mathematical objects that allows to describe discretely multivariable functions. They are mainly used in the statistical domain but also in geometrical manifolds. It is nowadays a real challenge to immerse the previous manifolds in finite element computation. Indeed, the immersion of those points clouds requires the reconstruction of the surface of the manifold and the generation of a surfacic mesh. As those operations are often based on an iterative process, they are extremely time-consuming as points clouds are usually massive. The method developed in this thesis allows to immerse points clouds in a meshed domain without the surface reconstruction and mesh generations steps. For that purpose, we use the Volume Immersion Method adapted to point clouds. We coupled this method with an adaped mesh generation technique. Then we are able to generate a monolithic anisotropic mesh, adapted around interest zones. We also use the variational multi-scale method to simulate fluid flow. This method is an extension of the classical finite element method and allows to simulate fluid flow. The last part of this thesis introduce some applications cases in the aerodynamic and urbans domains
El, Sayed Abdul Rahman. « Traitement des objets 3D et images par les méthodes numériques sur graphes ». Thesis, Normandie, 2018. http://www.theses.fr/2018NORMLH19/document.
Texte intégralSkin detection involves detecting pixels corresponding to human skin in a color image. The faces constitute a category of stimulus important by the wealth of information that they convey because before recognizing any person it is essential to locate and recognize his face. Most security and biometrics applications rely on the detection of skin regions such as face detection, 3D adult object filtering, and gesture recognition. In addition, saliency detection of 3D mesh is an important pretreatment phase for many computer vision applications. 3D segmentation based on salient regions has been widely used in many computer vision applications such as 3D shape matching, object alignments, 3D point-point smoothing, searching images on the web, image indexing by content, video segmentation and face detection and recognition. The detection of skin is a very difficult task for various reasons generally related to the variability of the shape and the color to be detected (different hues from one person to another, orientation and different sizes, lighting conditions) and especially for images from the web captured under different light conditions. There are several known approaches to skin detection: approaches based on geometry and feature extraction, motion-based approaches (background subtraction (SAP), difference between two consecutive images, optical flow calculation) and color-based approaches. In this thesis, we propose numerical optimization methods for the detection of skins color and salient regions on 3D meshes and 3D point clouds using a weighted graph. Based on these methods, we provide 3D face detection approaches using Linear Programming and Data Mining. In addition, we adapted our proposed methods to solve the problem of simplifying 3D point clouds and matching 3D objects. In addition, we show the robustness and efficiency of our proposed methods through different experimental results. Finally, we show the stability and robustness of our methods with respect to noise
Bouchiba, Hassan. « Contributions en traitements basés points pour le rendu et la simulation en mécanique des fluides ». Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEM076/document.
Texte intégralMost surface 3D scanning techniques produce 3D point clouds. This thesis tackles the problem of using points as only explicit surface representation. It presents two contributions in point-based processing. The first contribution is a new raw and massive point cloud screen-space rendering algorithm. This new method can be applied to a wide variety of data from small objects to complex scenes. A sequence of screen-space pyramidal operators is used to reconstruct in real-time a surface and estimate its normals, which are later used to perform deferred shading. In addition, the use of pyramidal operators allows to achieve framerate one order of magnitude higher than state of the art methods. The second proposed contribution is a new immersed boundary computational fluid dynamics method by extended implicit surface reconstruction. The proposed method is based on a new implicit surface definition from a point cloud by extended moving least squares. This surface is then used to define the boundary conditions of a finite-elements immersed boundary transient Navier-Stokes solver, which is used to compute flows around the object sampled by the point cloud. The solver is interfaced with an anisotropic and adaptive meshing algorithm which refines the computational grid around both the geometry defined by point cloud and the flow at each timestep of the simulation
Fang, Hao. « Modélisation géométrique à différent niveau de détails d'objets fabriqués par l'homme ». Thesis, Université Côte d'Azur (ComUE), 2019. http://www.theses.fr/2019AZUR4002/document.
Texte intégralGeometric modeling of man-made objects from 3D data is one of the biggest challenges in Computer Vision and Computer Graphics. The long term goal is to generate a CAD-style model in an as-automatic-as-possible way. To achieve this goal, difficult issues have to be addressed including (i) the scalability of the modeling process with respect to massive input data, (ii) the robustness of the methodology to various defect-laden input measurements, and (iii) the geometric quality of output models. Existing methods work well to recover the surface of free-form objects. However, in case of manmade objects, it is difficult to produce results that approach the quality of high-structured representations as CAD models.In this thesis, we present a series of contributions to the field. First, we propose a classification method based on deep learning to distinguish objects from raw 3D point cloud. Second, we propose an algorithm to detect planar primitives in 3D data at different level of abstraction. Finally, we propose a mechanism to assemble planar primitives into compact polygonal meshes. These contributions are complementary and can be used sequentially to reconstruct city models at various level-of-details from airborne 3D data. We illustrate the robustness, scalability and efficiency of our methods on both laser and multi-view stereo data composed of man-made objects
Livres sur le sujet "MESH POINTS"
Michel, Willem, dir. Critical point theory and Hamiltonian systems. New York : Springer-Verlag, 1989.
Trouver le texte intégralLindauer, Owen. The archaeology of Schoolhouse Point Mesa, Roosevelt Platform Mound Study : Report on the Schoolhouse Point Mesa Sites, Schoolhouse Management Group, Pinto Creek Complex. Tempe, AZ : Arizona State University Office of Cultural Resource Management, 1997.
Trouver le texte intégralMes points sur les i : Propos sur la présidentielle et la crise. Paris : Odile Jacob, 2012.
Trouver le texte intégralRivett, Mary L. Full mesh audio conferencing using the point-to-multipoint on-board switching capability of ACTS. [Washington, DC] : National Aeronautics and Space Administration, 1996.
Trouver le texte intégralBoutaudou, Sylvie. Marre de mes kilos en trop. Paris : La Martinière jeunesse, 2008.
Trouver le texte intégralUnited States. National Aeronautics and Space Administration., dir. Full Mesh Audio Conferencing Using The Point-To-Multipoint On-Board Switching Capability Of ACTS Final Report... NASA-CR-198498... Mar. 14, 1997. [S.l : s.n., 1998.
Trouver le texte intégralBauch, Nancy J. Limnology of Blue Mesa, Morrow Point, and Crystal Reservoirs, Curecanti National Recreation area, during 1999, and a 25-year retrospective of nutrient conditions in Blue Mesa Reservoir, Colorado. Denver, Colo : U.S. Dept. of the Interior, U.S. Geological Survey, 2003.
Trouver le texte intégralBenkato, Adam, Leila Tayeb et Amina Zarrugh, dir. Lamma. Earth, Milky Way : punctum books, 2023. http://dx.doi.org/10.53288/0504.1.00.
Texte intégralRuschmann, Paul. Prescription and Non-prescription Drugs (Point/Counterpoint). Chelsea House Publications, 2007.
Trouver le texte intégralMES PREMIERS POINT-A-POINT. Héritage, 2004.
Trouver le texte intégralChapitres de livres sur le sujet "MESH POINTS"
Hui, Suk Yu, Kai Hau Yeung et Kin Yeung Wong. « Optimal Placement of Mesh Points in Wireless Mesh Networks ». Dans NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, 848–55. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79549-0_74.
Texte intégralZhao, Dangjun, Zhiwei Zhang et Mingzhen Gui. « Birkhoff Pseudospectral Method and Convex Programming for Trajectory Optimization ». Dans Autonomous Trajectory Planning and Guidance Control for Launch Vehicles, 99–127. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-0613-0_4.
Texte intégralCañavate, F. J. F., F. Cavas, J. S. Velázquez, J. M. Bolarín et J. L. Alió. « Analysis of the Accuracy of Reconstruction of a Human Cornea by Two Geometric Modelling Techniques : A Comparative Study ». Dans Lecture Notes in Mechanical Engineering, 255–60. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70566-4_41.
Texte intégralMouhamed, Mourad R., Mona M. Soliman, Ashraf A. Darwish et Aboul Ella Hassanien. « Interest Points Detection of 3D Mesh Model Using K Means and Shape Curvature ». Dans Advances in Intelligent Systems and Computing, 415–24. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99010-1_38.
Texte intégralLong, Chengjiang, Jianhui Zhao, Ravindra S. Goonetilleke, Shuping Xiong, Yihua Ding, Zhiyong Yuan et Yuanyuan Zhang. « A New Region Growing Algorithm for Triangular Mesh Recovery from Scattered 3D Points ». Dans Transactions on Edutainment VI, 237–46. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22639-7_23.
Texte intégralYachia, Daniel. « Learning from Our Mistakes : Applying Vascular Stent Technologies to the Urinary Tract ». Dans Urinary Stents, 351–58. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-04484-7_28.
Texte intégralDehne, Frank, Jörg-R. Sack et Ivan Stojmenović. « A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors ». Dans SWAT 88, 154–62. Berlin, Heidelberg : Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19487-8_18.
Texte intégralTanigawa, Shin-ichi, et Naoki Katoh. « Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths ». Dans Algorithmic Aspects in Information and Management, 161–72. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11775096_16.
Texte intégralPoloni, Katia Maria, Carlos Henrique Villa Pinto, Breno da Silveira Souza et Ricardo José Ferrari. « Construction and Application of a Probabilistic Atlas of 3D Landmark Points for Initialization of Hippocampus Mesh Models in Brain MR Images ». Dans Computational Science and Its Applications – ICCSA 2018, 310–22. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95162-1_21.
Texte intégralLiu, Ziqiao, Dongyang Wang, Xiaoying Sun et Yingying Gan. « Research on Parameter Sensitivity for Deeply Embedment SSI Analysis Based on Sub-structuring Method ». Dans Springer Proceedings in Physics, 445–59. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-1023-6_39.
Texte intégralActes de conférences sur le sujet "MESH POINTS"
Yue-Ping Feng, Hui-Xiang Zhong et Yun-Jie Pang. « Non-mesh rendering based on points ». Dans Proceedings of 2005 International Conference on Machine Learning and Cybernetics. IEEE, 2005. http://dx.doi.org/10.1109/icmlc.2005.1527906.
Texte intégralSheung, Hoi, et Charlie C. L. Wang. « Robust mesh reconstruction from unoriented noisy points ». Dans 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling. New York, New York, USA : ACM Press, 2009. http://dx.doi.org/10.1145/1629255.1629258.
Texte intégralSalvador, Jordi, Xavier Suau et Josep R. Casas. « From silhouettes to 3D points to mesh ». Dans the 1st international workshop. New York, New York, USA : ACM Press, 2010. http://dx.doi.org/10.1145/1877791.1877797.
Texte intégralGong, Faming, et Cui Kang. « 3D Mesh Skeleton Extraction Based on Feature Points ». Dans 2009 International Conference on Computer Engineering and Technology (ICCET). IEEE, 2009. http://dx.doi.org/10.1109/iccet.2009.71.
Texte intégralXue, Mowen, Xudong Li, Ying Liang, Hongzhi Jiang et Huijie Zhao. « Image stitching by points grouping and mesh optimization ». Dans Sixth Symposium on Novel Photoelectronic Detection Technology and Application, sous la direction de Huilin Jiang et Junhao Chu. SPIE, 2020. http://dx.doi.org/10.1117/12.2565355.
Texte intégralFarag, S., W. Abdelrahman, D. Creighton et S. Nahavandi. « Extracting 3D Mesh Skeletons Using Antipodal Points Locations ». Dans 2013 UKSim 15th International Conference on Computer Modelling and Simulation (UKSim 2013). IEEE, 2013. http://dx.doi.org/10.1109/uksim.2013.78.
Texte intégralOviedo, Byron, Luis Moreira, Amilkar Puris, Pavel Novoa et Serafin Moral. « Learning Bayesian network by a mesh of points ». Dans 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2016. http://dx.doi.org/10.1109/cec.2016.7744295.
Texte intégralDeo, Dhanannjay, et Dibakar Sen. « Mesh Processing for Computerized Anthropometry ». Dans ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-85528.
Texte intégralMohri, Hisashi, Ritsuko Matsumoto et Yuichi Kaji. « Key predistribution schemes for sensor networks using lines,points over a finite geometry ». Dans 2006 2nd IEEE Workshop on Wireless Mesh Networks. IEEE, 2006. http://dx.doi.org/10.1109/wimesh.2006.288609.
Texte intégralHui, S. Y., K. H. Yeung et K. Y. Wong. « Optimal Placement of Mesh Points in a Wireless Mesh Network Using Multi-path Routing Protocol ». Dans 2008 IFIP International Conference on Network and Parallel Computing (NPC). IEEE, 2008. http://dx.doi.org/10.1109/npc.2008.87.
Texte intégralRapports d'organisations sur le sujet "MESH POINTS"
Wettergren, Thomas A. An Adaptive Mesh Technique for Finding the Bistatic Specular Point on a Convex Hull. Fort Belvoir, VA : Defense Technical Information Center, novembre 1998. http://dx.doi.org/10.21236/ada359258.
Texte intégralDong, Wei, Wei Zhang, Jianxu Er, Jiapeng Liu et Jiange Han. Lesser complications of laryngeal mask airway than endotracheal tubes in pediatric airway management : A review of literature and meta-analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, mai 2022. http://dx.doi.org/10.37766/inplasy2022.5.0066.
Texte intégralNaddafi, Rahmat, Göran Sundblad, Alfred Sandström, Lachlan Fetterplace, Jerker Vinterstare, Martin Ogonowski et Nataliia Kulatska. Developing management goals and associated assessment methods for Sweden’s nationally managed fish stocks : a project synthesis. Department of Aquatic Resources, Swedish University of Agricultural Sciences, 2023. http://dx.doi.org/10.54612/a.31cfjep2i0.
Texte intégralRusso, Margherita, Fabrizio Alboni, Jorge Carreto Sanginés, Manlio De Domenico, Giuseppe Mangioni, Simone Righi et Annamaria Simonazzi. The Changing Shape of the World Automobile Industry : A Multilayer Network Analysis of International Trade in Components and Parts. Institute for New Economic Thinking Working Paper Series, janvier 2022. http://dx.doi.org/10.36687/inetwp173.
Texte intégralGeologic map of the Pigeon Canyon, Nevershine Mesa, and Snap Point Wilderness Study Areas, Mohave County, Arizona. US Geological Survey, 1986. http://dx.doi.org/10.3133/mf1860b.
Texte intégralLimnology of Blue Mesa, Morrow Point, and Crystal Reservoirs, Curecanti National Recreation area, during 1999, and a 25-year retrospective of nutrient conditions in Blue Mesa Reservoir, Colorado. US Geological Survey, 2003. http://dx.doi.org/10.3133/wri024199.
Texte intégralLOCAL BUCKLING BEHAVIORS OF COLD-FORMED CIRCULAR HOLLOW SECTIONS HIGH STRENGTH STEEL STUB COLUMNS BASED ON A HIGH-FIDELITY NUMERICAL MODEL (ICASS’2022). The Hong Kong Institute of Steel Construction, août 2022. http://dx.doi.org/10.18057/icass2020.p.337.
Texte intégralMineral resource potential map of the Pigeon Canyon, Nevershine Mesa, and Snap Point Wilderness Study Areas, Mohave County, Arizona. US Geological Survey, 1986. http://dx.doi.org/10.3133/mf1860a.
Texte intégralInforme sobre o impacto dos cultivos forestais con especies de crecemento rápido no patrimonio natural e cultural de galicia. Consello da Cultura Galega, septembre 2023. http://dx.doi.org/10.17075/icfecrpncg.2023.
Texte intégral