Log in

Relevant bibliographies by topics / Shortest cycle / Journal articles

To see the other types of publications on this topic, follow the link: Shortest cycle.

Journal articles on the topic 'Shortest cycle'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Xu, Mei. "Cycle Bases Structure of out Planar Graphs on the Projective Plane in Mechanics Engineering." Applied Mechanics and Materials 312 (February 2013): 745–48. http://dx.doi.org/10.4028/www.scientific.net/amm.312.745.

Full text

Abstract:

In this paper we investigate the cycle base structure of 2-connected graphs on the projective plane and show the minimum cycle bases of 2-connected outer planar graph G in the case of ew (G) 5. Then give a proof about the one-one property between the minimum cycle bases and the shortest no contractible cycles.

APA, Harvard, Vancouver, ISO, and other styles

12

Yuster, Raphael. "A shortest cycle for each vertex of a graph." Information Processing Letters 111, no. 21-22 (2011): 1057–61. http://dx.doi.org/10.1016/j.ipl.2011.07.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

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

14

Zhao, Cheng. "Smallest (1, 2)-eulerian weight and shortest cycle covering." Journal of Graph Theory 18, no. 2 (1994): 153–60. http://dx.doi.org/10.1002/jgt.3190180206.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Chudnovsky, Maria, Alex Scott, and Paul Seymour. "Finding a Shortest Odd Hole." ACM Transactions on Algorithms 17, no. 2 (2021): 1–21. http://dx.doi.org/10.1145/3447869.

Full text

Abstract:

An odd hole in a graph is an induced cycle with odd length greater than 3. In an earlier paper (with Sophie Spirkl), solving a longstanding open problem, we gave a polynomial-time algorithm to test if a graph has an odd hole. We subsequently showed that, for every t , there is a polynomial-time algorithm to test whether a graph contains an odd hole of length at least t . In this article, we give an algorithm that finds a shortest odd hole, if one exists.

APA, Harvard, Vancouver, ISO, and other styles

16

Stetsyuk, P. I. "Problem Statements for k-Node Shortest Path and k-Node Shortest Cycle in a Complete Graph*." Cybernetics and Systems Analysis 52, no. 1 (2016): 71–75. http://dx.doi.org/10.1007/s10559-016-9801-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Chao, Fugang, Han Ren, and Ni Cao. "Finding a shortest cycle in a subspace of the cycle space of a graph." Applied Mathematics and Computation 268 (October 2015): 393–98. http://dx.doi.org/10.1016/j.amc.2015.06.053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Anugrah Susilaningrum, Anastasia, Uci Ciptiasrini, and Madinah Munawaroh. "Penggunaan Kontrasepsi terhadap Gangguan Siklus Menstruasi di BPM A." Jurnal Interprofesi Kesehatan Indonesia 1, no. 02 (2022): 53–64. http://dx.doi.org/10.53801/jipki.v1i02.5.

Full text

Abstract:

Introduction: Indonesia, with a very large population, is committed to implementing the Planning Family and Birth Control as a means of fulfilling international demands in improving the lives of mothers and children. One of the problems with the family planning program is menstrual disorders due to the use of hormonal contraceptives such as a one-month injection and three months of injection contraception, which often become complaints from family planning acceptors. Objectives: The purpose of this study was to determine the difference in the shortest and longest cycle length between the two t

APA, Harvard, Vancouver, ISO, and other styles

19

Panggabean, Erwin, Desi Vinsensia, Wanra Tarigan, Logaraj Logaraj, and Tiara W. Pratiwi. "COMPARISON OF DJIKSTRA ALGORITHM AND SPANNING CYCLE DETERMINING SHORTEST PATH." JURTEKSI (Jurnal Teknologi dan Sistem Informasi) 8, no. 3 (2022): 305–12. http://dx.doi.org/10.33330/jurteksi.v8i3.1700.

Full text

Abstract:

Abstract: Problems that often occur in people with the growth and development of urban areas that change very quickly cause the movement of people or road users to become chaotic as in the Municipality of Medan. People in carrying out their daily activities are directly influenced by irregular patterns of human movement, in this case what is meant is an increase in congestion, delays, and others. Therefore we need a system that can make it easier for humans to use road facilities, namely a geographic information system to determine the shortest path using the djikstra method and spanning cycle

APA, Harvard, Vancouver, ISO, and other styles

20

Mittag, M., J. H. M. M. Schmitt, A. Hempelmann, and K. P. Schröder. "Discovery of short-term activity cycles in F-type stars." Astronomy & Astrophysics 621 (January 2019): A136. http://dx.doi.org/10.1051/0004-6361/201834319.

Full text

Abstract:

Previous studies have revealed a 120 day activity cycle in the F-type star τ Boo, which represents the shortest activity cycle discovered until now. The question arises as to whether or not short-term activity cycles are a common phenomenon in F-type stars. To address this question, we analyse S-index time series of F-type stars taken with the TIGRE telescope to search for periodic variations with a maximal length of 2 years using the generalised Lomb-Scargle periodogram method. In our sample, we find four F-type stars showing periodic variations shorter than one year. However, the amplitude o

APA, Harvard, Vancouver, ISO, and other styles

21

Orlin, James B., K. Subramani, and Piotr Wojciechowki. "Randomized algorithms for finding the shortest negative cost cycle in networks." Discrete Applied Mathematics 236 (February 2018): 387–94. http://dx.doi.org/10.1016/j.dam.2017.10.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Anderson, Matthew, Matthew Williamson, and K. Subramani. "Empirical analysis of algorithms for the shortest negative cost cycle problem." Discrete Applied Mathematics 253 (January 2019): 167–84. http://dx.doi.org/10.1016/j.dam.2018.03.055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Prabha, S. Krishna, M. Clement Joe Anand, V. Vidhya, et al. "Sorting Out Interval Valued Neutrosophic Fuzzy Shortest Cycle Route Problem by Reduced Matrix Method." International Journal of Neutrosophic Science 23, no. 2 (2024): 91–103. http://dx.doi.org/10.54216/ijns.230208.

Full text

Abstract:

The assertiveness theory next addresses the difficulties of the travelling salesman after discussing the problem with transportation and assignment. The Shortest Cycling Route Problem (SCRP) finds the shortest route that stops in each city exactly once using a preset set of cities and their bilateral distances. The arc lengths in TSO are typically seen as representing travel time or travel expenses rather than actual distance. The precise arc length cannot be predicted because cargo, climate, road conditions, and other factors also can affect the journey time or cost. For handling the unpredic

APA, Harvard, Vancouver, ISO, and other styles

24

Wong, A., P. Boutis, and S. Hekimi. "Mutations in the clk-1 gene of Caenorhabditis elegans affect developmental and behavioral timing." Genetics 139, no. 3 (1995): 1247–59. http://dx.doi.org/10.1093/genetics/139.3.1247.

Full text

Abstract:

Abstract We have identified three allelic, maternal-effect mutations that affect developmental and behavioral timing in Caenorhabditis elegans. They result in a mean lengthening of embryonic and postembryonic development, the cell cycle period and life span, as well as the periods of the defecation, swimming and pumping cycles. These mutants also display a number of additional phenotypes related to timing. For example, the variability in the length of embryonic development is several times larger in the mutants than in the wild type, resulting in the occasional production of mutant embryos dev

APA, Harvard, Vancouver, ISO, and other styles

25

Sharma, Anant, Nupur Deshpande, Sanchita Ghosh, Sreetama Das, and Shibdas Roy. "An Efficient Quantum Algorithm for the Traveling Salesman Problem." Quantum Information & Computation 25, no. 1 (2025): 71–81. https://doi.org/10.2478/qic-2025-0004.

Full text

Abstract:

Abstract The traveling salesman problem is the problem of finding out the shortest route in a network of cities, that a salesman needs to travel to cover all the cities, without visiting the same city more than once. This problem is known to be N P -hard with a brute-force complexity of O(N N ) or O(N 2N ) for N number of cities. This problem is equivalent to finding out the shortest Hamiltonian cycle in a given graph, if at least one Hamiltonian cycle exists in it. Quantum algorithms for this problem typically provide with a quadratic speedup only, using Grover’s search, thereby having a comp

APA, Harvard, Vancouver, ISO, and other styles

26

Homobono, Nathalie, and Claudine Peyrat. "Graphs such that every two edges are contained in a shortest cycle." Discrete Mathematics 76, no. 1 (1989): 37–44. http://dx.doi.org/10.1016/0012-365x(89)90285-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Irnich, Stefan, and Daniel Villeneuve. "The Shortest-Path Problem with Resource Constraints andk-Cycle Elimination fork≥ 3." INFORMS Journal on Computing 18, no. 3 (2006): 391–406. http://dx.doi.org/10.1287/ijoc.1040.0117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Volgenant, A., R. Jonker, and G. A. P. Kindervater. "A note on finding a shortest complete cycle in an undirected graph." European Journal of Operational Research 23, no. 1 (1986): 82–85. http://dx.doi.org/10.1016/0377-2217(86)90217-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Hazizah, Salsabillah, Riri Syafitri Lubis, and Hendra Cipta. "Ant Colony Optimization Algorithm for Traveling Salesman Problem in Distributing Fertilizer." Mathline : Jurnal Matematika dan Pendidikan Matematika 8, no. 2 (2023): 345–58. http://dx.doi.org/10.31943/mathline.v8i2.388.

Full text

Abstract:

Fertilization sometimes takes a long time due to the selection of mileage traveled in fertilizer distribution and coupled with the condition of plantation roads that are partially damaged. The path taken is usually only a path that is memorized and is considered the shortest and optimal. The journey from one location to another by considering the shortest path is included in the problem of graph theory. To determine the shortest path to be traversed, you can use the Ant Colony algorithm, because it is optimal in determining short distances and can measure the minimum accumulated travel time cl

APA, Harvard, Vancouver, ISO, and other styles

30

Duston, J., and R. L. Saunders. "Effect of 6-, 12-, and 18-month Photoperiod Cycles on Smolting and Sexual Maturation in Juvenile Atlantic Salmon (Salmo salar)." Canadian Journal of Fisheries and Aquatic Sciences 49, no. 11 (1992): 2273–80. http://dx.doi.org/10.1139/f92-249.

Full text

Abstract:

The results support the hypothesis that the commencement of smolting can occur during the decreasing phase of the annual photoperiod cycle, and sexual maturation during the increasing phase of the cycle, provided individuals have attained certain (unknown) growth thresholds. Thereafter the completion of smolting is entrained by the increasing phase of the photoperiod cycle, and sexual maturation by the decreasing phase. Three groups of Atlantic salmon (Salmo salar) were raised in freshwater for over 2 yr from the eyed egg stage under photoperiod cycles of either 6-, 12- (control), or 18-mo per

APA, Harvard, Vancouver, ISO, and other styles

31

Dutta, Debarshi, Meher Chaitanya, Kishore Kothapalli, and Debajyoti Bera. "Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems." International Journal of Networking and Computing 8, no. 1 (2018): 73–92. http://dx.doi.org/10.15803/ijnc.8.1_73.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Horton, J. D. "A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph." SIAM Journal on Computing 16, no. 2 (1987): 358–66. http://dx.doi.org/10.1137/0216026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Li, Danyang, Lepu Zhang, and Xiaochun Wang. "The Effect of Menstrual Cycle Phases on Approach–Avoidance Behaviors in Women: Evidence from Conscious and Unconscious Processes." Brain Sciences 12, no. 10 (2022): 1417. http://dx.doi.org/10.3390/brainsci12101417.

Full text

Abstract:

The menstrual cycle affects women’s emotional states, with estrogen and progesterone having predominant roles. However, it remains unclear whether the phases of the menstrual cycle also affect women’s motivational behaviors. In this study, the main aim was to investigate how the menstrual cycle influences approach–avoidance behavior under conditions of conscious versus unconscious processing of emotions. Briefly, after recruitment by advertisement and screening with a menstrual cycle survey questionnaire, 27 naturally cycling, healthy women participated in an improved “manikin task” and were p

APA, Harvard, Vancouver, ISO, and other styles

34

Hasan Najm, Shahad, and Mustafa Rasheed Majeed Alqaisi. "Investigated of the Hydrogen peroxide's efficacy in sterilizing various substrates for the formation of the oyster mushroom Pleurotus sapidus." Bionatura 7, no. 2 (2022): 1–6. http://dx.doi.org/10.21931/rb/2022.07.02.45.

Full text

Abstract:

This study was conducted in order to test some agricultural wastes from fruits and sterilization method in the production of oyster mushroom Pleurotus sapidus. This study included two factors, the first is the type of substrate which consisting of seven combinations: A0 (wheat straw 80% + flour bran 20%), A1 (pomegranate peel 25% + wheat straw 75%), A2 (pomegranate peel 50% + wheat straw 50%), A3 (pomegranate peel 75% + wheat straw 25%), A4 (date fruit residues 25% + wheat straw 75%), A5 (date fruit residues 50% + wheat straw 50%), A6 (date fruit residues 75% + straw wheat 25%). The second fac

APA, Harvard, Vancouver, ISO, and other styles

35

Fujii, Tomoyuki, Muhamad Safwan Bin Muhamad Azmi, Keiichiro Tohgo, and Yoshinobu Shimamura. "Influence of Strain Gradient on Fatigue Life of Carbon Steel for Pressure Vessels in Low-Cycle and High-Cycle Fatigue Regimes." Materials 15, no. 2 (2022): 445. http://dx.doi.org/10.3390/ma15020445.

Full text

Abstract:

This paper discusses how the strain gradient influences the fatigue life of carbon steel in the low-cycle and high-cycle fatigue regimes. To obtain fatigue data under different strain distributions, cyclic alternating bending tests using specimens with different thicknesses and cyclic tension–compression tests were conducted on carbon steel for pressure vessels (SPV235). The crack initiation life and total failure life were evaluated via the strain-based approach. The experimental results showed that the crack initiation life became short with decreasing strain gradient from 102 to 106 cycles

APA, Harvard, Vancouver, ISO, and other styles

36

Adi, Novi Hendri, Muhammad Giatman, Wakhinuddin Simatupang, Afrina Afrina, and Ronal Watrianthos. "Penerapan Metode Dijkstra Pada Jalur Distribusi LPG Untuk Penentuan Jarak Terpendek." Building of Informatics, Technology and Science (BITS) 3, no. 3 (2021): 235–43. http://dx.doi.org/10.47065/bits.v3i3.1052.

Full text

Abstract:

Determining a shortest path is a crucial and necessary thing in connection with optimizing the time used and some savings in other fields. This research aims to design a software for determining the shortest distance on a web-based LPG gas distribution line by applying the Dijkstra solving procedure at PT. Amartha Anugrah Mandiri. This study uses the SDLC (software development life cycle) development method using waterfall modeling, to determine the closest route during the distribution of LPG gas using the Dijkstra solution procedure, namely by determining which location is used as the initia

APA, Harvard, Vancouver, ISO, and other styles

37

K., John Bosco, and J. Prathisa S. K. Sathija. "D^DM- DISTANCE IN CYCLE RELATED GRAPHS." INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH 11, no. 07 (2023): 3583–85. https://doi.org/10.5281/zenodo.8186590.

Full text

Abstract:

For two vertices u and v of a graph G, the usual distance d (u, v), is the length of the shortest path between u and v. In this paper we introduced the concept of D<sup>dM</sup>- distance by considering the degrees of various vertices presented in the path, in addition to the length of the path. We study some properties with this new distance. We define the eccentricities of vertices, radius and diameter of G with respect to the D<sup>dM</sup>- distance. First we prove that the new distance is a metric on the set of vertices of G. We compare the usual, detour  and D<sup>dM</sup>-distances

APA, Harvard, Vancouver, ISO, and other styles

38

Prokopenkov, Vladymyr. "POLYNOMIAL ALGORITHM FOR FINDING A HAMILTONIAN CYCLE ON A GRAPH." Bulletin of NTU "KhPI". Series: Strategic management, portfolio, program and project management, no. 1(3) (April 17, 2021): 55–65. http://dx.doi.org/10.20998/2413-3000.2021.3.8.

Full text

Abstract:

The subject of research is the solution of the problem of finding a Hamiltonian cycle on a graph, which in discrete mathematics belongs to the NP complexity class and still retains interest. The aim of this work is to develop a new algorithm for solving this problem, which guarantees finding the optimal solution with polynomial time. In [1], an analysis of the current state of the problem was performed, the shortcomings of existing methods of solving were noted, and new principles and method of finding solution were presented. Known methods for solving the problem are based on the implementati

APA, Harvard, Vancouver, ISO, and other styles

39

Cao, Huanyu, Ang Gao, Haotian Zheng, and Yueheng Lan. "Wielding intermittency with cycle expansions." Chaos: An Interdisciplinary Journal of Nonlinear Science 32, no. 8 (2022): 083115. http://dx.doi.org/10.1063/5.0087463.

Full text

Abstract:

As periodic orbit theory works badly on computing the observable averages of dynamical systems with intermittency, we propose a scheme to cooperate with cycle expansion and perturbation theory so that we can deal with intermittent systems and compute the averages more precisely. The periodic orbit theory assumes that the shortest unstable periodic orbits build the framework of the system and provide cycle expansion to compute dynamical quantities based on them, while the perturbation theory can locally analyze the structure of dynamical systems. The dynamical averages may be obtained more prec

