Academic literature on the topic 'Loops'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Loops.'

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 "Loops"

1

Chen 陈, Huadong 华东, Lyndsay Fletcher, Guiping 桂萍 Zhou 周, Xin 鑫. Cheng 程, Ya 亚. Wang 汪, Sargam Mulay, Ruisheng 瑞生 Zheng 郑, Suli 素丽 Ma 马, and Xiaofan 小凡 Zhang 张. "Simultaneous Eruption and Shrinkage of Preexisting Flare Loops during a Subsequent Solar Eruption." Astrophysical Journal 976, no. 2 (November 25, 2024): 207. http://dx.doi.org/10.3847/1538-4357/ad8c25.

Full text
Abstract:
Abstract We investigated two consecutive solar eruption events in the solar active region 12994 at the solar eastern limb on 2022 April 15. We found that the flare loops formed by the first eruption were involved in the second eruption. During the initial stage of the second flare, the middle part of these flare loops (E-loops) erupted outward along with the flux ropes below, while the parts of the flare loops (I-loops1 and I-loops2) on either side of the E-loops first rose and then contracted. Approximately 1 hr after the eruption, the heights of I-loops1 and I-loops2 decreased by 9 Mm and 45 Mm, respectively, compared to before the eruption. Their maximum descent velocities were 30 km s−1 and 130 km s−1, respectively. The differential emission measure results indicate that the plasma above I-loops1 and I-loops2 began to be heated about 23 minutes and 44 minutes after the start of the second flare, respectively. Within ∼20 minutes, the plasma temperature in these regions increased from ∼3 MK to ∼6 MK. We proposed an adiabatic heating mechanism where magnetic energy would be converted into thermal and kinetic energy when the prestretched loops contract. Our calculations show that the magnetic energy required to heat the two high-temperature regions are 1029–1030 erg, which correspond to a loss of field strength of 2–3 G.
APA, Harvard, Vancouver, ISO, and other styles
2

Grosberg, Alexander Y. "Extruding Loops to Make Loopy Globules?" Biophysical Journal 110, no. 10 (May 2016): 2133–35. http://dx.doi.org/10.1016/j.bpj.2016.04.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

VanLehn, Kurt. "Regulative Loops, Step Loops and Task Loops." International Journal of Artificial Intelligence in Education 26, no. 1 (July 2, 2015): 107–12. http://dx.doi.org/10.1007/s40593-015-0056-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nishikino, Tatsuro, Hiroto Iwatsuki, Taira Mino, Seiji Kojima, and Michio Homma. "Characterization of PomA periplasmic loop and sodium ion entering in stator complex of sodium-driven flagellar motor." Journal of Biochemistry 167, no. 4 (November 18, 2019): 389–98. http://dx.doi.org/10.1093/jb/mvz102.

Full text
Abstract:
Abstract The bacterial flagellar motor is a rotary nanomachine driven by ion flow. The flagellar stator complex, which is composed of two proteins, PomA and PomB, performs energy transduction in marine Vibrio. PomA is a four transmembrane (TM) protein and the cytoplasmic region between TM2 and TM3 (loop2–3) interacts with the rotor protein FliG to generate torque. The periplasmic regions between TM1 and TM2 (loop1–2) and TM3 and TM4 (loop3–4) are candidates to be at the entrance to the transmembrane ion channel of the stator. In this study, we purified the stator complex with cysteine replacements in the periplasmic loops and assessed the reactivity of the protein with biotin maleimide (BM). BM easily modified Cys residues in loop3–4 but hardly labelled Cys residues in loop1–2. We could not purify the plug deletion stator (ΔL stator) composed of PomBΔ41–120 and WT-PomA but could do the ΔL stator with PomA-D31C of loop1–2 or with PomB-D24N of TM. When the ion channel is closed, PomA and PomB interact strongly. When the ion channel opens, PomA interacts less tightly with PomB. The plug and loop1–2 region regulate this activation of the stator, which depends on the binding of sodium ion to the D24 residue of PomB.
APA, Harvard, Vancouver, ISO, and other styles
5

deHaan, Jonathan. "Game loops, Game design loops, Game Terakoya loops and Ludic Language Pedagogy loops." Ludic Language Pedagogy 4 (January 17, 2022): 1–13. http://dx.doi.org/10.55853/llp_v4pg1.

