Relevant bibliographies by topics / Computation loops

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Computation loops'

Author: Grafiati
Published: 4 June 2025
Last updated: 1 August 2025

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 'Computation 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 "Computation loops"

1

Esguerra, Mauricio. "Computation of minor hysteresis loops from measured major loops." Journal of Magnetism and Magnetic Materials 157-158 (May 1996): 366–68. http://dx.doi.org/10.1016/0304-8853(95)01063-7.

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

Liao, Jing, Mark Finch, and Hugues Hoppe. "Fast computation of seamless video loops." ACM Transactions on Graphics 34, no. 6 (2015): 1–10. http://dx.doi.org/10.1145/2816795.2818061.

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

Baumeler, Ämin. "Causal loops: Logically consistent correlations, time travel, and computation." it - Information Technology 61, no. 2-3 (2019): 135–41. http://dx.doi.org/10.1515/itit-2019-0005.

Full text
Abstract:
Abstract Causal loops are loops in cause-effect relations, where, say for two events A, B, the event A is a cause of B and, vice versa, B is a cause of A. Such loops are traditionally ruled out due to potential logical problems, e. g., where an effect suppresses its own cause. Motivated by our current physical theories, we show that not only causal loops exist that are logically consistent, but that these loops are computationally tame and help to further investigate on the theoretical foundations of time travel. Causal loops do not necessarily pose problems from a logics, computer-science, an
APA, Harvard, Vancouver, ISO, and other styles
4

DONGEN, VINCENT VAN. "COMPILING DISTRIBUTED LOOPS ONTO SPMD CODE." Parallel Processing Letters 04, no. 03 (1994): 301–12. http://dx.doi.org/10.1142/s0129626494000284.

Full text
Abstract:
Given a loop written in a sequential language and a block-cyclic distribution, we present some techniques for generating SPMD code to run on distributed-memory machines. This is illustrated on three types of loops: parallel loops without internal dependence, parallel loops with internal dependences, and loops with hidden parallelism. Two models of distributions are considered: the data distribution and the computation distribution. We argue here that the data distribution model together with the owner-computes rule is only well adapted for the first class of loops. For the other loops, we pres
APA, Harvard, Vancouver, ISO, and other styles
5

Chi-Chung, Lam, P. Sadayappan, and Rephael Wenger. "On Optimizing a Class of Multi-Dimensional Loops with Reduction for Parallel Execution." Parallel Processing Letters 07, no. 02 (1997): 157–68. http://dx.doi.org/10.1142/s0129626497000176.

Full text
Abstract:
This paper addresses the compile-time optimization of a form of nested-loop computation that is motivated by a computational physics application. The computations involve multi-dimensional surface and volume integrals where the integrand is a product of a number of array terms. Besides the issue of optimal distribution of the arrays among the processors, there is also scope for reordering of the operations using the commutativity and associativity properties of addition and multiplication, and the application of the distributive law to significantly reduce the number of operations executed. A
APA, Harvard, Vancouver, ISO, and other styles
6

Somsuk, Kritsanapong. "The new integer factorization algorithm based on Fermat’s Factorization Algorithm and Euler’s theorem." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1469. http://dx.doi.org/10.11591/ijece.v10i2.pp1469-1476.

Full text
Abstract:
Although, Integer Factorization is one of the hard problems to break RSA, many factoring techniques are still developed. Fermat’s Factorization Algorithm (FFA) which has very high performance when prime factors are close to each other is a type of integer factorization algorithms. In fact, there are two ways to implement FFA. The first is called FFA-1, it is a process to find the integer from square root computing. Because this operation takes high computation cost, it consumes high computation time to find the result. The other method is called FFA-2 which is the different technique to find p
APA, Harvard, Vancouver, ISO, and other styles
7

Kritsanapong, Somsuk. "The new integer factorization algorithm based on fermat's factorization algorithm and euler's theorem." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1469–76. https://doi.org/10.11591/ijece.v10i2.pp1469-1476.

Full text
Abstract:
Although, Integer Factorization is one of the hard problems to break RSA, many factoring techniques are still developed. Fermat’s Factorization Algorithm (FFA) which has very high performance when prime factors are close to each other is a type of integer factorization algorithms. In fact, there are two ways to implement FFA. The first is called FFA-1, it is a process to find the integer from square root computing. Because this operation takes high computation cost, it consumes high computation time to find the result. The other method is called FFA-2 which is the different technique to
APA, Harvard, Vancouver, ISO, and other styles
8

