Academic literature on the topic 'M-degree'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'M-degree.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "M-degree":
Downey, R. G. "Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees." Journal of Symbolic Logic 54, no. 2 (June 1989): 553–67. http://dx.doi.org/10.2307/2274869.
Cintioli, Patrizio. "Degrees of sets having no subsets of higher m- and t t-degree." Computability 10, no. 3 (July 14, 2021): 235–55. http://dx.doi.org/10.3233/com-200296.
Shustin, E. I. "A new M-curve of degree 8." Mathematical Notes of the Academy of Sciences of the USSR 42, no. 2 (August 1987): 606–10. http://dx.doi.org/10.1007/bf01240445.
Korchagin, A. B. "M-curves of degree 9: New prohibitions." Mathematical Notes of the Academy of Sciences of the USSR 39, no. 2 (February 1986): 150–54. http://dx.doi.org/10.1007/bf01159900.
Fiedler-Le Touzé, Séverine. "M -curves of degree 9 with deep nests." Journal of the London Mathematical Society 79, no. 3 (March 27, 2009): 649–62. http://dx.doi.org/10.1112/jlms/jdp010.
Faudree, Ralph J., Ronald J. Gould, Michael S. Jacobson, and Linda Lesniak. "Minimal Degree and (k, m)-Pancyclic Ordered Graphs." Graphs and Combinatorics 21, no. 2 (June 2005): 197–211. http://dx.doi.org/10.1007/s00373-005-0604-5.
Monikandan, S., and S. Sundar Raj. "Adversary degree associated reconstruction number of graphs." Discrete Mathematics, Algorithms and Applications 07, no. 01 (February 2, 2015): 1450069. http://dx.doi.org/10.1142/s1793830914500694.
SHIMOMURA, KATSUNORI. "On transformations which preserve poly-temperatures of degree m." Mathematical journal of Ibaraki University 33 (2001): 23–34. http://dx.doi.org/10.5036/mjiu.33.23.
Afzal, Farkhanda, Sabir Hussain, Deeba Afzal, and Sidra Razaq. "Some new degree based topological indices via M-polynomial." Journal of Information and Optimization Sciences 41, no. 4 (May 18, 2020): 1061–76. http://dx.doi.org/10.1080/02522667.2020.1744307.
Boden, Hans U. "Nontriviality of the $M$-degree of the $A$-polynomial." Proceedings of the American Mathematical Society 142, no. 6 (March 4, 2014): 2173–77. http://dx.doi.org/10.1090/s0002-9939-2014-11936-8.
Dissertations / Theses on the topic "M-degree":
Nichterlein, André [Verfasser], Rolf [Akademischer Betreuer] Niedermeier, Matthias [Akademischer Betreuer] Müller-Hannemann, and Dimitrios M. [Akademischer Betreuer] Thilikos. "Degree-constrained editing of small-degree graphs / André Nichterlein. Gutachter: Rolf Niedermeier ; Matthias Müller-Hannemann ; Dimitrios M. Thilikos. Betreuer: Rolf Niedermeier." Berlin : Universitätsverlag der TU Berlin, 2015. http://d-nb.info/1073584089/34.
Swan, Bonnie. "MIDDLE SCHOOL MATHEMATICS TEACHER CERTIFICATION, DEGREE LEVEL, AND EXPERIENCE, AND THE EFFECTS ON TEACHERATTRITION AND STUDENT M." Doctoral diss., University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3630.
Ph.D.
Department of Teaching and Learning Principles
Education
Education: Ph.D.
Mills, Samuel Edward Hampton. "Information in insurance markets : is more always better? : a research exercise forming the requirement for the degree of M. Com. at the University of Canterbury /." Thesis, University of Canterbury. Economics and Finance, 2009. http://hdl.handle.net/10092/3227.
SILVA, Fabr?cio de Azevedo. "O m?todo da Falsa Posi??o: Uma alternativa para o ensino de resolu??o de problemas envolvendo equa??es do 1? grau." Universidade Federal Rural do Rio de Janeiro, 2015. https://tede.ufrrj.br/jspui/handle/jspui/2314.
Made available in DSpace on 2018-05-17T18:02:04Z (GMT). No. of bitstreams: 1 2015 - Fabr?cio de Azevedo Silva.pdf: 2083796 bytes, checksum: d9a26681bab37d5289f5f06f93a62cc8 (MD5) Previous issue date: 2015-08-31
CAPES
The main objective of this research is to see whether the false position method, used to solve some problems Rhind Papyrus, can be an alternative for solving problems that involve the 1st degree equations with one unknown for students from the 7th grade of elementary school. The Egyptians used this method and this is a way to find the solution of the problem by requiring an initial value, considered the false position, which should be adjusted immediately to obtain the correct value. As we noted not rare that this strategy is adopted by students nowadays, we believe this is a plausible alternative to the teaching content. To check the effectiveness of the method, We conducted a case study ? adopting a qualitative approach to analyze the data collected in search ? with a group of the 7th grade in a municipal school in Rio de Janeiro. We propose a sequence of three activities, applied in a single meeting, where after the resolution of problems by students, we began a discussion of what strategies adopted. After the resolution of the first activity, a problem taken from the Rhind Papyrus, during the period for the discussion of the problem, we show how the Egyptians resolved. We can see that a considerable amount of them identified with the method, by the way they decided later activities.
O principal objetivo desta pesquisa ? verificar se o m?todo da falsa posi??o, utilizado para resolver alguns problemas do Papiro de Rhind, pode ser uma alternativa para resolu??o de problemas que envolvem equa??es do 1? grau com uma inc?gnita para alunos do 7? ano do ensino fundamental. Esse m?todo era utilizado pelos eg?pcios e trata-se de um caminho para encontrar a solu??o do problema atrav?s da estipula??o de um valor inicial, considerado a falsa posi??o, que dever? ser ajustado imediatamente ap?s para se obter o valor correto. Como observamos n?o ser raro que essa estrat?gia seja adotada pelos discentes nos dias atuais, acreditamos ser essa uma alternativa plaus?vel para o ensino do conte?do. Para verificar a efic?cia do m?todo, realizamos um estudo de caso ? adotando uma abordagem qualitativa para analisar os dados recolhidos na pesquisa ? com uma turma do 7? ano em uma escola da rede municipal do Rio de Janeiro. Propomos uma sequ?ncia de tr?s atividades, aplicada em um ?nico encontro, onde ap?s a resolu??o dos problemas pelos discentes, inici?vamos uma discuss?o sobre quais estrat?gias adotaram. Ap?s a resolu??o da primeira atividade, um problema retirado do Papiro de Rhind, durante o per?odo destinado ? discuss?o do problema, mostramos como os eg?pcios o resolviam. Podemos perceber que uma quantidade consider?vel deles se identificou com o m?todo, pela forma como resolveram as atividades posteriores.
Silva, Ana. "Le nombre b-chromatique de quelques classes de graphes généralisant les arbres." Grenoble, 2010. http://www.theses.fr/2010GRENM078.
Une coloration des sommets de G s'appelle une b-coloration si chaque classe de couleur contient au moins un sommet qui a un voisin dans toutes les autres classes de couleur. Le nombre b-chromatique b(G) de G est le plus grand entier k pour lequel G a une b-coloration avec k couleurs. Ces notions ont été introduites par Irving et Manlove en 1999. Elles permettent d'évaluer les performances de certains algorithmes de coloration. Irving et Manlove ont montré que le calcul du nombre b-chromatique d'un graphe est un problème NP-difficile et qu'il peut être résolu en temps polynomial pour les arbres. Une question qui se pose naturellement est donc d'enquêter sur les graphes qui ont une structure proche des arbres : cactus, graphes triangulés, graphes série-parallèles, "block" graphes, etc. Dans cette thèse, nous généralisons le résultat d'Irving et Manlove pour les cactus dont le "m-degré" est au moins 7 et pour les graphes planaires extérieurs dont la maille est au moins 8. (Le m-degré m(G) est le plus grand entier d tel que G a au moins d sommets de degré au moins d −1. ) Nous démontrons un résultat semblable pour le produit cartésien d'un arbre par une chaîne, un cycle ou une étoile. Pour ce qui concerne les graphes dont les blocs sont des cliques, nous montrons que le problème avec un nombre de couleurs fixé peut être résolu en temps polynomial et nous présentons des cas où le problème de décision peut être résolu. Toutefois, nous avons constaté que la différence m(G)−b(G) peut être arbitrairement grande pour les graphes blocs, ce qui montre qu'avoir une structure arborescence n'est pas suffisant pour que le graphe satisfasse b(G)>= m(G) − 1
Spearing, Robert. "A portfolio of compositions submitted for the degree of Doctor of Philosophy in Musical Composition." Thesis, University of Birmingham, 2010. http://etheses.bham.ac.uk//id/eprint/865/.
Macedo, Elaine Souza de. "Uma sequencia did?tica para o ensino da resolu??o da equa??o do 2. grau : adequa??o para o uso com professores." Universidade Federal do Rio Grande do Norte, 2011. http://repositorio.ufrn.br:8080/jspui/handle/123456789/16077.
The present study aims to check whether the use of activities mediated by the History of Mathematics can contribute to improve the understanding of resolution the 2nd degree equation for teachers and undergraduates that reproduce methods of solving such equations, uncritically, without domain of the justifications for their actions. For this, we adapted a didactic sequence with activities that aims to cause a rediscovery of resolutive formula of 2nd degree equation through the method known as cut and paste. Finally, we presented the activity module containing the didactic sequence used during the study, as suggestion for use in the classroom, by the math teacher
O presente estudo tem como objetivo verificar se o uso de atividades mediadas pela Hist?ria da Matem?tica pode contribuir para a melhoria da compreens?o da resolu??o da equa??o do 2? grau para professores e licenciandos que reproduzem m?todos de resolu??o de tais equa??es, de maneira acr?tica, sem o dom?nio das justificativas de suas a??es. Para isso, adaptamos uma sequ?ncia did?tica com atividades que tem como prop?sito fazer com que haja uma redescoberta da f?rmula resolutiva da equa??o do 2? grau atrav?s do m?todo denominado corte e cole. Por fim, apresentamos o m?dulo de atividades contendo a sequ?ncia did?tica utilizada durante o estudo, como sugest?o para uso em sala de aula, pelo professor de matem?tica
Adhikari, Dhruba R. "Applications of degree theories to nonlinear operator equations in Banach spaces." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002158.
Souza, Givanaldo Rocha de. "Uma abordagem por nuvem de part?culas para problemas de otimiza??o combinat?ria." Universidade Federal do Rio Grande do Norte, 2006. http://repositorio.ufrn.br:8080/jspui/handle/123456789/17970.
Combinatorial optimization problems have the goal of maximize or minimize functions defined over a finite domain. Metaheuristics are methods designed to find good solutions in this finite domain, sometimes the optimum solution, using a subordinated heuristic, which is modeled for each particular problem. This work presents algorithms based on particle swarm optimization (metaheuristic) applied to combinatorial optimization problems: the Traveling Salesman Problem and the Multicriteria Degree Constrained Minimum Spanning Tree Problem. The first problem optimizes only one objective, while the other problem deals with many objectives. In order to evaluate the performance of the algorithms proposed, they are compared, in terms of the quality of the solutions found, to other approaches
Os problemas de otimiza??o combinat?ria t?m como objetivo maximizar ou minimizar uma fun??o definida sobre um certo dom?nio finito. J? as metaheur?sticas s?o procedimentos destinados a encontrar uma boa solu??o, eventualmente a ?tima, consistindo na aplica??o de uma heur?stica subordinada, a qual tem que ser modelada para cada problema espec?fico. Este trabalho apresenta algoritmos baseados na t?cnica de otimiza??o por nuvem de part?culas (metaheur?stica) para dois problemas de otimiza??o combinat?ria: o Problema do Caixeiro Viajante e o Problema da ?rvore Geradora M?nima Restrita em Grau Multicrit?rio. O primeiro ? um problema em que apenas um objetivo ? otimizado, enquanto o segundo ? um problema que deve lidar com m?ltiplos objetivos. Os algoritmos propostos s?o comparados a outras abordagens para o mesmo problema em quest?o, em termos de qualidade de solu??o, a fim de verificar a efici?ncia desses algoritmos
Caroni, Ana Luiza Porpino Fernandes. "Estudos de adsor??o de tetraciclina em part?culas de quitosana." Universidade Federal do Rio Grande do Norte, 2009. http://repositorio.ufrn.br:8080/jspui/handle/123456789/17701.
Due to its physico-chemical and biological properties, related to the abundance and low cost of raw material, chitosan has been recognized as a material of wide application in various fields, such as in drug delivery systems. Many of these properties are associated with the presence of amino groups in its polymer chain. A proper determination of these amino groups is very important, in order to properly specify if a given chitosan sample can be used in a particular application. Thus, in this work, initially, a comparison between the determination of the deacetylation degree by conductometry and elemental analysis was carried out using a detailed analysis of error propagation. It was shown that the conductometric analysis resulted in a simple and safe method for the determining the degree of deacetylation of chitosan. Subsequently, experiments were performed to monitor and characterize the adsorption of tetracycline on chitosan particles through kinetic and equilibrium studies. The main models of kinetics and adsorption isotherms, widely used to describe the adsorption on wastewater treatment systems and the drug loading, were used to treat the experimental data. Firstly, it was shown that an apparent linear t/q(t) ? t relationship did not imply in a pseudo-second-order adsorption kinetics, differently of what has been repeatedly reported in the literature. It was found that this misinterpretation can be avoided by using non-linear regression. Finally, the adsorption of tetracycline on chitosan particles was analyzed using insights obtained from theoretical analysis, and the parameters generated were used to analyze the kinetics of adsorption, the isotherm of adsorption and to ropose a mechanism of adsorption
Devido ?s suas propriedades f?sico-qu?micas e biol?gicas, associadas ? abund?ncia e ao baixo custo da mat?ria-prima, a quitosana tem sido considerada um material de ampla aplica??o em diversos campos, tais como em sistemas de libera??o de f?rmacos. Muitas dessas propriedades est?o associadas ? presen?a de grupos amino em sua cadeia polim?rica. Uma determina??o apropriada desses grupos amino ? muito importante, com o objetivo de especificar adequadamente se uma dada amostra de quitosana pode ser usada em uma particular aplica??o. Dessa forma, neste trabalho, inicialmente, foi realizada uma compara??o entre a determina??o do grau m?dio de desacetila??o atrav?s de an?lises condutim?trica e elementar usando uma minuciosa an?lise de propaga??o erro. Foi mostrado que a an?lise condutim?trica resultou em um m?todo simples e seguro para determina??o do grau m?dio de desacetila??o da quitosana. Posteriormente, foram realizados experimentos a fim de monitorar e caracterizar o processo de adsor??o de tetraciclina em part?culas de quitosana, atrav?s de estudos cin?ticos e de equil?brio. Os principais modelos cin?ticos e de isotermas de adsor??o, amplamente usados para descrever a adsor??o em sistemas de tratamento de efluentes e de incorpora??o de f?rmacos, foram utilizados nos dados experimentais. Primeiramente, foi mostrado que uma aparente rela??o linear t/q(t) ? t n?o implica em um mecanismo de adsor??o de pseudo-segunda-ordem, diferentemente do que tem sido repetitivamente relatado na literatura. Foi encontrado que esta interpreta??o err?nea pode ser evitada atrav?s do uso de uma regress?o n?o-linear. Finalmente, a adsor??o de tetraciclina em part?culas de quitosana foi analisada, utilizando os conhecimentos obtidos de uma an?lise te?rica, e os par?metros gerados foram usados para analisar a cin?tica de adsor??o, a isoterma de adsor??o e para propor um mecanismo de adsor??o
Books on the topic "M-degree":
Department of Education & Science. The Polytechnic of Huddersfield Higher Education Corporation: BA/BA (Honours) business studies degree course : a report by H M Inspectorate. Stanmore: DES, 1990.
Great Britain. Department for Education. Her Majesty's Inspectorate. King Alfred's College of Higher Education: BA (Hons) degree in Drama, Theatre and Television Studies : a report by H M Inspectorate. Stanmore: DFE, 1992.
Seshadri, S. N. Evaluation of LDA 3-component velocity data on a 65 [degree] delta wing at M=0.85 and first results of an analysis. Koln: DFVLR, 1989.
Great Britain. Department for Education. Her Majesty's Inspectorate. Anglia Polytechnic (now Anglia Polytechnic University): Degree courses in Housing, Building Surveying, General Practice Surveying and Quantity Surveying : a report by H M Inspectorate. Stanmore: DFE, 1992.
Corwin, Harold G. Southern galaxy catalogue: A catalogue of 5481 galaxies south of declination -17 degrees found on 1.2-m U.K. Schmidt IIIa-J plates. Austin: Dept. of Astronomy, University of Texas at Austin, 1985.
Lifanov, Konstantin. The inflection of the Slovak literary language. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1046272.
D, Clair Lasater Ph. Two Christian Graduate Degree Theses -- M. A.; Ph. D. CreateSpace Independent Publishing Platform, 2018.
Reed, Anthony R. The S M A R T Degree: The Young Professional's Guide to Reality. Cenmar Pubns, 1989.
Das, Koushik. Political Science Handbook: Suggestion for B. a and M. a Entrance and Degree Competitive Exam, PSC Exam. Independently Published, 2020.
Great Britain. Department of Education and Science., ed. Report by HM Inspectors on Liverpool Polytechnic: The degree of master of engineering (M. Eng) in mechanical engineering. [s.l.]: Department of Education and Science, 1989.
Book chapters on the topic "M-degree":
Shustin, E. I. "New M- and (M-1)-curves of degree 8." In Lecture Notes in Mathematics, 487–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0082789.
Chedid, Fouad B. "A Group Quorum System of Degree $1+\sqrt{1+\frac{n}{m}}$." In Distributed Computing and Networking, 70–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11947950_8.
Howe, Roger. "The Invariants of Degree up to 6 of all n-ary m-ics." In Lie Theory and Geometry, 335–48. Boston, MA: Birkhäuser Boston, 1994. http://dx.doi.org/10.1007/978-1-4612-0261-5_12.
Rai, Shikha, and Shibsankar Das. "M-polynomial and Degree-Based Topological Indices of Subdivided Chain Hex-Derived Network of Type 3." In Communications in Computer and Information Science, 410–24. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96040-7_33.
Odifreddi, Piergiorgio. "The structure of m-degrees." In Lecture Notes in Mathematics, 315–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/bfb0076227.
Downey, Rod, and Noam Greenberg. "Totally < ω ω Computably Enumerable and m-topped Degrees." In Lecture Notes in Computer Science, 46–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11750321_3.
Yeh, Jenny Yuan-Chun, Chen-Mou Cheng, and Bo-Yin Yang. "Operating Degrees for XL vs. F4/F5 for Generic $\mathcal{M}Q$ with Number of Equations Linear in That of Variables." In Lecture Notes in Computer Science, 19–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-42001-6_3.
Downey, Rod, and Noam Greenberg. "m-topped degrees." In A Hierarchy of Turing Degrees, 134–48. Princeton University Press, 2020. http://dx.doi.org/10.23943/princeton/9780691199665.003.0006.
"Special Metadynes of Degree m = 4." In Metadyne Statics. The MIT Press, 2003. http://dx.doi.org/10.7551/mitpress/4563.003.0019.
"Some Transformer Metadynes of Degree m = 4." In Metadyne Statics. The MIT Press, 2003. http://dx.doi.org/10.7551/mitpress/4563.003.0015.
Conference papers on the topic "M-degree":
Melikyan, Argishti, Noriaki Kaneda, Kwangwoong Kim, and Po Dong. "Inter-Polarization 180-Degree Mixer for Reception of M-ASK Signals." In 2018 European Conference on Optical Communication (ECOC). IEEE, 2018. http://dx.doi.org/10.1109/ecoc.2018.8535341.
Rodriguez, Virginia Gutierrez, Isabel Sanchez Berriel, Jose Luis Roda Garcia, Luz Marina Moreno de Antonio, and Concepcion Riera Quintana. "M-learning project and M-EANor: Two teaching projects from the Degree in Computer Science and Engineering." In 2014 XI Tecnologias Aplicadas a la Ensenanza de la Electronica (Technologies Applied to Electronics Teaching) (TAEE). IEEE, 2014. http://dx.doi.org/10.1109/taee.2014.6900170.
Nasu, Hiroaki, Yasuyuki Nogami, Yoshitaka Morikawa, Shigeki Kobayashi, and Tatsuo Sugimura. "Systematic Generation of An Irreducible Polynomial of an Arbitrary Degree m over Fp Such That p ≫ m." In 2008 Third International Conference on Convergence and Hybrid Information Technology (ICCIT). IEEE, 2008. http://dx.doi.org/10.1109/iccit.2008.171.
Yanou, Akira, and Mingcong Deng. "Two degree-of-freedom of self-tuning GPC for m-input m-output systems by using a genetic algorithm." In 2010 IEEE International Conference on Mechatronics and Automation (ICMA). IEEE, 2010. http://dx.doi.org/10.1109/icma.2010.5588745.
Zong, Liangjia, Han Zhao, Zhiyong Feng, and Yunfei Yan. "Low-cost, Degree-expandable and Contention-free ROADM Architecture Based on M × N WSS." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2016. http://dx.doi.org/10.1364/ofc.2016.m3e.3.
Jiang, Hua. "Fuzzy Evaluation on Software Maintainability Based on Membership Degree Transformation New Algorithm M(1,2,3)." In 2009 International Conference on Business Intelligence and Financial Engineering (BIFE). IEEE, 2009. http://dx.doi.org/10.1109/bife.2009.28.
Suzuki, Taizo, Masaaki Ikehara, and Truong Q. Nguyen. "Block-lifting factorization of M-channel biorthogonal filter banks with an arbitrary McMillan degree." In 2011 18th IEEE International Conference on Image Processing (ICIP 2011). IEEE, 2011. http://dx.doi.org/10.1109/icip.2011.6116158.
Yanou, Akira, Akira Inoue, Mingcong Deng, and Shiro Masuda. "An Extension of Two Degree-of-Freedom of Generalized Predictive Control for M-input M-output Systems Based on State Space Approach." In Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007). IEEE, 2007. http://dx.doi.org/10.1109/icicic.2007.142.
Zhao, Jing, and Pengfei Guo. "Fuzzy Evaluation on Campus Network Security Based on Membership Degree Transformation New Algorithm--M(1,2,3)." In 2009 Second International Workshop on Computer Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/wcse.2009.651.
Jiang, Hua. "Fuzzy Comprehensive Evaluation on Digital Libraries Based on Membership Degree Transformation New Algorithm-M(1,2,3)." In Second International Symposium on Electronic Commerce and Security, ISECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/isecs.2009.245.
Reports on the topic "M-degree":
Levisohn, Sharon, Mark Jackwood, and Stanley Kleven. New Approaches for Detection of Mycoplasma iowae Infection in Turkeys. United States Department of Agriculture, February 1995. http://dx.doi.org/10.32747/1995.7612834.bard.
Dredge, L. A. Reconnaissance surficial geology, Joe Lake north, Nunavut, NTS 66-J north. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/329417.
Ray, Laura, Madeleine Jordan, Steven Arcone, Lynn Kaluzienski, Benjamin Walker, Peter Ortquist Koons, James Lever, and Gordon Hamilton. Velocity field in the McMurdo shear zone from annual ground penetrating radar imaging and crevasse matching. Engineer Research and Development Center (U.S.), December 2021. http://dx.doi.org/10.21079/11681/42623.
Peitz, David, and Naomi Reibold. Bird community monitoring at Wilson’s Creek National Battlefield, Missouri: Status report 2008–2020. Edited by Tani Hubbard. National Park Service, November 2021. http://dx.doi.org/10.36967/nrr-2287875.
Levisohn, Sharon, Maricarmen Garcia, David Yogev, and Stanley Kleven. Targeted Molecular Typing of Pathogenic Avian Mycoplasmas. United States Department of Agriculture, January 2006. http://dx.doi.org/10.32747/2006.7695853.bard.
Peitz, David, and Naomi Reibold. Bird community monitoring at George Washington Carver National Monu-ment, Missouri: Status report 2008–2020. Edited by Tani Hubbard. National Park Service, November 2021. http://dx.doi.org/10.36967/nrr-2287852.
MacFarlane, Andrew. 2021 medical student essay prize winner - A case of grief. Society for Academic Primary Care, July 2021. http://dx.doi.org/10.37361/medstudessay.2021.1.1.