Full text
Abstract:
What is this? An exploration of well-designed games, game design “best practices,” solid steps in my Game Terakoya teaching, and straightforward questions for other teachers using games. I’ll loop back again and again ;) in this paper to the central concept of “loops:” sequences or systems that repeat and vary to different educational or entertaining effects. Why did you make it? I read and think a lot about games and game design. I also spend a lot of time designing and improving my teaching. I noticed the connections and wanted to create something that would help other teachers think about the loops in their teaching as well. Who is it for? It’s for experienced teachers: you’ve been teaching for “forever” … step back a bit from your work and think about whether your teaching is overly complex and not “loopy” enough. Let’s all aim for some elegant ludic language pedagogy!
APA, Harvard, Vancouver, ISO, and other styles
6

Asai, Yukako, Tomokazu Shoji, Ikuro Kawagishi, and 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, no. 4 (February 15, 2000): 1001–7. http://dx.doi.org/10.1128/jb.182.4.1001-1007.2000.

Full text
Abstract:
ABSTRACT The sodium-driven motor consists of the products of at least four genes, pomA, pomB, motX, andmotY, in Vibrio alginolyticus. PomA and PomB, which are homologous to the MotA and MotB components of proton-driven motors, have four transmembrane segments and one transmembrane segment, respectively, and are thought to form an ion channel. In PomA, two periplasmic loops were predicted at positions 21 to 36 between membrane segments 1 and 2 (loop1-2) and at positions 167 to 180 between membrane segments 3 and 4 (loop3-4). To characterize the two periplasmic loop regions, which may have a role as an ion entrance for the channel, we carried out cysteine-scanning mutagenesis. The T186 residue in the fourth transmembrane segment and the D71, D148, and D202 residues in the predicted cytoplasmic portion of PomA were also replaced with Cys. Only two mutations, M179C and T186C, conferred a nonmotile phenotype. Many mutations in the periplasmic loops and all of the cytoplasmic mutations did not abolish motility, though the five successive substitutions from M169C to K173C of loop3-4 impaired motility. In some mutants that retained substantial motility, motility was inhibited by the thiol-modifying reagents dithionitrobenzoic acid and N-ethylmaleimide. The profiles of inhibition by the reagents were consistent with the membrane topology predicted from the hydrophobicity profiles. Furthermore, from the profiles of labeling by biotin maleimide, we predicted more directly the membrane topology of loop3-4. None of the loop1-2 residues were labeled, suggesting that the environments around the two loops are very different. A few of the mutations were characterized further. The structure and function of the loop regions are discussed.
APA, Harvard, Vancouver, ISO, and other styles
7

Chein, Orin, and Edgar G. Goodaire. "Code loops are RA2 loops." Journal of Algebra 130, no. 2 (May 1990): 385–87. http://dx.doi.org/10.1016/0021-8693(90)90088-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Larson, Eric. "Program analysis too loopy? Set the loops aside." IET Software 7, no. 3 (June 2013): 131–49. http://dx.doi.org/10.1049/iet-sen.2012.0048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dockalova, Bara. "Loops." Scenario: A Journal of Performative Teaching, Learning, Research V, no. 1 (January 1, 2011): 66–74. http://dx.doi.org/10.33178/scenario.5.1.6.

Full text
Abstract:
Our first Window of Practice contribution introduces a simple and effective language teaching technique called loops, which was developed as a part of the act and speak® method at Jeviste, a language school in Prague that specializes in using drama and theatre in language teaching. Loops allow for an intensive, focused, and engaging practice of narrowly selected language points, and they provide an easy start for improvisation and creative writing activities. The essence of loops lies in combining dramatic play with language drills in the form of repetitive dialogues. The dialogues must bear two important features: ambiguity and dramatic tension. The article provides suggestions on how teachers can create their own loops, and it describes the way loops can be used in the language classroom.
APA, Harvard, Vancouver, ISO, and other styles
10

Barfield, Lon. "Loops." ACM SIGCHI Bulletin - a supplement to interactions 2002 (January 2002): 15. http://dx.doi.org/10.1145/967135.967155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Loops"

1

Makkos, Joseph. "Recursive Loops." ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/357.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Taufer, Daniele. "Elliptic Loops." Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/265846.

Full text
Abstract:
Given an elliptic curve E over Fp and an integer e ≥ 1, we define a new object, called “elliptic loop”, as the set of plane projective points over Z/p^e Z lying over E, endowed with an operation inherited by the curve addition. This object is proved to be a power-associative abelian algebraic loop. Its substructures are investigated by means of other algebraic cubics defined over the same ring, which we named “shadow curve” and “layers”. When E has trace 1, a distinctive behavior is detected and employed for producing an isomorphism attack to the discrete logarithm on this family of curves. Stronger properties are derived for small values of e, which lead to an explicit description of the infinity part and to characterizing the geometry of rational |E|-torsion points.<br>Data 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.
APA, Harvard, Vancouver, ISO, and other styles
3