Rowicki, Andrzej. "Preemptive Scheduling for Two-Processor Systems." Fundamenta Informaticae 11, no. 1 (1988): 1–19. http://dx.doi.org/10.3233/fi-1988-11102.

Full text
Abstract:
The purpose of the paper is to consider an algorithm for preemptive scheduling for two-processor systems with identical processors. Computations submitted to the systems are composed of dependent tasks with arbitrary execution times and contain no loops and have only one output. We assume that preemptions times are completely unconstrained, and preemptions consume no time. Moreover, the algorithm determines the total execution time of the computation. It has been proved that this algorithm is optimal, that is, the total execution time of the computation (schedule length) is minimized.
APA, Harvard, Vancouver, ISO, and other styles
9

Granger, Richard. "The evolution of computation in brain circuitry." Behavioral and Brain Sciences 29, no. 1 (2006): 17–18. http://dx.doi.org/10.1017/s0140525x06279019.

Full text
Abstract:
The attempt to derive mental function from brain structure is highly constrained by study of the allometric changes among brain components with evolution. In particular, even if homologous structures in different species produce similar computations, they may be constituents of larger systems (e.g., cortical-subcortical loops) that exhibit different composite operations as a function of relative size and connectivity in different-sized brains. The resulting evolutionary constraints set useful and specific conditions on candidate hypotheses of brain circuit computation.
APA, Harvard, Vancouver, ISO, and other styles
10

Iengo, Roberto, and Sergio Pugnetti. "Higher loops computation of critical exponents by stochastic quantization." Nuclear Physics B 300 (January 1988): 109–27. http://dx.doi.org/10.1016/0550-3213(88)90588-3.

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

Dissertations / Theses on the topic "Computation loops"

1

Luz, Cleber Silva Ferreira da. "Metodologia e ferramentas para paralelização de laços perfeitamente aninhados com processamento heterogêneo." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-22052018-134742/.

Full text
Abstract:
Aplicações podem apresentar laços perfeitamente aninhados que demandam um alto poder de processamento. Diversas aplicações científicas contêm laços aninhados em suas estruturas. Tais laços podem processar computações heterogêneas. Uma solução para reduzir o tempo de execução desta classe de aplicações é a paralelização destes laços. A heterogeneidade dos tempos de execução de computações presentes nas iterações de laços perfeitamente aninhados demanda uma paralelização adequada visando uma distribuição de carga homogênea entre os recursos computacionais para reduzir a ociosidade de tais recurs
APA, Harvard, Vancouver, ISO, and other styles
2

Sonavane, U. B. "Computational study of anticodon loops of tRNAs having modified nucleosides." Thesis(Ph.D.), CSIR-National Chemical Laboratory, Pune, 2002. http://dspace.ncl.res.in:8080/xmlui/handle/20.500.12252/2346.

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

Atabaki, Nima. "Experimental and computational studies of loop heat pipes." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100314.

Full text
Abstract:
Computational and experimental investigations of fluid flow and heat transfer aspects of loop heat pipes (LHPs) are presented in this thesis. The overall goal is to formulate and develop cost-effective mathematical models and numerical solution methods for computer simulations of LHPs. This work has five distinct parts.<br>First, a basic network thermofluid model of conventional LHPs operating under steady-state conditions is proposed, implemented, tested, and applied. It illustrates the main steps in the formulation of such models. The capabilities of this basic model are assessed by applying
APA, Harvard, Vancouver, ISO, and other styles
4

Akupatni, Vivek Bharath. "My4Sight: A Human Computation Platform for Improving Flu Predictions." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/56579.

Full text
Abstract:
While many human computation (human-in-the-loop) systems exist in the field of Artificial Intelligence (AI) to solve problems that can't be solved by computers alone, comparatively fewer platforms exist for collecting human knowledge, and evaluation of various techniques for harnessing human insights in improving forecasting models for infectious diseases, such as Influenza and Ebola. In this thesis, we present the design and implementation of My4Sight, a human computation system developed to harness human insights and intelligence to improve forecasting models. This web-accessible system sim
APA, Harvard, Vancouver, ISO, and other styles
5

Ravishankar, Mahesh. "Automatic Parallelization of Loops with Data Dependent Control Flow and Array Access Patterns." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1400085733.

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