APA, Harvard, Vancouver, ISO, and other styles

40

Solomon, H. D. "The Influence of the Cycle Frequency and Wave Shape on the Fatigue Life of Leaded Chip Carrier Printed Wiring Board Interconnections." Journal of Electronic Packaging 115, no. 2 (1993): 173–79. http://dx.doi.org/10.1115/1.2909314.

Full text

Abstract:

This study employed different cycle frequencies, to determine the influence of cycle frequency on the fatigue life of leaded chip carrier printed wiring board (LCC/PWB) interconnections. Real LCC/PWB interconnections were mechanically cycled at 35°C or 125°C. The cycle frequency was varied by varying the ramp loading and unloading rates or by introducing hold times. Tests were run with equal hold times at the maximum and minimum displacements or only at the maximum displacement. The use of slower ramp cycling or the introduction in the hold times increased the plastic displacement and this dec

APA, Harvard, Vancouver, ISO, and other styles

41

Zhang, Dao De, Yu Rong Pan, Xin Yu Hu, Guang You Yang, and Cheng Xu. "The Median Filtering Algorithm’s Fast Implementation in FPGA." Advanced Materials Research 230-232 (May 2011): 1054–57. http://dx.doi.org/10.4028/www.scientific.net/amr.230-232.1054.

Full text

Abstract:

Based on FPGA’S Balance and exchange principle of area and speed, Using the FPGA internal rich logic resources and powerful hardware characteristics , the traditional median filtering algorithm is reduced to 2 clock cycle , Greatly improving the image processing speed . And by using threshold, in a certain extent, reducing the image fuzzy phenomena brought by the median filter . The results of test show that the system runs stability, the time of achieving the median filtering algorithm are narrowed to the shortest clock cycle.

APA, Harvard, Vancouver, ISO, and other styles

42

Musdalipa, A. Sahari, and A. M. Najar. "Penentuan Jalur Terpendek Pendistribusian Barang Jalur Nugraha Ekakurir (JNE) Menggunakan Algoritma Semut (Studi Kasus JNE Dewi Sartika Palu)." JURNAL ILMIAH MATEMATIKA DAN TERAPAN 18, no. 1 (2021): 84–94. http://dx.doi.org/10.22487/2540766x.2021.v18.i1.15536.

Full text

Abstract:

Nowasday, it is often done traveling from one place or location to another by considering the path or the shortest route to be traveled. In determining the shortest route by implementing the ant algorithm to determine the shottest route. This case is a case of the traveling salesmen problem (TPS) namely visiting all location points starting from the starting point and ending at the starting point again. Case study in this research is delivery data of JNE courier palu. The sample used is 13 points which are then resolved using the ant algorithm adopts the ant work method to get the shortest rou

APA, Harvard, Vancouver, ISO, and other styles

43

Evans, Richard D., and Glenn R. Mueller. "International Real Estate Review." International Real Estate Review 19, no. 3 (2016): 265–96. http://dx.doi.org/10.53383/100223.

Full text

Abstract:

Metro market real estate cycles for office, industrial, retail, apartment, and hotel properties may be specified as first order Markov chains, which allow analysts to use a well-developed application, ¡§staying time¡¨. Anticipations for time spent at each cycle point are consistent with the perception of analysts that these cycle changes speed up, slow down, and pause over time. We find that these five different property types in U.S. markets appear to have different first order Markov chain specifications, with different staying time characteristics. Each of the five property types have their

APA, Harvard, Vancouver, ISO, and other styles

44

Isnaini, Nadia, Khairan Khairan, Meutia Faradhilla, et al. "Evaluation of Physical Quality of Patchouli Oil (Pogostemon cablin Benth.) Body Butter Formulation." Journal of Patchouli and Essential Oil Products 1, no. 1 (2022): 22–25. http://dx.doi.org/10.24815/jpeop.v1i1.23762.

Full text

Abstract:

Patchouli oil (Pogostemon cablin Benth.) has antioxidant and antibacterial activities that can be used as an active ingredient in cosmetic products, such as body butter. Body butter preparations have the highest oil content. Therefore, they usually have the shortest storage period because they can easily damage during the storage period. The study aimed to evaluate the physical quality of patchouli oil body butter formulation in an accelerated stability test process for seven cycles. The formula was tested for its physical stability by organoleptic test, homogeneity, pH, absorption, adhesion,

APA, Harvard, Vancouver, ISO, and other styles

45

Smirnov, Nickolay, Valeriy Nikitin, Elena Mikhalchenko, and Lyuben Stamov. "Modeling a Combustion Chamber of a Pulse Detonation Engine." Fire 6, no. 9 (2023): 335. http://dx.doi.org/10.3390/fire6090335.

Full text

Abstract:

This paper presents the results of numerical simulation of a model combustion chamber of a pulse detonation engine using the authors’ developed software package. The main goal of the present study is to numerically investigate the effects of cyclic operation of pulse detonating chambers, as the former studies have been limited to simulating one cycle. To achieve this goal, a new mathematical model for heavy gas was applied simulating condensed fuel phase, which made it possible to accelerate computations and simulate multi-cycle operation of the device. Distributions of such characteristics as

APA, Harvard, Vancouver, ISO, and other styles

46

Partamies, N., L. Juusola, E. Tanskanen, and K. Kauristie. "Statistical properties of substorms during different storm and solar cycle phases." Annales Geophysicae 31, no. 2 (2013): 349–58. http://dx.doi.org/10.5194/angeo-31-349-2013.

Full text

Abstract:

Abstract. Substorm properties during different storm phases have been studied using an automated recognition of substorm and storm phases in the auroral electrojet (AL) and ring current (Dst) index data from 1995–2009. The large number of events (about 500 storms and 15 000 substorms) provides statistically reliable distributions, average behaviour and long time series of simple parameters, such as durations and intensities. The phases of storms and substorms have been examined independently. Substorm phases have been further combined to single and multi-cycle events. The former consist of one

APA, Harvard, Vancouver, ISO, and other styles

47

Lenart, Łukasz, Błażej Mazur, and Mateusz Pipień. "Statistical analysis of business cycle fluctuations in Poland before and after the crisis." Equilibrium 11, no. 4 (2016): 769. http://dx.doi.org/10.12775/equil.2016.035.

Full text

Abstract:

The main objective of the paper is to investigate properties of business cycles in the Polish economy before and after the recent crisis. The essential issue addressed here is whether there is statistical evidence that the recent crisis has affected the properties of the business cycle fluctuations. In order to improve robustness of the results, we do not confine ourselves to any single inference method, but instead use different groups of statistical tools, including non-parametric methods based on subsampling and parametric Bayesian methods. We examine monthly series of industrial production

APA, Harvard, Vancouver, ISO, and other styles

48

Zia, Firdous, and Gouraw Beohar. "A Study of Rolling Contact Fatigue in Bearings with Rolling Elements." International Journal for Research in Applied Science and Engineering Technology 10, no. 3 (2022): 975–82. http://dx.doi.org/10.22214/ijraset.2022.40791.

Full text

Abstract:

Abstract: Excessive noise levels from wheels and brakes, tire wear levels, bearing hub wear, bearing humming, undercarriage noise, and other factors are considered in this study. According to the study findings, better design and fatigue life prediction are urgently needed to prevent accidents. Because the hub assembly on the left side of the vehicle experiences the most deformation and has the shortest fatigue life, the behavior of the wheel hub ball bearing under duty cycle loading conditions affects deformations and bearing life. Keywords: bearing, fatigue life, Wheel hub, duty cycle

APA, Harvard, Vancouver, ISO, and other styles

49

Bhowmik, B., and Chowdhury S. Nag. "Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths." Engineering, Technology & Applied Science Research 1, no. 4 (2011): 90–97. https://doi.org/10.5281/zenodo.14029.

Full text

Abstract:

In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of  Prograph that speeds up finding the shortest path over prev

APA, Harvard, Vancouver, ISO, and other styles

50

Zhao, Kai, Wenjie Song, Jingen Deng, Qiang Tan, and Xiaoyun Wang. "Evolution Law of Wellbore Instability Risk under Fluctuating Pressure." Energies 16, no. 7 (2023): 2948. http://dx.doi.org/10.3390/en16072948.

Full text

Abstract:

The bottom hole fluctuating pressure has a large influence on the wellbore instability. To address this problem, firstly, according to the principle of seepage mechanics, we established a calculation model of the change in pore pressure around the wellbore radius under fluctuating pressure; then, through laboratory rock mechanics test and rock damage mechanics theory analysis, the change law of formation strength under the action of static hydration and dynamic damage are determined; finally, based on the theory of rock mechanics in porous media, a quantitative evaluation method for the risk o

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!