To see the other types of publications on this topic, follow the link: Resistance distance.

Journal articles on the topic 'Resistance distance'

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 'Resistance distance.'

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

Klein, D. J., and M. Randić. "Resistance distance." Journal of Mathematical Chemistry 12, no. 1 (1993): 81–95. http://dx.doi.org/10.1007/bf01164627.

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

Carmona, A., A. M. Encinas, and M. Mitjana. "Resistance distances on networks." Applicable Analysis and Discrete Mathematics 11, no. 1 (2017): 136–47. http://dx.doi.org/10.2298/aadm1701136c.

Full text
Abstract:
This paper aims to study a family of distances in networks associated with effective resistances. Specifically, we consider the effective resistance distance with respect to a positive parameter and a weight on the vertex set; that is, the effective resistance distance associated with an irreducible and symmetric M-matrix whose lowest eigenvalue is the parameter and the weight function is the associated eigenfunction. The main idea is to consider the network embedded in a host network with additional edges whose conductances are given in terms of the mentioned parameter. The novelty of these d
APA, Harvard, Vancouver, ISO, and other styles
3

Quenneville, J. H. P., and J. G. A. Charron. "Behaviour of single and double 102 mm split ring conneotions loaded in tension." Canadian Journal of Civil Engineering 23, no. 3 (1996): 602–13. http://dx.doi.org/10.1139/l96-869.

Full text
Abstract:
Two experimental studies were undertaken to verify the effect of the end distance on the resistance of single connector joints using 102 mm split rings and the combined effects of timber connector end distance and spacing on the resistance of double connector joints using 102 mm split rings. A total of 108 test specimens were loaded to failure in tension. Sixty of those tests were single connector joints with end distances varying from 80 to 270 mm. The remaining 48 test specimens were double connector joints with split ring end distances varying from 100 to 270 mm and a spacing of either 125
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Haiyan, and Fuji Zhang. "Resistance distance local rules." Journal of Mathematical Chemistry 44, no. 2 (2007): 405–17. http://dx.doi.org/10.1007/s10910-007-9317-8.

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

Du, Junfeng, and Jianhua Tu. "Bicyclic graphs with maximum degree resistance distance." Filomat 30, no. 6 (2016): 1625–32. http://dx.doi.org/10.2298/fil1606625d.

Full text
Abstract:
Graph invariants, based on the distances between the vertices of a graph, are widely used in theoretical chemistry. Recently, Gutman, Feng and Yu (Transactions on Combinatorics, 01 (2012) 27- 40) introduced the degree resistance distance of a graph G, which is defined as DR(G) = ?{u,v}?V(G)[dG(u)+dG(v)]RG(u,v), where dG(u) is the degree of vertex u of the graph G, and RG(u, v) denotes the resistance distance between the vertices u and v of the graph G. Further, they characterized n-vertex unicyclic graphs having minimum and second minimum degree resistance distance. In this paper, we character
APA, Harvard, Vancouver, ISO, and other styles
6

Chu, Longjia, and Tien F. Fwa. "Incorporating Braking Distance Evaluation into Pavement Management System for Safe Road Operation." Transportation Research Record: Journal of the Transportation Research Board 2639, no. 1 (2017): 119–28. http://dx.doi.org/10.3141/2639-15.

Full text
Abstract:
Maintaining a sufficiently short stopping distance is an important requirement for safe road operation. Stopping sight distances of road sections are decided during the highway alignment and roadway geometric design phase of the road development process. A pavement friction coefficient is used in the calculation of the stopping distances. Since pavement friction coefficient deteriorates with time under traffic action, and the available friction also reduces in wet weather, it is important for pavement maintenance engineers to ensure that sufficient skid resistance is maintained under actual op
APA, Harvard, Vancouver, ISO, and other styles
7

Bozzo, Enrico, and Massimo Franceschet. "Resistance distance, closeness, and betweenness." Social Networks 35, no. 3 (2013): 460–69. http://dx.doi.org/10.1016/j.socnet.2013.05.003.

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

Fan, Jiaqi, Jiali Zhu, Li Tian, and Qin Wang. "Resistance Distance in Potting Networks." Physica A: Statistical Mechanics and its Applications 540 (February 2020): 123053. http://dx.doi.org/10.1016/j.physa.2019.123053.

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

Xiao, Wenjun, and Ivan Gutman. "Resistance distance and Laplacian spectrum." Theoretical Chemistry Accounts: Theory, Computation, and Modeling (Theoretica Chimica Acta) 110, no. 4 (2003): 284–89. http://dx.doi.org/10.1007/s00214-003-0460-4.

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

Jones, Paul, and Theodoros M. Bampouras. "Resistance Training for Distance Running." Strength and Conditioning Journal 29, no. 1 (2007): 28–35. http://dx.doi.org/10.1519/00126548-200702000-00005.

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

Lukovits, I., S. Nikoli?, and N. Trinajsti? "Resistance distance in regular graphs." International Journal of Quantum Chemistry 71, no. 3 (1999): 217–25. http://dx.doi.org/10.1002/(sici)1097-461x(1999)71:3<217::aid-qua1>3.0.co;2-c.

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

Devriendt, Karel, Andrea Ottolini, and Stefan Steinerberger. "Graph curvature via resistance distance." Discrete Applied Mathematics 348 (May 2024): 68–78. http://dx.doi.org/10.1016/j.dam.2024.01.012.

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

Gaura, Jan, and Eduard Sojka. "Resistance-Geodesic Distance and Its Use in Image Segmentation." International Journal on Artificial Intelligence Tools 25, no. 05 (2016): 1640002. http://dx.doi.org/10.1142/s0218213016400029.

Full text
Abstract:
Measuring the distance is an important task in many clustering and image-segmentation algorithms. The value of the distance decides whether two image points belong to a single or, respectively, to two different image segments. The Euclidean distance is used quite often. In more complicated cases, measuring the distances along the surface that is defined by the image function may be more appropriate. The geodesic distance, i.e. the shortest path in the corresponding graph, has become popular in this context. The problem is that it is determined on the basis of only one path that can be viewed a
APA, Harvard, Vancouver, ISO, and other styles
14

Chen, Wen Long, Min Liu, Xiao Ling Xiao, and Xin Zhang. "Effect of Spray Distance on the Microstructure and High Temperature Oxidation Resistance of Plasma Spray-Physical Vapor Deposition 7YSZ Thermal Barrier Coating." Materials Science Forum 1035 (June 22, 2021): 511–20. http://dx.doi.org/10.4028/www.scientific.net/msf.1035.511.

Full text
Abstract:
In order to study the effect of spray distance on the structure and high temperature oxidation resistance of feather-columnar thermal barrier coatings, the feather-columnar ZrO2-7wt. % Y2O3 (7YSZ) thermal barrier coatings were prepared at spray distances of 650 mm, 950 mm, 1100 mm, 1250 mm, and 1400 mm by plasma spray-physical vapor deposition (PS-PVD) technology. The surface roughness, micro morphology, and porosity of the sprayed 7YSZ coating were analyzed by 3D surface profiler, SEM, XRD, etc., and the impedance spectrum characteristics of the 7YSZ coating were characterized by electrochemi
APA, Harvard, Vancouver, ISO, and other styles
15

Estrada, Ernesto. "The Resistance Distance Is a Diffusion Distance on a Graph." Mathematics 13, no. 15 (2025): 2380. https://doi.org/10.3390/math13152380.

Full text
Abstract:
The resistance distance is a squared Euclidean metric on the vertices of a graph derived from the consideration of a graph as an electrical circuit. Its connection with the commute time of a random walker on the graph has made it particularly appealing for the analysis of networks. Here, we prove that the resistance distance is given by a difference of “mass concentrations” obtained at the vertices of a graph by a diffusive process. The nature of this diffusive process is characterized here by means of an operator corresponding to the matrix logarithm of a Perron-like matrix based on the pseud
APA, Harvard, Vancouver, ISO, and other styles
16

Wang, Jiancheng, Yajing Guan, Yang Wang, et al. "Establishing an Efficient Way to Utilize the Drought Resistance Germplasm Population in Wheat." Scientific World Journal 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/489583.

Full text
Abstract:
Drought resistance breeding provides a hopeful way to improve yield and quality of wheat in arid and semiarid regions. Constructing core collection is an efficient way to evaluate and utilize drought-resistant germplasm resources in wheat. In the present research, 1,683 wheat varieties were divided into five germplasm groups (high resistant, HR; resistant,R; moderate resistant, MR; susceptible,S; and high susceptible, HS). The least distance stepwise sampling (LDSS) method was adopted to select core accessions. Six commonly used genetic distances (Euclidean distance, Euclid; Standardized Eucli
APA, Harvard, Vancouver, ISO, and other styles
17

Azimi, A., R. B. Bapat, and M. Farrokhi D.G. "Resistance distance of blowups of trees." Discrete Mathematics 344, no. 7 (2021): 112387. http://dx.doi.org/10.1016/j.disc.2021.112387.

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

McCoy, Stephanie. "Distance Learning Resistance in Higher Ed." Women in Higher Education 33, no. 10 (2024): 11. http://dx.doi.org/10.1002/whe.21461.

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

Zhou, Bo, and Nenad Trinajstić. "On resistance-distance and Kirchhoff index." Journal of Mathematical Chemistry 46, no. 1 (2008): 283–89. http://dx.doi.org/10.1007/s10910-008-9459-3.

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

Bapat, R. B., and Somit Gupta. "Resistance distance in wheels and fans." Indian Journal of Pure and Applied Mathematics 41, no. 1 (2010): 1–13. http://dx.doi.org/10.1007/s13226-010-0004-2.

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

Balaji, R., R. B. Bapat, and Shivani Goel. "Resistance distance in directed cactus graphs." Electronic Journal of Linear Algebra 36, no. 36 (2020): 277–92. http://dx.doi.org/10.13001/ela.2020.5093.

Full text
Abstract:
Let $G=(V,E)$ be a strongly connected and balanced digraph with vertex set $V=\{1,\dotsc,n\}$. The classical distance $d_{ij}$ between any two vertices $i$ and $j$ in $G$ is the minimum length of all the directed paths joining $i$ and $j$. The resistance distance (or, simply the resistance) between any two vertices $i$ and $j$ in $V$ is defined by $r_{ij}:=l_{ii}^{\dagger}+l_{jj}^{\dagger}-2l_{ij}^{\dagger}$, where $l_{pq}^{\dagger}$ is the $(p,q)^{\rm th}$ entry of the Moore-Penrose inverse of $L$ which is the Laplacian matrix of $G$. In practice, the resistance $r_{ij}$ is more significant t
APA, Harvard, Vancouver, ISO, and other styles
22

Du, Junfeng, Guifu Su, Jianhua Tu, and Ivan Gutman. "The degree resistance distance of cacti." Discrete Applied Mathematics 188 (June 2015): 16–24. http://dx.doi.org/10.1016/j.dam.2015.02.022.

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

Liu, Jia-Bao, Wen-Rui Wang, Yong-Ming Zhang, and Xiang-Feng Pan. "On degree resistance distance of cacti." Discrete Applied Mathematics 203 (April 2016): 217–25. http://dx.doi.org/10.1016/j.dam.2015.09.006.

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

Balakrishnan, R., S. Krishnamoorthy, and W. So. "Resistance distance in connected balanced digraphs." Discrete Applied Mathematics 337 (October 2023): 46–53. http://dx.doi.org/10.1016/j.dam.2023.04.014.

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

Zhao, Jing, Jia-Bao Liu, and Ali Zafari. "Complete Characterization of Resistance Distance for Linear Octagonal Networks." Complexity 2020 (September 15, 2020): 1–13. http://dx.doi.org/10.1155/2020/5917098.

Full text
Abstract:
Computing the resistance distance of a network is a fundamental and classical topic. In the aspects of considering the resistances between any two points of the lattice networks, there are many studies associated with the ladder networks and ladderlike networks. But the resistances between any two points for more complex structures than ladder networks or ladderlike networks are still unknown. In this paper, a rather complicated structure which is named linear octagonal network is considered. Treelike octagonal systems are cata-condensed systems of octagons, which represent a class of polycycl
APA, Harvard, Vancouver, ISO, and other styles
26

Xu, Kexiang, Hongshuang Liu, Yujun Yang, and Kinkar Das. "The minimal Kirchhoff index of graphs with a given number of cut vertices." Filomat 30, no. 13 (2016): 3451–63. http://dx.doi.org/10.2298/fil1613451x.

Full text
Abstract:
The resistance distance was introduced by Klein and Randic as a generalization of the classical distance. The Kirchhoff index Kf (G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this paper we determine the extremal graphs with minimal Kirchhoff index among all n-vertex graphs with k cut vertices where 1 ? k &lt; n/2.
APA, Harvard, Vancouver, ISO, and other styles
27

Wang, Weizhong, and Tingyan Ma. "Resistance distance and Kirchhoff index of two kinds of double join operations on graphs." Discrete Mathematics and Applications 34, no. 5 (2024): 303–16. http://dx.doi.org/10.1515/dma-2024-0027.

Full text
Abstract:
Abstract Let G be a connected graph. The resistance distance between any two vertices of G is defined to be the network effective resistance between them if each edge of G is replaced by a unit resistor. The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices of G. In this paper, we determine the resistance distance and Kirchhoff index of the subdivision double join GS ∨ {G 1, G 2} and R-graph double join GR ∨ {G 1, G 2} for a regular graph G and two arbitrary graphs G 1, G 2, respectively.
APA, Harvard, Vancouver, ISO, and other styles
28

Shangguan, Yingmin, and Haiyan Chen. "Resistance Distances in Vertex-Face Graphs." Zeitschrift für Naturforschung A 73, no. 2 (2018): 105–12. http://dx.doi.org/10.1515/zna-2017-0370.

Full text
Abstract:
AbstractThe computation of two-point resistances in networks is a classical problem in electric circuit theory and graph theory. Let G be a triangulation graph with n vertices embedded on an orientable surface. Define K(G) to be the graph obtained from G by inserting a new vertex vϕ to each face ϕ of G and adding three new edges (u, vϕ), (v, vϕ) and (w, vϕ), where u, v and w are three vertices on the boundary of ϕ. In this paper, using star-triangle transformation and resistance local-sum rules, explicit relations between resistance distances in K(G) and those in G are obtained. These relation
APA, Harvard, Vancouver, ISO, and other styles
29

Akara-pipattana, Pawat, Thiparat Chotibut, and Oleg Evnin. "Resistance distance distribution in large sparse random graphs." Journal of Statistical Mechanics: Theory and Experiment 2022, no. 3 (2022): 033404. http://dx.doi.org/10.1088/1742-5468/ac57ba.

Full text
Abstract:
Abstract We consider an Erdős–Rényi random graph consisting of N vertices connected by randomly and independently drawing an edge between every pair of them with probability c/N so that at N → ∞ one obtains a graph of finite mean degree c. In this regime, we study the distribution of resistance distances between the vertices of this graph and develop an auxiliary field representation for this quantity in the spirit of statistical field theory. Using this representation, a saddle point evaluation of the resistance distance distribution is possible at N → ∞ in terms of an 1/c expansion. The lead
APA, Harvard, Vancouver, ISO, and other styles
30

Xie, Chang, Li Zhou, Mingfeng Lu, Shifeng Ding, and Xu Zhou. "Numerical Simulation Study on Ship–Ship Interference in Formation Navigation in Full-Scale Brash Ice Channels." Journal of Marine Science and Engineering 11, no. 7 (2023): 1376. http://dx.doi.org/10.3390/jmse11071376.

Full text
Abstract:
Formation navigation in brash ice channels is increasingly utilized by merchant vessels in the Arctic and Baltic Sea, offering benefits such as improved efficiency and reduced carbon emissions. However, ship–ship interference poses a significant challenge to this method, impacting resistance performance. This paper presents full-scale simulations using the CFD–DEM coupling method in brash ice channels, which is validated by comparing simulation results with ice tank measurements. By varying the distance between two ships from 0.05 to 5 ship lengths, ship–ship interference in full-scale brash i
APA, Harvard, Vancouver, ISO, and other styles
31

Bai, Dikai, Weili Wu, and Puwei Yang. "Research on fault location and distance measurement methods for low current grounding systems in short distances." Journal of Physics: Conference Series 2849, no. 1 (2024): 012047. http://dx.doi.org/10.1088/1742-6596/2849/1/012047.

Full text
Abstract:
Abstract As the scale of the power system continues to expand, the quality of the power source is crucial to the stable operation of the electric network, making the automation of feeders an inevitable trend in power system development. In this context, this paper takes errors in low current grounding systems as a research subject. The mechanism of grounding fault occurrence is analyzed first, followed by the functional modeling of fault voltage and current, and a formulation describing changes in resistance at the fault point is provided. Subsequently, a neural network-based fault distance me
APA, Harvard, Vancouver, ISO, and other styles
32

Ivanchenko, Aleхandr. "GRAPH ISOMORPHISM CRITERION BASED ON RESISTANCE DISTANCE." University News. North-Caucasian Region. Technical Sciences Series, no. 2 (June 2020): 13–18. http://dx.doi.org/10.17213/1560-3644-2020-2-13-18.

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

Bapat, Ravindra B., Ivan Gutmana, and Wenjun Xiao. "A Simple Method for Computing Resistance Distance." Zeitschrift für Naturforschung A 58, no. 9-10 (2003): 494–98. http://dx.doi.org/10.1515/zna-2003-9-1003.

Full text
Abstract:
The resistance distance ri j between two vertices vi and vj of a (connected, molecular) graph G is equal to the effective resistance between the respective two points of an electrical network, constructed so as to correspond to G, such that the resistance of any edge is unity. We show how rij can be computed from the Laplacian matrix L of the graph G: Let L(i) and L(i, j) be obtained from L by deleting its i-th row and column, and by deleting its i-th and j-th rows and columns, respectively. Then rij = detL(i, j)/detL(i).
APA, Harvard, Vancouver, ISO, and other styles
34

Ni, Qi, Xiang-Feng Pan, and Huan Zhou. "Resistance distance in generalized core–satellite graphs." Discrete Applied Mathematics 362 (February 2025): 100–108. http://dx.doi.org/10.1016/j.dam.2024.11.011.

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

Yang, Yujun, and Heping Zhang. "Some rules on resistance distance with applications." Journal of Physics A: Mathematical and Theoretical 41, no. 44 (2008): 445203. http://dx.doi.org/10.1088/1751-8113/41/44/445203.

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

Walikar, H. B., D. N. Misale, R. L. Patil, and H. S. Ramane. "On the Resistance Distance of a Tree." Electronic Notes in Discrete Mathematics 15 (May 2003): 244–45. http://dx.doi.org/10.1016/s1571-0653(04)00596-7.

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

Zhu, Zhongxun, and Fangguo He. "Some Properties on Resistance Distance Spectral Radius." Bulletin of the Iranian Mathematical Society 46, no. 1 (2019): 137–47. http://dx.doi.org/10.1007/s41980-019-00246-y.

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

Chen, Haiyan, and Fuji Zhang. "Resistance distance and the normalized Laplacian spectrum." Discrete Applied Mathematics 155, no. 5 (2007): 654–61. http://dx.doi.org/10.1016/j.dam.2006.09.008.

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

Gervacio, Severino V. "Resistance distance in complete n-partite graphs." Discrete Applied Mathematics 203 (April 2016): 53–61. http://dx.doi.org/10.1016/j.dam.2015.09.017.

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

He, Fangguo, and Zhongxun Zhu. "Cacti with maximum eccentricity resistance-distance sum." Discrete Applied Mathematics 219 (March 2017): 117–25. http://dx.doi.org/10.1016/j.dam.2016.10.032.

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

Barrett, Wayne, Emily J. Evans, and Amanda E. Francis. "Resistance distance in straight linear 2-trees." Discrete Applied Mathematics 258 (April 2019): 13–34. http://dx.doi.org/10.1016/j.dam.2018.10.043.

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

Palacios, Jos� Luis. "Resistance distance in graphs and random walks." International Journal of Quantum Chemistry 81, no. 1 (2000): 29–33. http://dx.doi.org/10.1002/1097-461x(2001)81:1<29::aid-qua6>3.0.co;2-y.

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

Li, Min, Shuming Zhou, Dajin Wang, and Gaolin Chen. "Identifying influential nodes based on resistance distance." Journal of Computational Science 67 (March 2023): 101972. http://dx.doi.org/10.1016/j.jocs.2023.101972.

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

Zhang, Yuqing, and Xiaoling Ma. "On the Normalized Laplacian Spectrum of the Linear Pentagonal Derivation Chain and Its Application." Axioms 12, no. 10 (2023): 945. http://dx.doi.org/10.3390/axioms12100945.

Full text
Abstract:
A novel distance function named resistance distance was introduced on the basis of electrical network theory. The resistance distance between any two vertices u and v in graph G is defined to be the effective resistance between them when unit resistors are placed on every edge of G. The degree-Kirchhoff index of G is the sum of the product of resistance distances and degrees between all pairs of vertices of G. In this article, according to the decomposition theorem for the normalized Laplacian polynomial of the linear pentagonal derivation chain QPn, the normalize Laplacian spectrum of QPn is
APA, Harvard, Vancouver, ISO, and other styles
45

Biggs, Norman L. "Potential Theory on Distance-Regular Graphs." Combinatorics, Probability and Computing 2, no. 3 (1993): 243–55. http://dx.doi.org/10.1017/s096354830000064x.

Full text
Abstract:
A graph may be regarded as an electrical network in which each edge has unit resistance. We obtain explicit formulae for the effective resistance of the network when a current enters at one vertex and leaves at another in the distance-regular case. A well-known link with random walks motivates a conjecture about the maximum effective resistance. Arguments are given that point to the truth of the conjecture for all known distance-regular graphs.
APA, Harvard, Vancouver, ISO, and other styles
46

Coetzer, P., T. D. Noakes, B. Sanders, et al. "Superior fatigue resistance of elite black South African distance runners." Journal of Applied Physiology 75, no. 4 (1993): 1822–27. http://dx.doi.org/10.1152/jappl.1993.75.4.1822.

Full text
Abstract:
Black athletes currently dominate long-distance running events in South Africa. In an attempt to explain an apparently superior running ability of black South African athletes at distances &gt; 3 km, we compared physiological measurements in the fastest 9 white and 11 black South African middle-to long-distance runners. Whereas both groups ran at a similar percentage of maximal O2 uptake (%VO2max) over 1.65#x2013;5 km, the %VO2max sustained by black athletes was greater than that of white athletes at distances &gt; 5 km (P &lt; 0.001). Although both groups had similar training volumes, black a
APA, Harvard, Vancouver, ISO, and other styles
47

Ainah, Priye Kenneth, and Sunday Ugemuge. "Impact of Fault Resistance on Distance Relaying of Ahoada-Yenagoa Transmission Line Using Neplan." Journal of Engineering Research and Reports 26, no. 4 (2024): 73–84. http://dx.doi.org/10.9734/jerr/2024/v26i41115.

Full text
Abstract:
Relay protection schemes play a vital part in guaranteeing reliability and integrity of electrical power networks by promptly detecting and isolating faults in the transmission network. Fault resistance encountered during a fault event, is a crucial parameter that significantly influences the effectiveness of relay protection systems. This paper investigates the performance of a distance relying system under different fault resistance using NEPLAN software environment on a 46-km Ahoada to Yenagoa transmission line. The performance of the distance protection relaying system under single line to
APA, Harvard, Vancouver, ISO, and other styles
48

Makarova, Natalya V. "Relations between Concrete Structural Parameters and Abrasion Resistance." Applied Mechanics and Materials 357-360 (August 2013): 1259–62. http://dx.doi.org/10.4028/www.scientific.net/amm.357-360.1259.

Full text
Abstract:
The concrete surfaces after abrasion wear test have been characterized by structural parameters, such as mean inter-particle distance; mean coast aggregates diameter, its area fraction, and matrix hardness. The specific method to obtain the inter-particle distances was developed. From regression analyses it has become evident that wear effects arising from coast aggregate fraction and their geometrical parameters surpass the influence of matrix hardness.
APA, Harvard, Vancouver, ISO, and other styles
49

Beherskyi, Dmytro, Ivan Vitiuk, Andrii Koval, Andrii Golubovskyi, and Mykhailo Perehuda. "Justification of choosing a reasonable distance between the driver’s cabin and the semi-trailer to reduce the aerodynamic resistance of the vehicle." Eastern-European Journal of Enterprise Technologies 1, no. 1 (133) (2025): 44–51. https://doi.org/10.15587/1729-4061.2025.320494.

Full text
Abstract:
The object of the study is the aerodynamic resistance of a main road train and its influence on the efficiency of the transportation process. Reducing the aerodynamic resistance of road trains is an important problem, since fuel consumption and transportation efficiency depend on it. A 2 % reduction in aerodynamic drag reduces fuel consumption by 1 %. Reduction of aerodynamic resistance is achieved by using special aerodynamic devices. But their use creates a number of problems – an increase in the weight of the road train and its overall dimensions, etc. It is assumed that by choosing a ratio
APA, Harvard, Vancouver, ISO, and other styles
50

Wagenvoort, Marinus, and Ewa Zimnoch-Guzowska. "Gene-centromere mapping in potato by half-tetrad analysis: map distances of H1, Rx, and Ry and their possible use for ascertaining the mode of 2n-pollen formation." Genome 35, no. 1 (1992): 1–7. http://dx.doi.org/10.1139/g92-001.

Full text
Abstract:
Diploids from the tetraploid potato varieties 'Alcmaria' and 'Pansta' and from the tetraploid CPRO genotypes Y66-13-610 and Y66-13-636 were used in half-tetrad analyses to estimate the gene-centromere map distances of the genes Rx, Ry, and H1. Employing tetraploid progeny from 2x (second division restitution) – 4x testcrosses the gene-centromere map distance of H1, conferring resistance to pathotype Ro1 of Globodera rostochiensis, was estimated to be 16.3 centimorgans (cM). For Rχ, conferring extreme resistance to potato virus X (PVX), a map distance of 33.9 cM was estimated. The gene Ry, conf
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!