Taufer, Daniele. "Elliptic Loops." Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/265846.

Full text
Abstract:
Given an elliptic curve E over Fp and an integer e ≥ 1, we define a new object, called “elliptic loop”, as the set of plane projective points over Z/p^e Z lying over E, endowed with an operation inherited by the curve addition. This object is proved to be a power-associative abelian algebraic loop. Its substructures are investigated by means of other algebraic cubics defined over the same ring, which we named “shadow curve” and “layers”. When E has trace 1, a distinctive behavior is detected and employed for producing an isomorphism attack to the discrete logarithm on this family of curves. Stronger properties are derived for small values of e, which lead to an explicit description of the infinity part and to characterizing the geometry of rational |E|-torsion points.<br>Data 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.
APA, Harvard, Vancouver, ISO, and other styles
4

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/.

Full text
Abstract:
Neste trabalho estudamos loops de Bol 2-nilpotentes e de expoente 2. Além disso, mostramos que o ideal de aumento de uma álgebra de loop, de um loop finito p-nilpotente em característica p > 0, é nilpotente. Com este resultado conseguimos caracterizar os elementos inversíveis da álgebra de loop de um loop 2-nilpotente sobre um corpo de dois elementos. Provamos também que loops de Bol finitos 2-nilpotentes e de expoente 2 podem ser mergulhados em um loop de Bol à direita de elementos inversíveis de uma álgebra alternativa à direita, sobre um corpo de característica dois.<br>In 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.
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
Context. In recent years, Software Quality Assurance (SQA) has become a crucial part of software development processes. Therefore, modern software development processes led to an increase in demand for manual and automated code quality assurance. Manual code quality reviews can be a time-consuming and expensive process with varying results. Thus, automated code reviews turn out to be a preferred alternative for mitigating this process. However, commercial and open-source static code analyzer tools often offer deep analysis with long lead time. Objectives. In this thesis work, the main aim is to introduce an early code quality assurance tool, which features a combination of software metrics. The tool should be able to examine code quality and complexity of a telecommunication grade software product such as source code of specific Ericsson product by Ericsson. This tool should encapsulate complexity and quality of a software product with regards to its efficiency, scope, flexibility, and execution time. Methods. For this purpose, the background section of the thesis is dedicated to in-depth research on software metrics included in well-known static code analyzers. Then, development environment, under investigation source code of Ericsson product, and collected software metric for evaluation were presented. Next, according to each software metric’s characteristics, point of interest, and requirement, a set of steps based on a Susman’s action research cycle were defined. Moreover, SWAT, a suitable software analytics toolkit, employed to extract conducted experiment data of each software metric from a static analyzer code named Lizard in order to detect most efficient software metrics. Outcome of conducted experiment demonstrates relationship of selected software metrics with one another. Results. The chosen software metrics were evaluated based on a variety of vital factors especially actual data from number of defects of specific Ericsson product. Highly effective software metrics from investigations in this thesis work were implemented as a new model named hybrid model to be utilized as an early quality assurance. Conclusions. The proposed model, which consist of well-performing software metrics, demonstrate an impressive performance as an early code quality indicator. Consequently, the utilized model in this master thesis could be studied in a future research to further investigate the effectiveness and robustness of this tool an early quality assurance.
APA, Harvard, Vancouver, ISO, and other styles
6

Gabrieli, Elisabetta. "Spiegelungsstrukturen und K-Loops." [S.l. : s.n.], 2000. http://www.sub.uni-hamburg.de/disse/113/inhalt.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Stener, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ferná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.

Full text
Abstract:
Aquesta tesis esta estructurada en cinc capítols. Al capítol I, es fa una introducció als llaços, el subjecte d'estudi d'aquesta tesis. A més, es fa una petita introducció a les bases de dades biològiques de us corrent i de protocols bio-informàtics en comparacions de seqüències. Del capítol II al IV s'explora el paper que els llaços juguen a les proteïnes utilitzant un enfocament bio-informàtic, es realitza una classificació estructural de llaços (capítol II); es realitza un estudi per inferir relacions d'estructura i funció (capítol III) i es realitza un estudi de predicció d'estructura de llaços (capítol IV). Finalment al capítol V es presenten unes consideracions finals al treball realitzat i es proposen futures extensions al mateix.<br/>El 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.<br>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.<br/>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.
APA, Harvard, Vancouver, ISO, and other styles
9