Ó, Nuanáin Cárthach. "Connecting time and timbre: computational methods for generative rhythmic loops in symbolic and signal domains." Doctoral thesis, Universitat Pompeu Fabra, 2018. http://hdl.handle.net/10803/482191.

Full text
Abstract:
The practice of music composition often stems from a small idea or motif that blossoms into a complete work through careful application of repetition, variation and a dash of inspiration. In the highly rhythmic and repetitive strain of music that is electronic dance, this motif is the fundamental building block known as the loop, and is accorded greater importance than any other style. While other genres can depend upon long-established rules governing things like harmonic structure and form, many dance tracks do not stray far from its fundamental central theme in the traditional sense. Rather
APA, Harvard, Vancouver, ISO, and other styles
7

Wong, Samuel Wing Kwong. "Statistical Computation for Problems in Dynamic Systems and Protein Folding." Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11036.

Full text
Abstract:
Inference for dynamic systems and conformational sampling for protein folding are two problems motivated by applied data, which pose computational challenges from a statistical perspective. Dynamic systems are often described by a set of coupled differential equations, and methods of parametric estimation for these models from noisy data can require repeatedly solving the equations numerically. Many of these models also lead to rough likelihood surfaces, which makes sampling difficult. We introduce a method for Bayesian inference on these models, using a multiple chain framework that exploi
APA, Harvard, Vancouver, ISO, and other styles
8

Görries, Simon. "ATHENA Space Telescope: Line of Sight Control with a Hexapod in the Loop." Thesis, KTH, Optimeringslära och systemteori, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-215922.

Full text
Abstract:
The Advanced Telescope for High-Energy Astrophysics, Athena, is an x-ray telescope with a 2000 kg mirror module mounted on a six degree of freedom hexapod mechanism. It is currently assessed in a phase A feasibility study as L-class mission in the European Space Agency’s Cosmic Vision 2015-2025 plan with a launch foreseen in 2028. The total mass of the spacecraft is approximately 8000 kg, which is mainly distributed to the mirror module on the one side and to the focal plane module on the other side of the telescope tube. Such a design is without precedent in any European mission and imposes s
APA, Harvard, Vancouver, ISO, and other styles
9

Allmendinger, Richard. "Tuning evolutionary search for closed-loop optimization." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/tuning-evolutionary-search-for-closedloop-optimization(d54e63e2-7927-42aa-b974-c41e717298cb).html.

Full text
Abstract:
Closed-loop optimization deals with problems in which candidate solutions are evaluated by conducting experiments, e.g. physical or biochemical experiments. Although this form of optimization is becoming more popular across the sciences, it may be subject to rather unexplored resourcing issues, as any experiment may require resources in order to be conducted. In this thesis we are concerned with understanding how evolutionary search is affected by three particular resourcing issues -- ephemeral resource constraints (ERCs), changes of variables, and lethal environments -- and the development of
APA, Harvard, Vancouver, ISO, and other styles
10

Buss, Aaron Thomas. "Closing the developmental loop on the behavioral and neural dynamics of flexible rule-use." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/4949.

Full text
Abstract:
Executive function (EF) is a central aspect of cognition that undergoes significant changes in early childhood. Changes in EF in early childhood are robustly predictive of academic achievement and general quality of life measures later in adulthood. I develop a dynamic neural field (DNF) model which provides a process-based account of behavior and developmental change in a key task used to probe the early development of executive function--the Dimensional Change Card Sort (DCCS) task. In the DCCS, children must flexibly switch from sorting cards either by shape or color to sorting by the other
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Computation loops"

1

Ravi, Mirchandaney, and Langley Research Center, eds. The preprocessed doacross loop. National Aeronautics and Space Administration, Langley Research Center, 1990.

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

Giesy, Daniel P. FREQ: A computational package for multivariable system loop-shaping procedures. Langley Research Center, 1989.

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

Shao, Hua-Sheng. Heavy Quarkonium Production Phenomenology and Automation of One-Loop Scattering Amplitude Computations. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-1624-0.

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

Sakellariou, Rizos. On the quest for perfect load-balance in loop-based parallel computations. University of Manchester, 1997.

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

Geological Survey (U.S.), ed. Computation of transient soundings for the time-derivative of Hz near a rectangular loop source on a layered earth: (Program FWDTHZ). U.S. Dept. of the Interior, Geological Survey, 1985.

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

Steven, Rosenberg, and Clara L. Aldana. Analysis, geometry, and quantum field theory: International conference in honor of Steve Rosenberg's 60th birthday, September 26-30, 2011, Potsdam University, Potsdam, Germany. American Mathematical Society, 2012.

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

Shao, Hua-Sheng. Heavy Quarkonium Production Phenomenology and Automation of One-Loop Scattering Amplitude Computations. Springer London, Limited, 2016.

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

Shao, Hua-Sheng. Heavy Quarkonium Production Phenomenology and Automation of One-Loop Scattering Amplitude Computations. Springer, 2018.

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

Shao, Hua-Sheng. Heavy Quarkonium Production Phenomenology and Automation of One-Loop Scattering Amplitude Computations. Springer, 2016.

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

Manoonpong, Poramate, and Christian Tetzlaff, eds. Neural Computation in Embodied Closed-Loop Systems for the Generation of Complex Behavior: From Biology to Technology. Frontiers Media SA, 2018. http://dx.doi.org/10.3389/978-2-88945-605-5.

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

Book chapters on the topic "Computation loops"

1

Hou, Cong, Daniel Quinlan, David Jefferson, Richard Fujimoto, and Richard Vuduc. "Synthesizing Loops for Program Inversion." In Reversible Computation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36315-3_6.

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

Blanc, Régis, Thomas A. Henzinger, Thibaud Hottelier, and Laura Kovács. "ABC: Algebraic Bound Computation for Loops." In Logic for Programming, Artificial Intelligence, and Reasoning. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17511-4_7.

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

Artic, Katharina, and Gerhard Hiss. "On Right Conjugacy Closed Loops of Twice Prime Order." In Group Theory and Computation. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2047-7_1.

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

Davoren, J. M., T. Moor, and A. Nerode. "Hybrid Control Loops, A/D Maps, and Dynamic Specifications." In Hybrid Systems: Computation and Control. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45873-5_14.

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

Ray, Saikat, Roch Guérin, and Rute Sofia. "Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72990-7_13.

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

Broedel, Johannes, and André Kaderli. "A Geometrical Framework for Amplitude Recursions: Bridging Between Trees and Loops." In Texts & Monographs in Symbolic Computation. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80219-6_6.

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

Linge, Svein, and Hans Petter Langtangen. "Loops and Branching." In Programming for Computations - Python. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16877-3_3.

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

Langtangen, Hans Petter. "Loops and Lists." In Texts in Computational Science and Engineering. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49887-3_2.

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

Langtangen, Hans Petter. "Loops and Lists." In Texts in Computational Science and Engineering. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30293-0_2.

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

Langtangen, Hans Petter. "Loops and Lists." In Texts in Computational Science and Engineering. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18366-9_2.

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

Conference papers on the topic "Computation loops"

1

Papadopoulos, Costas, Giuseppe Bevilacqua, Dhimiter Canko, and Aris Spourdalakis. "Two-loop amplitude computation with HELAC." In Loops and Legs in Quantum Field Theory. Sissa Medialab, 2024. http://dx.doi.org/10.22323/1.467.0051.

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

Papadopoulos, Costas, Adam Kardos, Alexander Smirnov, Nikolaos Syrrakos, and Christopher Wever. "Progress in two-loop Master Integrals computation." In Loops and Legs in Quantum Field Theory. Sissa Medialab, 2022. http://dx.doi.org/10.22323/1.416.0021.

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

Sumino, Yukinari. "Computation of Heavy Quarkonium Spectrum in Perturbative QCD." In Loops and Legs in Quantum Field Theory. Sissa Medialab, 2016. http://dx.doi.org/10.22323/1.260.0011.

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

Uccirati, Sandro, Ansgar Denner, Lars Hofer, and Andreas SCHARF. "Automatizing one-loop computation in the SM with RECOLA." In Loops and Legs in Quantum Field Theory. Sissa Medialab, 2014. http://dx.doi.org/10.22323/1.211.0023.

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

Kudless, Andrew. "Gordian Knots and Endless Loops." In ACADIA 2011: Integration Through Computation. ACADIA, 2011. http://dx.doi.org/10.52842/conf.acadia.2011.160.

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

Kudless, Andrew. "Gordian Knots and Endless Loops." In ACADIA 2011: Integration Through Computation. ACADIA, 2011. http://dx.doi.org/10.52842/conf.acadia.2011.160.

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

Schröder, York. "Automated computation meets hot QCD." In “Loops and Legs in Quantum Field Theory ” 11th DESY Workshop on Elementary Particle Physics. Sissa Medialab, 2013. http://dx.doi.org/10.22323/1.151.0063.

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

Ang, Boon Seong. "Efficient implementation of sequential loops in dataflow computation." In the conference. ACM Press, 1993. http://dx.doi.org/10.1145/165180.165203.

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

Hashimoto, Masatomo, Masaaki Terai, Toshiyuki Maeda, and Kazuo Minami. "An Empirical Study of Computation-Intensive Loops for Identifying and Classifying Loop Kernels." In ICPE '17: ACM/SPEC International Conference on Performance Engineering. ACM, 2017. http://dx.doi.org/10.1145/3030207.3030217.

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

Wijesinghe, Gayan, and Vic Ciesielski. "Evolving programs with parameters and loops." In 2010 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2010. http://dx.doi.org/10.1109/cec.2010.5586018.

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

Reports on the topic "Computation loops"

1

Hawley, Owston, and Thorson. PR-015-13610-R01 Effect of Upstream Piping Configuration on Ultrasonic Meter Bias - Flow Validation. Pipeline Research Council International, Inc. (PRCI), 2014. http://dx.doi.org/10.55274/r0010033.

Full text
Abstract:
This research demonstrated the ability of a Computational Fluid Dynamics (CFD) modeling approach to predict the severity of velocity profile disturbances in two different header configurations with AGA-9 default meter runs. The CFD model was also used to predict the flow measurement error based on the ultrasonic path geometry from four commercially-available ultrasonic flow meters. In addition to the CFD modeling, this project experimentally tested the same two header configurations in a natural gas flow loop. The results from the experimental testing were used to validate the CFD model.
APA, Harvard, Vancouver, ISO, and other styles
2

Idakwo, Gabriel, Sundar Thangapandian, Joseph Luttrell, Zhaoxian Zhou, Chaoyang Zhang, and Ping Gong. Deep learning-based structure-activity relationship modeling for multi-category toxicity classification : a case study of 10K Tox21 chemicals with high-throughput cell-based androgen receptor bioassay data. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/41302.

Full text
Abstract:
Deep learning (DL) has attracted the attention of computational toxicologists as it offers a potentially greater power for in silico predictive toxicology than existing shallow learning algorithms. However, contradicting reports have been documented. To further explore the advantages of DL over shallow learning, we conducted this case study using two cell-based androgen receptor (AR) activity datasets with 10K chemicals generated from the Tox21 program. A nested double-loop cross-validation approach was adopted along with a stratified sampling strategy for partitioning chemicals of multiple AR
APA, Harvard, Vancouver, ISO, and other styles
3

Or, Etti, David Galbraith, and Anne Fennell. Exploring mechanisms involved in grape bud dormancy: Large-scale analysis of expression reprogramming following controlled dormancy induction and dormancy release. United States Department of Agriculture, 2002. http://dx.doi.org/10.32747/2002.7587232.bard.

Full text
Abstract:
The timing of dormancy induction and release is very important to the economic production of table grape. Advances in manipulation of dormancy induction and dormancy release are dependent on the establishment of a comprehensive understanding of biological mechanisms involved in bud dormancy. To gain insight into these mechanisms we initiated the research that had two main objectives: A. Analyzing the expression profiles of large subsets of genes, following controlled dormancy induction and dormancy release, and assessing the role of known metabolic pathways, known regulatory genes and novel se
APA, Harvard, Vancouver, ISO, and other styles
4

Development of an Adaptive Efficient Thermal/Electric Skipping Control Strategy Applied to a Parallel Plug-in Hybrid Electric Vehicle. SAE International, 2022. http://dx.doi.org/10.4271/2022-01-0737.

Full text
Abstract:
In recent years automobile manufacturers focused on an increasing degree of electrification of the powertrains with the aim to reduce pollutants and CO2 emissions. Despite more complex design processes and control strategies, these powertrains offer improved fuel exploitation compared to conventional vehicles thanks to intelligent energy management. A simulation study is here presented aiming at developing a new control strategy for a P3 parallel plug-in hybrid electric vehicle. The simulation model is implemented using vehicle modeling and simulation toolboxes in MATLAB/Simulink. The proposed
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Computation loops' for particular source types:
Journal articles Dissertations / Theses Books
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