Littérature scientifique sur le sujet « Objectifs de parité »
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 « Objectifs de parité ».
À 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 "Objectifs de parité"
Haou, Abir, Kamel Miroud et Djallel Eddine Gherissi. « Impact des caractéristiques du troupeau et des pratiques d’élevage sur les performances de reproduction des vaches laitières dans le Nord-Est algérien ». Revue d’élevage et de médecine vétérinaire des pays tropicaux 74, no 4 (13 décembre 2021) : 183–91. http://dx.doi.org/10.19182/remvt.36798.
Texte intégralIvensky, Victoria, Romain Mandel, Annie-Claude Boulay, Christian Lavallée, Janie Benoît et Annie-Claude Labbé. « Dépistage prénatal sous-optimal des infections à Chlamydia trachomatis et Neisseria gonorrhoeae dans un centre des naissances et de soins tertiaires de Montréal : une étude de cohorte rétrospective ». Relevé des maladies transmissibles au Canada 47, no 04 (7 mai 2021) : 228–35. http://dx.doi.org/10.14745/ccdr.v47i04a05f.
Texte intégralČerveňanská, Zuzana, Janette Kotianová, Pavel Važan, Bohuslava Juhásová et Martin Juhás. « Multi-Objective Optimization of Production Objectives Based on Surrogate Model ». Applied Sciences 10, no 21 (6 novembre 2020) : 7870. http://dx.doi.org/10.3390/app10217870.
Texte intégralLiu, Qi, Jiahao Liu et Dunhu Liu. « Intelligent Multi-Objective Public Charging Station Location with Sustainable Objectives ». Sustainability 10, no 10 (18 octobre 2018) : 3760. http://dx.doi.org/10.3390/su10103760.
Texte intégralLi, Yifan, Hai-Lin Liu et E. D. Goodman. « Hyperplane-Approximation-Based Method for Many-Objective Optimization Problems with Redundant Objectives ». Evolutionary Computation 27, no 2 (juin 2019) : 313–44. http://dx.doi.org/10.1162/evco_a_00223.
Texte intégralDoerr, Benjamin, et Weijie Zheng. « Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives ». Proceedings of the AAAI Conference on Artificial Intelligence 35, no 14 (18 mai 2021) : 12293–301. http://dx.doi.org/10.1609/aaai.v35i14.17459.
Texte intégralDaly, Rich. « Parity Compromise Overcomes Most DB Objections ». Psychiatric News 43, no 19 (3 octobre 2008) : 16. http://dx.doi.org/10.1176/pn.43.19.0016.
Texte intégralGong, Dunwei, Yiping Liu et Gary G. Yen. « A Meta-Objective Approach for Many-Objective Evolutionary Optimization ». Evolutionary Computation 28, no 1 (mars 2020) : 1–25. http://dx.doi.org/10.1162/evco_a_00243.
Texte intégralZhang, Han, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa et Sven Koenig. « Anytime Approximate Bi-Objective Search ». Proceedings of the International Symposium on Combinatorial Search 15, no 1 (17 juillet 2022) : 199–207. http://dx.doi.org/10.1609/socs.v15i1.21768.
Texte intégralDaumas-Ladouce, Federico, Miguel García-Torres, José Luis Vázquez Noguera, Diego P. Pinto-Roa et Horacio Legal-Ayala. « Multi-Objective Pareto Histogram Equalization ». Electronic Notes in Theoretical Computer Science 349 (juin 2020) : 3–23. http://dx.doi.org/10.1016/j.entcs.2020.02.010.
Texte intégralThèses sur le sujet "Objectifs de parité"
Sérée, Bastien. « Problèmes d'optimisation des les graphes paramétrés ». Electronic Thesis or Diss., Ecole centrale de Nantes, 2022. http://www.theses.fr/2022ECDN0066.
Texte intégralWe are considering weighted oriented graphs with parametrized energy. Firstly we propose an algorithm that, given a graph and one of its vertices, returns trees, every tree representing shortest-paths from the source to every other vertex for a particular zone of the parameter space. Moreover, union of these zones is a covering of the parameter space. Then we consider reachability in graphs with multi-dimensional energy, with stricter constraints that enforce the energy to stay between bounds. We prove decidabilty and complexity of this problem regardless of the dimension and the number of parameters when parameters take integer values. We alsoprove the undecidability of this problem when there is at least one parameter and the dimension is at least two. Finally we study paritygames on parametrized graphs with one and two players whose objective is the conjunction of a qualitative condition on the parity andquantitative one : energy must stay positive. We show the decidability and prove bounds on the complexity of the problem of searchinga winning strategy in both cases with one and two players
Ismaïli, Anisse. « Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games ». Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066148.
Texte intégralAn agent is an entity that decides an action. By using this abstraction, it is possible to model two children playing rock-paper-scissors, a software computing a shortest path on the internet for packet-routing on congest numerical networks, as well as an automatic combinatorial auction that sells commercial links in order to make google earn billions. The researchers in algorithmic decision theory and algorithmic game theory (mathematicians and computer scientists) like to think that these real-life examples can be modelled by mean of agents in an interaction decision system, no matter how complex is reality. The modern interactive decision systems find their complexity in multiple aspects. Firstly, the preferences of an agent can be complex to model with real numbers when there are multiple conflicting objectives resulting from every decision. Secondly, the interactions between agents are such that the payoff of every individual depends of the actions of all, making difficult the prediction of the resulting action-profile. This thesis aims at pursuing research efforts lead on these two sources of complexity, in order to consider ultimately both aspects in the same model
Rohling, Gregory Allen. « Multiple Objective Evolutionary Algorithms for Independent, Computationally Expensive Objectives ». Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4835.
Texte intégralTeo, Jason T. W. Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. « Pareto multi-objective evolution of legged embodied organisms ». Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2003. http://handle.unsw.edu.au/1959.4/38682.
Texte intégralRibeiro, Marco Tulio Correia. « Multi-objective pareto-efficient algorithms for recommender systems ». Universidade Federal de Minas Gerais, 2013. http://hdl.handle.net/1843/ESSA-9CHG5H.
Texte intégralSistemas de recomendação tem se tornado cada vez mais populares em aplicações como e-commerce, mídias sociais e provedores de conteúdo. Esses sistemas agem como mecanismos para lidar com o problema da sobrecarga de informação. Uma tarefa comum em sistemas de recomendação é a de ordenar um conjunto de itens, de forma que os itens no topo da lista sejam de interesse para os usuários. O conceito de interesse pode ser medido observando a acurácia, novidade e diversidade dos itens sugeridos. Geralmente, o objetivo de um sistema de recomendação é gerar listas ordenadas de forma a otimizar uma dessas métricas. Um problema mais difícil é tentar otimizar as três métricas (ou objetivos) simultaneamente, o que pode levar ao caso onde a tentativa de melhorar em uma das métricas pode piorar o resultado nas outras métricas. Neste trabalho, propomos novas abordagens para sistemas de recomendaççao multi-objetivo, baseadas no conceito de Eficiência de Pareto -- um estado obtido quando o sistema é de tal forma que não há como melhorar em algum objetivo sem piorar em outro objetivo. Dado que os algoritmos de recomendação existentes diferem em termos de acurácia, diversidade e novidade, exploramos o conceito de Eficiência de Pareto de duas formas distintas: (i) agregando listas ordenadas produzidas por algoritmos existentes de forma a obter uma lista única - abordagem que chamamos de ranking Pareto-eficiente, e (ii), a combinação linear ponderada de algoritmos existentes, resultado em um híbrido, abordagem que chamamos de hibridização Pareto-eficiente. Nossa avaliação envolve duas aplicações reais: recomendação de música com feedback implícito (i.e., Last.fm) e recomendação de filmes com feedback explícito (i.e., Movielens). Nós mostramos que as abordagens Pareto-eficientes são efetivas em recomendar items com bons niveis de acurácia, novidade e diversidade (simultaneamente), ou uma das métricas sem piorar as outras. Além disso, para a hibridização Pareto-eficiente, provemos uma forma de ajustar o compromisso entre acurácia, novidade e diversidade, de forma que a ênfase da recomendação possa ser ajustada dinamicamente para usuários diferentes.
Nordström, Peter. « Multi-objective optimization and Pareto navigation for voyage planning ». Thesis, Uppsala universitet, Avdelningen för systemteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-220338.
Texte intégralZeng, Rong-Qiang. « Métaheuristiques multi-objectif basées sur des voisinages pour l'approximation d'ensembles de pareto ». Angers, 2012. http://www.theses.fr/2012ANGE0054.
Texte intégralMulti-objective optimization has received more and more attention in the late twenty years. The aim is to generate a Pareto optimal set, which keeps the best compromise among all the objectives. Since it is not possible to compute the Pareto optimal set in a reasonable time in most cases, many multi-objective metaheuristics have been established to approximate the Pareto optimal set. This thesis is devoted to developing metaheuristics to tackle multi-objective optimization problems in general. In order to solve these multi-objective optimization problems, we propose the Hypervolume-Based Multi-Objective Local Search algorithm (HBMOLS). This algorithm uses a hypervolume contribution indicator as the selection measure to compare and select solutions during the search process. Afterwards, we integrate path relinking techniques into the HBMOLS algorithm as a function which initializes new populations for HBMOLS. Then, we present and evaluate different versions of multi-objective hybrid path linking algorithm. To evaluate the efficiency and the generality of our approaches, we carry out experiments on a multi-objective flow shop problem and a multi-objective quadratic assignment problem
Zhong, Hongliang. « Bandit feedback in Classification and Multi-objective Optimization ». Thesis, Ecole centrale de Marseille, 2016. http://www.theses.fr/2016ECDM0004/document.
Texte intégralBandit problems constitute a sequential dynamic allocation problem. The pulling agent has to explore its environment (i.e. the arms) to gather information on the one hand, and it has to exploit the collected clues to increase its rewards on the other hand. How to adequately balance the exploration phase and the exploitation phase is the crux of bandit problems and most of the efforts devoted by the research community from this fields has focused on finding the right exploitation/exploration tradeoff. In this dissertation, we focus on investigating two specific bandit problems: the contextual bandit problems and the multi-objective bandit problems. This dissertation provides two contributions. The first contribution is about the classification under partial supervision, which we encode as a contextual bandit problem with side informa- tion. This kind of problem is heavily studied by researchers working on social networks and recommendation systems. We provide a series of algorithms to solve the Bandit feedback problem that pertain to the Passive-Aggressive family of algorithms. We take advantage of its grounded foundations and we are able to show that our algorithms are much simpler to implement than state-of-the-art algorithms for bandit with partial feedback, and they yet achieve better perfor- mances of classification. For multi-objective multi-armed bandit problem (MOMAB), we propose an effective and theoretically motivated method to identify the Pareto front of arms. We in particular show that we can find all elements of the Pareto front with a minimal budget
Cvetkovic, Dragan. « Evolutionary multi-objective decision support systems for conceptual design ». Thesis, University of Plymouth, 2000. http://hdl.handle.net/10026.1/2328.
Texte intégralHartley, A. C. « The theory of parity non-conservation in atoms ». Thesis, University of Oxford, 1989. https://ora.ox.ac.uk/objects/uuid:24d852a0-0f6f-4fea-8b41-db6a0b02b7c4.
Texte intégralCaesium | 6s1⁄2 â 7s1⁄2 | 0.895 | (1±0.03) à 10-11 (-iea0QW/N) |
Thallium | 6p1⁄2 â 7p1⁄2 | -7.85 | (1±0.05) à 10-11 (-iea0QW/N) |
Thallium | 6p1⁄2 â 6p3⁄2 | -28.4 | (1±0.07) à 10-11 (-iea0QW/N) |
These are in very good agreement with the most extensive Many-Body Perturbation Theory calculations performed. Using our value for the caesium transition matrix element and the latest experimental results gives a value of QW = ~ 71.8 ± 1.8 ± 2.1 where the first error is experimental and the second is theoretical. This corresponds to a value of the standard model sin2ÎW = 0.230 ± 0.009 which is to be compared with the current world average value of 0.230 ± 0.005. We investigate the single particle EOM terms that were not included in the above calculation and find that they are concerned with the Exclusion Principle violating terms that are implicitly included in an RPA calculation. Other terms represent the valence contribution to certain two particle effects. Since the main two particle terms have not been included however, these correction terms do not lead to a significant increase in the accuracy of the calculation.
Livres sur le sujet "Objectifs de parité"
Morvan, Frédéric. Objectif Louvre : Le guide des visites en famille. Arles (Bouches-du-Rhône) : Actes Sud junior, 2007.
Trouver le texte intégral1968-, Sly Jonathan, dir. Objective Louvre : The guide to family visits. Arles : Actes Sud junior, 2011.
Trouver le texte intégralLes trésors du lettré : Objets de la chine impériale. [Paris, France] : Réunion des musées nationaux, 1993.
Trouver le texte intégralHan feng : Zhongguo Han dai wen wu zhan. Beijing : Ke xue chu ban she, 2014.
Trouver le texte intégralSnickare, Mårten. Colonial Objects in Early Modern Sweden and Beyond. Nieuwe Prinsengracht 89 1018 VR Amsterdam Nederland : Amsterdam University Press, 2022. http://dx.doi.org/10.5117/9789463728065.
Texte intégralFrance), Musée Guimet (Paris, dir. 113 ors d'Asie. Cinisello Balsamo, Milano : Silvana editoriale, 2017.
Trouver le texte intégralMuseum, J. Paul Getty, et Museum of Fine Arts, Houston, dir. Paris : Life & luxury in the eighteenth century. Los Angeles : J. Paul Getty Museum, 2011.
Trouver le texte intégralDelroy, Stephen H. Normes relatives aux noms d'objet et aux zones connexes. Ottawa : Réseau canadien d'information sur le patrimoine, 1994.
Trouver le texte intégralPaul, Bernard. L'agence. Geneva : Mamco, 2021.
Trouver le texte intégralCaporali, Enrica, et Atanasko Tuneski, dir. Towards a New Curriculum : The DEREC Experience. Florence : Firenze University Press, 2009. http://dx.doi.org/10.36253/978-88-8453-877-2.
Texte intégralChapitres de livres sur le sujet "Objectifs de parité"
Mayr, Richard, Sven Schewe, Patrick Totzke et Dominik Wojtczak. « Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP ». Dans Lecture Notes in Computer Science, 427–47. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_22.
Texte intégralMain, James C. A., Mickael Randour et Jeremy Sproston. « Timed Games with Bounded Window Parity Objectives ». Dans Lecture Notes in Computer Science, 165–82. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15839-1_10.
Texte intégralChatterjee, Krishnendu, et Laurent Doyen. « Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives ». Dans Mathematical and Engineering Methods in Computer Science, 37–46. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25929-6_3.
Texte intégralTeich, Jürgen. « Pareto-Front Exploration with Uncertain Objectives ». Dans Lecture Notes in Computer Science, 314–28. Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44719-9_22.
Texte intégralMiettinen, Kaisa. « Graphical Illustration of Pareto Optimal Solutions ». Dans Multi-Objective Programming and Goal Programming, 197–202. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-36510-5_27.
Texte intégralPardalos, Panos M., Antanas Žilinskas et Julius Žilinskas. « Visualization of a Set of Pareto Optimal Decisions ». Dans Non-Convex Multi-Objective Optimization, 139–45. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61007-8_9.
Texte intégralZhao, Hongjian, Shixiong Xia, Jiaqi Zhao, Dongjun Zhu, Rui Yao et Qiang Niu. « Pareto-Based Many-Objective Convolutional Neural Networks ». Dans Web Information Systems and Applications, 3–14. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02934-0_1.
Texte intégralIsac, G. « The Ekeland’s Principle and the Pareto ε-Efficiency ». Dans Multi-Objective Programming and Goal Programming, 148–63. Berlin, Heidelberg : Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-87561-8_12.
Texte intégralSultan, A. M., et A. B. Templeman. « Generation of Pareto Solutions by Entropy-Based Methods ». Dans Multi-Objective Programming and Goal Programming, 164–95. Berlin, Heidelberg : Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-87561-8_13.
Texte intégralLi, Jinlong, et Mingying Yan. « Pareto Partial Dominance on Two Selected Objectives MOEA on Many-Objective 0/1 Knapsack Problems ». Dans Lecture Notes in Computer Science, 365–73. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11857-4_42.
Texte intégralActes de conférences sur le sujet "Objectifs de parité"
Kiefer, Stefan, Richard Mayr, Mahsa Shirmohammadi et Dominik Wojtczakz. « Parity objectives in countable MDPs ». Dans 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005100.
Texte intégralMayr, Richard, Sven Schewe, Patrick Totzke et Dominik Wojtczak. « MDPs with energy-parity objectives ». Dans 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005131.
Texte intégralAndersson, Johan, et Marcus Redhe. « Response Surface Methods and Pareto Optimization in Crashworthiness Design ». Dans ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/dac-48752.
Texte intégralJin, Yaochu. « Pareto-based Multi-Objective Machine Learning ». Dans 7th International Conference on Hybrid Intelligent Systems (HIS 2007). IEEE, 2007. http://dx.doi.org/10.1109/ichis.2007.4344015.
Texte intégralJin, Yaochu. « Pareto-based Multi-Objective Machine Learning ». Dans 7th International Conference on Hybrid Intelligent Systems (HIS 2007). IEEE, 2007. http://dx.doi.org/10.1109/his.2007.73.
Texte intégralSvoreňová, Mária, Martin Chmelík, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Černá et Calin Belta. « Temporal logic motion planning using POMDPs with parity objectives ». Dans HSCC '15 : 18th International Conference on Hybrid Systems : Computation and Control. New York, NY, USA : ACM, 2015. http://dx.doi.org/10.1145/2728606.2728617.
Texte intégralEddy, John, et Kemper Lewis. « Effective Generation of Pareto Sets Using Genetic Programming ». Dans ASME 2001 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/detc2001/dac-21094.
Texte intégralUnal, Mehmet, Gordon P. Warn et Timothy W. Simpson. « Quantifying the Shape of a Pareto Front in Support of Many-Objective Trade Space Exploration ». Dans ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59716.
Texte intégralMohagheghi, Mahmood, Jayanta Kapat et Narasimha Nagaiah. « Pareto-Based Multi-Objective Optimization of Recuperated S-CO2 Brayton Cycles ». Dans ASME Turbo Expo 2014 : Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gt2014-27152.
Texte intégralShi, Biao, Bo Deng, Li-mei Liu et Xian-cheng Zhou. « Pareto Optimal Prediction for Moving Objects ». Dans 2009 First International Conference on Information Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/icise.2009.822.
Texte intégralRapports d'organisations sur le sujet "Objectifs de parité"
Elsbernd, Amanda J., Anna K. Johnson, Kenneth J. Stalder, Robert F. Fitzgerald, Locke A. Karriker, Steven J. Hoff et Gang Sun. Designing an Objective Static Force Plate to Measure Severity of Lameness in Multi-Parity Sows. Ames (Iowa) : Iowa State University, janvier 2011. http://dx.doi.org/10.31274/ans_air-180814-274.
Texte intégralMusty, Michael, Vuong Truong, Jay Clausen, Susan Frankenstein, Christopher Williams, Andrew Trautz, Stacy Howington et Raju Kala. Thermal infra-red comparison study of buried objects between humid and desert test beds. Engineer Research and Development Center (U.S.), août 2022. http://dx.doi.org/10.21079/11681/45064.
Texte intégralFernandez, Ruben, Hernando Lugo et Georfe Dulikravich. Aerodynamic Shape Multi-Objective Optimization for SAE Aero Design Competition Aircraft. Florida International University, octobre 2021. http://dx.doi.org/10.25148/mmeurs.009778.
Texte intégralModlo, Yevhenii O., et Serhiy O. Semerikov. Xcos on Web як перспективний засіб навчання моделювання технічних об’єктів бакалаврів електромеханіки. [б. в.], août 2018. http://dx.doi.org/10.31812/0564/2454.
Texte intégralGregersen, Hans, Hosny El-Lakany et Alain Frechette. Forests, Forest People, and UN 2030 Agenda’s Ethical Mandate : “LEAVE NO ONE BEHIND”. Rights and Resources Initiative, septembre 2020. http://dx.doi.org/10.53892/ynzm8033.
Texte intégralProvenza, Frederick, Avi Perevolotsky et Nissim Silanikove. Consumption of Tannin-Rich Forage by Ruminants : From Mechanism to Improved Performance. United States Department of Agriculture, avril 2000. http://dx.doi.org/10.32747/2000.7695840.bard.
Texte intégralKhoury, Fares. The Pivot Roadmap : From Dreams to Reality. Sous la direction de Musheer O. Kamau, Sasha Baxter, Claudia Alcaraz-Irizarry et Alan Mentis. Inter-American Development Bank, juillet 2021. http://dx.doi.org/10.18235/0003408.
Texte intégralLai, Sharon, Kevin Lane et Laura Nunn. The Term Funding Facility : Has It Encouraged Business Lending ? Reserve Bank of Australia, décembre 2022. http://dx.doi.org/10.47688/rdp2022-07.
Texte intégralVultur, Mircea, Lucie Enel, Louis-Pierre Barette et Simon Viviers. Les travailleurs des plateformes numériques de transport de personnes et de livraison de repas au Québec : profil et motivations. CIRANO, juin 2022. http://dx.doi.org/10.54932/xpzk8254.
Texte intégralYermiyahu, Uri, Thomas Kinraide et Uri Mingelgrin. Role of Binding to the Root Surface and Electrostatic Attraction in the Uptake of Heavy Metal by Plants. United States Department of Agriculture, 2000. http://dx.doi.org/10.32747/2000.7586482.bard.
Texte intégral