Gowanlock, Graham Keith. "Impulse noise on telephone loops." Thesis, University of Ottawa (Canada), 1993. http://hdl.handle.net/10393/6611.

Full text
Abstract:
Impulse noise is an ever increasing impediment to successful digital data transmission in the telephone local cable plant. Two major factors have caused this to happen. Firstly, remedies have been found for nearly all the other causes of signal degradation, such as crosstalk and intersymbol interference, leaving impulse noise outstanding. Secondly, the user's demand for higher and higher data rates and the proliferation of repeaterless operation at extended loop ranges, have made the effects of impulse noise more prominent. This thesis covers the subject of impulse noise in the local plant. It begins with experimental data obtained from field studies of the local loop segments of digital transmission systems. The theoretical aspects of impulse noise are next addressed, including the various methodologies for modeling it. Burst errors in the recovered data stream, and their relationship with impulse noise, their principal cause, are described. The methodologies for modeling burst errors are then discussed. Finally, the techniques for minimizing the harmful effects of impulse noise are examined. Included in this is a novel scheme, referred to as "Pulse Sharpening", now being introduced.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhou, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Loops"

1

Aguilera, Andrés, and Alexey Ruzov, eds. R-Loops. New York, NY: Springer US, 2022. http://dx.doi.org/10.1007/978-1-0716-2477-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Best, Roland. Costas Loops. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72008-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brennan, Paul V. Phase-Locked Loops. London: Macmillan Education UK, 1996. http://dx.doi.org/10.1007/978-1-349-14006-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stavroulakis, Peter, ed. Wireless Local Loops. Chichester, UK: John Wiley & Sons, Ltd, 2001. http://dx.doi.org/10.1002/0470841877.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Encinas, J. B. Phase Locked Loops. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3064-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Best, Roland E. Phase-Locked Loops. New York: McGraw-Hill, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Encinas, J. B. Phase Locked Loops. Boston, MA: Springer US, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Encinas, J. B. Phase locked loops. London: Chapman & Hall, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Douglas, Stan. Monodramas and loops. Vancouver, B.C., Canada: UBC Fine Arts Gallery, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

C, Lindsey William, and Chie C. M, eds. Phase-locked loops. New York: IEEE Press, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Loops"

1

Olsson, Mikael. "Loops." In C++ 14 Quick Syntax Reference, 35–36. Berkeley, CA: Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1727-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Olsson, Mikael. "Loops." In PHP 7 Quick Scripting Reference, 27–30. Berkeley, CA: Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-1922-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bramer, Max. "Loops." In Logic Programming with Prolog, 85–97. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5487-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Meekings, B. A. E., T. P. Kudrycki, and M. D. Soren. "Loops." In A Book on C, 50–58. London: Macmillan Education UK, 1993. http://dx.doi.org/10.1007/978-1-349-12804-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Berry, R. E., B. A. E. Meekings, and M. D. Soren. "Loops." In A Book on C, 45–53. London: Palgrave Macmillan UK, 1988. http://dx.doi.org/10.1007/978-1-349-10233-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gerhard, Jürgen, Walter Oevel, Frank Postel, and Stefan Wehmeier. "Loops." In MuPAD Tutorial, 249–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-98114-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Olsson, Mikael. "Loops." In C# 8 Quick Syntax Reference, 33–35. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5577-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gonzalez-Morris, German, and Ivor Horton. "Loops." In Beginning C, 137–86. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5976-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Olsson, Mikael. "Loops." In C++20 Quick Syntax Reference, 49–52. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5995-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Beecher, Karl. "Loops." In Bad Programming Practices 101, 67–86. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3411-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Loops"

1

