Academic literature on the topic 'Shortest cycle'

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 'Shortest cycle.'

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 "Shortest cycle"

1

Dumitrescu, Adrian. "On the shortest separating cycle." Computational Geometry 88 (June 2020): 101612. http://dx.doi.org/10.1016/j.comgeo.2020.101612.

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

Erickson, Jeff, and Pratik Worah. "Computing the Shortest Essential Cycle." Discrete & Computational Geometry 44, no. 4 (2010): 912–30. http://dx.doi.org/10.1007/s00454-010-9241-8.

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

Shu, Jinlong, and Cun-Quan Zhang. "A note about shortest cycle covers." Discrete Mathematics 301, no. 2-3 (2005): 232–38. http://dx.doi.org/10.1016/j.disc.2005.06.013.

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

Chickering, David M., Dan Geiger, and David Heckerman. "On finding a cycle basis with a shortest maximal cycle." Information Processing Letters 54, no. 1 (1995): 55–58. http://dx.doi.org/10.1016/0020-0190(94)00231-m.

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

Zheng, Mingming, Hongfeng Xu, Kun Zhang, and Ronghan Yao. "Shortest-Way: An Improved Empirical Transition Method for Signal Coordination." Journal of Advanced Transportation 2017 (2017): 1–12. http://dx.doi.org/10.1155/2017/7670521.

Full text
Abstract:
Four fundamental insights into transition methods are provided from the perspective of traffic engineers. An improved empirical transition method (i.e., Shortest-way) is developed with the goal of reducing the time spent on offset correction and the offset deviations of the coordinated phases during the transition period. Shortest-way operates stepwise and can be activated to correct offset at the scheduled time to switch plans. The maximum amount of adjustment that can be made to a transition cycle length is calculated based on the timing parameters of active phases in the old and new plans.
APA, Harvard, Vancouver, ISO, and other styles
6

Galbiati, Giulia. "On finding cycle bases and fundamental cycle bases with a shortest maximal cycle." Information Processing Letters 88, no. 4 (2003): 155–59. http://dx.doi.org/10.1016/j.ipl.2003.07.003.

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

Stetsyuk, Petro, Dumitru Solomon, and Maria Grygorak. "Problems on Shortest k-Node Cycles and Paths." Cybernetics and Computer Technologies, no. 3 (September 30, 2021): 15–33. http://dx.doi.org/10.34229/2707-451x.21.3.2.

Full text
Abstract:
The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph. Such cycles and paths are called k-node, where 1<k <n, n is the number of nodes in the graph. Section 1 formulates two problems for finding the shortest k-node cycle – a mixed Boolean and linear programming problem and a discrete programming problem. Both problems include constraints from the classical assignment problem, describing a one-time entry into a node and a one-time exit from a node for those nodes through
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Cun-Quan. "Parity Subgraph, Shortest Cycle Cover, and Postman Tour." SIAM Journal on Discrete Mathematics 6, no. 3 (1993): 428–31. http://dx.doi.org/10.1137/0406034.

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

Bespamyatnikh, Sergei, and Andrei Kelarev. "Algorithms for shortest paths and d-cycle problems." Journal of Discrete Algorithms 1, no. 1 (2003): 1–9. http://dx.doi.org/10.1016/s1570-8667(03)00002-9.

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

Hägglund, Jonas, and Klas Markström. "Shortest cycle covers and cycle double covers with large 2-regular subgraphs." Journal of Combinatorics 4, no. 4 (2013): 457–68. http://dx.doi.org/10.4310/joc.2013.v4.n4.a5.

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

Dissertations / Theses on the topic "Shortest cycle"

1

Haraldsson, Erik. "Combining unobtainable shortest path graphs for OSPF." Thesis, Linköping University, Department of Mathematics, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-12401.

Full text
Abstract:
<p>The well-known Dijkstra's algorithm uses weights to determine the shortest path. The focus here is instead on the opposite problem, does there exist weights for a certain set of shortest paths? OSPF (Open Shortest Path First) is one of several possible protocols that determines how routers will send data in a network like the internet. Network operators would however like to have some control of how the traffic is routed, and being able to determine the weights, which would lead to the desired shortest paths to be used, would be a help in this task.The first part of this thesis is a mathema
APA, Harvard, Vancouver, ISO, and other styles
2

Vorster, James Michael. "Cycle route network development and evaluation using spatial multi-criteria analysis and shortest path analysis." Master's thesis, Faculty of Engineering and the Built Environment, 2018. http://hdl.handle.net/11427/30136.

Full text
Abstract:
The current global trend of urbanisation has resulted in many cities today with growing transportation problems. Locally, South Africa is dealing with both urbanisation and spatial inequalities as a result of the apartheid era, with the poor very often located on the outskirts of urban areas, and therefore far from centres of employment and other amenities. Active mobility in the form of walking and cycling have been suggested as a means to address urban transport challenges, as it simultaneously promotes sustainability and improves the liveability of cities. Moreover, the infrastructural requ
APA, Harvard, Vancouver, ISO, and other styles
3

Planche, Léo. "Décomposition de graphes en plus courts chemins et en cycles de faible excentricité." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCB224.

Full text
Abstract:
En collaboration avec des chercheurs en biologie à Jussieu, nous étudions des graphes issus de données biologiques afin de d'en améliorer la compréhension. Ces graphes sont constitués à partir de fragments d'ADN, nommés reads. Chaque read correspond à un sommet, et deux sommets sont reliés si les deux séquences d'ADN correspondantes ont un taux de similarité suffisant. Ainsi se forme des graphes ayant une structure bien particulière que nous nommons hub-laminaire. Un graphe est dit hub-laminaire s'il peut être résumé en quelques plus courts chemins dont tous les sommets du graphe soient proche
APA, Harvard, Vancouver, ISO, and other styles
4

Shakeri, Heman. "Complex network analysis using modulus of families of walks." Diss., Kansas State University, 2017. http://hdl.handle.net/2097/35525.

Full text
Abstract:
Doctor of Philosophy<br>Department of Electrical and Computer Engineering<br>Pietro Poggi-Corradini<br>Caterina M. Scoglio<br>The modulus of a family of walks quanti es the richness of the family by favoring having many short walks over a few longer ones. In this dissertation, we investigate various families of walks to study new measures for quantifying network properties using modulus. The proposed new measures are compared to other known quantities. Our proposed method is based on walks on a network, and therefore will work in great generality. For instance, the networks we consider ca
APA, Harvard, Vancouver, ISO, and other styles
5

Tian, Lin. "Improved Shortest Path Algorithms by Dynamic Graph Decomposition." Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1196.

Full text
Abstract:
In this thesis, we introduce three new approaches for solving the single source shortest path (SSSP) problem in nearly acyclic directed graphs, and algorithms based on these approaches. In the first approach, we extend a technique of strongly connected components (sc-components) decomposition by Takaoka [23], and the generalized decomposition approach is called a higher-order decomposition. According to Takaoka's definition of acyclicity, the degree of cyclicity of a graph G, cyc(G), is defined by the maximum cardinality of the strongly connected components of G. Based on the higher-order deco
APA, Harvard, Vancouver, ISO, and other styles
6

Pepin, Michael P. (Michael Paul) 1961. "An investigation of the enablers and inhibitors to achieving a shorter cycle product development system." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/88827.

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

Chang, Chun-Ming M. Eng Massachusetts Institute of Technology. "Developing Highly Accelerated Life Test (HALT) method to improve product robustness and shorten development cycle." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/106687.

Full text
Abstract:
Thesis: M. Eng. in Advanced Manufacturing and Design, Massachusetts Institute of Technology, Department of Mechanical Engineering, 2016.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 80-81).<br>Highly Accelerated Life Testing (HALT) is often used to identify the latent defects for the printed circuit boards (PCBs) during the early stage of the product development process. The inconsistenc
APA, Harvard, Vancouver, ISO, and other styles
8

Hinkel-Lipsker, Jacob Wesley. "EFFECT OF WARM-UP ACTIVITY ON VERTICAL GROUND REACTION FORCES IN BASKETBALL PLAYERS DURING DROP JUMP LANDINGS." DigitalCommons@CalPoly, 2013. https://digitalcommons.calpoly.edu/theses/1088.

Full text
Abstract:
ABSTRACT Effect of Warm-Up Activity on Vertical Ground Reaction Forces in Basketball Players During Drop Jump Landings Jacob Hinkel-Lipsker Purpose: The purpose of this study was to examine the effect of certain warm-up activities on vertical ground reaction forces (GRFv) during a drop jump landing. Methods: Eight women and twelve men (mean age 22.6 ± 1.82 years) completed three warm-up activities on three separate days in a counterbalanced order: a passive stretching warm-up, a dynamic warm-up, and a no warm-up control. After completing each activity, participants were asked to perform eight
APA, Harvard, Vancouver, ISO, and other styles
9

Daniels, N. Caroline. "Bridging the gap : the use of information systems to shorten the design to manufacturing cycle in the clothing industry." Thesis, London Business School (University of London), 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.260878.

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

Xu, Zongying M. Eng Massachusetts Institute of Technology. "On-time delivery improvement at a semiconductor equipment manufacturing facility : developing robust work plan to improve resources utilization and shorten production cycle time/." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113729.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 119-120).<br>The boost of the need in semiconductor equipment has brought Varian, a giant in semiconductor manufacturer an increasing demand period. Unsatisfactory on-time delivery in the subassembly production in SMKT, however, has gradually be
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Shortest cycle"

1

Trinkfass, Gabriele. The innovation spiral: Launching new products in shorter time intervals. Deutscher Universitäts Verlag, 1997.

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

Casola, Linda, ed. Adapting to Shorter Time Cycles in the United States Air Force. National Academies Press, 2021. http://dx.doi.org/10.17226/26148.

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

Patty, Robert M. Lean operations for engineering, procurement, and construction: Shorten cycle time, eliminate error, improve quality, reduce costs. Universal Publishers, 2009.

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

Hanan, Mack. Successful market penetration: How to shorten the sales cycle by making the first sale the first time. American Management Association, 1987.

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

Sheer, Mark. Partnering: The referral recruiting process for financial wholesalers : double your "A" producers by providing value shorten the cycle to your success. Mark Sheer Seminars, 2002.

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

Patty, Robert M. Lean operations for front-end-loading, engineering, procurement, and construction: Lead innovation, shorten cycle time, eliminate error, improve quality, reduce costs. Universal Publishers, 2010.

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

Hutchings, Julian. Cycling Shorts and Cycle Clips. Independently Published, 2018.

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

Bever, Simon. Simon's Cycle Shorts: They Can Talk, You Know! Independently Published, 2017.

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

LOK, Johnny Ch. Strategies Shorten Time to Reach: Life Cycle Maturity Stage. Independently Published, 2020.

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

Trinkfass, Gabriele. Innovation Spiral: Launching New Products in Shorter Time Intervals. Deutscher Universitäts Verlag, 2013.

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

Book chapters on the topic "Shortest cycle"

1

Björklund, Andreas, and Thore Husfeldt. "Finding longer cycles via shortest colourful cycle." In 2025 Symposium on Simplicity in Algorithms (SOSA). Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978315.27.

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

Arkin, Esther M., Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, and Jiemin Zeng. "The Shortest Separating Cycle Problem." In Approximation and Online Algorithms. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51741-4_1.

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

Máčajová, Edita, and Martin Škoviera. "Long Shortest Cycle Covers in Cubic Graphs." In Trends in Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83823-2_71.

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

Call, Mikael, and Kaj Holmberg. "Inverse Shortest Path Models Based on Fundamental Cycle Bases." In Operations Research Proceedings. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29210-1_13.

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

Mullin, Redmond. "The fundraising cycle: the shortest book on fundraising, ever." In The Fundraising Reader. Routledge, 2023. http://dx.doi.org/10.4324/9781003145936-28.

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

Fomin, Fedor V., Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, and Giannos Stamoulis. "Shortest Cycles With Monotone Submodular Costs." In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977554.ch83.

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

Ma, Fu, and Chenfei Zhu. "Pursuing Mathematics Textbooks’ Education—Orientation Through Building Up Systematic Problems-Based Designs: An Overall Introduction to the Ideas of Developing Mathematics Textbooks for Grade 7-9 Published by Beijing Normal University Press." In Recent Advances in Mathematics Textbook Research and Development. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-8426-4_11.

Full text
Abstract:
AbstractTextbook development should be based on careful researches and will experience many iterated progressive revising cycles. After this time’s revising cycle, Mathematics Textbooks for Grade 7-9 Published by Beijing Normal University Press (shorted as “BNUM (7-9)” hereafter) are “education-oriented” and have systematic “problems-based” designs for the seek of possessing sufficient educational values. This paper firstly explains the conception of “education-oriented textbooks” and its main features. Then, it illustrates the idea about “problems-based designs” and why do those designs work.
APA, Harvard, Vancouver, ISO, and other styles
8

Trolin, Mårten. "The Shortest Vector Problem in Lattices with Many Cycles." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44670-2_14.

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

Shichkina, Yulia, Xuan-Hien Nguyen, Muon Ha, and Duc-Manh Tran. "Shortest Path Search Method on a Graph with Cycles." In Computational Science and Its Applications – ICCSA 2024 Workshops. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-65343-8_26.

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

Lincoln, Andrea, Virginia Vassilevska Williams, and Ryan Williams. "Tight Hardness for Shortest Cycles and Paths in Sparse Graphs." In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975031.80.

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

Conference papers on the topic "Shortest cycle"

1

Stetsyuk, Petro, Mykola Korablov, Oleksandr Stoian, and Oleh Hubernator. "Mathematical Models for Finding the Shortest Cycle to Visit a Given Number of Vertices from the Graph Clusters." In 2024 3rd International Conference on Problems of Logistics, Management and Operation in the East-West Transport Corridor (PLMO). IEEE, 2024. https://doi.org/10.1109/plmo62307.2024.10887171.

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

Naghizadeh, M., Y. Savguira, and M. Fatakdawala. "Life-Cycle Cost Evaluation of Corrosion Mitigation Strategies in the Mining Industry." In CONFERENCE 2022. AMPP, 2022. https://doi.org/10.5006/c2022-18146.

Full text
Abstract:
Abstract Corrosion-related challenges are usually addressed during the detailed engineering phase to meet the specified service life of the asset, but a comprehensive strategy to lower corrosion costs is rarely implemented. A life-cycle cost (LCC) analysis is often used to optimize the design and consider direct and indirect costs. The approach allows to quantify the capital and operating costs and costs associated with the failure of assets and potential implications associated with safety and environmental damage. The present paper explores the cost of corrosion in the mining industry and at
APA, Harvard, Vancouver, ISO, and other styles
3

Lua, Jim, Jinhui Yan, Ian Guay, Kalyan Shrestha, Anand Karuppiah, and Nam Phan. "High-Fidelity Digital Twin Autoclave Tool for Quality Informed Composite Fabrication." In Vertical Flight Society 80th Annual Forum & Technology Display. The Vertical Flight Society, 2024. http://dx.doi.org/10.4050/f-0080-2024-1139.

Full text
Abstract:
The Autoclave processing is commonly used in manufacturing high-performance fibre-reinforced thermoset composite components in the aerospace industry. Variations in the cure cycle, sometimes even apparently minor deviations from the prescribed cure cycle, can harm the laminate properties. Given the costly and time-consuming autoclave manufacturing process, there is a strong need to cure the maximum number of parts in the shortest possible time without compromising quality. In order to achieve high-rate automated manufacturing with the optimized autoclave process, it is important to construct a
APA, Harvard, Vancouver, ISO, and other styles
4

Björklund, Andreas, Thore Husfeldt, and Nina Taslaman. "Shortest Cycle Through Specified Elements." In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611973099.139.

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

Yih-Yi Lee and Chun-Chiej Hsiao. "Cross area lot arrangement — shortest inter cycle time." In 2007 International Symposium on Semiconductor Manufacturing. IEEE, 2007. http://dx.doi.org/10.1109/issm.2007.4446805.

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

Berridge, K., and J. Seitzer. "Extending the shortest-path swarm algorithm to cycle detection." In 48th Midwest Symposium on Circuits and Systems, 2005. IEEE, 2005. http://dx.doi.org/10.1109/mwscas.2005.1594255.

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

Yu, Wei, Yi Tao, and Hongxun Yao. "The shortest matching path based on novel cycle consistency." In 2017 IEEE International Conference on Image Processing (ICIP). IEEE, 2017. http://dx.doi.org/10.1109/icip.2017.8296627.

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

Lv Xu-guang and Zhu Da-ming. "An approximation algorithm for the shortest cycle in an undirected unweighted graph." In 2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering (CMCE 2010). IEEE, 2010. http://dx.doi.org/10.1109/cmce.2010.5610495.

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

Lam, K. P., Terrence S. T. Mak, and C. S. Poon. "Cycle avoidance in 2D/3D bidirectional graphs using shortest-path dynamic programming network." In 2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip (VLSI-SoC). IEEE, 2011. http://dx.doi.org/10.1109/vlsisoc.2011.6081607.

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

Tapia, Citlali, and Jamie E. Padgett. "Structural Upgrade Selection via Shortest-Path Algorithm Based on Life-Cycle Sustainability Metrics." In International Conference on Sustainable Development of Critical Infrastructure. American Society of Civil Engineers, 2014. http://dx.doi.org/10.1061/9780784413470.010.

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

Reports on the topic "Shortest cycle"

1

Hadjit, Rabah, Marc Brughmans, and Hirotaka Shiozaki. Application of Fast Body Optimization Procedures to Shorten Car Development Cycles. SAE International, 2005. http://dx.doi.org/10.4271/2005-08-0017.

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

Brossia. L52119 Comparative Consumption Rates of Impressed Current Cathodic Protection Anodes. Pipeline Research Council International, Inc. (PRCI), 2004. http://dx.doi.org/10.55274/r0010953.

Full text
Abstract:
There is a variety of impressed current anode materials available for onshore applications, including High Silicon Cast Iron (HSCI), Mixed Metal Oxides (MMO), graphite, platinum (or platinum coated titanium), and conductive polymers. Many end users simply select the anode material that they have experience with. What is lacking is a clear, direct comparison of relative anode consumption rates conducted under identical conditions. The present study examined the behavior of the various anode types under different current loads and soil conditions in an effort to establish baseline consumption ra
APA, Harvard, Vancouver, ISO, and other styles
3

Hill, Christian, and Kalle Heinola. IFRC Subcommittee on Atomic and Molecular Data for Fusion: Report on the Activities of the Atomic and Molecular Data Unit. International Atomic Energy Agency, 2022. http://dx.doi.org/10.61092/8whs-zyjw.

Full text
Abstract:
The 23rd meeting of the Subcommittee on Atomic and Molecular Data of the International Fusion Research Council (IFRC) was held from 16 – 17 May 2022 as a hybrid event, with seven members attending in-person and four participants using video-conferencing software. This follows two shorter, virtual meetings in 2020 and 2021. Activities of the Atomic and Molecular Data Unit for the period June 2021 – May 2022 were reviewed and recommendations were made for continuing activities in 2022 – 2023 and for new projects in the 2024 – 2025 budget cycle. The proceedings, conclusions and recommendations of
APA, Harvard, Vancouver, ISO, and other styles
4

Hill, C., and K. Heinola. IFRC Subcommittee on Atomic and Molecular Data for Fusion: Report on the Activities of the Atomic and Molecular Data Unit, June 2021 – May 2022. IAEA Nuclear Data Section, 2022. http://dx.doi.org/10.61092/iaea.wmqh-17vn.

Full text
Abstract:
The 23rd meeting of the Subcommittee on Atomic and Molecular Data of the International Fusion Research Council (IFRC) was held from 16 – 17 May 2022 as a hybrid event, with seven members attending in-person and four participants using video-conferencing software. This follows two shorter, virtual meetings in 2020 and 2021. Activities of the Atomic and Molecular Data Unit for the period June 2021 – May 2022 were reviewed and recommendations were made for continuing activities in 2022 – 2023 and for new projects in the 2024 – 2025 budget cycle. The proceedings, conclusions and recommendations of
APA, Harvard, Vancouver, ISO, and other styles
5

Gunchinsuren, Enkhtuvshin, Manfred Kiefer, and Christian Abeleda. Improving the Livelihood of Poultry Farmers in India through Contract Farming: How Effective? Asian Development Bank, 2023. http://dx.doi.org/10.22617/brf230540-2.

Full text
Abstract:
This brief explores how efficient private sector-led contract poultry farming—where a farmer produces exclusively for one contractor—can boost the livelihoods of small-scale Indian farmers and support sustainable rural development. Noting the rapid growth of India’s poultry sector, the brief looks at how contract farmers benefit from economies of scale, shorter poultry farming cycles, and higher labor and capital productivity. Drawing on data from farmers in Uttar Pradesh and Rajasthan, it analyzes the impact of the pandemic, looks at the barriers to working with a major producer, and shows ho
APA, Harvard, Vancouver, ISO, and other styles
6

Ruvinsky, Alicia, Timothy Garton, Daniel Chausse, Rajeev Agrawal, Harland Yu, and Ernest Miller. Accelerating the tactical decision process with High-Performance Computing (HPC) on the edge : motivation, framework, and use cases. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42169.

Full text
Abstract:
Managing the ever-growing volume and velocity of data across the battlefield is a critical problem for warfighters. Solving this problem will require a fundamental change in how battlefield analyses are performed. A new approach to making decisions on the battlefield will eliminate data transport delays by moving the analytical capabilities closer to data sources. Decision cycles depend on the speed at which data can be captured and converted to actionable information for decision making. Real-time situational awareness is achieved by locating computational assets at the tactical edge. Acceler
APA, Harvard, Vancouver, ISO, and other styles
7

Cohen, Yuval, Christopher A. Cullis, and Uri Lavi. Molecular Analyses of Soma-clonal Variation in Date Palm and Banana for Early Identification and Control of Off-types Generation. United States Department of Agriculture, 2010. http://dx.doi.org/10.32747/2010.7592124.bard.

Full text
Abstract:
Date palm (Phoenix dactylifera L.) is the major fruit tree grown in arid areas in the Middle East and North Africa. In the last century, dates were introduced to new regions including the USA. Date palms are traditionally propagated through offshoots. Expansion of modern date palm groves led to the development of Tissue Culture propagation methods that generate a large number of homogenous plants, have no seasonal effect on plant source and provide tools to fight the expansion of date pests and diseases. The disadvantage of this procedure is the occurrence of off-type trees which differ from t
APA, Harvard, Vancouver, ISO, and other styles
8

EXPERIMENTAL INVESTIGATION ON RESIDUAL STRESS DISTRIBUTION AND RELAXATION EFFECT AT DOUBLE-SIDE WELDED RIB-TO-DECK JOINTS OF ORTHOTROPIC STEEL DECKS. The Hong Kong Institute of Steel Construction, 2022. http://dx.doi.org/10.18057/icass2020.p.271.

Full text
Abstract:
The welding residual stresses (WRS) will shorten the fatigue resistance of rib-to-deck (RTD) joints of orthotropic steel decks (OSDs) in bridge engineering. It is essential to obtain WRS and its distribution to accurately assess the fatigue damage of RTD joints in OSDs subjected to vehicle loads. Initial WRS will release under cyclic loading, resulting in the redistribution of WRS in steel bridges. To estimate the relaxation of initial transverse WRS, experimental investigations on WRS distribution in initial state and its relaxation law under cyclic loading were conducted of the double-side w
APA, Harvard, Vancouver, ISO, and other styles
9

On the Behavior of the Start and Stop System in European Real Driving Emissions Tests and Its Effect on Greenhouse and Tailpipe Emissions. SAE International, 2022. http://dx.doi.org/10.4271/2022-01-5024.

Full text
Abstract:
The Start/Stop (S/S) system is a technology that switches off the engine without the intervention of the driver when the vehicle is stopped. The goal of this device is to eliminate the consumption of fuel associated with the idling of the engine and, consequently, save carbon dioxide (CO2) and pollutant emissions. However, its effectiveness is related to the percentage of the total driving time with the vehicle stopped. Moreover, even if the S/S system is installed and the vehicle is stopped, the S/S system can be inhibited by the condition of the vehicle like, for example, a too low state of
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!