Gotowa bibliografia na temat „Loops”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Loops”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Loops"
Asai, Yukako, Tomokazu Shoji, Ikuro Kawagishi i Michio Homma. "Cysteine-Scanning Mutagenesis of the Periplasmic Loop Regions of PomA, a Putative Channel Component of the Sodium-Driven Flagellar Motor in Vibrio alginolyticus". Journal of Bacteriology 182, nr 4 (15.02.2000): 1001–7. http://dx.doi.org/10.1128/jb.182.4.1001-1007.2000.
Pełny tekst źródłaGrosberg, Alexander Y. "Extruding Loops to Make Loopy Globules?" Biophysical Journal 110, nr 10 (maj 2016): 2133–35. http://dx.doi.org/10.1016/j.bpj.2016.04.008.
Pełny tekst źródłaVanLehn, Kurt. "Regulative Loops, Step Loops and Task Loops". International Journal of Artificial Intelligence in Education 26, nr 1 (2.07.2015): 107–12. http://dx.doi.org/10.1007/s40593-015-0056-x.
Pełny tekst źródładeHaan, Jonathan. "Game loops, Game design loops, Game Terakoya loops and Ludic Language Pedagogy loops". Ludic Language Pedagogy 4 (17.01.2022): 1–13. http://dx.doi.org/10.55853/llp_v4pg1.
Pełny tekst źródłaLiu, Xiao, i Yan Xu. "HnRNPA1 Specifically Recognizes the Base of Nucleotide at the Loop of RNA G-Quadruplex". Molecules 23, nr 1 (22.01.2018): 237. http://dx.doi.org/10.3390/molecules23010237.
Pełny tekst źródłaChein, Orin, i Edgar G. Goodaire. "Code loops are RA2 loops". Journal of Algebra 130, nr 2 (maj 1990): 385–87. http://dx.doi.org/10.1016/0021-8693(90)90088-6.
Pełny tekst źródłaTechalertpaisarn, Paiboon, i Antheunis Versluis. "Effect of apical portion of T-, sloped L-, and reversed L-closing loops on their force systems". Angle Orthodontist 87, nr 1 (19.07.2016): 104–10. http://dx.doi.org/10.2319/020316-95.1.
Pełny tekst źródłaCozzo, Gabriele, Paolo Pagano, Antonino Petralia i Fabio Reale. "Asymmetric Twisting of Coronal Loops". Symmetry 15, nr 3 (2.03.2023): 627. http://dx.doi.org/10.3390/sym15030627.
Pełny tekst źródłaTan, Baolin. "The Early Evolution of Solar Flaring Plasma Loops". Universe 7, nr 10 (11.10.2021): 378. http://dx.doi.org/10.3390/universe7100378.
Pełny tekst źródłaJi, Wei Wei, Tao Wang, Yan Nie i Rong Zhou Gong. "Numerical Study on Controllable Multi-Band Microwave Metamaterial Absorbers". Advanced Materials Research 239-242 (maj 2011): 1260–64. http://dx.doi.org/10.4028/www.scientific.net/amr.239-242.1260.
Pełny tekst źródłaRozprawy doktorskie na temat "Loops"
Makkos, Joseph. "Recursive Loops". ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/357.
Pełny tekst źródłaTaufer, Daniele. "Elliptic Loops". Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/265846.
Pełny tekst źródłaData una curva ellittica E su Fp ed un intero e ≥ 1, definiamo un nuovo oggetto, chiamato "loop ellittico", come l'insieme dei punti nel piano proiettivo su Z/p^e Z che stanno sopra ad E, dotato di una operazione ereditata dalla somma di punti sulla curva. Questo oggetto si prova essere un loop algebrico con associatività delle potenze. Le sue sotto-strutture sono investigate utilizzando altre cubiche definite sullo stesso anello, che abbiamo chiamato "curva ombra" e "strati". Quando E ha traccia 1, un comportamento speciale viene notato e sfruttato per produrre un attacco di isomorfismo al problema del logaritmo discreto su questa famiglia di curve. Migliori proprietà vengono trovate per bassi valori di e, che portano ad una descrizione esplicita della parte all'infinito e alla caratterizzazione della geometria dei punti razionali di |E|-torsione.
Taufer, Daniele. "Elliptic Loops". Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/265846.
Pełny tekst źródłaData una curva ellittica E su Fp ed un intero e ≥ 1, definiamo un nuovo oggetto, chiamato "loop ellittico", come l'insieme dei punti nel piano proiettivo su Z/p^e Z che stanno sopra ad E, dotato di una operazione ereditata dalla somma di punti sulla curva. Questo oggetto si prova essere un loop algebrico con associatività delle potenze. Le sue sotto-strutture sono investigate utilizzando altre cubiche definite sullo stesso anello, che abbiamo chiamato "curva ombra" e "strati". Quando E ha traccia 1, un comportamento speciale viene notato e sfruttato per produrre un attacco di isomorfismo al problema del logaritmo discreto su questa famiglia di curve. Migliori proprietà vengono trovate per bassi valori di e, che portano ad una descrizione esplicita della parte all'infinito e alla caratterizzazione della geometria dei punti razionali di |E|-torsione.
Spohr, Cristina. "Loops de Bol 2-nilpotentes e de expoente 2". Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-16042010-133822/.
Pełny tekst źródłaIn this work we study 2-nilpotent Bol loops of exponent 2. Besides, we prove that the augmentation ideal of a loop algebra, of a finite p-nilpotent loop in characteristic p > 0, is nilpotent. With this result we characterized the invertible elements of the loop algebra of a 2-nilpotent loop over a field with two elements. We also proof that 2-nilpotent Bol loops of exponent 2 may be embedded into a right Bol loop of invertible elements of a right alternative algebra, over a field of characteristic 2.
Mehraban, Mehrdad. "Instant Feedback Loops – for short feedback loops and early quality assurance". Thesis, Blekinge Tekniska Högskola, Institutionen för kommunikationssystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13379.
Pełny tekst źródłaGabrieli, Elisabetta. "Spiegelungsstrukturen und K-Loops". [S.l. : s.n.], 2000. http://www.sub.uni-hamburg.de/disse/113/inhalt.html.
Pełny tekst źródłaStener, Mikael. "Moufang Loops : General theory and visualization of non-associative Moufang loops of order 16". Thesis, Uppsala universitet, Algebra och geometri, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-295889.
Pełny tekst źródłaFernández, Fuentes Narcís. "Classification of loops in protein structures: applications on loop modeling and protein function". Doctoral thesis, Universitat Autònoma de Barcelona, 2004. http://hdl.handle.net/10803/3516.
Pełny tekst źródłaEl treball realitza per el Dr. Oliva ha sigut el punt d'inici d'aquesta tesis. Al capítol II es presenta un procés totalment automatitzat de classificació estructural de llaços de proteïnes quinases. Diferent millores varen ser introduïdes al treball original del Dr. Oliva: (i) un nou procés de reagrupació que evita els solapament entre agrupacions de llaços, (ii) un servidor web que permet l'accés i recerca de dades sobre els llaços classificats a través de internet, (iii) referències creuades amb altre bases de dades important. El capítol III es centra en dues qüestions bàsiques: la conservació de la estructura dels llaços i la seva funció i la conservació de la estructura dels llaços i la seva relació amb l'evolució. Un extensiu estudi sobre una classificació estructural de llaços de proteïnes quinases va ser realitzat. El motiu pe el quan les quinases varen ser escollides com a subjecte d'estudi es degut a la seva importància biològica i perquè hi ha molta informació disponible a la literatura. Finalment al capítol IV s'estudia la aplicabilitat de les classificacions estructurals de llaços en el camp de la predicció d'estructura. Es va realitzat un test de validació (Jack-knife test) per provar la utilitat de la informació de la seqüència en forma de perfils de les agrupacions estructurals de llaços.
This thesis is structured into five chapters. In chapter I, protein loops - the topics of this thesis work - are introduced. Also, a short description of biological databases and current protocols in sequence comparison are given. Chapters II to IV explore a major role that loop segments play in protein structures by using a structural bio-informatics approach: (i) the structural classification (ii) the relationship between the structure and function and (iii) the structure prediction of loops. The conclusive chapter V is devoted to several considerations that complement the conclusions given in previous chapters. Extensions of this thesis work are also suggested.
The research project on structural classification of loops, which was carried out by Dr. Oliva (Oliva et al. 1997), has been the starting point for all the other subsequent projects. In chapter II, a fully automated process for the structural classification of loops of kinases is presented. Several methodological improvements were made on the basis of Oliva's original work: (i) a newly introduced re-clustering process allows to avoid overlaps in classified loop clusters, (ii) a new web server was established to provide access and/or to query data through the internet, and (iii) cross referencing links were introduced with other biological databases. Chapter III focuses on two questions: the conservation of loop structures and functions and the extent of conservation of loop structures during evolution. An extensive analysis of a structural loop database of protein kinases was carried out. There are two main reasons why kinases were selected for the subject of this study: first, their critical biological relevance, and second the vast amount of functional information available in the literature and biological databases. Finally, in chapter IV, we apply ArchDB(Espadaler et al. 2004) for loop structure prediction. A Jack-knife test is performed to assess the usefulness of sequence information, which is included in the form of profiles in our structural clusters.
Gowanlock, Graham Keith. "Impulse noise on telephone loops". Thesis, University of Ottawa (Canada), 1993. http://hdl.handle.net/10393/6611.
Pełny tekst źródłaZhou, Yongxin. "Alternative algebras and RA loops". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0002/NQ42490.pdf.
Pełny tekst źródłaKsiążki na temat "Loops"
Loops. New York: McGraw-Hill, 2009.
Znajdź pełny tekst źródłaAguilera, Andrés, i Alexey Ruzov, red. R-Loops. New York, NY: Springer US, 2022. http://dx.doi.org/10.1007/978-1-0716-2477-7.
Pełny tekst źródłaBest, Roland. Costas Loops. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72008-1.
Pełny tekst źródłaLoops: Gedichte. Graz: Literaturverlag Droschl, 2001.
Znajdź pełny tekst źródłaBrennan, Paul V. Phase-Locked Loops. London: Macmillan Education UK, 1996. http://dx.doi.org/10.1007/978-1-349-14006-0.
Pełny tekst źródłaStavroulakis, Peter, red. Wireless Local Loops. Chichester, UK: John Wiley & Sons, Ltd, 2001. http://dx.doi.org/10.1002/0470841877.
Pełny tekst źródłaEncinas, J. B. Phase Locked Loops. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3064-0.
Pełny tekst źródłaBest, Roland E. Phase-Locked Loops. New York: McGraw-Hill, 2007.
Znajdź pełny tekst źródłaEncinas, J. B. Phase Locked Loops. Boston, MA: Springer US, 1993.
Znajdź pełny tekst źródłaDouglas, Stan. Monodramas and loops. Vancouver, B.C., Canada: UBC Fine Arts Gallery, 1992.
Znajdź pełny tekst źródłaCzęści książek na temat "Loops"
Olsson, Mikael. "Loops". W C++ 14 Quick Syntax Reference, 35–36. Berkeley, CA: Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1727-6_10.
Pełny tekst źródłaOlsson, Mikael. "Loops". W PHP 7 Quick Scripting Reference, 27–30. Berkeley, CA: Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-1922-5_7.
Pełny tekst źródłaBramer, Max. "Loops". W Logic Programming with Prolog, 85–97. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5487-7_6.
Pełny tekst źródłaMeekings, B. A. E., T. P. Kudrycki i M. D. Soren. "Loops". W A Book on C, 50–58. London: Macmillan Education UK, 1993. http://dx.doi.org/10.1007/978-1-349-12804-4_6.
Pełny tekst źródłaBerry, R. E., B. A. E. Meekings i M. D. Soren. "Loops". W A Book on C, 45–53. London: Palgrave Macmillan UK, 1988. http://dx.doi.org/10.1007/978-1-349-10233-4_6.
Pełny tekst źródłaGerhard, Jürgen, Walter Oevel, Frank Postel i Stefan Wehmeier. "Loops". W MuPAD Tutorial, 249–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-98114-2_16.
Pełny tekst źródłaOlsson, Mikael. "Loops". W C# 8 Quick Syntax Reference, 33–35. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5577-3_8.
Pełny tekst źródłaGonzalez-Morris, German, i Ivor Horton. "Loops". W Beginning C, 137–86. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5976-4_4.
Pełny tekst źródłaOlsson, Mikael. "Loops". W C++20 Quick Syntax Reference, 49–52. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5995-5_10.
Pełny tekst źródłaBeecher, Karl. "Loops". W Bad Programming Practices 101, 67–86. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3411-2_5.
Pełny tekst źródłaStreszczenia konferencji na temat "Loops"
Rodrigo, Germán. "Loop-tree duality at two loops". W Loops and Legs in Quantum Field Theory. Trieste, Italy: Sissa Medialab, 2018. http://dx.doi.org/10.22323/1.303.0031.
Pełny tekst źródłaDownie, Marc. "Loops". W ACM SIGGRAPH 2002 conference abstracts and applications. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/1242073.1242222.
Pełny tekst źródłaDragomir, Ozana Silvia, i Koen Bertels. "K-loops: Loop skewing for Reconfigurable Architectures". W 2009 International Conference on Field-Programmable Technology (FPT). IEEE, 2009. http://dx.doi.org/10.1109/fpt.2009.5377656.
Pełny tekst źródłaLin, Yingwen, Yao Zhang, Sen Chen, Fu Song, Xiaofei Xie, Xiaohong Li i Lintan Sun. "Inferring Loop Invariants for Multi-Path Loops". W 2021 International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2021. http://dx.doi.org/10.1109/tase52547.2021.00030.
Pełny tekst źródłaLarson, Eric. "Program Analysis Too Loopy? Set the Loops Aside". W 2011 11th IEEE Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 2011. http://dx.doi.org/10.1109/scam.2011.22.
Pełny tekst źródłaSchnell, Norbert, Benjamin Matuszewski, Jean-Philippe Lambert, Sébastien Robaszkiewicz, Oussama Mubarak, Dominique Cunin, Samuel Bianchini, Xavier Boissarie i Gregory Cieslik. "Collective Loops". W TEI '17: Eleventh International Conference on Tangible, Embedded, and Embodied Interaction. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3024969.3024972.
Pełny tekst źródłaMorrison, Briana B., Adrienne Decker i Lauren E. Margulieux. "Learning Loops". W ICER '16: International Computing Education Research Conference. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2960310.2960330.
Pełny tekst źródłaPaymal, Léa, i Sarah Fdili Alaoui. "Physicalizing loops". W C&C '23: Creativity and Cognition. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3591196.3593365.
Pełny tekst źródłaPayne, A. J. "Translinear phase-lock loops". W IEE Colloquium on Phase Lock Loops: Theory and Practice. IEE, 1999. http://dx.doi.org/10.1049/ic:19990570.
Pełny tekst źródłaDragomir, O. S., i K. Bertels. "Loop distribution for K-loops on Reconfigurable Architectures". W 2011 Design, Automation & Test in Europe. IEEE, 2011. http://dx.doi.org/10.1109/date.2011.5763245.
Pełny tekst źródłaRaporty organizacyjne na temat "Loops"
Peterson, T., i S. Wintercorn. D-Zero Colling Loops. Office of Scientific and Technical Information (OSTI), sierpień 1987. http://dx.doi.org/10.2172/1030715.
Pełny tekst źródłaOng, Mike M., Mike P. Perkins, Ron D. Speer, Charless G. Brown i Tim L. Houck. Magnetic Coupling To A Loop Antenna In Proximity Of Shorted-large Loops. Office of Scientific and Technical Information (OSTI), maj 2010. http://dx.doi.org/10.2172/1116942.
Pełny tekst źródłaDrukker, Nadav, David J. Gross i Hirosi Ooguri. Wilson loops in minimal surfaces. Office of Scientific and Technical Information (OSTI), kwiecień 1999. http://dx.doi.org/10.2172/753038.
Pełny tekst źródłaLeandre, Remi. Galton–Watson Tree and Branching Loops. GIQ, 2012. http://dx.doi.org/10.7546/giq-6-2005-276-283.
Pełny tekst źródłaLeandre, Remi. Chen-Souriau Calculus for Rough Loops. GIQ, 2012. http://dx.doi.org/10.7546/giq-9-2008-252-260.
Pełny tekst źródłaMatias, Nathan, i Lucas Wright. Impact Assessment of Human-Algorithm Feedback Loops. Just Tech, Social Science Research Council, marzec 2022. http://dx.doi.org/10.35650/jt.3028.d.2022.
Pełny tekst źródłaKrishan, V., T. Sreedharan i S. Mahajan. Vlasov-Maxwell equilibria of solar Coronal loops. Office of Scientific and Technical Information (OSTI), lipiec 1990. http://dx.doi.org/10.2172/7059997.
Pełny tekst źródłaCatani, Stefano, Tanju Gleisberg, Frank Krauss, German Rodrigo i Jan-Christopher Winter. From Loops to Trees By-passing Feynman's Theorem. Office of Scientific and Technical Information (OSTI), kwiecień 2008. http://dx.doi.org/10.2172/927533.
Pełny tekst źródłaBass, Charles A., i Jr. Decision Loops: The Cybernetic Dimension of Battle Command. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1996. http://dx.doi.org/10.21236/ada324331.
Pełny tekst źródłaFarhi, Emmanuel, i Jean Tirole. Deadly Embrace: Sovereign and Financial Balance Sheets Doom Loops. Cambridge, MA: National Bureau of Economic Research, styczeń 2016. http://dx.doi.org/10.3386/w21843.
Pełny tekst źródła