Maier, Andreas, Peter Marquard, and York Schröder. "Towards QCD at five loops." In Loops and Legs in Quantum Field Theory, 084. Trieste, Italy: Sissa Medialab, 2024. http://dx.doi.org/10.22323/1.467.0084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rodrigo, Germán. "Loop-tree duality at two loops." In Loops and Legs in Quantum Field Theory. Trieste, Italy: Sissa Medialab, 2018. http://dx.doi.org/10.22323/1.303.0031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Downie, Marc. "Loops." In ACM SIGGRAPH 2002 conference abstracts and applications. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/1242073.1242222.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dragomir, Ozana Silvia, and Koen Bertels. "K-loops: Loop skewing for Reconfigurable Architectures." In 2009 International Conference on Field-Programmable Technology (FPT). IEEE, 2009. http://dx.doi.org/10.1109/fpt.2009.5377656.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Yingwen, Yao Zhang, Sen Chen, Fu Song, Xiaofei Xie, Xiaohong Li, and Lintan Sun. "Inferring Loop Invariants for Multi-Path Loops." In 2021 International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2021. http://dx.doi.org/10.1109/tase52547.2021.00030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Larson, Eric. "Program Analysis Too Loopy? Set the Loops Aside." In 2011 11th IEEE Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 2011. http://dx.doi.org/10.1109/scam.2011.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schnell, Norbert, Benjamin Matuszewski, Jean-Philippe Lambert, Sébastien Robaszkiewicz, Oussama Mubarak, Dominique Cunin, Samuel Bianchini, Xavier Boissarie, and Gregory Cieslik. "Collective Loops." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morrison, Briana B., Adrienne Decker, and Lauren E. Margulieux. "Learning Loops." In ICER '16: International Computing Education Research Conference. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2960310.2960330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Paymal, Léa, and Sarah Fdili Alaoui. "Physicalizing loops." In C&C '23: Creativity and Cognition. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3591196.3593365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhixing, Wang, Li Wenhui, Li Huamin, and Wu Ruimin. "The Automatic Sketching of Planar Kinematic Chains." In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0285.

Full text
Abstract:
Abstract This paper presents a method for the automatic generation of independent loops and peripheral loops of planar kinematic chains. In order to implement this method, three laws are brought out and some new concepts, for instance, same-position-link, similar-loop, loop-link-vector, loop-joint-vector, loop-link matrix and loop-joint matrix, etc., are defined. Finally, planar kinematic chains are sketched automatically according to these loops generated.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Loops"

1

Cross, Rachel, and Sandip Chhetri. Extended Testing of Strand Lifting Loop Capacity. Precast/Prestressed Concrete Intitute, 2023. http://dx.doi.org/10.15554/pci.rr.misc-008.

Full text
Abstract:
This work on lifting loops builds on previous investigations and testing (Chhetri et al, 2020; Chhetri et al, 2021) and considers additional design and detailing parameters for prestressing strand lifting loops. The results from the loops in lightweight concrete demonstrated the influence of Mohs hardness of the coarse aggregate on loop capacity. These loops generally performed better than the Mertz test loops in normalweight concrete (Chhetri et al., 2021), which had a softer coarse aggregate. In addition, the strand bond of the loops used for the lightweight concrete testing was higher. Both of these factors ought to be considered when deciding the safe load for lifting loops.
APA, Harvard, Vancouver, ISO, and other styles
2

Peterson, T., and S. Wintercorn. D-Zero Colling Loops. Office of Scientific and Technical Information (OSTI), August 1987. http://dx.doi.org/10.2172/1030715.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Drukker, Nadav, David J. Gross, and Hirosi Ooguri. Wilson loops in minimal surfaces. Office of Scientific and Technical Information (OSTI), April 1999. http://dx.doi.org/10.2172/753038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ong, Mike M., Mike P. Perkins, Ron D. Speer, Charless G. Brown, and Tim L. Houck. Magnetic Coupling To A Loop Antenna In Proximity Of Shorted-large Loops. Office of Scientific and Technical Information (OSTI), May 2010. http://dx.doi.org/10.2172/1116942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Leandre, Remi. Galton–Watson Tree and Branching Loops. GIQ, 2012. http://dx.doi.org/10.7546/giq-6-2005-276-283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Leandre, Remi. Chen-Souriau Calculus for Rough Loops. GIQ, 2012. http://dx.doi.org/10.7546/giq-9-2008-252-260.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Malina, Stephen. The Magic of Fast Feedback Loops. Asimov Press, April 2025. https://doi.org/10.62211/55gh-72ht.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Oldham, Nate. Deployment of additional LWR test loops and BWR / Ramp testing in ATR – I-Loop. Office of Scientific and Technical Information (OSTI), December 2023. http://dx.doi.org/10.2172/2439393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Matias, Nathan, and Lucas Wright. Impact Assessment of Human-Algorithm Feedback Loops. Just Tech, Social Science Research Council, March 2022. http://dx.doi.org/10.35650/jt.3028.d.2022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Krishan, V., T. Sreedharan, and S. Mahajan. Vlasov-Maxwell equilibria of solar Coronal loops. Office of Scientific and Technical Information (OSTI), July 1990. http://dx.doi.org/10.2172/7059997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography