Log in

Relevant bibliographies by topics / Shortest cycle

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Shortest cycle'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 June 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 '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

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

2

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

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

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

6

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. The problem of cycle length distribution is formulated as a nonlinear integer programming problem, aiming at minimizing the sum of the squares of the intersection offset deviations of all the transition cycles. The portion of the cycle length that can be allocated to each phase in a transition cycle is calculated based on its splits in the old and new plans and its potential contribution to the maximum amount of adjustment to the cycle length. The numerical experimental results proved the potential advantage of Shortest-way over CORSIM Shortway and justified the necessity for managing the time to switch plans at the intersection level.

APA, Harvard, Vancouver, ISO, and other styles

7

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

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

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

10

Hou, Xinmin, and Cun-Quan Zhang. "A note on shortest cycle covers of cubic graphs." Journal of Graph Theory 71, no. 2 (2011): 123–27. http://dx.doi.org/10.1002/jgt.20636.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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 mathematical explanation of the problem with a lot of examples to make it easier to understand. The focus here is on trying to combine several routing patterns into one, so that the result will be fewer, but more fully spanned, routing patterns, and it can e.g. be shown that there can't exist a common set of weights if two routing patterns can't be combined.The second part is a program that can be used to make several tests and changes to a set of routing patterns. It has a polynomial implementation of a function that can combine routing patterns. The examples that I used to combine routing patterns, showed that this will increase the likelihood of finding and significantly speed up the computation of a “valid cycle”.</p><br>Egentligen 30p/45hp, men det fanns inte som alternativ.

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 requirements for active mobility are far less when compared to motorised transportation, freeing up more land and funding for the development of community amenities. Cycling is an efficient way of travelling in urban areas over short to medium distances for a variety of trip purposes, including commuting to work or school, as a feeder to public transport services, to shops, for leisure trips, or tourism. The planning of cycle routes networks is, however, challenging as traditional methods are incapable of adequately dealing with the conflicting objectives of stakeholders and multiple spatial criteria used to measure these. Moreover, the route qualities desired by cyclists are rarely included in the design of routes. Instead a pre- or post-evaluation of route alternatives against the aforementioned route qualities is performed, which once again is not adequately addressed in the current methods given the conflicting objectives and multiple criteria noted earlier. Traditional processes are also criticised for not being open and transparent, leaving many stakeholders dissatisfied. To address these concerns, the proposed method takes advantage of the powerful set of tools for the manipulation and analysis of spatial information provided by Geographical Information Systems (GIS), and the techniques available in Multi-Criteria Analysis (MCA) for structuring decision problems, and designing, evaluating and prioritising alternatives. This combination, known as Spatial Multi-Criteria Analysis (SMCA), can be thought of as a process that transforms and combines geographical data and the value judgements of stakeholders to obtain information for decision making. The advantages gained from combining GIS and MCA results in the development of an effective Spatial Decision Support System (SDSS). In addition to developing and evaluating a network of cycle routes, the proposed method provides an additional means of prioritising infrastructural requirements using a metric known as Cycle Route Directness (CRD). This compares the network route distance to the Euclidean distance and where the threshold value is exceeded, it can be argued that additional cycle infrastructure is required to reduce the detour by bringing the CRD to below the threshold value. The study uses SMCA to develop a network of optimal routes, which focuses around the needs of cyclists while taking account of other stakeholder requirements, for a defined area in the metropolitan of Port Elizabeth in South Africa. The relatively flat terrain, temperate climate and proximity of poorer income areas to more affluent areas and places of employment made this an ideal area to act as a proof of concept for the proposed method. The case study showcases the method’s ability to act as a SDSS for cycle route network planning at a strategic level.

APA, Harvard, Vancouver, ISO, and other styles

3

Planche, Lé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. Nous étudions en détail le cas où le graphe est composé d'un unique plus court chemin d'excentricité faible, ce problème a été initialement défini par Dragan 2017. Nous améliorons la preuve d'un algorithme d'approximation déjà existant et en proposons un nouveau, effectuant une 3-approximation en temps linéaire. De plus, nous analysons le lien avec le problème de k-laminarité défini par Habib 2016, ce dernier consistant en la recherche d'un diamètre de faible excentricité. Nous étudions ensuite le problème du cycle isométrique de plus faible excentricité. Nous montrons que ce problème est NP-complet et proposons deux algorithmes d'approximations. Nous définissons ensuite précisément la structure "hub-laminaire" et présentons un algorithme d'approximation en temps O(nm). Nous confrontons cet algorithme à des graphes générés par une procédure aléatoire et l'appliquons à nos données biologiques. Pour finir nous montrons que le calcul du cycle isométrique d'excentricité minimale permet le plongement d'un graphe dans un cercle avec une distorsion multiplicative faible. Le calcul d'une décomposition hub-laminaire permet quant à lui une représentation compacte des distances avec une distorsion additive bornée<br>In collaboration with reserchears in biology at Université Pierre et Marie Curie, we study graphs coming from biological data in order to improve our understanding of it. Those graphs come from DNA fragments, named reads. Each read is a vertex and two vertices are linked if the DNA sequences are similar enough. Such graphs have a particuliar structure that we name hub-laminar. A graph is said to be hub-laminar if it may be represented as a (small) set of shortest paths such that every vertex of the graph is close to one of those paths. We first study the case where the graph is composed of an unique shortest path of low eccentricity. This problem was first definied by Dragan 2017. We improve the proof of an approximation algorithm already existing and propose a new one, a 3-approximation running in linear time. Furthermore we show its link with the k-laminar problem defined by Habib 2016, consisting in finding a diameter of low eccentricity. We then define and study the problem of the isometric cycle of minimal eccentricity. We show that this problem is NP-complete and propose two approximation algorithms. We then properly define what is an hub-laminar decomposition and we show an approximation algorithm running in O(nm). We test this algorithm with randomly generated graphs and apply it to our biolgical data. Finaly we show that computing an isometric cycle of low eccentricity allows to embed a graph into a cycle with a low multiplicative distortion. Computing an hub-laminar decomposition allows a compact representation of distances with a low additive distortion

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 can be directed, multi-edged, weighted, and even contain disconnected parts. We study the popular centrality measure known in some circles as information centrality, also known as e ective conductance centrality. After reinterpreting this measure in terms of modulus of families of walks, we introduce a modi cation called shell modulus centrality, that relies on the egocentric structure of the graph. Ego networks are networks formed around egos with a speci c order of neighborhoods. We then propose e cient analytical and approximate methods for computing these measures on both directed and undirected networks. Finally, we describe a simple method inspired by shell modulus centrality, called general degree, which improves simple degree centrality and could prove to be a useful tool for practitioners in the applied sciences. General degree is useful for detecting the best set of nodes for immunization. We also study the structure of loops in networks using the notion of modulus of loop families. We introduce a new measure of network clustering by quantifying the richness of families of (simple) loops. Modulus tries to minimize the expected overlap among loops by spreading the expected link-usage optimally. We propose weighting networks using these expected link-usages to improve classical community detection algorithms. We show that the proposed method enhances the performance of certain algorithms, such as spectral partitioning and modularity maximization heuristics, on standard benchmarks. Computing loop modulus bene ts from e cient algorithms for nding shortest loops, thus we propose a deterministic combinatorial algorithm that nds a shortest cycle in graphs. The proposed algorithm reduces the worst case time complexity of the existing combinatorial algorithms to O(nm) or O(hkin2 log n) while visiting at most m - n + 1 cycles (size of cycle basis). For most empirical networks with average degree in O(n1􀀀 ) our algorithm is subcubic.

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 decomposition, we give a generalization of Takaoka's definition of acyclicity. That is, the degree of cyclicity cych(G) is the maximum cardinality of the hth order strongly connected components of G, where h is the number of times that the graph has been decomposed. Then, the original definition introduced by Takaoka [23] can be presented as: The degree of cyclicity cyc(G) is the maximum cardinality of the 1th order strongly connected components of G. The second approach presents a new method for measuring acyclicity based on modifications to two existing methods. In the new method, we decompose the given graph into a 1-dominator set, which is a set of acyclic subgraphs, where each sub-graph is dominated by one trigger vertex. Meanwhile we compute sc-components of a degenerated graph derived from triggers. Using this preprocessing, we can efficiently compute the single source shortest paths (SSSPs) for nearly acyclic graphs in O(m + r logl ) time, where r is the size of the 1-dominator set, and l is the size of the largest sc-component. In the third approach, we modify the concept of a 1-dominator set to that of a 1-2-dominator set, and achieve O(m + r²) time to compute a 1- 2-dominator set in a graph. Each of acyclic sub-graphs obtained by the 1-2-dominator set are dominated by one or two trigger vertices cooperatively. Such sub-graphs are potentially larger than those decomposed by the 1-dominator set. Thus fewer trigger vertices are needed to cover the graph, that is, rʹ ≤ r, where rʹ is the number of triggers in the 1-2-dominator set. When rʹ is much smaller than r, we can efficiently compute SSSPs in O(m + rʹlogrʹ) time.

APA, Harvard, Vancouver, ISO, and other styles

6

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 inconsistency in executing HALT may not reveal the maximum amount of design weaknesses or intermittent failures, which would eventually lead to the premature product failure in the field and incur additional warranty expenses. The scope of this project has focused on establishing the standardized operating procedure (SOP) for Highly Accelerated Life Testing (HALT) using the DMAIC methodology for the electronic components such as printed circuit boards (PCBs) to help identify these latent issues in advance and increase product robustness. In addition to applying statistical tools to optimize several key process parameters such as soaking time and ramp rate, the related failure analysis and corrective actions were also demonstrated in this thesis. In summary, three major results are shown: first, following the DMAIC guideline, the standard operating procedure (SOP) of HALT was established and applicable to all types of printed circuit boards. Secondly, it was shown that the top three failure modes identified in HALT were almost identical to that of the field returns'. Last but not least, the relationship between the operating margins and the warranty replacement rate was also established. Although more data points are required to further consolidate the model, the current result has indicated that there is a declining trend of the warranty replacement rate for every increment of the temperature operating margins. Such mathematical relationship was then used in the economic model to justify the business benefit of HALT.<br>by Chun-Ming Chang.<br>M. Eng. in Advanced Manufacturing and Design

APA, Harvard, Vancouver, ISO, and other styles

7

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

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 drop jump landings on a force platform. GRFv data was sampled at 1000 Hz during each landing, and the variables analyzed were: peak forefoot and rearfoot magnitude, forefoot and rearfoot rate of loading, and impulse. Results: The dynamic warm-up had significantly greater values (p < 0.05) for forefoot peak magnitude, rearfoot peak magnitude, and forefoot rate of loading compared to the passive stretching and control conditions. Also, there were no significant differences among all activities for rearfoot rate of loading and impulse. Conclusions: The significantly greater values for forefoot peak magnitude, rearfoot peak magnitude, and forefoot rate of loading that the dynamic warm-up produced indicates that this activity may be effective in increasing muscular stiffness in the lower limbs. The failure of the passive stretching warm-up to reach significance indicates that this activity may not be effective in decreasing lower extremity muscular stiffness.

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 become a critical issue that prevents the production from operating smoothly and efficiently as well as resulting in significant amount of extra financial costs. While the SMKT ontime delivery is generally improved from the two aspects, the material shortage issue and the capacity and priority issue, the second approach was focused, analyzed and well resolved in this thesis. Capacity analysis indicates that more manpower is needed to fulfill the production demand, and an analysis tool based on Excel was created to help with capacity management and planning in a long term. A series of matching algorithms was designed to solve the prioritization issue by providing efficient work plans that direct the production in SMKT assembly process, improving the SMKT on-time delivery by 10-20% and shortening the shop order cycle time in assembly process by one day. Moreover, recommendations on data utilization, capacity management and resources management in SMKT are provided accordingly to optimize the SMKT production to be more proficient and well-organized, which will greatly benefit Varian in the long term. The implementation of this algorithm generates no financial cost except for increasing the assembler's capacity, which indicates that all solutions provided in this thesis are economic and effective at the same time.<br>by Zongying Xu.<br>M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

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

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

6

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

7

Barrett, Richard. Cycle Touring in Wales: A Two-Week Tour of Wales and Shorter Routes. Cicerone Press, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sammons, Benjamin. Aristeia. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190614843.003.0006.

Full text

Abstract:

This chapter discusses use of the epic aristeia as a narrative element in Homer and the Cycle. At least four secure examples of aristeiai in the Cycle reveal a simpler structure than examples from Homer’s Iliad. This “cyclic” form of the aristeia typically features as champion a Trojan ally who eventually falls at the hands of a foremost Achaean warrior. Differences between cyclic and Iliadic aristeia-sequences reflect the persons and themes involved, but also bear an intimate relationship to the different narrative requirements of shorter poems. I argue further that the simpler cyclic form of the aristeia can be seen to underlie the more complicated and varied Homeric examples.

APA, Harvard, Vancouver, ISO, and other styles

9

Sammons, Benjamin. Device and Composition in the Greek Epic Cycle. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190614843.001.0001.

Full text

Abstract:

From a corpus of Greek epics known in antiquity as the “Epic Cycle,” six poems dealt with the same Trojan War mythology as the Homeric poems. Though they are now lost, these poems were much read and much discussed in ancient times, not only for their content but for their mysterious relationship with the more famous works attributed to Homer. This study shows that these lost poems belonged, compositionally, to essentially the same tradition as the Homeric poems. It demonstrates that various compositional devices well-known from the Homeric epics were also fundamental to the narrative construction of these later works. Yet while the “cyclic” poets constructed their works using the same traditional devices as Homer, they used these to different ends and with different results. The essential difference between cyclic and Homeric epics lies not in the fundamental building blocks from which they are constructed, but in the scale of these components relative to the overall construction of poems. This sheds important light on the early history of epic as a genre, since it is likely that these devices originally developed to provide large-scale structure to shorter poems and have been put to quite different use in the composition of the monumental Homeric epics. This study includes many new suggestions about the overall form of lost cyclic epics and about the meaning and context of the few surviving verse fragments.

APA, Harvard, Vancouver, ISO, and other styles

10

Hanan, Mark. Successful Market Penetration: How to Shorten the Sales Cycle by Making the First Sale the First Time. AMACOM/American Management Association, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Shortest cycle"

1

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

2

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

3

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

4

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

5

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

6

de Verdière, Éric Colin, and Francis Lazarus. "Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface." In Graph Drawing. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24595-7_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Thorup, Mikkel. "Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles." In Algorithm Theory - SWAT 2004. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27810-8_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Herscovici, Armand. "Widening Numerical Intensive Computing (NIC) Perspective — Shorten the Development Cycle." In Automotive Simulation ’91. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-84586-4_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cabello, Sergio, and Bojan Mohar. "Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs." In Algorithms – ESA 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11561071_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Łącki, Jakub, and Piotr Sankowski. "Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time." In Algorithms – ESA 2011. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23719-5_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Shortest cycle"

1

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

2

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

3

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

4

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

5

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

6

Dutta, Debarshi, Meher Chaitanya, Kishore Kothapalli, and Debajyoti Bera. "Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems." In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2017. http://dx.doi.org/10.1109/ipdpsw.2017.78.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

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

9

Ebrahim-Zadeh, M. "Optical Parametric Oscillators: Towards Longest Mid-IR Wavelengths and Shortest Few-Cycle Pulses." In Nonlinear Optics. OSA, 2015. http://dx.doi.org/10.1364/nlo.2015.ntu1b.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Panzarella, Charles H., Edrissa Gassama, and Daniel Spring. "Probabilistic Financial Analysis of Coke Drum Life Cycle Management." In ASME 2016 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/pvp2016-63670.

Full text

Abstract:

The cycle time, and, in particular, the duration of the quenching phase, is known to play an important role in the rate of damage accumulation in a coke drum. A shorter cycle is desirable because it allows for increased production but this comes at the cost of more frequent repairs and a shorter overall life. Therefore, a trade-off decision needs to be made in order to balance these two effects and maximize profitability. This paper provides guidance for making these sorts of decisions by looking at several different coke drum operating strategies from the perspective of a high level financial analysis, taking into account many cost/benefit factors in order to determine the optimal strategy that maximizes profitability with various levels of confidence. It is shown that the most critical factor is predicting the rate of repairs as the drum ages. This depends on many factors and can only be determined probabilistically due to the many uncertainties involved. One of the most important factors driving the repair rate is the frequency at which fatigue cracks initiate and grow. A probabilistic fatigue model is used to describe this, taking into account the large surface area of the coke drum, which provides more potential nucleation sites for fatigue crack initiation. It is shown that there is, indeed, an optimal, intermediate cycle time for certain conditions. For other situations running with the shortest possible cycle time is shown to be the best choice.

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

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!